./Ultimate.py --spec ../sv-benchmarks/c/properties/valid-memsafety.prp --file ../sv-benchmarks/c/memsafety-bftpd/bftpd_2.i --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for memory safety (deref-memtrack) Using default analysis Version 3061b6dc Calling Ultimate with: /root/.sdkman/candidates/java/11.0.12-open/bin/java -Dosgi.configuration.area=/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/config -Xmx15G -Xms4m -jar /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/plugins/org.eclipse.equinox.launcher_1.5.800.v20200727-1323.jar -data @noDefault -ultimatedata /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data -tc /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/AutomizerMemDerefMemtrack.xml -i ../sv-benchmarks/c/memsafety-bftpd/bftpd_2.i -s /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-DerefFreeMemtrack-32bit-Automizer_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux --witnessprinter.witness.filename witness --witnessprinter.write.witness.besides.input.file false --witnessprinter.graph.data.specification CHECK( init(main()), LTL(G valid-free) ) CHECK( init(main()), LTL(G valid-deref) ) CHECK( init(main()), LTL(G valid-memtrack) ) --witnessprinter.graph.data.producer Automizer --witnessprinter.graph.data.architecture 32bit --witnessprinter.graph.data.programhash 7c883b81b24ce5a721aa9a1ff13aef8a0d532ba87d9e130e470a0b88a1f8e93e --- Real Ultimate output --- This is Ultimate 0.2.5-tmp.dk.eval-assert-order-craig-3061b6d-m [2024-11-19 06:45:42,605 INFO L188 SettingsManager]: Resetting all preferences to default values... [2024-11-19 06:45:42,701 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-DerefFreeMemtrack-32bit-Automizer_Default.epf [2024-11-19 06:45:42,707 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2024-11-19 06:45:42,708 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2024-11-19 06:45:42,738 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2024-11-19 06:45:42,738 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2024-11-19 06:45:42,739 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2024-11-19 06:45:42,740 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2024-11-19 06:45:42,740 INFO L153 SettingsManager]: * Use memory slicer=true [2024-11-19 06:45:42,741 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2024-11-19 06:45:42,741 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2024-11-19 06:45:42,742 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2024-11-19 06:45:42,742 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2024-11-19 06:45:42,742 INFO L153 SettingsManager]: * Use SBE=true [2024-11-19 06:45:42,743 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2024-11-19 06:45:42,743 INFO L153 SettingsManager]: * sizeof long=4 [2024-11-19 06:45:42,743 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2024-11-19 06:45:42,744 INFO L153 SettingsManager]: * sizeof POINTER=4 [2024-11-19 06:45:42,744 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2024-11-19 06:45:42,744 INFO L153 SettingsManager]: * Check for the main procedure if all allocated memory was freed=true [2024-11-19 06:45:42,745 INFO L153 SettingsManager]: * Bitprecise bitfields=true [2024-11-19 06:45:42,745 INFO L153 SettingsManager]: * SV-COMP memtrack compatibility mode=true [2024-11-19 06:45:42,745 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2024-11-19 06:45:42,746 INFO L153 SettingsManager]: * Adapt memory model on pointer casts if necessary=true [2024-11-19 06:45:42,746 INFO L153 SettingsManager]: * Allow undefined functions=false [2024-11-19 06:45:42,746 INFO L153 SettingsManager]: * Check unreachability of reach_error function=false [2024-11-19 06:45:42,747 INFO L153 SettingsManager]: * sizeof long double=12 [2024-11-19 06:45:42,747 INFO L153 SettingsManager]: * Use constant arrays=true [2024-11-19 06:45:42,747 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2024-11-19 06:45:42,748 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2024-11-19 06:45:42,748 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2024-11-19 06:45:42,748 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2024-11-19 06:45:42,748 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-11-19 06:45:42,749 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2024-11-19 06:45:42,749 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2024-11-19 06:45:42,749 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2024-11-19 06:45:42,749 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2024-11-19 06:45:42,749 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2024-11-19 06:45:42,750 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2024-11-19 06:45:42,750 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2024-11-19 06:45:42,751 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2024-11-19 06:45:42,751 INFO L153 SettingsManager]: * Looper check in Petri net analysis=SEMANTIC WARNING: An illegal reflective access operation has occurred WARNING: Illegal reflective access by com.sun.xml.bind.v2.runtime.reflect.opt.Injector$1 (file:/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/plugins/com.sun.xml.bind_2.2.0.v201505121915.jar) to method java.lang.ClassLoader.defineClass(java.lang.String,byte[],int,int) WARNING: Please consider reporting this to the maintainers of com.sun.xml.bind.v2.runtime.reflect.opt.Injector$1 WARNING: Use --illegal-access=warn to enable warnings of further illegal reflective access operations WARNING: All illegal access operations will be denied in a future release Applying setting for plugin de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator: Entry function -> main Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Witness directory -> /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Witness filename -> witness Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Write witness besides input file -> false Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data specification -> CHECK( init(main()), LTL(G valid-free) ) CHECK( init(main()), LTL(G valid-deref) ) CHECK( init(main()), LTL(G valid-memtrack) ) Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data producer -> Automizer Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data architecture -> 32bit Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data programhash -> 7c883b81b24ce5a721aa9a1ff13aef8a0d532ba87d9e130e470a0b88a1f8e93e [2024-11-19 06:45:42,994 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2024-11-19 06:45:43,020 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2024-11-19 06:45:43,024 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2024-11-19 06:45:43,026 INFO L270 PluginConnector]: Initializing CDTParser... [2024-11-19 06:45:43,026 INFO L274 PluginConnector]: CDTParser initialized [2024-11-19 06:45:43,027 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/memsafety-bftpd/bftpd_2.i [2024-11-19 06:45:44,540 INFO L533 CDTParser]: Created temporary CDT project at NULL [2024-11-19 06:45:44,808 INFO L384 CDTParser]: Found 1 translation units. [2024-11-19 06:45:44,810 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/memsafety-bftpd/bftpd_2.i [2024-11-19 06:45:44,831 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/56fd95a8d/fc2c35c41c9c4102837f769def19fb87/FLAG6e33e6b1d [2024-11-19 06:45:44,847 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/56fd95a8d/fc2c35c41c9c4102837f769def19fb87 [2024-11-19 06:45:44,852 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2024-11-19 06:45:44,854 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2024-11-19 06:45:44,856 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2024-11-19 06:45:44,856 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2024-11-19 06:45:44,862 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2024-11-19 06:45:44,862 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 19.11 06:45:44" (1/1) ... [2024-11-19 06:45:44,863 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@2f284dca and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.11 06:45:44, skipping insertion in model container [2024-11-19 06:45:44,865 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 19.11 06:45:44" (1/1) ... [2024-11-19 06:45:44,913 INFO L175 MainTranslator]: Built tables and reachable declarations [2024-11-19 06:45:45,362 WARN L1070 CHandler]: saw a pointer cast to a type that we could not get a type size for, not adapting memory model [2024-11-19 06:45:45,370 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-11-19 06:45:45,383 INFO L200 MainTranslator]: Completed pre-run [2024-11-19 06:45:45,435 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-11-19 06:45:45,479 INFO L204 MainTranslator]: Completed translation [2024-11-19 06:45:45,480 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.11 06:45:45 WrapperNode [2024-11-19 06:45:45,480 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2024-11-19 06:45:45,481 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2024-11-19 06:45:45,482 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2024-11-19 06:45:45,482 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2024-11-19 06:45:45,491 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.11 06:45:45" (1/1) ... [2024-11-19 06:45:45,508 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.11 06:45:45" (1/1) ... [2024-11-19 06:45:45,534 INFO L138 Inliner]: procedures = 168, calls = 42, calls flagged for inlining = 5, calls inlined = 5, statements flattened = 95 [2024-11-19 06:45:45,534 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2024-11-19 06:45:45,535 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2024-11-19 06:45:45,535 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2024-11-19 06:45:45,536 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2024-11-19 06:45:45,550 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.11 06:45:45" (1/1) ... [2024-11-19 06:45:45,551 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.11 06:45:45" (1/1) ... [2024-11-19 06:45:45,555 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.11 06:45:45" (1/1) ... [2024-11-19 06:45:45,580 INFO L175 MemorySlicer]: Split 24 memory accesses to 3 slices as follows [6, 9, 9]. 38 percent of accesses are in the largest equivalence class. The 21 initializations are split as follows [6, 6, 9]. The 0 writes are split as follows [0, 0, 0]. [2024-11-19 06:45:45,581 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.11 06:45:45" (1/1) ... [2024-11-19 06:45:45,581 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.11 06:45:45" (1/1) ... [2024-11-19 06:45:45,592 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.11 06:45:45" (1/1) ... [2024-11-19 06:45:45,596 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.11 06:45:45" (1/1) ... [2024-11-19 06:45:45,601 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.11 06:45:45" (1/1) ... [2024-11-19 06:45:45,606 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.11 06:45:45" (1/1) ... [2024-11-19 06:45:45,609 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2024-11-19 06:45:45,614 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2024-11-19 06:45:45,614 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2024-11-19 06:45:45,614 INFO L274 PluginConnector]: RCFGBuilder initialized [2024-11-19 06:45:45,615 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.11 06:45:45" (1/1) ... [2024-11-19 06:45:45,626 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-11-19 06:45:45,637 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-19 06:45:45,654 INFO L229 MonitoredProcess]: Starting monitored process 1 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (exit command is (exit), workingDir is null) [2024-11-19 06:45:45,660 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Waiting until timeout for monitored process [2024-11-19 06:45:45,709 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#0 [2024-11-19 06:45:45,710 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#1 [2024-11-19 06:45:45,710 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#2 [2024-11-19 06:45:45,711 INFO L130 BoogieDeclarations]: Found specification of procedure parse_input [2024-11-19 06:45:45,711 INFO L138 BoogieDeclarations]: Found implementation of procedure parse_input [2024-11-19 06:45:45,711 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnHeap [2024-11-19 06:45:45,711 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2024-11-19 06:45:45,711 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$#0 [2024-11-19 06:45:45,712 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$#1 [2024-11-19 06:45:45,712 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$#2 [2024-11-19 06:45:45,712 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2024-11-19 06:45:45,712 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~$Pointer$#0 [2024-11-19 06:45:45,712 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~$Pointer$#1 [2024-11-19 06:45:45,712 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~$Pointer$#2 [2024-11-19 06:45:45,712 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#0 [2024-11-19 06:45:45,712 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#1 [2024-11-19 06:45:45,712 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#2 [2024-11-19 06:45:45,712 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2024-11-19 06:45:45,713 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2024-11-19 06:45:45,836 INFO L238 CfgBuilder]: Building ICFG [2024-11-19 06:45:45,839 INFO L264 CfgBuilder]: Building CFG for each procedure with an implementation [2024-11-19 06:45:46,085 INFO L? ?]: Removed 34 outVars from TransFormulas that were not future-live. [2024-11-19 06:45:46,087 INFO L287 CfgBuilder]: Performing block encoding [2024-11-19 06:45:46,103 INFO L311 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2024-11-19 06:45:46,103 INFO L316 CfgBuilder]: Removed 1 assume(true) statements. [2024-11-19 06:45:46,103 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 19.11 06:45:46 BoogieIcfgContainer [2024-11-19 06:45:46,104 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2024-11-19 06:45:46,106 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2024-11-19 06:45:46,106 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2024-11-19 06:45:46,109 INFO L274 PluginConnector]: TraceAbstraction initialized [2024-11-19 06:45:46,110 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 19.11 06:45:44" (1/3) ... [2024-11-19 06:45:46,110 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@4d2750b4 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 19.11 06:45:46, skipping insertion in model container [2024-11-19 06:45:46,111 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.11 06:45:45" (2/3) ... [2024-11-19 06:45:46,111 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@4d2750b4 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 19.11 06:45:46, skipping insertion in model container [2024-11-19 06:45:46,111 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 19.11 06:45:46" (3/3) ... [2024-11-19 06:45:46,113 INFO L112 eAbstractionObserver]: Analyzing ICFG bftpd_2.i [2024-11-19 06:45:46,128 INFO L214 ceAbstractionStarter]: Automizer settings: Hoare:None NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2024-11-19 06:45:46,128 INFO L154 ceAbstractionStarter]: Applying trace abstraction to program that has 20 error locations. [2024-11-19 06:45:46,177 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2024-11-19 06:45:46,184 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;@15ece761, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2024-11-19 06:45:46,184 INFO L334 AbstractCegarLoop]: Starting to check reachability of 20 error locations. [2024-11-19 06:45:46,190 INFO L276 IsEmpty]: Start isEmpty. Operand has 62 states, 37 states have (on average 1.7567567567567568) internal successors, (65), 57 states have internal predecessors, (65), 3 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) [2024-11-19 06:45:46,197 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 7 [2024-11-19 06:45:46,197 INFO L207 NwaCegarLoop]: Found error trace [2024-11-19 06:45:46,198 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1] [2024-11-19 06:45:46,199 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting parse_inputErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [parse_inputErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, parse_inputErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, parse_inputErr2ASSERT_VIOLATIONMEMORY_DEREFERENCE (and 17 more)] === [2024-11-19 06:45:46,205 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-19 06:45:46,206 INFO L85 PathProgramCache]: Analyzing trace with hash -742866944, now seen corresponding path program 1 times [2024-11-19 06:45:46,217 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-19 06:45:46,218 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1059807317] [2024-11-19 06:45:46,218 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-19 06:45:46,220 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-19 06:45:46,360 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-19 06:45:46,587 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-19 06:45:46,588 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-19 06:45:46,588 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1059807317] [2024-11-19 06:45:46,590 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1059807317] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-19 06:45:46,590 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-19 06:45:46,590 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-11-19 06:45:46,591 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [296996777] [2024-11-19 06:45:46,592 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-19 06:45:46,596 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-11-19 06:45:46,597 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-19 06:45:46,624 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-11-19 06:45:46,625 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2024-11-19 06:45:46,626 INFO L87 Difference]: Start difference. First operand has 62 states, 37 states have (on average 1.7567567567567568) internal successors, (65), 57 states have internal predecessors, (65), 3 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) Second operand has 4 states, 3 states have (on average 1.6666666666666667) internal successors, (5), 3 states have internal predecessors, (5), 1 states have call successors, (1), 1 states have call predecessors, (1), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-19 06:45:46,790 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-19 06:45:46,791 INFO L93 Difference]: Finished difference Result 127 states and 148 transitions. [2024-11-19 06:45:46,792 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-11-19 06:45:46,794 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 3 states have (on average 1.6666666666666667) internal successors, (5), 3 states have internal predecessors, (5), 1 states have call successors, (1), 1 states have call predecessors, (1), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 6 [2024-11-19 06:45:46,794 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-19 06:45:46,803 INFO L225 Difference]: With dead ends: 127 [2024-11-19 06:45:46,803 INFO L226 Difference]: Without dead ends: 121 [2024-11-19 06:45:46,805 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2024-11-19 06:45:46,808 INFO L432 NwaCegarLoop]: 55 mSDtfsCounter, 107 mSDsluCounter, 69 mSDsCounter, 0 mSdLazyCounter, 60 mSolverCounterSat, 7 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 107 SdHoareTripleChecker+Valid, 124 SdHoareTripleChecker+Invalid, 67 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 7 IncrementalHoareTripleChecker+Valid, 60 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-11-19 06:45:46,810 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [107 Valid, 124 Invalid, 67 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [7 Valid, 60 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-11-19 06:45:46,829 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 121 states. [2024-11-19 06:45:46,857 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 121 to 95. [2024-11-19 06:45:46,859 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 95 states, 68 states have (on average 1.588235294117647) internal successors, (108), 85 states have internal predecessors, (108), 6 states have call successors, (6), 3 states have call predecessors, (6), 3 states have return successors, (12), 6 states have call predecessors, (12), 6 states have call successors, (12) [2024-11-19 06:45:46,868 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 95 states to 95 states and 126 transitions. [2024-11-19 06:45:46,870 INFO L78 Accepts]: Start accepts. Automaton has 95 states and 126 transitions. Word has length 6 [2024-11-19 06:45:46,871 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-19 06:45:46,871 INFO L471 AbstractCegarLoop]: Abstraction has 95 states and 126 transitions. [2024-11-19 06:45:46,871 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 3 states have (on average 1.6666666666666667) internal successors, (5), 3 states have internal predecessors, (5), 1 states have call successors, (1), 1 states have call predecessors, (1), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-19 06:45:46,872 INFO L276 IsEmpty]: Start isEmpty. Operand 95 states and 126 transitions. [2024-11-19 06:45:46,872 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 7 [2024-11-19 06:45:46,872 INFO L207 NwaCegarLoop]: Found error trace [2024-11-19 06:45:46,872 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1] [2024-11-19 06:45:46,873 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2024-11-19 06:45:46,874 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting parse_inputErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [parse_inputErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, parse_inputErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, parse_inputErr2ASSERT_VIOLATIONMEMORY_DEREFERENCE (and 17 more)] === [2024-11-19 06:45:46,874 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-19 06:45:46,875 INFO L85 PathProgramCache]: Analyzing trace with hash -742866943, now seen corresponding path program 1 times [2024-11-19 06:45:46,875 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-19 06:45:46,875 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [960333123] [2024-11-19 06:45:46,876 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-19 06:45:46,876 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-19 06:45:46,910 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-19 06:45:47,068 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-19 06:45:47,069 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-19 06:45:47,069 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [960333123] [2024-11-19 06:45:47,069 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [960333123] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-19 06:45:47,069 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-19 06:45:47,070 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-11-19 06:45:47,075 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1293001866] [2024-11-19 06:45:47,075 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-19 06:45:47,076 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2024-11-19 06:45:47,076 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-19 06:45:47,077 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2024-11-19 06:45:47,077 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2024-11-19 06:45:47,077 INFO L87 Difference]: Start difference. First operand 95 states and 126 transitions. Second operand has 5 states, 4 states have (on average 1.25) internal successors, (5), 3 states have internal predecessors, (5), 1 states have call successors, (1), 1 states have call predecessors, (1), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-19 06:45:47,216 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-19 06:45:47,216 INFO L93 Difference]: Finished difference Result 196 states and 270 transitions. [2024-11-19 06:45:47,217 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-11-19 06:45:47,217 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 4 states have (on average 1.25) internal successors, (5), 3 states have internal predecessors, (5), 1 states have call successors, (1), 1 states have call predecessors, (1), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 6 [2024-11-19 06:45:47,217 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-19 06:45:47,219 INFO L225 Difference]: With dead ends: 196 [2024-11-19 06:45:47,219 INFO L226 Difference]: Without dead ends: 196 [2024-11-19 06:45:47,220 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=14, Invalid=16, Unknown=0, NotChecked=0, Total=30 [2024-11-19 06:45:47,222 INFO L432 NwaCegarLoop]: 58 mSDtfsCounter, 143 mSDsluCounter, 80 mSDsCounter, 0 mSdLazyCounter, 50 mSolverCounterSat, 8 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 143 SdHoareTripleChecker+Valid, 138 SdHoareTripleChecker+Invalid, 58 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 8 IncrementalHoareTripleChecker+Valid, 50 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-11-19 06:45:47,223 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [143 Valid, 138 Invalid, 58 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [8 Valid, 50 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-11-19 06:45:47,224 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 196 states. [2024-11-19 06:45:47,240 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 196 to 173. [2024-11-19 06:45:47,241 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 173 states, 138 states have (on average 1.6014492753623188) internal successors, (221), 155 states have internal predecessors, (221), 11 states have call successors, (11), 6 states have call predecessors, (11), 6 states have return successors, (34), 11 states have call predecessors, (34), 11 states have call successors, (34) [2024-11-19 06:45:47,245 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 173 states to 173 states and 266 transitions. [2024-11-19 06:45:47,245 INFO L78 Accepts]: Start accepts. Automaton has 173 states and 266 transitions. Word has length 6 [2024-11-19 06:45:47,245 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-19 06:45:47,246 INFO L471 AbstractCegarLoop]: Abstraction has 173 states and 266 transitions. [2024-11-19 06:45:47,246 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 4 states have (on average 1.25) internal successors, (5), 3 states have internal predecessors, (5), 1 states have call successors, (1), 1 states have call predecessors, (1), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-19 06:45:47,246 INFO L276 IsEmpty]: Start isEmpty. Operand 173 states and 266 transitions. [2024-11-19 06:45:47,247 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 8 [2024-11-19 06:45:47,247 INFO L207 NwaCegarLoop]: Found error trace [2024-11-19 06:45:47,247 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1] [2024-11-19 06:45:47,247 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2024-11-19 06:45:47,247 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting parse_inputErr2ASSERT_VIOLATIONMEMORY_DEREFERENCE === [parse_inputErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, parse_inputErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, parse_inputErr2ASSERT_VIOLATIONMEMORY_DEREFERENCE (and 17 more)] === [2024-11-19 06:45:47,248 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-19 06:45:47,248 INFO L85 PathProgramCache]: Analyzing trace with hash -1554038803, now seen corresponding path program 1 times [2024-11-19 06:45:47,249 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-19 06:45:47,249 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1394642545] [2024-11-19 06:45:47,249 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-19 06:45:47,249 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-19 06:45:47,290 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-19 06:45:47,500 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-19 06:45:47,501 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-19 06:45:47,501 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1394642545] [2024-11-19 06:45:47,501 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1394642545] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-19 06:45:47,501 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-19 06:45:47,501 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-11-19 06:45:47,501 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1746655705] [2024-11-19 06:45:47,501 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-19 06:45:47,502 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2024-11-19 06:45:47,502 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-19 06:45:47,503 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2024-11-19 06:45:47,503 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2024-11-19 06:45:47,503 INFO L87 Difference]: Start difference. First operand 173 states and 266 transitions. Second operand has 5 states, 4 states have (on average 1.5) internal successors, (6), 4 states have internal predecessors, (6), 1 states have call successors, (1), 1 states have call predecessors, (1), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-19 06:45:47,654 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-19 06:45:47,655 INFO L93 Difference]: Finished difference Result 213 states and 305 transitions. [2024-11-19 06:45:47,655 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-11-19 06:45:47,655 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 4 states have (on average 1.5) internal successors, (6), 4 states have internal predecessors, (6), 1 states have call successors, (1), 1 states have call predecessors, (1), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 7 [2024-11-19 06:45:47,656 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-19 06:45:47,658 INFO L225 Difference]: With dead ends: 213 [2024-11-19 06:45:47,658 INFO L226 Difference]: Without dead ends: 213 [2024-11-19 06:45:47,658 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=13, Invalid=17, Unknown=0, NotChecked=0, Total=30 [2024-11-19 06:45:47,660 INFO L432 NwaCegarLoop]: 50 mSDtfsCounter, 68 mSDsluCounter, 118 mSDsCounter, 0 mSdLazyCounter, 119 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 68 SdHoareTripleChecker+Valid, 168 SdHoareTripleChecker+Invalid, 121 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 119 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-11-19 06:45:47,660 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [68 Valid, 168 Invalid, 121 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 119 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-11-19 06:45:47,661 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 213 states. [2024-11-19 06:45:47,683 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 213 to 176. [2024-11-19 06:45:47,685 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 176 states, 141 states have (on average 1.5886524822695036) internal successors, (224), 158 states have internal predecessors, (224), 11 states have call successors, (11), 6 states have call predecessors, (11), 6 states have return successors, (34), 11 states have call predecessors, (34), 11 states have call successors, (34) [2024-11-19 06:45:47,688 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 176 states to 176 states and 269 transitions. [2024-11-19 06:45:47,691 INFO L78 Accepts]: Start accepts. Automaton has 176 states and 269 transitions. Word has length 7 [2024-11-19 06:45:47,691 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-19 06:45:47,692 INFO L471 AbstractCegarLoop]: Abstraction has 176 states and 269 transitions. [2024-11-19 06:45:47,692 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 4 states have (on average 1.5) internal successors, (6), 4 states have internal predecessors, (6), 1 states have call successors, (1), 1 states have call predecessors, (1), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-19 06:45:47,692 INFO L276 IsEmpty]: Start isEmpty. Operand 176 states and 269 transitions. [2024-11-19 06:45:47,692 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 9 [2024-11-19 06:45:47,693 INFO L207 NwaCegarLoop]: Found error trace [2024-11-19 06:45:47,693 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1] [2024-11-19 06:45:47,694 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2024-11-19 06:45:47,694 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting parse_inputErr3ASSERT_VIOLATIONMEMORY_DEREFERENCE === [parse_inputErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, parse_inputErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, parse_inputErr2ASSERT_VIOLATIONMEMORY_DEREFERENCE (and 17 more)] === [2024-11-19 06:45:47,695 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-19 06:45:47,695 INFO L85 PathProgramCache]: Analyzing trace with hash -930562592, now seen corresponding path program 1 times [2024-11-19 06:45:47,695 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-19 06:45:47,695 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [691231944] [2024-11-19 06:45:47,696 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-19 06:45:47,696 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-19 06:45:47,716 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-19 06:45:47,903 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-19 06:45:47,903 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-19 06:45:47,904 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [691231944] [2024-11-19 06:45:47,904 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [691231944] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-19 06:45:47,904 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-19 06:45:47,904 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-11-19 06:45:47,904 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1735010580] [2024-11-19 06:45:47,904 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-19 06:45:47,905 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2024-11-19 06:45:47,905 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-19 06:45:47,905 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2024-11-19 06:45:47,905 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2024-11-19 06:45:47,905 INFO L87 Difference]: Start difference. First operand 176 states and 269 transitions. Second operand has 5 states, 4 states have (on average 1.75) internal successors, (7), 4 states have internal predecessors, (7), 1 states have call successors, (1), 1 states have call predecessors, (1), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-19 06:45:48,028 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-19 06:45:48,028 INFO L93 Difference]: Finished difference Result 198 states and 271 transitions. [2024-11-19 06:45:48,029 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-11-19 06:45:48,029 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 4 states have (on average 1.75) internal successors, (7), 4 states have internal predecessors, (7), 1 states have call successors, (1), 1 states have call predecessors, (1), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 8 [2024-11-19 06:45:48,029 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-19 06:45:48,031 INFO L225 Difference]: With dead ends: 198 [2024-11-19 06:45:48,031 INFO L226 Difference]: Without dead ends: 198 [2024-11-19 06:45:48,031 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=13, Invalid=17, Unknown=0, NotChecked=0, Total=30 [2024-11-19 06:45:48,032 INFO L432 NwaCegarLoop]: 57 mSDtfsCounter, 64 mSDsluCounter, 144 mSDsCounter, 0 mSdLazyCounter, 81 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 64 SdHoareTripleChecker+Valid, 201 SdHoareTripleChecker+Invalid, 81 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 81 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-11-19 06:45:48,033 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [64 Valid, 201 Invalid, 81 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 81 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-11-19 06:45:48,035 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 198 states. [2024-11-19 06:45:48,051 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 198 to 176. [2024-11-19 06:45:48,055 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 176 states, 141 states have (on average 1.574468085106383) internal successors, (222), 158 states have internal predecessors, (222), 11 states have call successors, (11), 6 states have call predecessors, (11), 6 states have return successors, (34), 11 states have call predecessors, (34), 11 states have call successors, (34) [2024-11-19 06:45:48,058 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 176 states to 176 states and 267 transitions. [2024-11-19 06:45:48,058 INFO L78 Accepts]: Start accepts. Automaton has 176 states and 267 transitions. Word has length 8 [2024-11-19 06:45:48,058 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-19 06:45:48,058 INFO L471 AbstractCegarLoop]: Abstraction has 176 states and 267 transitions. [2024-11-19 06:45:48,062 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 4 states have (on average 1.75) internal successors, (7), 4 states have internal predecessors, (7), 1 states have call successors, (1), 1 states have call predecessors, (1), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-19 06:45:48,062 INFO L276 IsEmpty]: Start isEmpty. Operand 176 states and 267 transitions. [2024-11-19 06:45:48,063 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 10 [2024-11-19 06:45:48,063 INFO L207 NwaCegarLoop]: Found error trace [2024-11-19 06:45:48,063 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-19 06:45:48,063 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2024-11-19 06:45:48,063 INFO L396 AbstractCegarLoop]: === Iteration 5 === Targeting parse_inputErr4ASSERT_VIOLATIONMEMORY_DEREFERENCE === [parse_inputErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, parse_inputErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, parse_inputErr2ASSERT_VIOLATIONMEMORY_DEREFERENCE (and 17 more)] === [2024-11-19 06:45:48,064 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-19 06:45:48,064 INFO L85 PathProgramCache]: Analyzing trace with hash 1217330767, now seen corresponding path program 1 times [2024-11-19 06:45:48,064 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-19 06:45:48,064 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1989893088] [2024-11-19 06:45:48,064 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-19 06:45:48,064 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-19 06:45:48,077 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-19 06:45:48,157 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-19 06:45:48,158 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-19 06:45:48,158 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1989893088] [2024-11-19 06:45:48,158 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1989893088] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-19 06:45:48,158 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-19 06:45:48,159 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-11-19 06:45:48,159 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [934406384] [2024-11-19 06:45:48,159 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-19 06:45:48,159 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2024-11-19 06:45:48,159 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-19 06:45:48,160 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2024-11-19 06:45:48,160 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2024-11-19 06:45:48,160 INFO L87 Difference]: Start difference. First operand 176 states and 267 transitions. Second operand has 5 states, 4 states have (on average 2.0) internal successors, (8), 3 states have internal predecessors, (8), 1 states have call successors, (1), 1 states have call predecessors, (1), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-19 06:45:48,264 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-19 06:45:48,264 INFO L93 Difference]: Finished difference Result 256 states and 350 transitions. [2024-11-19 06:45:48,264 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-11-19 06:45:48,264 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 4 states have (on average 2.0) internal successors, (8), 3 states have internal predecessors, (8), 1 states have call successors, (1), 1 states have call predecessors, (1), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 9 [2024-11-19 06:45:48,265 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-19 06:45:48,266 INFO L225 Difference]: With dead ends: 256 [2024-11-19 06:45:48,266 INFO L226 Difference]: Without dead ends: 256 [2024-11-19 06:45:48,266 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=14, Invalid=16, Unknown=0, NotChecked=0, Total=30 [2024-11-19 06:45:48,267 INFO L432 NwaCegarLoop]: 51 mSDtfsCounter, 136 mSDsluCounter, 143 mSDsCounter, 0 mSdLazyCounter, 87 mSolverCounterSat, 4 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 136 SdHoareTripleChecker+Valid, 194 SdHoareTripleChecker+Invalid, 91 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 4 IncrementalHoareTripleChecker+Valid, 87 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-11-19 06:45:48,268 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [136 Valid, 194 Invalid, 91 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [4 Valid, 87 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-11-19 06:45:48,268 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 256 states. [2024-11-19 06:45:48,283 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 256 to 213. [2024-11-19 06:45:48,283 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 213 states, 176 states have (on average 1.5511363636363635) internal successors, (273), 194 states have internal predecessors, (273), 11 states have call successors, (11), 7 states have call predecessors, (11), 8 states have return successors, (34), 11 states have call predecessors, (34), 11 states have call successors, (34) [2024-11-19 06:45:48,285 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 213 states to 213 states and 318 transitions. [2024-11-19 06:45:48,285 INFO L78 Accepts]: Start accepts. Automaton has 213 states and 318 transitions. Word has length 9 [2024-11-19 06:45:48,285 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-19 06:45:48,286 INFO L471 AbstractCegarLoop]: Abstraction has 213 states and 318 transitions. [2024-11-19 06:45:48,286 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 4 states have (on average 2.0) internal successors, (8), 3 states have internal predecessors, (8), 1 states have call successors, (1), 1 states have call predecessors, (1), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-19 06:45:48,286 INFO L276 IsEmpty]: Start isEmpty. Operand 213 states and 318 transitions. [2024-11-19 06:45:48,286 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 11 [2024-11-19 06:45:48,286 INFO L207 NwaCegarLoop]: Found error trace [2024-11-19 06:45:48,286 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-19 06:45:48,286 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2024-11-19 06:45:48,287 INFO L396 AbstractCegarLoop]: === Iteration 6 === Targeting parse_inputErr5ASSERT_VIOLATIONMEMORY_DEREFERENCE === [parse_inputErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, parse_inputErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, parse_inputErr2ASSERT_VIOLATIONMEMORY_DEREFERENCE (and 17 more)] === [2024-11-19 06:45:48,287 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-19 06:45:48,287 INFO L85 PathProgramCache]: Analyzing trace with hash -917451838, now seen corresponding path program 1 times [2024-11-19 06:45:48,287 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-19 06:45:48,288 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2073654367] [2024-11-19 06:45:48,288 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-19 06:45:48,288 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-19 06:45:48,298 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-19 06:45:48,375 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-19 06:45:48,376 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-19 06:45:48,376 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2073654367] [2024-11-19 06:45:48,376 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2073654367] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-19 06:45:48,376 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-19 06:45:48,379 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-11-19 06:45:48,379 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [856203035] [2024-11-19 06:45:48,379 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-19 06:45:48,379 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2024-11-19 06:45:48,379 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-19 06:45:48,380 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2024-11-19 06:45:48,380 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2024-11-19 06:45:48,380 INFO L87 Difference]: Start difference. First operand 213 states and 318 transitions. Second operand has 5 states, 4 states have (on average 2.25) internal successors, (9), 3 states have internal predecessors, (9), 1 states have call successors, (1), 1 states have call predecessors, (1), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-19 06:45:48,479 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-19 06:45:48,480 INFO L93 Difference]: Finished difference Result 251 states and 333 transitions. [2024-11-19 06:45:48,480 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-11-19 06:45:48,480 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 4 states have (on average 2.25) internal successors, (9), 3 states have internal predecessors, (9), 1 states have call successors, (1), 1 states have call predecessors, (1), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 10 [2024-11-19 06:45:48,481 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-19 06:45:48,482 INFO L225 Difference]: With dead ends: 251 [2024-11-19 06:45:48,482 INFO L226 Difference]: Without dead ends: 251 [2024-11-19 06:45:48,483 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=13, Invalid=17, Unknown=0, NotChecked=0, Total=30 [2024-11-19 06:45:48,484 INFO L432 NwaCegarLoop]: 56 mSDtfsCounter, 163 mSDsluCounter, 139 mSDsCounter, 0 mSdLazyCounter, 67 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 163 SdHoareTripleChecker+Valid, 195 SdHoareTripleChecker+Invalid, 68 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 67 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-11-19 06:45:48,485 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [163 Valid, 195 Invalid, 68 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 67 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-11-19 06:45:48,486 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 251 states. [2024-11-19 06:45:48,496 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 251 to 223. [2024-11-19 06:45:48,497 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 223 states, 185 states have (on average 1.545945945945946) internal successors, (286), 204 states have internal predecessors, (286), 11 states have call successors, (11), 7 states have call predecessors, (11), 9 states have return successors, (34), 11 states have call predecessors, (34), 11 states have call successors, (34) [2024-11-19 06:45:48,502 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 223 states to 223 states and 331 transitions. [2024-11-19 06:45:48,503 INFO L78 Accepts]: Start accepts. Automaton has 223 states and 331 transitions. Word has length 10 [2024-11-19 06:45:48,503 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-19 06:45:48,503 INFO L471 AbstractCegarLoop]: Abstraction has 223 states and 331 transitions. [2024-11-19 06:45:48,503 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 4 states have (on average 2.25) internal successors, (9), 3 states have internal predecessors, (9), 1 states have call successors, (1), 1 states have call predecessors, (1), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-19 06:45:48,503 INFO L276 IsEmpty]: Start isEmpty. Operand 223 states and 331 transitions. [2024-11-19 06:45:48,504 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 15 [2024-11-19 06:45:48,504 INFO L207 NwaCegarLoop]: Found error trace [2024-11-19 06:45:48,504 INFO L215 NwaCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-19 06:45:48,504 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2024-11-19 06:45:48,504 INFO L396 AbstractCegarLoop]: === Iteration 7 === Targeting parse_inputErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [parse_inputErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, parse_inputErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, parse_inputErr2ASSERT_VIOLATIONMEMORY_DEREFERENCE (and 17 more)] === [2024-11-19 06:45:48,505 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-19 06:45:48,506 INFO L85 PathProgramCache]: Analyzing trace with hash -657083128, now seen corresponding path program 1 times [2024-11-19 06:45:48,506 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-19 06:45:48,507 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [518677785] [2024-11-19 06:45:48,507 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-19 06:45:48,507 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-19 06:45:48,520 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-19 06:45:48,672 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-19 06:45:48,673 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-19 06:45:48,673 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [518677785] [2024-11-19 06:45:48,673 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [518677785] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-19 06:45:48,673 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [2092116566] [2024-11-19 06:45:48,674 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-19 06:45:48,674 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-19 06:45:48,674 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-19 06:45:48,676 INFO L229 MonitoredProcess]: Starting monitored process 2 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-11-19 06:45:48,678 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Waiting until timeout for monitored process [2024-11-19 06:45:48,748 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-19 06:45:48,750 INFO L255 TraceCheckSpWp]: Trace formula consists of 138 conjuncts, 12 conjuncts are in the unsatisfiable core [2024-11-19 06:45:48,754 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-19 06:45:48,964 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-19 06:45:48,964 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-11-19 06:45:49,117 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-19 06:45:49,118 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [2092116566] provided 0 perfect and 2 imperfect interpolant sequences [2024-11-19 06:45:49,118 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2024-11-19 06:45:49,118 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [5, 3, 3] total 11 [2024-11-19 06:45:49,118 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1152681541] [2024-11-19 06:45:49,118 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2024-11-19 06:45:49,119 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 13 states [2024-11-19 06:45:49,119 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-19 06:45:49,120 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2024-11-19 06:45:49,120 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=40, Invalid=116, Unknown=0, NotChecked=0, Total=156 [2024-11-19 06:45:49,120 INFO L87 Difference]: Start difference. First operand 223 states and 331 transitions. Second operand has 13 states, 12 states have (on average 3.25) internal successors, (39), 11 states have internal predecessors, (39), 3 states have call successors, (3), 3 states have call predecessors, (3), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-19 06:45:49,354 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-19 06:45:49,354 INFO L93 Difference]: Finished difference Result 246 states and 330 transitions. [2024-11-19 06:45:49,355 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2024-11-19 06:45:49,355 INFO L78 Accepts]: Start accepts. Automaton has has 13 states, 12 states have (on average 3.25) internal successors, (39), 11 states have internal predecessors, (39), 3 states have call successors, (3), 3 states have call predecessors, (3), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 14 [2024-11-19 06:45:49,355 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-19 06:45:49,357 INFO L225 Difference]: With dead ends: 246 [2024-11-19 06:45:49,357 INFO L226 Difference]: Without dead ends: 246 [2024-11-19 06:45:49,357 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 34 GetRequests, 20 SyntacticMatches, 0 SemanticMatches, 14 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 33 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=68, Invalid=172, Unknown=0, NotChecked=0, Total=240 [2024-11-19 06:45:49,358 INFO L432 NwaCegarLoop]: 67 mSDtfsCounter, 238 mSDsluCounter, 420 mSDsCounter, 0 mSdLazyCounter, 232 mSolverCounterSat, 17 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 238 SdHoareTripleChecker+Valid, 487 SdHoareTripleChecker+Invalid, 249 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 17 IncrementalHoareTripleChecker+Valid, 232 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2024-11-19 06:45:49,359 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [238 Valid, 487 Invalid, 249 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [17 Valid, 232 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2024-11-19 06:45:49,359 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 246 states. [2024-11-19 06:45:49,366 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 246 to 226. [2024-11-19 06:45:49,367 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 226 states, 188 states have (on average 1.4893617021276595) internal successors, (280), 207 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-11-19 06:45:49,370 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 226 states to 226 states and 325 transitions. [2024-11-19 06:45:49,370 INFO L78 Accepts]: Start accepts. Automaton has 226 states and 325 transitions. Word has length 14 [2024-11-19 06:45:49,370 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-19 06:45:49,370 INFO L471 AbstractCegarLoop]: Abstraction has 226 states and 325 transitions. [2024-11-19 06:45:49,371 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 13 states, 12 states have (on average 3.25) internal successors, (39), 11 states have internal predecessors, (39), 3 states have call successors, (3), 3 states have call predecessors, (3), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-19 06:45:49,371 INFO L276 IsEmpty]: Start isEmpty. Operand 226 states and 325 transitions. [2024-11-19 06:45:49,371 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 16 [2024-11-19 06:45:49,372 INFO L207 NwaCegarLoop]: Found error trace [2024-11-19 06:45:49,372 INFO L215 NwaCegarLoop]: trace histogram [2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-19 06:45:49,390 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Ended with exit code 0 [2024-11-19 06:45:49,576 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6,2 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-19 06:45:49,577 INFO L396 AbstractCegarLoop]: === Iteration 8 === Targeting parse_inputErr2ASSERT_VIOLATIONMEMORY_DEREFERENCE === [parse_inputErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, parse_inputErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, parse_inputErr2ASSERT_VIOLATIONMEMORY_DEREFERENCE (and 17 more)] === [2024-11-19 06:45:49,578 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-19 06:45:49,578 INFO L85 PathProgramCache]: Analyzing trace with hash 1105259462, now seen corresponding path program 1 times [2024-11-19 06:45:49,578 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-19 06:45:49,578 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [357093095] [2024-11-19 06:45:49,578 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-19 06:45:49,579 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-19 06:45:49,595 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-19 06:45:49,725 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-19 06:45:49,726 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-19 06:45:49,726 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [357093095] [2024-11-19 06:45:49,726 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [357093095] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-19 06:45:49,726 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1556153859] [2024-11-19 06:45:49,727 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-19 06:45:49,727 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-19 06:45:49,727 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-19 06:45:49,729 INFO L229 MonitoredProcess]: Starting monitored process 3 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-11-19 06:45:49,730 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Waiting until timeout for monitored process [2024-11-19 06:45:49,793 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-19 06:45:49,795 INFO L255 TraceCheckSpWp]: Trace formula consists of 146 conjuncts, 15 conjuncts are in the unsatisfiable core [2024-11-19 06:45:49,796 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-19 06:45:49,965 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-19 06:45:49,965 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-11-19 06:45:50,037 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-19 06:45:50,037 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1556153859] provided 0 perfect and 2 imperfect interpolant sequences [2024-11-19 06:45:50,037 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2024-11-19 06:45:50,038 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [5, 4, 4] total 12 [2024-11-19 06:45:50,038 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1446054119] [2024-11-19 06:45:50,038 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2024-11-19 06:45:50,038 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 14 states [2024-11-19 06:45:50,038 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-19 06:45:50,039 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 14 interpolants. [2024-11-19 06:45:50,039 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=47, Invalid=135, Unknown=0, NotChecked=0, Total=182 [2024-11-19 06:45:50,039 INFO L87 Difference]: Start difference. First operand 226 states and 325 transitions. Second operand has 14 states, 13 states have (on average 3.1538461538461537) internal successors, (41), 13 states have internal predecessors, (41), 3 states have call successors, (3), 3 states have call predecessors, (3), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-19 06:45:50,320 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-19 06:45:50,321 INFO L93 Difference]: Finished difference Result 264 states and 360 transitions. [2024-11-19 06:45:50,321 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2024-11-19 06:45:50,321 INFO L78 Accepts]: Start accepts. Automaton has has 14 states, 13 states have (on average 3.1538461538461537) internal successors, (41), 13 states have internal predecessors, (41), 3 states have call successors, (3), 3 states have call predecessors, (3), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 15 [2024-11-19 06:45:50,322 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-19 06:45:50,323 INFO L225 Difference]: With dead ends: 264 [2024-11-19 06:45:50,323 INFO L226 Difference]: Without dead ends: 264 [2024-11-19 06:45:50,323 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 37 GetRequests, 22 SyntacticMatches, 0 SemanticMatches, 15 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 46 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=75, Invalid=197, Unknown=0, NotChecked=0, Total=272 [2024-11-19 06:45:50,324 INFO L432 NwaCegarLoop]: 54 mSDtfsCounter, 142 mSDsluCounter, 285 mSDsCounter, 0 mSdLazyCounter, 344 mSolverCounterSat, 18 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 142 SdHoareTripleChecker+Valid, 339 SdHoareTripleChecker+Invalid, 362 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 18 IncrementalHoareTripleChecker+Valid, 344 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2024-11-19 06:45:50,324 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [142 Valid, 339 Invalid, 362 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [18 Valid, 344 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2024-11-19 06:45:50,325 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 264 states. [2024-11-19 06:45:50,330 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 264 to 234. [2024-11-19 06:45:50,330 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 234 states, 196 states have (on average 1.4846938775510203) internal successors, (291), 215 states have internal predecessors, (291), 11 states have call successors, (11), 7 states have call predecessors, (11), 9 states have return successors, (34), 11 states have call predecessors, (34), 11 states have call successors, (34) [2024-11-19 06:45:50,336 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 234 states to 234 states and 336 transitions. [2024-11-19 06:45:50,337 INFO L78 Accepts]: Start accepts. Automaton has 234 states and 336 transitions. Word has length 15 [2024-11-19 06:45:50,337 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-19 06:45:50,337 INFO L471 AbstractCegarLoop]: Abstraction has 234 states and 336 transitions. [2024-11-19 06:45:50,337 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 14 states, 13 states have (on average 3.1538461538461537) internal successors, (41), 13 states have internal predecessors, (41), 3 states have call successors, (3), 3 states have call predecessors, (3), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-19 06:45:50,338 INFO L276 IsEmpty]: Start isEmpty. Operand 234 states and 336 transitions. [2024-11-19 06:45:50,338 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 17 [2024-11-19 06:45:50,338 INFO L207 NwaCegarLoop]: Found error trace [2024-11-19 06:45:50,338 INFO L215 NwaCegarLoop]: trace histogram [2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-19 06:45:50,357 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Ended with exit code 0 [2024-11-19 06:45:50,539 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 3 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable7 [2024-11-19 06:45:50,540 INFO L396 AbstractCegarLoop]: === Iteration 9 === Targeting parse_inputErr3ASSERT_VIOLATIONMEMORY_DEREFERENCE === [parse_inputErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, parse_inputErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, parse_inputErr2ASSERT_VIOLATIONMEMORY_DEREFERENCE (and 17 more)] === [2024-11-19 06:45:50,540 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-19 06:45:50,541 INFO L85 PathProgramCache]: Analyzing trace with hash -96695001, now seen corresponding path program 1 times [2024-11-19 06:45:50,541 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-19 06:45:50,541 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1487621093] [2024-11-19 06:45:50,541 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-19 06:45:50,541 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-19 06:45:50,555 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-19 06:45:50,769 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 4 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-19 06:45:50,770 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-19 06:45:50,770 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1487621093] [2024-11-19 06:45:50,770 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1487621093] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-19 06:45:50,770 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1742433017] [2024-11-19 06:45:50,770 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-19 06:45:50,771 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-19 06:45:50,771 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-19 06:45:50,773 INFO L229 MonitoredProcess]: Starting monitored process 4 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-11-19 06:45:50,774 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Waiting until timeout for monitored process [2024-11-19 06:45:50,836 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-19 06:45:50,838 INFO L255 TraceCheckSpWp]: Trace formula consists of 148 conjuncts, 18 conjuncts are in the unsatisfiable core [2024-11-19 06:45:50,840 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-19 06:45:51,065 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 4 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-19 06:45:51,065 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-11-19 06:45:51,198 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 4 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-19 06:45:51,199 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1742433017] provided 0 perfect and 2 imperfect interpolant sequences [2024-11-19 06:45:51,199 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2024-11-19 06:45:51,199 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [5, 4, 4] total 13 [2024-11-19 06:45:51,199 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2128528701] [2024-11-19 06:45:51,199 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2024-11-19 06:45:51,200 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 15 states [2024-11-19 06:45:51,200 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-19 06:45:51,201 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 15 interpolants. [2024-11-19 06:45:51,201 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=44, Invalid=166, Unknown=0, NotChecked=0, Total=210 [2024-11-19 06:45:51,201 INFO L87 Difference]: Start difference. First operand 234 states and 336 transitions. Second operand has 15 states, 14 states have (on average 3.2142857142857144) internal successors, (45), 14 states have internal predecessors, (45), 3 states have call successors, (3), 3 states have call predecessors, (3), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-19 06:45:51,655 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-19 06:45:51,656 INFO L93 Difference]: Finished difference Result 394 states and 540 transitions. [2024-11-19 06:45:51,656 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2024-11-19 06:45:51,656 INFO L78 Accepts]: Start accepts. Automaton has has 15 states, 14 states have (on average 3.2142857142857144) internal successors, (45), 14 states have internal predecessors, (45), 3 states have call successors, (3), 3 states have call predecessors, (3), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 16 [2024-11-19 06:45:51,657 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-19 06:45:51,659 INFO L225 Difference]: With dead ends: 394 [2024-11-19 06:45:51,659 INFO L226 Difference]: Without dead ends: 394 [2024-11-19 06:45:51,659 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 44 GetRequests, 23 SyntacticMatches, 0 SemanticMatches, 21 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 77 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=113, Invalid=393, Unknown=0, NotChecked=0, Total=506 [2024-11-19 06:45:51,660 INFO L432 NwaCegarLoop]: 61 mSDtfsCounter, 259 mSDsluCounter, 430 mSDsCounter, 0 mSdLazyCounter, 364 mSolverCounterSat, 14 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 259 SdHoareTripleChecker+Valid, 491 SdHoareTripleChecker+Invalid, 378 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 14 IncrementalHoareTripleChecker+Valid, 364 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2024-11-19 06:45:51,660 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [259 Valid, 491 Invalid, 378 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [14 Valid, 364 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2024-11-19 06:45:51,661 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 394 states. [2024-11-19 06:45:51,668 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 394 to 332. [2024-11-19 06:45:51,669 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 332 states, 288 states have (on average 1.5243055555555556) internal successors, (439), 307 states have internal predecessors, (439), 14 states have call successors, (14), 10 states have call predecessors, (14), 12 states have return successors, (50), 14 states have call predecessors, (50), 14 states have call successors, (50) [2024-11-19 06:45:51,671 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 332 states to 332 states and 503 transitions. [2024-11-19 06:45:51,671 INFO L78 Accepts]: Start accepts. Automaton has 332 states and 503 transitions. Word has length 16 [2024-11-19 06:45:51,671 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-19 06:45:51,671 INFO L471 AbstractCegarLoop]: Abstraction has 332 states and 503 transitions. [2024-11-19 06:45:51,672 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 15 states, 14 states have (on average 3.2142857142857144) internal successors, (45), 14 states have internal predecessors, (45), 3 states have call successors, (3), 3 states have call predecessors, (3), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-19 06:45:51,672 INFO L276 IsEmpty]: Start isEmpty. Operand 332 states and 503 transitions. [2024-11-19 06:45:51,672 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 19 [2024-11-19 06:45:51,672 INFO L207 NwaCegarLoop]: Found error trace [2024-11-19 06:45:51,673 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-19 06:45:51,689 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Ended with exit code 0 [2024-11-19 06:45:51,873 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8,4 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-19 06:45:51,875 INFO L396 AbstractCegarLoop]: === Iteration 10 === Targeting parse_inputErr10ASSERT_VIOLATIONMEMORY_FREE === [parse_inputErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, parse_inputErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, parse_inputErr2ASSERT_VIOLATIONMEMORY_DEREFERENCE (and 17 more)] === [2024-11-19 06:45:51,875 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-19 06:45:51,876 INFO L85 PathProgramCache]: Analyzing trace with hash -1930496503, now seen corresponding path program 1 times [2024-11-19 06:45:51,876 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-19 06:45:51,876 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2054885776] [2024-11-19 06:45:51,876 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-19 06:45:51,876 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-19 06:45:51,885 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-19 06:45:51,939 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-19 06:45:51,940 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-19 06:45:51,940 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2054885776] [2024-11-19 06:45:51,940 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2054885776] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-19 06:45:51,940 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-19 06:45:51,940 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-11-19 06:45:51,941 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1239598345] [2024-11-19 06:45:51,941 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-19 06:45:51,941 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-19 06:45:51,941 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-19 06:45:51,942 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-19 06:45:51,942 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-19 06:45:51,942 INFO L87 Difference]: Start difference. First operand 332 states and 503 transitions. Second operand has 3 states, 3 states have (on average 5.666666666666667) internal successors, (17), 2 states have internal predecessors, (17), 1 states have call successors, (1), 1 states have call predecessors, (1), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-19 06:45:51,964 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-19 06:45:51,965 INFO L93 Difference]: Finished difference Result 344 states and 490 transitions. [2024-11-19 06:45:51,965 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-19 06:45:51,966 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 5.666666666666667) internal successors, (17), 2 states have internal predecessors, (17), 1 states have call successors, (1), 1 states have call predecessors, (1), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 18 [2024-11-19 06:45:51,966 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-19 06:45:51,967 INFO L225 Difference]: With dead ends: 344 [2024-11-19 06:45:51,968 INFO L226 Difference]: Without dead ends: 344 [2024-11-19 06:45:51,968 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-19 06:45:51,968 INFO L432 NwaCegarLoop]: 67 mSDtfsCounter, 27 mSDsluCounter, 47 mSDsCounter, 0 mSdLazyCounter, 18 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 27 SdHoareTripleChecker+Valid, 114 SdHoareTripleChecker+Invalid, 20 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 18 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-11-19 06:45:51,969 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [27 Valid, 114 Invalid, 20 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 18 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-11-19 06:45:51,969 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 344 states. [2024-11-19 06:45:51,976 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 344 to 335. [2024-11-19 06:45:51,977 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 335 states, 294 states have (on average 1.510204081632653) internal successors, (444), 315 states have internal predecessors, (444), 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-11-19 06:45:51,979 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 335 states to 335 states and 488 transitions. [2024-11-19 06:45:51,979 INFO L78 Accepts]: Start accepts. Automaton has 335 states and 488 transitions. Word has length 18 [2024-11-19 06:45:51,979 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-19 06:45:51,979 INFO L471 AbstractCegarLoop]: Abstraction has 335 states and 488 transitions. [2024-11-19 06:45:51,979 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 5.666666666666667) internal successors, (17), 2 states have internal predecessors, (17), 1 states have call successors, (1), 1 states have call predecessors, (1), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-19 06:45:51,980 INFO L276 IsEmpty]: Start isEmpty. Operand 335 states and 488 transitions. [2024-11-19 06:45:51,980 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2024-11-19 06:45:51,980 INFO L207 NwaCegarLoop]: Found error trace [2024-11-19 06:45:51,980 INFO L215 NwaCegarLoop]: trace histogram [2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-19 06:45:51,981 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9 [2024-11-19 06:45:51,981 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-11-19 06:45:51,981 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-19 06:45:51,981 INFO L85 PathProgramCache]: Analyzing trace with hash -487174678, now seen corresponding path program 1 times [2024-11-19 06:45:51,982 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-19 06:45:51,982 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1343202342] [2024-11-19 06:45:51,982 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-19 06:45:51,982 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-19 06:45:51,991 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-19 06:45:52,007 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 3 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-19 06:45:52,008 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-19 06:45:52,008 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1343202342] [2024-11-19 06:45:52,008 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1343202342] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-19 06:45:52,008 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-19 06:45:52,008 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-11-19 06:45:52,008 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1562769360] [2024-11-19 06:45:52,008 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-19 06:45:52,009 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-19 06:45:52,009 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-19 06:45:52,010 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-19 06:45:52,010 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-19 06:45:52,010 INFO L87 Difference]: Start difference. First operand 335 states and 488 transitions. Second operand has 3 states, 3 states have (on average 7.333333333333333) internal successors, (22), 3 states have internal predecessors, (22), 2 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2024-11-19 06:45:52,016 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-19 06:45:52,016 INFO L93 Difference]: Finished difference Result 259 states and 364 transitions. [2024-11-19 06:45:52,016 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-19 06:45:52,017 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 7.333333333333333) internal successors, (22), 3 states have internal predecessors, (22), 2 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 25 [2024-11-19 06:45:52,017 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-19 06:45:52,018 INFO L225 Difference]: With dead ends: 259 [2024-11-19 06:45:52,018 INFO L226 Difference]: Without dead ends: 259 [2024-11-19 06:45:52,018 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-19 06:45:52,019 INFO L432 NwaCegarLoop]: 63 mSDtfsCounter, 9 mSDsluCounter, 53 mSDsCounter, 0 mSdLazyCounter, 4 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 9 SdHoareTripleChecker+Valid, 116 SdHoareTripleChecker+Invalid, 4 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 4 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-11-19 06:45:52,019 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [9 Valid, 116 Invalid, 4 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 4 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-11-19 06:45:52,020 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 259 states. [2024-11-19 06:45:52,024 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 259 to 259. [2024-11-19 06:45:52,024 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 259 states, 224 states have (on average 1.4910714285714286) internal successors, (334), 244 states have internal predecessors, (334), 8 states have call successors, (8), 6 states have call predecessors, (8), 9 states have return successors, (22), 8 states have call predecessors, (22), 8 states have call successors, (22) [2024-11-19 06:45:52,029 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 259 states to 259 states and 364 transitions. [2024-11-19 06:45:52,029 INFO L78 Accepts]: Start accepts. Automaton has 259 states and 364 transitions. Word has length 25 [2024-11-19 06:45:52,034 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-19 06:45:52,034 INFO L471 AbstractCegarLoop]: Abstraction has 259 states and 364 transitions. [2024-11-19 06:45:52,034 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 7.333333333333333) internal successors, (22), 3 states have internal predecessors, (22), 2 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2024-11-19 06:45:52,034 INFO L276 IsEmpty]: Start isEmpty. Operand 259 states and 364 transitions. [2024-11-19 06:45:52,035 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 28 [2024-11-19 06:45:52,035 INFO L207 NwaCegarLoop]: Found error trace [2024-11-19 06:45:52,035 INFO L215 NwaCegarLoop]: trace histogram [2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-19 06:45:52,035 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10 [2024-11-19 06:45:52,035 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-11-19 06:45:52,036 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-19 06:45:52,036 INFO L85 PathProgramCache]: Analyzing trace with hash 1487790830, now seen corresponding path program 1 times [2024-11-19 06:45:52,036 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-19 06:45:52,036 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [200637612] [2024-11-19 06:45:52,036 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-19 06:45:52,036 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-19 06:45:52,052 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-19 06:45:52,296 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-19 06:45:52,297 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-19 06:45:52,297 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [200637612] [2024-11-19 06:45:52,297 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [200637612] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-19 06:45:52,297 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [299079621] [2024-11-19 06:45:52,297 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-19 06:45:52,297 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-19 06:45:52,297 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-19 06:45:52,299 INFO L229 MonitoredProcess]: Starting monitored process 5 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-11-19 06:45:52,300 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Waiting until timeout for monitored process [2024-11-19 06:45:52,379 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-19 06:45:52,385 INFO L255 TraceCheckSpWp]: Trace formula consists of 210 conjuncts, 19 conjuncts are in the unsatisfiable core [2024-11-19 06:45:52,387 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-19 06:45:52,667 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-11-19 06:45:52,675 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 14 treesize of output 9 [2024-11-19 06:45:52,737 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-19 06:45:52,738 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-11-19 06:45:52,898 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [299079621] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-19 06:45:52,899 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2024-11-19 06:45:52,899 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 5] total 12 [2024-11-19 06:45:52,899 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [226400970] [2024-11-19 06:45:52,899 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2024-11-19 06:45:52,899 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 14 states [2024-11-19 06:45:52,899 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-19 06:45:52,900 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 14 interpolants. [2024-11-19 06:45:52,901 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=51, Invalid=221, Unknown=0, NotChecked=0, Total=272 [2024-11-19 06:45:52,901 INFO L87 Difference]: Start difference. First operand 259 states and 364 transitions. Second operand has 14 states, 13 states have (on average 3.6923076923076925) internal successors, (48), 11 states have internal predecessors, (48), 3 states have call successors, (4), 4 states have call predecessors, (4), 2 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2024-11-19 06:45:53,335 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-19 06:45:53,335 INFO L93 Difference]: Finished difference Result 290 states and 387 transitions. [2024-11-19 06:45:53,335 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2024-11-19 06:45:53,336 INFO L78 Accepts]: Start accepts. Automaton has has 14 states, 13 states have (on average 3.6923076923076925) internal successors, (48), 11 states have internal predecessors, (48), 3 states have call successors, (4), 4 states have call predecessors, (4), 2 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) Word has length 27 [2024-11-19 06:45:53,336 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-19 06:45:53,337 INFO L225 Difference]: With dead ends: 290 [2024-11-19 06:45:53,337 INFO L226 Difference]: Without dead ends: 290 [2024-11-19 06:45:53,338 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 49 GetRequests, 24 SyntacticMatches, 0 SemanticMatches, 25 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 93 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=181, Invalid=521, Unknown=0, NotChecked=0, Total=702 [2024-11-19 06:45:53,338 INFO L432 NwaCegarLoop]: 38 mSDtfsCounter, 292 mSDsluCounter, 149 mSDsCounter, 0 mSdLazyCounter, 231 mSolverCounterSat, 35 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 292 SdHoareTripleChecker+Valid, 187 SdHoareTripleChecker+Invalid, 266 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 35 IncrementalHoareTripleChecker+Valid, 231 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2024-11-19 06:45:53,338 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [292 Valid, 187 Invalid, 266 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [35 Valid, 231 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2024-11-19 06:45:53,339 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 290 states. [2024-11-19 06:45:53,344 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 290 to 280. [2024-11-19 06:45:53,344 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 280 states, 241 states have (on average 1.4439834024896265) internal successors, (348), 265 states have internal predecessors, (348), 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-11-19 06:45:53,346 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 280 states to 280 states and 382 transitions. [2024-11-19 06:45:53,346 INFO L78 Accepts]: Start accepts. Automaton has 280 states and 382 transitions. Word has length 27 [2024-11-19 06:45:53,346 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-19 06:45:53,346 INFO L471 AbstractCegarLoop]: Abstraction has 280 states and 382 transitions. [2024-11-19 06:45:53,346 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 14 states, 13 states have (on average 3.6923076923076925) internal successors, (48), 11 states have internal predecessors, (48), 3 states have call successors, (4), 4 states have call predecessors, (4), 2 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2024-11-19 06:45:53,346 INFO L276 IsEmpty]: Start isEmpty. Operand 280 states and 382 transitions. [2024-11-19 06:45:53,347 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 29 [2024-11-19 06:45:53,347 INFO L207 NwaCegarLoop]: Found error trace [2024-11-19 06:45:53,347 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-11-19 06:45:53,365 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Ended with exit code 0 [2024-11-19 06:45:53,551 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable11,5 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-19 06:45:53,552 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-11-19 06:45:53,552 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-19 06:45:53,552 INFO L85 PathProgramCache]: Analyzing trace with hash -692402736, now seen corresponding path program 1 times [2024-11-19 06:45:53,552 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-19 06:45:53,552 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1721690067] [2024-11-19 06:45:53,552 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-19 06:45:53,553 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-19 06:45:53,561 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-19 06:45:53,690 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 0 proven. 6 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-19 06:45:53,691 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-19 06:45:53,691 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1721690067] [2024-11-19 06:45:53,691 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1721690067] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-19 06:45:53,691 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1333318712] [2024-11-19 06:45:53,691 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-19 06:45:53,691 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-19 06:45:53,692 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-19 06:45:53,693 INFO L229 MonitoredProcess]: Starting monitored process 6 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-11-19 06:45:53,695 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (6)] Waiting until timeout for monitored process [2024-11-19 06:45:53,767 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-19 06:45:53,768 INFO L255 TraceCheckSpWp]: Trace formula consists of 207 conjuncts, 12 conjuncts are in the unsatisfiable core [2024-11-19 06:45:53,770 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-19 06:45:53,907 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 6 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-19 06:45:53,908 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-11-19 06:45:53,908 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1333318712] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-19 06:45:53,908 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2024-11-19 06:45:53,909 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [4] total 9 [2024-11-19 06:45:53,909 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1385833807] [2024-11-19 06:45:53,909 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-19 06:45:53,909 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2024-11-19 06:45:53,909 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-19 06:45:53,910 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2024-11-19 06:45:53,910 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=22, Invalid=68, Unknown=0, NotChecked=0, Total=90 [2024-11-19 06:45:53,911 INFO L87 Difference]: Start difference. First operand 280 states and 382 transitions. Second operand has 6 states, 6 states have (on average 4.166666666666667) internal successors, (25), 5 states have internal predecessors, (25), 2 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2024-11-19 06:45:53,977 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-19 06:45:53,977 INFO L93 Difference]: Finished difference Result 299 states and 397 transitions. [2024-11-19 06:45:53,978 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2024-11-19 06:45:53,978 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 4.166666666666667) internal successors, (25), 5 states have internal predecessors, (25), 2 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 28 [2024-11-19 06:45:53,978 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-19 06:45:53,980 INFO L225 Difference]: With dead ends: 299 [2024-11-19 06:45:53,980 INFO L226 Difference]: Without dead ends: 299 [2024-11-19 06:45:53,980 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 32 GetRequests, 24 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 8 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=22, Invalid=68, Unknown=0, NotChecked=0, Total=90 [2024-11-19 06:45:53,980 INFO L432 NwaCegarLoop]: 54 mSDtfsCounter, 76 mSDsluCounter, 135 mSDsCounter, 0 mSdLazyCounter, 69 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 76 SdHoareTripleChecker+Valid, 189 SdHoareTripleChecker+Invalid, 69 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 69 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-11-19 06:45:53,981 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [76 Valid, 189 Invalid, 69 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 69 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-11-19 06:45:53,981 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 299 states. [2024-11-19 06:45:53,990 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 299 to 288. [2024-11-19 06:45:53,992 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 288 states, 249 states have (on average 1.429718875502008) internal successors, (356), 273 states have internal predecessors, (356), 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-11-19 06:45:53,993 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 288 states to 288 states and 390 transitions. [2024-11-19 06:45:53,994 INFO L78 Accepts]: Start accepts. Automaton has 288 states and 390 transitions. Word has length 28 [2024-11-19 06:45:53,994 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-19 06:45:53,994 INFO L471 AbstractCegarLoop]: Abstraction has 288 states and 390 transitions. [2024-11-19 06:45:53,994 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 4.166666666666667) internal successors, (25), 5 states have internal predecessors, (25), 2 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2024-11-19 06:45:53,994 INFO L276 IsEmpty]: Start isEmpty. Operand 288 states and 390 transitions. [2024-11-19 06:45:53,996 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 30 [2024-11-19 06:45:53,996 INFO L207 NwaCegarLoop]: Found error trace [2024-11-19 06:45:53,996 INFO L215 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-19 06:45:54,015 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (6)] Ended with exit code 0 [2024-11-19 06:45:54,196 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 6 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable12 [2024-11-19 06:45:54,197 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-11-19 06:45:54,197 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-19 06:45:54,197 INFO L85 PathProgramCache]: Analyzing trace with hash -457123443, now seen corresponding path program 1 times [2024-11-19 06:45:54,198 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-19 06:45:54,198 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [884240220] [2024-11-19 06:45:54,198 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-19 06:45:54,198 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-19 06:45:54,214 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-19 06:45:54,608 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 3 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-19 06:45:54,608 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-19 06:45:54,608 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [884240220] [2024-11-19 06:45:54,608 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [884240220] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-19 06:45:54,608 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [769080532] [2024-11-19 06:45:54,608 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-19 06:45:54,608 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-19 06:45:54,609 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-19 06:45:54,611 INFO L229 MonitoredProcess]: Starting monitored process 7 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-11-19 06:45:54,627 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (7)] Waiting until timeout for monitored process [2024-11-19 06:45:54,698 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-19 06:45:54,700 INFO L255 TraceCheckSpWp]: Trace formula consists of 220 conjuncts, 25 conjuncts are in the unsatisfiable core [2024-11-19 06:45:54,702 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-19 06:45:55,033 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-11-19 06:45:55,034 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 14 treesize of output 9 [2024-11-19 06:45:55,139 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 0 proven. 5 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-19 06:45:55,140 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-11-19 06:45:55,284 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [769080532] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-19 06:45:55,284 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2024-11-19 06:45:55,285 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [11, 6] total 17 [2024-11-19 06:45:55,285 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [936921281] [2024-11-19 06:45:55,285 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2024-11-19 06:45:55,285 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 18 states [2024-11-19 06:45:55,285 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-19 06:45:55,286 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 18 interpolants. [2024-11-19 06:45:55,286 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=78, Invalid=342, Unknown=0, NotChecked=0, Total=420 [2024-11-19 06:45:55,287 INFO L87 Difference]: Start difference. First operand 288 states and 390 transitions. Second operand has 18 states, 17 states have (on average 3.0588235294117645) internal successors, (52), 15 states have internal predecessors, (52), 4 states have call successors, (4), 4 states have call predecessors, (4), 2 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2024-11-19 06:45:55,692 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-19 06:45:55,692 INFO L93 Difference]: Finished difference Result 295 states and 389 transitions. [2024-11-19 06:45:55,692 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2024-11-19 06:45:55,692 INFO L78 Accepts]: Start accepts. Automaton has has 18 states, 17 states have (on average 3.0588235294117645) internal successors, (52), 15 states have internal predecessors, (52), 4 states have call successors, (4), 4 states have call predecessors, (4), 2 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) Word has length 29 [2024-11-19 06:45:55,693 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-19 06:45:55,694 INFO L225 Difference]: With dead ends: 295 [2024-11-19 06:45:55,694 INFO L226 Difference]: Without dead ends: 295 [2024-11-19 06:45:55,694 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 56 GetRequests, 29 SyntacticMatches, 0 SemanticMatches, 27 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 175 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=192, Invalid=620, Unknown=0, NotChecked=0, Total=812 [2024-11-19 06:45:55,695 INFO L432 NwaCegarLoop]: 40 mSDtfsCounter, 255 mSDsluCounter, 128 mSDsCounter, 0 mSdLazyCounter, 200 mSolverCounterSat, 38 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 255 SdHoareTripleChecker+Valid, 168 SdHoareTripleChecker+Invalid, 238 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 38 IncrementalHoareTripleChecker+Valid, 200 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2024-11-19 06:45:55,695 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [255 Valid, 168 Invalid, 238 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [38 Valid, 200 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2024-11-19 06:45:55,696 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 295 states. [2024-11-19 06:45:55,704 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 295 to 288. [2024-11-19 06:45:55,705 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 288 states, 249 states have (on average 1.4136546184738956) internal successors, (352), 273 states have internal predecessors, (352), 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-11-19 06:45:55,706 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 288 states to 288 states and 386 transitions. [2024-11-19 06:45:55,706 INFO L78 Accepts]: Start accepts. Automaton has 288 states and 386 transitions. Word has length 29 [2024-11-19 06:45:55,707 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-19 06:45:55,708 INFO L471 AbstractCegarLoop]: Abstraction has 288 states and 386 transitions. [2024-11-19 06:45:55,708 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 18 states, 17 states have (on average 3.0588235294117645) internal successors, (52), 15 states have internal predecessors, (52), 4 states have call successors, (4), 4 states have call predecessors, (4), 2 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2024-11-19 06:45:55,708 INFO L276 IsEmpty]: Start isEmpty. Operand 288 states and 386 transitions. [2024-11-19 06:45:55,710 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 31 [2024-11-19 06:45:55,710 INFO L207 NwaCegarLoop]: Found error trace [2024-11-19 06:45:55,710 INFO L215 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-19 06:45:55,729 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (7)] Forceful destruction successful, exit code 0 [2024-11-19 06:45:55,911 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable13,7 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-19 06:45:55,912 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-11-19 06:45:55,913 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-19 06:45:55,913 INFO L85 PathProgramCache]: Analyzing trace with hash -1285924798, now seen corresponding path program 1 times [2024-11-19 06:45:55,913 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-19 06:45:55,913 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1511226308] [2024-11-19 06:45:55,913 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-19 06:45:55,913 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-19 06:45:55,924 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-19 06:45:56,076 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 0 proven. 6 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-19 06:45:56,077 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-19 06:45:56,077 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1511226308] [2024-11-19 06:45:56,077 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1511226308] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-19 06:45:56,077 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [432650040] [2024-11-19 06:45:56,077 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-19 06:45:56,077 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-19 06:45:56,077 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-19 06:45:56,079 INFO L229 MonitoredProcess]: Starting monitored process 8 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-11-19 06:45:56,082 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (8)] Waiting until timeout for monitored process [2024-11-19 06:45:56,152 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-19 06:45:56,154 INFO L255 TraceCheckSpWp]: Trace formula consists of 222 conjuncts, 14 conjuncts are in the unsatisfiable core [2024-11-19 06:45:56,155 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-19 06:45:56,254 INFO L349 Elim1Store]: treesize reduction 20, result has 33.3 percent of original size [2024-11-19 06:45:56,255 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 2 case distinctions, treesize of input 19 treesize of output 16 [2024-11-19 06:45:56,301 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 0 proven. 6 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-19 06:45:56,301 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-11-19 06:45:56,344 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [432650040] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-19 06:45:56,344 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2024-11-19 06:45:56,344 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [6, 5] total 10 [2024-11-19 06:45:56,345 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1963376826] [2024-11-19 06:45:56,345 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2024-11-19 06:45:56,345 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 12 states [2024-11-19 06:45:56,345 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-19 06:45:56,346 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2024-11-19 06:45:56,346 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=37, Invalid=119, Unknown=0, NotChecked=0, Total=156 [2024-11-19 06:45:56,346 INFO L87 Difference]: Start difference. First operand 288 states and 386 transitions. Second operand has 12 states, 11 states have (on average 4.7272727272727275) internal successors, (52), 9 states have internal predecessors, (52), 1 states have call successors, (4), 4 states have call predecessors, (4), 2 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) [2024-11-19 06:45:56,670 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-19 06:45:56,670 INFO L93 Difference]: Finished difference Result 415 states and 517 transitions. [2024-11-19 06:45:56,670 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2024-11-19 06:45:56,671 INFO L78 Accepts]: Start accepts. Automaton has has 12 states, 11 states have (on average 4.7272727272727275) internal successors, (52), 9 states have internal predecessors, (52), 1 states have call successors, (4), 4 states have call predecessors, (4), 2 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) Word has length 30 [2024-11-19 06:45:56,671 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-19 06:45:56,672 INFO L225 Difference]: With dead ends: 415 [2024-11-19 06:45:56,672 INFO L226 Difference]: Without dead ends: 415 [2024-11-19 06:45:56,674 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 53 GetRequests, 33 SyntacticMatches, 0 SemanticMatches, 20 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 65 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=127, Invalid=335, Unknown=0, NotChecked=0, Total=462 [2024-11-19 06:45:56,674 INFO L432 NwaCegarLoop]: 73 mSDtfsCounter, 433 mSDsluCounter, 287 mSDsCounter, 0 mSdLazyCounter, 267 mSolverCounterSat, 19 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 433 SdHoareTripleChecker+Valid, 360 SdHoareTripleChecker+Invalid, 286 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 19 IncrementalHoareTripleChecker+Valid, 267 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2024-11-19 06:45:56,675 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [433 Valid, 360 Invalid, 286 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [19 Valid, 267 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2024-11-19 06:45:56,676 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 415 states. [2024-11-19 06:45:56,682 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 415 to 370. [2024-11-19 06:45:56,682 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 370 states, 328 states have (on average 1.3689024390243902) internal successors, (449), 353 states have internal predecessors, (449), 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-11-19 06:45:56,684 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 370 states to 370 states and 482 transitions. [2024-11-19 06:45:56,684 INFO L78 Accepts]: Start accepts. Automaton has 370 states and 482 transitions. Word has length 30 [2024-11-19 06:45:56,684 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-19 06:45:56,684 INFO L471 AbstractCegarLoop]: Abstraction has 370 states and 482 transitions. [2024-11-19 06:45:56,684 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 12 states, 11 states have (on average 4.7272727272727275) internal successors, (52), 9 states have internal predecessors, (52), 1 states have call successors, (4), 4 states have call predecessors, (4), 2 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) [2024-11-19 06:45:56,684 INFO L276 IsEmpty]: Start isEmpty. Operand 370 states and 482 transitions. [2024-11-19 06:45:56,685 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 32 [2024-11-19 06:45:56,685 INFO L207 NwaCegarLoop]: Found error trace [2024-11-19 06:45:56,685 INFO L215 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-19 06:45:56,702 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (8)] Ended with exit code 0 [2024-11-19 06:45:56,885 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable14,8 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-19 06:45:56,885 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-11-19 06:45:56,886 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-19 06:45:56,886 INFO L85 PathProgramCache]: Analyzing trace with hash -1208963025, now seen corresponding path program 1 times [2024-11-19 06:45:56,886 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-19 06:45:56,886 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2044242645] [2024-11-19 06:45:56,886 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-19 06:45:56,886 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-19 06:45:56,903 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-19 06:45:57,075 INFO L134 CoverageAnalysis]: Checked inductivity of 7 backedges. 0 proven. 7 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-19 06:45:57,075 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-19 06:45:57,075 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2044242645] [2024-11-19 06:45:57,075 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2044242645] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-19 06:45:57,075 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [532455404] [2024-11-19 06:45:57,075 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-19 06:45:57,075 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-19 06:45:57,076 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-19 06:45:57,077 INFO L229 MonitoredProcess]: Starting monitored process 9 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-11-19 06:45:57,079 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (9)] Waiting until timeout for monitored process [2024-11-19 06:45:57,153 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-19 06:45:57,155 INFO L255 TraceCheckSpWp]: Trace formula consists of 224 conjuncts, 21 conjuncts are in the unsatisfiable core [2024-11-19 06:45:57,157 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-19 06:45:57,323 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-11-19 06:45:57,324 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 14 treesize of output 9 [2024-11-19 06:45:57,403 INFO L134 CoverageAnalysis]: Checked inductivity of 7 backedges. 0 proven. 7 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-19 06:45:57,405 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-11-19 06:45:57,533 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [532455404] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-19 06:45:57,533 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2024-11-19 06:45:57,533 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 6] total 13 [2024-11-19 06:45:57,533 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1092681555] [2024-11-19 06:45:57,533 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2024-11-19 06:45:57,534 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 15 states [2024-11-19 06:45:57,534 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-19 06:45:57,534 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 15 interpolants. [2024-11-19 06:45:57,535 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=63, Invalid=279, Unknown=0, NotChecked=0, Total=342 [2024-11-19 06:45:57,535 INFO L87 Difference]: Start difference. First operand 370 states and 482 transitions. Second operand has 15 states, 12 states have (on average 4.666666666666667) internal successors, (56), 10 states have internal predecessors, (56), 4 states have call successors, (4), 4 states have call predecessors, (4), 2 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2024-11-19 06:45:58,111 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-19 06:45:58,111 INFO L93 Difference]: Finished difference Result 436 states and 532 transitions. [2024-11-19 06:45:58,111 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 20 states. [2024-11-19 06:45:58,111 INFO L78 Accepts]: Start accepts. Automaton has has 15 states, 12 states have (on average 4.666666666666667) internal successors, (56), 10 states have internal predecessors, (56), 4 states have call successors, (4), 4 states have call predecessors, (4), 2 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) Word has length 31 [2024-11-19 06:45:58,112 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-19 06:45:58,113 INFO L225 Difference]: With dead ends: 436 [2024-11-19 06:45:58,113 INFO L226 Difference]: Without dead ends: 436 [2024-11-19 06:45:58,114 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 61 GetRequests, 29 SyntacticMatches, 0 SemanticMatches, 32 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 202 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=279, Invalid=843, Unknown=0, NotChecked=0, Total=1122 [2024-11-19 06:45:58,114 INFO L432 NwaCegarLoop]: 60 mSDtfsCounter, 558 mSDsluCounter, 332 mSDsCounter, 0 mSdLazyCounter, 352 mSolverCounterSat, 35 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 558 SdHoareTripleChecker+Valid, 392 SdHoareTripleChecker+Invalid, 387 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 35 IncrementalHoareTripleChecker+Valid, 352 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2024-11-19 06:45:58,114 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [558 Valid, 392 Invalid, 387 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [35 Valid, 352 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2024-11-19 06:45:58,116 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 436 states. [2024-11-19 06:45:58,122 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 436 to 386. [2024-11-19 06:45:58,122 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 386 states, 343 states have (on average 1.3760932944606414) internal successors, (472), 369 states have internal predecessors, (472), 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-11-19 06:45:58,124 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 386 states to 386 states and 501 transitions. [2024-11-19 06:45:58,124 INFO L78 Accepts]: Start accepts. Automaton has 386 states and 501 transitions. Word has length 31 [2024-11-19 06:45:58,124 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-19 06:45:58,124 INFO L471 AbstractCegarLoop]: Abstraction has 386 states and 501 transitions. [2024-11-19 06:45:58,124 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 15 states, 12 states have (on average 4.666666666666667) internal successors, (56), 10 states have internal predecessors, (56), 4 states have call successors, (4), 4 states have call predecessors, (4), 2 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2024-11-19 06:45:58,125 INFO L276 IsEmpty]: Start isEmpty. Operand 386 states and 501 transitions. [2024-11-19 06:45:58,126 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 36 [2024-11-19 06:45:58,126 INFO L207 NwaCegarLoop]: Found error trace [2024-11-19 06:45:58,126 INFO L215 NwaCegarLoop]: trace histogram [3, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-19 06:45:58,144 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (9)] Forceful destruction successful, exit code 0 [2024-11-19 06:45:58,327 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 9 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable15 [2024-11-19 06:45:58,327 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-11-19 06:45:58,328 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-19 06:45:58,328 INFO L85 PathProgramCache]: Analyzing trace with hash -219964683, now seen corresponding path program 1 times [2024-11-19 06:45:58,328 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-19 06:45:58,328 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1041693362] [2024-11-19 06:45:58,328 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-19 06:45:58,328 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-19 06:45:58,342 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-19 06:45:58,559 INFO L134 CoverageAnalysis]: Checked inductivity of 12 backedges. 0 proven. 12 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-19 06:45:58,560 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-19 06:45:58,560 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1041693362] [2024-11-19 06:45:58,560 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1041693362] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-19 06:45:58,560 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [370820489] [2024-11-19 06:45:58,560 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-19 06:45:58,561 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-19 06:45:58,561 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-19 06:45:58,562 INFO L229 MonitoredProcess]: Starting monitored process 10 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-11-19 06:45:58,563 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (10)] Waiting until timeout for monitored process [2024-11-19 06:45:58,654 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-19 06:45:58,655 INFO L255 TraceCheckSpWp]: Trace formula consists of 230 conjuncts, 21 conjuncts are in the unsatisfiable core [2024-11-19 06:45:58,658 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-19 06:45:58,887 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-11-19 06:45:58,888 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 14 treesize of output 9 [2024-11-19 06:45:59,012 INFO L134 CoverageAnalysis]: Checked inductivity of 12 backedges. 0 proven. 12 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-19 06:45:59,013 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-11-19 06:45:59,182 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [370820489] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-19 06:45:59,183 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2024-11-19 06:45:59,183 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [9, 6] total 15 [2024-11-19 06:45:59,183 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [996937765] [2024-11-19 06:45:59,183 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2024-11-19 06:45:59,184 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 17 states [2024-11-19 06:45:59,184 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-19 06:45:59,184 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 17 interpolants. [2024-11-19 06:45:59,185 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=65, Invalid=355, Unknown=0, NotChecked=0, Total=420 [2024-11-19 06:45:59,185 INFO L87 Difference]: Start difference. First operand 386 states and 501 transitions. Second operand has 17 states, 16 states have (on average 4.0) internal successors, (64), 14 states have internal predecessors, (64), 3 states have call successors, (4), 4 states have call predecessors, (4), 2 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2024-11-19 06:45:59,693 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-19 06:45:59,693 INFO L93 Difference]: Finished difference Result 403 states and 501 transitions. [2024-11-19 06:45:59,694 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2024-11-19 06:45:59,694 INFO L78 Accepts]: Start accepts. Automaton has has 17 states, 16 states have (on average 4.0) internal successors, (64), 14 states have internal predecessors, (64), 3 states have call successors, (4), 4 states have call predecessors, (4), 2 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) Word has length 35 [2024-11-19 06:45:59,694 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-19 06:45:59,696 INFO L225 Difference]: With dead ends: 403 [2024-11-19 06:45:59,696 INFO L226 Difference]: Without dead ends: 403 [2024-11-19 06:45:59,697 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 69 GetRequests, 38 SyntacticMatches, 0 SemanticMatches, 31 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 147 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=235, Invalid=821, Unknown=0, NotChecked=0, Total=1056 [2024-11-19 06:45:59,697 INFO L432 NwaCegarLoop]: 41 mSDtfsCounter, 371 mSDsluCounter, 250 mSDsCounter, 0 mSdLazyCounter, 363 mSolverCounterSat, 58 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 371 SdHoareTripleChecker+Valid, 291 SdHoareTripleChecker+Invalid, 421 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 58 IncrementalHoareTripleChecker+Valid, 363 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2024-11-19 06:45:59,698 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [371 Valid, 291 Invalid, 421 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [58 Valid, 363 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2024-11-19 06:45:59,698 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 403 states. [2024-11-19 06:45:59,704 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 403 to 385. [2024-11-19 06:45:59,705 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 385 states, 345 states have (on average 1.318840579710145) internal successors, (455), 368 states have internal predecessors, (455), 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-11-19 06:45:59,706 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 385 states to 385 states and 484 transitions. [2024-11-19 06:45:59,706 INFO L78 Accepts]: Start accepts. Automaton has 385 states and 484 transitions. Word has length 35 [2024-11-19 06:45:59,706 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-19 06:45:59,706 INFO L471 AbstractCegarLoop]: Abstraction has 385 states and 484 transitions. [2024-11-19 06:45:59,707 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 17 states, 16 states have (on average 4.0) internal successors, (64), 14 states have internal predecessors, (64), 3 states have call successors, (4), 4 states have call predecessors, (4), 2 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2024-11-19 06:45:59,707 INFO L276 IsEmpty]: Start isEmpty. Operand 385 states and 484 transitions. [2024-11-19 06:45:59,707 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 41 [2024-11-19 06:45:59,707 INFO L207 NwaCegarLoop]: Found error trace [2024-11-19 06:45:59,707 INFO L215 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-19 06:45:59,726 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (10)] Ended with exit code 0 [2024-11-19 06:45:59,907 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 10 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable16 [2024-11-19 06:45:59,908 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-11-19 06:45:59,908 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-19 06:45:59,908 INFO L85 PathProgramCache]: Analyzing trace with hash -1858113804, now seen corresponding path program 1 times [2024-11-19 06:45:59,908 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-19 06:45:59,909 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1988998961] [2024-11-19 06:45:59,909 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-19 06:45:59,909 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-19 06:45:59,919 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-19 06:45:59,958 INFO L134 CoverageAnalysis]: Checked inductivity of 15 backedges. 13 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-19 06:45:59,959 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-19 06:45:59,959 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1988998961] [2024-11-19 06:45:59,959 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1988998961] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-19 06:45:59,959 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1559632597] [2024-11-19 06:45:59,959 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-19 06:45:59,959 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-19 06:45:59,960 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-19 06:45:59,961 INFO L229 MonitoredProcess]: Starting monitored process 11 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-11-19 06:45:59,963 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (11)] Waiting until timeout for monitored process [2024-11-19 06:46:00,045 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-19 06:46:00,047 INFO L255 TraceCheckSpWp]: Trace formula consists of 262 conjuncts, 9 conjuncts are in the unsatisfiable core [2024-11-19 06:46:00,048 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-19 06:46:00,075 INFO L134 CoverageAnalysis]: Checked inductivity of 15 backedges. 13 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-19 06:46:00,075 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-11-19 06:46:00,109 INFO L134 CoverageAnalysis]: Checked inductivity of 15 backedges. 13 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-19 06:46:00,109 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1559632597] provided 0 perfect and 2 imperfect interpolant sequences [2024-11-19 06:46:00,109 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2024-11-19 06:46:00,109 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [3, 3, 3] total 3 [2024-11-19 06:46:00,109 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1313930990] [2024-11-19 06:46:00,109 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2024-11-19 06:46:00,110 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-11-19 06:46:00,110 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-19 06:46:00,110 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-11-19 06:46:00,110 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-11-19 06:46:00,110 INFO L87 Difference]: Start difference. First operand 385 states and 484 transitions. Second operand has 4 states, 3 states have (on average 12.333333333333334) internal successors, (37), 4 states have internal predecessors, (37), 2 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2024-11-19 06:46:00,125 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-19 06:46:00,125 INFO L93 Difference]: Finished difference Result 383 states and 478 transitions. [2024-11-19 06:46:00,128 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-11-19 06:46:00,129 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 3 states have (on average 12.333333333333334) internal successors, (37), 4 states have internal predecessors, (37), 2 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 40 [2024-11-19 06:46:00,129 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-19 06:46:00,130 INFO L225 Difference]: With dead ends: 383 [2024-11-19 06:46:00,130 INFO L226 Difference]: Without dead ends: 383 [2024-11-19 06:46:00,131 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 83 GetRequests, 80 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2024-11-19 06:46:00,131 INFO L432 NwaCegarLoop]: 52 mSDtfsCounter, 44 mSDsluCounter, 46 mSDsCounter, 0 mSdLazyCounter, 13 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 44 SdHoareTripleChecker+Valid, 98 SdHoareTripleChecker+Invalid, 15 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 13 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-11-19 06:46:00,131 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [44 Valid, 98 Invalid, 15 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 13 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-11-19 06:46:00,132 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 383 states. [2024-11-19 06:46:00,153 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 383 to 383. [2024-11-19 06:46:00,154 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 383 states, 345 states have (on average 1.3014492753623188) internal successors, (449), 366 states have internal predecessors, (449), 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-11-19 06:46:00,155 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 383 states to 383 states and 478 transitions. [2024-11-19 06:46:00,156 INFO L78 Accepts]: Start accepts. Automaton has 383 states and 478 transitions. Word has length 40 [2024-11-19 06:46:00,156 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-19 06:46:00,156 INFO L471 AbstractCegarLoop]: Abstraction has 383 states and 478 transitions. [2024-11-19 06:46:00,156 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 3 states have (on average 12.333333333333334) internal successors, (37), 4 states have internal predecessors, (37), 2 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2024-11-19 06:46:00,156 INFO L276 IsEmpty]: Start isEmpty. Operand 383 states and 478 transitions. [2024-11-19 06:46:00,157 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 42 [2024-11-19 06:46:00,157 INFO L207 NwaCegarLoop]: Found error trace [2024-11-19 06:46:00,157 INFO L215 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-19 06:46:00,176 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (11)] Ended with exit code 0 [2024-11-19 06:46:00,358 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 11 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable17 [2024-11-19 06:46:00,359 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-11-19 06:46:00,359 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-19 06:46:00,359 INFO L85 PathProgramCache]: Analyzing trace with hash -1766952978, now seen corresponding path program 1 times [2024-11-19 06:46:00,359 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-19 06:46:00,360 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [208542685] [2024-11-19 06:46:00,360 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-19 06:46:00,360 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-19 06:46:00,370 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-19 06:46:00,422 INFO L134 CoverageAnalysis]: Checked inductivity of 15 backedges. 13 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-19 06:46:00,422 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-19 06:46:00,422 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [208542685] [2024-11-19 06:46:00,422 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [208542685] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-19 06:46:00,423 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1613559344] [2024-11-19 06:46:00,423 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-19 06:46:00,423 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-19 06:46:00,423 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-19 06:46:00,425 INFO L229 MonitoredProcess]: Starting monitored process 12 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-11-19 06:46:00,426 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (12)] Waiting until timeout for monitored process [2024-11-19 06:46:00,505 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-19 06:46:00,506 INFO L255 TraceCheckSpWp]: Trace formula consists of 264 conjuncts, 5 conjuncts are in the unsatisfiable core [2024-11-19 06:46:00,508 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-19 06:46:00,557 INFO L134 CoverageAnalysis]: Checked inductivity of 15 backedges. 13 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-19 06:46:00,557 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-11-19 06:46:00,616 INFO L134 CoverageAnalysis]: Checked inductivity of 15 backedges. 13 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-19 06:46:00,616 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1613559344] provided 0 perfect and 2 imperfect interpolant sequences [2024-11-19 06:46:00,616 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2024-11-19 06:46:00,616 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [3, 3, 3] total 3 [2024-11-19 06:46:00,617 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1615238138] [2024-11-19 06:46:00,617 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2024-11-19 06:46:00,617 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-11-19 06:46:00,617 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-19 06:46:00,618 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-11-19 06:46:00,618 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-11-19 06:46:00,618 INFO L87 Difference]: Start difference. First operand 383 states and 478 transitions. Second operand has 4 states, 3 states have (on average 12.666666666666666) internal successors, (38), 4 states have internal predecessors, (38), 2 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2024-11-19 06:46:00,668 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-19 06:46:00,668 INFO L93 Difference]: Finished difference Result 381 states and 472 transitions. [2024-11-19 06:46:00,669 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-11-19 06:46:00,669 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 3 states have (on average 12.666666666666666) internal successors, (38), 4 states have internal predecessors, (38), 2 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 41 [2024-11-19 06:46:00,669 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-19 06:46:00,670 INFO L225 Difference]: With dead ends: 381 [2024-11-19 06:46:00,670 INFO L226 Difference]: Without dead ends: 381 [2024-11-19 06:46:00,671 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 85 GetRequests, 78 SyntacticMatches, 4 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2024-11-19 06:46:00,671 INFO L432 NwaCegarLoop]: 43 mSDtfsCounter, 40 mSDsluCounter, 34 mSDsCounter, 0 mSdLazyCounter, 31 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 40 SdHoareTripleChecker+Valid, 77 SdHoareTripleChecker+Invalid, 33 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 31 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-11-19 06:46:00,671 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [40 Valid, 77 Invalid, 33 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 31 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-11-19 06:46:00,672 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 381 states. [2024-11-19 06:46:00,677 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 381 to 381. [2024-11-19 06:46:00,678 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 381 states, 345 states have (on average 1.2840579710144928) internal successors, (443), 364 states have internal predecessors, (443), 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-11-19 06:46:00,679 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 381 states to 381 states and 472 transitions. [2024-11-19 06:46:00,680 INFO L78 Accepts]: Start accepts. Automaton has 381 states and 472 transitions. Word has length 41 [2024-11-19 06:46:00,680 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-19 06:46:00,680 INFO L471 AbstractCegarLoop]: Abstraction has 381 states and 472 transitions. [2024-11-19 06:46:00,680 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 3 states have (on average 12.666666666666666) internal successors, (38), 4 states have internal predecessors, (38), 2 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2024-11-19 06:46:00,680 INFO L276 IsEmpty]: Start isEmpty. Operand 381 states and 472 transitions. [2024-11-19 06:46:00,681 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 43 [2024-11-19 06:46:00,681 INFO L207 NwaCegarLoop]: Found error trace [2024-11-19 06:46:00,681 INFO L215 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-19 06:46:00,699 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (12)] Ended with exit code 0 [2024-11-19 06:46:00,881 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable18,12 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-19 06:46:00,882 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-11-19 06:46:00,882 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-19 06:46:00,882 INFO L85 PathProgramCache]: Analyzing trace with hash 1059032630, now seen corresponding path program 1 times [2024-11-19 06:46:00,882 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-19 06:46:00,882 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [632140081] [2024-11-19 06:46:00,882 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-19 06:46:00,882 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-19 06:46:00,894 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-19 06:46:01,006 INFO L134 CoverageAnalysis]: Checked inductivity of 15 backedges. 13 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-19 06:46:01,006 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-19 06:46:01,006 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [632140081] [2024-11-19 06:46:01,006 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [632140081] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-19 06:46:01,006 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [10090562] [2024-11-19 06:46:01,006 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-19 06:46:01,006 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-19 06:46:01,007 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-19 06:46:01,008 INFO L229 MonitoredProcess]: Starting monitored process 13 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-11-19 06:46:01,010 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (13)] Waiting until timeout for monitored process [2024-11-19 06:46:01,090 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-19 06:46:01,095 INFO L255 TraceCheckSpWp]: Trace formula consists of 266 conjuncts, 15 conjuncts are in the unsatisfiable core [2024-11-19 06:46:01,097 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-19 06:46:01,100 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2024-11-19 06:46:01,135 INFO L349 Elim1Store]: treesize reduction 15, result has 25.0 percent of original size [2024-11-19 06:46:01,136 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 12 treesize of output 14 [2024-11-19 06:46:01,150 INFO L134 CoverageAnalysis]: Checked inductivity of 15 backedges. 13 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-19 06:46:01,150 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-11-19 06:46:01,201 INFO L134 CoverageAnalysis]: Checked inductivity of 15 backedges. 13 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-19 06:46:01,201 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [10090562] provided 0 perfect and 2 imperfect interpolant sequences [2024-11-19 06:46:01,202 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2024-11-19 06:46:01,202 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [3, 3, 3] total 3 [2024-11-19 06:46:01,202 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1803456509] [2024-11-19 06:46:01,202 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2024-11-19 06:46:01,202 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-11-19 06:46:01,202 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-19 06:46:01,202 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-11-19 06:46:01,203 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-11-19 06:46:01,203 INFO L87 Difference]: Start difference. First operand 381 states and 472 transitions. Second operand has 4 states, 3 states have (on average 13.0) internal successors, (39), 4 states have internal predecessors, (39), 2 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2024-11-19 06:46:01,256 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-19 06:46:01,256 INFO L93 Difference]: Finished difference Result 409 states and 499 transitions. [2024-11-19 06:46:01,256 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-11-19 06:46:01,257 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 3 states have (on average 13.0) internal successors, (39), 4 states have internal predecessors, (39), 2 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 42 [2024-11-19 06:46:01,257 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-19 06:46:01,258 INFO L225 Difference]: With dead ends: 409 [2024-11-19 06:46:01,258 INFO L226 Difference]: Without dead ends: 409 [2024-11-19 06:46:01,259 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 89 GetRequests, 84 SyntacticMatches, 2 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2024-11-19 06:46:01,261 INFO L432 NwaCegarLoop]: 61 mSDtfsCounter, 32 mSDsluCounter, 75 mSDsCounter, 0 mSdLazyCounter, 78 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 32 SdHoareTripleChecker+Valid, 136 SdHoareTripleChecker+Invalid, 78 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 78 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-11-19 06:46:01,261 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [32 Valid, 136 Invalid, 78 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 78 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-11-19 06:46:01,262 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 409 states. [2024-11-19 06:46:01,271 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 409 to 381. [2024-11-19 06:46:01,272 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 381 states, 345 states have (on average 1.2782608695652173) internal successors, (441), 364 states have internal predecessors, (441), 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-11-19 06:46:01,273 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 381 states to 381 states and 470 transitions. [2024-11-19 06:46:01,274 INFO L78 Accepts]: Start accepts. Automaton has 381 states and 470 transitions. Word has length 42 [2024-11-19 06:46:01,274 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-19 06:46:01,274 INFO L471 AbstractCegarLoop]: Abstraction has 381 states and 470 transitions. [2024-11-19 06:46:01,274 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 3 states have (on average 13.0) internal successors, (39), 4 states have internal predecessors, (39), 2 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2024-11-19 06:46:01,274 INFO L276 IsEmpty]: Start isEmpty. Operand 381 states and 470 transitions. [2024-11-19 06:46:01,274 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 46 [2024-11-19 06:46:01,274 INFO L207 NwaCegarLoop]: Found error trace [2024-11-19 06:46:01,275 INFO L215 NwaCegarLoop]: trace histogram [4, 4, 4, 3, 3, 3, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-19 06:46:01,292 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (13)] Forceful destruction successful, exit code 0 [2024-11-19 06:46:01,478 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable19,13 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-19 06:46:01,479 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-11-19 06:46:01,479 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-19 06:46:01,479 INFO L85 PathProgramCache]: Analyzing trace with hash 1461274395, now seen corresponding path program 1 times [2024-11-19 06:46:01,479 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-19 06:46:01,479 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [697444612] [2024-11-19 06:46:01,479 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-19 06:46:01,479 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-19 06:46:01,492 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-19 06:46:01,550 INFO L134 CoverageAnalysis]: Checked inductivity of 35 backedges. 25 proven. 9 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2024-11-19 06:46:01,551 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-19 06:46:01,551 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [697444612] [2024-11-19 06:46:01,551 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [697444612] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-19 06:46:01,551 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1250079360] [2024-11-19 06:46:01,552 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-19 06:46:01,552 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-19 06:46:01,552 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-19 06:46:01,554 INFO L229 MonitoredProcess]: Starting monitored process 14 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-11-19 06:46:01,556 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (14)] Waiting until timeout for monitored process [2024-11-19 06:46:01,634 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-19 06:46:01,635 INFO L255 TraceCheckSpWp]: Trace formula consists of 260 conjuncts, 4 conjuncts are in the unsatisfiable core [2024-11-19 06:46:01,636 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-19 06:46:01,666 INFO L134 CoverageAnalysis]: Checked inductivity of 35 backedges. 34 proven. 0 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2024-11-19 06:46:01,666 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-11-19 06:46:01,666 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1250079360] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-19 06:46:01,666 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2024-11-19 06:46:01,666 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [5] total 6 [2024-11-19 06:46:01,667 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [995944309] [2024-11-19 06:46:01,667 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-19 06:46:01,667 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2024-11-19 06:46:01,667 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-19 06:46:01,668 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2024-11-19 06:46:01,668 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=17, Unknown=0, NotChecked=0, Total=30 [2024-11-19 06:46:01,668 INFO L87 Difference]: Start difference. First operand 381 states and 470 transitions. Second operand has 5 states, 5 states have (on average 8.4) internal successors, (42), 5 states have internal predecessors, (42), 1 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2024-11-19 06:46:01,688 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-19 06:46:01,688 INFO L93 Difference]: Finished difference Result 374 states and 449 transitions. [2024-11-19 06:46:01,689 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-11-19 06:46:01,689 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 8.4) internal successors, (42), 5 states have internal predecessors, (42), 1 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 45 [2024-11-19 06:46:01,689 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-19 06:46:01,690 INFO L225 Difference]: With dead ends: 374 [2024-11-19 06:46:01,690 INFO L226 Difference]: Without dead ends: 374 [2024-11-19 06:46:01,691 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 49 GetRequests, 45 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=13, Invalid=17, Unknown=0, NotChecked=0, Total=30 [2024-11-19 06:46:01,691 INFO L432 NwaCegarLoop]: 62 mSDtfsCounter, 15 mSDsluCounter, 97 mSDsCounter, 0 mSdLazyCounter, 27 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 15 SdHoareTripleChecker+Valid, 159 SdHoareTripleChecker+Invalid, 27 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 27 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-11-19 06:46:01,692 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [15 Valid, 159 Invalid, 27 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 27 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-11-19 06:46:01,692 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 374 states. [2024-11-19 06:46:01,697 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 374 to 372. [2024-11-19 06:46:01,697 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 372 states, 336 states have (on average 1.25) internal successors, (420), 355 states have internal predecessors, (420), 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-11-19 06:46:01,700 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 372 states to 372 states and 449 transitions. [2024-11-19 06:46:01,700 INFO L78 Accepts]: Start accepts. Automaton has 372 states and 449 transitions. Word has length 45 [2024-11-19 06:46:01,700 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-19 06:46:01,700 INFO L471 AbstractCegarLoop]: Abstraction has 372 states and 449 transitions. [2024-11-19 06:46:01,700 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 8.4) internal successors, (42), 5 states have internal predecessors, (42), 1 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2024-11-19 06:46:01,700 INFO L276 IsEmpty]: Start isEmpty. Operand 372 states and 449 transitions. [2024-11-19 06:46:01,701 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 48 [2024-11-19 06:46:01,701 INFO L207 NwaCegarLoop]: Found error trace [2024-11-19 06:46:01,701 INFO L215 NwaCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-19 06:46:01,718 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (14)] Ended with exit code 0 [2024-11-19 06:46:01,901 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 14 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable20 [2024-11-19 06:46:01,902 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-11-19 06:46:01,903 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-19 06:46:01,903 INFO L85 PathProgramCache]: Analyzing trace with hash 629474045, now seen corresponding path program 1 times [2024-11-19 06:46:01,903 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-19 06:46:01,903 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [880223060] [2024-11-19 06:46:01,903 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-19 06:46:01,903 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-19 06:46:01,914 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-19 06:46:01,943 INFO L134 CoverageAnalysis]: Checked inductivity of 27 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 27 trivial. 0 not checked. [2024-11-19 06:46:01,943 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-19 06:46:01,943 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [880223060] [2024-11-19 06:46:01,944 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [880223060] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-19 06:46:01,944 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-19 06:46:01,944 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-11-19 06:46:01,944 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [761572074] [2024-11-19 06:46:01,944 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-19 06:46:01,944 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-19 06:46:01,944 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-19 06:46:01,945 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-19 06:46:01,945 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-19 06:46:01,945 INFO L87 Difference]: Start difference. First operand 372 states and 449 transitions. Second operand has 3 states, 3 states have (on average 8.666666666666666) 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-11-19 06:46:01,949 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-19 06:46:01,950 INFO L93 Difference]: Finished difference Result 306 states and 356 transitions. [2024-11-19 06:46:01,950 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-19 06:46:01,951 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 8.666666666666666) 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 47 [2024-11-19 06:46:01,951 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-19 06:46:01,952 INFO L225 Difference]: With dead ends: 306 [2024-11-19 06:46:01,952 INFO L226 Difference]: Without dead ends: 306 [2024-11-19 06:46:01,952 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-19 06:46:01,953 INFO L432 NwaCegarLoop]: 46 mSDtfsCounter, 0 mSDsluCounter, 44 mSDsCounter, 0 mSdLazyCounter, 3 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 90 SdHoareTripleChecker+Invalid, 3 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 3 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-11-19 06:46:01,954 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 90 Invalid, 3 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 3 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-11-19 06:46:01,954 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 306 states. [2024-11-19 06:46:01,982 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 306 to 303. [2024-11-19 06:46:01,982 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 303 states, 277 states have (on average 1.2021660649819494) internal successors, (333), 288 states have internal predecessors, (333), 7 states have call successors, (7), 7 states have call predecessors, (7), 12 states have return successors, (13), 7 states have call predecessors, (13), 7 states have call successors, (13) [2024-11-19 06:46:01,984 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 303 states to 303 states and 353 transitions. [2024-11-19 06:46:01,984 INFO L78 Accepts]: Start accepts. Automaton has 303 states and 353 transitions. Word has length 47 [2024-11-19 06:46:01,984 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-19 06:46:01,984 INFO L471 AbstractCegarLoop]: Abstraction has 303 states and 353 transitions. [2024-11-19 06:46:01,984 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 8.666666666666666) 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-11-19 06:46:01,985 INFO L276 IsEmpty]: Start isEmpty. Operand 303 states and 353 transitions. [2024-11-19 06:46:01,985 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 52 [2024-11-19 06:46:01,985 INFO L207 NwaCegarLoop]: Found error trace [2024-11-19 06:46:01,985 INFO L215 NwaCegarLoop]: trace histogram [3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-19 06:46:01,985 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable21 [2024-11-19 06:46:01,986 INFO L396 AbstractCegarLoop]: === Iteration 23 === Targeting parse_inputErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [parse_inputErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, parse_inputErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, parse_inputErr2ASSERT_VIOLATIONMEMORY_DEREFERENCE (and 17 more)] === [2024-11-19 06:46:01,987 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-19 06:46:01,987 INFO L85 PathProgramCache]: Analyzing trace with hash 800966878, now seen corresponding path program 1 times [2024-11-19 06:46:01,987 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-19 06:46:01,987 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1794341379] [2024-11-19 06:46:01,988 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-19 06:46:01,988 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-19 06:46:02,002 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-19 06:46:02,210 INFO L134 CoverageAnalysis]: Checked inductivity of 26 backedges. 6 proven. 20 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-19 06:46:02,210 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-19 06:46:02,210 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1794341379] [2024-11-19 06:46:02,210 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1794341379] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-19 06:46:02,211 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [2058172699] [2024-11-19 06:46:02,211 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-19 06:46:02,211 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-19 06:46:02,211 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-19 06:46:02,213 INFO L229 MonitoredProcess]: Starting monitored process 15 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-11-19 06:46:02,215 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (15)] Waiting until timeout for monitored process [2024-11-19 06:46:02,297 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-19 06:46:02,303 INFO L255 TraceCheckSpWp]: Trace formula consists of 306 conjuncts, 23 conjuncts are in the unsatisfiable core [2024-11-19 06:46:02,305 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-19 06:46:02,428 INFO L349 Elim1Store]: treesize reduction 4, result has 50.0 percent of original size [2024-11-19 06:46:02,428 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 11 treesize of output 11 [2024-11-19 06:46:02,545 INFO L349 Elim1Store]: treesize reduction 20, result has 33.3 percent of original size [2024-11-19 06:46:02,546 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 2 case distinctions, treesize of input 19 treesize of output 16 [2024-11-19 06:46:02,586 INFO L349 Elim1Store]: treesize reduction 13, result has 40.9 percent of original size [2024-11-19 06:46:02,587 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 14 treesize of output 13 [2024-11-19 06:46:02,645 INFO L134 CoverageAnalysis]: Checked inductivity of 26 backedges. 0 proven. 26 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-19 06:46:02,646 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-11-19 06:46:02,690 INFO L349 Elim1Store]: treesize reduction 5, result has 37.5 percent of original size [2024-11-19 06:46:02,690 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 56 treesize of output 53 [2024-11-19 06:46:02,896 INFO L349 Elim1Store]: treesize reduction 5, result has 37.5 percent of original size [2024-11-19 06:46:02,897 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-11-19 06:46:03,086 INFO L134 CoverageAnalysis]: Checked inductivity of 26 backedges. 3 proven. 23 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-19 06:46:03,086 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [2058172699] provided 0 perfect and 2 imperfect interpolant sequences [2024-11-19 06:46:03,086 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2024-11-19 06:46:03,086 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [9, 8, 10] total 25 [2024-11-19 06:46:03,087 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [577837826] [2024-11-19 06:46:03,087 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2024-11-19 06:46:03,087 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 26 states [2024-11-19 06:46:03,087 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-19 06:46:03,088 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 26 interpolants. [2024-11-19 06:46:03,088 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=101, Invalid=549, Unknown=0, NotChecked=0, Total=650 [2024-11-19 06:46:03,088 INFO L87 Difference]: Start difference. First operand 303 states and 353 transitions. Second operand has 26 states, 24 states have (on average 5.625) internal successors, (135), 25 states have internal predecessors, (135), 6 states have call successors, (8), 8 states have call predecessors, (8), 6 states have return successors, (6), 4 states have call predecessors, (6), 5 states have call successors, (6) [2024-11-19 06:46:03,267 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-19 06:46:03,267 INFO L93 Difference]: Finished difference Result 308 states and 358 transitions. [2024-11-19 06:46:03,267 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2024-11-19 06:46:03,268 INFO L78 Accepts]: Start accepts. Automaton has has 26 states, 24 states have (on average 5.625) internal successors, (135), 25 states have internal predecessors, (135), 6 states have call successors, (8), 8 states have call predecessors, (8), 6 states have return successors, (6), 4 states have call predecessors, (6), 5 states have call successors, (6) Word has length 51 [2024-11-19 06:46:03,268 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-19 06:46:03,269 INFO L225 Difference]: With dead ends: 308 [2024-11-19 06:46:03,269 INFO L226 Difference]: Without dead ends: 308 [2024-11-19 06:46:03,269 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 117 GetRequests, 89 SyntacticMatches, 0 SemanticMatches, 28 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 136 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=181, Invalid=689, Unknown=0, NotChecked=0, Total=870 [2024-11-19 06:46:03,270 INFO L432 NwaCegarLoop]: 27 mSDtfsCounter, 294 mSDsluCounter, 134 mSDsCounter, 0 mSdLazyCounter, 188 mSolverCounterSat, 76 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 294 SdHoareTripleChecker+Valid, 161 SdHoareTripleChecker+Invalid, 264 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 76 IncrementalHoareTripleChecker+Valid, 188 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-11-19 06:46:03,270 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [294 Valid, 161 Invalid, 264 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [76 Valid, 188 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-11-19 06:46:03,270 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 308 states. [2024-11-19 06:46:03,274 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 308 to 302. [2024-11-19 06:46:03,275 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 302 states, 277 states have (on average 1.1985559566787003) internal successors, (332), 287 states have internal predecessors, (332), 7 states have call successors, (7), 7 states have call predecessors, (7), 12 states have return successors, (13), 7 states have call predecessors, (13), 7 states have call successors, (13) [2024-11-19 06:46:03,276 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 302 states to 302 states and 352 transitions. [2024-11-19 06:46:03,276 INFO L78 Accepts]: Start accepts. Automaton has 302 states and 352 transitions. Word has length 51 [2024-11-19 06:46:03,276 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-19 06:46:03,276 INFO L471 AbstractCegarLoop]: Abstraction has 302 states and 352 transitions. [2024-11-19 06:46:03,276 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 26 states, 24 states have (on average 5.625) internal successors, (135), 25 states have internal predecessors, (135), 6 states have call successors, (8), 8 states have call predecessors, (8), 6 states have return successors, (6), 4 states have call predecessors, (6), 5 states have call successors, (6) [2024-11-19 06:46:03,276 INFO L276 IsEmpty]: Start isEmpty. Operand 302 states and 352 transitions. [2024-11-19 06:46:03,277 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 52 [2024-11-19 06:46:03,277 INFO L207 NwaCegarLoop]: Found error trace [2024-11-19 06:46:03,277 INFO L215 NwaCegarLoop]: trace histogram [3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-19 06:46:03,295 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (15)] Ended with exit code 0 [2024-11-19 06:46:03,481 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable22,15 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-19 06:46:03,482 INFO L396 AbstractCegarLoop]: === Iteration 24 === Targeting parse_inputErr4ASSERT_VIOLATIONMEMORY_DEREFERENCE === [parse_inputErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, parse_inputErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, parse_inputErr2ASSERT_VIOLATIONMEMORY_DEREFERENCE (and 17 more)] === [2024-11-19 06:46:03,482 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-19 06:46:03,482 INFO L85 PathProgramCache]: Analyzing trace with hash -305163153, now seen corresponding path program 1 times [2024-11-19 06:46:03,482 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-19 06:46:03,482 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1216242992] [2024-11-19 06:46:03,482 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-19 06:46:03,482 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-19 06:46:03,499 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-19 06:46:03,562 INFO L134 CoverageAnalysis]: Checked inductivity of 32 backedges. 25 proven. 7 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-19 06:46:03,562 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-19 06:46:03,563 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1216242992] [2024-11-19 06:46:03,563 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1216242992] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-19 06:46:03,563 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1336076168] [2024-11-19 06:46:03,563 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-19 06:46:03,563 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-19 06:46:03,563 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-19 06:46:03,565 INFO L229 MonitoredProcess]: Starting monitored process 16 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-11-19 06:46:03,567 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (16)] Waiting until timeout for monitored process [2024-11-19 06:46:03,654 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-19 06:46:03,656 INFO L255 TraceCheckSpWp]: Trace formula consists of 314 conjuncts, 21 conjuncts are in the unsatisfiable core [2024-11-19 06:46:03,659 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-19 06:46:03,708 WARN L873 $PredicateComparison]: unable to prove that (exists ((|v_parse_input_c1_~x~0#1.base_77| Int)) (and (<= |v_parse_input_c1_~x~0#1.base_77| c_~global~0.base) (= |c_#valid| (store |c_old(#valid)| |v_parse_input_c1_~x~0#1.base_77| (select |c_#valid| |v_parse_input_c1_~x~0#1.base_77|))))) is different from true [2024-11-19 06:46:03,738 INFO L349 Elim1Store]: treesize reduction 13, result has 40.9 percent of original size [2024-11-19 06:46:03,739 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 14 treesize of output 13 [2024-11-19 06:46:03,908 INFO L349 Elim1Store]: treesize reduction 20, result has 33.3 percent of original size [2024-11-19 06:46:03,909 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 2 case distinctions, treesize of input 19 treesize of output 16 [2024-11-19 06:46:03,952 INFO L134 CoverageAnalysis]: Checked inductivity of 32 backedges. 13 proven. 15 refuted. 0 times theorem prover too weak. 0 trivial. 4 not checked. [2024-11-19 06:46:03,953 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-11-19 06:46:04,056 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1336076168] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-19 06:46:04,056 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2024-11-19 06:46:04,056 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [6, 10] total 16 [2024-11-19 06:46:04,056 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [216116884] [2024-11-19 06:46:04,056 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2024-11-19 06:46:04,057 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 16 states [2024-11-19 06:46:04,057 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-19 06:46:04,057 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 16 interpolants. [2024-11-19 06:46:04,057 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=49, Invalid=260, Unknown=1, NotChecked=32, Total=342 [2024-11-19 06:46:04,057 INFO L87 Difference]: Start difference. First operand 302 states and 352 transitions. Second operand has 16 states, 15 states have (on average 6.133333333333334) internal successors, (92), 14 states have internal predecessors, (92), 5 states have call successors, (6), 6 states have call predecessors, (6), 4 states have return successors, (4), 4 states have call predecessors, (4), 4 states have call successors, (4) [2024-11-19 06:46:04,712 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-19 06:46:04,712 INFO L93 Difference]: Finished difference Result 279 states and 310 transitions. [2024-11-19 06:46:04,713 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 23 states. [2024-11-19 06:46:04,713 INFO L78 Accepts]: Start accepts. Automaton has has 16 states, 15 states have (on average 6.133333333333334) internal successors, (92), 14 states have internal predecessors, (92), 5 states have call successors, (6), 6 states have call predecessors, (6), 4 states have return successors, (4), 4 states have call predecessors, (4), 4 states have call successors, (4) Word has length 51 [2024-11-19 06:46:04,713 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-19 06:46:04,714 INFO L225 Difference]: With dead ends: 279 [2024-11-19 06:46:04,714 INFO L226 Difference]: Without dead ends: 279 [2024-11-19 06:46:04,714 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 88 GetRequests, 52 SyntacticMatches, 0 SemanticMatches, 36 ConstructedPredicates, 1 IntricatePredicates, 0 DeprecatedPredicates, 207 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=282, Invalid=1053, Unknown=1, NotChecked=70, Total=1406 [2024-11-19 06:46:04,715 INFO L432 NwaCegarLoop]: 60 mSDtfsCounter, 343 mSDsluCounter, 381 mSDsCounter, 0 mSdLazyCounter, 404 mSolverCounterSat, 38 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 343 SdHoareTripleChecker+Valid, 441 SdHoareTripleChecker+Invalid, 614 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 38 IncrementalHoareTripleChecker+Valid, 404 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 172 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2024-11-19 06:46:04,715 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [343 Valid, 441 Invalid, 614 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [38 Valid, 404 Invalid, 0 Unknown, 172 Unchecked, 0.3s Time] [2024-11-19 06:46:04,716 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 279 states. [2024-11-19 06:46:04,721 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 279 to 262. [2024-11-19 06:46:04,722 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 262 states, 241 states have (on average 1.170124481327801) internal successors, (282), 249 states have internal predecessors, (282), 6 states have call successors, (6), 6 states have call predecessors, (6), 9 states have return successors, (9), 6 states have call predecessors, (9), 6 states have call successors, (9) [2024-11-19 06:46:04,723 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 262 states to 262 states and 297 transitions. [2024-11-19 06:46:04,723 INFO L78 Accepts]: Start accepts. Automaton has 262 states and 297 transitions. Word has length 51 [2024-11-19 06:46:04,723 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-19 06:46:04,723 INFO L471 AbstractCegarLoop]: Abstraction has 262 states and 297 transitions. [2024-11-19 06:46:04,724 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 16 states, 15 states have (on average 6.133333333333334) internal successors, (92), 14 states have internal predecessors, (92), 5 states have call successors, (6), 6 states have call predecessors, (6), 4 states have return successors, (4), 4 states have call predecessors, (4), 4 states have call successors, (4) [2024-11-19 06:46:04,724 INFO L276 IsEmpty]: Start isEmpty. Operand 262 states and 297 transitions. [2024-11-19 06:46:04,724 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 53 [2024-11-19 06:46:04,724 INFO L207 NwaCegarLoop]: Found error trace [2024-11-19 06:46:04,725 INFO L215 NwaCegarLoop]: trace histogram [3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-19 06:46:04,749 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (16)] Forceful destruction successful, exit code 0 [2024-11-19 06:46:04,925 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable23,16 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-19 06:46:04,926 INFO L396 AbstractCegarLoop]: === Iteration 25 === Targeting parse_inputErr2ASSERT_VIOLATIONMEMORY_DEREFERENCE === [parse_inputErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, parse_inputErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, parse_inputErr2ASSERT_VIOLATIONMEMORY_DEREFERENCE (and 17 more)] === [2024-11-19 06:46:04,926 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-19 06:46:04,926 INFO L85 PathProgramCache]: Analyzing trace with hash -939830577, now seen corresponding path program 1 times [2024-11-19 06:46:04,926 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-19 06:46:04,926 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1539961933] [2024-11-19 06:46:04,926 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-19 06:46:04,926 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-19 06:46:04,949 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-19 06:46:05,539 INFO L134 CoverageAnalysis]: Checked inductivity of 28 backedges. 0 proven. 28 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-19 06:46:05,539 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-19 06:46:05,539 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1539961933] [2024-11-19 06:46:05,539 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1539961933] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-19 06:46:05,539 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [531368777] [2024-11-19 06:46:05,539 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-19 06:46:05,539 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-19 06:46:05,539 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-19 06:46:05,540 INFO L229 MonitoredProcess]: Starting monitored process 17 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-11-19 06:46:05,542 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (17)] Waiting until timeout for monitored process [2024-11-19 06:46:05,626 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-19 06:46:05,627 INFO L255 TraceCheckSpWp]: Trace formula consists of 314 conjuncts, 33 conjuncts are in the unsatisfiable core [2024-11-19 06:46:05,630 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-19 06:46:05,802 INFO L349 Elim1Store]: treesize reduction 4, result has 50.0 percent of original size [2024-11-19 06:46:05,803 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 11 treesize of output 11 [2024-11-19 06:46:05,984 INFO L349 Elim1Store]: treesize reduction 20, result has 33.3 percent of original size [2024-11-19 06:46:05,984 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 2 case distinctions, treesize of input 19 treesize of output 16 [2024-11-19 06:46:06,040 INFO L349 Elim1Store]: treesize reduction 13, result has 40.9 percent of original size [2024-11-19 06:46:06,041 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 14 treesize of output 13 [2024-11-19 06:46:06,134 INFO L134 CoverageAnalysis]: Checked inductivity of 28 backedges. 0 proven. 28 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-19 06:46:06,135 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-11-19 06:46:06,207 INFO L349 Elim1Store]: treesize reduction 5, result has 58.3 percent of original size [2024-11-19 06:46:06,207 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 88 treesize of output 81 [2024-11-19 06:46:06,437 INFO L349 Elim1Store]: treesize reduction 5, result has 84.8 percent of original size [2024-11-19 06:46:06,438 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 3 select indices, 3 select index equivalence classes, 1 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 3 case distinctions, treesize of input 84 treesize of output 101 [2024-11-19 06:46:06,747 INFO L134 CoverageAnalysis]: Checked inductivity of 28 backedges. 1 proven. 27 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-19 06:46:06,748 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [531368777] provided 0 perfect and 2 imperfect interpolant sequences [2024-11-19 06:46:06,748 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2024-11-19 06:46:06,748 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [13, 12, 14] total 36 [2024-11-19 06:46:06,748 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [412975588] [2024-11-19 06:46:06,748 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2024-11-19 06:46:06,749 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 38 states [2024-11-19 06:46:06,749 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-19 06:46:06,749 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 38 interpolants. [2024-11-19 06:46:06,750 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=156, Invalid=1250, Unknown=0, NotChecked=0, Total=1406 [2024-11-19 06:46:06,750 INFO L87 Difference]: Start difference. First operand 262 states and 297 transitions. Second operand has 38 states, 34 states have (on average 4.0) internal successors, (136), 31 states have internal predecessors, (136), 6 states have call successors, (8), 8 states have call predecessors, (8), 6 states have return successors, (6), 5 states have call predecessors, (6), 5 states have call successors, (6) [2024-11-19 06:46:07,112 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-19 06:46:07,112 INFO L93 Difference]: Finished difference Result 272 states and 305 transitions. [2024-11-19 06:46:07,112 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2024-11-19 06:46:07,113 INFO L78 Accepts]: Start accepts. Automaton has has 38 states, 34 states have (on average 4.0) internal successors, (136), 31 states have internal predecessors, (136), 6 states have call successors, (8), 8 states have call predecessors, (8), 6 states have return successors, (6), 5 states have call predecessors, (6), 5 states have call successors, (6) Word has length 52 [2024-11-19 06:46:07,113 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-19 06:46:07,114 INFO L225 Difference]: With dead ends: 272 [2024-11-19 06:46:07,114 INFO L226 Difference]: Without dead ends: 272 [2024-11-19 06:46:07,114 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 123 GetRequests, 81 SyntacticMatches, 0 SemanticMatches, 42 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 383 ImplicationChecksByTransitivity, 0.7s TimeCoverageRelationStatistics Valid=314, Invalid=1578, Unknown=0, NotChecked=0, Total=1892 [2024-11-19 06:46:07,115 INFO L432 NwaCegarLoop]: 23 mSDtfsCounter, 369 mSDsluCounter, 184 mSDsCounter, 0 mSdLazyCounter, 394 mSolverCounterSat, 51 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 369 SdHoareTripleChecker+Valid, 207 SdHoareTripleChecker+Invalid, 445 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 51 IncrementalHoareTripleChecker+Valid, 394 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2024-11-19 06:46:07,115 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [369 Valid, 207 Invalid, 445 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [51 Valid, 394 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2024-11-19 06:46:07,116 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 272 states. [2024-11-19 06:46:07,119 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 272 to 262. [2024-11-19 06:46:07,120 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 262 states, 241 states have (on average 1.16597510373444) internal successors, (281), 249 states have internal predecessors, (281), 6 states have call successors, (6), 6 states have call predecessors, (6), 9 states have return successors, (9), 6 states have call predecessors, (9), 6 states have call successors, (9) [2024-11-19 06:46:07,120 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 262 states to 262 states and 296 transitions. [2024-11-19 06:46:07,121 INFO L78 Accepts]: Start accepts. Automaton has 262 states and 296 transitions. Word has length 52 [2024-11-19 06:46:07,121 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-19 06:46:07,121 INFO L471 AbstractCegarLoop]: Abstraction has 262 states and 296 transitions. [2024-11-19 06:46:07,121 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 38 states, 34 states have (on average 4.0) internal successors, (136), 31 states have internal predecessors, (136), 6 states have call successors, (8), 8 states have call predecessors, (8), 6 states have return successors, (6), 5 states have call predecessors, (6), 5 states have call successors, (6) [2024-11-19 06:46:07,121 INFO L276 IsEmpty]: Start isEmpty. Operand 262 states and 296 transitions. [2024-11-19 06:46:07,122 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 54 [2024-11-19 06:46:07,122 INFO L207 NwaCegarLoop]: Found error trace [2024-11-19 06:46:07,122 INFO L215 NwaCegarLoop]: trace histogram [4, 4, 4, 4, 4, 3, 3, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-19 06:46:07,140 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (17)] Forceful destruction successful, exit code 0 [2024-11-19 06:46:07,323 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 17 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable24 [2024-11-19 06:46:07,323 INFO L396 AbstractCegarLoop]: === Iteration 26 === Targeting parse_inputErr5ASSERT_VIOLATIONMEMORY_DEREFERENCE === [parse_inputErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, parse_inputErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, parse_inputErr2ASSERT_VIOLATIONMEMORY_DEREFERENCE (and 17 more)] === [2024-11-19 06:46:07,324 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-19 06:46:07,324 INFO L85 PathProgramCache]: Analyzing trace with hash -817510871, now seen corresponding path program 1 times [2024-11-19 06:46:07,324 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-19 06:46:07,324 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [681692719] [2024-11-19 06:46:07,325 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-19 06:46:07,325 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-19 06:46:07,337 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-19 06:46:07,569 INFO L134 CoverageAnalysis]: Checked inductivity of 49 backedges. 0 proven. 23 refuted. 0 times theorem prover too weak. 26 trivial. 0 not checked. [2024-11-19 06:46:07,569 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-19 06:46:07,569 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [681692719] [2024-11-19 06:46:07,569 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [681692719] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-19 06:46:07,569 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [207592217] [2024-11-19 06:46:07,569 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-19 06:46:07,570 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-19 06:46:07,570 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-19 06:46:07,571 INFO L229 MonitoredProcess]: Starting monitored process 18 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-11-19 06:46:07,573 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (18)] Waiting until timeout for monitored process [2024-11-19 06:46:07,660 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-19 06:46:07,662 INFO L255 TraceCheckSpWp]: Trace formula consists of 294 conjuncts, 25 conjuncts are in the unsatisfiable core [2024-11-19 06:46:07,664 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-19 06:46:07,820 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-11-19 06:46:07,821 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 14 treesize of output 9 [2024-11-19 06:46:07,887 INFO L134 CoverageAnalysis]: Checked inductivity of 49 backedges. 0 proven. 23 refuted. 0 times theorem prover too weak. 26 trivial. 0 not checked. [2024-11-19 06:46:07,888 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-11-19 06:46:07,992 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [207592217] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-19 06:46:07,993 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2024-11-19 06:46:07,993 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 6] total 13 [2024-11-19 06:46:07,993 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1093175917] [2024-11-19 06:46:07,993 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2024-11-19 06:46:07,993 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 15 states [2024-11-19 06:46:07,993 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-19 06:46:07,994 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 15 interpolants. [2024-11-19 06:46:07,995 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=63, Invalid=279, Unknown=0, NotChecked=0, Total=342 [2024-11-19 06:46:07,995 INFO L87 Difference]: Start difference. First operand 262 states and 296 transitions. Second operand has 15 states, 12 states have (on average 5.5) internal successors, (66), 10 states have internal predecessors, (66), 4 states have call successors, (6), 4 states have call predecessors, (6), 4 states have return successors, (4), 4 states have call predecessors, (4), 2 states have call successors, (4) [2024-11-19 06:46:08,462 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-19 06:46:08,463 INFO L93 Difference]: Finished difference Result 273 states and 301 transitions. [2024-11-19 06:46:08,463 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 17 states. [2024-11-19 06:46:08,463 INFO L78 Accepts]: Start accepts. Automaton has has 15 states, 12 states have (on average 5.5) internal successors, (66), 10 states have internal predecessors, (66), 4 states have call successors, (6), 4 states have call predecessors, (6), 4 states have return successors, (4), 4 states have call predecessors, (4), 2 states have call successors, (4) Word has length 53 [2024-11-19 06:46:08,464 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-19 06:46:08,464 INFO L225 Difference]: With dead ends: 273 [2024-11-19 06:46:08,465 INFO L226 Difference]: Without dead ends: 273 [2024-11-19 06:46:08,465 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 83 GetRequests, 53 SyntacticMatches, 0 SemanticMatches, 30 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 158 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=252, Invalid=740, Unknown=0, NotChecked=0, Total=992 [2024-11-19 06:46:08,466 INFO L432 NwaCegarLoop]: 48 mSDtfsCounter, 184 mSDsluCounter, 199 mSDsCounter, 0 mSdLazyCounter, 266 mSolverCounterSat, 17 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 184 SdHoareTripleChecker+Valid, 247 SdHoareTripleChecker+Invalid, 283 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 17 IncrementalHoareTripleChecker+Valid, 266 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2024-11-19 06:46:08,466 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [184 Valid, 247 Invalid, 283 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [17 Valid, 266 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2024-11-19 06:46:08,469 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 273 states. [2024-11-19 06:46:08,472 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 273 to 261. [2024-11-19 06:46:08,476 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 261 states, 241 states have (on average 1.1410788381742738) internal successors, (275), 248 states have internal predecessors, (275), 6 states have call successors, (6), 6 states have call predecessors, (6), 9 states have return successors, (9), 6 states have call predecessors, (9), 6 states have call successors, (9) [2024-11-19 06:46:08,476 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 261 states to 261 states and 290 transitions. [2024-11-19 06:46:08,477 INFO L78 Accepts]: Start accepts. Automaton has 261 states and 290 transitions. Word has length 53 [2024-11-19 06:46:08,477 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-19 06:46:08,477 INFO L471 AbstractCegarLoop]: Abstraction has 261 states and 290 transitions. [2024-11-19 06:46:08,477 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 15 states, 12 states have (on average 5.5) internal successors, (66), 10 states have internal predecessors, (66), 4 states have call successors, (6), 4 states have call predecessors, (6), 4 states have return successors, (4), 4 states have call predecessors, (4), 2 states have call successors, (4) [2024-11-19 06:46:08,477 INFO L276 IsEmpty]: Start isEmpty. Operand 261 states and 290 transitions. [2024-11-19 06:46:08,477 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 55 [2024-11-19 06:46:08,478 INFO L207 NwaCegarLoop]: Found error trace [2024-11-19 06:46:08,478 INFO L215 NwaCegarLoop]: trace histogram [3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-19 06:46:08,496 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (18)] Ended with exit code 0 [2024-11-19 06:46:08,678 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 18 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable25 [2024-11-19 06:46:08,679 INFO L396 AbstractCegarLoop]: === Iteration 27 === Targeting parse_inputErr4ASSERT_VIOLATIONMEMORY_DEREFERENCE === [parse_inputErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, parse_inputErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, parse_inputErr2ASSERT_VIOLATIONMEMORY_DEREFERENCE (and 17 more)] === [2024-11-19 06:46:08,679 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-19 06:46:08,679 INFO L85 PathProgramCache]: Analyzing trace with hash -1234050895, now seen corresponding path program 1 times [2024-11-19 06:46:08,679 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-19 06:46:08,680 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [978681100] [2024-11-19 06:46:08,680 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-19 06:46:08,680 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-19 06:46:08,694 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-19 06:46:09,049 INFO L134 CoverageAnalysis]: Checked inductivity of 32 backedges. 0 proven. 32 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-19 06:46:09,049 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-19 06:46:09,049 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [978681100] [2024-11-19 06:46:09,049 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [978681100] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-19 06:46:09,049 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [2052020404] [2024-11-19 06:46:09,049 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-19 06:46:09,050 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-19 06:46:09,050 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-19 06:46:09,052 INFO L229 MonitoredProcess]: Starting monitored process 19 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-11-19 06:46:09,053 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (19)] Waiting until timeout for monitored process [2024-11-19 06:46:09,144 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-19 06:46:09,146 INFO L255 TraceCheckSpWp]: Trace formula consists of 318 conjuncts, 26 conjuncts are in the unsatisfiable core [2024-11-19 06:46:09,148 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-19 06:46:09,233 INFO L349 Elim1Store]: treesize reduction 20, result has 33.3 percent of original size [2024-11-19 06:46:09,233 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 2 case distinctions, treesize of input 19 treesize of output 16 [2024-11-19 06:46:09,474 INFO L349 Elim1Store]: treesize reduction 57, result has 30.5 percent of original size [2024-11-19 06:46:09,475 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 2 stores, 3 select indices, 3 select index equivalence classes, 1 disjoint index pairs (out of 3 index pairs), introduced 5 new quantified variables, introduced 6 case distinctions, treesize of input 40 treesize of output 75 [2024-11-19 06:46:09,561 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-11-19 06:46:09,572 INFO L349 Elim1Store]: treesize reduction 49, result has 2.0 percent of original size [2024-11-19 06:46:09,573 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 3 select indices, 3 select index equivalence classes, 1 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 5 case distinctions, treesize of input 31 treesize of output 1 [2024-11-19 06:46:09,626 INFO L134 CoverageAnalysis]: Checked inductivity of 32 backedges. 13 proven. 19 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-19 06:46:09,627 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-11-19 06:46:09,690 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [2052020404] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-19 06:46:09,691 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2024-11-19 06:46:09,691 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [11, 10] total 18 [2024-11-19 06:46:09,691 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1018470536] [2024-11-19 06:46:09,691 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2024-11-19 06:46:09,691 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 20 states [2024-11-19 06:46:09,692 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-19 06:46:09,692 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 20 interpolants. [2024-11-19 06:46:09,692 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=62, Invalid=358, Unknown=0, NotChecked=0, Total=420 [2024-11-19 06:46:09,692 INFO L87 Difference]: Start difference. First operand 261 states and 290 transitions. Second operand has 20 states, 18 states have (on average 4.666666666666667) internal successors, (84), 16 states have internal predecessors, (84), 2 states have call successors, (5), 5 states have call predecessors, (5), 4 states have return successors, (4), 2 states have call predecessors, (4), 2 states have call successors, (4) [2024-11-19 06:46:10,266 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-19 06:46:10,266 INFO L93 Difference]: Finished difference Result 269 states and 298 transitions. [2024-11-19 06:46:10,270 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2024-11-19 06:46:10,271 INFO L78 Accepts]: Start accepts. Automaton has has 20 states, 18 states have (on average 4.666666666666667) internal successors, (84), 16 states have internal predecessors, (84), 2 states have call successors, (5), 5 states have call predecessors, (5), 4 states have return successors, (4), 2 states have call predecessors, (4), 2 states have call successors, (4) Word has length 54 [2024-11-19 06:46:10,271 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-19 06:46:10,272 INFO L225 Difference]: With dead ends: 269 [2024-11-19 06:46:10,272 INFO L226 Difference]: Without dead ends: 269 [2024-11-19 06:46:10,273 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 85 GetRequests, 54 SyntacticMatches, 0 SemanticMatches, 31 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 143 ImplicationChecksByTransitivity, 0.6s TimeCoverageRelationStatistics Valid=246, Invalid=810, Unknown=0, NotChecked=0, Total=1056 [2024-11-19 06:46:10,273 INFO L432 NwaCegarLoop]: 45 mSDtfsCounter, 249 mSDsluCounter, 188 mSDsCounter, 0 mSdLazyCounter, 319 mSolverCounterSat, 36 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 249 SdHoareTripleChecker+Valid, 233 SdHoareTripleChecker+Invalid, 355 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 36 IncrementalHoareTripleChecker+Valid, 319 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2024-11-19 06:46:10,273 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [249 Valid, 233 Invalid, 355 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [36 Valid, 319 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2024-11-19 06:46:10,274 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 269 states. [2024-11-19 06:46:10,281 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 269 to 260. [2024-11-19 06:46:10,282 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 260 states, 241 states have (on average 1.1369294605809128) internal successors, (274), 247 states have internal predecessors, (274), 6 states have call successors, (6), 6 states have call predecessors, (6), 9 states have return successors, (9), 6 states have call predecessors, (9), 6 states have call successors, (9) [2024-11-19 06:46:10,286 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 260 states to 260 states and 289 transitions. [2024-11-19 06:46:10,286 INFO L78 Accepts]: Start accepts. Automaton has 260 states and 289 transitions. Word has length 54 [2024-11-19 06:46:10,286 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-19 06:46:10,286 INFO L471 AbstractCegarLoop]: Abstraction has 260 states and 289 transitions. [2024-11-19 06:46:10,286 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 20 states, 18 states have (on average 4.666666666666667) internal successors, (84), 16 states have internal predecessors, (84), 2 states have call successors, (5), 5 states have call predecessors, (5), 4 states have return successors, (4), 2 states have call predecessors, (4), 2 states have call successors, (4) [2024-11-19 06:46:10,286 INFO L276 IsEmpty]: Start isEmpty. Operand 260 states and 289 transitions. [2024-11-19 06:46:10,287 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 61 [2024-11-19 06:46:10,287 INFO L207 NwaCegarLoop]: Found error trace [2024-11-19 06:46:10,287 INFO L215 NwaCegarLoop]: trace histogram [4, 4, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-19 06:46:10,332 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (19)] Forceful destruction successful, exit code 0 [2024-11-19 06:46:10,487 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 19 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable26 [2024-11-19 06:46:10,488 INFO L396 AbstractCegarLoop]: === Iteration 28 === Targeting parse_inputErr2ASSERT_VIOLATIONMEMORY_DEREFERENCE === [parse_inputErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, parse_inputErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, parse_inputErr2ASSERT_VIOLATIONMEMORY_DEREFERENCE (and 17 more)] === [2024-11-19 06:46:10,488 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-19 06:46:10,488 INFO L85 PathProgramCache]: Analyzing trace with hash -1095435096, now seen corresponding path program 1 times [2024-11-19 06:46:10,488 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-19 06:46:10,488 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1397141610] [2024-11-19 06:46:10,488 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-19 06:46:10,488 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-19 06:46:10,511 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-19 06:46:11,021 INFO L134 CoverageAnalysis]: Checked inductivity of 45 backedges. 0 proven. 45 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-19 06:46:11,021 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-19 06:46:11,022 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1397141610] [2024-11-19 06:46:11,022 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1397141610] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-19 06:46:11,022 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [2038493235] [2024-11-19 06:46:11,022 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-19 06:46:11,022 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-19 06:46:11,022 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-19 06:46:11,024 INFO L229 MonitoredProcess]: Starting monitored process 20 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-11-19 06:46:11,026 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (20)] Waiting until timeout for monitored process [2024-11-19 06:46:11,116 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-19 06:46:11,118 INFO L255 TraceCheckSpWp]: Trace formula consists of 334 conjuncts, 32 conjuncts are in the unsatisfiable core [2024-11-19 06:46:11,119 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-19 06:46:11,300 INFO L349 Elim1Store]: treesize reduction 20, result has 33.3 percent of original size [2024-11-19 06:46:11,300 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 2 case distinctions, treesize of input 19 treesize of output 16 [2024-11-19 06:46:11,721 INFO L349 Elim1Store]: treesize reduction 57, result has 30.5 percent of original size [2024-11-19 06:46:11,721 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 2 stores, 3 select indices, 3 select index equivalence classes, 1 disjoint index pairs (out of 3 index pairs), introduced 5 new quantified variables, introduced 6 case distinctions, treesize of input 40 treesize of output 75 [2024-11-19 06:46:11,841 INFO L349 Elim1Store]: treesize reduction 32, result has 36.0 percent of original size [2024-11-19 06:46:11,842 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 29 [2024-11-19 06:46:11,854 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-11-19 06:46:11,991 INFO L134 CoverageAnalysis]: Checked inductivity of 45 backedges. 13 proven. 32 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-19 06:46:11,991 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-11-19 06:46:12,120 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [2038493235] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-19 06:46:12,120 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2024-11-19 06:46:12,120 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [14, 11] total 25 [2024-11-19 06:46:12,120 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2121556708] [2024-11-19 06:46:12,120 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2024-11-19 06:46:12,120 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 27 states [2024-11-19 06:46:12,120 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-19 06:46:12,121 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 27 interpolants. [2024-11-19 06:46:12,121 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=95, Invalid=775, Unknown=0, NotChecked=0, Total=870 [2024-11-19 06:46:12,121 INFO L87 Difference]: Start difference. First operand 260 states and 289 transitions. Second operand has 27 states, 24 states have (on average 4.583333333333333) internal successors, (110), 23 states have internal predecessors, (110), 5 states have call successors, (6), 6 states have call predecessors, (6), 4 states have return successors, (4), 4 states have call predecessors, (4), 4 states have call successors, (4) [2024-11-19 06:46:12,717 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-19 06:46:12,717 INFO L93 Difference]: Finished difference Result 268 states and 297 transitions. [2024-11-19 06:46:12,717 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2024-11-19 06:46:12,718 INFO L78 Accepts]: Start accepts. Automaton has has 27 states, 24 states have (on average 4.583333333333333) internal successors, (110), 23 states have internal predecessors, (110), 5 states have call successors, (6), 6 states have call predecessors, (6), 4 states have return successors, (4), 4 states have call predecessors, (4), 4 states have call successors, (4) Word has length 60 [2024-11-19 06:46:12,718 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-19 06:46:12,719 INFO L225 Difference]: With dead ends: 268 [2024-11-19 06:46:12,719 INFO L226 Difference]: Without dead ends: 268 [2024-11-19 06:46:12,720 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 98 GetRequests, 60 SyntacticMatches, 0 SemanticMatches, 38 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 256 ImplicationChecksByTransitivity, 0.8s TimeCoverageRelationStatistics Valid=260, Invalid=1300, Unknown=0, NotChecked=0, Total=1560 [2024-11-19 06:46:12,720 INFO L432 NwaCegarLoop]: 29 mSDtfsCounter, 267 mSDsluCounter, 232 mSDsCounter, 0 mSdLazyCounter, 495 mSolverCounterSat, 46 mSolverCounterUnsat, 1 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 267 SdHoareTripleChecker+Valid, 261 SdHoareTripleChecker+Invalid, 542 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 46 IncrementalHoareTripleChecker+Valid, 495 IncrementalHoareTripleChecker+Invalid, 1 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2024-11-19 06:46:12,720 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [267 Valid, 261 Invalid, 542 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [46 Valid, 495 Invalid, 1 Unknown, 0 Unchecked, 0.3s Time] [2024-11-19 06:46:12,721 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 268 states. [2024-11-19 06:46:12,725 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 268 to 259. [2024-11-19 06:46:12,725 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 259 states, 241 states have (on average 1.1327800829875518) internal successors, (273), 246 states have internal predecessors, (273), 6 states have call successors, (6), 6 states have call predecessors, (6), 9 states have return successors, (9), 6 states have call predecessors, (9), 6 states have call successors, (9) [2024-11-19 06:46:12,725 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 259 states to 259 states and 288 transitions. [2024-11-19 06:46:12,726 INFO L78 Accepts]: Start accepts. Automaton has 259 states and 288 transitions. Word has length 60 [2024-11-19 06:46:12,726 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-19 06:46:12,726 INFO L471 AbstractCegarLoop]: Abstraction has 259 states and 288 transitions. [2024-11-19 06:46:12,726 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 27 states, 24 states have (on average 4.583333333333333) internal successors, (110), 23 states have internal predecessors, (110), 5 states have call successors, (6), 6 states have call predecessors, (6), 4 states have return successors, (4), 4 states have call predecessors, (4), 4 states have call successors, (4) [2024-11-19 06:46:12,727 INFO L276 IsEmpty]: Start isEmpty. Operand 259 states and 288 transitions. [2024-11-19 06:46:12,727 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 62 [2024-11-19 06:46:12,727 INFO L207 NwaCegarLoop]: Found error trace [2024-11-19 06:46:12,727 INFO L215 NwaCegarLoop]: trace histogram [4, 4, 4, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-19 06:46:12,745 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (20)] Forceful destruction successful, exit code 0 [2024-11-19 06:46:12,928 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable27,20 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-19 06:46:12,929 INFO L396 AbstractCegarLoop]: === Iteration 29 === Targeting parse_inputErr3ASSERT_VIOLATIONMEMORY_DEREFERENCE === [parse_inputErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, parse_inputErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, parse_inputErr2ASSERT_VIOLATIONMEMORY_DEREFERENCE (and 17 more)] === [2024-11-19 06:46:12,929 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-19 06:46:12,929 INFO L85 PathProgramCache]: Analyzing trace with hash 401250437, now seen corresponding path program 1 times [2024-11-19 06:46:12,929 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-19 06:46:12,929 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1500689161] [2024-11-19 06:46:12,930 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-19 06:46:12,930 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-19 06:46:12,956 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-19 06:46:13,553 INFO L134 CoverageAnalysis]: Checked inductivity of 48 backedges. 16 proven. 32 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-19 06:46:13,553 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-19 06:46:13,553 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1500689161] [2024-11-19 06:46:13,554 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1500689161] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-19 06:46:13,554 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [693222368] [2024-11-19 06:46:13,554 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-19 06:46:13,554 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-19 06:46:13,554 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-19 06:46:13,556 INFO L229 MonitoredProcess]: Starting monitored process 21 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-11-19 06:46:13,557 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (21)] Waiting until timeout for monitored process [2024-11-19 06:46:13,653 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-19 06:46:13,656 INFO L255 TraceCheckSpWp]: Trace formula consists of 336 conjuncts, 35 conjuncts are in the unsatisfiable core [2024-11-19 06:46:13,658 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-19 06:46:13,958 INFO L349 Elim1Store]: treesize reduction 20, result has 33.3 percent of original size [2024-11-19 06:46:13,958 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 2 case distinctions, treesize of input 19 treesize of output 16 [2024-11-19 06:46:13,964 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 14 treesize of output 9 [2024-11-19 06:46:14,229 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-11-19 06:46:14,233 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 14 treesize of output 9 [2024-11-19 06:46:14,424 INFO L134 CoverageAnalysis]: Checked inductivity of 48 backedges. 0 proven. 35 refuted. 0 times theorem prover too weak. 13 trivial. 0 not checked. [2024-11-19 06:46:14,424 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-11-19 06:46:14,650 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [693222368] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-19 06:46:14,650 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2024-11-19 06:46:14,650 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [15, 8] total 23 [2024-11-19 06:46:14,650 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [521727816] [2024-11-19 06:46:14,650 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2024-11-19 06:46:14,651 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 25 states [2024-11-19 06:46:14,651 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-19 06:46:14,651 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 25 interpolants. [2024-11-19 06:46:14,651 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=90, Invalid=780, Unknown=0, NotChecked=0, Total=870 [2024-11-19 06:46:14,652 INFO L87 Difference]: Start difference. First operand 259 states and 288 transitions. Second operand has 25 states, 23 states have (on average 4.3478260869565215) internal successors, (100), 21 states have internal predecessors, (100), 5 states have call successors, (6), 5 states have call predecessors, (6), 4 states have return successors, (4), 4 states have call predecessors, (4), 3 states have call successors, (4) [2024-11-19 06:46:15,678 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-19 06:46:15,679 INFO L93 Difference]: Finished difference Result 284 states and 311 transitions. [2024-11-19 06:46:15,679 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 21 states. [2024-11-19 06:46:15,679 INFO L78 Accepts]: Start accepts. Automaton has has 25 states, 23 states have (on average 4.3478260869565215) internal successors, (100), 21 states have internal predecessors, (100), 5 states have call successors, (6), 5 states have call predecessors, (6), 4 states have return successors, (4), 4 states have call predecessors, (4), 3 states have call successors, (4) Word has length 61 [2024-11-19 06:46:15,679 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-19 06:46:15,680 INFO L225 Difference]: With dead ends: 284 [2024-11-19 06:46:15,680 INFO L226 Difference]: Without dead ends: 284 [2024-11-19 06:46:15,681 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 110 GetRequests, 63 SyntacticMatches, 0 SemanticMatches, 47 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 520 ImplicationChecksByTransitivity, 1.1s TimeCoverageRelationStatistics Valid=400, Invalid=1952, Unknown=0, NotChecked=0, Total=2352 [2024-11-19 06:46:15,681 INFO L432 NwaCegarLoop]: 27 mSDtfsCounter, 358 mSDsluCounter, 268 mSDsCounter, 0 mSdLazyCounter, 616 mSolverCounterSat, 64 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 358 SdHoareTripleChecker+Valid, 295 SdHoareTripleChecker+Invalid, 680 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 64 IncrementalHoareTripleChecker+Valid, 616 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2024-11-19 06:46:15,681 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [358 Valid, 295 Invalid, 680 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [64 Valid, 616 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time] [2024-11-19 06:46:15,682 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 284 states. [2024-11-19 06:46:15,685 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 284 to 258. [2024-11-19 06:46:15,685 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 258 states, 241 states have (on average 1.1286307053941909) internal successors, (272), 245 states have internal predecessors, (272), 6 states have call successors, (6), 6 states have call predecessors, (6), 9 states have return successors, (9), 6 states have call predecessors, (9), 6 states have call successors, (9) [2024-11-19 06:46:15,686 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 258 states to 258 states and 287 transitions. [2024-11-19 06:46:15,686 INFO L78 Accepts]: Start accepts. Automaton has 258 states and 287 transitions. Word has length 61 [2024-11-19 06:46:15,686 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-19 06:46:15,686 INFO L471 AbstractCegarLoop]: Abstraction has 258 states and 287 transitions. [2024-11-19 06:46:15,686 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 25 states, 23 states have (on average 4.3478260869565215) internal successors, (100), 21 states have internal predecessors, (100), 5 states have call successors, (6), 5 states have call predecessors, (6), 4 states have return successors, (4), 4 states have call predecessors, (4), 3 states have call successors, (4) [2024-11-19 06:46:15,686 INFO L276 IsEmpty]: Start isEmpty. Operand 258 states and 287 transitions. [2024-11-19 06:46:15,687 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 67 [2024-11-19 06:46:15,687 INFO L207 NwaCegarLoop]: Found error trace [2024-11-19 06:46:15,687 INFO L215 NwaCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-19 06:46:15,706 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (21)] Forceful destruction successful, exit code 0 [2024-11-19 06:46:15,891 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 21 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable28 [2024-11-19 06:46:15,892 INFO L396 AbstractCegarLoop]: === Iteration 30 === Targeting parse_inputErr18ASSERT_VIOLATIONMEMORY_FREE === [parse_inputErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, parse_inputErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, parse_inputErr2ASSERT_VIOLATIONMEMORY_DEREFERENCE (and 17 more)] === [2024-11-19 06:46:15,892 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-19 06:46:15,892 INFO L85 PathProgramCache]: Analyzing trace with hash 1576724517, now seen corresponding path program 1 times [2024-11-19 06:46:15,892 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-19 06:46:15,892 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [782063677] [2024-11-19 06:46:15,892 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-19 06:46:15,892 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-19 06:46:15,906 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-19 06:46:16,138 INFO L134 CoverageAnalysis]: Checked inductivity of 53 backedges. 26 proven. 27 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-19 06:46:16,139 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-19 06:46:16,139 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [782063677] [2024-11-19 06:46:16,139 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [782063677] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-19 06:46:16,140 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [2136163451] [2024-11-19 06:46:16,140 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-19 06:46:16,140 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-19 06:46:16,140 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-19 06:46:16,142 INFO L229 MonitoredProcess]: Starting monitored process 22 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-11-19 06:46:16,143 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (22)] Waiting until timeout for monitored process [2024-11-19 06:46:16,243 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-19 06:46:16,245 INFO L255 TraceCheckSpWp]: Trace formula consists of 362 conjuncts, 29 conjuncts are in the unsatisfiable core [2024-11-19 06:46:16,246 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-19 06:46:16,250 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2024-11-19 06:46:16,364 INFO L349 Elim1Store]: treesize reduction 20, result has 33.3 percent of original size [2024-11-19 06:46:16,365 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 3 case distinctions, treesize of input 22 treesize of output 16 [2024-11-19 06:46:16,384 INFO L349 Elim1Store]: treesize reduction 15, result has 25.0 percent of original size [2024-11-19 06:46:16,384 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 12 treesize of output 14 [2024-11-19 06:46:16,393 INFO L134 CoverageAnalysis]: Checked inductivity of 53 backedges. 28 proven. 25 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-19 06:46:16,393 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-11-19 06:46:16,451 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [2136163451] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-19 06:46:16,451 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2024-11-19 06:46:16,451 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 7] total 10 [2024-11-19 06:46:16,451 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [761110442] [2024-11-19 06:46:16,451 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2024-11-19 06:46:16,451 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 11 states [2024-11-19 06:46:16,452 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-19 06:46:16,452 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2024-11-19 06:46:16,452 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=31, Invalid=101, Unknown=0, NotChecked=0, Total=132 [2024-11-19 06:46:16,452 INFO L87 Difference]: Start difference. First operand 258 states and 287 transitions. Second operand has 11 states, 10 states have (on average 7.1) internal successors, (71), 11 states have internal predecessors, (71), 2 states have call successors, (3), 3 states have call predecessors, (3), 3 states have return successors, (3), 1 states have call predecessors, (3), 2 states have call successors, (3) [2024-11-19 06:46:16,595 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-19 06:46:16,595 INFO L93 Difference]: Finished difference Result 269 states and 297 transitions. [2024-11-19 06:46:16,595 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2024-11-19 06:46:16,596 INFO L78 Accepts]: Start accepts. Automaton has has 11 states, 10 states have (on average 7.1) internal successors, (71), 11 states have internal predecessors, (71), 2 states have call successors, (3), 3 states have call predecessors, (3), 3 states have return successors, (3), 1 states have call predecessors, (3), 2 states have call successors, (3) Word has length 66 [2024-11-19 06:46:16,596 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-19 06:46:16,597 INFO L225 Difference]: With dead ends: 269 [2024-11-19 06:46:16,597 INFO L226 Difference]: Without dead ends: 269 [2024-11-19 06:46:16,597 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 101 GetRequests, 85 SyntacticMatches, 2 SemanticMatches, 14 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 36 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=60, Invalid=180, Unknown=0, NotChecked=0, Total=240 [2024-11-19 06:46:16,598 INFO L432 NwaCegarLoop]: 46 mSDtfsCounter, 23 mSDsluCounter, 149 mSDsCounter, 0 mSdLazyCounter, 174 mSolverCounterSat, 9 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 23 SdHoareTripleChecker+Valid, 195 SdHoareTripleChecker+Invalid, 183 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 9 IncrementalHoareTripleChecker+Valid, 174 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-11-19 06:46:16,598 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [23 Valid, 195 Invalid, 183 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [9 Valid, 174 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-11-19 06:46:16,598 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 269 states. [2024-11-19 06:46:16,604 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 269 to 212. [2024-11-19 06:46:16,605 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 212 states, 199 states have (on average 1.1256281407035176) internal successors, (224), 201 states have internal predecessors, (224), 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-11-19 06:46:16,605 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 212 states to 212 states and 236 transitions. [2024-11-19 06:46:16,606 INFO L78 Accepts]: Start accepts. Automaton has 212 states and 236 transitions. Word has length 66 [2024-11-19 06:46:16,606 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-19 06:46:16,606 INFO L471 AbstractCegarLoop]: Abstraction has 212 states and 236 transitions. [2024-11-19 06:46:16,606 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 11 states, 10 states have (on average 7.1) internal successors, (71), 11 states have internal predecessors, (71), 2 states have call successors, (3), 3 states have call predecessors, (3), 3 states have return successors, (3), 1 states have call predecessors, (3), 2 states have call successors, (3) [2024-11-19 06:46:16,606 INFO L276 IsEmpty]: Start isEmpty. Operand 212 states and 236 transitions. [2024-11-19 06:46:16,607 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 70 [2024-11-19 06:46:16,607 INFO L207 NwaCegarLoop]: Found error trace [2024-11-19 06:46:16,607 INFO L215 NwaCegarLoop]: trace histogram [5, 5, 5, 5, 5, 5, 4, 4, 3, 3, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-19 06:46:16,625 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (22)] Ended with exit code 0 [2024-11-19 06:46:16,811 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable29,22 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-19 06:46:16,812 INFO L396 AbstractCegarLoop]: === Iteration 31 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK === [parse_inputErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, parse_inputErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, parse_inputErr2ASSERT_VIOLATIONMEMORY_DEREFERENCE (and 17 more)] === [2024-11-19 06:46:16,812 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-19 06:46:16,812 INFO L85 PathProgramCache]: Analyzing trace with hash -2065204372, now seen corresponding path program 1 times [2024-11-19 06:46:16,813 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-19 06:46:16,813 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [25842577] [2024-11-19 06:46:16,813 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-19 06:46:16,813 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-19 06:46:16,831 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-11-19 06:46:16,831 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-11-19 06:46:16,853 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-11-19 06:46:16,883 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2024-11-19 06:46:16,883 INFO L325 BasicCegarLoop]: Counterexample is feasible [2024-11-19 06:46:16,884 INFO L782 garLoopResultBuilder]: Registering result UNSAFE for location ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK (19 of 20 remaining) [2024-11-19 06:46:16,886 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location parse_inputErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE (18 of 20 remaining) [2024-11-19 06:46:16,887 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location parse_inputErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (17 of 20 remaining) [2024-11-19 06:46:16,887 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location parse_inputErr2ASSERT_VIOLATIONMEMORY_DEREFERENCE (16 of 20 remaining) [2024-11-19 06:46:16,887 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location parse_inputErr3ASSERT_VIOLATIONMEMORY_DEREFERENCE (15 of 20 remaining) [2024-11-19 06:46:16,887 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location parse_inputErr4ASSERT_VIOLATIONMEMORY_DEREFERENCE (14 of 20 remaining) [2024-11-19 06:46:16,887 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location parse_inputErr5ASSERT_VIOLATIONMEMORY_DEREFERENCE (13 of 20 remaining) [2024-11-19 06:46:16,887 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location parse_inputErr6REQUIRES_VIOLATIONMEMORY_DEREFERENCE (12 of 20 remaining) [2024-11-19 06:46:16,887 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location parse_inputErr7REQUIRES_VIOLATIONMEMORY_DEREFERENCE (11 of 20 remaining) [2024-11-19 06:46:16,888 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location parse_inputErr8REQUIRES_VIOLATIONMEMORY_DEREFERENCE (10 of 20 remaining) [2024-11-19 06:46:16,888 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location parse_inputErr9REQUIRES_VIOLATIONMEMORY_DEREFERENCE (9 of 20 remaining) [2024-11-19 06:46:16,889 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location parse_inputErr10ASSERT_VIOLATIONMEMORY_FREE (8 of 20 remaining) [2024-11-19 06:46:16,889 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location parse_inputErr11ASSERT_VIOLATIONMEMORY_FREE (7 of 20 remaining) [2024-11-19 06:46:16,889 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location parse_inputErr12ASSERT_VIOLATIONMEMORY_FREE (6 of 20 remaining) [2024-11-19 06:46:16,889 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location parse_inputErr13ASSERT_VIOLATIONMEMORY_FREE (5 of 20 remaining) [2024-11-19 06:46:16,889 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location parse_inputErr14ASSERT_VIOLATIONMEMORY_FREE (4 of 20 remaining) [2024-11-19 06:46:16,889 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location parse_inputErr15ASSERT_VIOLATIONMEMORY_FREE (3 of 20 remaining) [2024-11-19 06:46:16,889 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location parse_inputErr16ASSERT_VIOLATIONMEMORY_FREE (2 of 20 remaining) [2024-11-19 06:46:16,890 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location parse_inputErr17ASSERT_VIOLATIONMEMORY_FREE (1 of 20 remaining) [2024-11-19 06:46:16,890 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location parse_inputErr18ASSERT_VIOLATIONMEMORY_FREE (0 of 20 remaining) [2024-11-19 06:46:16,890 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable30 [2024-11-19 06:46:16,894 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] [2024-11-19 06:46:16,966 INFO L170 ceAbstractionStarter]: Computing trace abstraction results [2024-11-19 06:46:16,969 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 19.11 06:46:16 BoogieIcfgContainer [2024-11-19 06:46:16,970 INFO L131 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2024-11-19 06:46:16,971 INFO L112 PluginConnector]: ------------------------Witness Printer---------------------------- [2024-11-19 06:46:16,971 INFO L270 PluginConnector]: Initializing Witness Printer... [2024-11-19 06:46:16,971 INFO L274 PluginConnector]: Witness Printer initialized [2024-11-19 06:46:16,972 INFO L184 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 19.11 06:45:46" (3/4) ... [2024-11-19 06:46:16,974 INFO L145 WitnessPrinter]: No result that supports witness generation found [2024-11-19 06:46:16,975 INFO L131 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2024-11-19 06:46:16,976 INFO L158 Benchmark]: Toolchain (without parser) took 32122.00ms. Allocated memory was 176.2MB in the beginning and 469.8MB in the end (delta: 293.6MB). Free memory was 106.6MB in the beginning and 229.3MB in the end (delta: -122.7MB). Peak memory consumption was 172.1MB. Max. memory is 16.1GB. [2024-11-19 06:46:16,976 INFO L158 Benchmark]: CDTParser took 0.16ms. Allocated memory is still 113.2MB. Free memory is still 76.4MB. There was no memory consumed. Max. memory is 16.1GB. [2024-11-19 06:46:16,976 INFO L158 Benchmark]: CACSL2BoogieTranslator took 625.20ms. Allocated memory is still 176.2MB. Free memory was 106.5MB in the beginning and 136.6MB in the end (delta: -30.1MB). Peak memory consumption was 15.9MB. Max. memory is 16.1GB. [2024-11-19 06:46:16,977 INFO L158 Benchmark]: Boogie Procedure Inliner took 53.20ms. Allocated memory is still 176.2MB. Free memory was 136.6MB in the beginning and 134.5MB in the end (delta: 2.1MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. [2024-11-19 06:46:16,977 INFO L158 Benchmark]: Boogie Preprocessor took 77.79ms. Allocated memory is still 176.2MB. Free memory was 134.5MB in the beginning and 131.7MB in the end (delta: 2.8MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. [2024-11-19 06:46:16,978 INFO L158 Benchmark]: RCFGBuilder took 489.82ms. Allocated memory is still 176.2MB. Free memory was 131.7MB in the beginning and 114.2MB in the end (delta: 17.5MB). Peak memory consumption was 18.9MB. Max. memory is 16.1GB. [2024-11-19 06:46:16,979 INFO L158 Benchmark]: TraceAbstraction took 30864.57ms. Allocated memory was 176.2MB in the beginning and 469.8MB in the end (delta: 293.6MB). Free memory was 113.5MB in the beginning and 230.3MB in the end (delta: -116.8MB). Peak memory consumption was 179.3MB. Max. memory is 16.1GB. [2024-11-19 06:46:16,979 INFO L158 Benchmark]: Witness Printer took 4.54ms. Allocated memory is still 469.8MB. Free memory was 230.3MB in the beginning and 229.3MB in the end (delta: 1.0MB). There was no memory consumed. Max. memory is 16.1GB. [2024-11-19 06:46:16,979 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.16ms. Allocated memory is still 113.2MB. Free memory is still 76.4MB. There was no memory consumed. Max. memory is 16.1GB. * CACSL2BoogieTranslator took 625.20ms. Allocated memory is still 176.2MB. Free memory was 106.5MB in the beginning and 136.6MB in the end (delta: -30.1MB). Peak memory consumption was 15.9MB. Max. memory is 16.1GB. * Boogie Procedure Inliner took 53.20ms. Allocated memory is still 176.2MB. Free memory was 136.6MB in the beginning and 134.5MB in the end (delta: 2.1MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. * Boogie Preprocessor took 77.79ms. Allocated memory is still 176.2MB. Free memory was 134.5MB in the beginning and 131.7MB in the end (delta: 2.8MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. * RCFGBuilder took 489.82ms. Allocated memory is still 176.2MB. Free memory was 131.7MB in the beginning and 114.2MB in the end (delta: 17.5MB). Peak memory consumption was 18.9MB. Max. memory is 16.1GB. * TraceAbstraction took 30864.57ms. Allocated memory was 176.2MB in the beginning and 469.8MB in the end (delta: 293.6MB). Free memory was 113.5MB in the beginning and 230.3MB in the end (delta: -116.8MB). Peak memory consumption was 179.3MB. Max. memory is 16.1GB. * Witness Printer took 4.54ms. Allocated memory is still 469.8MB. Free memory was 230.3MB in the beginning and 229.3MB in the end (delta: 1.0MB). There was no memory consumed. Max. memory is 16.1GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - StatisticsResult: ErrorAutomatonStatistics NumberErrorTraces: 0, NumberStatementsAllTraces: 0, NumberRelevantStatements: 0, 0.0s ErrorAutomatonConstructionTimeTotal, 0.0s FaulLocalizationTime, NumberStatementsFirstTrace: -1, TraceLengthAvg: 0, 0.0s ErrorAutomatonConstructionTimeAvg, 0.0s ErrorAutomatonDifferenceTimeAvg, 0.0s ErrorAutomatonDifferenceTimeTotal, NumberOfNoEnhancement: 0, NumberOfFiniteEnhancement: 0, NumberOfInfiniteEnhancement: 0 - UnprovableResult [Line: 721]: Unable to prove that all allocated memory was freed Unable to prove that all allocated memory was freed Reason: overapproximation of strcmp at line 693, overapproximation of memtrack at line 721. Possible FailurePath: [L685] int state = STATE_1; [L686] char *global = 0; [L687-L690] const struct command commands[] = { {"c1",c1,STATE_1}, {"c2",c2,STATE_2} }; [L687-L690] const struct command commands[] = { {"c1",c1,STATE_1}, {"c2",c2,STATE_2} }; [L687-L690] const struct command commands[] = { {"c1",c1,STATE_1}, {"c2",c2,STATE_2} }; [L687-L690] const struct command commands[] = { {"c1",c1,STATE_1}, {"c2",c2,STATE_2} }; [L687-L690] const struct command commands[] = { {"c1",c1,STATE_1}, {"c2",c2,STATE_2} }; [L687-L690] const struct command commands[] = { {"c1",c1,STATE_1}, {"c2",c2,STATE_2} }; [L687-L690] const struct command commands[] = { {"c1",c1,STATE_1}, {"c2",c2,STATE_2} }; VAL [commands={6:0}, global={0:0}, state=0] [L722] CALL parse_input("c1") VAL [\old(state)=0, commands={6:0}, global={0:0}, state=0] [L692] int i = 0; VAL [\old(input)={3:0}, \old(state)=0, commands={6:0}, global={0:0}, i=0, input={3:0}, state=0] [L692] COND TRUE i < 2 VAL [\old(input)={3:0}, \old(state)=0, commands={6:0}, global={0:0}, i=0, input={3:0}, state=0] [L693] EXPR commands[i].name VAL [\old(input)={3:0}, \old(state)=0, commands={6:0}, global={0:0}, i=0, input={3:0}, state=0] [L693] EXPR strcmp(commands[i].name,input) VAL [\old(input)={3:0}, \old(state)=0, commands={6:0}, global={0:0}, i=0, input={3:0}, state=0] [L693] EXPR strcmp(commands[i].name,input) VAL [\old(input)={3:0}, \old(state)=0, commands={6:0}, global={0:0}, i=0, input={3:0}, state=0] [L693] EXPR strcmp(commands[i].name,input) VAL [\old(input)={3:0}, \old(state)=0, commands={6:0}, global={0:0}, i=0, input={3:0}, state=0] [L693] EXPR strcmp(commands[i].name,input) VAL [\old(input)={3:0}, \old(state)=0, commands={6:0}, global={0:0}, i=0, input={3:0}, state=0] [L693] COND 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 VAL [\old(input)={5:0}, \old(state)=0, commands={6:0}, global={0:0}, input={5:0}, state=0] [L695] CALL commands[i].function() [L702] char *x = (char *)malloc(sizeof(char)); [L703] COND FALSE !(!x) VAL [\old(state)=0, commands={6:0}, global={0:0}, state=0, x={-3:0}] [L706] COND FALSE !(\read(*global)) VAL [\old(state)=0, commands={6:0}, global={0:0}, state=0, x={-3:0}] [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, 62 locations, 20 error locations. Started 1 CEGAR loops. OverallTime: 30.7s, OverallIterations: 31, TraceHistogramMax: 5, PathProgramHistogramMax: 1, EmptinessCheckTime: 0.0s, AutomataDifference: 8.5s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 0.0s, HoareTripleCheckerStatistics: 1 mSolverCounterUnknown, 5559 SdHoareTripleChecker+Valid, 4.6s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 5559 mSDsluCounter, 6754 SdHoareTripleChecker+Invalid, 3.9s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 172 IncrementalHoareTripleChecker+Unchecked, 5240 mSDsCounter, 599 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 5916 IncrementalHoareTripleChecker+Invalid, 6688 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 599 mSolverCounterUnsat, 1514 mSDtfsCounter, 5916 mSolverCounterSat, 0.1s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 1579 GetRequests, 1074 SyntacticMatches, 8 SemanticMatches, 497 ConstructedPredicates, 1 IntricatePredicates, 0 DeprecatedPredicates, 2691 ImplicationChecksByTransitivity, 7.6s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=386occurred in iteration=16, InterpolantAutomatonStates: 275, 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, 30 MinimizatonAttempts, 620 StatesRemovedByMinimization, 27 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.2s SsaConstructionTime, 1.0s SatisfiabilityAnalysisTime, 14.9s InterpolantComputationTime, 1887 NumberOfCodeBlocks, 1887 NumberOfCodeBlocksAsserted, 52 NumberOfCheckSat, 2030 ConstructedInterpolants, 119 QuantifiedInterpolants, 22429 SizeOfPredicates, 80 NumberOfNonLiveVariables, 5375 ConjunctsInSsa, 414 ConjunctsInUnsatCore, 59 InterpolantComputations, 11 PerfectInterpolantSequences, 426/1020 InterpolantCoveringCapability, INVARIANT_SYNTHESIS: No data available, INTERPOLANT_CONSOLIDATION: No data available, ABSTRACT_INTERPRETATION: No data available, PDR: No data available, ACCELERATED_INTERPOLATION: No data available, SIFA: No data available, ReuseStatistics: No data available RESULT: Ultimate could not prove your program: unable to determine feasibility of some traces [2024-11-19 06:46:17,014 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Ended with exit code 0 Received shutdown request... --- End real Ultimate output --- Execution finished normally Using bit-precise analysis Retrying with bit-precise analysis ### Bit-precise run ### Calling Ultimate with: /root/.sdkman/candidates/java/11.0.12-open/bin/java -Dosgi.configuration.area=/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/config -Xmx15G -Xms4m -jar /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/plugins/org.eclipse.equinox.launcher_1.5.800.v20200727-1323.jar -data @noDefault -ultimatedata /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data -tc /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/AutomizerMemDerefMemtrack.xml -i ../sv-benchmarks/c/memsafety-bftpd/bftpd_2.i -s /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-DerefFreeMemtrack-32bit-Automizer_Bitvector.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux --witnessprinter.witness.filename witness --witnessprinter.write.witness.besides.input.file false --witnessprinter.graph.data.specification CHECK( init(main()), LTL(G valid-free) ) CHECK( init(main()), LTL(G valid-deref) ) CHECK( init(main()), LTL(G valid-memtrack) ) --witnessprinter.graph.data.producer Automizer --witnessprinter.graph.data.architecture 32bit --witnessprinter.graph.data.programhash 7c883b81b24ce5a721aa9a1ff13aef8a0d532ba87d9e130e470a0b88a1f8e93e --- Real Ultimate output --- This is Ultimate 0.2.5-tmp.dk.eval-assert-order-craig-3061b6d-m [2024-11-19 06:46:19,233 INFO L188 SettingsManager]: Resetting all preferences to default values... [2024-11-19 06:46:19,315 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-DerefFreeMemtrack-32bit-Automizer_Bitvector.epf [2024-11-19 06:46:19,320 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2024-11-19 06:46:19,320 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2024-11-19 06:46:19,355 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2024-11-19 06:46:19,356 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2024-11-19 06:46:19,356 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2024-11-19 06:46:19,357 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2024-11-19 06:46:19,357 INFO L153 SettingsManager]: * Use memory slicer=true [2024-11-19 06:46:19,358 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2024-11-19 06:46:19,358 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2024-11-19 06:46:19,359 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2024-11-19 06:46:19,361 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2024-11-19 06:46:19,361 INFO L153 SettingsManager]: * Use SBE=true [2024-11-19 06:46:19,362 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2024-11-19 06:46:19,362 INFO L153 SettingsManager]: * sizeof long=4 [2024-11-19 06:46:19,362 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2024-11-19 06:46:19,363 INFO L153 SettingsManager]: * sizeof POINTER=4 [2024-11-19 06:46:19,363 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2024-11-19 06:46:19,364 INFO L153 SettingsManager]: * Check for the main procedure if all allocated memory was freed=true [2024-11-19 06:46:19,365 INFO L153 SettingsManager]: * Bitprecise bitfields=true [2024-11-19 06:46:19,365 INFO L153 SettingsManager]: * SV-COMP memtrack compatibility mode=true [2024-11-19 06:46:19,365 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2024-11-19 06:46:19,366 INFO L153 SettingsManager]: * Adapt memory model on pointer casts if necessary=true [2024-11-19 06:46:19,366 INFO L153 SettingsManager]: * Use bitvectors instead of ints=true [2024-11-19 06:46:19,366 INFO L153 SettingsManager]: * Allow undefined functions=false [2024-11-19 06:46:19,367 INFO L153 SettingsManager]: * Memory model=HoenickeLindenmann_4ByteResolution [2024-11-19 06:46:19,367 INFO L153 SettingsManager]: * Check unreachability of reach_error function=false [2024-11-19 06:46:19,367 INFO L153 SettingsManager]: * sizeof long double=12 [2024-11-19 06:46:19,368 INFO L153 SettingsManager]: * Use constant arrays=true [2024-11-19 06:46:19,368 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2024-11-19 06:46:19,368 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2024-11-19 06:46:19,369 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2024-11-19 06:46:19,369 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2024-11-19 06:46:19,369 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-11-19 06:46:19,370 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2024-11-19 06:46:19,370 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2024-11-19 06:46:19,371 INFO L153 SettingsManager]: * Trace refinement strategy=WOLF [2024-11-19 06:46:19,371 INFO L153 SettingsManager]: * Command for external solver=cvc4 --incremental --print-success --lang smt [2024-11-19 06:46:19,371 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2024-11-19 06:46:19,372 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2024-11-19 06:46:19,372 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2024-11-19 06:46:19,372 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2024-11-19 06:46:19,372 INFO L153 SettingsManager]: * Looper check in Petri net analysis=SEMANTIC WARNING: An illegal reflective access operation has occurred WARNING: Illegal reflective access by com.sun.xml.bind.v2.runtime.reflect.opt.Injector$1 (file:/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/plugins/com.sun.xml.bind_2.2.0.v201505121915.jar) to method java.lang.ClassLoader.defineClass(java.lang.String,byte[],int,int) WARNING: Please consider reporting this to the maintainers of com.sun.xml.bind.v2.runtime.reflect.opt.Injector$1 WARNING: Use --illegal-access=warn to enable warnings of further illegal reflective access operations WARNING: All illegal access operations will be denied in a future release Applying setting for plugin de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator: Entry function -> main Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Witness directory -> /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Witness filename -> witness Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Write witness besides input file -> false Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data specification -> CHECK( init(main()), LTL(G valid-free) ) CHECK( init(main()), LTL(G valid-deref) ) CHECK( init(main()), LTL(G valid-memtrack) ) Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data producer -> Automizer Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data architecture -> 32bit Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data programhash -> 7c883b81b24ce5a721aa9a1ff13aef8a0d532ba87d9e130e470a0b88a1f8e93e [2024-11-19 06:46:19,729 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2024-11-19 06:46:19,751 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2024-11-19 06:46:19,754 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2024-11-19 06:46:19,755 INFO L270 PluginConnector]: Initializing CDTParser... [2024-11-19 06:46:19,755 INFO L274 PluginConnector]: CDTParser initialized [2024-11-19 06:46:19,760 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/memsafety-bftpd/bftpd_2.i [2024-11-19 06:46:21,344 INFO L533 CDTParser]: Created temporary CDT project at NULL [2024-11-19 06:46:21,658 INFO L384 CDTParser]: Found 1 translation units. [2024-11-19 06:46:21,659 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/memsafety-bftpd/bftpd_2.i [2024-11-19 06:46:21,680 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/b3dc4e478/3e42ad8993d24a438049bd57fcc83e57/FLAG6659b3ea8 [2024-11-19 06:46:21,932 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/b3dc4e478/3e42ad8993d24a438049bd57fcc83e57 [2024-11-19 06:46:21,935 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2024-11-19 06:46:21,936 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2024-11-19 06:46:21,937 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2024-11-19 06:46:21,937 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2024-11-19 06:46:21,942 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2024-11-19 06:46:21,943 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 19.11 06:46:21" (1/1) ... [2024-11-19 06:46:21,944 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@78bda41f and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.11 06:46:21, skipping insertion in model container [2024-11-19 06:46:21,944 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 19.11 06:46:21" (1/1) ... [2024-11-19 06:46:21,991 INFO L175 MainTranslator]: Built tables and reachable declarations [2024-11-19 06:46:22,401 WARN L1070 CHandler]: saw a pointer cast to a type that we could not get a type size for, not adapting memory model [2024-11-19 06:46:22,408 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-11-19 06:46:22,430 INFO L200 MainTranslator]: Completed pre-run [2024-11-19 06:46:22,489 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-11-19 06:46:22,539 INFO L204 MainTranslator]: Completed translation [2024-11-19 06:46:22,540 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.11 06:46:22 WrapperNode [2024-11-19 06:46:22,540 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2024-11-19 06:46:22,541 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2024-11-19 06:46:22,542 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2024-11-19 06:46:22,543 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2024-11-19 06:46:22,551 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.11 06:46:22" (1/1) ... [2024-11-19 06:46:22,577 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.11 06:46:22" (1/1) ... [2024-11-19 06:46:22,616 INFO L138 Inliner]: procedures = 169, calls = 42, calls flagged for inlining = 5, calls inlined = 5, statements flattened = 96 [2024-11-19 06:46:22,616 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2024-11-19 06:46:22,617 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2024-11-19 06:46:22,617 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2024-11-19 06:46:22,617 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2024-11-19 06:46:22,629 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.11 06:46:22" (1/1) ... [2024-11-19 06:46:22,630 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.11 06:46:22" (1/1) ... [2024-11-19 06:46:22,633 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.11 06:46:22" (1/1) ... [2024-11-19 06:46:22,661 INFO L175 MemorySlicer]: Split 24 memory accesses to 3 slices as follows [9, 6, 9]. 38 percent of accesses are in the largest equivalence class. The 21 initializations are split as follows [6, 6, 9]. The 0 writes are split as follows [0, 0, 0]. [2024-11-19 06:46:22,661 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.11 06:46:22" (1/1) ... [2024-11-19 06:46:22,662 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.11 06:46:22" (1/1) ... [2024-11-19 06:46:22,673 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.11 06:46:22" (1/1) ... [2024-11-19 06:46:22,679 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.11 06:46:22" (1/1) ... [2024-11-19 06:46:22,685 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.11 06:46:22" (1/1) ... [2024-11-19 06:46:22,687 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.11 06:46:22" (1/1) ... [2024-11-19 06:46:22,694 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2024-11-19 06:46:22,695 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2024-11-19 06:46:22,698 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2024-11-19 06:46:22,698 INFO L274 PluginConnector]: RCFGBuilder initialized [2024-11-19 06:46:22,699 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.11 06:46:22" (1/1) ... [2024-11-19 06:46:22,722 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-11-19 06:46:22,734 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-19 06:46:22,751 INFO L229 MonitoredProcess]: Starting monitored process 1 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (exit command is (exit), workingDir is null) [2024-11-19 06:46:22,755 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Waiting until timeout for monitored process [2024-11-19 06:46:22,808 INFO L130 BoogieDeclarations]: Found specification of procedure read~intINTTYPE1#0 [2024-11-19 06:46:22,808 INFO L130 BoogieDeclarations]: Found specification of procedure read~intINTTYPE1#1 [2024-11-19 06:46:22,809 INFO L130 BoogieDeclarations]: Found specification of procedure read~intINTTYPE1#2 [2024-11-19 06:46:22,809 INFO L130 BoogieDeclarations]: Found specification of procedure parse_input [2024-11-19 06:46:22,809 INFO L138 BoogieDeclarations]: Found implementation of procedure parse_input [2024-11-19 06:46:22,810 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnHeap [2024-11-19 06:46:22,810 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2024-11-19 06:46:22,811 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$#0 [2024-11-19 06:46:22,812 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$#1 [2024-11-19 06:46:22,812 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$#2 [2024-11-19 06:46:22,812 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2024-11-19 06:46:22,812 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~$Pointer$#0 [2024-11-19 06:46:22,813 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~$Pointer$#1 [2024-11-19 06:46:22,813 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~$Pointer$#2 [2024-11-19 06:46:22,813 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE1#0 [2024-11-19 06:46:22,813 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE1#1 [2024-11-19 06:46:22,813 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE1#2 [2024-11-19 06:46:22,813 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2024-11-19 06:46:22,813 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2024-11-19 06:46:22,951 INFO L238 CfgBuilder]: Building ICFG [2024-11-19 06:46:22,953 INFO L264 CfgBuilder]: Building CFG for each procedure with an implementation [2024-11-19 06:46:23,281 INFO L? ?]: Removed 34 outVars from TransFormulas that were not future-live. [2024-11-19 06:46:23,282 INFO L287 CfgBuilder]: Performing block encoding [2024-11-19 06:46:23,299 INFO L311 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2024-11-19 06:46:23,301 INFO L316 CfgBuilder]: Removed 1 assume(true) statements. [2024-11-19 06:46:23,301 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 19.11 06:46:23 BoogieIcfgContainer [2024-11-19 06:46:23,302 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2024-11-19 06:46:23,304 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2024-11-19 06:46:23,304 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2024-11-19 06:46:23,309 INFO L274 PluginConnector]: TraceAbstraction initialized [2024-11-19 06:46:23,310 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 19.11 06:46:21" (1/3) ... [2024-11-19 06:46:23,310 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@581a288f and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 19.11 06:46:23, skipping insertion in model container [2024-11-19 06:46:23,311 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.11 06:46:22" (2/3) ... [2024-11-19 06:46:23,312 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@581a288f and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 19.11 06:46:23, skipping insertion in model container [2024-11-19 06:46:23,312 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 19.11 06:46:23" (3/3) ... [2024-11-19 06:46:23,313 INFO L112 eAbstractionObserver]: Analyzing ICFG bftpd_2.i [2024-11-19 06:46:23,332 INFO L214 ceAbstractionStarter]: Automizer settings: Hoare:None NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2024-11-19 06:46:23,333 INFO L154 ceAbstractionStarter]: Applying trace abstraction to program that has 20 error locations. [2024-11-19 06:46:23,392 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2024-11-19 06:46:23,402 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;@2ed58f22, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2024-11-19 06:46:23,402 INFO L334 AbstractCegarLoop]: Starting to check reachability of 20 error locations. [2024-11-19 06:46:23,407 INFO L276 IsEmpty]: Start isEmpty. Operand has 62 states, 37 states have (on average 1.7567567567567568) internal successors, (65), 57 states have internal predecessors, (65), 3 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) [2024-11-19 06:46:23,416 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 7 [2024-11-19 06:46:23,416 INFO L207 NwaCegarLoop]: Found error trace [2024-11-19 06:46:23,416 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1] [2024-11-19 06:46:23,417 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting parse_inputErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [parse_inputErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, parse_inputErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, parse_inputErr2ASSERT_VIOLATIONMEMORY_DEREFERENCE (and 17 more)] === [2024-11-19 06:46:23,422 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-19 06:46:23,424 INFO L85 PathProgramCache]: Analyzing trace with hash -742866944, now seen corresponding path program 1 times [2024-11-19 06:46:23,438 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-11-19 06:46:23,439 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [2081188140] [2024-11-19 06:46:23,439 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-19 06:46:23,439 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-11-19 06:46:23,439 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-11-19 06:46:23,444 INFO L229 MonitoredProcess]: Starting monitored process 2 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2024-11-19 06:46:23,446 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (2)] Waiting until timeout for monitored process [2024-11-19 06:46:23,574 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-19 06:46:23,582 INFO L255 TraceCheckSpWp]: Trace formula consists of 65 conjuncts, 5 conjuncts are in the unsatisfiable core [2024-11-19 06:46:23,588 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-19 06:46:23,745 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-19 06:46:23,745 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-11-19 06:46:23,746 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-11-19 06:46:23,746 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [2081188140] [2024-11-19 06:46:23,747 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [2081188140] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-19 06:46:23,747 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-19 06:46:23,748 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2024-11-19 06:46:23,750 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1022795319] [2024-11-19 06:46:23,751 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-19 06:46:23,755 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-19 06:46:23,756 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-11-19 06:46:23,783 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-19 06:46:23,784 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-19 06:46:23,787 INFO L87 Difference]: Start difference. First operand has 62 states, 37 states have (on average 1.7567567567567568) internal successors, (65), 57 states have internal predecessors, (65), 3 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) Second operand has 3 states, 2 states have (on average 2.5) internal successors, (5), 2 states have internal predecessors, (5), 1 states have call successors, (1), 1 states have call predecessors, (1), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-19 06:46:23,970 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-19 06:46:23,971 INFO L93 Difference]: Finished difference Result 112 states and 130 transitions. [2024-11-19 06:46:23,973 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-19 06:46:23,974 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 2 states have (on average 2.5) internal successors, (5), 2 states have internal predecessors, (5), 1 states have call successors, (1), 1 states have call predecessors, (1), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 6 [2024-11-19 06:46:23,974 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-19 06:46:23,986 INFO L225 Difference]: With dead ends: 112 [2024-11-19 06:46:23,987 INFO L226 Difference]: Without dead ends: 108 [2024-11-19 06:46:23,989 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-19 06:46:23,992 INFO L432 NwaCegarLoop]: 59 mSDtfsCounter, 53 mSDsluCounter, 44 mSDsCounter, 0 mSdLazyCounter, 43 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 53 SdHoareTripleChecker+Valid, 103 SdHoareTripleChecker+Invalid, 46 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 43 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-11-19 06:46:23,995 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [53 Valid, 103 Invalid, 46 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 43 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-11-19 06:46:24,014 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 108 states. [2024-11-19 06:46:24,039 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 108 to 86. [2024-11-19 06:46:24,041 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 86 states, 59 states have (on average 1.6779661016949152) internal successors, (99), 78 states have internal predecessors, (99), 5 states have call successors, (5), 2 states have call predecessors, (5), 2 states have return successors, (8), 5 states have call predecessors, (8), 5 states have call successors, (8) [2024-11-19 06:46:24,044 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 86 states to 86 states and 112 transitions. [2024-11-19 06:46:24,048 INFO L78 Accepts]: Start accepts. Automaton has 86 states and 112 transitions. Word has length 6 [2024-11-19 06:46:24,048 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-19 06:46:24,048 INFO L471 AbstractCegarLoop]: Abstraction has 86 states and 112 transitions. [2024-11-19 06:46:24,048 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 2 states have (on average 2.5) internal successors, (5), 2 states have internal predecessors, (5), 1 states have call successors, (1), 1 states have call predecessors, (1), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-19 06:46:24,048 INFO L276 IsEmpty]: Start isEmpty. Operand 86 states and 112 transitions. [2024-11-19 06:46:24,049 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 7 [2024-11-19 06:46:24,049 INFO L207 NwaCegarLoop]: Found error trace [2024-11-19 06:46:24,049 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1] [2024-11-19 06:46:24,053 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (2)] Ended with exit code 0 [2024-11-19 06:46:24,249 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 2 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-11-19 06:46:24,250 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting parse_inputErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [parse_inputErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, parse_inputErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, parse_inputErr2ASSERT_VIOLATIONMEMORY_DEREFERENCE (and 17 more)] === [2024-11-19 06:46:24,251 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-19 06:46:24,251 INFO L85 PathProgramCache]: Analyzing trace with hash -742866943, now seen corresponding path program 1 times [2024-11-19 06:46:24,251 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-11-19 06:46:24,251 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [492122114] [2024-11-19 06:46:24,252 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-19 06:46:24,252 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-11-19 06:46:24,252 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-11-19 06:46:24,253 INFO L229 MonitoredProcess]: Starting monitored process 3 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2024-11-19 06:46:24,255 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (3)] Waiting until timeout for monitored process [2024-11-19 06:46:24,333 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-19 06:46:24,337 INFO L255 TraceCheckSpWp]: Trace formula consists of 65 conjuncts, 7 conjuncts are in the unsatisfiable core [2024-11-19 06:46:24,338 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-19 06:46:24,428 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-19 06:46:24,428 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-11-19 06:46:24,428 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-11-19 06:46:24,429 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [492122114] [2024-11-19 06:46:24,429 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [492122114] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-19 06:46:24,429 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-19 06:46:24,429 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-11-19 06:46:24,429 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [241589181] [2024-11-19 06:46:24,430 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-19 06:46:24,431 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-11-19 06:46:24,431 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-11-19 06:46:24,432 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-11-19 06:46:24,432 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2024-11-19 06:46:24,432 INFO L87 Difference]: Start difference. First operand 86 states and 112 transitions. Second operand has 4 states, 3 states have (on average 1.6666666666666667) internal successors, (5), 3 states have internal predecessors, (5), 1 states have call successors, (1), 1 states have call predecessors, (1), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-19 06:46:24,613 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-19 06:46:24,614 INFO L93 Difference]: Finished difference Result 184 states and 246 transitions. [2024-11-19 06:46:24,614 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-11-19 06:46:24,614 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 3 states have (on average 1.6666666666666667) internal successors, (5), 3 states have internal predecessors, (5), 1 states have call successors, (1), 1 states have call predecessors, (1), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 6 [2024-11-19 06:46:24,615 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-19 06:46:24,616 INFO L225 Difference]: With dead ends: 184 [2024-11-19 06:46:24,617 INFO L226 Difference]: Without dead ends: 184 [2024-11-19 06:46:24,617 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2024-11-19 06:46:24,618 INFO L432 NwaCegarLoop]: 60 mSDtfsCounter, 87 mSDsluCounter, 80 mSDsCounter, 0 mSdLazyCounter, 57 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 87 SdHoareTripleChecker+Valid, 140 SdHoareTripleChecker+Invalid, 60 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 57 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2024-11-19 06:46:24,618 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [87 Valid, 140 Invalid, 60 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 57 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2024-11-19 06:46:24,625 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 184 states. [2024-11-19 06:46:24,656 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 184 to 156. [2024-11-19 06:46:24,659 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 156 states, 123 states have (on average 1.7154471544715446) internal successors, (211), 142 states have internal predecessors, (211), 9 states have call successors, (9), 4 states have call predecessors, (9), 4 states have return successors, (22), 9 states have call predecessors, (22), 9 states have call successors, (22) [2024-11-19 06:46:24,666 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 156 states to 156 states and 242 transitions. [2024-11-19 06:46:24,666 INFO L78 Accepts]: Start accepts. Automaton has 156 states and 242 transitions. Word has length 6 [2024-11-19 06:46:24,666 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-19 06:46:24,666 INFO L471 AbstractCegarLoop]: Abstraction has 156 states and 242 transitions. [2024-11-19 06:46:24,667 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 3 states have (on average 1.6666666666666667) internal successors, (5), 3 states have internal predecessors, (5), 1 states have call successors, (1), 1 states have call predecessors, (1), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-19 06:46:24,667 INFO L276 IsEmpty]: Start isEmpty. Operand 156 states and 242 transitions. [2024-11-19 06:46:24,667 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 8 [2024-11-19 06:46:24,671 INFO L207 NwaCegarLoop]: Found error trace [2024-11-19 06:46:24,671 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1] [2024-11-19 06:46:24,676 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (3)] Ended with exit code 0 [2024-11-19 06:46:24,872 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 3 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-11-19 06:46:24,873 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting parse_inputErr2ASSERT_VIOLATIONMEMORY_DEREFERENCE === [parse_inputErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, parse_inputErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, parse_inputErr2ASSERT_VIOLATIONMEMORY_DEREFERENCE (and 17 more)] === [2024-11-19 06:46:24,873 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-19 06:46:24,873 INFO L85 PathProgramCache]: Analyzing trace with hash -1554038803, now seen corresponding path program 1 times [2024-11-19 06:46:24,874 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-11-19 06:46:24,874 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1287466302] [2024-11-19 06:46:24,874 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-19 06:46:24,874 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-11-19 06:46:24,875 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-11-19 06:46:24,876 INFO L229 MonitoredProcess]: Starting monitored process 4 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2024-11-19 06:46:24,878 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (4)] Waiting until timeout for monitored process [2024-11-19 06:46:24,934 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-19 06:46:24,936 INFO L255 TraceCheckSpWp]: Trace formula consists of 71 conjuncts, 8 conjuncts are in the unsatisfiable core [2024-11-19 06:46:24,937 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-19 06:46:25,071 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-19 06:46:25,071 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-11-19 06:46:25,071 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-11-19 06:46:25,072 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1287466302] [2024-11-19 06:46:25,072 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1287466302] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-19 06:46:25,072 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-19 06:46:25,072 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-11-19 06:46:25,073 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1608222738] [2024-11-19 06:46:25,073 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-19 06:46:25,073 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2024-11-19 06:46:25,074 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-11-19 06:46:25,074 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2024-11-19 06:46:25,074 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2024-11-19 06:46:25,075 INFO L87 Difference]: Start difference. First operand 156 states and 242 transitions. Second operand has 5 states, 4 states have (on average 1.5) internal successors, (6), 4 states have internal predecessors, (6), 1 states have call successors, (1), 1 states have call predecessors, (1), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-19 06:46:25,307 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-19 06:46:25,308 INFO L93 Difference]: Finished difference Result 196 states and 281 transitions. [2024-11-19 06:46:25,308 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-11-19 06:46:25,309 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 4 states have (on average 1.5) internal successors, (6), 4 states have internal predecessors, (6), 1 states have call successors, (1), 1 states have call predecessors, (1), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 7 [2024-11-19 06:46:25,309 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-19 06:46:25,312 INFO L225 Difference]: With dead ends: 196 [2024-11-19 06:46:25,312 INFO L226 Difference]: Without dead ends: 196 [2024-11-19 06:46:25,312 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=13, Invalid=17, Unknown=0, NotChecked=0, Total=30 [2024-11-19 06:46:25,316 INFO L432 NwaCegarLoop]: 52 mSDtfsCounter, 81 mSDsluCounter, 110 mSDsCounter, 0 mSdLazyCounter, 116 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 81 SdHoareTripleChecker+Valid, 162 SdHoareTripleChecker+Invalid, 118 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 116 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2024-11-19 06:46:25,316 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [81 Valid, 162 Invalid, 118 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 116 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2024-11-19 06:46:25,317 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 196 states. [2024-11-19 06:46:25,339 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 196 to 159. [2024-11-19 06:46:25,340 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 159 states, 126 states have (on average 1.6984126984126984) internal successors, (214), 145 states have internal predecessors, (214), 9 states have call successors, (9), 4 states have call predecessors, (9), 4 states have return successors, (22), 9 states have call predecessors, (22), 9 states have call successors, (22) [2024-11-19 06:46:25,342 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 159 states to 159 states and 245 transitions. [2024-11-19 06:46:25,346 INFO L78 Accepts]: Start accepts. Automaton has 159 states and 245 transitions. Word has length 7 [2024-11-19 06:46:25,346 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-19 06:46:25,346 INFO L471 AbstractCegarLoop]: Abstraction has 159 states and 245 transitions. [2024-11-19 06:46:25,346 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 4 states have (on average 1.5) internal successors, (6), 4 states have internal predecessors, (6), 1 states have call successors, (1), 1 states have call predecessors, (1), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-19 06:46:25,347 INFO L276 IsEmpty]: Start isEmpty. Operand 159 states and 245 transitions. [2024-11-19 06:46:25,347 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 9 [2024-11-19 06:46:25,347 INFO L207 NwaCegarLoop]: Found error trace [2024-11-19 06:46:25,347 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1] [2024-11-19 06:46:25,351 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (4)] Ended with exit code 0 [2024-11-19 06:46:25,547 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 4 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-11-19 06:46:25,548 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting parse_inputErr3ASSERT_VIOLATIONMEMORY_DEREFERENCE === [parse_inputErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, parse_inputErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, parse_inputErr2ASSERT_VIOLATIONMEMORY_DEREFERENCE (and 17 more)] === [2024-11-19 06:46:25,549 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-19 06:46:25,549 INFO L85 PathProgramCache]: Analyzing trace with hash -930562592, now seen corresponding path program 1 times [2024-11-19 06:46:25,549 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-11-19 06:46:25,549 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [603237584] [2024-11-19 06:46:25,550 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-19 06:46:25,550 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-11-19 06:46:25,550 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-11-19 06:46:25,556 INFO L229 MonitoredProcess]: Starting monitored process 5 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2024-11-19 06:46:25,557 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (5)] Waiting until timeout for monitored process [2024-11-19 06:46:25,612 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-19 06:46:25,614 INFO L255 TraceCheckSpWp]: Trace formula consists of 72 conjuncts, 10 conjuncts are in the unsatisfiable core [2024-11-19 06:46:25,624 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-19 06:46:25,804 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-19 06:46:25,804 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-11-19 06:46:25,804 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-11-19 06:46:25,806 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [603237584] [2024-11-19 06:46:25,806 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [603237584] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-19 06:46:25,806 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-19 06:46:25,806 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-11-19 06:46:25,807 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1191564900] [2024-11-19 06:46:25,807 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-19 06:46:25,807 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2024-11-19 06:46:25,807 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-11-19 06:46:25,808 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2024-11-19 06:46:25,808 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2024-11-19 06:46:25,810 INFO L87 Difference]: Start difference. First operand 159 states and 245 transitions. Second operand has 5 states, 4 states have (on average 1.75) internal successors, (7), 4 states have internal predecessors, (7), 1 states have call successors, (1), 1 states have call predecessors, (1), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-19 06:46:26,059 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-19 06:46:26,059 INFO L93 Difference]: Finished difference Result 186 states and 247 transitions. [2024-11-19 06:46:26,060 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-11-19 06:46:26,060 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 4 states have (on average 1.75) internal successors, (7), 4 states have internal predecessors, (7), 1 states have call successors, (1), 1 states have call predecessors, (1), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 8 [2024-11-19 06:46:26,060 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-19 06:46:26,061 INFO L225 Difference]: With dead ends: 186 [2024-11-19 06:46:26,062 INFO L226 Difference]: Without dead ends: 186 [2024-11-19 06:46:26,062 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=13, Invalid=17, Unknown=0, NotChecked=0, Total=30 [2024-11-19 06:46:26,063 INFO L432 NwaCegarLoop]: 59 mSDtfsCounter, 69 mSDsluCounter, 146 mSDsCounter, 0 mSdLazyCounter, 92 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 69 SdHoareTripleChecker+Valid, 205 SdHoareTripleChecker+Invalid, 92 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 92 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2024-11-19 06:46:26,063 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [69 Valid, 205 Invalid, 92 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 92 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2024-11-19 06:46:26,064 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 186 states. [2024-11-19 06:46:26,080 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 186 to 159. [2024-11-19 06:46:26,081 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 159 states, 126 states have (on average 1.6825396825396826) internal successors, (212), 145 states have internal predecessors, (212), 9 states have call successors, (9), 4 states have call predecessors, (9), 4 states have return successors, (22), 9 states have call predecessors, (22), 9 states have call successors, (22) [2024-11-19 06:46:26,082 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 159 states to 159 states and 243 transitions. [2024-11-19 06:46:26,083 INFO L78 Accepts]: Start accepts. Automaton has 159 states and 243 transitions. Word has length 8 [2024-11-19 06:46:26,083 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-19 06:46:26,083 INFO L471 AbstractCegarLoop]: Abstraction has 159 states and 243 transitions. [2024-11-19 06:46:26,083 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 4 states have (on average 1.75) internal successors, (7), 4 states have internal predecessors, (7), 1 states have call successors, (1), 1 states have call predecessors, (1), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-19 06:46:26,083 INFO L276 IsEmpty]: Start isEmpty. Operand 159 states and 243 transitions. [2024-11-19 06:46:26,083 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 10 [2024-11-19 06:46:26,083 INFO L207 NwaCegarLoop]: Found error trace [2024-11-19 06:46:26,084 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-19 06:46:26,091 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (5)] Ended with exit code 0 [2024-11-19 06:46:26,284 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 5 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-11-19 06:46:26,284 INFO L396 AbstractCegarLoop]: === Iteration 5 === Targeting parse_inputErr4ASSERT_VIOLATIONMEMORY_DEREFERENCE === [parse_inputErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, parse_inputErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, parse_inputErr2ASSERT_VIOLATIONMEMORY_DEREFERENCE (and 17 more)] === [2024-11-19 06:46:26,285 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-19 06:46:26,285 INFO L85 PathProgramCache]: Analyzing trace with hash 1217330767, now seen corresponding path program 1 times [2024-11-19 06:46:26,285 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-11-19 06:46:26,285 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1659135046] [2024-11-19 06:46:26,285 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-19 06:46:26,286 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-11-19 06:46:26,286 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-11-19 06:46:26,287 INFO L229 MonitoredProcess]: Starting monitored process 6 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2024-11-19 06:46:26,289 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (6)] Waiting until timeout for monitored process [2024-11-19 06:46:26,336 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-19 06:46:26,340 INFO L255 TraceCheckSpWp]: Trace formula consists of 74 conjuncts, 6 conjuncts are in the unsatisfiable core [2024-11-19 06:46:26,341 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-19 06:46:26,410 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-19 06:46:26,411 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-11-19 06:46:26,411 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-11-19 06:46:26,411 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1659135046] [2024-11-19 06:46:26,411 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1659135046] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-19 06:46:26,412 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-19 06:46:26,412 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-11-19 06:46:26,412 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [819622222] [2024-11-19 06:46:26,412 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-19 06:46:26,412 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2024-11-19 06:46:26,412 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-11-19 06:46:26,413 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2024-11-19 06:46:26,413 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2024-11-19 06:46:26,413 INFO L87 Difference]: Start difference. First operand 159 states and 243 transitions. Second operand has 5 states, 4 states have (on average 2.0) internal successors, (8), 3 states have internal predecessors, (8), 1 states have call successors, (1), 1 states have call predecessors, (1), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-19 06:46:26,567 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-19 06:46:26,567 INFO L93 Difference]: Finished difference Result 239 states and 326 transitions. [2024-11-19 06:46:26,568 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-11-19 06:46:26,568 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 4 states have (on average 2.0) internal successors, (8), 3 states have internal predecessors, (8), 1 states have call successors, (1), 1 states have call predecessors, (1), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 9 [2024-11-19 06:46:26,568 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-19 06:46:26,570 INFO L225 Difference]: With dead ends: 239 [2024-11-19 06:46:26,570 INFO L226 Difference]: Without dead ends: 239 [2024-11-19 06:46:26,570 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 5 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=14, Invalid=16, Unknown=0, NotChecked=0, Total=30 [2024-11-19 06:46:26,571 INFO L432 NwaCegarLoop]: 53 mSDtfsCounter, 136 mSDsluCounter, 143 mSDsCounter, 0 mSdLazyCounter, 93 mSolverCounterSat, 4 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 136 SdHoareTripleChecker+Valid, 196 SdHoareTripleChecker+Invalid, 97 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 4 IncrementalHoareTripleChecker+Valid, 93 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-11-19 06:46:26,573 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [136 Valid, 196 Invalid, 97 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [4 Valid, 93 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-11-19 06:46:26,574 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 239 states. [2024-11-19 06:46:26,581 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 239 to 196. [2024-11-19 06:46:26,582 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 196 states, 161 states have (on average 1.6335403726708075) internal successors, (263), 181 states have internal predecessors, (263), 9 states have call successors, (9), 5 states have call predecessors, (9), 6 states have return successors, (22), 9 states have call predecessors, (22), 9 states have call successors, (22) [2024-11-19 06:46:26,584 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 196 states to 196 states and 294 transitions. [2024-11-19 06:46:26,584 INFO L78 Accepts]: Start accepts. Automaton has 196 states and 294 transitions. Word has length 9 [2024-11-19 06:46:26,584 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-19 06:46:26,584 INFO L471 AbstractCegarLoop]: Abstraction has 196 states and 294 transitions. [2024-11-19 06:46:26,584 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 4 states have (on average 2.0) internal successors, (8), 3 states have internal predecessors, (8), 1 states have call successors, (1), 1 states have call predecessors, (1), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-19 06:46:26,585 INFO L276 IsEmpty]: Start isEmpty. Operand 196 states and 294 transitions. [2024-11-19 06:46:26,585 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 11 [2024-11-19 06:46:26,585 INFO L207 NwaCegarLoop]: Found error trace [2024-11-19 06:46:26,585 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-19 06:46:26,591 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (6)] Ended with exit code 0 [2024-11-19 06:46:26,788 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 6 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-11-19 06:46:26,789 INFO L396 AbstractCegarLoop]: === Iteration 6 === Targeting parse_inputErr5ASSERT_VIOLATIONMEMORY_DEREFERENCE === [parse_inputErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, parse_inputErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, parse_inputErr2ASSERT_VIOLATIONMEMORY_DEREFERENCE (and 17 more)] === [2024-11-19 06:46:26,789 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-19 06:46:26,789 INFO L85 PathProgramCache]: Analyzing trace with hash -917451838, now seen corresponding path program 1 times [2024-11-19 06:46:26,789 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-11-19 06:46:26,790 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [54109334] [2024-11-19 06:46:26,790 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-19 06:46:26,790 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-11-19 06:46:26,790 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-11-19 06:46:26,793 INFO L229 MonitoredProcess]: Starting monitored process 7 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2024-11-19 06:46:26,794 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (7)] Waiting until timeout for monitored process [2024-11-19 06:46:26,846 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-19 06:46:26,850 INFO L255 TraceCheckSpWp]: Trace formula consists of 75 conjuncts, 8 conjuncts are in the unsatisfiable core [2024-11-19 06:46:26,852 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-19 06:46:26,959 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-19 06:46:26,960 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-11-19 06:46:26,960 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-11-19 06:46:26,960 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [54109334] [2024-11-19 06:46:26,960 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [54109334] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-19 06:46:26,960 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-19 06:46:26,960 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-11-19 06:46:26,961 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1872048773] [2024-11-19 06:46:26,961 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-19 06:46:26,961 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2024-11-19 06:46:26,961 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-11-19 06:46:26,962 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2024-11-19 06:46:26,962 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2024-11-19 06:46:26,962 INFO L87 Difference]: Start difference. First operand 196 states and 294 transitions. Second operand has 5 states, 4 states have (on average 2.25) internal successors, (9), 3 states have internal predecessors, (9), 1 states have call successors, (1), 1 states have call predecessors, (1), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-19 06:46:27,140 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-19 06:46:27,140 INFO L93 Difference]: Finished difference Result 236 states and 309 transitions. [2024-11-19 06:46:27,141 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-11-19 06:46:27,142 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 4 states have (on average 2.25) internal successors, (9), 3 states have internal predecessors, (9), 1 states have call successors, (1), 1 states have call predecessors, (1), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 10 [2024-11-19 06:46:27,142 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-19 06:46:27,143 INFO L225 Difference]: With dead ends: 236 [2024-11-19 06:46:27,143 INFO L226 Difference]: Without dead ends: 236 [2024-11-19 06:46:27,143 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 6 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=14, Invalid=16, Unknown=0, NotChecked=0, Total=30 [2024-11-19 06:46:27,144 INFO L432 NwaCegarLoop]: 60 mSDtfsCounter, 125 mSDsluCounter, 168 mSDsCounter, 0 mSdLazyCounter, 72 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 125 SdHoareTripleChecker+Valid, 228 SdHoareTripleChecker+Invalid, 73 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 72 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2024-11-19 06:46:27,144 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [125 Valid, 228 Invalid, 73 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 72 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2024-11-19 06:46:27,147 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 236 states. [2024-11-19 06:46:27,156 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 236 to 206. [2024-11-19 06:46:27,160 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 206 states, 170 states have (on average 1.6235294117647059) internal successors, (276), 191 states have internal predecessors, (276), 9 states have call successors, (9), 5 states have call predecessors, (9), 7 states have return successors, (22), 9 states have call predecessors, (22), 9 states have call successors, (22) [2024-11-19 06:46:27,161 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 206 states to 206 states and 307 transitions. [2024-11-19 06:46:27,162 INFO L78 Accepts]: Start accepts. Automaton has 206 states and 307 transitions. Word has length 10 [2024-11-19 06:46:27,162 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-19 06:46:27,162 INFO L471 AbstractCegarLoop]: Abstraction has 206 states and 307 transitions. [2024-11-19 06:46:27,162 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 4 states have (on average 2.25) internal successors, (9), 3 states have internal predecessors, (9), 1 states have call successors, (1), 1 states have call predecessors, (1), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-19 06:46:27,162 INFO L276 IsEmpty]: Start isEmpty. Operand 206 states and 307 transitions. [2024-11-19 06:46:27,162 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 15 [2024-11-19 06:46:27,163 INFO L207 NwaCegarLoop]: Found error trace [2024-11-19 06:46:27,163 INFO L215 NwaCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-19 06:46:27,167 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (7)] Ended with exit code 0 [2024-11-19 06:46:27,363 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 7 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-11-19 06:46:27,364 INFO L396 AbstractCegarLoop]: === Iteration 7 === Targeting parse_inputErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [parse_inputErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, parse_inputErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, parse_inputErr2ASSERT_VIOLATIONMEMORY_DEREFERENCE (and 17 more)] === [2024-11-19 06:46:27,364 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-19 06:46:27,364 INFO L85 PathProgramCache]: Analyzing trace with hash -657083128, now seen corresponding path program 1 times [2024-11-19 06:46:27,364 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-11-19 06:46:27,364 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1533138889] [2024-11-19 06:46:27,365 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-19 06:46:27,365 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-11-19 06:46:27,365 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-11-19 06:46:27,366 INFO L229 MonitoredProcess]: Starting monitored process 8 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2024-11-19 06:46:27,367 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (8)] Waiting until timeout for monitored process [2024-11-19 06:46:27,420 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-19 06:46:27,422 INFO L255 TraceCheckSpWp]: Trace formula consists of 80 conjuncts, 8 conjuncts are in the unsatisfiable core [2024-11-19 06:46:27,424 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-19 06:46:27,601 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-19 06:46:27,601 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-11-19 06:46:27,872 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-19 06:46:27,873 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-11-19 06:46:27,873 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1533138889] [2024-11-19 06:46:27,873 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1533138889] provided 0 perfect and 2 imperfect interpolant sequences [2024-11-19 06:46:27,873 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2024-11-19 06:46:27,873 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [3, 3] total 6 [2024-11-19 06:46:27,873 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2112660260] [2024-11-19 06:46:27,873 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2024-11-19 06:46:27,874 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2024-11-19 06:46:27,874 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-11-19 06:46:27,874 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2024-11-19 06:46:27,875 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=21, Invalid=35, Unknown=0, NotChecked=0, Total=56 [2024-11-19 06:46:27,875 INFO L87 Difference]: Start difference. First operand 206 states and 307 transitions. Second operand has 8 states, 7 states have (on average 3.7142857142857144) internal successors, (26), 7 states have internal predecessors, (26), 2 states have call successors, (2), 2 states have call predecessors, (2), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-19 06:46:28,236 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-19 06:46:28,236 INFO L93 Difference]: Finished difference Result 274 states and 364 transitions. [2024-11-19 06:46:28,237 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2024-11-19 06:46:28,237 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 7 states have (on average 3.7142857142857144) internal successors, (26), 7 states have internal predecessors, (26), 2 states have call successors, (2), 2 states have call predecessors, (2), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 14 [2024-11-19 06:46:28,237 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-19 06:46:28,238 INFO L225 Difference]: With dead ends: 274 [2024-11-19 06:46:28,238 INFO L226 Difference]: Without dead ends: 274 [2024-11-19 06:46:28,239 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 27 GetRequests, 20 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 9 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=28, Invalid=44, Unknown=0, NotChecked=0, Total=72 [2024-11-19 06:46:28,239 INFO L432 NwaCegarLoop]: 67 mSDtfsCounter, 165 mSDsluCounter, 214 mSDsCounter, 0 mSdLazyCounter, 158 mSolverCounterSat, 10 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 165 SdHoareTripleChecker+Valid, 281 SdHoareTripleChecker+Invalid, 168 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 10 IncrementalHoareTripleChecker+Valid, 158 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2024-11-19 06:46:28,239 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [165 Valid, 281 Invalid, 168 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [10 Valid, 158 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2024-11-19 06:46:28,240 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 274 states. [2024-11-19 06:46:28,246 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 274 to 236. [2024-11-19 06:46:28,247 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 236 states, 200 states have (on average 1.62) internal successors, (324), 221 states have internal predecessors, (324), 9 states have call successors, (9), 5 states have call predecessors, (9), 7 states have return successors, (22), 9 states have call predecessors, (22), 9 states have call successors, (22) [2024-11-19 06:46:28,250 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 236 states to 236 states and 355 transitions. [2024-11-19 06:46:28,250 INFO L78 Accepts]: Start accepts. Automaton has 236 states and 355 transitions. Word has length 14 [2024-11-19 06:46:28,250 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-19 06:46:28,250 INFO L471 AbstractCegarLoop]: Abstraction has 236 states and 355 transitions. [2024-11-19 06:46:28,251 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 7 states have (on average 3.7142857142857144) internal successors, (26), 7 states have internal predecessors, (26), 2 states have call successors, (2), 2 states have call predecessors, (2), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-19 06:46:28,251 INFO L276 IsEmpty]: Start isEmpty. Operand 236 states and 355 transitions. [2024-11-19 06:46:28,251 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 16 [2024-11-19 06:46:28,252 INFO L207 NwaCegarLoop]: Found error trace [2024-11-19 06:46:28,252 INFO L215 NwaCegarLoop]: trace histogram [2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-19 06:46:28,256 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (8)] Forceful destruction successful, exit code 0 [2024-11-19 06:46:28,455 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 8 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-11-19 06:46:28,455 INFO L396 AbstractCegarLoop]: === Iteration 8 === Targeting parse_inputErr2ASSERT_VIOLATIONMEMORY_DEREFERENCE === [parse_inputErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, parse_inputErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, parse_inputErr2ASSERT_VIOLATIONMEMORY_DEREFERENCE (and 17 more)] === [2024-11-19 06:46:28,456 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-19 06:46:28,456 INFO L85 PathProgramCache]: Analyzing trace with hash 1105259462, now seen corresponding path program 1 times [2024-11-19 06:46:28,456 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-11-19 06:46:28,456 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [96806646] [2024-11-19 06:46:28,457 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-19 06:46:28,457 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-11-19 06:46:28,457 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-11-19 06:46:28,460 INFO L229 MonitoredProcess]: Starting monitored process 9 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2024-11-19 06:46:28,461 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (9)] Waiting until timeout for monitored process [2024-11-19 06:46:28,522 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-19 06:46:28,524 INFO L255 TraceCheckSpWp]: Trace formula consists of 86 conjuncts, 9 conjuncts are in the unsatisfiable core [2024-11-19 06:46:28,526 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-19 06:46:28,739 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-19 06:46:28,739 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-11-19 06:46:28,869 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-19 06:46:28,870 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-11-19 06:46:28,870 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [96806646] [2024-11-19 06:46:28,870 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [96806646] provided 0 perfect and 2 imperfect interpolant sequences [2024-11-19 06:46:28,870 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2024-11-19 06:46:28,870 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [4, 4] total 8 [2024-11-19 06:46:28,871 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [14351304] [2024-11-19 06:46:28,871 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2024-11-19 06:46:28,871 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2024-11-19 06:46:28,871 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-11-19 06:46:28,872 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2024-11-19 06:46:28,872 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=25, Invalid=65, Unknown=0, NotChecked=0, Total=90 [2024-11-19 06:46:28,872 INFO L87 Difference]: Start difference. First operand 236 states and 355 transitions. Second operand has 10 states, 9 states have (on average 3.111111111111111) internal successors, (28), 9 states have internal predecessors, (28), 2 states have call successors, (2), 2 states have call predecessors, (2), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-19 06:46:29,269 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-19 06:46:29,270 INFO L93 Difference]: Finished difference Result 290 states and 411 transitions. [2024-11-19 06:46:29,270 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2024-11-19 06:46:29,270 INFO L78 Accepts]: Start accepts. Automaton has has 10 states, 9 states have (on average 3.111111111111111) internal successors, (28), 9 states have internal predecessors, (28), 2 states have call successors, (2), 2 states have call predecessors, (2), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 15 [2024-11-19 06:46:29,270 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-19 06:46:29,271 INFO L225 Difference]: With dead ends: 290 [2024-11-19 06:46:29,271 INFO L226 Difference]: Without dead ends: 290 [2024-11-19 06:46:29,272 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 31 GetRequests, 20 SyntacticMatches, 0 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 19 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=47, Invalid=109, Unknown=0, NotChecked=0, Total=156 [2024-11-19 06:46:29,272 INFO L432 NwaCegarLoop]: 56 mSDtfsCounter, 134 mSDsluCounter, 183 mSDsCounter, 0 mSdLazyCounter, 251 mSolverCounterSat, 11 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 134 SdHoareTripleChecker+Valid, 239 SdHoareTripleChecker+Invalid, 262 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 11 IncrementalHoareTripleChecker+Valid, 251 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2024-11-19 06:46:29,273 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [134 Valid, 239 Invalid, 262 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [11 Valid, 251 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2024-11-19 06:46:29,276 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 290 states. [2024-11-19 06:46:29,283 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 290 to 246. [2024-11-19 06:46:29,284 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 246 states, 210 states have (on average 1.6142857142857143) internal successors, (339), 231 states have internal predecessors, (339), 9 states have call successors, (9), 5 states have call predecessors, (9), 7 states have return successors, (22), 9 states have call predecessors, (22), 9 states have call successors, (22) [2024-11-19 06:46:29,287 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 246 states to 246 states and 370 transitions. [2024-11-19 06:46:29,287 INFO L78 Accepts]: Start accepts. Automaton has 246 states and 370 transitions. Word has length 15 [2024-11-19 06:46:29,287 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-19 06:46:29,287 INFO L471 AbstractCegarLoop]: Abstraction has 246 states and 370 transitions. [2024-11-19 06:46:29,287 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 9 states have (on average 3.111111111111111) internal successors, (28), 9 states have internal predecessors, (28), 2 states have call successors, (2), 2 states have call predecessors, (2), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-19 06:46:29,288 INFO L276 IsEmpty]: Start isEmpty. Operand 246 states and 370 transitions. [2024-11-19 06:46:29,288 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 17 [2024-11-19 06:46:29,288 INFO L207 NwaCegarLoop]: Found error trace [2024-11-19 06:46:29,288 INFO L215 NwaCegarLoop]: trace histogram [2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-19 06:46:29,291 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (9)] Forceful destruction successful, exit code 0 [2024-11-19 06:46:29,488 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 9 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-11-19 06:46:29,489 INFO L396 AbstractCegarLoop]: === Iteration 9 === Targeting parse_inputErr3ASSERT_VIOLATIONMEMORY_DEREFERENCE === [parse_inputErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, parse_inputErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, parse_inputErr2ASSERT_VIOLATIONMEMORY_DEREFERENCE (and 17 more)] === [2024-11-19 06:46:29,489 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-19 06:46:29,489 INFO L85 PathProgramCache]: Analyzing trace with hash -96695001, now seen corresponding path program 1 times [2024-11-19 06:46:29,490 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-11-19 06:46:29,490 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1690176473] [2024-11-19 06:46:29,490 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-19 06:46:29,490 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-11-19 06:46:29,490 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-11-19 06:46:29,492 INFO L229 MonitoredProcess]: Starting monitored process 10 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2024-11-19 06:46:29,494 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (10)] Waiting until timeout for monitored process [2024-11-19 06:46:29,548 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-19 06:46:29,550 INFO L255 TraceCheckSpWp]: Trace formula consists of 87 conjuncts, 11 conjuncts are in the unsatisfiable core [2024-11-19 06:46:29,552 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-19 06:46:29,874 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 4 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-19 06:46:29,875 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-11-19 06:46:30,044 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 4 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-19 06:46:30,045 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-11-19 06:46:30,045 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1690176473] [2024-11-19 06:46:30,045 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1690176473] provided 0 perfect and 2 imperfect interpolant sequences [2024-11-19 06:46:30,045 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2024-11-19 06:46:30,045 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [4, 4] total 8 [2024-11-19 06:46:30,045 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [515206464] [2024-11-19 06:46:30,045 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2024-11-19 06:46:30,045 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2024-11-19 06:46:30,046 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-11-19 06:46:30,046 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2024-11-19 06:46:30,046 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=25, Invalid=65, Unknown=0, NotChecked=0, Total=90 [2024-11-19 06:46:30,046 INFO L87 Difference]: Start difference. First operand 246 states and 370 transitions. Second operand has 10 states, 9 states have (on average 3.3333333333333335) internal successors, (30), 9 states have internal predecessors, (30), 2 states have call successors, (2), 2 states have call predecessors, (2), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-19 06:46:30,687 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-19 06:46:30,688 INFO L93 Difference]: Finished difference Result 421 states and 568 transitions. [2024-11-19 06:46:30,689 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2024-11-19 06:46:30,689 INFO L78 Accepts]: Start accepts. Automaton has has 10 states, 9 states have (on average 3.3333333333333335) internal successors, (30), 9 states have internal predecessors, (30), 2 states have call successors, (2), 2 states have call predecessors, (2), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 16 [2024-11-19 06:46:30,689 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-19 06:46:30,691 INFO L225 Difference]: With dead ends: 421 [2024-11-19 06:46:30,692 INFO L226 Difference]: Without dead ends: 421 [2024-11-19 06:46:30,692 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 34 GetRequests, 22 SyntacticMatches, 0 SemanticMatches, 12 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 28 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=51, Invalid=131, Unknown=0, NotChecked=0, Total=182 [2024-11-19 06:46:30,693 INFO L432 NwaCegarLoop]: 66 mSDtfsCounter, 230 mSDsluCounter, 355 mSDsCounter, 0 mSdLazyCounter, 370 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 230 SdHoareTripleChecker+Valid, 421 SdHoareTripleChecker+Invalid, 371 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 370 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.5s IncrementalHoareTripleChecker+Time [2024-11-19 06:46:30,693 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [230 Valid, 421 Invalid, 371 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 370 Invalid, 0 Unknown, 0 Unchecked, 0.5s Time] [2024-11-19 06:46:30,694 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 421 states. [2024-11-19 06:46:30,702 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 421 to 333. [2024-11-19 06:46:30,703 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 333 states, 293 states have (on average 1.6450511945392492) internal successors, (482), 314 states have internal predecessors, (482), 11 states have call successors, (11), 7 states have call predecessors, (11), 9 states have return successors, (31), 11 states have call predecessors, (31), 11 states have call successors, (31) [2024-11-19 06:46:30,706 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 333 states to 333 states and 524 transitions. [2024-11-19 06:46:30,706 INFO L78 Accepts]: Start accepts. Automaton has 333 states and 524 transitions. Word has length 16 [2024-11-19 06:46:30,706 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-19 06:46:30,706 INFO L471 AbstractCegarLoop]: Abstraction has 333 states and 524 transitions. [2024-11-19 06:46:30,707 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 9 states have (on average 3.3333333333333335) internal successors, (30), 9 states have internal predecessors, (30), 2 states have call successors, (2), 2 states have call predecessors, (2), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-19 06:46:30,707 INFO L276 IsEmpty]: Start isEmpty. Operand 333 states and 524 transitions. [2024-11-19 06:46:30,707 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 19 [2024-11-19 06:46:30,707 INFO L207 NwaCegarLoop]: Found error trace [2024-11-19 06:46:30,708 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-19 06:46:30,713 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (10)] Ended with exit code 0 [2024-11-19 06:46:30,908 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 10 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-11-19 06:46:30,908 INFO L396 AbstractCegarLoop]: === Iteration 10 === Targeting parse_inputErr10ASSERT_VIOLATIONMEMORY_FREE === [parse_inputErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, parse_inputErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, parse_inputErr2ASSERT_VIOLATIONMEMORY_DEREFERENCE (and 17 more)] === [2024-11-19 06:46:30,909 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-19 06:46:30,909 INFO L85 PathProgramCache]: Analyzing trace with hash -1930496503, now seen corresponding path program 1 times [2024-11-19 06:46:30,909 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-11-19 06:46:30,909 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1962036189] [2024-11-19 06:46:30,909 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-19 06:46:30,909 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-11-19 06:46:30,909 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-11-19 06:46:30,911 INFO L229 MonitoredProcess]: Starting monitored process 11 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2024-11-19 06:46:30,912 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (11)] Waiting until timeout for monitored process [2024-11-19 06:46:30,982 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-19 06:46:30,987 INFO L255 TraceCheckSpWp]: Trace formula consists of 98 conjuncts, 7 conjuncts are in the unsatisfiable core [2024-11-19 06:46:30,988 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-19 06:46:31,065 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-19 06:46:31,065 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-11-19 06:46:31,065 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-11-19 06:46:31,065 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1962036189] [2024-11-19 06:46:31,066 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1962036189] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-19 06:46:31,066 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-19 06:46:31,066 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-11-19 06:46:31,066 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2122524160] [2024-11-19 06:46:31,066 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-19 06:46:31,066 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-19 06:46:31,067 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-11-19 06:46:31,067 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-19 06:46:31,067 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-19 06:46:31,067 INFO L87 Difference]: Start difference. First operand 333 states and 524 transitions. Second operand has 3 states, 3 states have (on average 5.666666666666667) internal successors, (17), 2 states have internal predecessors, (17), 1 states have call successors, (1), 1 states have call predecessors, (1), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-19 06:46:31,100 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-19 06:46:31,100 INFO L93 Difference]: Finished difference Result 356 states and 525 transitions. [2024-11-19 06:46:31,101 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-19 06:46:31,101 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 5.666666666666667) internal successors, (17), 2 states have internal predecessors, (17), 1 states have call successors, (1), 1 states have call predecessors, (1), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 18 [2024-11-19 06:46:31,102 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-19 06:46:31,104 INFO L225 Difference]: With dead ends: 356 [2024-11-19 06:46:31,104 INFO L226 Difference]: Without dead ends: 356 [2024-11-19 06:46:31,104 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 17 GetRequests, 16 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-19 06:46:31,105 INFO L432 NwaCegarLoop]: 69 mSDtfsCounter, 28 mSDsluCounter, 49 mSDsCounter, 0 mSdLazyCounter, 18 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 28 SdHoareTripleChecker+Valid, 118 SdHoareTripleChecker+Invalid, 20 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 18 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-11-19 06:46:31,107 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [28 Valid, 118 Invalid, 20 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 18 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-11-19 06:46:31,108 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 356 states. [2024-11-19 06:46:31,115 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 356 to 345. [2024-11-19 06:46:31,116 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 345 states, 304 states have (on average 1.582236842105263) internal successors, (481), 325 states have internal predecessors, (481), 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-11-19 06:46:31,118 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 345 states to 345 states and 522 transitions. [2024-11-19 06:46:31,119 INFO L78 Accepts]: Start accepts. Automaton has 345 states and 522 transitions. Word has length 18 [2024-11-19 06:46:31,119 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-19 06:46:31,119 INFO L471 AbstractCegarLoop]: Abstraction has 345 states and 522 transitions. [2024-11-19 06:46:31,119 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 5.666666666666667) internal successors, (17), 2 states have internal predecessors, (17), 1 states have call successors, (1), 1 states have call predecessors, (1), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-19 06:46:31,119 INFO L276 IsEmpty]: Start isEmpty. Operand 345 states and 522 transitions. [2024-11-19 06:46:31,120 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2024-11-19 06:46:31,120 INFO L207 NwaCegarLoop]: Found error trace [2024-11-19 06:46:31,120 INFO L215 NwaCegarLoop]: trace histogram [3, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1] [2024-11-19 06:46:31,130 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (11)] Ended with exit code 0 [2024-11-19 06:46:31,324 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 11 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-11-19 06:46:31,324 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-11-19 06:46:31,324 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-19 06:46:31,325 INFO L85 PathProgramCache]: Analyzing trace with hash -1911770353, now seen corresponding path program 2 times [2024-11-19 06:46:31,325 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-11-19 06:46:31,325 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1016417720] [2024-11-19 06:46:31,325 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2024-11-19 06:46:31,325 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-11-19 06:46:31,325 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-11-19 06:46:31,326 INFO L229 MonitoredProcess]: Starting monitored process 12 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2024-11-19 06:46:31,327 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (12)] Waiting until timeout for monitored process [2024-11-19 06:46:31,384 INFO L227 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2024-11-19 06:46:31,384 INFO L228 tOrderPrioritization]: Conjunction of SSA is unsat [2024-11-19 06:46:31,385 INFO L255 TraceCheckSpWp]: Trace formula consists of 95 conjuncts, 10 conjuncts are in the unsatisfiable core [2024-11-19 06:46:31,387 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-19 06:46:31,655 INFO L134 CoverageAnalysis]: Checked inductivity of 12 backedges. 2 proven. 10 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-19 06:46:31,655 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-11-19 06:46:32,108 INFO L134 CoverageAnalysis]: Checked inductivity of 12 backedges. 0 proven. 12 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-19 06:46:32,108 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-11-19 06:46:32,108 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1016417720] [2024-11-19 06:46:32,108 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1016417720] provided 0 perfect and 2 imperfect interpolant sequences [2024-11-19 06:46:32,108 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2024-11-19 06:46:32,108 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [5, 5] total 10 [2024-11-19 06:46:32,108 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [66837298] [2024-11-19 06:46:32,109 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2024-11-19 06:46:32,109 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2024-11-19 06:46:32,109 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-11-19 06:46:32,111 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2024-11-19 06:46:32,111 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=32, Invalid=58, Unknown=0, NotChecked=0, Total=90 [2024-11-19 06:46:32,111 INFO L87 Difference]: Start difference. First operand 345 states and 522 transitions. Second operand has 10 states, 10 states have (on average 4.2) internal successors, (42), 10 states have internal predecessors, (42), 2 states have call successors, (2), 2 states have call predecessors, (2), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-19 06:46:32,865 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-19 06:46:32,865 INFO L93 Difference]: Finished difference Result 427 states and 640 transitions. [2024-11-19 06:46:32,865 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2024-11-19 06:46:32,865 INFO L78 Accepts]: Start accepts. Automaton has has 10 states, 10 states have (on average 4.2) internal successors, (42), 10 states have internal predecessors, (42), 2 states have call successors, (2), 2 states have call predecessors, (2), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 22 [2024-11-19 06:46:32,866 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-19 06:46:32,867 INFO L225 Difference]: With dead ends: 427 [2024-11-19 06:46:32,868 INFO L226 Difference]: Without dead ends: 427 [2024-11-19 06:46:32,868 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 44 GetRequests, 34 SyntacticMatches, 0 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 21 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=46, Invalid=86, Unknown=0, NotChecked=0, Total=132 [2024-11-19 06:46:32,868 INFO L432 NwaCegarLoop]: 63 mSDtfsCounter, 127 mSDsluCounter, 250 mSDsCounter, 0 mSdLazyCounter, 219 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.6s Time, 0 mProtectedPredicate, 0 mProtectedAction, 127 SdHoareTripleChecker+Valid, 313 SdHoareTripleChecker+Invalid, 222 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 219 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.7s IncrementalHoareTripleChecker+Time [2024-11-19 06:46:32,869 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [127 Valid, 313 Invalid, 222 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 219 Invalid, 0 Unknown, 0 Unchecked, 0.7s Time] [2024-11-19 06:46:32,869 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 427 states. [2024-11-19 06:46:32,877 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 427 to 391. [2024-11-19 06:46:32,878 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 391 states, 350 states have (on average 1.62) internal successors, (567), 371 states have internal predecessors, (567), 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-11-19 06:46:32,880 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 391 states to 391 states and 608 transitions. [2024-11-19 06:46:32,880 INFO L78 Accepts]: Start accepts. Automaton has 391 states and 608 transitions. Word has length 22 [2024-11-19 06:46:32,880 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-19 06:46:32,880 INFO L471 AbstractCegarLoop]: Abstraction has 391 states and 608 transitions. [2024-11-19 06:46:32,881 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 10 states have (on average 4.2) internal successors, (42), 10 states have internal predecessors, (42), 2 states have call successors, (2), 2 states have call predecessors, (2), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-19 06:46:32,881 INFO L276 IsEmpty]: Start isEmpty. Operand 391 states and 608 transitions. [2024-11-19 06:46:32,882 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2024-11-19 06:46:32,882 INFO L207 NwaCegarLoop]: Found error trace [2024-11-19 06:46:32,882 INFO L215 NwaCegarLoop]: trace histogram [2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-19 06:46:32,886 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (12)] Forceful destruction successful, exit code 0 [2024-11-19 06:46:33,083 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 12 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-11-19 06:46:33,083 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-11-19 06:46:33,084 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-19 06:46:33,084 INFO L85 PathProgramCache]: Analyzing trace with hash -487174678, now seen corresponding path program 1 times [2024-11-19 06:46:33,084 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-11-19 06:46:33,084 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1459478273] [2024-11-19 06:46:33,084 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-19 06:46:33,084 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-11-19 06:46:33,085 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-11-19 06:46:33,086 INFO L229 MonitoredProcess]: Starting monitored process 13 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2024-11-19 06:46:33,087 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (13)] Waiting until timeout for monitored process [2024-11-19 06:46:33,157 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-19 06:46:33,159 INFO L255 TraceCheckSpWp]: Trace formula consists of 123 conjuncts, 2 conjuncts are in the unsatisfiable core [2024-11-19 06:46:33,161 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-19 06:46:33,170 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 3 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-19 06:46:33,170 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-11-19 06:46:33,170 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-11-19 06:46:33,171 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1459478273] [2024-11-19 06:46:33,171 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1459478273] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-19 06:46:33,171 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-19 06:46:33,171 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-11-19 06:46:33,171 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1640816100] [2024-11-19 06:46:33,171 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-19 06:46:33,171 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-19 06:46:33,171 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-11-19 06:46:33,173 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-19 06:46:33,173 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-19 06:46:33,173 INFO L87 Difference]: Start difference. First operand 391 states and 608 transitions. Second operand has 3 states, 3 states have (on average 7.333333333333333) internal successors, (22), 3 states have internal predecessors, (22), 2 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2024-11-19 06:46:33,182 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-19 06:46:33,182 INFO L93 Difference]: Finished difference Result 296 states and 449 transitions. [2024-11-19 06:46:33,184 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-19 06:46:33,185 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 7.333333333333333) internal successors, (22), 3 states have internal predecessors, (22), 2 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 25 [2024-11-19 06:46:33,185 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-19 06:46:33,186 INFO L225 Difference]: With dead ends: 296 [2024-11-19 06:46:33,186 INFO L226 Difference]: Without dead ends: 296 [2024-11-19 06:46:33,186 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 24 GetRequests, 23 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-19 06:46:33,187 INFO L432 NwaCegarLoop]: 65 mSDtfsCounter, 9 mSDsluCounter, 55 mSDsCounter, 0 mSdLazyCounter, 4 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 9 SdHoareTripleChecker+Valid, 120 SdHoareTripleChecker+Invalid, 4 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 4 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-11-19 06:46:33,187 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [9 Valid, 120 Invalid, 4 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 4 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-11-19 06:46:33,188 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 296 states. [2024-11-19 06:46:33,199 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 296 to 296. [2024-11-19 06:46:33,203 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 296 states, 261 states have (on average 1.6168582375478928) internal successors, (422), 281 states have internal predecessors, (422), 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-11-19 06:46:33,204 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 296 states to 296 states and 449 transitions. [2024-11-19 06:46:33,205 INFO L78 Accepts]: Start accepts. Automaton has 296 states and 449 transitions. Word has length 25 [2024-11-19 06:46:33,205 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-19 06:46:33,205 INFO L471 AbstractCegarLoop]: Abstraction has 296 states and 449 transitions. [2024-11-19 06:46:33,205 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 7.333333333333333) internal successors, (22), 3 states have internal predecessors, (22), 2 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2024-11-19 06:46:33,205 INFO L276 IsEmpty]: Start isEmpty. Operand 296 states and 449 transitions. [2024-11-19 06:46:33,206 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 28 [2024-11-19 06:46:33,206 INFO L207 NwaCegarLoop]: Found error trace [2024-11-19 06:46:33,206 INFO L215 NwaCegarLoop]: trace histogram [2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-19 06:46:33,211 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (13)] Forceful destruction successful, exit code 0 [2024-11-19 06:46:33,407 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 13 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-11-19 06:46:33,407 INFO L396 AbstractCegarLoop]: === Iteration 13 === Targeting parse_inputErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [parse_inputErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, parse_inputErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, parse_inputErr2ASSERT_VIOLATIONMEMORY_DEREFERENCE (and 17 more)] === [2024-11-19 06:46:33,407 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-19 06:46:33,407 INFO L85 PathProgramCache]: Analyzing trace with hash 1487790830, now seen corresponding path program 1 times [2024-11-19 06:46:33,408 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-11-19 06:46:33,408 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [661845576] [2024-11-19 06:46:33,408 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-19 06:46:33,408 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-11-19 06:46:33,408 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-11-19 06:46:33,411 INFO L229 MonitoredProcess]: Starting monitored process 14 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2024-11-19 06:46:33,413 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (14)] Waiting until timeout for monitored process [2024-11-19 06:46:33,488 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-19 06:46:33,490 INFO L255 TraceCheckSpWp]: Trace formula consists of 127 conjuncts, 14 conjuncts are in the unsatisfiable core [2024-11-19 06:46:33,492 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-19 06:46:33,828 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-11-19 06:46:33,836 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 14 treesize of output 9 [2024-11-19 06:46:33,902 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-19 06:46:33,903 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-11-19 06:46:34,125 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-11-19 06:46:34,125 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [661845576] [2024-11-19 06:46:34,125 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [661845576] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-19 06:46:34,126 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleCvc4 [95641035] [2024-11-19 06:46:34,126 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-19 06:46:34,126 INFO L173 SolverBuilder]: Constructing external solver with command: cvc4 --incremental --print-success --lang smt [2024-11-19 06:46:34,126 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/cvc4 [2024-11-19 06:46:34,129 INFO L229 MonitoredProcess]: Starting monitored process 15 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/cvc4 --incremental --print-success --lang smt (exit command is (exit), workingDir is null) [2024-11-19 06:46:34,130 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/cvc4 --incremental --print-success --lang smt (15)] Waiting until timeout for monitored process [2024-11-19 06:46:34,312 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-19 06:46:34,314 INFO L255 TraceCheckSpWp]: Trace formula consists of 127 conjuncts, 14 conjuncts are in the unsatisfiable core [2024-11-19 06:46:34,316 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-19 06:46:34,573 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-11-19 06:46:34,574 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 14 treesize of output 9 [2024-11-19 06:46:34,606 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-19 06:46:34,606 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-11-19 06:46:40,332 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleCvc4 [95641035] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-19 06:46:40,333 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2024-11-19 06:46:40,333 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [5, 5] total 5 [2024-11-19 06:46:40,333 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1200157464] [2024-11-19 06:46:40,333 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2024-11-19 06:46:40,334 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2024-11-19 06:46:40,334 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-11-19 06:46:40,334 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2024-11-19 06:46:40,334 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=24, Invalid=66, Unknown=0, NotChecked=0, Total=90 [2024-11-19 06:46:40,335 INFO L87 Difference]: Start difference. First operand 296 states and 449 transitions. Second operand has 7 states, 6 states have (on average 4.0) internal successors, (24), 5 states have internal predecessors, (24), 2 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2024-11-19 06:46:40,958 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-19 06:46:40,958 INFO L93 Difference]: Finished difference Result 329 states and 456 transitions. [2024-11-19 06:46:40,959 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2024-11-19 06:46:40,959 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 6 states have (on average 4.0) internal successors, (24), 5 states have internal predecessors, (24), 2 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 27 [2024-11-19 06:46:40,959 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-19 06:46:40,961 INFO L225 Difference]: With dead ends: 329 [2024-11-19 06:46:40,961 INFO L226 Difference]: Without dead ends: 329 [2024-11-19 06:46:40,961 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 71 GetRequests, 53 SyntacticMatches, 1 SemanticMatches, 17 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 43 ImplicationChecksByTransitivity, 6.0s TimeCoverageRelationStatistics Valid=111, Invalid=231, Unknown=0, NotChecked=0, Total=342 [2024-11-19 06:46:40,962 INFO L432 NwaCegarLoop]: 40 mSDtfsCounter, 192 mSDsluCounter, 86 mSDsCounter, 0 mSdLazyCounter, 128 mSolverCounterSat, 34 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 192 SdHoareTripleChecker+Valid, 126 SdHoareTripleChecker+Invalid, 162 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 34 IncrementalHoareTripleChecker+Valid, 128 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2024-11-19 06:46:40,962 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [192 Valid, 126 Invalid, 162 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [34 Valid, 128 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time] [2024-11-19 06:46:40,962 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 329 states. [2024-11-19 06:46:40,968 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 329 to 320. [2024-11-19 06:46:40,968 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 320 states, 281 states have (on average 1.4875444839857652) internal successors, (418), 305 states have internal predecessors, (418), 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-11-19 06:46:40,970 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 320 states to 320 states and 452 transitions. [2024-11-19 06:46:40,970 INFO L78 Accepts]: Start accepts. Automaton has 320 states and 452 transitions. Word has length 27 [2024-11-19 06:46:40,970 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-19 06:46:40,970 INFO L471 AbstractCegarLoop]: Abstraction has 320 states and 452 transitions. [2024-11-19 06:46:40,971 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 6 states have (on average 4.0) internal successors, (24), 5 states have internal predecessors, (24), 2 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2024-11-19 06:46:40,971 INFO L276 IsEmpty]: Start isEmpty. Operand 320 states and 452 transitions. [2024-11-19 06:46:40,971 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 29 [2024-11-19 06:46:40,972 INFO L207 NwaCegarLoop]: Found error trace [2024-11-19 06:46:40,972 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-11-19 06:46:40,977 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/cvc4 --incremental --print-success --lang smt (15)] Forceful destruction successful, exit code 0 [2024-11-19 06:46:41,176 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (14)] Forceful destruction successful, exit code 0 [2024-11-19 06:46:41,372 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 15 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/cvc4 --incremental --print-success --lang smt,14 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-11-19 06:46:41,373 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-11-19 06:46:41,373 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-19 06:46:41,373 INFO L85 PathProgramCache]: Analyzing trace with hash -692402736, now seen corresponding path program 1 times [2024-11-19 06:46:41,374 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-11-19 06:46:41,374 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [2071218950] [2024-11-19 06:46:41,374 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-19 06:46:41,374 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-11-19 06:46:41,374 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-11-19 06:46:41,377 INFO L229 MonitoredProcess]: Starting monitored process 16 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2024-11-19 06:46:41,378 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (16)] Waiting until timeout for monitored process [2024-11-19 06:46:41,450 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-19 06:46:41,452 INFO L255 TraceCheckSpWp]: Trace formula consists of 126 conjuncts, 8 conjuncts are in the unsatisfiable core [2024-11-19 06:46:41,454 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-19 06:46:41,537 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 0 proven. 6 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-19 06:46:41,537 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-11-19 06:46:41,669 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 0 proven. 6 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-19 06:46:41,669 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-11-19 06:46:41,669 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [2071218950] [2024-11-19 06:46:41,669 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [2071218950] provided 0 perfect and 2 imperfect interpolant sequences [2024-11-19 06:46:41,669 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2024-11-19 06:46:41,669 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [4, 4] total 7 [2024-11-19 06:46:41,669 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [425813113] [2024-11-19 06:46:41,670 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2024-11-19 06:46:41,670 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2024-11-19 06:46:41,670 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-11-19 06:46:41,670 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2024-11-19 06:46:41,671 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=23, Invalid=49, Unknown=0, NotChecked=0, Total=72 [2024-11-19 06:46:41,671 INFO L87 Difference]: Start difference. First operand 320 states and 452 transitions. Second operand has 9 states, 8 states have (on average 6.0) internal successors, (48), 6 states have internal predecessors, (48), 1 states have call successors, (4), 4 states have call predecessors, (4), 2 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) [2024-11-19 06:46:41,951 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-19 06:46:41,951 INFO L93 Difference]: Finished difference Result 454 states and 588 transitions. [2024-11-19 06:46:41,951 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2024-11-19 06:46:41,951 INFO L78 Accepts]: Start accepts. Automaton has has 9 states, 8 states have (on average 6.0) internal successors, (48), 6 states have internal predecessors, (48), 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-11-19 06:46:41,952 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-19 06:46:41,953 INFO L225 Difference]: With dead ends: 454 [2024-11-19 06:46:41,953 INFO L226 Difference]: Without dead ends: 454 [2024-11-19 06:46:41,954 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 62 GetRequests, 47 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-11-19 06:46:41,954 INFO L432 NwaCegarLoop]: 66 mSDtfsCounter, 337 mSDsluCounter, 196 mSDsCounter, 0 mSdLazyCounter, 157 mSolverCounterSat, 22 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 337 SdHoareTripleChecker+Valid, 262 SdHoareTripleChecker+Invalid, 179 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 22 IncrementalHoareTripleChecker+Valid, 157 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2024-11-19 06:46:41,954 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [337 Valid, 262 Invalid, 179 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [22 Valid, 157 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2024-11-19 06:46:41,955 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 454 states. [2024-11-19 06:46:41,962 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 454 to 405. [2024-11-19 06:46:41,963 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 405 states, 363 states have (on average 1.4325068870523416) internal successors, (520), 388 states have internal predecessors, (520), 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-11-19 06:46:41,964 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 405 states to 405 states and 553 transitions. [2024-11-19 06:46:41,964 INFO L78 Accepts]: Start accepts. Automaton has 405 states and 553 transitions. Word has length 28 [2024-11-19 06:46:41,964 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-19 06:46:41,964 INFO L471 AbstractCegarLoop]: Abstraction has 405 states and 553 transitions. [2024-11-19 06:46:41,965 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 8 states have (on average 6.0) internal successors, (48), 6 states have internal predecessors, (48), 1 states have call successors, (4), 4 states have call predecessors, (4), 2 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) [2024-11-19 06:46:41,965 INFO L276 IsEmpty]: Start isEmpty. Operand 405 states and 553 transitions. [2024-11-19 06:46:41,965 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 30 [2024-11-19 06:46:41,965 INFO L207 NwaCegarLoop]: Found error trace [2024-11-19 06:46:41,965 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-11-19 06:46:41,971 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (16)] Forceful destruction successful, exit code 0 [2024-11-19 06:46:42,166 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 16 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-11-19 06:46:42,166 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-11-19 06:46:42,167 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-19 06:46:42,167 INFO L85 PathProgramCache]: Analyzing trace with hash 10351713, now seen corresponding path program 1 times [2024-11-19 06:46:42,167 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-11-19 06:46:42,167 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [349180948] [2024-11-19 06:46:42,167 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-19 06:46:42,167 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-11-19 06:46:42,168 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-11-19 06:46:42,171 INFO L229 MonitoredProcess]: Starting monitored process 17 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2024-11-19 06:46:42,171 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (17)] Waiting until timeout for monitored process [2024-11-19 06:46:42,229 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-19 06:46:42,231 INFO L255 TraceCheckSpWp]: Trace formula consists of 127 conjuncts, 10 conjuncts are in the unsatisfiable core [2024-11-19 06:46:42,233 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-19 06:46:42,352 INFO L134 CoverageAnalysis]: Checked inductivity of 7 backedges. 0 proven. 7 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-19 06:46:42,353 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-11-19 06:46:42,492 INFO L134 CoverageAnalysis]: Checked inductivity of 7 backedges. 0 proven. 7 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-19 06:46:42,492 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-11-19 06:46:42,492 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [349180948] [2024-11-19 06:46:42,492 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [349180948] provided 0 perfect and 2 imperfect interpolant sequences [2024-11-19 06:46:42,493 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2024-11-19 06:46:42,493 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [4, 4] total 8 [2024-11-19 06:46:42,493 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [195971484] [2024-11-19 06:46:42,493 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2024-11-19 06:46:42,493 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2024-11-19 06:46:42,494 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-11-19 06:46:42,494 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2024-11-19 06:46:42,494 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=29, Invalid=61, Unknown=0, NotChecked=0, Total=90 [2024-11-19 06:46:42,495 INFO L87 Difference]: Start difference. First operand 405 states and 553 transitions. Second operand has 10 states, 9 states have (on average 5.777777777777778) internal successors, (52), 7 states have internal predecessors, (52), 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-11-19 06:46:42,872 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-19 06:46:42,872 INFO L93 Difference]: Finished difference Result 436 states and 559 transitions. [2024-11-19 06:46:42,873 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2024-11-19 06:46:42,873 INFO L78 Accepts]: Start accepts. Automaton has has 10 states, 9 states have (on average 5.777777777777778) internal successors, (52), 7 states have internal predecessors, (52), 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 29 [2024-11-19 06:46:42,874 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-19 06:46:42,875 INFO L225 Difference]: With dead ends: 436 [2024-11-19 06:46:42,875 INFO L226 Difference]: Without dead ends: 436 [2024-11-19 06:46:42,875 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 65 GetRequests, 48 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-11-19 06:46:42,876 INFO L432 NwaCegarLoop]: 72 mSDtfsCounter, 414 mSDsluCounter, 228 mSDsCounter, 0 mSdLazyCounter, 125 mSolverCounterSat, 31 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 414 SdHoareTripleChecker+Valid, 300 SdHoareTripleChecker+Invalid, 156 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 31 IncrementalHoareTripleChecker+Valid, 125 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2024-11-19 06:46:42,876 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [414 Valid, 300 Invalid, 156 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [31 Valid, 125 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2024-11-19 06:46:42,877 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 436 states. [2024-11-19 06:46:42,887 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 436 to 415. [2024-11-19 06:46:42,888 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 415 states, 372 states have (on average 1.4005376344086022) internal successors, (521), 398 states have internal predecessors, (521), 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-11-19 06:46:42,890 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 415 states to 415 states and 554 transitions. [2024-11-19 06:46:42,890 INFO L78 Accepts]: Start accepts. Automaton has 415 states and 554 transitions. Word has length 29 [2024-11-19 06:46:42,890 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-19 06:46:42,890 INFO L471 AbstractCegarLoop]: Abstraction has 415 states and 554 transitions. [2024-11-19 06:46:42,890 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 9 states have (on average 5.777777777777778) internal successors, (52), 7 states have internal predecessors, (52), 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-11-19 06:46:42,890 INFO L276 IsEmpty]: Start isEmpty. Operand 415 states and 554 transitions. [2024-11-19 06:46:42,891 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 30 [2024-11-19 06:46:42,891 INFO L207 NwaCegarLoop]: Found error trace [2024-11-19 06:46:42,891 INFO L215 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-19 06:46:42,897 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (17)] Ended with exit code 0 [2024-11-19 06:46:43,091 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 17 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-11-19 06:46:43,093 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-11-19 06:46:43,093 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-19 06:46:43,093 INFO L85 PathProgramCache]: Analyzing trace with hash -457123443, now seen corresponding path program 1 times [2024-11-19 06:46:43,094 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-11-19 06:46:43,094 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1653578397] [2024-11-19 06:46:43,094 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-19 06:46:43,095 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-11-19 06:46:43,095 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-11-19 06:46:43,097 INFO L229 MonitoredProcess]: Starting monitored process 18 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2024-11-19 06:46:43,098 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (18)] Waiting until timeout for monitored process [2024-11-19 06:46:43,182 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-19 06:46:43,184 INFO L255 TraceCheckSpWp]: Trace formula consists of 134 conjuncts, 18 conjuncts are in the unsatisfiable core [2024-11-19 06:46:43,186 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-19 06:46:43,527 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-11-19 06:46:43,528 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 14 treesize of output 9 [2024-11-19 06:46:43,634 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 0 proven. 5 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-19 06:46:43,634 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-11-19 06:46:47,828 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-11-19 06:46:47,828 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1653578397] [2024-11-19 06:46:47,828 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1653578397] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-19 06:46:47,828 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleCvc4 [10130901] [2024-11-19 06:46:47,828 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-19 06:46:47,828 INFO L173 SolverBuilder]: Constructing external solver with command: cvc4 --incremental --print-success --lang smt [2024-11-19 06:46:47,829 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/cvc4 [2024-11-19 06:46:47,830 INFO L229 MonitoredProcess]: Starting monitored process 19 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/cvc4 --incremental --print-success --lang smt (exit command is (exit), workingDir is null) [2024-11-19 06:46:47,831 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/cvc4 --incremental --print-success --lang smt (19)] Waiting until timeout for monitored process [2024-11-19 06:46:47,961 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-19 06:46:47,970 INFO L255 TraceCheckSpWp]: Trace formula consists of 134 conjuncts, 19 conjuncts are in the unsatisfiable core [2024-11-19 06:46:47,972 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-19 06:46:48,408 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-11-19 06:46:48,409 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 14 treesize of output 9 [2024-11-19 06:46:48,466 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 0 proven. 5 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-19 06:46:48,466 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-11-19 06:46:52,629 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleCvc4 [10130901] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-19 06:46:52,630 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2024-11-19 06:46:52,630 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [6, 7] total 7 [2024-11-19 06:46:52,630 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1476546903] [2024-11-19 06:46:52,630 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2024-11-19 06:46:52,630 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2024-11-19 06:46:52,630 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-11-19 06:46:52,631 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2024-11-19 06:46:52,631 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=32, Invalid=123, Unknown=1, NotChecked=0, Total=156 [2024-11-19 06:46:52,631 INFO L87 Difference]: Start difference. First operand 415 states and 554 transitions. Second operand has 9 states, 8 states have (on average 3.625) internal successors, (29), 7 states have internal predecessors, (29), 2 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2024-11-19 06:46:53,641 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-19 06:46:53,642 INFO L93 Difference]: Finished difference Result 425 states and 557 transitions. [2024-11-19 06:46:53,643 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2024-11-19 06:46:53,643 INFO L78 Accepts]: Start accepts. Automaton has has 9 states, 8 states have (on average 3.625) internal successors, (29), 7 states have internal predecessors, (29), 2 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 29 [2024-11-19 06:46:53,644 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-19 06:46:53,646 INFO L225 Difference]: With dead ends: 425 [2024-11-19 06:46:53,646 INFO L226 Difference]: Without dead ends: 425 [2024-11-19 06:46:53,646 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 81 GetRequests, 58 SyntacticMatches, 1 SemanticMatches, 22 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 75 ImplicationChecksByTransitivity, 8.8s TimeCoverageRelationStatistics Valid=152, Invalid=399, Unknown=1, NotChecked=0, Total=552 [2024-11-19 06:46:53,647 INFO L432 NwaCegarLoop]: 40 mSDtfsCounter, 195 mSDsluCounter, 151 mSDsCounter, 0 mSdLazyCounter, 192 mSolverCounterSat, 30 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 195 SdHoareTripleChecker+Valid, 191 SdHoareTripleChecker+Invalid, 222 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 30 IncrementalHoareTripleChecker+Valid, 192 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.5s IncrementalHoareTripleChecker+Time [2024-11-19 06:46:53,647 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [195 Valid, 191 Invalid, 222 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [30 Valid, 192 Invalid, 0 Unknown, 0 Unchecked, 0.5s Time] [2024-11-19 06:46:53,648 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 425 states. [2024-11-19 06:46:53,657 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 425 to 415. [2024-11-19 06:46:53,658 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 415 states, 372 states have (on average 1.3870967741935485) internal successors, (516), 398 states have internal predecessors, (516), 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-11-19 06:46:53,659 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 415 states to 415 states and 549 transitions. [2024-11-19 06:46:53,659 INFO L78 Accepts]: Start accepts. Automaton has 415 states and 549 transitions. Word has length 29 [2024-11-19 06:46:53,660 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-19 06:46:53,660 INFO L471 AbstractCegarLoop]: Abstraction has 415 states and 549 transitions. [2024-11-19 06:46:53,660 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 8 states have (on average 3.625) internal successors, (29), 7 states have internal predecessors, (29), 2 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2024-11-19 06:46:53,660 INFO L276 IsEmpty]: Start isEmpty. Operand 415 states and 549 transitions. [2024-11-19 06:46:53,662 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 36 [2024-11-19 06:46:53,664 INFO L207 NwaCegarLoop]: Found error trace [2024-11-19 06:46:53,665 INFO L215 NwaCegarLoop]: trace histogram [3, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-19 06:46:53,673 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/cvc4 --incremental --print-success --lang smt (19)] Forceful destruction successful, exit code 0 [2024-11-19 06:46:53,869 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (18)] Ended with exit code 0 [2024-11-19 06:46:54,065 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 19 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/cvc4 --incremental --print-success --lang smt,18 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-11-19 06:46:54,066 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-11-19 06:46:54,066 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-19 06:46:54,066 INFO L85 PathProgramCache]: Analyzing trace with hash -219964683, now seen corresponding path program 1 times [2024-11-19 06:46:54,066 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-11-19 06:46:54,066 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1141811056] [2024-11-19 06:46:54,066 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-19 06:46:54,066 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-11-19 06:46:54,067 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-11-19 06:46:54,068 INFO L229 MonitoredProcess]: Starting monitored process 20 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2024-11-19 06:46:54,068 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (20)] Waiting until timeout for monitored process [2024-11-19 06:46:54,153 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-19 06:46:54,156 INFO L255 TraceCheckSpWp]: Trace formula consists of 142 conjuncts, 15 conjuncts are in the unsatisfiable core [2024-11-19 06:46:54,157 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-19 06:46:54,482 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-11-19 06:46:54,483 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 14 treesize of output 9 [2024-11-19 06:46:54,712 INFO L134 CoverageAnalysis]: Checked inductivity of 12 backedges. 0 proven. 12 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-19 06:46:54,712 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-11-19 06:46:55,167 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-11-19 06:46:55,167 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1141811056] [2024-11-19 06:46:55,167 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1141811056] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-19 06:46:55,167 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleCvc4 [1704448150] [2024-11-19 06:46:55,167 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-19 06:46:55,168 INFO L173 SolverBuilder]: Constructing external solver with command: cvc4 --incremental --print-success --lang smt [2024-11-19 06:46:55,168 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/cvc4 [2024-11-19 06:46:55,169 INFO L229 MonitoredProcess]: Starting monitored process 21 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/cvc4 --incremental --print-success --lang smt (exit command is (exit), workingDir is null) [2024-11-19 06:46:55,170 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/cvc4 --incremental --print-success --lang smt (21)] Waiting until timeout for monitored process [2024-11-19 06:46:55,332 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-19 06:46:55,334 INFO L255 TraceCheckSpWp]: Trace formula consists of 142 conjuncts, 15 conjuncts are in the unsatisfiable core [2024-11-19 06:46:55,335 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-19 06:46:55,604 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-11-19 06:46:55,605 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 14 treesize of output 9 [2024-11-19 06:46:55,789 INFO L134 CoverageAnalysis]: Checked inductivity of 12 backedges. 0 proven. 12 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-19 06:46:55,789 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-11-19 06:47:00,113 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleCvc4 [1704448150] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-19 06:47:00,113 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2024-11-19 06:47:00,114 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [6, 6] total 6 [2024-11-19 06:47:00,114 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [154228097] [2024-11-19 06:47:00,114 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2024-11-19 06:47:00,114 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2024-11-19 06:47:00,114 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-11-19 06:47:00,115 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2024-11-19 06:47:00,115 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=32, Invalid=100, Unknown=0, NotChecked=0, Total=132 [2024-11-19 06:47:00,115 INFO L87 Difference]: Start difference. First operand 415 states and 549 transitions. Second operand has 8 states, 7 states have (on average 4.571428571428571) internal successors, (32), 6 states have internal predecessors, (32), 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)