./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 84cfde4a Calling Ultimate with: /root/.sdkman/candidates/java/current/bin/java -Dosgi.configuration.area=/storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/data/config -Xmx15G -Xms4m -jar /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/plugins/org.eclipse.equinox.launcher_1.5.800.v20200727-1323.jar -data @noDefault -ultimatedata /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/data -tc /storage/repos/ultimate-clean/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-clean/releaseScripts/default/UAutomizer-linux/config/svcomp-DerefFreeMemtrack-32bit-Automizer_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /storage/repos/ultimate-clean/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-dev-84cfde4 [2024-10-11 18:01:33,345 INFO L188 SettingsManager]: Resetting all preferences to default values... [2024-10-11 18:01:33,424 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/config/svcomp-DerefFreeMemtrack-32bit-Automizer_Default.epf [2024-10-11 18:01:33,429 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2024-10-11 18:01:33,430 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2024-10-11 18:01:33,471 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2024-10-11 18:01:33,475 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2024-10-11 18:01:33,476 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2024-10-11 18:01:33,477 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2024-10-11 18:01:33,478 INFO L153 SettingsManager]: * Use memory slicer=true [2024-10-11 18:01:33,479 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2024-10-11 18:01:33,479 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2024-10-11 18:01:33,480 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2024-10-11 18:01:33,480 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2024-10-11 18:01:33,483 INFO L153 SettingsManager]: * Use SBE=true [2024-10-11 18:01:33,484 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2024-10-11 18:01:33,484 INFO L153 SettingsManager]: * sizeof long=4 [2024-10-11 18:01:33,484 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2024-10-11 18:01:33,485 INFO L153 SettingsManager]: * sizeof POINTER=4 [2024-10-11 18:01:33,485 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2024-10-11 18:01:33,485 INFO L153 SettingsManager]: * Check for the main procedure if all allocated memory was freed=true [2024-10-11 18:01:33,486 INFO L153 SettingsManager]: * Bitprecise bitfields=true [2024-10-11 18:01:33,486 INFO L153 SettingsManager]: * SV-COMP memtrack compatibility mode=true [2024-10-11 18:01:33,487 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2024-10-11 18:01:33,487 INFO L153 SettingsManager]: * Adapt memory model on pointer casts if necessary=true [2024-10-11 18:01:33,487 INFO L153 SettingsManager]: * Allow undefined functions=false [2024-10-11 18:01:33,488 INFO L153 SettingsManager]: * Check unreachability of reach_error function=false [2024-10-11 18:01:33,492 INFO L153 SettingsManager]: * sizeof long double=12 [2024-10-11 18:01:33,493 INFO L153 SettingsManager]: * Use constant arrays=true [2024-10-11 18:01:33,493 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2024-10-11 18:01:33,493 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2024-10-11 18:01:33,494 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2024-10-11 18:01:33,494 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2024-10-11 18:01:33,494 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-10-11 18:01:33,494 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2024-10-11 18:01:33,495 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2024-10-11 18:01:33,495 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2024-10-11 18:01:33,495 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2024-10-11 18:01:33,495 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2024-10-11 18:01:33,496 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2024-10-11 18:01:33,496 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2024-10-11 18:01:33,500 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2024-10-11 18:01:33,500 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-clean/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-clean/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-11 18:01:33,802 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2024-10-11 18:01:33,828 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2024-10-11 18:01:33,831 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2024-10-11 18:01:33,832 INFO L270 PluginConnector]: Initializing CDTParser... [2024-10-11 18:01:33,833 INFO L274 PluginConnector]: CDTParser initialized [2024-10-11 18:01:33,834 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/memsafety-bftpd/bftpd_2.i [2024-10-11 18:01:35,489 INFO L533 CDTParser]: Created temporary CDT project at NULL [2024-10-11 18:01:35,747 INFO L384 CDTParser]: Found 1 translation units. [2024-10-11 18:01:35,748 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/memsafety-bftpd/bftpd_2.i [2024-10-11 18:01:35,766 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/data/841fe9218/489f8508711348c4a45a9de48cca54d6/FLAG405cef898 [2024-10-11 18:01:36,056 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/data/841fe9218/489f8508711348c4a45a9de48cca54d6 [2024-10-11 18:01:36,059 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2024-10-11 18:01:36,061 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2024-10-11 18:01:36,063 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2024-10-11 18:01:36,063 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2024-10-11 18:01:36,068 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2024-10-11 18:01:36,069 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 11.10 06:01:36" (1/1) ... [2024-10-11 18:01:36,069 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@64aa3393 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 06:01:36, skipping insertion in model container [2024-10-11 18:01:36,069 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 11.10 06:01:36" (1/1) ... [2024-10-11 18:01:36,120 INFO L175 MainTranslator]: Built tables and reachable declarations [2024-10-11 18:01:36,530 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-10-11 18:01:36,551 INFO L200 MainTranslator]: Completed pre-run [2024-10-11 18:01:36,601 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-10-11 18:01:36,648 INFO L204 MainTranslator]: Completed translation [2024-10-11 18:01:36,649 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 06:01:36 WrapperNode [2024-10-11 18:01:36,649 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2024-10-11 18:01:36,651 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2024-10-11 18:01:36,651 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2024-10-11 18:01:36,652 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2024-10-11 18:01:36,659 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 06:01:36" (1/1) ... [2024-10-11 18:01:36,679 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 06:01:36" (1/1) ... [2024-10-11 18:01:36,714 INFO L138 Inliner]: procedures = 168, calls = 42, calls flagged for inlining = 5, calls inlined = 5, statements flattened = 95 [2024-10-11 18:01:36,715 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2024-10-11 18:01:36,715 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2024-10-11 18:01:36,716 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2024-10-11 18:01:36,716 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2024-10-11 18:01:36,730 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 06:01:36" (1/1) ... [2024-10-11 18:01:36,731 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 06:01:36" (1/1) ... [2024-10-11 18:01:36,737 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 06:01:36" (1/1) ... [2024-10-11 18:01:36,760 INFO L175 MemorySlicer]: Split 24 memory accesses to 3 slices as follows [9, 6, 9]. 38 percent of accesses are in the largest equivalence class. The 21 initializations are split as follows [6, 6, 9]. The 0 writes are split as follows [0, 0, 0]. [2024-10-11 18:01:36,760 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 06:01:36" (1/1) ... [2024-10-11 18:01:36,760 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 06:01:36" (1/1) ... [2024-10-11 18:01:36,768 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 06:01:36" (1/1) ... [2024-10-11 18:01:36,774 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 06:01:36" (1/1) ... [2024-10-11 18:01:36,776 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 06:01:36" (1/1) ... [2024-10-11 18:01:36,778 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 06:01:36" (1/1) ... [2024-10-11 18:01:36,785 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2024-10-11 18:01:36,790 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2024-10-11 18:01:36,790 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2024-10-11 18:01:36,791 INFO L274 PluginConnector]: RCFGBuilder initialized [2024-10-11 18:01:36,792 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 06:01:36" (1/1) ... [2024-10-11 18:01:36,801 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-10-11 18:01:36,814 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 [2024-10-11 18:01:36,834 INFO L229 MonitoredProcess]: Starting monitored process 1 with /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (exit command is (exit), workingDir is null) [2024-10-11 18:01:36,840 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Waiting until timeout for monitored process [2024-10-11 18:01:36,896 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#0 [2024-10-11 18:01:36,896 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#1 [2024-10-11 18:01:36,897 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#2 [2024-10-11 18:01:36,897 INFO L130 BoogieDeclarations]: Found specification of procedure parse_input [2024-10-11 18:01:36,897 INFO L138 BoogieDeclarations]: Found implementation of procedure parse_input [2024-10-11 18:01:36,898 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnHeap [2024-10-11 18:01:36,898 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2024-10-11 18:01:36,898 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$#0 [2024-10-11 18:01:36,898 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$#1 [2024-10-11 18:01:36,898 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$#2 [2024-10-11 18:01:36,898 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2024-10-11 18:01:36,901 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~$Pointer$#0 [2024-10-11 18:01:36,901 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~$Pointer$#1 [2024-10-11 18:01:36,901 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~$Pointer$#2 [2024-10-11 18:01:36,901 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#0 [2024-10-11 18:01:36,901 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#1 [2024-10-11 18:01:36,901 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#2 [2024-10-11 18:01:36,901 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2024-10-11 18:01:36,902 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2024-10-11 18:01:37,030 INFO L238 CfgBuilder]: Building ICFG [2024-10-11 18:01:37,032 INFO L264 CfgBuilder]: Building CFG for each procedure with an implementation [2024-10-11 18:01:37,367 INFO L? ?]: Removed 34 outVars from TransFormulas that were not future-live. [2024-10-11 18:01:37,367 INFO L287 CfgBuilder]: Performing block encoding [2024-10-11 18:01:37,413 INFO L309 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2024-10-11 18:01:37,414 INFO L314 CfgBuilder]: Removed 1 assume(true) statements. [2024-10-11 18:01:37,414 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 11.10 06:01:37 BoogieIcfgContainer [2024-10-11 18:01:37,414 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2024-10-11 18:01:37,417 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2024-10-11 18:01:37,417 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2024-10-11 18:01:37,421 INFO L274 PluginConnector]: TraceAbstraction initialized [2024-10-11 18:01:37,421 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 11.10 06:01:36" (1/3) ... [2024-10-11 18:01:37,422 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@452b5081 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 11.10 06:01:37, skipping insertion in model container [2024-10-11 18:01:37,422 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 06:01:36" (2/3) ... [2024-10-11 18:01:37,422 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@452b5081 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 11.10 06:01:37, skipping insertion in model container [2024-10-11 18:01:37,423 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 11.10 06:01:37" (3/3) ... [2024-10-11 18:01:37,424 INFO L112 eAbstractionObserver]: Analyzing ICFG bftpd_2.i [2024-10-11 18:01:37,449 INFO L209 ceAbstractionStarter]: Automizer settings: Hoare:None NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2024-10-11 18:01:37,449 INFO L149 ceAbstractionStarter]: Applying trace abstraction to program that has 20 error locations. [2024-10-11 18:01:37,510 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2024-10-11 18:01:37,521 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;@2aaf7e99, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2024-10-11 18:01:37,522 INFO L334 AbstractCegarLoop]: Starting to check reachability of 20 error locations. [2024-10-11 18:01:37,527 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-11 18:01:37,536 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 6 [2024-10-11 18:01:37,538 INFO L207 NwaCegarLoop]: Found error trace [2024-10-11 18:01:37,539 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1] [2024-10-11 18:01:37,539 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-11 18:01:37,545 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-11 18:01:37,545 INFO L85 PathProgramCache]: Analyzing trace with hash 131378568, now seen corresponding path program 1 times [2024-10-11 18:01:37,556 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-11 18:01:37,557 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1327256009] [2024-10-11 18:01:37,557 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 18:01:37,558 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-11 18:01:37,670 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 18:01:37,929 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-11 18:01:37,930 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-11 18:01:37,931 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1327256009] [2024-10-11 18:01:37,931 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1327256009] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-11 18:01:37,931 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-11 18:01:37,932 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-10-11 18:01:37,933 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [384600091] [2024-10-11 18:01:37,934 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-11 18:01:37,937 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-10-11 18:01:37,937 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-11 18:01:37,965 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-10-11 18:01:37,965 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2024-10-11 18:01:37,967 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-11 18:01:38,136 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-11 18:01:38,137 INFO L93 Difference]: Finished difference Result 121 states and 142 transitions. [2024-10-11 18:01:38,141 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-10-11 18:01:38,142 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-11 18:01:38,142 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-11 18:01:38,152 INFO L225 Difference]: With dead ends: 121 [2024-10-11 18:01:38,152 INFO L226 Difference]: Without dead ends: 118 [2024-10-11 18:01:38,154 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-11 18:01:38,158 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-11 18:01:38,161 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-11 18:01:38,177 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 118 states. [2024-10-11 18:01:38,204 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 118 to 92. [2024-10-11 18:01:38,206 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-11 18:01:38,209 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 92 states to 92 states and 123 transitions. [2024-10-11 18:01:38,211 INFO L78 Accepts]: Start accepts. Automaton has 92 states and 123 transitions. Word has length 5 [2024-10-11 18:01:38,211 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-11 18:01:38,211 INFO L471 AbstractCegarLoop]: Abstraction has 92 states and 123 transitions. [2024-10-11 18:01:38,211 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-11 18:01:38,212 INFO L276 IsEmpty]: Start isEmpty. Operand 92 states and 123 transitions. [2024-10-11 18:01:38,212 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 6 [2024-10-11 18:01:38,212 INFO L207 NwaCegarLoop]: Found error trace [2024-10-11 18:01:38,212 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1] [2024-10-11 18:01:38,213 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2024-10-11 18:01:38,213 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-11 18:01:38,214 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-11 18:01:38,214 INFO L85 PathProgramCache]: Analyzing trace with hash 131378569, now seen corresponding path program 1 times [2024-10-11 18:01:38,214 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-11 18:01:38,214 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1165070665] [2024-10-11 18:01:38,215 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 18:01:38,215 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-11 18:01:38,240 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 18:01:38,408 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-11 18:01:38,409 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-11 18:01:38,409 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1165070665] [2024-10-11 18:01:38,409 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1165070665] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-11 18:01:38,409 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-11 18:01:38,410 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-10-11 18:01:38,410 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1358681142] [2024-10-11 18:01:38,410 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-11 18:01:38,411 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2024-10-11 18:01:38,412 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-11 18:01:38,413 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2024-10-11 18:01:38,414 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2024-10-11 18:01:38,414 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-11 18:01:38,576 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-11 18:01:38,576 INFO L93 Difference]: Finished difference Result 191 states and 265 transitions. [2024-10-11 18:01:38,577 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-10-11 18:01:38,578 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-11 18:01:38,578 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-11 18:01:38,580 INFO L225 Difference]: With dead ends: 191 [2024-10-11 18:01:38,580 INFO L226 Difference]: Without dead ends: 191 [2024-10-11 18:01:38,580 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-11 18:01:38,581 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-11 18:01:38,582 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-11 18:01:38,587 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 191 states. [2024-10-11 18:01:38,602 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 191 to 168. [2024-10-11 18:01:38,603 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-11 18:01:38,606 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 168 states to 168 states and 261 transitions. [2024-10-11 18:01:38,607 INFO L78 Accepts]: Start accepts. Automaton has 168 states and 261 transitions. Word has length 5 [2024-10-11 18:01:38,607 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-11 18:01:38,607 INFO L471 AbstractCegarLoop]: Abstraction has 168 states and 261 transitions. [2024-10-11 18:01:38,607 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-11 18:01:38,607 INFO L276 IsEmpty]: Start isEmpty. Operand 168 states and 261 transitions. [2024-10-11 18:01:38,607 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 7 [2024-10-11 18:01:38,608 INFO L207 NwaCegarLoop]: Found error trace [2024-10-11 18:01:38,608 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1] [2024-10-11 18:01:38,608 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2024-10-11 18:01:38,608 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-11 18:01:38,609 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-11 18:01:38,609 INFO L85 PathProgramCache]: Analyzing trace with hash -222231707, now seen corresponding path program 1 times [2024-10-11 18:01:38,609 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-11 18:01:38,609 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1012953914] [2024-10-11 18:01:38,610 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 18:01:38,610 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-11 18:01:38,634 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 18:01:38,861 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-11 18:01:38,862 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-11 18:01:38,862 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1012953914] [2024-10-11 18:01:38,863 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1012953914] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-11 18:01:38,863 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-11 18:01:38,863 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-10-11 18:01:38,864 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [163477466] [2024-10-11 18:01:38,864 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-11 18:01:38,864 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2024-10-11 18:01:38,865 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-11 18:01:38,866 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2024-10-11 18:01:38,866 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2024-10-11 18:01:38,867 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-11 18:01:39,025 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-11 18:01:39,026 INFO L93 Difference]: Finished difference Result 208 states and 300 transitions. [2024-10-11 18:01:39,026 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-10-11 18:01:39,026 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-11 18:01:39,027 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-11 18:01:39,029 INFO L225 Difference]: With dead ends: 208 [2024-10-11 18:01:39,029 INFO L226 Difference]: Without dead ends: 208 [2024-10-11 18:01:39,030 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-11 18:01:39,031 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.1s IncrementalHoareTripleChecker+Time [2024-10-11 18:01:39,031 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.1s Time] [2024-10-11 18:01:39,032 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 208 states. [2024-10-11 18:01:39,045 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 208 to 171. [2024-10-11 18:01:39,046 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-11 18:01:39,048 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 171 states to 171 states and 264 transitions. [2024-10-11 18:01:39,048 INFO L78 Accepts]: Start accepts. Automaton has 171 states and 264 transitions. Word has length 6 [2024-10-11 18:01:39,049 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-11 18:01:39,049 INFO L471 AbstractCegarLoop]: Abstraction has 171 states and 264 transitions. [2024-10-11 18:01:39,049 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-11 18:01:39,049 INFO L276 IsEmpty]: Start isEmpty. Operand 171 states and 264 transitions. [2024-10-11 18:01:39,050 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 8 [2024-10-11 18:01:39,050 INFO L207 NwaCegarLoop]: Found error trace [2024-10-11 18:01:39,050 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1] [2024-10-11 18:01:39,050 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2024-10-11 18:01:39,051 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-11 18:01:39,051 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-11 18:01:39,052 INFO L85 PathProgramCache]: Analyzing trace with hash 1700751720, now seen corresponding path program 1 times [2024-10-11 18:01:39,052 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-11 18:01:39,052 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [223799255] [2024-10-11 18:01:39,052 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 18:01:39,053 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-11 18:01:39,070 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 18:01:39,262 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-11 18:01:39,263 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-11 18:01:39,263 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [223799255] [2024-10-11 18:01:39,263 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [223799255] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-11 18:01:39,264 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-11 18:01:39,264 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-10-11 18:01:39,264 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [848133067] [2024-10-11 18:01:39,264 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-11 18:01:39,265 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2024-10-11 18:01:39,265 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-11 18:01:39,266 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2024-10-11 18:01:39,266 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2024-10-11 18:01:39,266 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-11 18:01:39,404 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-11 18:01:39,404 INFO L93 Difference]: Finished difference Result 193 states and 266 transitions. [2024-10-11 18:01:39,405 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-10-11 18:01:39,405 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-11 18:01:39,405 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-11 18:01:39,406 INFO L225 Difference]: With dead ends: 193 [2024-10-11 18:01:39,406 INFO L226 Difference]: Without dead ends: 193 [2024-10-11 18:01:39,407 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-11 18:01:39,407 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-11 18:01:39,408 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-11 18:01:39,411 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 193 states. [2024-10-11 18:01:39,421 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 193 to 171. [2024-10-11 18:01:39,422 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-11 18:01:39,424 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 171 states to 171 states and 262 transitions. [2024-10-11 18:01:39,424 INFO L78 Accepts]: Start accepts. Automaton has 171 states and 262 transitions. Word has length 7 [2024-10-11 18:01:39,425 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-11 18:01:39,425 INFO L471 AbstractCegarLoop]: Abstraction has 171 states and 262 transitions. [2024-10-11 18:01:39,425 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-11 18:01:39,425 INFO L276 IsEmpty]: Start isEmpty. Operand 171 states and 262 transitions. [2024-10-11 18:01:39,426 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 9 [2024-10-11 18:01:39,426 INFO L207 NwaCegarLoop]: Found error trace [2024-10-11 18:01:39,426 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1] [2024-10-11 18:01:39,426 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2024-10-11 18:01:39,427 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-11 18:01:39,427 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-11 18:01:39,427 INFO L85 PathProgramCache]: Analyzing trace with hash 1183695815, now seen corresponding path program 1 times [2024-10-11 18:01:39,428 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-11 18:01:39,428 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1306036238] [2024-10-11 18:01:39,428 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 18:01:39,428 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-11 18:01:39,437 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 18:01:39,507 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-11 18:01:39,508 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-11 18:01:39,508 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1306036238] [2024-10-11 18:01:39,508 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1306036238] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-11 18:01:39,508 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-11 18:01:39,508 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-10-11 18:01:39,509 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [284524838] [2024-10-11 18:01:39,509 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-11 18:01:39,509 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2024-10-11 18:01:39,510 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-11 18:01:39,511 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2024-10-11 18:01:39,511 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2024-10-11 18:01:39,511 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-11 18:01:39,609 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-11 18:01:39,611 INFO L93 Difference]: Finished difference Result 250 states and 344 transitions. [2024-10-11 18:01:39,611 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-10-11 18:01:39,612 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-11 18:01:39,612 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-11 18:01:39,613 INFO L225 Difference]: With dead ends: 250 [2024-10-11 18:01:39,615 INFO L226 Difference]: Without dead ends: 250 [2024-10-11 18:01:39,615 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-11 18:01:39,616 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-11 18:01:39,616 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-11 18:01:39,621 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 250 states. [2024-10-11 18:01:39,630 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 250 to 207. [2024-10-11 18:01:39,631 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-11 18:01:39,633 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 207 states to 207 states and 312 transitions. [2024-10-11 18:01:39,633 INFO L78 Accepts]: Start accepts. Automaton has 207 states and 312 transitions. Word has length 8 [2024-10-11 18:01:39,633 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-11 18:01:39,634 INFO L471 AbstractCegarLoop]: Abstraction has 207 states and 312 transitions. [2024-10-11 18:01:39,634 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-11 18:01:39,634 INFO L276 IsEmpty]: Start isEmpty. Operand 207 states and 312 transitions. [2024-10-11 18:01:39,634 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 10 [2024-10-11 18:01:39,635 INFO L207 NwaCegarLoop]: Found error trace [2024-10-11 18:01:39,635 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-11 18:01:39,635 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2024-10-11 18:01:39,635 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-11 18:01:39,636 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-11 18:01:39,636 INFO L85 PathProgramCache]: Analyzing trace with hash -1960135350, now seen corresponding path program 1 times [2024-10-11 18:01:39,636 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-11 18:01:39,636 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [114905368] [2024-10-11 18:01:39,636 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 18:01:39,637 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-11 18:01:39,646 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 18:01:39,759 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-11 18:01:39,760 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-11 18:01:39,760 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [114905368] [2024-10-11 18:01:39,760 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [114905368] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-11 18:01:39,760 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-11 18:01:39,760 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-10-11 18:01:39,760 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1901515866] [2024-10-11 18:01:39,760 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-11 18:01:39,761 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2024-10-11 18:01:39,761 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-11 18:01:39,761 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2024-10-11 18:01:39,761 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2024-10-11 18:01:39,762 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-11 18:01:39,860 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-11 18:01:39,860 INFO L93 Difference]: Finished difference Result 245 states and 327 transitions. [2024-10-11 18:01:39,864 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-10-11 18:01:39,864 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-11 18:01:39,864 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-11 18:01:39,866 INFO L225 Difference]: With dead ends: 245 [2024-10-11 18:01:39,866 INFO L226 Difference]: Without dead ends: 245 [2024-10-11 18:01:39,866 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-11 18:01:39,867 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-11 18:01:39,870 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-11 18:01:39,870 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 245 states. [2024-10-11 18:01:39,881 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 245 to 217. [2024-10-11 18:01:39,882 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-11 18:01:39,884 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 217 states to 217 states and 325 transitions. [2024-10-11 18:01:39,884 INFO L78 Accepts]: Start accepts. Automaton has 217 states and 325 transitions. Word has length 9 [2024-10-11 18:01:39,884 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-11 18:01:39,885 INFO L471 AbstractCegarLoop]: Abstraction has 217 states and 325 transitions. [2024-10-11 18:01:39,885 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-11 18:01:39,885 INFO L276 IsEmpty]: Start isEmpty. Operand 217 states and 325 transitions. [2024-10-11 18:01:39,885 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 14 [2024-10-11 18:01:39,885 INFO L207 NwaCegarLoop]: Found error trace [2024-10-11 18:01:39,886 INFO L215 NwaCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-11 18:01:39,886 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2024-10-11 18:01:39,886 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-11 18:01:39,887 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-11 18:01:39,887 INFO L85 PathProgramCache]: Analyzing trace with hash -519071088, now seen corresponding path program 1 times [2024-10-11 18:01:39,887 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-11 18:01:39,887 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [549313662] [2024-10-11 18:01:39,887 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 18:01:39,887 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-11 18:01:39,898 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 18:01:40,033 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-11 18:01:40,033 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-11 18:01:40,033 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [549313662] [2024-10-11 18:01:40,033 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [549313662] provided 0 perfect and 1 imperfect interpolant sequences [2024-10-11 18:01:40,033 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1536918357] [2024-10-11 18:01:40,033 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 18:01:40,034 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-10-11 18:01:40,035 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 [2024-10-11 18:01:40,037 INFO L229 MonitoredProcess]: Starting monitored process 2 with /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-10-11 18:01:40,038 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Waiting until timeout for monitored process [2024-10-11 18:01:40,106 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 18:01:40,109 INFO L255 TraceCheckSpWp]: Trace formula consists of 138 conjuncts, 12 conjuncts are in the unsatisfiable core [2024-10-11 18:01:40,114 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-11 18:01:40,298 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-11 18:01:40,299 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-10-11 18:01:40,420 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-11 18:01:40,421 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1536918357] provided 0 perfect and 2 imperfect interpolant sequences [2024-10-11 18:01:40,421 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2024-10-11 18:01:40,421 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [5, 3, 3] total 11 [2024-10-11 18:01:40,421 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1969844976] [2024-10-11 18:01:40,421 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2024-10-11 18:01:40,422 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 13 states [2024-10-11 18:01:40,422 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-11 18:01:40,422 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2024-10-11 18:01:40,422 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=40, Invalid=116, Unknown=0, NotChecked=0, Total=156 [2024-10-11 18:01:40,423 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-11 18:01:40,631 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-11 18:01:40,632 INFO L93 Difference]: Finished difference Result 240 states and 324 transitions. [2024-10-11 18:01:40,632 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2024-10-11 18:01:40,633 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-11 18:01:40,633 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-11 18:01:40,636 INFO L225 Difference]: With dead ends: 240 [2024-10-11 18:01:40,636 INFO L226 Difference]: Without dead ends: 240 [2024-10-11 18:01:40,637 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-11 18:01:40,637 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-11 18:01:40,638 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-11 18:01:40,639 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 240 states. [2024-10-11 18:01:40,648 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 240 to 220. [2024-10-11 18:01:40,649 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-11 18:01:40,651 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 220 states to 220 states and 319 transitions. [2024-10-11 18:01:40,652 INFO L78 Accepts]: Start accepts. Automaton has 220 states and 319 transitions. Word has length 13 [2024-10-11 18:01:40,652 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-11 18:01:40,653 INFO L471 AbstractCegarLoop]: Abstraction has 220 states and 319 transitions. [2024-10-11 18:01:40,653 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-11 18:01:40,653 INFO L276 IsEmpty]: Start isEmpty. Operand 220 states and 319 transitions. [2024-10-11 18:01:40,653 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 15 [2024-10-11 18:01:40,654 INFO L207 NwaCegarLoop]: Found error trace [2024-10-11 18:01:40,654 INFO L215 NwaCegarLoop]: trace histogram [2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-11 18:01:40,673 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Ended with exit code 0 [2024-10-11 18:01:40,858 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6,2 /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-10-11 18:01:40,859 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-11 18:01:40,860 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-11 18:01:40,860 INFO L85 PathProgramCache]: Analyzing trace with hash 1088665406, now seen corresponding path program 1 times [2024-10-11 18:01:40,860 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-11 18:01:40,860 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1287445002] [2024-10-11 18:01:40,860 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 18:01:40,860 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-11 18:01:40,876 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 18:01:41,035 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-11 18:01:41,035 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-11 18:01:41,035 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1287445002] [2024-10-11 18:01:41,036 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1287445002] provided 0 perfect and 1 imperfect interpolant sequences [2024-10-11 18:01:41,036 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1476873624] [2024-10-11 18:01:41,036 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 18:01:41,036 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-10-11 18:01:41,036 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 [2024-10-11 18:01:41,038 INFO L229 MonitoredProcess]: Starting monitored process 3 with /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-10-11 18:01:41,039 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Waiting until timeout for monitored process [2024-10-11 18:01:41,102 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 18:01:41,103 INFO L255 TraceCheckSpWp]: Trace formula consists of 146 conjuncts, 15 conjuncts are in the unsatisfiable core [2024-10-11 18:01:41,105 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-11 18:01:41,263 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-11 18:01:41,263 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-10-11 18:01:41,337 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-11 18:01:41,337 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1476873624] provided 0 perfect and 2 imperfect interpolant sequences [2024-10-11 18:01:41,337 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2024-10-11 18:01:41,337 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [5, 4, 4] total 12 [2024-10-11 18:01:41,338 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1952267557] [2024-10-11 18:01:41,338 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2024-10-11 18:01:41,339 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 14 states [2024-10-11 18:01:41,339 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-11 18:01:41,339 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 14 interpolants. [2024-10-11 18:01:41,340 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=47, Invalid=135, Unknown=0, NotChecked=0, Total=182 [2024-10-11 18:01:41,340 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-11 18:01:41,586 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-11 18:01:41,586 INFO L93 Difference]: Finished difference Result 258 states and 354 transitions. [2024-10-11 18:01:41,587 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2024-10-11 18:01:41,587 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-11 18:01:41,587 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-11 18:01:41,588 INFO L225 Difference]: With dead ends: 258 [2024-10-11 18:01:41,588 INFO L226 Difference]: Without dead ends: 258 [2024-10-11 18:01:41,589 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 35 GetRequests, 20 SyntacticMatches, 0 SemanticMatches, 15 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 46 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=75, Invalid=197, Unknown=0, NotChecked=0, Total=272 [2024-10-11 18:01:41,593 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-11 18:01:41,593 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-11 18:01:41,594 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 258 states. [2024-10-11 18:01:41,600 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 258 to 228. [2024-10-11 18:01:41,601 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-11 18:01:41,602 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 228 states to 228 states and 330 transitions. [2024-10-11 18:01:41,603 INFO L78 Accepts]: Start accepts. Automaton has 228 states and 330 transitions. Word has length 14 [2024-10-11 18:01:41,603 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-11 18:01:41,603 INFO L471 AbstractCegarLoop]: Abstraction has 228 states and 330 transitions. [2024-10-11 18:01:41,603 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-11 18:01:41,604 INFO L276 IsEmpty]: Start isEmpty. Operand 228 states and 330 transitions. [2024-10-11 18:01:41,604 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 16 [2024-10-11 18:01:41,604 INFO L207 NwaCegarLoop]: Found error trace [2024-10-11 18:01:41,604 INFO L215 NwaCegarLoop]: trace histogram [2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-11 18:01:41,622 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Ended with exit code 0 [2024-10-11 18:01:41,805 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7,3 /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-10-11 18:01:41,806 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-11 18:01:41,806 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-11 18:01:41,806 INFO L85 PathProgramCache]: Analyzing trace with hash -611110737, now seen corresponding path program 1 times [2024-10-11 18:01:41,806 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-11 18:01:41,807 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1345374331] [2024-10-11 18:01:41,807 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 18:01:41,807 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-11 18:01:41,821 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 18:01:42,006 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-11 18:01:42,006 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-11 18:01:42,006 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1345374331] [2024-10-11 18:01:42,006 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1345374331] provided 0 perfect and 1 imperfect interpolant sequences [2024-10-11 18:01:42,006 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1406519093] [2024-10-11 18:01:42,006 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 18:01:42,007 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-10-11 18:01:42,007 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 [2024-10-11 18:01:42,008 INFO L229 MonitoredProcess]: Starting monitored process 4 with /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-10-11 18:01:42,010 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Waiting until timeout for monitored process [2024-10-11 18:01:42,073 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 18:01:42,074 INFO L255 TraceCheckSpWp]: Trace formula consists of 148 conjuncts, 18 conjuncts are in the unsatisfiable core [2024-10-11 18:01:42,076 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-11 18:01:42,315 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-11 18:01:42,315 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-10-11 18:01:42,450 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-11 18:01:42,451 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1406519093] provided 0 perfect and 2 imperfect interpolant sequences [2024-10-11 18:01:42,451 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2024-10-11 18:01:42,451 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [5, 4, 4] total 13 [2024-10-11 18:01:42,451 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [982045243] [2024-10-11 18:01:42,451 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2024-10-11 18:01:42,452 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 15 states [2024-10-11 18:01:42,452 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-11 18:01:42,452 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 15 interpolants. [2024-10-11 18:01:42,452 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=44, Invalid=166, Unknown=0, NotChecked=0, Total=210 [2024-10-11 18:01:42,453 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-11 18:01:42,965 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-11 18:01:42,965 INFO L93 Difference]: Finished difference Result 386 states and 532 transitions. [2024-10-11 18:01:42,966 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2024-10-11 18:01:42,966 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-11 18:01:42,966 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-11 18:01:42,970 INFO L225 Difference]: With dead ends: 386 [2024-10-11 18:01:42,970 INFO L226 Difference]: Without dead ends: 386 [2024-10-11 18:01:42,971 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-11 18:01:42,971 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-11 18:01:42,972 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-11 18:01:42,973 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 386 states. [2024-10-11 18:01:42,983 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 386 to 324. [2024-10-11 18:01:42,984 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-11 18:01:42,987 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 324 states to 324 states and 495 transitions. [2024-10-11 18:01:42,987 INFO L78 Accepts]: Start accepts. Automaton has 324 states and 495 transitions. Word has length 15 [2024-10-11 18:01:42,987 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-11 18:01:42,987 INFO L471 AbstractCegarLoop]: Abstraction has 324 states and 495 transitions. [2024-10-11 18:01:42,988 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-11 18:01:42,988 INFO L276 IsEmpty]: Start isEmpty. Operand 324 states and 495 transitions. [2024-10-11 18:01:42,988 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 17 [2024-10-11 18:01:42,988 INFO L207 NwaCegarLoop]: Found error trace [2024-10-11 18:01:42,989 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-11 18:01:43,006 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Ended with exit code 0 [2024-10-11 18:01:43,189 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8,4 /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-10-11 18:01:43,190 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-11 18:01:43,190 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-11 18:01:43,190 INFO L85 PathProgramCache]: Analyzing trace with hash -905175959, now seen corresponding path program 1 times [2024-10-11 18:01:43,190 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-11 18:01:43,190 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1762393730] [2024-10-11 18:01:43,191 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 18:01:43,191 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-11 18:01:43,198 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 18:01:43,238 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-11 18:01:43,239 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-11 18:01:43,239 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1762393730] [2024-10-11 18:01:43,239 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1762393730] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-11 18:01:43,239 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-11 18:01:43,239 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-10-11 18:01:43,240 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1883075865] [2024-10-11 18:01:43,240 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-11 18:01:43,240 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-10-11 18:01:43,240 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-11 18:01:43,241 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-10-11 18:01:43,241 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-10-11 18:01:43,241 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-11 18:01:43,269 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-11 18:01:43,269 INFO L93 Difference]: Finished difference Result 335 states and 481 transitions. [2024-10-11 18:01:43,269 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-10-11 18:01:43,270 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-11 18:01:43,270 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-11 18:01:43,271 INFO L225 Difference]: With dead ends: 335 [2024-10-11 18:01:43,271 INFO L226 Difference]: Without dead ends: 335 [2024-10-11 18:01:43,272 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-11 18:01:43,272 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-11 18:01:43,272 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-11 18:01:43,273 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 335 states. [2024-10-11 18:01:43,280 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 335 to 326. [2024-10-11 18:01:43,280 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-11 18:01:43,282 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 326 states to 326 states and 479 transitions. [2024-10-11 18:01:43,282 INFO L78 Accepts]: Start accepts. Automaton has 326 states and 479 transitions. Word has length 16 [2024-10-11 18:01:43,282 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-11 18:01:43,282 INFO L471 AbstractCegarLoop]: Abstraction has 326 states and 479 transitions. [2024-10-11 18:01:43,283 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-11 18:01:43,283 INFO L276 IsEmpty]: Start isEmpty. Operand 326 states and 479 transitions. [2024-10-11 18:01:43,283 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 24 [2024-10-11 18:01:43,283 INFO L207 NwaCegarLoop]: Found error trace [2024-10-11 18:01:43,284 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-11 18:01:43,284 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9 [2024-10-11 18:01:43,284 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-11 18:01:43,284 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-11 18:01:43,284 INFO L85 PathProgramCache]: Analyzing trace with hash 2085829514, now seen corresponding path program 1 times [2024-10-11 18:01:43,285 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-11 18:01:43,285 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1253675786] [2024-10-11 18:01:43,285 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 18:01:43,285 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-11 18:01:43,311 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 18:01:43,356 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2024-10-11 18:01:43,362 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 18:01:43,383 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-11 18:01:43,384 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-11 18:01:43,384 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1253675786] [2024-10-11 18:01:43,385 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1253675786] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-11 18:01:43,385 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-11 18:01:43,385 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2024-10-11 18:01:43,385 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [954285354] [2024-10-11 18:01:43,385 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-11 18:01:43,386 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-10-11 18:01:43,386 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-11 18:01:43,387 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-10-11 18:01:43,388 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-10-11 18:01:43,388 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-11 18:01:43,461 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-11 18:01:43,461 INFO L93 Difference]: Finished difference Result 265 states and 369 transitions. [2024-10-11 18:01:43,463 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-10-11 18:01:43,463 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-11 18:01:43,463 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-11 18:01:43,465 INFO L225 Difference]: With dead ends: 265 [2024-10-11 18:01:43,465 INFO L226 Difference]: Without dead ends: 265 [2024-10-11 18:01:43,465 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-11 18:01:43,465 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-11 18:01:43,466 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-11 18:01:43,467 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 265 states. [2024-10-11 18:01:43,473 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 265 to 259. [2024-10-11 18:01:43,474 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-11 18:01:43,476 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 259 states to 259 states and 363 transitions. [2024-10-11 18:01:43,476 INFO L78 Accepts]: Start accepts. Automaton has 259 states and 363 transitions. Word has length 23 [2024-10-11 18:01:43,476 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-11 18:01:43,477 INFO L471 AbstractCegarLoop]: Abstraction has 259 states and 363 transitions. [2024-10-11 18:01:43,477 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-11 18:01:43,477 INFO L276 IsEmpty]: Start isEmpty. Operand 259 states and 363 transitions. [2024-10-11 18:01:43,478 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2024-10-11 18:01:43,478 INFO L207 NwaCegarLoop]: Found error trace [2024-10-11 18:01:43,478 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-11 18:01:43,478 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10 [2024-10-11 18:01:43,478 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-11 18:01:43,479 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-11 18:01:43,479 INFO L85 PathProgramCache]: Analyzing trace with hash 243656846, now seen corresponding path program 1 times [2024-10-11 18:01:43,479 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-11 18:01:43,479 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1110482239] [2024-10-11 18:01:43,480 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 18:01:43,480 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-11 18:01:43,496 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 18:01:43,638 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2024-10-11 18:01:43,646 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 18:01:43,740 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-11 18:01:43,741 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-11 18:01:43,741 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1110482239] [2024-10-11 18:01:43,741 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1110482239] provided 0 perfect and 1 imperfect interpolant sequences [2024-10-11 18:01:43,741 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1800395955] [2024-10-11 18:01:43,741 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 18:01:43,741 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-10-11 18:01:43,742 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 [2024-10-11 18:01:43,743 INFO L229 MonitoredProcess]: Starting monitored process 5 with /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-10-11 18:01:43,745 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Waiting until timeout for monitored process [2024-10-11 18:01:43,816 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 18:01:43,817 INFO L255 TraceCheckSpWp]: Trace formula consists of 206 conjuncts, 19 conjuncts are in the unsatisfiable core [2024-10-11 18:01:43,819 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-11 18:01:44,075 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-10-11 18:01:44,082 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-11 18:01:44,142 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-11 18:01:44,142 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-10-11 18:01:44,288 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1800395955] provided 0 perfect and 1 imperfect interpolant sequences [2024-10-11 18:01:44,288 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2024-10-11 18:01:44,289 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [8, 5] total 13 [2024-10-11 18:01:44,289 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1506223611] [2024-10-11 18:01:44,289 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2024-10-11 18:01:44,289 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 15 states [2024-10-11 18:01:44,289 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-11 18:01:44,290 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 15 interpolants. [2024-10-11 18:01:44,290 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=54, Invalid=252, Unknown=0, NotChecked=0, Total=306 [2024-10-11 18:01:44,291 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-11 18:01:44,846 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-11 18:01:44,846 INFO L93 Difference]: Finished difference Result 283 states and 380 transitions. [2024-10-11 18:01:44,847 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2024-10-11 18:01:44,848 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-11 18:01:44,848 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-11 18:01:44,849 INFO L225 Difference]: With dead ends: 283 [2024-10-11 18:01:44,849 INFO L226 Difference]: Without dead ends: 283 [2024-10-11 18:01:44,850 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-11 18:01:44,850 INFO L432 NwaCegarLoop]: 32 mSDtfsCounter, 387 mSDsluCounter, 134 mSDsCounter, 0 mSdLazyCounter, 273 mSolverCounterSat, 41 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s 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.3s IncrementalHoareTripleChecker+Time [2024-10-11 18:01:44,850 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.3s Time] [2024-10-11 18:01:44,851 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 283 states. [2024-10-11 18:01:44,858 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 283 to 273. [2024-10-11 18:01:44,859 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-11 18:01:44,861 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 273 states to 273 states and 375 transitions. [2024-10-11 18:01:44,862 INFO L78 Accepts]: Start accepts. Automaton has 273 states and 375 transitions. Word has length 25 [2024-10-11 18:01:44,862 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-11 18:01:44,863 INFO L471 AbstractCegarLoop]: Abstraction has 273 states and 375 transitions. [2024-10-11 18:01:44,863 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-11 18:01:44,863 INFO L276 IsEmpty]: Start isEmpty. Operand 273 states and 375 transitions. [2024-10-11 18:01:44,864 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 27 [2024-10-11 18:01:44,864 INFO L207 NwaCegarLoop]: Found error trace [2024-10-11 18:01:44,864 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-11 18:01:44,884 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Ended with exit code 0 [2024-10-11 18:01:45,068 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 5 /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable11 [2024-10-11 18:01:45,069 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-11 18:01:45,069 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-11 18:01:45,069 INFO L85 PathProgramCache]: Analyzing trace with hash -605850576, now seen corresponding path program 1 times [2024-10-11 18:01:45,069 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-11 18:01:45,070 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2074540385] [2024-10-11 18:01:45,070 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 18:01:45,070 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-11 18:01:45,078 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 18:01:45,151 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2024-10-11 18:01:45,155 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 18:01:45,179 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-11 18:01:45,180 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-11 18:01:45,180 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2074540385] [2024-10-11 18:01:45,180 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2074540385] provided 0 perfect and 1 imperfect interpolant sequences [2024-10-11 18:01:45,180 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1461204348] [2024-10-11 18:01:45,180 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 18:01:45,181 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-10-11 18:01:45,181 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 [2024-10-11 18:01:45,182 INFO L229 MonitoredProcess]: Starting monitored process 6 with /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-10-11 18:01:45,184 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (6)] Waiting until timeout for monitored process [2024-10-11 18:01:45,251 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 18:01:45,253 INFO L255 TraceCheckSpWp]: Trace formula consists of 203 conjuncts, 10 conjuncts are in the unsatisfiable core [2024-10-11 18:01:45,254 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-11 18:01:45,357 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-11 18:01:45,357 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-10-11 18:01:45,357 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1461204348] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-11 18:01:45,357 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2024-10-11 18:01:45,357 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [5] total 9 [2024-10-11 18:01:45,357 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [581906593] [2024-10-11 18:01:45,358 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-11 18:01:45,358 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2024-10-11 18:01:45,358 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-11 18:01:45,358 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2024-10-11 18:01:45,358 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=22, Invalid=68, Unknown=0, NotChecked=0, Total=90 [2024-10-11 18:01:45,359 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-11 18:01:45,408 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-11 18:01:45,408 INFO L93 Difference]: Finished difference Result 286 states and 384 transitions. [2024-10-11 18:01:45,408 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-10-11 18:01:45,409 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-11 18:01:45,409 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-11 18:01:45,410 INFO L225 Difference]: With dead ends: 286 [2024-10-11 18:01:45,410 INFO L226 Difference]: Without dead ends: 286 [2024-10-11 18:01:45,411 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-11 18:01:45,411 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-11 18:01:45,412 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-11 18:01:45,412 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 286 states. [2024-10-11 18:01:45,417 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 286 to 277. [2024-10-11 18:01:45,418 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-11 18:01:45,419 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 277 states to 277 states and 379 transitions. [2024-10-11 18:01:45,420 INFO L78 Accepts]: Start accepts. Automaton has 277 states and 379 transitions. Word has length 26 [2024-10-11 18:01:45,420 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-11 18:01:45,420 INFO L471 AbstractCegarLoop]: Abstraction has 277 states and 379 transitions. [2024-10-11 18:01:45,420 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-11 18:01:45,420 INFO L276 IsEmpty]: Start isEmpty. Operand 277 states and 379 transitions. [2024-10-11 18:01:45,421 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 28 [2024-10-11 18:01:45,421 INFO L207 NwaCegarLoop]: Found error trace [2024-10-11 18:01:45,421 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-11 18:01:45,438 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (6)] Ended with exit code 0 [2024-10-11 18:01:45,621 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 6 /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable12 [2024-10-11 18:01:45,622 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-11 18:01:45,622 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-11 18:01:45,623 INFO L85 PathProgramCache]: Analyzing trace with hash -2068973779, now seen corresponding path program 1 times [2024-10-11 18:01:45,623 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-11 18:01:45,623 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [918124811] [2024-10-11 18:01:45,623 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 18:01:45,623 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-11 18:01:45,637 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 18:01:45,877 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2024-10-11 18:01:45,883 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 18:01:46,161 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-11 18:01:46,161 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-11 18:01:46,162 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [918124811] [2024-10-11 18:01:46,162 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [918124811] provided 0 perfect and 1 imperfect interpolant sequences [2024-10-11 18:01:46,162 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [992771551] [2024-10-11 18:01:46,162 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 18:01:46,162 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-10-11 18:01:46,162 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 [2024-10-11 18:01:46,164 INFO L229 MonitoredProcess]: Starting monitored process 7 with /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-10-11 18:01:46,165 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (7)] Waiting until timeout for monitored process [2024-10-11 18:01:46,234 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 18:01:46,240 INFO L255 TraceCheckSpWp]: Trace formula consists of 216 conjuncts, 25 conjuncts are in the unsatisfiable core [2024-10-11 18:01:46,242 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-11 18:01:46,551 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-10-11 18:01:46,552 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-11 18:01:46,688 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-11 18:01:46,688 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-10-11 18:01:46,843 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [992771551] provided 0 perfect and 1 imperfect interpolant sequences [2024-10-11 18:01:46,843 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2024-10-11 18:01:46,843 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [11, 6] total 17 [2024-10-11 18:01:46,844 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2033643377] [2024-10-11 18:01:46,844 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2024-10-11 18:01:46,845 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 19 states [2024-10-11 18:01:46,845 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-11 18:01:46,846 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 19 interpolants. [2024-10-11 18:01:46,846 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=77, Invalid=385, Unknown=0, NotChecked=0, Total=462 [2024-10-11 18:01:46,847 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-11 18:01:47,405 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-11 18:01:47,405 INFO L93 Difference]: Finished difference Result 284 states and 378 transitions. [2024-10-11 18:01:47,405 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2024-10-11 18:01:47,406 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-11 18:01:47,406 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-11 18:01:47,407 INFO L225 Difference]: With dead ends: 284 [2024-10-11 18:01:47,407 INFO L226 Difference]: Without dead ends: 284 [2024-10-11 18:01:47,408 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-11 18:01:47,408 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-11 18:01:47,409 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-11 18:01:47,410 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 284 states. [2024-10-11 18:01:47,415 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 284 to 277. [2024-10-11 18:01:47,416 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-11 18:01:47,418 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 277 states to 277 states and 375 transitions. [2024-10-11 18:01:47,418 INFO L78 Accepts]: Start accepts. Automaton has 277 states and 375 transitions. Word has length 27 [2024-10-11 18:01:47,418 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-11 18:01:47,418 INFO L471 AbstractCegarLoop]: Abstraction has 277 states and 375 transitions. [2024-10-11 18:01:47,419 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-11 18:01:47,419 INFO L276 IsEmpty]: Start isEmpty. Operand 277 states and 375 transitions. [2024-10-11 18:01:47,423 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 29 [2024-10-11 18:01:47,423 INFO L207 NwaCegarLoop]: Found error trace [2024-10-11 18:01:47,424 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-11 18:01:47,447 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (7)] Forceful destruction successful, exit code 0 [2024-10-11 18:01:47,625 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 7 /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable13 [2024-10-11 18:01:47,626 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-11 18:01:47,626 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-11 18:01:47,626 INFO L85 PathProgramCache]: Analyzing trace with hash 286322338, now seen corresponding path program 1 times [2024-10-11 18:01:47,626 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-11 18:01:47,626 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1924012259] [2024-10-11 18:01:47,626 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 18:01:47,627 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-11 18:01:47,641 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 18:01:47,772 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2024-10-11 18:01:47,777 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 18:01:47,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-11 18:01:47,856 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-11 18:01:47,856 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1924012259] [2024-10-11 18:01:47,857 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1924012259] provided 0 perfect and 1 imperfect interpolant sequences [2024-10-11 18:01:47,857 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [2022334879] [2024-10-11 18:01:47,857 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 18:01:47,857 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-10-11 18:01:47,857 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 [2024-10-11 18:01:47,859 INFO L229 MonitoredProcess]: Starting monitored process 8 with /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-10-11 18:01:47,861 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (8)] Waiting until timeout for monitored process [2024-10-11 18:01:47,939 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 18:01:47,941 INFO L255 TraceCheckSpWp]: Trace formula consists of 218 conjuncts, 14 conjuncts are in the unsatisfiable core [2024-10-11 18:01:47,943 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-11 18:01:48,063 INFO L349 Elim1Store]: treesize reduction 20, result has 33.3 percent of original size [2024-10-11 18:01:48,064 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-11 18:01:48,124 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-11 18:01:48,125 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-10-11 18:01:48,179 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [2022334879] provided 0 perfect and 1 imperfect interpolant sequences [2024-10-11 18:01:48,179 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2024-10-11 18:01:48,179 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 5] total 10 [2024-10-11 18:01:48,180 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1619231973] [2024-10-11 18:01:48,180 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2024-10-11 18:01:48,180 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 12 states [2024-10-11 18:01:48,180 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-11 18:01:48,181 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2024-10-11 18:01:48,181 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=35, Invalid=121, Unknown=0, NotChecked=0, Total=156 [2024-10-11 18:01:48,181 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-11 18:01:48,714 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-11 18:01:48,714 INFO L93 Difference]: Finished difference Result 400 states and 502 transitions. [2024-10-11 18:01:48,714 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2024-10-11 18:01:48,714 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-11 18:01:48,715 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-11 18:01:48,716 INFO L225 Difference]: With dead ends: 400 [2024-10-11 18:01:48,716 INFO L226 Difference]: Without dead ends: 400 [2024-10-11 18:01:48,717 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-11 18:01:48,718 INFO L432 NwaCegarLoop]: 52 mSDtfsCounter, 398 mSDsluCounter, 213 mSDsCounter, 0 mSdLazyCounter, 358 mSolverCounterSat, 15 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s 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-11 18:01:48,718 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-11 18:01:48,719 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 400 states. [2024-10-11 18:01:48,725 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 400 to 355. [2024-10-11 18:01:48,726 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-11 18:01:48,727 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 355 states to 355 states and 467 transitions. [2024-10-11 18:01:48,728 INFO L78 Accepts]: Start accepts. Automaton has 355 states and 467 transitions. Word has length 28 [2024-10-11 18:01:48,728 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-11 18:01:48,728 INFO L471 AbstractCegarLoop]: Abstraction has 355 states and 467 transitions. [2024-10-11 18:01:48,728 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-11 18:01:48,728 INFO L276 IsEmpty]: Start isEmpty. Operand 355 states and 467 transitions. [2024-10-11 18:01:48,729 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 30 [2024-10-11 18:01:48,729 INFO L207 NwaCegarLoop]: Found error trace [2024-10-11 18:01:48,729 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-11 18:01:48,750 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (8)] Ended with exit code 0 [2024-10-11 18:01:48,933 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable14,8 /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-10-11 18:01:48,934 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-11 18:01:48,935 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-11 18:01:48,935 INFO L85 PathProgramCache]: Analyzing trace with hash 286057935, now seen corresponding path program 1 times [2024-10-11 18:01:48,935 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-11 18:01:48,935 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1412974099] [2024-10-11 18:01:48,935 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 18:01:48,935 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-11 18:01:48,951 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 18:01:49,153 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2024-10-11 18:01:49,159 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 18:01:49,276 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-11 18:01:49,276 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-11 18:01:49,276 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1412974099] [2024-10-11 18:01:49,277 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1412974099] provided 0 perfect and 1 imperfect interpolant sequences [2024-10-11 18:01:49,277 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1681256382] [2024-10-11 18:01:49,277 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 18:01:49,277 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-10-11 18:01:49,277 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 [2024-10-11 18:01:49,279 INFO L229 MonitoredProcess]: Starting monitored process 9 with /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-10-11 18:01:49,281 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (9)] Waiting until timeout for monitored process [2024-10-11 18:01:49,355 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 18:01:49,358 INFO L255 TraceCheckSpWp]: Trace formula consists of 220 conjuncts, 21 conjuncts are in the unsatisfiable core [2024-10-11 18:01:49,361 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-11 18:01:49,483 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-10-11 18:01:49,484 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-11 18:01:49,560 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-11 18:01:49,560 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-10-11 18:01:49,678 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1681256382] provided 0 perfect and 1 imperfect interpolant sequences [2024-10-11 18:01:49,678 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2024-10-11 18:01:49,678 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [8, 6] total 14 [2024-10-11 18:01:49,678 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1265437381] [2024-10-11 18:01:49,678 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2024-10-11 18:01:49,679 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 16 states [2024-10-11 18:01:49,679 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-11 18:01:49,679 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 16 interpolants. [2024-10-11 18:01:49,680 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=68, Invalid=312, Unknown=0, NotChecked=0, Total=380 [2024-10-11 18:01:49,680 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-11 18:01:50,370 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-11 18:01:50,371 INFO L93 Difference]: Finished difference Result 421 states and 517 transitions. [2024-10-11 18:01:50,371 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 20 states. [2024-10-11 18:01:50,371 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-11 18:01:50,372 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-11 18:01:50,374 INFO L225 Difference]: With dead ends: 421 [2024-10-11 18:01:50,374 INFO L226 Difference]: Without dead ends: 421 [2024-10-11 18:01:50,376 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-11 18:01:50,377 INFO L432 NwaCegarLoop]: 50 mSDtfsCounter, 550 mSDsluCounter, 292 mSDsCounter, 0 mSdLazyCounter, 407 mSolverCounterSat, 36 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s 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-11 18:01:50,377 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-11 18:01:50,378 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 421 states. [2024-10-11 18:01:50,385 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 421 to 371. [2024-10-11 18:01:50,386 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-11 18:01:50,388 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 371 states to 371 states and 486 transitions. [2024-10-11 18:01:50,388 INFO L78 Accepts]: Start accepts. Automaton has 371 states and 486 transitions. Word has length 29 [2024-10-11 18:01:50,388 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-11 18:01:50,388 INFO L471 AbstractCegarLoop]: Abstraction has 371 states and 486 transitions. [2024-10-11 18:01:50,388 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-11 18:01:50,389 INFO L276 IsEmpty]: Start isEmpty. Operand 371 states and 486 transitions. [2024-10-11 18:01:50,389 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 34 [2024-10-11 18:01:50,389 INFO L207 NwaCegarLoop]: Found error trace [2024-10-11 18:01:50,389 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-11 18:01:50,410 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (9)] Ended with exit code 0 [2024-10-11 18:01:50,593 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 9 /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable15 [2024-10-11 18:01:50,594 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-11 18:01:50,595 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-11 18:01:50,595 INFO L85 PathProgramCache]: Analyzing trace with hash 1370226837, now seen corresponding path program 1 times [2024-10-11 18:01:50,595 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-11 18:01:50,595 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1518525559] [2024-10-11 18:01:50,595 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 18:01:50,596 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-11 18:01:50,607 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 18:01:50,773 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2024-10-11 18:01:50,779 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 18:01:50,906 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-11 18:01:50,907 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-11 18:01:50,907 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1518525559] [2024-10-11 18:01:50,907 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1518525559] provided 0 perfect and 1 imperfect interpolant sequences [2024-10-11 18:01:50,907 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [2044478047] [2024-10-11 18:01:50,907 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 18:01:50,907 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-10-11 18:01:50,908 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 [2024-10-11 18:01:50,910 INFO L229 MonitoredProcess]: Starting monitored process 10 with /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-10-11 18:01:50,911 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (10)] Waiting until timeout for monitored process [2024-10-11 18:01:50,988 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 18:01:50,990 INFO L255 TraceCheckSpWp]: Trace formula consists of 226 conjuncts, 21 conjuncts are in the unsatisfiable core [2024-10-11 18:01:50,992 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-11 18:01:51,206 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-10-11 18:01:51,208 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-11 18:01:51,359 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-11 18:01:51,360 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-10-11 18:01:51,543 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [2044478047] provided 0 perfect and 1 imperfect interpolant sequences [2024-10-11 18:01:51,544 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2024-10-11 18:01:51,544 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [10, 6] total 16 [2024-10-11 18:01:51,544 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [868071721] [2024-10-11 18:01:51,544 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2024-10-11 18:01:51,545 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 18 states [2024-10-11 18:01:51,545 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-11 18:01:51,545 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 18 interpolants. [2024-10-11 18:01:51,545 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=68, Invalid=394, Unknown=0, NotChecked=0, Total=462 [2024-10-11 18:01:51,546 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-11 18:01:52,145 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-11 18:01:52,146 INFO L93 Difference]: Finished difference Result 388 states and 486 transitions. [2024-10-11 18:01:52,146 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2024-10-11 18:01:52,146 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-11 18:01:52,147 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-11 18:01:52,148 INFO L225 Difference]: With dead ends: 388 [2024-10-11 18:01:52,148 INFO L226 Difference]: Without dead ends: 388 [2024-10-11 18:01:52,149 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 68 GetRequests, 36 SyntacticMatches, 0 SemanticMatches, 32 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 148 ImplicationChecksByTransitivity, 0.6s TimeCoverageRelationStatistics Valid=244, Invalid=878, Unknown=0, NotChecked=0, Total=1122 [2024-10-11 18:01:52,149 INFO L432 NwaCegarLoop]: 33 mSDtfsCounter, 502 mSDsluCounter, 212 mSDsCounter, 0 mSdLazyCounter, 384 mSolverCounterSat, 79 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s 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.3s IncrementalHoareTripleChecker+Time [2024-10-11 18:01:52,149 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.3s Time] [2024-10-11 18:01:52,150 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 388 states. [2024-10-11 18:01:52,155 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 388 to 370. [2024-10-11 18:01:52,156 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-11 18:01:52,157 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 370 states to 370 states and 469 transitions. [2024-10-11 18:01:52,158 INFO L78 Accepts]: Start accepts. Automaton has 370 states and 469 transitions. Word has length 33 [2024-10-11 18:01:52,158 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-11 18:01:52,158 INFO L471 AbstractCegarLoop]: Abstraction has 370 states and 469 transitions. [2024-10-11 18:01:52,158 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-11 18:01:52,158 INFO L276 IsEmpty]: Start isEmpty. Operand 370 states and 469 transitions. [2024-10-11 18:01:52,159 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 38 [2024-10-11 18:01:52,159 INFO L207 NwaCegarLoop]: Found error trace [2024-10-11 18:01:52,159 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-11 18:01:52,178 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (10)] Ended with exit code 0 [2024-10-11 18:01:52,363 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 10 /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable16 [2024-10-11 18:01:52,364 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-11 18:01:52,364 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-11 18:01:52,365 INFO L85 PathProgramCache]: Analyzing trace with hash -675206682, now seen corresponding path program 1 times [2024-10-11 18:01:52,365 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-11 18:01:52,365 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1647808644] [2024-10-11 18:01:52,365 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 18:01:52,365 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-11 18:01:52,374 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 18:01:52,420 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2024-10-11 18:01:52,427 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 18:01:52,454 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-11 18:01:52,454 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-11 18:01:52,454 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1647808644] [2024-10-11 18:01:52,454 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1647808644] provided 0 perfect and 1 imperfect interpolant sequences [2024-10-11 18:01:52,454 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [2127265664] [2024-10-11 18:01:52,455 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 18:01:52,455 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-10-11 18:01:52,455 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 [2024-10-11 18:01:52,457 INFO L229 MonitoredProcess]: Starting monitored process 11 with /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-10-11 18:01:52,459 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (11)] Waiting until timeout for monitored process [2024-10-11 18:01:52,548 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 18:01:52,551 INFO L255 TraceCheckSpWp]: Trace formula consists of 254 conjuncts, 9 conjuncts are in the unsatisfiable core [2024-10-11 18:01:52,553 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-11 18:01:52,586 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-11 18:01:52,586 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-10-11 18:01:52,617 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-11 18:01:52,617 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [2127265664] provided 0 perfect and 2 imperfect interpolant sequences [2024-10-11 18:01:52,618 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2024-10-11 18:01:52,618 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [4, 3, 3] total 4 [2024-10-11 18:01:52,618 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [102193207] [2024-10-11 18:01:52,618 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2024-10-11 18:01:52,618 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2024-10-11 18:01:52,618 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-11 18:01:52,619 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2024-10-11 18:01:52,619 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2024-10-11 18:01:52,619 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-11 18:01:52,720 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-11 18:01:52,720 INFO L93 Difference]: Finished difference Result 371 states and 466 transitions. [2024-10-11 18:01:52,721 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-10-11 18:01:52,721 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-11 18:01:52,721 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-11 18:01:52,723 INFO L225 Difference]: With dead ends: 371 [2024-10-11 18:01:52,723 INFO L226 Difference]: Without dead ends: 371 [2024-10-11 18:01:52,723 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-11 18:01:52,724 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-11 18:01:52,724 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-11 18:01:52,724 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 371 states. [2024-10-11 18:01:52,731 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 371 to 368. [2024-10-11 18:01:52,732 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-11 18:01:52,733 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 368 states to 368 states and 463 transitions. [2024-10-11 18:01:52,734 INFO L78 Accepts]: Start accepts. Automaton has 368 states and 463 transitions. Word has length 37 [2024-10-11 18:01:52,735 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-11 18:01:52,735 INFO L471 AbstractCegarLoop]: Abstraction has 368 states and 463 transitions. [2024-10-11 18:01:52,735 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-11 18:01:52,735 INFO L276 IsEmpty]: Start isEmpty. Operand 368 states and 463 transitions. [2024-10-11 18:01:52,736 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 39 [2024-10-11 18:01:52,736 INFO L207 NwaCegarLoop]: Found error trace [2024-10-11 18:01:52,736 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-11 18:01:52,758 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (11)] Ended with exit code 0 [2024-10-11 18:01:52,937 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 11 /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable17 [2024-10-11 18:01:52,937 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-11 18:01:52,938 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-11 18:01:52,938 INFO L85 PathProgramCache]: Analyzing trace with hash 543429436, now seen corresponding path program 1 times [2024-10-11 18:01:52,938 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-11 18:01:52,938 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [925883465] [2024-10-11 18:01:52,938 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 18:01:52,938 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-11 18:01:52,951 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 18:01:53,010 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2024-10-11 18:01:53,015 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 18:01:53,035 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-11 18:01:53,035 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-11 18:01:53,035 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [925883465] [2024-10-11 18:01:53,035 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [925883465] provided 0 perfect and 1 imperfect interpolant sequences [2024-10-11 18:01:53,036 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1867991469] [2024-10-11 18:01:53,036 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 18:01:53,036 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-10-11 18:01:53,036 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 [2024-10-11 18:01:53,038 INFO L229 MonitoredProcess]: Starting monitored process 12 with /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-10-11 18:01:53,040 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (12)] Waiting until timeout for monitored process [2024-10-11 18:01:53,123 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 18:01:53,125 INFO L255 TraceCheckSpWp]: Trace formula consists of 256 conjuncts, 5 conjuncts are in the unsatisfiable core [2024-10-11 18:01:53,127 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-11 18:01:53,207 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-11 18:01:53,208 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-10-11 18:01:53,264 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-11 18:01:53,264 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1867991469] provided 0 perfect and 2 imperfect interpolant sequences [2024-10-11 18:01:53,265 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2024-10-11 18:01:53,265 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [4, 3, 3] total 4 [2024-10-11 18:01:53,265 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2036063754] [2024-10-11 18:01:53,265 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2024-10-11 18:01:53,265 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2024-10-11 18:01:53,265 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-11 18:01:53,266 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2024-10-11 18:01:53,266 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2024-10-11 18:01:53,266 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-11 18:01:53,353 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-11 18:01:53,354 INFO L93 Difference]: Finished difference Result 369 states and 460 transitions. [2024-10-11 18:01:53,354 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-10-11 18:01:53,354 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-11 18:01:53,354 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-11 18:01:53,356 INFO L225 Difference]: With dead ends: 369 [2024-10-11 18:01:53,356 INFO L226 Difference]: Without dead ends: 369 [2024-10-11 18:01:53,356 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-11 18:01:53,356 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-11 18:01:53,357 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-11 18:01:53,357 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 369 states. [2024-10-11 18:01:53,362 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 369 to 366. [2024-10-11 18:01:53,363 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-11 18:01:53,364 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 366 states to 366 states and 457 transitions. [2024-10-11 18:01:53,364 INFO L78 Accepts]: Start accepts. Automaton has 366 states and 457 transitions. Word has length 38 [2024-10-11 18:01:53,364 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-11 18:01:53,365 INFO L471 AbstractCegarLoop]: Abstraction has 366 states and 457 transitions. [2024-10-11 18:01:53,365 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-11 18:01:53,365 INFO L276 IsEmpty]: Start isEmpty. Operand 366 states and 457 transitions. [2024-10-11 18:01:53,365 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 40 [2024-10-11 18:01:53,365 INFO L207 NwaCegarLoop]: Found error trace [2024-10-11 18:01:53,366 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-11 18:01:53,385 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (12)] Ended with exit code 0 [2024-10-11 18:01:53,566 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable18,12 /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-10-11 18:01:53,566 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-11 18:01:53,567 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-11 18:01:53,567 INFO L85 PathProgramCache]: Analyzing trace with hash -333556568, now seen corresponding path program 1 times [2024-10-11 18:01:53,567 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-11 18:01:53,567 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1600121338] [2024-10-11 18:01:53,567 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 18:01:53,567 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-11 18:01:53,576 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 18:01:53,741 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2024-10-11 18:01:53,746 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 18:01:53,773 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-11 18:01:53,774 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-11 18:01:53,774 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1600121338] [2024-10-11 18:01:53,774 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1600121338] provided 0 perfect and 1 imperfect interpolant sequences [2024-10-11 18:01:53,774 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [694324322] [2024-10-11 18:01:53,775 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 18:01:53,775 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-10-11 18:01:53,775 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 [2024-10-11 18:01:53,777 INFO L229 MonitoredProcess]: Starting monitored process 13 with /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-10-11 18:01:53,778 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (13)] Waiting until timeout for monitored process [2024-10-11 18:01:53,861 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 18:01:53,863 INFO L255 TraceCheckSpWp]: Trace formula consists of 258 conjuncts, 15 conjuncts are in the unsatisfiable core [2024-10-11 18:01:53,865 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-11 18:01:53,871 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-11 18:01:53,907 INFO L349 Elim1Store]: treesize reduction 15, result has 25.0 percent of original size [2024-10-11 18:01:53,907 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-11 18:01:53,918 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-11 18:01:53,918 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-10-11 18:01:53,965 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-11 18:01:53,966 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [694324322] provided 0 perfect and 2 imperfect interpolant sequences [2024-10-11 18:01:53,966 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2024-10-11 18:01:53,966 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [4, 3, 3] total 4 [2024-10-11 18:01:53,966 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1826503517] [2024-10-11 18:01:53,966 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2024-10-11 18:01:53,967 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2024-10-11 18:01:53,967 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-11 18:01:53,967 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2024-10-11 18:01:53,967 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2024-10-11 18:01:53,968 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-11 18:01:54,104 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-11 18:01:54,104 INFO L93 Difference]: Finished difference Result 394 states and 484 transitions. [2024-10-11 18:01:54,105 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2024-10-11 18:01:54,105 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-11 18:01:54,105 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-11 18:01:54,106 INFO L225 Difference]: With dead ends: 394 [2024-10-11 18:01:54,106 INFO L226 Difference]: Without dead ends: 394 [2024-10-11 18:01:54,107 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-11 18:01:54,107 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-11 18:01:54,107 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-11 18:01:54,108 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 394 states. [2024-10-11 18:01:54,117 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 394 to 366. [2024-10-11 18:01:54,118 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-11 18:01:54,120 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 366 states to 366 states and 455 transitions. [2024-10-11 18:01:54,120 INFO L78 Accepts]: Start accepts. Automaton has 366 states and 455 transitions. Word has length 39 [2024-10-11 18:01:54,120 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-11 18:01:54,120 INFO L471 AbstractCegarLoop]: Abstraction has 366 states and 455 transitions. [2024-10-11 18:01:54,121 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-11 18:01:54,121 INFO L276 IsEmpty]: Start isEmpty. Operand 366 states and 455 transitions. [2024-10-11 18:01:54,121 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 44 [2024-10-11 18:01:54,121 INFO L207 NwaCegarLoop]: Found error trace [2024-10-11 18:01:54,122 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-11 18:01:54,141 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (13)] Ended with exit code 0 [2024-10-11 18:01:54,325 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable19,13 /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-10-11 18:01:54,326 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-11 18:01:54,326 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-11 18:01:54,326 INFO L85 PathProgramCache]: Analyzing trace with hash 626468027, now seen corresponding path program 1 times [2024-10-11 18:01:54,327 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-11 18:01:54,327 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [979666121] [2024-10-11 18:01:54,327 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 18:01:54,327 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-11 18:01:54,337 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 18:01:54,397 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2024-10-11 18:01:54,399 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 18:01:54,403 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-11 18:01:54,405 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-11 18:01:54,405 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [979666121] [2024-10-11 18:01:54,405 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [979666121] provided 0 perfect and 1 imperfect interpolant sequences [2024-10-11 18:01:54,405 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [377856003] [2024-10-11 18:01:54,405 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 18:01:54,405 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-10-11 18:01:54,405 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 [2024-10-11 18:01:54,407 INFO L229 MonitoredProcess]: Starting monitored process 14 with /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-10-11 18:01:54,408 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (14)] Waiting until timeout for monitored process [2024-10-11 18:01:54,486 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 18:01:54,487 INFO L255 TraceCheckSpWp]: Trace formula consists of 256 conjuncts, 4 conjuncts are in the unsatisfiable core [2024-10-11 18:01:54,489 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-11 18:01:54,518 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-11 18:01:54,518 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-10-11 18:01:54,518 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [377856003] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-11 18:01:54,518 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2024-10-11 18:01:54,518 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [6] total 7 [2024-10-11 18:01:54,519 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1232146527] [2024-10-11 18:01:54,519 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-11 18:01:54,519 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2024-10-11 18:01:54,519 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-11 18:01:54,520 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2024-10-11 18:01:54,520 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=27, Unknown=0, NotChecked=0, Total=42 [2024-10-11 18:01:54,520 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-11 18:01:54,543 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-11 18:01:54,543 INFO L93 Difference]: Finished difference Result 359 states and 434 transitions. [2024-10-11 18:01:54,543 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-10-11 18:01:54,544 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-11 18:01:54,544 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-11 18:01:54,545 INFO L225 Difference]: With dead ends: 359 [2024-10-11 18:01:54,545 INFO L226 Difference]: Without dead ends: 359 [2024-10-11 18:01:54,545 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-11 18:01:54,546 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-11 18:01:54,546 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-11 18:01:54,546 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 359 states. [2024-10-11 18:01:54,552 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 359 to 357. [2024-10-11 18:01:54,553 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-11 18:01:54,554 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 357 states to 357 states and 434 transitions. [2024-10-11 18:01:54,554 INFO L78 Accepts]: Start accepts. Automaton has 357 states and 434 transitions. Word has length 43 [2024-10-11 18:01:54,554 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-11 18:01:54,554 INFO L471 AbstractCegarLoop]: Abstraction has 357 states and 434 transitions. [2024-10-11 18:01:54,555 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-11 18:01:54,555 INFO L276 IsEmpty]: Start isEmpty. Operand 357 states and 434 transitions. [2024-10-11 18:01:54,555 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 45 [2024-10-11 18:01:54,555 INFO L207 NwaCegarLoop]: Found error trace [2024-10-11 18:01:54,555 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-11 18:01:54,573 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (14)] Forceful destruction successful, exit code 0 [2024-10-11 18:01:54,756 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable20,14 /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-10-11 18:01:54,757 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-11 18:01:54,757 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-11 18:01:54,758 INFO L85 PathProgramCache]: Analyzing trace with hash -1194939939, now seen corresponding path program 1 times [2024-10-11 18:01:54,758 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-11 18:01:54,758 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [878183370] [2024-10-11 18:01:54,758 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 18:01:54,758 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-11 18:01:54,769 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 18:01:54,802 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2024-10-11 18:01:54,804 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 18:01:54,808 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-11 18:01:54,808 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-11 18:01:54,809 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [878183370] [2024-10-11 18:01:54,809 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [878183370] provided 0 perfect and 1 imperfect interpolant sequences [2024-10-11 18:01:54,809 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [413574742] [2024-10-11 18:01:54,809 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 18:01:54,809 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-10-11 18:01:54,809 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 [2024-10-11 18:01:54,812 INFO L229 MonitoredProcess]: Starting monitored process 15 with /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-10-11 18:01:54,813 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (15)] Waiting until timeout for monitored process [2024-10-11 18:01:54,893 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 18:01:54,894 INFO L255 TraceCheckSpWp]: Trace formula consists of 269 conjuncts, 3 conjuncts are in the unsatisfiable core [2024-10-11 18:01:54,897 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-11 18:01:54,905 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-11 18:01:54,906 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-10-11 18:01:54,906 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [413574742] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-11 18:01:54,906 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2024-10-11 18:01:54,906 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [4] total 5 [2024-10-11 18:01:54,906 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1437804421] [2024-10-11 18:01:54,906 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-11 18:01:54,907 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-10-11 18:01:54,907 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-11 18:01:54,907 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-10-11 18:01:54,907 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2024-10-11 18:01:54,907 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-11 18:01:54,918 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-11 18:01:54,919 INFO L93 Difference]: Finished difference Result 356 states and 431 transitions. [2024-10-11 18:01:54,919 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-10-11 18:01:54,921 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-11 18:01:54,921 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-11 18:01:54,922 INFO L225 Difference]: With dead ends: 356 [2024-10-11 18:01:54,922 INFO L226 Difference]: Without dead ends: 356 [2024-10-11 18:01:54,922 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-11 18:01:54,923 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-11 18:01:54,923 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-11 18:01:54,923 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 356 states. [2024-10-11 18:01:54,927 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 356 to 356. [2024-10-11 18:01:54,928 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-11 18:01:54,929 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 356 states to 356 states and 431 transitions. [2024-10-11 18:01:54,929 INFO L78 Accepts]: Start accepts. Automaton has 356 states and 431 transitions. Word has length 44 [2024-10-11 18:01:54,929 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-11 18:01:54,930 INFO L471 AbstractCegarLoop]: Abstraction has 356 states and 431 transitions. [2024-10-11 18:01:54,930 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-11 18:01:54,930 INFO L276 IsEmpty]: Start isEmpty. Operand 356 states and 431 transitions. [2024-10-11 18:01:54,930 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 46 [2024-10-11 18:01:54,930 INFO L207 NwaCegarLoop]: Found error trace [2024-10-11 18:01:54,930 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-11 18:01:54,948 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (15)] Ended with exit code 0 [2024-10-11 18:01:55,131 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 15 /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable21 [2024-10-11 18:01:55,131 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-11 18:01:55,132 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-11 18:01:55,132 INFO L85 PathProgramCache]: Analyzing trace with hash 1611567629, now seen corresponding path program 1 times [2024-10-11 18:01:55,132 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-11 18:01:55,132 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [169289736] [2024-10-11 18:01:55,132 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 18:01:55,132 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-11 18:01:55,144 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 18:01:55,205 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2024-10-11 18:01:55,209 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 18:01:55,218 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-11 18:01:55,221 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-11 18:01:55,221 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [169289736] [2024-10-11 18:01:55,221 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [169289736] provided 0 perfect and 1 imperfect interpolant sequences [2024-10-11 18:01:55,221 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1036523785] [2024-10-11 18:01:55,221 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 18:01:55,222 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-10-11 18:01:55,222 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 [2024-10-11 18:01:55,224 INFO L229 MonitoredProcess]: Starting monitored process 16 with /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-10-11 18:01:55,226 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (16)] Waiting until timeout for monitored process [2024-10-11 18:01:55,316 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 18:01:55,317 INFO L255 TraceCheckSpWp]: Trace formula consists of 271 conjuncts, 3 conjuncts are in the unsatisfiable core [2024-10-11 18:01:55,319 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-11 18:01:55,382 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-11 18:01:55,383 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-10-11 18:01:55,383 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1036523785] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-11 18:01:55,383 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2024-10-11 18:01:55,383 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [4] total 6 [2024-10-11 18:01:55,383 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2007841780] [2024-10-11 18:01:55,384 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-11 18:01:55,385 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-10-11 18:01:55,386 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-11 18:01:55,386 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-10-11 18:01:55,386 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2024-10-11 18:01:55,386 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-11 18:01:55,415 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-11 18:01:55,416 INFO L93 Difference]: Finished difference Result 355 states and 428 transitions. [2024-10-11 18:01:55,417 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-10-11 18:01:55,418 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-11 18:01:55,418 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-11 18:01:55,419 INFO L225 Difference]: With dead ends: 355 [2024-10-11 18:01:55,419 INFO L226 Difference]: Without dead ends: 355 [2024-10-11 18:01:55,420 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-11 18:01:55,420 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-11 18:01:55,420 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-11 18:01:55,421 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 355 states. [2024-10-11 18:01:55,426 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 355 to 355. [2024-10-11 18:01:55,427 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-11 18:01:55,428 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 355 states to 355 states and 428 transitions. [2024-10-11 18:01:55,428 INFO L78 Accepts]: Start accepts. Automaton has 355 states and 428 transitions. Word has length 45 [2024-10-11 18:01:55,429 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-11 18:01:55,429 INFO L471 AbstractCegarLoop]: Abstraction has 355 states and 428 transitions. [2024-10-11 18:01:55,429 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-11 18:01:55,429 INFO L276 IsEmpty]: Start isEmpty. Operand 355 states and 428 transitions. [2024-10-11 18:01:55,430 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 47 [2024-10-11 18:01:55,430 INFO L207 NwaCegarLoop]: Found error trace [2024-10-11 18:01:55,430 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-11 18:01:55,447 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (16)] Forceful destruction successful, exit code 0 [2024-10-11 18:01:55,630 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable22,16 /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-10-11 18:01:55,631 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-11 18:01:55,631 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-11 18:01:55,631 INFO L85 PathProgramCache]: Analyzing trace with hash -1581010977, now seen corresponding path program 1 times [2024-10-11 18:01:55,631 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-11 18:01:55,632 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2089974497] [2024-10-11 18:01:55,632 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 18:01:55,632 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-11 18:01:55,641 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 18:01:55,681 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2024-10-11 18:01:55,684 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 18:01:55,689 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-11 18:01:55,690 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-11 18:01:55,690 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2089974497] [2024-10-11 18:01:55,690 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2089974497] provided 0 perfect and 1 imperfect interpolant sequences [2024-10-11 18:01:55,690 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [685230159] [2024-10-11 18:01:55,690 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 18:01:55,690 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-10-11 18:01:55,691 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 [2024-10-11 18:01:55,693 INFO L229 MonitoredProcess]: Starting monitored process 17 with /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-10-11 18:01:55,694 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (17)] Waiting until timeout for monitored process [2024-10-11 18:01:55,786 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 18:01:55,788 INFO L255 TraceCheckSpWp]: Trace formula consists of 273 conjuncts, 3 conjuncts are in the unsatisfiable core [2024-10-11 18:01:55,789 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-11 18:01:55,801 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-11 18:01:55,801 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-10-11 18:01:55,802 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [685230159] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-11 18:01:55,802 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2024-10-11 18:01:55,802 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [4] total 5 [2024-10-11 18:01:55,802 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [40703094] [2024-10-11 18:01:55,802 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-11 18:01:55,803 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-10-11 18:01:55,803 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-11 18:01:55,803 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-10-11 18:01:55,804 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2024-10-11 18:01:55,804 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-11 18:01:55,816 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-11 18:01:55,817 INFO L93 Difference]: Finished difference Result 354 states and 425 transitions. [2024-10-11 18:01:55,817 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-10-11 18:01:55,817 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-11 18:01:55,819 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-11 18:01:55,820 INFO L225 Difference]: With dead ends: 354 [2024-10-11 18:01:55,820 INFO L226 Difference]: Without dead ends: 354 [2024-10-11 18:01:55,821 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-11 18:01:55,821 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-11 18:01:55,822 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-11 18:01:55,822 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 354 states. [2024-10-11 18:01:55,827 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 354 to 354. [2024-10-11 18:01:55,828 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-11 18:01:55,829 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 354 states to 354 states and 425 transitions. [2024-10-11 18:01:55,830 INFO L78 Accepts]: Start accepts. Automaton has 354 states and 425 transitions. Word has length 46 [2024-10-11 18:01:55,830 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-11 18:01:55,830 INFO L471 AbstractCegarLoop]: Abstraction has 354 states and 425 transitions. [2024-10-11 18:01:55,830 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-11 18:01:55,830 INFO L276 IsEmpty]: Start isEmpty. Operand 354 states and 425 transitions. [2024-10-11 18:01:55,831 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 49 [2024-10-11 18:01:55,831 INFO L207 NwaCegarLoop]: Found error trace [2024-10-11 18:01:55,831 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-11 18:01:55,849 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (17)] Forceful destruction successful, exit code 0 [2024-10-11 18:01:56,032 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 17 /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable23 [2024-10-11 18:01:56,032 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-11 18:01:56,033 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-11 18:01:56,033 INFO L85 PathProgramCache]: Analyzing trace with hash -692968788, now seen corresponding path program 1 times [2024-10-11 18:01:56,033 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-11 18:01:56,033 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1306010143] [2024-10-11 18:01:56,033 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 18:01:56,034 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-11 18:01:56,050 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 18:01:56,158 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2024-10-11 18:01:56,162 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 18:01:56,187 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 21 [2024-10-11 18:01:56,191 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 18:01:56,294 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-11 18:01:56,294 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-11 18:01:56,294 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1306010143] [2024-10-11 18:01:56,295 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1306010143] provided 0 perfect and 1 imperfect interpolant sequences [2024-10-11 18:01:56,295 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [25888111] [2024-10-11 18:01:56,295 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 18:01:56,295 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-10-11 18:01:56,295 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 [2024-10-11 18:01:56,297 INFO L229 MonitoredProcess]: Starting monitored process 18 with /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-10-11 18:01:56,298 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (18)] Waiting until timeout for monitored process [2024-10-11 18:01:56,392 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 18:01:56,394 INFO L255 TraceCheckSpWp]: Trace formula consists of 298 conjuncts, 23 conjuncts are in the unsatisfiable core [2024-10-11 18:01:56,396 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-11 18:01:56,501 INFO L349 Elim1Store]: treesize reduction 4, result has 50.0 percent of original size [2024-10-11 18:01:56,502 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-11 18:01:56,624 INFO L349 Elim1Store]: treesize reduction 20, result has 33.3 percent of original size [2024-10-11 18:01:56,625 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-11 18:01:56,666 INFO L349 Elim1Store]: treesize reduction 13, result has 40.9 percent of original size [2024-10-11 18:01:56,666 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-11 18:01:56,718 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-11 18:01:56,718 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-10-11 18:01:56,768 INFO L349 Elim1Store]: treesize reduction 5, result has 37.5 percent of original size [2024-10-11 18:01:56,769 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-11 18:01:56,967 INFO L349 Elim1Store]: treesize reduction 5, result has 37.5 percent of original size [2024-10-11 18:01:56,967 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-11 18:01:57,121 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-11 18:01:57,121 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [25888111] provided 0 perfect and 2 imperfect interpolant sequences [2024-10-11 18:01:57,121 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2024-10-11 18:01:57,122 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [10, 8, 10] total 25 [2024-10-11 18:01:57,122 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1763295657] [2024-10-11 18:01:57,122 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2024-10-11 18:01:57,122 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 26 states [2024-10-11 18:01:57,122 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-11 18:01:57,123 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 26 interpolants. [2024-10-11 18:01:57,123 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=106, Invalid=544, Unknown=0, NotChecked=0, Total=650 [2024-10-11 18:01:57,123 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-11 18:01:57,348 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-11 18:01:57,348 INFO L93 Difference]: Finished difference Result 360 states and 429 transitions. [2024-10-11 18:01:57,349 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2024-10-11 18:01:57,349 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-11 18:01:57,349 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-11 18:01:57,350 INFO L225 Difference]: With dead ends: 360 [2024-10-11 18:01:57,350 INFO L226 Difference]: Without dead ends: 360 [2024-10-11 18:01:57,351 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 118 GetRequests, 88 SyntacticMatches, 0 SemanticMatches, 30 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 217 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=206, Invalid=786, Unknown=0, NotChecked=0, Total=992 [2024-10-11 18:01:57,351 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.1s IncrementalHoareTripleChecker+Time [2024-10-11 18:01:57,351 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.1s Time] [2024-10-11 18:01:57,353 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 360 states. [2024-10-11 18:01:57,357 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 360 to 354. [2024-10-11 18:01:57,357 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-11 18:01:57,358 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 354 states to 354 states and 424 transitions. [2024-10-11 18:01:57,359 INFO L78 Accepts]: Start accepts. Automaton has 354 states and 424 transitions. Word has length 48 [2024-10-11 18:01:57,359 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-11 18:01:57,359 INFO L471 AbstractCegarLoop]: Abstraction has 354 states and 424 transitions. [2024-10-11 18:01:57,359 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-11 18:01:57,359 INFO L276 IsEmpty]: Start isEmpty. Operand 354 states and 424 transitions. [2024-10-11 18:01:57,360 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 49 [2024-10-11 18:01:57,360 INFO L207 NwaCegarLoop]: Found error trace [2024-10-11 18:01:57,360 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-11 18:01:57,377 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (18)] Ended with exit code 0 [2024-10-11 18:01:57,564 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable24,18 /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-10-11 18:01:57,565 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-11 18:01:57,565 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-11 18:01:57,565 INFO L85 PathProgramCache]: Analyzing trace with hash -1799098819, now seen corresponding path program 1 times [2024-10-11 18:01:57,565 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-11 18:01:57,565 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [88002992] [2024-10-11 18:01:57,565 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 18:01:57,565 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-11 18:01:57,580 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 18:01:57,628 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2024-10-11 18:01:57,636 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 18:01:57,655 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 21 [2024-10-11 18:01:57,658 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 18:01:57,682 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-11 18:01:57,682 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-11 18:01:57,682 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [88002992] [2024-10-11 18:01:57,682 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [88002992] provided 0 perfect and 1 imperfect interpolant sequences [2024-10-11 18:01:57,682 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1640120420] [2024-10-11 18:01:57,682 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 18:01:57,682 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-10-11 18:01:57,682 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 [2024-10-11 18:01:57,684 INFO L229 MonitoredProcess]: Starting monitored process 19 with /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-10-11 18:01:57,685 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (19)] Waiting until timeout for monitored process [2024-10-11 18:01:57,781 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 18:01:57,783 INFO L255 TraceCheckSpWp]: Trace formula consists of 306 conjuncts, 21 conjuncts are in the unsatisfiable core [2024-10-11 18:01:57,785 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-11 18:01:57,836 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-11 18:01:57,865 INFO L349 Elim1Store]: treesize reduction 13, result has 40.9 percent of original size [2024-10-11 18:01:57,866 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-11 18:01:58,019 INFO L349 Elim1Store]: treesize reduction 20, result has 33.3 percent of original size [2024-10-11 18:01:58,020 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-11 18:01:58,065 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-11 18:01:58,066 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-10-11 18:01:58,159 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1640120420] provided 0 perfect and 1 imperfect interpolant sequences [2024-10-11 18:01:58,159 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2024-10-11 18:01:58,160 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 10] total 17 [2024-10-11 18:01:58,160 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [334260355] [2024-10-11 18:01:58,160 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2024-10-11 18:01:58,160 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 17 states [2024-10-11 18:01:58,160 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-11 18:01:58,161 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 17 interpolants. [2024-10-11 18:01:58,161 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=55, Invalid=290, Unknown=1, NotChecked=34, Total=380 [2024-10-11 18:01:58,161 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-11 18:01:58,856 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-11 18:01:58,856 INFO L93 Difference]: Finished difference Result 332 states and 381 transitions. [2024-10-11 18:01:58,857 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 24 states. [2024-10-11 18:01:58,858 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-11 18:01:58,858 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-11 18:01:58,859 INFO L225 Difference]: With dead ends: 332 [2024-10-11 18:01:58,859 INFO L226 Difference]: Without dead ends: 332 [2024-10-11 18:01:58,860 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-11 18:01:58,860 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.3s IncrementalHoareTripleChecker+Time [2024-10-11 18:01:58,860 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.3s Time] [2024-10-11 18:01:58,861 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 332 states. [2024-10-11 18:01:58,884 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 332 to 311. [2024-10-11 18:01:58,885 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-11 18:01:58,886 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 311 states to 311 states and 364 transitions. [2024-10-11 18:01:58,886 INFO L78 Accepts]: Start accepts. Automaton has 311 states and 364 transitions. Word has length 48 [2024-10-11 18:01:58,887 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-11 18:01:58,887 INFO L471 AbstractCegarLoop]: Abstraction has 311 states and 364 transitions. [2024-10-11 18:01:58,887 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-11 18:01:58,887 INFO L276 IsEmpty]: Start isEmpty. Operand 311 states and 364 transitions. [2024-10-11 18:01:58,887 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 50 [2024-10-11 18:01:58,888 INFO L207 NwaCegarLoop]: Found error trace [2024-10-11 18:01:58,888 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-11 18:01:58,905 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (19)] Forceful destruction successful, exit code 0 [2024-10-11 18:01:59,088 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 19 /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable25 [2024-10-11 18:01:59,089 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-11 18:01:59,089 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-11 18:01:59,089 INFO L85 PathProgramCache]: Analyzing trace with hash -7195967, now seen corresponding path program 1 times [2024-10-11 18:01:59,090 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-11 18:01:59,090 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [313158655] [2024-10-11 18:01:59,090 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 18:01:59,090 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-11 18:01:59,105 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 18:01:59,324 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2024-10-11 18:01:59,328 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 18:01:59,395 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 21 [2024-10-11 18:01:59,400 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 18:01:59,724 INFO L134 CoverageAnalysis]: Checked inductivity of 27 backedges. 0 proven. 26 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2024-10-11 18:01:59,725 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-11 18:01:59,725 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [313158655] [2024-10-11 18:01:59,725 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [313158655] provided 0 perfect and 1 imperfect interpolant sequences [2024-10-11 18:01:59,725 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1238165685] [2024-10-11 18:01:59,725 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 18:01:59,725 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-10-11 18:01:59,726 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 [2024-10-11 18:01:59,727 INFO L229 MonitoredProcess]: Starting monitored process 20 with /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-10-11 18:01:59,729 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (20)] Waiting until timeout for monitored process [2024-10-11 18:01:59,820 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 18:01:59,822 INFO L255 TraceCheckSpWp]: Trace formula consists of 306 conjuncts, 33 conjuncts are in the unsatisfiable core [2024-10-11 18:01:59,824 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-11 18:01:59,991 INFO L349 Elim1Store]: treesize reduction 4, result has 50.0 percent of original size [2024-10-11 18:01:59,991 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-11 18:02:00,154 INFO L349 Elim1Store]: treesize reduction 20, result has 33.3 percent of original size [2024-10-11 18:02:00,154 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-11 18:02:00,205 INFO L349 Elim1Store]: treesize reduction 13, result has 40.9 percent of original size [2024-10-11 18:02:00,205 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-11 18:02:00,344 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-11 18:02:00,344 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-10-11 18:02:00,443 INFO L349 Elim1Store]: treesize reduction 5, result has 58.3 percent of original size [2024-10-11 18:02:00,443 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 178 treesize of output 165 [2024-10-11 18:02:00,714 INFO L349 Elim1Store]: treesize reduction 5, result has 84.8 percent of original size [2024-10-11 18:02:00,714 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 3 select indices, 3 select index equivalence classes, 1 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 3 case distinctions, treesize of input 174 treesize of output 185 [2024-10-11 18:02:01,026 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-11 18:02:01,026 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1238165685] provided 0 perfect and 2 imperfect interpolant sequences [2024-10-11 18:02:01,027 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2024-10-11 18:02:01,027 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [16, 12, 14] total 39 [2024-10-11 18:02:01,027 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [299607547] [2024-10-11 18:02:01,027 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2024-10-11 18:02:01,027 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 41 states [2024-10-11 18:02:01,027 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-11 18:02:01,028 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 41 interpolants. [2024-10-11 18:02:01,029 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=177, Invalid=1463, Unknown=0, NotChecked=0, Total=1640 [2024-10-11 18:02:01,029 INFO L87 Difference]: Start difference. First operand 311 states and 364 transitions. Second operand has 41 states, 37 states have (on average 3.5135135135135136) internal successors, (130), 33 states have internal predecessors, (130), 6 states have call successors, (9), 8 states have call predecessors, (9), 6 states have return successors, (6), 5 states have call predecessors, (6), 4 states have call successors, (6) [2024-10-11 18:02:01,823 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-11 18:02:01,823 INFO L93 Difference]: Finished difference Result 329 states and 377 transitions. [2024-10-11 18:02:01,824 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 16 states. [2024-10-11 18:02:01,824 INFO L78 Accepts]: Start accepts. Automaton has has 41 states, 37 states have (on average 3.5135135135135136) internal successors, (130), 33 states have internal predecessors, (130), 6 states have call successors, (9), 8 states have call predecessors, (9), 6 states have return successors, (6), 5 states have call predecessors, (6), 4 states have call successors, (6) Word has length 49 [2024-10-11 18:02:01,824 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-11 18:02:01,826 INFO L225 Difference]: With dead ends: 329 [2024-10-11 18:02:01,826 INFO L226 Difference]: Without dead ends: 329 [2024-10-11 18:02:01,827 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 126 GetRequests, 75 SyntacticMatches, 0 SemanticMatches, 51 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 655 ImplicationChecksByTransitivity, 1.0s TimeCoverageRelationStatistics Valid=450, Invalid=2306, Unknown=0, NotChecked=0, Total=2756 [2024-10-11 18:02:01,827 INFO L432 NwaCegarLoop]: 20 mSDtfsCounter, 684 mSDsluCounter, 239 mSDsCounter, 0 mSdLazyCounter, 681 mSolverCounterSat, 144 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 684 SdHoareTripleChecker+Valid, 259 SdHoareTripleChecker+Invalid, 825 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 144 IncrementalHoareTripleChecker+Valid, 681 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2024-10-11 18:02:01,828 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [684 Valid, 259 Invalid, 825 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [144 Valid, 681 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time] [2024-10-11 18:02:01,828 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 329 states. [2024-10-11 18:02:01,832 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 329 to 311. [2024-10-11 18:02:01,833 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-11 18:02:01,835 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 311 states to 311 states and 363 transitions. [2024-10-11 18:02:01,835 INFO L78 Accepts]: Start accepts. Automaton has 311 states and 363 transitions. Word has length 49 [2024-10-11 18:02:01,835 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-11 18:02:01,836 INFO L471 AbstractCegarLoop]: Abstraction has 311 states and 363 transitions. [2024-10-11 18:02:01,836 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 41 states, 37 states have (on average 3.5135135135135136) internal successors, (130), 33 states have internal predecessors, (130), 6 states have call successors, (9), 8 states have call predecessors, (9), 6 states have return successors, (6), 5 states have call predecessors, (6), 4 states have call successors, (6) [2024-10-11 18:02:01,836 INFO L276 IsEmpty]: Start isEmpty. Operand 311 states and 363 transitions. [2024-10-11 18:02:01,836 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 50 [2024-10-11 18:02:01,837 INFO L207 NwaCegarLoop]: Found error trace [2024-10-11 18:02:01,837 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-11 18:02:01,859 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (20)] Ended with exit code 0 [2024-10-11 18:02:02,037 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable26,20 /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-10-11 18:02:02,038 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-11 18:02:02,038 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-11 18:02:02,039 INFO L85 PathProgramCache]: Analyzing trace with hash -1286570351, now seen corresponding path program 1 times [2024-10-11 18:02:02,039 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-11 18:02:02,039 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [318482516] [2024-10-11 18:02:02,039 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 18:02:02,039 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-11 18:02:02,049 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 18:02:02,080 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2024-10-11 18:02:02,083 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 18:02:02,087 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-11 18:02:02,088 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-11 18:02:02,088 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [318482516] [2024-10-11 18:02:02,088 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [318482516] provided 0 perfect and 1 imperfect interpolant sequences [2024-10-11 18:02:02,088 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1276704916] [2024-10-11 18:02:02,088 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 18:02:02,088 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-10-11 18:02:02,088 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 [2024-10-11 18:02:02,090 INFO L229 MonitoredProcess]: Starting monitored process 21 with /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-10-11 18:02:02,091 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (21)] Waiting until timeout for monitored process [2024-10-11 18:02:02,177 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 18:02:02,179 INFO L255 TraceCheckSpWp]: Trace formula consists of 280 conjuncts, 5 conjuncts are in the unsatisfiable core [2024-10-11 18:02:02,181 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-11 18:02:02,186 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-11 18:02:02,186 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-10-11 18:02:02,186 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1276704916] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-11 18:02:02,186 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2024-10-11 18:02:02,186 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [4] total 4 [2024-10-11 18:02:02,187 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1263621521] [2024-10-11 18:02:02,187 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-11 18:02:02,187 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-10-11 18:02:02,187 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-11 18:02:02,187 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-10-11 18:02:02,188 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-10-11 18:02:02,188 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-11 18:02:02,197 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-11 18:02:02,197 INFO L93 Difference]: Finished difference Result 252 states and 286 transitions. [2024-10-11 18:02:02,197 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-10-11 18:02:02,197 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-11 18:02:02,197 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-11 18:02:02,198 INFO L225 Difference]: With dead ends: 252 [2024-10-11 18:02:02,198 INFO L226 Difference]: Without dead ends: 252 [2024-10-11 18:02:02,198 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-11 18:02:02,199 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-11 18:02:02,199 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-11 18:02:02,199 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 252 states. [2024-10-11 18:02:02,203 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 252 to 249. [2024-10-11 18:02:02,203 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-11 18:02:02,204 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 249 states to 249 states and 283 transitions. [2024-10-11 18:02:02,204 INFO L78 Accepts]: Start accepts. Automaton has 249 states and 283 transitions. Word has length 49 [2024-10-11 18:02:02,204 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-11 18:02:02,204 INFO L471 AbstractCegarLoop]: Abstraction has 249 states and 283 transitions. [2024-10-11 18:02:02,205 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-11 18:02:02,205 INFO L276 IsEmpty]: Start isEmpty. Operand 249 states and 283 transitions. [2024-10-11 18:02:02,206 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 52 [2024-10-11 18:02:02,206 INFO L207 NwaCegarLoop]: Found error trace [2024-10-11 18:02:02,206 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-11 18:02:02,223 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (21)] Forceful destruction successful, exit code 0 [2024-10-11 18:02:02,411 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 21 /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable27 [2024-10-11 18:02:02,412 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-11 18:02:02,412 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-11 18:02:02,412 INFO L85 PathProgramCache]: Analyzing trace with hash -1846003179, now seen corresponding path program 1 times [2024-10-11 18:02:02,412 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-11 18:02:02,412 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [198425315] [2024-10-11 18:02:02,412 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 18:02:02,412 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-11 18:02:02,430 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 18:02:02,571 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2024-10-11 18:02:02,575 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 18:02:02,607 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 23 [2024-10-11 18:02:02,612 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 18:02:02,700 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-11 18:02:02,701 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-11 18:02:02,701 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [198425315] [2024-10-11 18:02:02,701 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [198425315] provided 0 perfect and 1 imperfect interpolant sequences [2024-10-11 18:02:02,701 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [72879918] [2024-10-11 18:02:02,701 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 18:02:02,702 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-10-11 18:02:02,702 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 [2024-10-11 18:02:02,703 INFO L229 MonitoredProcess]: Starting monitored process 22 with /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-10-11 18:02:02,705 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (22)] Waiting until timeout for monitored process [2024-10-11 18:02:02,793 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 18:02:02,796 INFO L255 TraceCheckSpWp]: Trace formula consists of 290 conjuncts, 25 conjuncts are in the unsatisfiable core [2024-10-11 18:02:02,798 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-11 18:02:02,951 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-10-11 18:02:02,953 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-11 18:02:03,021 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-11 18:02:03,022 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-10-11 18:02:03,136 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [72879918] provided 0 perfect and 1 imperfect interpolant sequences [2024-10-11 18:02:03,136 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2024-10-11 18:02:03,136 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [9, 6] total 14 [2024-10-11 18:02:03,136 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [306273525] [2024-10-11 18:02:03,137 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2024-10-11 18:02:03,137 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 16 states [2024-10-11 18:02:03,137 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-11 18:02:03,138 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 16 interpolants. [2024-10-11 18:02:03,138 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=68, Invalid=312, Unknown=0, NotChecked=0, Total=380 [2024-10-11 18:02:03,138 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-11 18:02:03,665 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-11 18:02:03,665 INFO L93 Difference]: Finished difference Result 260 states and 288 transitions. [2024-10-11 18:02:03,666 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 17 states. [2024-10-11 18:02:03,666 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-11 18:02:03,666 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-11 18:02:03,667 INFO L225 Difference]: With dead ends: 260 [2024-10-11 18:02:03,668 INFO L226 Difference]: Without dead ends: 260 [2024-10-11 18:02:03,669 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 83 GetRequests, 52 SyntacticMatches, 0 SemanticMatches, 31 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 164 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=262, Invalid=794, Unknown=0, NotChecked=0, Total=1056 [2024-10-11 18:02:03,670 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-11 18:02:03,670 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-11 18:02:03,674 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 260 states. [2024-10-11 18:02:03,678 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 260 to 248. [2024-10-11 18:02:03,681 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-11 18:02:03,682 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 248 states to 248 states and 277 transitions. [2024-10-11 18:02:03,682 INFO L78 Accepts]: Start accepts. Automaton has 248 states and 277 transitions. Word has length 51 [2024-10-11 18:02:03,682 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-11 18:02:03,682 INFO L471 AbstractCegarLoop]: Abstraction has 248 states and 277 transitions. [2024-10-11 18:02:03,683 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-11 18:02:03,683 INFO L276 IsEmpty]: Start isEmpty. Operand 248 states and 277 transitions. [2024-10-11 18:02:03,683 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 52 [2024-10-11 18:02:03,683 INFO L207 NwaCegarLoop]: Found error trace [2024-10-11 18:02:03,683 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-11 18:02:03,705 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (22)] Forceful destruction successful, exit code 0 [2024-10-11 18:02:03,884 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 22 /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable28 [2024-10-11 18:02:03,885 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-11 18:02:03,885 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-11 18:02:03,885 INFO L85 PathProgramCache]: Analyzing trace with hash 1674611747, now seen corresponding path program 1 times [2024-10-11 18:02:03,885 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-11 18:02:03,885 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1750473130] [2024-10-11 18:02:03,885 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 18:02:03,885 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-11 18:02:03,897 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 18:02:04,055 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2024-10-11 18:02:04,060 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 18:02:04,130 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 21 [2024-10-11 18:02:04,135 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 18:02:04,274 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-11 18:02:04,275 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-11 18:02:04,275 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1750473130] [2024-10-11 18:02:04,275 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1750473130] provided 0 perfect and 1 imperfect interpolant sequences [2024-10-11 18:02:04,275 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1704734548] [2024-10-11 18:02:04,275 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 18:02:04,275 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-10-11 18:02:04,276 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 [2024-10-11 18:02:04,277 INFO L229 MonitoredProcess]: Starting monitored process 23 with /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-10-11 18:02:04,280 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (23)] Waiting until timeout for monitored process [2024-10-11 18:02:04,373 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 18:02:04,375 INFO L255 TraceCheckSpWp]: Trace formula consists of 310 conjuncts, 26 conjuncts are in the unsatisfiable core [2024-10-11 18:02:04,378 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-11 18:02:04,458 INFO L349 Elim1Store]: treesize reduction 20, result has 33.3 percent of original size [2024-10-11 18:02:04,459 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-11 18:02:04,685 INFO L349 Elim1Store]: treesize reduction 57, result has 30.5 percent of original size [2024-10-11 18:02:04,686 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-11 18:02:04,778 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-11 18:02:04,789 INFO L349 Elim1Store]: treesize reduction 49, result has 2.0 percent of original size [2024-10-11 18:02:04,790 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-11 18:02:04,839 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-11 18:02:04,839 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-10-11 18:02:04,929 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1704734548] provided 0 perfect and 1 imperfect interpolant sequences [2024-10-11 18:02:04,930 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2024-10-11 18:02:04,930 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [12, 10] total 19 [2024-10-11 18:02:04,930 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2074529444] [2024-10-11 18:02:04,930 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2024-10-11 18:02:04,931 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 21 states [2024-10-11 18:02:04,931 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-11 18:02:04,931 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 21 interpolants. [2024-10-11 18:02:04,932 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=73, Invalid=389, Unknown=0, NotChecked=0, Total=462 [2024-10-11 18:02:04,932 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-11 18:02:05,561 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-11 18:02:05,561 INFO L93 Difference]: Finished difference Result 256 states and 285 transitions. [2024-10-11 18:02:05,562 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2024-10-11 18:02:05,562 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-11 18:02:05,562 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-11 18:02:05,563 INFO L225 Difference]: With dead ends: 256 [2024-10-11 18:02:05,563 INFO L226 Difference]: Without dead ends: 256 [2024-10-11 18:02:05,564 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 84 GetRequests, 52 SyntacticMatches, 0 SemanticMatches, 32 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 193 ImplicationChecksByTransitivity, 0.6s TimeCoverageRelationStatistics Valid=237, Invalid=885, Unknown=0, NotChecked=0, Total=1122 [2024-10-11 18:02:05,565 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-11 18:02:05,565 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-11 18:02:05,566 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 256 states. [2024-10-11 18:02:05,571 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 256 to 247. [2024-10-11 18:02:05,574 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-11 18:02:05,574 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 247 states to 247 states and 276 transitions. [2024-10-11 18:02:05,574 INFO L78 Accepts]: Start accepts. Automaton has 247 states and 276 transitions. Word has length 51 [2024-10-11 18:02:05,574 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-11 18:02:05,575 INFO L471 AbstractCegarLoop]: Abstraction has 247 states and 276 transitions. [2024-10-11 18:02:05,575 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-11 18:02:05,575 INFO L276 IsEmpty]: Start isEmpty. Operand 247 states and 276 transitions. [2024-10-11 18:02:05,575 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 58 [2024-10-11 18:02:05,575 INFO L207 NwaCegarLoop]: Found error trace [2024-10-11 18:02:05,576 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-11 18:02:05,596 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (23)] Forceful destruction successful, exit code 0 [2024-10-11 18:02:05,776 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable29,23 /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-10-11 18:02:05,776 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-11 18:02:05,777 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-11 18:02:05,777 INFO L85 PathProgramCache]: Analyzing trace with hash -978466150, now seen corresponding path program 1 times [2024-10-11 18:02:05,777 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-11 18:02:05,777 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1675073317] [2024-10-11 18:02:05,777 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 18:02:05,777 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-11 18:02:05,802 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 18:02:06,087 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2024-10-11 18:02:06,092 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 18:02:06,186 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 21 [2024-10-11 18:02:06,191 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 18:02:06,361 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-11 18:02:06,362 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-11 18:02:06,362 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1675073317] [2024-10-11 18:02:06,362 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1675073317] provided 0 perfect and 1 imperfect interpolant sequences [2024-10-11 18:02:06,362 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [794553981] [2024-10-11 18:02:06,362 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 18:02:06,363 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-10-11 18:02:06,363 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 [2024-10-11 18:02:06,365 INFO L229 MonitoredProcess]: Starting monitored process 24 with /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-10-11 18:02:06,367 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (24)] Waiting until timeout for monitored process [2024-10-11 18:02:06,475 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 18:02:06,477 INFO L255 TraceCheckSpWp]: Trace formula consists of 326 conjuncts, 43 conjuncts are in the unsatisfiable core [2024-10-11 18:02:06,479 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-11 18:02:06,775 INFO L349 Elim1Store]: treesize reduction 20, result has 33.3 percent of original size [2024-10-11 18:02:06,775 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-11 18:02:07,328 INFO L349 Elim1Store]: treesize reduction 57, result has 26.9 percent of original size [2024-10-11 18:02:07,328 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-11 18:02:07,393 INFO L349 Elim1Store]: treesize reduction 18, result has 5.3 percent of original size [2024-10-11 18:02:07,393 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-11 18:02:08,117 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-11 18:02:08,117 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-10-11 18:02:08,330 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [794553981] provided 0 perfect and 1 imperfect interpolant sequences [2024-10-11 18:02:08,330 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2024-10-11 18:02:08,330 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [15, 16] total 31 [2024-10-11 18:02:08,331 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2018329178] [2024-10-11 18:02:08,331 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2024-10-11 18:02:08,331 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 33 states [2024-10-11 18:02:08,331 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-11 18:02:08,332 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 33 interpolants. [2024-10-11 18:02:08,332 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=175, Invalid=1307, Unknown=0, NotChecked=0, Total=1482 [2024-10-11 18:02:08,333 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-11 18:02:09,830 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-11 18:02:09,830 INFO L93 Difference]: Finished difference Result 258 states and 286 transitions. [2024-10-11 18:02:09,830 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 24 states. [2024-10-11 18:02:09,831 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-11 18:02:09,831 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-11 18:02:09,832 INFO L225 Difference]: With dead ends: 258 [2024-10-11 18:02:09,832 INFO L226 Difference]: Without dead ends: 258 [2024-10-11 18:02:09,833 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-11 18:02:09,834 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-11 18:02:09,834 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-11 18:02:09,835 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 258 states. [2024-10-11 18:02:09,838 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 258 to 246. [2024-10-11 18:02:09,841 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-11 18:02:09,842 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 246 states to 246 states and 275 transitions. [2024-10-11 18:02:09,842 INFO L78 Accepts]: Start accepts. Automaton has 246 states and 275 transitions. Word has length 57 [2024-10-11 18:02:09,842 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-11 18:02:09,842 INFO L471 AbstractCegarLoop]: Abstraction has 246 states and 275 transitions. [2024-10-11 18:02:09,842 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-11 18:02:09,843 INFO L276 IsEmpty]: Start isEmpty. Operand 246 states and 275 transitions. [2024-10-11 18:02:09,843 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 59 [2024-10-11 18:02:09,844 INFO L207 NwaCegarLoop]: Found error trace [2024-10-11 18:02:09,844 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-11 18:02:09,857 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (24)] Forceful destruction successful, exit code 0 [2024-10-11 18:02:10,044 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable30,24 /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-10-11 18:02:10,045 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-11 18:02:10,045 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-11 18:02:10,045 INFO L85 PathProgramCache]: Analyzing trace with hash -267679533, now seen corresponding path program 1 times [2024-10-11 18:02:10,045 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-11 18:02:10,045 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [383938933] [2024-10-11 18:02:10,045 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 18:02:10,045 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-11 18:02:10,064 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 18:02:10,462 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2024-10-11 18:02:10,465 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 18:02:10,533 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 21 [2024-10-11 18:02:10,537 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 18:02:10,733 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-11 18:02:10,734 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-11 18:02:10,734 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [383938933] [2024-10-11 18:02:10,734 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [383938933] provided 0 perfect and 1 imperfect interpolant sequences [2024-10-11 18:02:10,734 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1658196553] [2024-10-11 18:02:10,734 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 18:02:10,734 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-10-11 18:02:10,734 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 [2024-10-11 18:02:10,736 INFO L229 MonitoredProcess]: Starting monitored process 25 with /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-10-11 18:02:10,737 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (25)] Waiting until timeout for monitored process [2024-10-11 18:02:10,820 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 18:02:10,822 INFO L255 TraceCheckSpWp]: Trace formula consists of 328 conjuncts, 35 conjuncts are in the unsatisfiable core [2024-10-11 18:02:10,824 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-11 18:02:11,072 INFO L349 Elim1Store]: treesize reduction 20, result has 33.3 percent of original size [2024-10-11 18:02:11,072 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-11 18:02:11,075 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-11 18:02:11,270 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-10-11 18:02:11,271 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-11 18:02:11,441 INFO L134 CoverageAnalysis]: Checked inductivity of 47 backedges. 0 proven. 35 refuted. 0 times theorem prover too weak. 12 trivial. 0 not checked. [2024-10-11 18:02:11,441 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-10-11 18:02:11,641 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1658196553] provided 0 perfect and 1 imperfect interpolant sequences [2024-10-11 18:02:11,641 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2024-10-11 18:02:11,641 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [17, 8] total 25 [2024-10-11 18:02:11,641 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2104940473] [2024-10-11 18:02:11,641 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2024-10-11 18:02:11,642 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 27 states [2024-10-11 18:02:11,642 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-11 18:02:11,642 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 27 interpolants. [2024-10-11 18:02:11,642 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=103, Invalid=889, Unknown=0, NotChecked=0, Total=992 [2024-10-11 18:02:11,643 INFO L87 Difference]: Start difference. First operand 246 states and 275 transitions. Second operand has 27 states, 23 states have (on average 4.130434782608695) internal successors, (95), 22 states have internal predecessors, (95), 5 states have call successors, (6), 4 states have call predecessors, (6), 4 states have return successors, (4), 4 states have call predecessors, (4), 3 states have call successors, (4) [2024-10-11 18:02:12,720 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-11 18:02:12,720 INFO L93 Difference]: Finished difference Result 271 states and 298 transitions. [2024-10-11 18:02:12,721 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 22 states. [2024-10-11 18:02:12,721 INFO L78 Accepts]: Start accepts. Automaton has has 27 states, 23 states have (on average 4.130434782608695) internal successors, (95), 22 states have internal predecessors, (95), 5 states have call successors, (6), 4 states have call predecessors, (6), 4 states have return successors, (4), 4 states have call predecessors, (4), 3 states have call successors, (4) Word has length 58 [2024-10-11 18:02:12,721 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-11 18:02:12,722 INFO L225 Difference]: With dead ends: 271 [2024-10-11 18:02:12,722 INFO L226 Difference]: Without dead ends: 271 [2024-10-11 18:02:12,723 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 111 GetRequests, 61 SyntacticMatches, 0 SemanticMatches, 50 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 619 ImplicationChecksByTransitivity, 1.3s TimeCoverageRelationStatistics Valid=464, Invalid=2188, Unknown=0, NotChecked=0, Total=2652 [2024-10-11 18:02:12,724 INFO L432 NwaCegarLoop]: 18 mSDtfsCounter, 294 mSDsluCounter, 159 mSDsCounter, 0 mSdLazyCounter, 511 mSolverCounterSat, 46 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 294 SdHoareTripleChecker+Valid, 177 SdHoareTripleChecker+Invalid, 557 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 46 IncrementalHoareTripleChecker+Valid, 511 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2024-10-11 18:02:12,724 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [294 Valid, 177 Invalid, 557 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [46 Valid, 511 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2024-10-11 18:02:12,724 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 271 states. [2024-10-11 18:02:12,728 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 271 to 245. [2024-10-11 18:02:12,728 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-11 18:02:12,729 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 245 states to 245 states and 274 transitions. [2024-10-11 18:02:12,729 INFO L78 Accepts]: Start accepts. Automaton has 245 states and 274 transitions. Word has length 58 [2024-10-11 18:02:12,729 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-11 18:02:12,730 INFO L471 AbstractCegarLoop]: Abstraction has 245 states and 274 transitions. [2024-10-11 18:02:12,730 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 27 states, 23 states have (on average 4.130434782608695) internal successors, (95), 22 states have internal predecessors, (95), 5 states have call successors, (6), 4 states have call predecessors, (6), 4 states have return successors, (4), 4 states have call predecessors, (4), 3 states have call successors, (4) [2024-10-11 18:02:12,730 INFO L276 IsEmpty]: Start isEmpty. Operand 245 states and 274 transitions. [2024-10-11 18:02:12,730 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 63 [2024-10-11 18:02:12,731 INFO L207 NwaCegarLoop]: Found error trace [2024-10-11 18:02:12,731 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-11 18:02:12,748 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (25)] Forceful destruction successful, exit code 0 [2024-10-11 18:02:12,931 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 25 /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable31 [2024-10-11 18:02:12,932 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-11 18:02:12,932 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-11 18:02:12,932 INFO L85 PathProgramCache]: Analyzing trace with hash -1896944505, now seen corresponding path program 1 times [2024-10-11 18:02:12,932 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-11 18:02:12,932 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1759514308] [2024-10-11 18:02:12,932 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 18:02:12,933 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-11 18:02:12,945 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 18:02:13,095 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2024-10-11 18:02:13,098 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 18:02:13,118 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 21 [2024-10-11 18:02:13,122 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 18:02:13,230 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-11 18:02:13,230 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-11 18:02:13,230 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1759514308] [2024-10-11 18:02:13,230 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1759514308] provided 0 perfect and 1 imperfect interpolant sequences [2024-10-11 18:02:13,230 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1192761764] [2024-10-11 18:02:13,230 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 18:02:13,230 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-10-11 18:02:13,230 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 [2024-10-11 18:02:13,232 INFO L229 MonitoredProcess]: Starting monitored process 26 with /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-10-11 18:02:13,233 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (26)] Waiting until timeout for monitored process [2024-10-11 18:02:13,315 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 18:02:13,317 INFO L255 TraceCheckSpWp]: Trace formula consists of 350 conjuncts, 29 conjuncts are in the unsatisfiable core [2024-10-11 18:02:13,318 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-11 18:02:13,321 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-11 18:02:13,425 INFO L349 Elim1Store]: treesize reduction 20, result has 33.3 percent of original size [2024-10-11 18:02:13,426 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-11 18:02:13,450 INFO L349 Elim1Store]: treesize reduction 15, result has 25.0 percent of original size [2024-10-11 18:02:13,450 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-11 18:02:13,459 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-11 18:02:13,459 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-10-11 18:02:13,536 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1192761764] provided 0 perfect and 1 imperfect interpolant sequences [2024-10-11 18:02:13,536 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2024-10-11 18:02:13,536 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [8, 7] total 11 [2024-10-11 18:02:13,536 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2069742685] [2024-10-11 18:02:13,536 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2024-10-11 18:02:13,537 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 12 states [2024-10-11 18:02:13,537 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-11 18:02:13,537 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2024-10-11 18:02:13,537 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=34, Invalid=122, Unknown=0, NotChecked=0, Total=156 [2024-10-11 18:02:13,538 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-11 18:02:13,747 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-11 18:02:13,747 INFO L93 Difference]: Finished difference Result 256 states and 284 transitions. [2024-10-11 18:02:13,748 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2024-10-11 18:02:13,748 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-11 18:02:13,748 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-11 18:02:13,749 INFO L225 Difference]: With dead ends: 256 [2024-10-11 18:02:13,749 INFO L226 Difference]: Without dead ends: 256 [2024-10-11 18:02:13,749 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 101 GetRequests, 83 SyntacticMatches, 2 SemanticMatches, 16 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 38 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=69, Invalid=237, Unknown=0, NotChecked=0, Total=306 [2024-10-11 18:02:13,750 INFO L432 NwaCegarLoop]: 34 mSDtfsCounter, 35 mSDsluCounter, 127 mSDsCounter, 0 mSdLazyCounter, 247 mSolverCounterSat, 8 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 35 SdHoareTripleChecker+Valid, 161 SdHoareTripleChecker+Invalid, 255 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 8 IncrementalHoareTripleChecker+Valid, 247 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-10-11 18:02:13,750 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [35 Valid, 161 Invalid, 255 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [8 Valid, 247 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-10-11 18:02:13,750 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 256 states. [2024-10-11 18:02:13,754 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 256 to 201. [2024-10-11 18:02:13,754 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-11 18:02:13,755 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 201 states to 201 states and 225 transitions. [2024-10-11 18:02:13,755 INFO L78 Accepts]: Start accepts. Automaton has 201 states and 225 transitions. Word has length 62 [2024-10-11 18:02:13,755 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-11 18:02:13,755 INFO L471 AbstractCegarLoop]: Abstraction has 201 states and 225 transitions. [2024-10-11 18:02:13,755 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-11 18:02:13,756 INFO L276 IsEmpty]: Start isEmpty. Operand 201 states and 225 transitions. [2024-10-11 18:02:13,756 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 68 [2024-10-11 18:02:13,756 INFO L207 NwaCegarLoop]: Found error trace [2024-10-11 18:02:13,756 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-11 18:02:13,774 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (26)] Ended with exit code 0 [2024-10-11 18:02:13,957 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 26 /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable32 [2024-10-11 18:02:13,958 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-11 18:02:13,958 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-11 18:02:13,958 INFO L85 PathProgramCache]: Analyzing trace with hash -1264923100, now seen corresponding path program 1 times [2024-10-11 18:02:13,958 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-11 18:02:13,958 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [665074203] [2024-10-11 18:02:13,959 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 18:02:13,959 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-11 18:02:13,973 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-10-11 18:02:13,977 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-10-11 18:02:13,993 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-10-11 18:02:14,022 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2024-10-11 18:02:14,023 INFO L325 BasicCegarLoop]: Counterexample is feasible [2024-10-11 18:02:14,024 INFO L782 garLoopResultBuilder]: Registering result UNSAFE for location ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK (19 of 20 remaining) [2024-10-11 18:02:14,026 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location parse_inputErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE (18 of 20 remaining) [2024-10-11 18:02:14,027 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location parse_inputErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (17 of 20 remaining) [2024-10-11 18:02:14,027 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location parse_inputErr2ASSERT_VIOLATIONMEMORY_DEREFERENCE (16 of 20 remaining) [2024-10-11 18:02:14,027 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location parse_inputErr3ASSERT_VIOLATIONMEMORY_DEREFERENCE (15 of 20 remaining) [2024-10-11 18:02:14,027 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location parse_inputErr4ASSERT_VIOLATIONMEMORY_DEREFERENCE (14 of 20 remaining) [2024-10-11 18:02:14,028 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location parse_inputErr5ASSERT_VIOLATIONMEMORY_DEREFERENCE (13 of 20 remaining) [2024-10-11 18:02:14,028 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location parse_inputErr6REQUIRES_VIOLATIONMEMORY_DEREFERENCE (12 of 20 remaining) [2024-10-11 18:02:14,028 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location parse_inputErr7REQUIRES_VIOLATIONMEMORY_DEREFERENCE (11 of 20 remaining) [2024-10-11 18:02:14,028 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location parse_inputErr8REQUIRES_VIOLATIONMEMORY_DEREFERENCE (10 of 20 remaining) [2024-10-11 18:02:14,028 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location parse_inputErr9REQUIRES_VIOLATIONMEMORY_DEREFERENCE (9 of 20 remaining) [2024-10-11 18:02:14,028 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location parse_inputErr10ASSERT_VIOLATIONMEMORY_FREE (8 of 20 remaining) [2024-10-11 18:02:14,028 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location parse_inputErr11ASSERT_VIOLATIONMEMORY_FREE (7 of 20 remaining) [2024-10-11 18:02:14,028 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location parse_inputErr12ASSERT_VIOLATIONMEMORY_FREE (6 of 20 remaining) [2024-10-11 18:02:14,029 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location parse_inputErr13ASSERT_VIOLATIONMEMORY_FREE (5 of 20 remaining) [2024-10-11 18:02:14,029 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location parse_inputErr14ASSERT_VIOLATIONMEMORY_FREE (4 of 20 remaining) [2024-10-11 18:02:14,029 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location parse_inputErr15ASSERT_VIOLATIONMEMORY_FREE (3 of 20 remaining) [2024-10-11 18:02:14,029 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location parse_inputErr16ASSERT_VIOLATIONMEMORY_FREE (2 of 20 remaining) [2024-10-11 18:02:14,029 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location parse_inputErr17ASSERT_VIOLATIONMEMORY_FREE (1 of 20 remaining) [2024-10-11 18:02:14,029 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location parse_inputErr18ASSERT_VIOLATIONMEMORY_FREE (0 of 20 remaining) [2024-10-11 18:02:14,029 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable33 [2024-10-11 18:02:14,032 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-11 18:02:14,110 INFO L165 ceAbstractionStarter]: Computing trace abstraction results [2024-10-11 18:02:14,113 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 11.10 06:02:14 BoogieIcfgContainer [2024-10-11 18:02:14,114 INFO L131 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2024-10-11 18:02:14,114 INFO L112 PluginConnector]: ------------------------Witness Printer---------------------------- [2024-10-11 18:02:14,114 INFO L270 PluginConnector]: Initializing Witness Printer... [2024-10-11 18:02:14,114 INFO L274 PluginConnector]: Witness Printer initialized [2024-10-11 18:02:14,115 INFO L184 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 11.10 06:01:37" (3/4) ... [2024-10-11 18:02:14,117 INFO L142 WitnessPrinter]: No result that supports witness generation found [2024-10-11 18:02:14,118 INFO L131 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2024-10-11 18:02:14,119 INFO L158 Benchmark]: Toolchain (without parser) took 38058.76ms. Allocated memory was 157.3MB in the beginning and 465.6MB in the end (delta: 308.3MB). Free memory was 101.1MB in the beginning and 318.3MB in the end (delta: -217.2MB). Peak memory consumption was 92.5MB. Max. memory is 16.1GB. [2024-10-11 18:02:14,121 INFO L158 Benchmark]: CDTParser took 0.25ms. Allocated memory is still 157.3MB. Free memory was 119.6MB in the beginning and 119.4MB in the end (delta: 169.8kB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. [2024-10-11 18:02:14,121 INFO L158 Benchmark]: CACSL2BoogieTranslator took 586.38ms. Allocated memory is still 157.3MB. Free memory was 100.6MB in the beginning and 78.4MB in the end (delta: 22.2MB). Peak memory consumption was 21.0MB. Max. memory is 16.1GB. [2024-10-11 18:02:14,121 INFO L158 Benchmark]: Boogie Procedure Inliner took 64.25ms. Allocated memory is still 157.3MB. Free memory was 78.0MB in the beginning and 75.9MB in the end (delta: 2.1MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. [2024-10-11 18:02:14,121 INFO L158 Benchmark]: Boogie Preprocessor took 73.67ms. Allocated memory is still 157.3MB. Free memory was 75.9MB in the beginning and 73.3MB in the end (delta: 2.5MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. [2024-10-11 18:02:14,121 INFO L158 Benchmark]: RCFGBuilder took 624.58ms. Allocated memory is still 157.3MB. Free memory was 73.3MB in the beginning and 119.1MB in the end (delta: -45.7MB). Peak memory consumption was 16.4MB. Max. memory is 16.1GB. [2024-10-11 18:02:14,122 INFO L158 Benchmark]: TraceAbstraction took 36696.87ms. Allocated memory was 157.3MB in the beginning and 465.6MB in the end (delta: 308.3MB). Free memory was 118.6MB in the beginning and 318.3MB in the end (delta: -199.7MB). Peak memory consumption was 111.8MB. Max. memory is 16.1GB. [2024-10-11 18:02:14,122 INFO L158 Benchmark]: Witness Printer took 4.70ms. Allocated memory is still 465.6MB. Free memory is still 318.3MB. There was no memory consumed. Max. memory is 16.1GB. [2024-10-11 18:02:14,123 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.25ms. Allocated memory is still 157.3MB. Free memory was 119.6MB in the beginning and 119.4MB in the end (delta: 169.8kB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. * CACSL2BoogieTranslator took 586.38ms. Allocated memory is still 157.3MB. Free memory was 100.6MB in the beginning and 78.4MB in the end (delta: 22.2MB). Peak memory consumption was 21.0MB. Max. memory is 16.1GB. * Boogie Procedure Inliner took 64.25ms. Allocated memory is still 157.3MB. Free memory was 78.0MB in the beginning and 75.9MB in the end (delta: 2.1MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. * Boogie Preprocessor took 73.67ms. Allocated memory is still 157.3MB. Free memory was 75.9MB in the beginning and 73.3MB in the end (delta: 2.5MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. * RCFGBuilder took 624.58ms. Allocated memory is still 157.3MB. Free memory was 73.3MB in the beginning and 119.1MB in the end (delta: -45.7MB). Peak memory consumption was 16.4MB. Max. memory is 16.1GB. * TraceAbstraction took 36696.87ms. Allocated memory was 157.3MB in the beginning and 465.6MB in the end (delta: 308.3MB). Free memory was 118.6MB in the beginning and 318.3MB in the end (delta: -199.7MB). Peak memory consumption was 111.8MB. Max. memory is 16.1GB. * Witness Printer took 4.70ms. Allocated memory is still 465.6MB. Free memory is still 318.3MB. 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: 36.5s, OverallIterations: 34, TraceHistogramMax: 5, PathProgramHistogramMax: 1, EmptinessCheckTime: 0.0s, AutomataDifference: 11.2s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 0.0s, HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 6458 SdHoareTripleChecker+Valid, 5.7s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 6458 mSDsluCounter, 6298 SdHoareTripleChecker+Invalid, 4.9s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 189 IncrementalHoareTripleChecker+Unchecked, 4866 mSDsCounter, 691 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 7477 IncrementalHoareTripleChecker+Invalid, 8357 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 691 mSolverCounterUnsat, 1432 mSDtfsCounter, 7477 mSolverCounterSat, 0.1s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 1780 GetRequests, 1210 SyntacticMatches, 8 SemanticMatches, 562 ConstructedPredicates, 1 IntricatePredicates, 0 DeprecatedPredicates, 3843 ImplicationChecksByTransitivity, 9.8s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=371occurred in iteration=16, InterpolantAutomatonStates: 314, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s DumpTime, AutomataMinimizationStatistics: 0.4s AutomataMinimizationTime, 33 MinimizatonAttempts, 643 StatesRemovedByMinimization, 30 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.3s SsaConstructionTime, 1.0s SatisfiabilityAnalysisTime, 16.8s InterpolantComputationTime, 2096 NumberOfCodeBlocks, 2096 NumberOfCodeBlocksAsserted, 59 NumberOfCheckSat, 2216 ConstructedInterpolants, 130 QuantifiedInterpolants, 22941 SizeOfPredicates, 82 NumberOfNonLiveVariables, 6352 ConjunctsInSsa, 437 ConjunctsInUnsatCore, 66 InterpolantComputations, 14 PerfectInterpolantSequences, 599/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-11 18:02:14,155 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate-clean/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-clean/releaseScripts/default/UAutomizer-linux/data/config -Xmx15G -Xms4m -jar /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/plugins/org.eclipse.equinox.launcher_1.5.800.v20200727-1323.jar -data @noDefault -ultimatedata /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/data -tc /storage/repos/ultimate-clean/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-clean/releaseScripts/default/UAutomizer-linux/config/svcomp-DerefFreeMemtrack-32bit-Automizer_Bitvector.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /storage/repos/ultimate-clean/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-dev-84cfde4 [2024-10-11 18:02:16,405 INFO L188 SettingsManager]: Resetting all preferences to default values... [2024-10-11 18:02:16,481 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/config/svcomp-DerefFreeMemtrack-32bit-Automizer_Bitvector.epf [2024-10-11 18:02:16,487 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2024-10-11 18:02:16,489 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2024-10-11 18:02:16,525 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2024-10-11 18:02:16,526 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2024-10-11 18:02:16,526 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2024-10-11 18:02:16,528 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2024-10-11 18:02:16,529 INFO L153 SettingsManager]: * Use memory slicer=true [2024-10-11 18:02:16,530 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2024-10-11 18:02:16,530 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2024-10-11 18:02:16,531 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2024-10-11 18:02:16,531 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2024-10-11 18:02:16,534 INFO L153 SettingsManager]: * Use SBE=true [2024-10-11 18:02:16,535 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2024-10-11 18:02:16,535 INFO L153 SettingsManager]: * sizeof long=4 [2024-10-11 18:02:16,535 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2024-10-11 18:02:16,536 INFO L153 SettingsManager]: * sizeof POINTER=4 [2024-10-11 18:02:16,536 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2024-10-11 18:02:16,536 INFO L153 SettingsManager]: * Check for the main procedure if all allocated memory was freed=true [2024-10-11 18:02:16,537 INFO L153 SettingsManager]: * Bitprecise bitfields=true [2024-10-11 18:02:16,537 INFO L153 SettingsManager]: * SV-COMP memtrack compatibility mode=true [2024-10-11 18:02:16,538 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2024-10-11 18:02:16,538 INFO L153 SettingsManager]: * Adapt memory model on pointer casts if necessary=true [2024-10-11 18:02:16,538 INFO L153 SettingsManager]: * Use bitvectors instead of ints=true [2024-10-11 18:02:16,539 INFO L153 SettingsManager]: * Allow undefined functions=false [2024-10-11 18:02:16,539 INFO L153 SettingsManager]: * Memory model=HoenickeLindenmann_4ByteResolution [2024-10-11 18:02:16,539 INFO L153 SettingsManager]: * Check unreachability of reach_error function=false [2024-10-11 18:02:16,539 INFO L153 SettingsManager]: * sizeof long double=12 [2024-10-11 18:02:16,540 INFO L153 SettingsManager]: * Use constant arrays=true [2024-10-11 18:02:16,540 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2024-10-11 18:02:16,541 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2024-10-11 18:02:16,541 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2024-10-11 18:02:16,541 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2024-10-11 18:02:16,542 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-10-11 18:02:16,542 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2024-10-11 18:02:16,542 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2024-10-11 18:02:16,543 INFO L153 SettingsManager]: * Trace refinement strategy=WOLF [2024-10-11 18:02:16,543 INFO L153 SettingsManager]: * Command for external solver=cvc4 --incremental --print-success --lang smt [2024-10-11 18:02:16,544 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2024-10-11 18:02:16,544 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2024-10-11 18:02:16,544 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2024-10-11 18:02:16,544 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2024-10-11 18:02:16,545 INFO L153 SettingsManager]: * Logic for external solver=AUFBV [2024-10-11 18:02:16,545 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-clean/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-clean/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-11 18:02:16,865 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2024-10-11 18:02:16,885 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2024-10-11 18:02:16,889 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2024-10-11 18:02:16,890 INFO L270 PluginConnector]: Initializing CDTParser... [2024-10-11 18:02:16,891 INFO L274 PluginConnector]: CDTParser initialized [2024-10-11 18:02:16,893 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/memsafety-bftpd/bftpd_2.i [2024-10-11 18:02:18,468 INFO L533 CDTParser]: Created temporary CDT project at NULL [2024-10-11 18:02:18,752 INFO L384 CDTParser]: Found 1 translation units. [2024-10-11 18:02:18,752 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/memsafety-bftpd/bftpd_2.i [2024-10-11 18:02:18,772 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/data/258614c1c/90539b07ed7e4ef894d75c06d3a6d0ff/FLAGce1740e48 [2024-10-11 18:02:19,050 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/data/258614c1c/90539b07ed7e4ef894d75c06d3a6d0ff [2024-10-11 18:02:19,057 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2024-10-11 18:02:19,059 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2024-10-11 18:02:19,060 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2024-10-11 18:02:19,060 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2024-10-11 18:02:19,065 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2024-10-11 18:02:19,066 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 11.10 06:02:19" (1/1) ... [2024-10-11 18:02:19,067 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@6e0eefbc and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 06:02:19, skipping insertion in model container [2024-10-11 18:02:19,067 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 11.10 06:02:19" (1/1) ... [2024-10-11 18:02:19,108 INFO L175 MainTranslator]: Built tables and reachable declarations [2024-10-11 18:02:19,477 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-10-11 18:02:19,498 INFO L200 MainTranslator]: Completed pre-run [2024-10-11 18:02:19,551 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-10-11 18:02:19,613 INFO L204 MainTranslator]: Completed translation [2024-10-11 18:02:19,614 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 06:02:19 WrapperNode [2024-10-11 18:02:19,614 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2024-10-11 18:02:19,615 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2024-10-11 18:02:19,615 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2024-10-11 18:02:19,615 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2024-10-11 18:02:19,621 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 06:02:19" (1/1) ... [2024-10-11 18:02:19,645 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 06:02:19" (1/1) ... [2024-10-11 18:02:19,671 INFO L138 Inliner]: procedures = 169, calls = 42, calls flagged for inlining = 5, calls inlined = 5, statements flattened = 96 [2024-10-11 18:02:19,674 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2024-10-11 18:02:19,674 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2024-10-11 18:02:19,675 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2024-10-11 18:02:19,676 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2024-10-11 18:02:19,685 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 06:02:19" (1/1) ... [2024-10-11 18:02:19,686 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 06:02:19" (1/1) ... [2024-10-11 18:02:19,692 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 06:02:19" (1/1) ... [2024-10-11 18:02:19,720 INFO L175 MemorySlicer]: Split 24 memory accesses to 3 slices as follows [9, 9, 6]. 38 percent of accesses are in the largest equivalence class. The 21 initializations are split as follows [6, 9, 6]. The 0 writes are split as follows [0, 0, 0]. [2024-10-11 18:02:19,720 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 06:02:19" (1/1) ... [2024-10-11 18:02:19,721 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 06:02:19" (1/1) ... [2024-10-11 18:02:19,727 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 06:02:19" (1/1) ... [2024-10-11 18:02:19,730 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 06:02:19" (1/1) ... [2024-10-11 18:02:19,732 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 06:02:19" (1/1) ... [2024-10-11 18:02:19,733 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 06:02:19" (1/1) ... [2024-10-11 18:02:19,735 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2024-10-11 18:02:19,736 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2024-10-11 18:02:19,736 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2024-10-11 18:02:19,736 INFO L274 PluginConnector]: RCFGBuilder initialized [2024-10-11 18:02:19,737 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 06:02:19" (1/1) ... [2024-10-11 18:02:19,742 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-10-11 18:02:19,753 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 [2024-10-11 18:02:19,769 INFO L229 MonitoredProcess]: Starting monitored process 1 with /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (exit command is (exit), workingDir is null) [2024-10-11 18:02:19,771 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Waiting until timeout for monitored process [2024-10-11 18:02:19,815 INFO L130 BoogieDeclarations]: Found specification of procedure read~intINTTYPE1#0 [2024-10-11 18:02:19,815 INFO L130 BoogieDeclarations]: Found specification of procedure read~intINTTYPE1#1 [2024-10-11 18:02:19,816 INFO L130 BoogieDeclarations]: Found specification of procedure read~intINTTYPE1#2 [2024-10-11 18:02:19,816 INFO L130 BoogieDeclarations]: Found specification of procedure parse_input [2024-10-11 18:02:19,816 INFO L138 BoogieDeclarations]: Found implementation of procedure parse_input [2024-10-11 18:02:19,816 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnHeap [2024-10-11 18:02:19,816 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2024-10-11 18:02:19,816 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$#0 [2024-10-11 18:02:19,816 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$#1 [2024-10-11 18:02:19,816 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$#2 [2024-10-11 18:02:19,817 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2024-10-11 18:02:19,817 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~$Pointer$#0 [2024-10-11 18:02:19,817 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~$Pointer$#1 [2024-10-11 18:02:19,817 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~$Pointer$#2 [2024-10-11 18:02:19,817 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE1#0 [2024-10-11 18:02:19,817 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE1#1 [2024-10-11 18:02:19,817 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE1#2 [2024-10-11 18:02:19,817 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2024-10-11 18:02:19,817 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2024-10-11 18:02:19,935 INFO L238 CfgBuilder]: Building ICFG [2024-10-11 18:02:19,936 INFO L264 CfgBuilder]: Building CFG for each procedure with an implementation [2024-10-11 18:02:20,277 INFO L? ?]: Removed 34 outVars from TransFormulas that were not future-live. [2024-10-11 18:02:20,277 INFO L287 CfgBuilder]: Performing block encoding [2024-10-11 18:02:20,325 INFO L309 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2024-10-11 18:02:20,326 INFO L314 CfgBuilder]: Removed 1 assume(true) statements. [2024-10-11 18:02:20,326 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 11.10 06:02:20 BoogieIcfgContainer [2024-10-11 18:02:20,326 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2024-10-11 18:02:20,328 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2024-10-11 18:02:20,328 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2024-10-11 18:02:20,332 INFO L274 PluginConnector]: TraceAbstraction initialized [2024-10-11 18:02:20,332 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 11.10 06:02:19" (1/3) ... [2024-10-11 18:02:20,333 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@75d72302 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 11.10 06:02:20, skipping insertion in model container [2024-10-11 18:02:20,333 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 06:02:19" (2/3) ... [2024-10-11 18:02:20,333 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@75d72302 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 11.10 06:02:20, skipping insertion in model container [2024-10-11 18:02:20,334 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 11.10 06:02:20" (3/3) ... [2024-10-11 18:02:20,336 INFO L112 eAbstractionObserver]: Analyzing ICFG bftpd_2.i [2024-10-11 18:02:20,352 INFO L209 ceAbstractionStarter]: Automizer settings: Hoare:None NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2024-10-11 18:02:20,352 INFO L149 ceAbstractionStarter]: Applying trace abstraction to program that has 20 error locations. [2024-10-11 18:02:20,387 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2024-10-11 18:02:20,393 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;@5908167b, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2024-10-11 18:02:20,393 INFO L334 AbstractCegarLoop]: Starting to check reachability of 20 error locations. [2024-10-11 18:02:20,396 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-11 18:02:20,400 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 6 [2024-10-11 18:02:20,400 INFO L207 NwaCegarLoop]: Found error trace [2024-10-11 18:02:20,401 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1] [2024-10-11 18:02:20,401 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-11 18:02:20,413 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-11 18:02:20,413 INFO L85 PathProgramCache]: Analyzing trace with hash 131378568, now seen corresponding path program 1 times [2024-10-11 18:02:20,430 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-10-11 18:02:20,431 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1070836693] [2024-10-11 18:02:20,431 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 18:02:20,431 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-11 18:02:20,432 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/mathsat [2024-10-11 18:02:20,433 INFO L229 MonitoredProcess]: Starting monitored process 2 with /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/mathsat -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-11 18:02:20,434 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/mathsat -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-11 18:02:20,530 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 18:02:20,533 INFO L255 TraceCheckSpWp]: Trace formula consists of 65 conjuncts, 5 conjuncts are in the unsatisfiable core [2024-10-11 18:02:20,538 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-11 18:02:20,641 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-11 18:02:20,641 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-10-11 18:02:20,642 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-10-11 18:02:20,642 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1070836693] [2024-10-11 18:02:20,643 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1070836693] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-11 18:02:20,643 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-11 18:02:20,643 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2024-10-11 18:02:20,646 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [37910001] [2024-10-11 18:02:20,646 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-11 18:02:20,650 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-10-11 18:02:20,650 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-10-11 18:02:20,677 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-10-11 18:02:20,678 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-10-11 18:02:20,680 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-11 18:02:20,847 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-11 18:02:20,848 INFO L93 Difference]: Finished difference Result 107 states and 125 transitions. [2024-10-11 18:02:20,849 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-10-11 18:02:20,851 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-11 18:02:20,851 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-11 18:02:20,861 INFO L225 Difference]: With dead ends: 107 [2024-10-11 18:02:20,861 INFO L226 Difference]: Without dead ends: 105 [2024-10-11 18:02:20,863 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-11 18:02:20,876 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-11 18:02:20,879 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-11 18:02:20,892 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 105 states. [2024-10-11 18:02:20,909 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 105 to 83. [2024-10-11 18:02:20,910 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-11 18:02:20,913 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 83 states to 83 states and 109 transitions. [2024-10-11 18:02:20,915 INFO L78 Accepts]: Start accepts. Automaton has 83 states and 109 transitions. Word has length 5 [2024-10-11 18:02:20,915 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-11 18:02:20,915 INFO L471 AbstractCegarLoop]: Abstraction has 83 states and 109 transitions. [2024-10-11 18:02:20,915 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-11 18:02:20,915 INFO L276 IsEmpty]: Start isEmpty. Operand 83 states and 109 transitions. [2024-10-11 18:02:20,916 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 6 [2024-10-11 18:02:20,916 INFO L207 NwaCegarLoop]: Found error trace [2024-10-11 18:02:20,916 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1] [2024-10-11 18:02:20,919 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (2)] Ended with exit code 0 [2024-10-11 18:02:21,117 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 2 /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/mathsat -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-11 18:02:21,117 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-11 18:02:21,118 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-11 18:02:21,118 INFO L85 PathProgramCache]: Analyzing trace with hash 131378569, now seen corresponding path program 1 times [2024-10-11 18:02:21,119 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-10-11 18:02:21,119 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [841110477] [2024-10-11 18:02:21,119 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 18:02:21,119 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-11 18:02:21,119 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/mathsat [2024-10-11 18:02:21,136 INFO L229 MonitoredProcess]: Starting monitored process 3 with /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/mathsat -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-11 18:02:21,137 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/mathsat -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-11 18:02:21,191 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 18:02:21,192 INFO L255 TraceCheckSpWp]: Trace formula consists of 65 conjuncts, 7 conjuncts are in the unsatisfiable core [2024-10-11 18:02:21,194 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-11 18:02:21,295 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-11 18:02:21,296 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-10-11 18:02:21,296 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-10-11 18:02:21,297 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [841110477] [2024-10-11 18:02:21,297 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [841110477] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-11 18:02:21,298 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-11 18:02:21,298 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-10-11 18:02:21,298 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [544595269] [2024-10-11 18:02:21,299 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-11 18:02:21,300 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-10-11 18:02:21,301 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-10-11 18:02:21,302 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-10-11 18:02:21,302 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2024-10-11 18:02:21,302 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-11 18:02:21,499 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-11 18:02:21,499 INFO L93 Difference]: Finished difference Result 179 states and 241 transitions. [2024-10-11 18:02:21,500 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-10-11 18:02:21,500 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-11 18:02:21,500 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-11 18:02:21,504 INFO L225 Difference]: With dead ends: 179 [2024-10-11 18:02:21,504 INFO L226 Difference]: Without dead ends: 179 [2024-10-11 18:02:21,504 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-11 18:02:21,508 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-11 18:02:21,508 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-11 18:02:21,509 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 179 states. [2024-10-11 18:02:21,536 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 179 to 151. [2024-10-11 18:02:21,537 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-11 18:02:21,544 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 151 states to 151 states and 237 transitions. [2024-10-11 18:02:21,544 INFO L78 Accepts]: Start accepts. Automaton has 151 states and 237 transitions. Word has length 5 [2024-10-11 18:02:21,544 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-11 18:02:21,544 INFO L471 AbstractCegarLoop]: Abstraction has 151 states and 237 transitions. [2024-10-11 18:02:21,544 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-11 18:02:21,545 INFO L276 IsEmpty]: Start isEmpty. Operand 151 states and 237 transitions. [2024-10-11 18:02:21,545 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 7 [2024-10-11 18:02:21,545 INFO L207 NwaCegarLoop]: Found error trace [2024-10-11 18:02:21,545 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1] [2024-10-11 18:02:21,549 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/mathsat -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-11 18:02:21,745 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 3 /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/mathsat -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-11 18:02:21,746 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-11 18:02:21,747 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-11 18:02:21,747 INFO L85 PathProgramCache]: Analyzing trace with hash -222231707, now seen corresponding path program 1 times [2024-10-11 18:02:21,747 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-10-11 18:02:21,747 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1561749972] [2024-10-11 18:02:21,747 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 18:02:21,748 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-11 18:02:21,748 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/mathsat [2024-10-11 18:02:21,749 INFO L229 MonitoredProcess]: Starting monitored process 4 with /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/mathsat -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-11 18:02:21,751 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/mathsat -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-11 18:02:21,803 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 18:02:21,805 INFO L255 TraceCheckSpWp]: Trace formula consists of 71 conjuncts, 8 conjuncts are in the unsatisfiable core [2024-10-11 18:02:21,806 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-11 18:02:21,985 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-11 18:02:21,985 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-10-11 18:02:21,985 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-10-11 18:02:21,985 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1561749972] [2024-10-11 18:02:21,986 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1561749972] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-11 18:02:21,986 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-11 18:02:21,986 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-10-11 18:02:21,986 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1996216282] [2024-10-11 18:02:21,986 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-11 18:02:21,986 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2024-10-11 18:02:21,987 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-10-11 18:02:21,989 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2024-10-11 18:02:21,989 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2024-10-11 18:02:21,989 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-11 18:02:22,278 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-11 18:02:22,278 INFO L93 Difference]: Finished difference Result 191 states and 276 transitions. [2024-10-11 18:02:22,279 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-10-11 18:02:22,279 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-11 18:02:22,280 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-11 18:02:22,282 INFO L225 Difference]: With dead ends: 191 [2024-10-11 18:02:22,282 INFO L226 Difference]: Without dead ends: 191 [2024-10-11 18:02:22,282 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=13, Invalid=17, Unknown=0, NotChecked=0, Total=30 [2024-10-11 18:02:22,283 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-11 18:02:22,283 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-11 18:02:22,284 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 191 states. [2024-10-11 18:02:22,304 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 191 to 154. [2024-10-11 18:02:22,305 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-11 18:02:22,309 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 154 states to 154 states and 240 transitions. [2024-10-11 18:02:22,309 INFO L78 Accepts]: Start accepts. Automaton has 154 states and 240 transitions. Word has length 6 [2024-10-11 18:02:22,309 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-11 18:02:22,310 INFO L471 AbstractCegarLoop]: Abstraction has 154 states and 240 transitions. [2024-10-11 18:02:22,310 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-11 18:02:22,310 INFO L276 IsEmpty]: Start isEmpty. Operand 154 states and 240 transitions. [2024-10-11 18:02:22,310 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 8 [2024-10-11 18:02:22,310 INFO L207 NwaCegarLoop]: Found error trace [2024-10-11 18:02:22,310 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1] [2024-10-11 18:02:22,317 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (4)] Ended with exit code 0 [2024-10-11 18:02:22,516 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 4 /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/mathsat -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-11 18:02:22,516 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-11 18:02:22,517 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-11 18:02:22,517 INFO L85 PathProgramCache]: Analyzing trace with hash 1700751720, now seen corresponding path program 1 times [2024-10-11 18:02:22,517 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-10-11 18:02:22,517 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [24475850] [2024-10-11 18:02:22,517 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 18:02:22,518 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-10-11 18:02:22,518 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/mathsat [2024-10-11 18:02:22,525 INFO L229 MonitoredProcess]: Starting monitored process 5 with /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/mathsat -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-11 18:02:22,526 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/mathsat -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-11 18:02:22,580 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 18:02:22,582 INFO L255 TraceCheckSpWp]: Trace formula consists of 72 conjuncts, 10 conjuncts are in the unsatisfiable core [2024-10-11 18:02:22,583 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-11 18:02:22,725 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-11 18:02:22,725 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-10-11 18:02:22,726 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-10-11 18:02:22,726 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [24475850] [2024-10-11 18:02:22,726 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [24475850] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-11 18:02:22,726 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-11 18:02:22,726 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-10-11 18:02:22,727 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2032006991] [2024-10-11 18:02:22,727 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-11 18:02:22,727 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2024-10-11 18:02:22,727 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-10-11 18:02:22,728 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2024-10-11 18:02:22,728 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2024-10-11 18:02:22,728 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-11 18:02:22,950 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-11 18:02:22,950 INFO L93 Difference]: Finished difference Result 181 states and 242 transitions. [2024-10-11 18:02:22,950 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-10-11 18:02:22,951 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-11 18:02:22,951 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-11 18:02:22,952 INFO L225 Difference]: With dead ends: 181 [2024-10-11 18:02:22,952 INFO L226 Difference]: Without dead ends: 181 [2024-10-11 18:02:22,952 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-11 18:02:22,953 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-11 18:02:22,953 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-11 18:02:22,954 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 181 states. [2024-10-11 18:02:22,968 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 181 to 154. [2024-10-11 18:02:22,969 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-11 18:02:22,971 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 154 states to 154 states and 238 transitions. [2024-10-11 18:02:22,971 INFO L78 Accepts]: Start accepts. Automaton has 154 states and 238 transitions. Word has length 7 [2024-10-11 18:02:22,971 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-11 18:02:22,971 INFO L471 AbstractCegarLoop]: Abstraction has 154 states and 238 transitions. [2024-10-11 18:02:22,971 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-11 18:02:22,971 INFO L276 IsEmpty]: Start isEmpty. Operand 154 states and 238 transitions. [2024-10-11 18:02:22,971 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 9 [2024-10-11 18:02:22,972 INFO L207 NwaCegarLoop]: Found error trace [2024-10-11 18:02:22,972 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1] [2024-10-11 18:02:22,977 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (5)] Ended with exit code 0 [2024-10-11 18:02:23,172 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 5 /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/mathsat -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-11 18:02:23,173 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-11 18:02:23,173 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-11 18:02:23,173 INFO L85 PathProgramCache]: Analyzing trace with hash 1183695815, now seen corresponding path program 1 times [2024-10-11 18:02:23,173 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-10-11 18:02:23,174 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [445601401] [2024-10-11 18:02:23,174 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 18:02:23,174 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-11 18:02:23,174 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/mathsat [2024-10-11 18:02:23,176 INFO L229 MonitoredProcess]: Starting monitored process 6 with /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/mathsat -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-11 18:02:23,177 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/mathsat -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-11 18:02:23,227 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 18:02:23,230 INFO L255 TraceCheckSpWp]: Trace formula consists of 74 conjuncts, 6 conjuncts are in the unsatisfiable core [2024-10-11 18:02:23,231 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-11 18:02:23,287 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-11 18:02:23,287 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-10-11 18:02:23,287 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-10-11 18:02:23,287 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [445601401] [2024-10-11 18:02:23,287 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [445601401] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-11 18:02:23,287 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-11 18:02:23,287 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-10-11 18:02:23,288 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1382149344] [2024-10-11 18:02:23,288 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-11 18:02:23,288 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2024-10-11 18:02:23,288 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-10-11 18:02:23,289 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2024-10-11 18:02:23,289 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2024-10-11 18:02:23,289 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-11 18:02:23,440 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-11 18:02:23,440 INFO L93 Difference]: Finished difference Result 233 states and 320 transitions. [2024-10-11 18:02:23,441 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-10-11 18:02:23,441 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-11 18:02:23,441 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-11 18:02:23,442 INFO L225 Difference]: With dead ends: 233 [2024-10-11 18:02:23,442 INFO L226 Difference]: Without dead ends: 233 [2024-10-11 18:02:23,443 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-11 18:02:23,443 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-11 18:02:23,444 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-11 18:02:23,445 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 233 states. [2024-10-11 18:02:23,453 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 233 to 190. [2024-10-11 18:02:23,454 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-11 18:02:23,459 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 190 states to 190 states and 288 transitions. [2024-10-11 18:02:23,460 INFO L78 Accepts]: Start accepts. Automaton has 190 states and 288 transitions. Word has length 8 [2024-10-11 18:02:23,460 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-11 18:02:23,460 INFO L471 AbstractCegarLoop]: Abstraction has 190 states and 288 transitions. [2024-10-11 18:02:23,460 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-11 18:02:23,460 INFO L276 IsEmpty]: Start isEmpty. Operand 190 states and 288 transitions. [2024-10-11 18:02:23,461 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 10 [2024-10-11 18:02:23,461 INFO L207 NwaCegarLoop]: Found error trace [2024-10-11 18:02:23,461 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-11 18:02:23,466 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/mathsat -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-11 18:02:23,661 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 6 /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/mathsat -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-11 18:02:23,662 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-11 18:02:23,662 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-11 18:02:23,662 INFO L85 PathProgramCache]: Analyzing trace with hash -1960135350, now seen corresponding path program 1 times [2024-10-11 18:02:23,662 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-10-11 18:02:23,663 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1304354604] [2024-10-11 18:02:23,663 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 18:02:23,663 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-11 18:02:23,663 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/mathsat [2024-10-11 18:02:23,664 INFO L229 MonitoredProcess]: Starting monitored process 7 with /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/mathsat -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-11 18:02:23,665 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/mathsat -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-11 18:02:23,712 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 18:02:23,716 INFO L255 TraceCheckSpWp]: Trace formula consists of 75 conjuncts, 8 conjuncts are in the unsatisfiable core [2024-10-11 18:02:23,718 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-11 18:02:23,816 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-11 18:02:23,816 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-10-11 18:02:23,816 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-10-11 18:02:23,816 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1304354604] [2024-10-11 18:02:23,816 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1304354604] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-11 18:02:23,816 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-11 18:02:23,816 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-10-11 18:02:23,817 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1864330952] [2024-10-11 18:02:23,817 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-11 18:02:23,817 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2024-10-11 18:02:23,817 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-10-11 18:02:23,817 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2024-10-11 18:02:23,818 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2024-10-11 18:02:23,818 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-11 18:02:23,993 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-11 18:02:23,993 INFO L93 Difference]: Finished difference Result 230 states and 303 transitions. [2024-10-11 18:02:23,994 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-10-11 18:02:23,994 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-11 18:02:23,994 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-11 18:02:23,995 INFO L225 Difference]: With dead ends: 230 [2024-10-11 18:02:23,995 INFO L226 Difference]: Without dead ends: 230 [2024-10-11 18:02:23,996 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-11 18:02:23,996 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-11 18:02:23,997 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-11 18:02:23,999 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 230 states. [2024-10-11 18:02:24,014 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 230 to 200. [2024-10-11 18:02:24,015 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-11 18:02:24,017 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 200 states to 200 states and 301 transitions. [2024-10-11 18:02:24,017 INFO L78 Accepts]: Start accepts. Automaton has 200 states and 301 transitions. Word has length 9 [2024-10-11 18:02:24,017 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-11 18:02:24,017 INFO L471 AbstractCegarLoop]: Abstraction has 200 states and 301 transitions. [2024-10-11 18:02:24,017 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-11 18:02:24,017 INFO L276 IsEmpty]: Start isEmpty. Operand 200 states and 301 transitions. [2024-10-11 18:02:24,018 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 14 [2024-10-11 18:02:24,018 INFO L207 NwaCegarLoop]: Found error trace [2024-10-11 18:02:24,018 INFO L215 NwaCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-11 18:02:24,027 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/mathsat -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-11 18:02:24,223 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 7 /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/mathsat -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-11 18:02:24,223 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-11 18:02:24,224 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-11 18:02:24,224 INFO L85 PathProgramCache]: Analyzing trace with hash -519071088, now seen corresponding path program 1 times [2024-10-11 18:02:24,224 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-10-11 18:02:24,224 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1754308920] [2024-10-11 18:02:24,224 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 18:02:24,224 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-11 18:02:24,225 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/mathsat [2024-10-11 18:02:24,226 INFO L229 MonitoredProcess]: Starting monitored process 8 with /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/mathsat -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-11 18:02:24,227 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/mathsat -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-11 18:02:24,276 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 18:02:24,278 INFO L255 TraceCheckSpWp]: Trace formula consists of 80 conjuncts, 8 conjuncts are in the unsatisfiable core [2024-10-11 18:02:24,279 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-11 18:02:24,468 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-11 18:02:24,469 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-10-11 18:02:24,698 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-11 18:02:24,698 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-10-11 18:02:24,698 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1754308920] [2024-10-11 18:02:24,698 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1754308920] provided 0 perfect and 2 imperfect interpolant sequences [2024-10-11 18:02:24,699 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2024-10-11 18:02:24,699 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [3, 3] total 6 [2024-10-11 18:02:24,699 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [736683164] [2024-10-11 18:02:24,699 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2024-10-11 18:02:24,699 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2024-10-11 18:02:24,700 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-10-11 18:02:24,700 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2024-10-11 18:02:24,700 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=21, Invalid=35, Unknown=0, NotChecked=0, Total=56 [2024-10-11 18:02:24,701 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-11 18:02:25,039 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-11 18:02:25,039 INFO L93 Difference]: Finished difference Result 268 states and 358 transitions. [2024-10-11 18:02:25,039 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2024-10-11 18:02:25,040 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-11 18:02:25,040 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-11 18:02:25,041 INFO L225 Difference]: With dead ends: 268 [2024-10-11 18:02:25,041 INFO L226 Difference]: Without dead ends: 268 [2024-10-11 18:02:25,042 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-11 18:02:25,043 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-11 18:02:25,043 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-11 18:02:25,044 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 268 states. [2024-10-11 18:02:25,050 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 268 to 230. [2024-10-11 18:02:25,051 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-11 18:02:25,052 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 230 states to 230 states and 349 transitions. [2024-10-11 18:02:25,053 INFO L78 Accepts]: Start accepts. Automaton has 230 states and 349 transitions. Word has length 13 [2024-10-11 18:02:25,053 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-11 18:02:25,053 INFO L471 AbstractCegarLoop]: Abstraction has 230 states and 349 transitions. [2024-10-11 18:02:25,053 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-11 18:02:25,053 INFO L276 IsEmpty]: Start isEmpty. Operand 230 states and 349 transitions. [2024-10-11 18:02:25,054 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 15 [2024-10-11 18:02:25,054 INFO L207 NwaCegarLoop]: Found error trace [2024-10-11 18:02:25,054 INFO L215 NwaCegarLoop]: trace histogram [2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-11 18:02:25,058 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/mathsat -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)] Forceful destruction successful, exit code 0 [2024-10-11 18:02:25,254 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 8 /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/mathsat -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-11 18:02:25,256 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-11 18:02:25,256 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-11 18:02:25,256 INFO L85 PathProgramCache]: Analyzing trace with hash 1088665406, now seen corresponding path program 1 times [2024-10-11 18:02:25,257 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-10-11 18:02:25,257 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1283902596] [2024-10-11 18:02:25,257 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 18:02:25,257 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-11 18:02:25,257 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/mathsat [2024-10-11 18:02:25,260 INFO L229 MonitoredProcess]: Starting monitored process 9 with /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/mathsat -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-11 18:02:25,261 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/mathsat -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-11 18:02:25,320 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 18:02:25,323 INFO L255 TraceCheckSpWp]: Trace formula consists of 86 conjuncts, 9 conjuncts are in the unsatisfiable core [2024-10-11 18:02:25,325 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-11 18:02:25,533 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-11 18:02:25,533 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-10-11 18:02:25,658 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-11 18:02:25,658 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-10-11 18:02:25,659 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1283902596] [2024-10-11 18:02:25,659 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1283902596] provided 0 perfect and 2 imperfect interpolant sequences [2024-10-11 18:02:25,659 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2024-10-11 18:02:25,659 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [4, 4] total 8 [2024-10-11 18:02:25,659 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1041322288] [2024-10-11 18:02:25,659 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2024-10-11 18:02:25,660 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2024-10-11 18:02:25,660 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-10-11 18:02:25,660 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2024-10-11 18:02:25,660 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=25, Invalid=65, Unknown=0, NotChecked=0, Total=90 [2024-10-11 18:02:25,661 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-11 18:02:26,136 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-11 18:02:26,136 INFO L93 Difference]: Finished difference Result 284 states and 405 transitions. [2024-10-11 18:02:26,137 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2024-10-11 18:02:26,137 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-11 18:02:26,137 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-11 18:02:26,139 INFO L225 Difference]: With dead ends: 284 [2024-10-11 18:02:26,139 INFO L226 Difference]: Without dead ends: 284 [2024-10-11 18:02:26,139 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 29 GetRequests, 18 SyntacticMatches, 0 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 19 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=47, Invalid=109, Unknown=0, NotChecked=0, Total=156 [2024-10-11 18:02:26,140 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-11 18:02:26,140 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-11 18:02:26,141 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 284 states. [2024-10-11 18:02:26,146 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 284 to 240. [2024-10-11 18:02:26,147 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-11 18:02:26,148 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 240 states to 240 states and 364 transitions. [2024-10-11 18:02:26,149 INFO L78 Accepts]: Start accepts. Automaton has 240 states and 364 transitions. Word has length 14 [2024-10-11 18:02:26,149 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-11 18:02:26,149 INFO L471 AbstractCegarLoop]: Abstraction has 240 states and 364 transitions. [2024-10-11 18:02:26,149 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-11 18:02:26,149 INFO L276 IsEmpty]: Start isEmpty. Operand 240 states and 364 transitions. [2024-10-11 18:02:26,150 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 16 [2024-10-11 18:02:26,150 INFO L207 NwaCegarLoop]: Found error trace [2024-10-11 18:02:26,150 INFO L215 NwaCegarLoop]: trace histogram [2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-11 18:02:26,155 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/mathsat -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-11 18:02:26,351 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 9 /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/mathsat -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-11 18:02:26,351 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-11 18:02:26,352 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-11 18:02:26,352 INFO L85 PathProgramCache]: Analyzing trace with hash -611110737, now seen corresponding path program 1 times [2024-10-11 18:02:26,352 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-10-11 18:02:26,352 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [13834272] [2024-10-11 18:02:26,352 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 18:02:26,352 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-11 18:02:26,352 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/mathsat [2024-10-11 18:02:26,353 INFO L229 MonitoredProcess]: Starting monitored process 10 with /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/mathsat -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-11 18:02:26,354 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/mathsat -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-11 18:02:26,413 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 18:02:26,418 INFO L255 TraceCheckSpWp]: Trace formula consists of 87 conjuncts, 11 conjuncts are in the unsatisfiable core [2024-10-11 18:02:26,420 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-11 18:02:26,668 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-11 18:02:26,668 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-10-11 18:02:26,836 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-11 18:02:26,836 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-10-11 18:02:26,837 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [13834272] [2024-10-11 18:02:26,837 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [13834272] provided 0 perfect and 2 imperfect interpolant sequences [2024-10-11 18:02:26,837 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2024-10-11 18:02:26,837 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [4, 4] total 8 [2024-10-11 18:02:26,837 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1544971567] [2024-10-11 18:02:26,837 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2024-10-11 18:02:26,837 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2024-10-11 18:02:26,838 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-10-11 18:02:26,838 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2024-10-11 18:02:26,839 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=25, Invalid=65, Unknown=0, NotChecked=0, Total=90 [2024-10-11 18:02:26,839 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-11 18:02:27,602 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-11 18:02:27,602 INFO L93 Difference]: Finished difference Result 413 states and 560 transitions. [2024-10-11 18:02:27,603 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2024-10-11 18:02:27,603 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-11 18:02:27,603 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-11 18:02:27,605 INFO L225 Difference]: With dead ends: 413 [2024-10-11 18:02:27,605 INFO L226 Difference]: Without dead ends: 413 [2024-10-11 18:02:27,605 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-11 18:02:27,606 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-11 18:02:27,606 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-11 18:02:27,607 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 413 states. [2024-10-11 18:02:27,617 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 413 to 325. [2024-10-11 18:02:27,618 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-11 18:02:27,620 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 325 states to 325 states and 516 transitions. [2024-10-11 18:02:27,621 INFO L78 Accepts]: Start accepts. Automaton has 325 states and 516 transitions. Word has length 15 [2024-10-11 18:02:27,621 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-11 18:02:27,621 INFO L471 AbstractCegarLoop]: Abstraction has 325 states and 516 transitions. [2024-10-11 18:02:27,622 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-11 18:02:27,622 INFO L276 IsEmpty]: Start isEmpty. Operand 325 states and 516 transitions. [2024-10-11 18:02:27,622 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 17 [2024-10-11 18:02:27,622 INFO L207 NwaCegarLoop]: Found error trace [2024-10-11 18:02:27,622 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-11 18:02:27,626 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/mathsat -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-11 18:02:27,825 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 10 /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/mathsat -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-11 18:02:27,826 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-11 18:02:27,826 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-11 18:02:27,826 INFO L85 PathProgramCache]: Analyzing trace with hash -905175959, now seen corresponding path program 1 times [2024-10-11 18:02:27,826 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-10-11 18:02:27,826 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [313952335] [2024-10-11 18:02:27,827 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 18:02:27,827 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-11 18:02:27,827 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/mathsat [2024-10-11 18:02:27,828 INFO L229 MonitoredProcess]: Starting monitored process 11 with /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/mathsat -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-11 18:02:27,830 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/mathsat -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-11 18:02:27,879 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 18:02:27,881 INFO L255 TraceCheckSpWp]: Trace formula consists of 96 conjuncts, 7 conjuncts are in the unsatisfiable core [2024-10-11 18:02:27,882 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-11 18:02:27,956 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-11 18:02:27,956 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-10-11 18:02:27,956 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-10-11 18:02:27,956 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [313952335] [2024-10-11 18:02:27,956 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [313952335] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-11 18:02:27,957 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-11 18:02:27,957 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-10-11 18:02:27,957 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [732361661] [2024-10-11 18:02:27,957 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-11 18:02:27,957 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-10-11 18:02:27,957 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-10-11 18:02:27,957 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-10-11 18:02:27,958 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-10-11 18:02:27,958 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-11 18:02:28,000 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-11 18:02:28,000 INFO L93 Difference]: Finished difference Result 347 states and 516 transitions. [2024-10-11 18:02:28,002 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-10-11 18:02:28,002 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-11 18:02:28,003 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-11 18:02:28,004 INFO L225 Difference]: With dead ends: 347 [2024-10-11 18:02:28,004 INFO L226 Difference]: Without dead ends: 347 [2024-10-11 18:02:28,005 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-11 18:02:28,005 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-11 18:02:28,005 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-11 18:02:28,006 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 347 states. [2024-10-11 18:02:28,018 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 347 to 336. [2024-10-11 18:02:28,018 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-11 18:02:28,021 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 336 states to 336 states and 513 transitions. [2024-10-11 18:02:28,021 INFO L78 Accepts]: Start accepts. Automaton has 336 states and 513 transitions. Word has length 16 [2024-10-11 18:02:28,021 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-11 18:02:28,022 INFO L471 AbstractCegarLoop]: Abstraction has 336 states and 513 transitions. [2024-10-11 18:02:28,022 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-11 18:02:28,022 INFO L276 IsEmpty]: Start isEmpty. Operand 336 states and 513 transitions. [2024-10-11 18:02:28,022 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 22 [2024-10-11 18:02:28,022 INFO L207 NwaCegarLoop]: Found error trace [2024-10-11 18:02:28,023 INFO L215 NwaCegarLoop]: trace histogram [3, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1] [2024-10-11 18:02:28,027 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/mathsat -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-11 18:02:28,223 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 11 /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/mathsat -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-11 18:02:28,224 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-11 18:02:28,225 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-11 18:02:28,225 INFO L85 PathProgramCache]: Analyzing trace with hash 1223463063, now seen corresponding path program 2 times [2024-10-11 18:02:28,225 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-10-11 18:02:28,225 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [901967958] [2024-10-11 18:02:28,225 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2024-10-11 18:02:28,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-11 18:02:28,226 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/mathsat [2024-10-11 18:02:28,228 INFO L229 MonitoredProcess]: Starting monitored process 12 with /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/mathsat -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-11 18:02:28,229 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/mathsat -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-11 18:02:28,283 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2024-10-11 18:02:28,283 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2024-10-11 18:02:28,285 INFO L255 TraceCheckSpWp]: Trace formula consists of 95 conjuncts, 10 conjuncts are in the unsatisfiable core [2024-10-11 18:02:28,286 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-11 18:02:28,516 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-11 18:02:28,516 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-10-11 18:02:28,975 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-11 18:02:28,975 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-10-11 18:02:28,975 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [901967958] [2024-10-11 18:02:28,975 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [901967958] provided 0 perfect and 2 imperfect interpolant sequences [2024-10-11 18:02:28,975 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2024-10-11 18:02:28,983 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [5, 5] total 10 [2024-10-11 18:02:28,983 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1894314935] [2024-10-11 18:02:28,983 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2024-10-11 18:02:28,983 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2024-10-11 18:02:28,984 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-10-11 18:02:28,984 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2024-10-11 18:02:28,984 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=32, Invalid=58, Unknown=0, NotChecked=0, Total=90 [2024-10-11 18:02:28,984 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-11 18:02:29,715 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-11 18:02:29,715 INFO L93 Difference]: Finished difference Result 418 states and 631 transitions. [2024-10-11 18:02:29,715 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2024-10-11 18:02:29,716 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-11 18:02:29,716 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-11 18:02:29,718 INFO L225 Difference]: With dead ends: 418 [2024-10-11 18:02:29,718 INFO L226 Difference]: Without dead ends: 418 [2024-10-11 18:02:29,718 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 42 GetRequests, 32 SyntacticMatches, 0 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 21 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=46, Invalid=86, Unknown=0, NotChecked=0, Total=132 [2024-10-11 18:02:29,719 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.6s IncrementalHoareTripleChecker+Time [2024-10-11 18:02:29,719 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.6s Time] [2024-10-11 18:02:29,722 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 418 states. [2024-10-11 18:02:29,729 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 418 to 382. [2024-10-11 18:02:29,730 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-11 18:02:29,732 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 382 states to 382 states and 599 transitions. [2024-10-11 18:02:29,732 INFO L78 Accepts]: Start accepts. Automaton has 382 states and 599 transitions. Word has length 21 [2024-10-11 18:02:29,733 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-11 18:02:29,733 INFO L471 AbstractCegarLoop]: Abstraction has 382 states and 599 transitions. [2024-10-11 18:02:29,733 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-11 18:02:29,733 INFO L276 IsEmpty]: Start isEmpty. Operand 382 states and 599 transitions. [2024-10-11 18:02:29,734 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 24 [2024-10-11 18:02:29,734 INFO L207 NwaCegarLoop]: Found error trace [2024-10-11 18:02:29,734 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-11 18:02:29,738 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/mathsat -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-11 18:02:29,935 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 12 /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/mathsat -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-11 18:02:29,935 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-11 18:02:29,935 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-11 18:02:29,935 INFO L85 PathProgramCache]: Analyzing trace with hash 2085829514, now seen corresponding path program 1 times [2024-10-11 18:02:29,936 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-10-11 18:02:29,936 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1949693401] [2024-10-11 18:02:29,936 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 18:02:29,936 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-11 18:02:29,936 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/mathsat [2024-10-11 18:02:29,937 INFO L229 MonitoredProcess]: Starting monitored process 13 with /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/mathsat -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-11 18:02:29,938 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/mathsat -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-11 18:02:29,994 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 18:02:29,995 INFO L255 TraceCheckSpWp]: Trace formula consists of 121 conjuncts, 2 conjuncts are in the unsatisfiable core [2024-10-11 18:02:29,997 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-11 18:02:30,003 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-11 18:02:30,003 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-10-11 18:02:30,004 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-10-11 18:02:30,004 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1949693401] [2024-10-11 18:02:30,004 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1949693401] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-11 18:02:30,004 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-11 18:02:30,004 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-10-11 18:02:30,004 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1336171636] [2024-10-11 18:02:30,004 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-11 18:02:30,004 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-10-11 18:02:30,004 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-10-11 18:02:30,005 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-10-11 18:02:30,005 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-10-11 18:02:30,005 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-11 18:02:30,022 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-11 18:02:30,022 INFO L93 Difference]: Finished difference Result 289 states and 442 transitions. [2024-10-11 18:02:30,024 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-10-11 18:02:30,024 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-11 18:02:30,024 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-11 18:02:30,025 INFO L225 Difference]: With dead ends: 289 [2024-10-11 18:02:30,025 INFO L226 Difference]: Without dead ends: 289 [2024-10-11 18:02:30,026 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-11 18:02:30,026 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-11 18:02:30,026 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-11 18:02:30,027 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 289 states. [2024-10-11 18:02:30,035 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 289 to 289. [2024-10-11 18:02:30,036 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-11 18:02:30,038 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 289 states to 289 states and 442 transitions. [2024-10-11 18:02:30,038 INFO L78 Accepts]: Start accepts. Automaton has 289 states and 442 transitions. Word has length 23 [2024-10-11 18:02:30,039 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-11 18:02:30,039 INFO L471 AbstractCegarLoop]: Abstraction has 289 states and 442 transitions. [2024-10-11 18:02:30,039 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-11 18:02:30,039 INFO L276 IsEmpty]: Start isEmpty. Operand 289 states and 442 transitions. [2024-10-11 18:02:30,040 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2024-10-11 18:02:30,040 INFO L207 NwaCegarLoop]: Found error trace [2024-10-11 18:02:30,040 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-11 18:02:30,045 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/mathsat -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-11 18:02:30,241 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 13 /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/mathsat -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-11 18:02:30,241 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-11 18:02:30,242 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-11 18:02:30,242 INFO L85 PathProgramCache]: Analyzing trace with hash 243656846, now seen corresponding path program 1 times [2024-10-11 18:02:30,242 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-10-11 18:02:30,242 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1656233025] [2024-10-11 18:02:30,242 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 18:02:30,242 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-11 18:02:30,242 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/mathsat [2024-10-11 18:02:30,245 INFO L229 MonitoredProcess]: Starting monitored process 14 with /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/mathsat -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-11 18:02:30,246 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/mathsat -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-11 18:02:30,327 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 18:02:30,334 INFO L255 TraceCheckSpWp]: Trace formula consists of 125 conjuncts, 14 conjuncts are in the unsatisfiable core [2024-10-11 18:02:30,336 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-11 18:02:30,650 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-10-11 18:02:30,658 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-11 18:02:30,726 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-11 18:02:30,726 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-10-11 18:02:34,989 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-10-11 18:02:34,989 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1656233025] [2024-10-11 18:02:34,989 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1656233025] provided 0 perfect and 1 imperfect interpolant sequences [2024-10-11 18:02:34,989 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleCvc4 [543671153] [2024-10-11 18:02:34,989 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 18:02:34,990 INFO L173 SolverBuilder]: Constructing external solver with command: cvc4 --incremental --print-success --lang smt [2024-10-11 18:02:34,990 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/cvc4 [2024-10-11 18:02:34,999 INFO L229 MonitoredProcess]: Starting monitored process 15 with /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/cvc4 --incremental --print-success --lang smt (exit command is (exit), workingDir is null) [2024-10-11 18:02:35,001 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/cvc4 --incremental --print-success --lang smt (15)] Waiting until timeout for monitored process [2024-10-11 18:02:35,185 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 18:02:35,197 INFO L255 TraceCheckSpWp]: Trace formula consists of 125 conjuncts, 14 conjuncts are in the unsatisfiable core [2024-10-11 18:02:35,200 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-11 18:02:35,465 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-10-11 18:02:35,467 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-11 18:02:35,507 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-11 18:02:35,508 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-10-11 18:02:43,002 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleCvc4 [543671153] provided 0 perfect and 1 imperfect interpolant sequences [2024-10-11 18:02:43,002 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2024-10-11 18:02:43,002 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [5, 5] total 5 [2024-10-11 18:02:43,002 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [510042648] [2024-10-11 18:02:43,007 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2024-10-11 18:02:43,008 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2024-10-11 18:02:43,008 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-10-11 18:02:43,009 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2024-10-11 18:02:43,010 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=24, Invalid=65, Unknown=1, NotChecked=0, Total=90 [2024-10-11 18:02:43,010 INFO L87 Difference]: Start difference. First operand 289 states and 442 transitions. Second operand has 7 states, 5 states have (on average 4.4) internal successors, (22), 5 states have internal predecessors, (22), 2 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2024-10-11 18:02:43,582 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-11 18:02:43,582 INFO L93 Difference]: Finished difference Result 322 states and 449 transitions. [2024-10-11 18:02:43,582 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2024-10-11 18:02:43,583 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 5 states have (on average 4.4) internal successors, (22), 5 states have internal predecessors, (22), 2 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 25 [2024-10-11 18:02:43,583 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-11 18:02:43,584 INFO L225 Difference]: With dead ends: 322 [2024-10-11 18:02:43,584 INFO L226 Difference]: Without dead ends: 322 [2024-10-11 18:02:43,585 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 67 GetRequests, 49 SyntacticMatches, 1 SemanticMatches, 17 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 43 ImplicationChecksByTransitivity, 11.8s TimeCoverageRelationStatistics Valid=111, Invalid=230, Unknown=1, NotChecked=0, Total=342 [2024-10-11 18:02:43,585 INFO L432 NwaCegarLoop]: 38 mSDtfsCounter, 190 mSDsluCounter, 84 mSDsCounter, 0 mSdLazyCounter, 125 mSolverCounterSat, 34 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 190 SdHoareTripleChecker+Valid, 122 SdHoareTripleChecker+Invalid, 159 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 34 IncrementalHoareTripleChecker+Valid, 125 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2024-10-11 18:02:43,585 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [190 Valid, 122 Invalid, 159 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [34 Valid, 125 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2024-10-11 18:02:43,586 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 322 states. [2024-10-11 18:02:43,592 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 322 to 313. [2024-10-11 18:02:43,593 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 313 states, 274 states have (on average 1.5) internal successors, (411), 298 states have internal predecessors, (411), 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-11 18:02:43,594 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 313 states to 313 states and 445 transitions. [2024-10-11 18:02:43,595 INFO L78 Accepts]: Start accepts. Automaton has 313 states and 445 transitions. Word has length 25 [2024-10-11 18:02:43,595 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-11 18:02:43,595 INFO L471 AbstractCegarLoop]: Abstraction has 313 states and 445 transitions. [2024-10-11 18:02:43,595 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 5 states have (on average 4.4) internal successors, (22), 5 states have internal predecessors, (22), 2 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2024-10-11 18:02:43,595 INFO L276 IsEmpty]: Start isEmpty. Operand 313 states and 445 transitions. [2024-10-11 18:02:43,596 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 27 [2024-10-11 18:02:43,596 INFO L207 NwaCegarLoop]: Found error trace [2024-10-11 18:02:43,596 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-11 18:02:43,601 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/mathsat -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-11 18:02:43,800 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/cvc4 --incremental --print-success --lang smt (15)] Forceful destruction successful, exit code 0 [2024-10-11 18:02:43,997 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 14 /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/mathsat -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-clean/releaseScripts/default/UAutomizer-linux/cvc4 --incremental --print-success --lang smt [2024-10-11 18:02:43,997 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-11 18:02:43,997 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-11 18:02:43,997 INFO L85 PathProgramCache]: Analyzing trace with hash -605850576, now seen corresponding path program 1 times [2024-10-11 18:02:43,998 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-10-11 18:02:43,998 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1847442554] [2024-10-11 18:02:43,998 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 18:02:43,998 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-10-11 18:02:43,998 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/mathsat [2024-10-11 18:02:44,000 INFO L229 MonitoredProcess]: Starting monitored process 16 with /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/mathsat -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-11 18:02:44,000 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/mathsat -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-11 18:02:44,059 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 18:02:44,061 INFO L255 TraceCheckSpWp]: Trace formula consists of 124 conjuncts, 8 conjuncts are in the unsatisfiable core [2024-10-11 18:02:44,062 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-11 18:02:44,171 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-11 18:02:44,171 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-10-11 18:02:44,349 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-11 18:02:44,350 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-10-11 18:02:44,350 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1847442554] [2024-10-11 18:02:44,350 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1847442554] provided 0 perfect and 2 imperfect interpolant sequences [2024-10-11 18:02:44,350 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2024-10-11 18:02:44,350 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [4, 4] total 7 [2024-10-11 18:02:44,350 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1127861561] [2024-10-11 18:02:44,350 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2024-10-11 18:02:44,351 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2024-10-11 18:02:44,351 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-10-11 18:02:44,351 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2024-10-11 18:02:44,351 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=23, Invalid=49, Unknown=0, NotChecked=0, Total=72 [2024-10-11 18:02:44,351 INFO L87 Difference]: Start difference. First operand 313 states and 445 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-11 18:02:44,712 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-11 18:02:44,712 INFO L93 Difference]: Finished difference Result 445 states and 579 transitions. [2024-10-11 18:02:44,712 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2024-10-11 18:02:44,713 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-11 18:02:44,713 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-11 18:02:44,714 INFO L225 Difference]: With dead ends: 445 [2024-10-11 18:02:44,714 INFO L226 Difference]: Without dead ends: 445 [2024-10-11 18:02:44,715 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 58 GetRequests, 43 SyntacticMatches, 0 SemanticMatches, 15 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 37 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=90, Invalid=182, Unknown=0, NotChecked=0, Total=272 [2024-10-11 18:02:44,715 INFO L432 NwaCegarLoop]: 63 mSDtfsCounter, 360 mSDsluCounter, 160 mSDsCounter, 0 mSdLazyCounter, 142 mSolverCounterSat, 23 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 360 SdHoareTripleChecker+Valid, 223 SdHoareTripleChecker+Invalid, 165 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 23 IncrementalHoareTripleChecker+Valid, 142 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2024-10-11 18:02:44,715 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [360 Valid, 223 Invalid, 165 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [23 Valid, 142 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2024-10-11 18:02:44,716 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 445 states. [2024-10-11 18:02:44,724 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 445 to 396. [2024-10-11 18:02:44,724 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 396 states, 354 states have (on average 1.4435028248587571) internal successors, (511), 379 states have internal predecessors, (511), 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-11 18:02:44,726 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 396 states to 396 states and 544 transitions. [2024-10-11 18:02:44,726 INFO L78 Accepts]: Start accepts. Automaton has 396 states and 544 transitions. Word has length 26 [2024-10-11 18:02:44,726 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-11 18:02:44,726 INFO L471 AbstractCegarLoop]: Abstraction has 396 states and 544 transitions. [2024-10-11 18:02:44,727 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-11 18:02:44,727 INFO L276 IsEmpty]: Start isEmpty. Operand 396 states and 544 transitions. [2024-10-11 18:02:44,729 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 28 [2024-10-11 18:02:44,730 INFO L207 NwaCegarLoop]: Found error trace [2024-10-11 18:02:44,731 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-11 18:02:44,737 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/mathsat -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-11 18:02:44,931 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 16 /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/mathsat -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-11 18:02:44,932 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-11 18:02:44,932 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-11 18:02:44,932 INFO L85 PathProgramCache]: Analyzing trace with hash -1601498623, now seen corresponding path program 1 times [2024-10-11 18:02:44,933 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-10-11 18:02:44,933 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1783470997] [2024-10-11 18:02:44,933 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 18:02:44,933 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-11 18:02:44,933 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/mathsat [2024-10-11 18:02:44,936 INFO L229 MonitoredProcess]: Starting monitored process 17 with /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/mathsat -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-11 18:02:44,937 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/mathsat -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-11 18:02:45,002 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 18:02:45,005 INFO L255 TraceCheckSpWp]: Trace formula consists of 125 conjuncts, 10 conjuncts are in the unsatisfiable core [2024-10-11 18:02:45,007 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-11 18:02:45,139 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-11 18:02:45,139 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-10-11 18:02:45,303 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-11 18:02:45,304 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-10-11 18:02:45,304 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1783470997] [2024-10-11 18:02:45,304 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1783470997] provided 0 perfect and 2 imperfect interpolant sequences [2024-10-11 18:02:45,304 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2024-10-11 18:02:45,304 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [4, 4] total 8 [2024-10-11 18:02:45,304 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [572035666] [2024-10-11 18:02:45,304 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2024-10-11 18:02:45,306 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2024-10-11 18:02:45,306 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-10-11 18:02:45,307 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2024-10-11 18:02:45,307 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=29, Invalid=61, Unknown=0, NotChecked=0, Total=90 [2024-10-11 18:02:45,307 INFO L87 Difference]: Start difference. First operand 396 states and 544 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-11 18:02:45,803 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-11 18:02:45,804 INFO L93 Difference]: Finished difference Result 427 states and 550 transitions. [2024-10-11 18:02:45,805 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2024-10-11 18:02:45,805 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-11 18:02:45,805 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-11 18:02:45,806 INFO L225 Difference]: With dead ends: 427 [2024-10-11 18:02:45,806 INFO L226 Difference]: Without dead ends: 427 [2024-10-11 18:02:45,807 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-11 18:02:45,807 INFO L432 NwaCegarLoop]: 68 mSDtfsCounter, 367 mSDsluCounter, 268 mSDsCounter, 0 mSdLazyCounter, 158 mSolverCounterSat, 20 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 367 SdHoareTripleChecker+Valid, 336 SdHoareTripleChecker+Invalid, 178 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 20 IncrementalHoareTripleChecker+Valid, 158 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2024-10-11 18:02:45,808 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [367 Valid, 336 Invalid, 178 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [20 Valid, 158 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2024-10-11 18:02:45,808 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 427 states. [2024-10-11 18:02:45,815 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 427 to 406. [2024-10-11 18:02:45,815 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 406 states, 363 states have (on average 1.4104683195592287) internal successors, (512), 389 states have internal predecessors, (512), 8 states have call successors, (8), 8 states have call predecessors, (8), 17 states have return successors, (25), 8 states have call predecessors, (25), 8 states have call successors, (25) [2024-10-11 18:02:45,817 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 406 states to 406 states and 545 transitions. [2024-10-11 18:02:45,817 INFO L78 Accepts]: Start accepts. Automaton has 406 states and 545 transitions. Word has length 27 [2024-10-11 18:02:45,817 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-11 18:02:45,817 INFO L471 AbstractCegarLoop]: Abstraction has 406 states and 545 transitions. [2024-10-11 18:02:45,817 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-11 18:02:45,817 INFO L276 IsEmpty]: Start isEmpty. Operand 406 states and 545 transitions. [2024-10-11 18:02:45,818 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 28 [2024-10-11 18:02:45,818 INFO L207 NwaCegarLoop]: Found error trace [2024-10-11 18:02:45,818 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-11 18:02:45,825 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/mathsat -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-11 18:02:46,018 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 17 /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/mathsat -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-11 18:02:46,019 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-11 18:02:46,019 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-11 18:02:46,019 INFO L85 PathProgramCache]: Analyzing trace with hash -2068973779, now seen corresponding path program 1 times [2024-10-11 18:02:46,019 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-10-11 18:02:46,020 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [108069148] [2024-10-11 18:02:46,020 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 18:02:46,020 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-10-11 18:02:46,020 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/mathsat [2024-10-11 18:02:46,024 INFO L229 MonitoredProcess]: Starting monitored process 18 with /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/mathsat -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-11 18:02:46,026 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/mathsat -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-11 18:02:46,114 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 18:02:46,116 INFO L255 TraceCheckSpWp]: Trace formula consists of 132 conjuncts, 18 conjuncts are in the unsatisfiable core [2024-10-11 18:02:46,118 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-11 18:02:46,471 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-10-11 18:02:46,472 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-11 18:02:46,623 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-11 18:02:46,623 INFO L311 TraceCheckSpWp]: Computing backward predicates...