./Ultimate.py --spec /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/properties/valid-memsafety.prp --file /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/verifythis/duplets.c --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for memory safety (deref-memtrack) Using default analysis Version 4a390ef5 Calling Ultimate with: /root/.sdkman/candidates/java/current/bin/java -Dosgi.configuration.area=/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/config -Xmx15G -Xms4m -jar /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/plugins/org.eclipse.equinox.launcher_1.5.800.v20200727-1323.jar -data @noDefault -ultimatedata /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data -tc /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/AutomizerMemDerefMemtrack.xml -i /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/verifythis/duplets.c -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 ac76721ba91522692e2c3e4d1ea27df0200031dd012c5066cc7280e0ae6e2244 --- Real Ultimate output --- This is Ultimate 0.2.5-dev-4a390ef-m [2024-10-24 16:12:04,695 INFO L188 SettingsManager]: Resetting all preferences to default values... [2024-10-24 16:12:04,771 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-DerefFreeMemtrack-32bit-Automizer_Default.epf [2024-10-24 16:12:04,775 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2024-10-24 16:12:04,776 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2024-10-24 16:12:04,802 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2024-10-24 16:12:04,803 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2024-10-24 16:12:04,805 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2024-10-24 16:12:04,805 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2024-10-24 16:12:04,807 INFO L153 SettingsManager]: * Use memory slicer=true [2024-10-24 16:12:04,808 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2024-10-24 16:12:04,808 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2024-10-24 16:12:04,808 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2024-10-24 16:12:04,809 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2024-10-24 16:12:04,809 INFO L153 SettingsManager]: * Use SBE=true [2024-10-24 16:12:04,811 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2024-10-24 16:12:04,811 INFO L153 SettingsManager]: * sizeof long=4 [2024-10-24 16:12:04,812 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2024-10-24 16:12:04,812 INFO L153 SettingsManager]: * sizeof POINTER=4 [2024-10-24 16:12:04,812 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2024-10-24 16:12:04,812 INFO L153 SettingsManager]: * Check for the main procedure if all allocated memory was freed=true [2024-10-24 16:12:04,813 INFO L153 SettingsManager]: * Bitprecise bitfields=true [2024-10-24 16:12:04,813 INFO L153 SettingsManager]: * SV-COMP memtrack compatibility mode=true [2024-10-24 16:12:04,813 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2024-10-24 16:12:04,814 INFO L153 SettingsManager]: * Adapt memory model on pointer casts if necessary=true [2024-10-24 16:12:04,814 INFO L153 SettingsManager]: * Allow undefined functions=false [2024-10-24 16:12:04,814 INFO L153 SettingsManager]: * Check unreachability of reach_error function=false [2024-10-24 16:12:04,814 INFO L153 SettingsManager]: * sizeof long double=12 [2024-10-24 16:12:04,815 INFO L153 SettingsManager]: * Use constant arrays=true [2024-10-24 16:12:04,815 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2024-10-24 16:12:04,815 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2024-10-24 16:12:04,816 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2024-10-24 16:12:04,816 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2024-10-24 16:12:04,816 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-10-24 16:12:04,816 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2024-10-24 16:12:04,817 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2024-10-24 16:12:04,817 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2024-10-24 16:12:04,817 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2024-10-24 16:12:04,818 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2024-10-24 16:12:04,819 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2024-10-24 16:12:04,819 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2024-10-24 16:12:04,819 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2024-10-24 16:12:04,819 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 -> ac76721ba91522692e2c3e4d1ea27df0200031dd012c5066cc7280e0ae6e2244 [2024-10-24 16:12:05,094 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2024-10-24 16:12:05,118 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2024-10-24 16:12:05,121 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2024-10-24 16:12:05,122 INFO L270 PluginConnector]: Initializing CDTParser... [2024-10-24 16:12:05,122 INFO L274 PluginConnector]: CDTParser initialized [2024-10-24 16:12:05,123 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/verifythis/duplets.c [2024-10-24 16:12:06,586 INFO L533 CDTParser]: Created temporary CDT project at NULL [2024-10-24 16:12:06,786 INFO L384 CDTParser]: Found 1 translation units. [2024-10-24 16:12:06,787 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/verifythis/duplets.c [2024-10-24 16:12:06,794 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/4ada7434e/ac0c6930dcc149688b10ec39b52d0455/FLAGf32b23a94 [2024-10-24 16:12:06,808 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/4ada7434e/ac0c6930dcc149688b10ec39b52d0455 [2024-10-24 16:12:06,811 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2024-10-24 16:12:06,812 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2024-10-24 16:12:06,814 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2024-10-24 16:12:06,814 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2024-10-24 16:12:06,820 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2024-10-24 16:12:06,821 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 24.10 04:12:06" (1/1) ... [2024-10-24 16:12:06,822 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@24a926b5 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.10 04:12:06, skipping insertion in model container [2024-10-24 16:12:06,822 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 24.10 04:12:06" (1/1) ... [2024-10-24 16:12:06,844 INFO L175 MainTranslator]: Built tables and reachable declarations [2024-10-24 16:12:07,081 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-10-24 16:12:07,095 INFO L200 MainTranslator]: Completed pre-run [2024-10-24 16:12:07,118 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-10-24 16:12:07,135 INFO L204 MainTranslator]: Completed translation [2024-10-24 16:12:07,135 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.10 04:12:07 WrapperNode [2024-10-24 16:12:07,136 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2024-10-24 16:12:07,137 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2024-10-24 16:12:07,137 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2024-10-24 16:12:07,137 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2024-10-24 16:12:07,144 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.10 04:12:07" (1/1) ... [2024-10-24 16:12:07,152 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.10 04:12:07" (1/1) ... [2024-10-24 16:12:07,173 INFO L138 Inliner]: procedures = 21, calls = 44, calls flagged for inlining = 6, calls inlined = 6, statements flattened = 132 [2024-10-24 16:12:07,174 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2024-10-24 16:12:07,175 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2024-10-24 16:12:07,175 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2024-10-24 16:12:07,175 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2024-10-24 16:12:07,188 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.10 04:12:07" (1/1) ... [2024-10-24 16:12:07,188 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.10 04:12:07" (1/1) ... [2024-10-24 16:12:07,191 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.10 04:12:07" (1/1) ... [2024-10-24 16:12:07,205 INFO L175 MemorySlicer]: Split 19 memory accesses to 4 slices as follows [2, 7, 5, 5]. 37 percent of accesses are in the largest equivalence class. The 2 initializations are split as follows [2, 0, 0, 0]. The 5 writes are split as follows [0, 3, 1, 1]. [2024-10-24 16:12:07,205 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.10 04:12:07" (1/1) ... [2024-10-24 16:12:07,206 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.10 04:12:07" (1/1) ... [2024-10-24 16:12:07,213 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.10 04:12:07" (1/1) ... [2024-10-24 16:12:07,217 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.10 04:12:07" (1/1) ... [2024-10-24 16:12:07,218 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.10 04:12:07" (1/1) ... [2024-10-24 16:12:07,220 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.10 04:12:07" (1/1) ... [2024-10-24 16:12:07,223 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2024-10-24 16:12:07,224 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2024-10-24 16:12:07,224 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2024-10-24 16:12:07,224 INFO L274 PluginConnector]: RCFGBuilder initialized [2024-10-24 16:12:07,225 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.10 04:12:07" (1/1) ... [2024-10-24 16:12:07,234 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-10-24 16:12:07,244 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-10-24 16:12:07,271 INFO L229 MonitoredProcess]: Starting monitored process 1 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (exit command is (exit), workingDir is null) [2024-10-24 16:12:07,274 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Waiting until timeout for monitored process [2024-10-24 16:12:07,325 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2024-10-24 16:12:07,326 INFO L130 BoogieDeclarations]: Found specification of procedure assume_abort_if_not [2024-10-24 16:12:07,326 INFO L138 BoogieDeclarations]: Found implementation of procedure assume_abort_if_not [2024-10-24 16:12:07,326 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#0 [2024-10-24 16:12:07,326 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#1 [2024-10-24 16:12:07,326 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#2 [2024-10-24 16:12:07,326 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#3 [2024-10-24 16:12:07,327 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2024-10-24 16:12:07,327 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#0 [2024-10-24 16:12:07,327 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#1 [2024-10-24 16:12:07,327 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#2 [2024-10-24 16:12:07,329 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#3 [2024-10-24 16:12:07,329 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnHeap [2024-10-24 16:12:07,330 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2024-10-24 16:12:07,330 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2024-10-24 16:12:07,330 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#0 [2024-10-24 16:12:07,330 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#1 [2024-10-24 16:12:07,330 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#2 [2024-10-24 16:12:07,330 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#3 [2024-10-24 16:12:07,330 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_assert [2024-10-24 16:12:07,330 INFO L138 BoogieDeclarations]: Found implementation of procedure __VERIFIER_assert [2024-10-24 16:12:07,330 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2024-10-24 16:12:07,460 INFO L238 CfgBuilder]: Building ICFG [2024-10-24 16:12:07,463 INFO L264 CfgBuilder]: Building CFG for each procedure with an implementation [2024-10-24 16:12:07,819 INFO L? ?]: Removed 107 outVars from TransFormulas that were not future-live. [2024-10-24 16:12:07,819 INFO L287 CfgBuilder]: Performing block encoding [2024-10-24 16:12:07,863 INFO L309 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2024-10-24 16:12:07,864 INFO L314 CfgBuilder]: Removed 2 assume(true) statements. [2024-10-24 16:12:07,864 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 24.10 04:12:07 BoogieIcfgContainer [2024-10-24 16:12:07,864 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2024-10-24 16:12:07,867 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2024-10-24 16:12:07,867 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2024-10-24 16:12:07,871 INFO L274 PluginConnector]: TraceAbstraction initialized [2024-10-24 16:12:07,871 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 24.10 04:12:06" (1/3) ... [2024-10-24 16:12:07,872 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@20657309 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 24.10 04:12:07, skipping insertion in model container [2024-10-24 16:12:07,872 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.10 04:12:07" (2/3) ... [2024-10-24 16:12:07,872 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@20657309 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 24.10 04:12:07, skipping insertion in model container [2024-10-24 16:12:07,872 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 24.10 04:12:07" (3/3) ... [2024-10-24 16:12:07,874 INFO L112 eAbstractionObserver]: Analyzing ICFG duplets.c [2024-10-24 16:12:07,890 INFO L209 ceAbstractionStarter]: Automizer settings: Hoare:None NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2024-10-24 16:12:07,890 INFO L149 ceAbstractionStarter]: Applying trace abstraction to program that has 37 error locations. [2024-10-24 16:12:07,944 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2024-10-24 16:12:07,952 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;@fb092ab, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2024-10-24 16:12:07,952 INFO L334 AbstractCegarLoop]: Starting to check reachability of 37 error locations. [2024-10-24 16:12:07,959 INFO L276 IsEmpty]: Start isEmpty. Operand has 91 states, 42 states have (on average 2.0952380952380953) internal successors, (88), 79 states have internal predecessors, (88), 9 states have call successors, (9), 2 states have call predecessors, (9), 2 states have return successors, (9), 9 states have call predecessors, (9), 9 states have call successors, (9) [2024-10-24 16:12:07,966 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 25 [2024-10-24 16:12:07,967 INFO L207 NwaCegarLoop]: Found error trace [2024-10-24 16:12:07,967 INFO L215 NwaCegarLoop]: trace histogram [4, 4, 4, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-24 16:12:07,968 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 34 more)] === [2024-10-24 16:12:07,974 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-24 16:12:07,975 INFO L85 PathProgramCache]: Analyzing trace with hash 1260349564, now seen corresponding path program 1 times [2024-10-24 16:12:07,984 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-24 16:12:07,984 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [994407570] [2024-10-24 16:12:07,985 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-24 16:12:07,985 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-24 16:12:08,091 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 16:12:08,146 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2024-10-24 16:12:08,148 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 16:12:08,159 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 7 [2024-10-24 16:12:08,164 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 16:12:08,170 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 12 [2024-10-24 16:12:08,173 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 16:12:08,178 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 17 [2024-10-24 16:12:08,180 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 16:12:08,186 INFO L134 CoverageAnalysis]: Checked inductivity of 24 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 24 trivial. 0 not checked. [2024-10-24 16:12:08,190 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-24 16:12:08,190 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [994407570] [2024-10-24 16:12:08,191 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [994407570] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-24 16:12:08,191 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-24 16:12:08,191 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-10-24 16:12:08,192 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1830198692] [2024-10-24 16:12:08,193 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-24 16:12:08,198 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2024-10-24 16:12:08,198 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-24 16:12:08,229 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2024-10-24 16:12:08,230 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2024-10-24 16:12:08,232 INFO L87 Difference]: Start difference. First operand has 91 states, 42 states have (on average 2.0952380952380953) internal successors, (88), 79 states have internal predecessors, (88), 9 states have call successors, (9), 2 states have call predecessors, (9), 2 states have return successors, (9), 9 states have call predecessors, (9), 9 states have call successors, (9) Second operand has 2 states, 2 states have (on average 3.5) internal successors, (7), 2 states have internal predecessors, (7), 2 states have call successors, (4), 1 states have call predecessors, (4), 1 states have return successors, (4), 1 states have call predecessors, (4), 2 states have call successors, (4) [2024-10-24 16:12:08,284 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-24 16:12:08,285 INFO L93 Difference]: Finished difference Result 91 states and 102 transitions. [2024-10-24 16:12:08,290 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2024-10-24 16:12:08,292 INFO L78 Accepts]: Start accepts. Automaton has has 2 states, 2 states have (on average 3.5) internal successors, (7), 2 states have internal predecessors, (7), 2 states have call successors, (4), 1 states have call predecessors, (4), 1 states have return successors, (4), 1 states have call predecessors, (4), 2 states have call successors, (4) Word has length 24 [2024-10-24 16:12:08,292 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-24 16:12:08,303 INFO L225 Difference]: With dead ends: 91 [2024-10-24 16:12:08,306 INFO L226 Difference]: Without dead ends: 90 [2024-10-24 16:12:08,309 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 14 GetRequests, 14 SyntacticMatches, 0 SemanticMatches, 0 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2024-10-24 16:12:08,315 INFO L432 NwaCegarLoop]: 92 mSDtfsCounter, 0 mSDsluCounter, 0 mSDsCounter, 0 mSdLazyCounter, 10 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 92 SdHoareTripleChecker+Invalid, 10 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 10 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-10-24 16:12:08,316 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 92 Invalid, 10 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 10 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-10-24 16:12:08,331 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 90 states. [2024-10-24 16:12:08,347 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 90 to 90. [2024-10-24 16:12:08,349 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 90 states, 42 states have (on average 1.9761904761904763) internal successors, (83), 78 states have internal predecessors, (83), 9 states have call successors, (9), 2 states have call predecessors, (9), 2 states have return successors, (9), 9 states have call predecessors, (9), 9 states have call successors, (9) [2024-10-24 16:12:08,351 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 90 states to 90 states and 101 transitions. [2024-10-24 16:12:08,352 INFO L78 Accepts]: Start accepts. Automaton has 90 states and 101 transitions. Word has length 24 [2024-10-24 16:12:08,352 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-24 16:12:08,353 INFO L471 AbstractCegarLoop]: Abstraction has 90 states and 101 transitions. [2024-10-24 16:12:08,353 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 2 states, 2 states have (on average 3.5) internal successors, (7), 2 states have internal predecessors, (7), 2 states have call successors, (4), 1 states have call predecessors, (4), 1 states have return successors, (4), 1 states have call predecessors, (4), 2 states have call successors, (4) [2024-10-24 16:12:08,353 INFO L276 IsEmpty]: Start isEmpty. Operand 90 states and 101 transitions. [2024-10-24 16:12:08,355 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 25 [2024-10-24 16:12:08,355 INFO L207 NwaCegarLoop]: Found error trace [2024-10-24 16:12:08,355 INFO L215 NwaCegarLoop]: trace histogram [4, 4, 4, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-24 16:12:08,355 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2024-10-24 16:12:08,356 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 34 more)] === [2024-10-24 16:12:08,356 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-24 16:12:08,356 INFO L85 PathProgramCache]: Analyzing trace with hash 12007744, now seen corresponding path program 1 times [2024-10-24 16:12:08,357 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-24 16:12:08,357 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [802363996] [2024-10-24 16:12:08,357 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-24 16:12:08,357 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-24 16:12:08,382 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 16:12:08,655 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2024-10-24 16:12:08,657 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 16:12:08,661 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 7 [2024-10-24 16:12:08,670 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 16:12:08,677 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 12 [2024-10-24 16:12:08,682 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 16:12:08,691 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 17 [2024-10-24 16:12:08,695 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 16:12:08,703 INFO L134 CoverageAnalysis]: Checked inductivity of 24 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 24 trivial. 0 not checked. [2024-10-24 16:12:08,707 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-24 16:12:08,708 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [802363996] [2024-10-24 16:12:08,708 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [802363996] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-24 16:12:08,708 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-24 16:12:08,708 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-10-24 16:12:08,708 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1357809696] [2024-10-24 16:12:08,708 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-24 16:12:08,710 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-10-24 16:12:08,710 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-24 16:12:08,711 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-10-24 16:12:08,711 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-10-24 16:12:08,713 INFO L87 Difference]: Start difference. First operand 90 states and 101 transitions. Second operand has 3 states, 2 states have (on average 3.5) internal successors, (7), 3 states have internal predecessors, (7), 2 states have call successors, (4), 1 states have call predecessors, (4), 1 states have return successors, (4), 2 states have call predecessors, (4), 2 states have call successors, (4) [2024-10-24 16:12:08,816 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-24 16:12:08,816 INFO L93 Difference]: Finished difference Result 88 states and 99 transitions. [2024-10-24 16:12:08,817 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-10-24 16:12:08,817 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 2 states have (on average 3.5) internal successors, (7), 3 states have internal predecessors, (7), 2 states have call successors, (4), 1 states have call predecessors, (4), 1 states have return successors, (4), 2 states have call predecessors, (4), 2 states have call successors, (4) Word has length 24 [2024-10-24 16:12:08,818 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-24 16:12:08,819 INFO L225 Difference]: With dead ends: 88 [2024-10-24 16:12:08,820 INFO L226 Difference]: Without dead ends: 88 [2024-10-24 16:12:08,820 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 9 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-10-24 16:12:08,822 INFO L432 NwaCegarLoop]: 87 mSDtfsCounter, 1 mSDsluCounter, 54 mSDsCounter, 0 mSdLazyCounter, 51 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1 SdHoareTripleChecker+Valid, 141 SdHoareTripleChecker+Invalid, 52 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 51 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-10-24 16:12:08,825 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [1 Valid, 141 Invalid, 52 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 51 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-10-24 16:12:08,827 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 88 states. [2024-10-24 16:12:08,835 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 88 to 88. [2024-10-24 16:12:08,837 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 88 states, 42 states have (on average 1.9285714285714286) internal successors, (81), 76 states have internal predecessors, (81), 9 states have call successors, (9), 2 states have call predecessors, (9), 2 states have return successors, (9), 9 states have call predecessors, (9), 9 states have call successors, (9) [2024-10-24 16:12:08,840 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 88 states to 88 states and 99 transitions. [2024-10-24 16:12:08,841 INFO L78 Accepts]: Start accepts. Automaton has 88 states and 99 transitions. Word has length 24 [2024-10-24 16:12:08,842 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-24 16:12:08,842 INFO L471 AbstractCegarLoop]: Abstraction has 88 states and 99 transitions. [2024-10-24 16:12:08,842 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 2 states have (on average 3.5) internal successors, (7), 3 states have internal predecessors, (7), 2 states have call successors, (4), 1 states have call predecessors, (4), 1 states have return successors, (4), 2 states have call predecessors, (4), 2 states have call successors, (4) [2024-10-24 16:12:08,843 INFO L276 IsEmpty]: Start isEmpty. Operand 88 states and 99 transitions. [2024-10-24 16:12:08,844 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 25 [2024-10-24 16:12:08,844 INFO L207 NwaCegarLoop]: Found error trace [2024-10-24 16:12:08,844 INFO L215 NwaCegarLoop]: trace histogram [4, 4, 4, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-24 16:12:08,845 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2024-10-24 16:12:08,846 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 34 more)] === [2024-10-24 16:12:08,846 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-24 16:12:08,847 INFO L85 PathProgramCache]: Analyzing trace with hash 12007745, now seen corresponding path program 1 times [2024-10-24 16:12:08,847 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-24 16:12:08,847 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1678663039] [2024-10-24 16:12:08,847 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-24 16:12:08,848 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-24 16:12:08,903 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 16:12:09,195 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2024-10-24 16:12:09,199 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 16:12:09,237 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 7 [2024-10-24 16:12:09,240 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 16:12:09,268 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 12 [2024-10-24 16:12:09,270 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 16:12:09,276 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 17 [2024-10-24 16:12:09,279 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 16:12:09,284 INFO L134 CoverageAnalysis]: Checked inductivity of 24 backedges. 0 proven. 12 refuted. 0 times theorem prover too weak. 12 trivial. 0 not checked. [2024-10-24 16:12:09,287 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-24 16:12:09,288 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1678663039] [2024-10-24 16:12:09,288 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1678663039] provided 0 perfect and 1 imperfect interpolant sequences [2024-10-24 16:12:09,289 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1296467019] [2024-10-24 16:12:09,289 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-24 16:12:09,289 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-10-24 16:12:09,289 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-10-24 16:12:09,292 INFO L229 MonitoredProcess]: Starting monitored process 2 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-10-24 16:12:09,294 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Waiting until timeout for monitored process [2024-10-24 16:12:09,380 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 16:12:09,382 INFO L255 TraceCheckSpWp]: Trace formula consists of 87 conjuncts, 20 conjuncts are in the unsatisfiable core [2024-10-24 16:12:09,389 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-24 16:12:09,502 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 8 treesize of output 1 [2024-10-24 16:12:09,927 INFO L134 CoverageAnalysis]: Checked inductivity of 24 backedges. 8 proven. 12 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2024-10-24 16:12:09,927 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-10-24 16:12:10,296 INFO L134 CoverageAnalysis]: Checked inductivity of 24 backedges. 0 proven. 12 refuted. 0 times theorem prover too weak. 12 trivial. 0 not checked. [2024-10-24 16:12:10,296 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1296467019] provided 0 perfect and 2 imperfect interpolant sequences [2024-10-24 16:12:10,296 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2024-10-24 16:12:10,297 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [6, 10, 6] total 16 [2024-10-24 16:12:10,297 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [872410929] [2024-10-24 16:12:10,297 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2024-10-24 16:12:10,298 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 17 states [2024-10-24 16:12:10,298 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-24 16:12:10,299 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 17 interpolants. [2024-10-24 16:12:10,299 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=54, Invalid=218, Unknown=0, NotChecked=0, Total=272 [2024-10-24 16:12:10,299 INFO L87 Difference]: Start difference. First operand 88 states and 99 transitions. Second operand has 17 states, 13 states have (on average 1.8461538461538463) internal successors, (24), 14 states have internal predecessors, (24), 7 states have call successors, (10), 3 states have call predecessors, (10), 4 states have return successors, (11), 5 states have call predecessors, (11), 7 states have call successors, (11) [2024-10-24 16:12:14,389 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.01s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2024-10-24 16:12:14,847 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-24 16:12:14,847 INFO L93 Difference]: Finished difference Result 123 states and 135 transitions. [2024-10-24 16:12:14,848 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2024-10-24 16:12:14,849 INFO L78 Accepts]: Start accepts. Automaton has has 17 states, 13 states have (on average 1.8461538461538463) internal successors, (24), 14 states have internal predecessors, (24), 7 states have call successors, (10), 3 states have call predecessors, (10), 4 states have return successors, (11), 5 states have call predecessors, (11), 7 states have call successors, (11) Word has length 24 [2024-10-24 16:12:14,849 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-24 16:12:14,851 INFO L225 Difference]: With dead ends: 123 [2024-10-24 16:12:14,851 INFO L226 Difference]: Without dead ends: 123 [2024-10-24 16:12:14,851 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 66 GetRequests, 41 SyntacticMatches, 4 SemanticMatches, 21 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 110 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=108, Invalid=398, Unknown=0, NotChecked=0, Total=506 [2024-10-24 16:12:14,852 INFO L432 NwaCegarLoop]: 54 mSDtfsCounter, 285 mSDsluCounter, 345 mSDsCounter, 0 mSdLazyCounter, 366 mSolverCounterSat, 38 mSolverCounterUnsat, 1 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 4.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 286 SdHoareTripleChecker+Valid, 399 SdHoareTripleChecker+Invalid, 405 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 38 IncrementalHoareTripleChecker+Valid, 366 IncrementalHoareTripleChecker+Invalid, 1 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 4.4s IncrementalHoareTripleChecker+Time [2024-10-24 16:12:14,853 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [286 Valid, 399 Invalid, 405 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [38 Valid, 366 Invalid, 1 Unknown, 0 Unchecked, 4.4s Time] [2024-10-24 16:12:14,857 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 123 states. [2024-10-24 16:12:14,866 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 123 to 91. [2024-10-24 16:12:14,867 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 91 states, 45 states have (on average 1.8444444444444446) internal successors, (83), 78 states have internal predecessors, (83), 9 states have call successors, (9), 3 states have call predecessors, (9), 3 states have return successors, (9), 9 states have call predecessors, (9), 9 states have call successors, (9) [2024-10-24 16:12:14,868 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 91 states to 91 states and 101 transitions. [2024-10-24 16:12:14,868 INFO L78 Accepts]: Start accepts. Automaton has 91 states and 101 transitions. Word has length 24 [2024-10-24 16:12:14,868 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-24 16:12:14,868 INFO L471 AbstractCegarLoop]: Abstraction has 91 states and 101 transitions. [2024-10-24 16:12:14,868 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 17 states, 13 states have (on average 1.8461538461538463) internal successors, (24), 14 states have internal predecessors, (24), 7 states have call successors, (10), 3 states have call predecessors, (10), 4 states have return successors, (11), 5 states have call predecessors, (11), 7 states have call successors, (11) [2024-10-24 16:12:14,869 INFO L276 IsEmpty]: Start isEmpty. Operand 91 states and 101 transitions. [2024-10-24 16:12:14,869 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2024-10-24 16:12:14,869 INFO L207 NwaCegarLoop]: Found error trace [2024-10-24 16:12:14,869 INFO L215 NwaCegarLoop]: trace histogram [4, 4, 4, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-24 16:12:14,892 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Forceful destruction successful, exit code 0 [2024-10-24 16:12:15,070 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2,2 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-10-24 16:12:15,070 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr3REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 34 more)] === [2024-10-24 16:12:15,071 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-24 16:12:15,071 INFO L85 PathProgramCache]: Analyzing trace with hash 372240057, now seen corresponding path program 1 times [2024-10-24 16:12:15,071 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-24 16:12:15,071 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1988968862] [2024-10-24 16:12:15,072 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-24 16:12:15,072 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-24 16:12:15,092 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 16:12:15,257 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2024-10-24 16:12:15,259 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 16:12:15,283 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 7 [2024-10-24 16:12:15,285 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 16:12:15,288 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 12 [2024-10-24 16:12:15,290 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 16:12:15,304 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 17 [2024-10-24 16:12:15,306 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 16:12:15,310 INFO L134 CoverageAnalysis]: Checked inductivity of 24 backedges. 3 proven. 9 refuted. 0 times theorem prover too weak. 12 trivial. 0 not checked. [2024-10-24 16:12:15,310 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-24 16:12:15,310 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1988968862] [2024-10-24 16:12:15,310 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1988968862] provided 0 perfect and 1 imperfect interpolant sequences [2024-10-24 16:12:15,311 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [251917073] [2024-10-24 16:12:15,311 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-24 16:12:15,311 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-10-24 16:12:15,311 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-10-24 16:12:15,313 INFO L229 MonitoredProcess]: Starting monitored process 3 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-10-24 16:12:15,314 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Waiting until timeout for monitored process [2024-10-24 16:12:15,376 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 16:12:15,377 INFO L255 TraceCheckSpWp]: Trace formula consists of 95 conjuncts, 22 conjuncts are in the unsatisfiable core [2024-10-24 16:12:15,380 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-24 16:12:15,416 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 10 treesize of output 9 [2024-10-24 16:12:16,021 INFO L134 CoverageAnalysis]: Checked inductivity of 24 backedges. 14 proven. 9 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2024-10-24 16:12:16,022 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-10-24 16:12:16,276 INFO L134 CoverageAnalysis]: Checked inductivity of 24 backedges. 3 proven. 9 refuted. 0 times theorem prover too weak. 12 trivial. 0 not checked. [2024-10-24 16:12:16,277 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [251917073] provided 0 perfect and 2 imperfect interpolant sequences [2024-10-24 16:12:16,277 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2024-10-24 16:12:16,277 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [6, 10, 6] total 16 [2024-10-24 16:12:16,277 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1279726432] [2024-10-24 16:12:16,277 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2024-10-24 16:12:16,277 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 17 states [2024-10-24 16:12:16,277 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-24 16:12:16,278 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 17 interpolants. [2024-10-24 16:12:16,278 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=50, Invalid=222, Unknown=0, NotChecked=0, Total=272 [2024-10-24 16:12:16,278 INFO L87 Difference]: Start difference. First operand 91 states and 101 transitions. Second operand has 17 states, 13 states have (on average 2.3076923076923075) internal successors, (30), 15 states have internal predecessors, (30), 7 states have call successors, (10), 3 states have call predecessors, (10), 5 states have return successors, (11), 8 states have call predecessors, (11), 7 states have call successors, (11) [2024-10-24 16:12:16,875 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-24 16:12:16,878 INFO L93 Difference]: Finished difference Result 122 states and 134 transitions. [2024-10-24 16:12:16,879 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2024-10-24 16:12:16,880 INFO L78 Accepts]: Start accepts. Automaton has has 17 states, 13 states have (on average 2.3076923076923075) internal successors, (30), 15 states have internal predecessors, (30), 7 states have call successors, (10), 3 states have call predecessors, (10), 5 states have return successors, (11), 8 states have call predecessors, (11), 7 states have call successors, (11) Word has length 25 [2024-10-24 16:12:16,880 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-24 16:12:16,881 INFO L225 Difference]: With dead ends: 122 [2024-10-24 16:12:16,881 INFO L226 Difference]: Without dead ends: 122 [2024-10-24 16:12:16,881 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 68 GetRequests, 43 SyntacticMatches, 4 SemanticMatches, 21 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 91 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=104, Invalid=402, Unknown=0, NotChecked=0, Total=506 [2024-10-24 16:12:16,882 INFO L432 NwaCegarLoop]: 54 mSDtfsCounter, 283 mSDsluCounter, 345 mSDsCounter, 0 mSdLazyCounter, 363 mSolverCounterSat, 41 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 284 SdHoareTripleChecker+Valid, 399 SdHoareTripleChecker+Invalid, 404 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 41 IncrementalHoareTripleChecker+Valid, 363 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2024-10-24 16:12:16,882 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [284 Valid, 399 Invalid, 404 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [41 Valid, 363 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time] [2024-10-24 16:12:16,887 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 122 states. [2024-10-24 16:12:16,895 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 122 to 90. [2024-10-24 16:12:16,897 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 90 states, 45 states have (on average 1.8222222222222222) internal successors, (82), 77 states have internal predecessors, (82), 9 states have call successors, (9), 3 states have call predecessors, (9), 3 states have return successors, (9), 9 states have call predecessors, (9), 9 states have call successors, (9) [2024-10-24 16:12:16,898 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 90 states to 90 states and 100 transitions. [2024-10-24 16:12:16,898 INFO L78 Accepts]: Start accepts. Automaton has 90 states and 100 transitions. Word has length 25 [2024-10-24 16:12:16,899 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-24 16:12:16,899 INFO L471 AbstractCegarLoop]: Abstraction has 90 states and 100 transitions. [2024-10-24 16:12:16,899 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 17 states, 13 states have (on average 2.3076923076923075) internal successors, (30), 15 states have internal predecessors, (30), 7 states have call successors, (10), 3 states have call predecessors, (10), 5 states have return successors, (11), 8 states have call predecessors, (11), 7 states have call successors, (11) [2024-10-24 16:12:16,899 INFO L276 IsEmpty]: Start isEmpty. Operand 90 states and 100 transitions. [2024-10-24 16:12:16,900 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 29 [2024-10-24 16:12:16,901 INFO L207 NwaCegarLoop]: Found error trace [2024-10-24 16:12:16,902 INFO L215 NwaCegarLoop]: trace histogram [4, 4, 4, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-24 16:12:16,917 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Ended with exit code 0 [2024-10-24 16:12:17,102 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,SelfDestructingSolverStorable3 [2024-10-24 16:12:17,103 INFO L396 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr4REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 34 more)] === [2024-10-24 16:12:17,103 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-24 16:12:17,103 INFO L85 PathProgramCache]: Analyzing trace with hash -197517515, now seen corresponding path program 1 times [2024-10-24 16:12:17,104 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-24 16:12:17,104 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1736511673] [2024-10-24 16:12:17,104 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-24 16:12:17,104 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-24 16:12:17,132 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 16:12:17,281 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2024-10-24 16:12:17,282 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 16:12:17,284 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 7 [2024-10-24 16:12:17,287 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 16:12:17,290 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 12 [2024-10-24 16:12:17,292 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 16:12:17,296 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 17 [2024-10-24 16:12:17,299 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 16:12:17,302 INFO L134 CoverageAnalysis]: Checked inductivity of 24 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 24 trivial. 0 not checked. [2024-10-24 16:12:17,303 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-24 16:12:17,303 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1736511673] [2024-10-24 16:12:17,304 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1736511673] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-24 16:12:17,304 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-24 16:12:17,304 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-10-24 16:12:17,304 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [895387561] [2024-10-24 16:12:17,304 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-24 16:12:17,304 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-10-24 16:12:17,305 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-24 16:12:17,305 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-10-24 16:12:17,306 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-10-24 16:12:17,306 INFO L87 Difference]: Start difference. First operand 90 states and 100 transitions. Second operand has 4 states, 3 states have (on average 3.6666666666666665) internal successors, (11), 4 states have internal predecessors, (11), 2 states have call successors, (4), 1 states have call predecessors, (4), 1 states have return successors, (4), 2 states have call predecessors, (4), 2 states have call successors, (4) [2024-10-24 16:12:17,392 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-24 16:12:17,393 INFO L93 Difference]: Finished difference Result 88 states and 98 transitions. [2024-10-24 16:12:17,393 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-10-24 16:12:17,393 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 3 states have (on average 3.6666666666666665) internal successors, (11), 4 states have internal predecessors, (11), 2 states have call successors, (4), 1 states have call predecessors, (4), 1 states have return successors, (4), 2 states have call predecessors, (4), 2 states have call successors, (4) Word has length 28 [2024-10-24 16:12:17,394 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-24 16:12:17,394 INFO L225 Difference]: With dead ends: 88 [2024-10-24 16:12:17,395 INFO L226 Difference]: Without dead ends: 88 [2024-10-24 16:12:17,395 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 12 GetRequests, 10 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-10-24 16:12:17,396 INFO L432 NwaCegarLoop]: 78 mSDtfsCounter, 14 mSDsluCounter, 91 mSDsCounter, 0 mSdLazyCounter, 93 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 14 SdHoareTripleChecker+Valid, 169 SdHoareTripleChecker+Invalid, 94 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 93 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-10-24 16:12:17,397 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [14 Valid, 169 Invalid, 94 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 93 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-10-24 16:12:17,398 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 88 states. [2024-10-24 16:12:17,402 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 88 to 88. [2024-10-24 16:12:17,402 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 88 states, 45 states have (on average 1.7777777777777777) internal successors, (80), 75 states have internal predecessors, (80), 9 states have call successors, (9), 3 states have call predecessors, (9), 3 states have return successors, (9), 9 states have call predecessors, (9), 9 states have call successors, (9) [2024-10-24 16:12:17,403 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 88 states to 88 states and 98 transitions. [2024-10-24 16:12:17,403 INFO L78 Accepts]: Start accepts. Automaton has 88 states and 98 transitions. Word has length 28 [2024-10-24 16:12:17,404 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-24 16:12:17,404 INFO L471 AbstractCegarLoop]: Abstraction has 88 states and 98 transitions. [2024-10-24 16:12:17,404 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 3 states have (on average 3.6666666666666665) internal successors, (11), 4 states have internal predecessors, (11), 2 states have call successors, (4), 1 states have call predecessors, (4), 1 states have return successors, (4), 2 states have call predecessors, (4), 2 states have call successors, (4) [2024-10-24 16:12:17,404 INFO L276 IsEmpty]: Start isEmpty. Operand 88 states and 98 transitions. [2024-10-24 16:12:17,405 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 29 [2024-10-24 16:12:17,405 INFO L207 NwaCegarLoop]: Found error trace [2024-10-24 16:12:17,405 INFO L215 NwaCegarLoop]: trace histogram [4, 4, 4, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-24 16:12:17,405 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2024-10-24 16:12:17,405 INFO L396 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr5REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 34 more)] === [2024-10-24 16:12:17,406 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-24 16:12:17,406 INFO L85 PathProgramCache]: Analyzing trace with hash -197517514, now seen corresponding path program 1 times [2024-10-24 16:12:17,406 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-24 16:12:17,406 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1264310381] [2024-10-24 16:12:17,406 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-24 16:12:17,406 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-24 16:12:17,428 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 16:12:17,637 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2024-10-24 16:12:17,638 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 16:12:17,640 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 7 [2024-10-24 16:12:17,642 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 16:12:17,647 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 12 [2024-10-24 16:12:17,648 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 16:12:17,653 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 17 [2024-10-24 16:12:17,655 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 16:12:17,660 INFO L134 CoverageAnalysis]: Checked inductivity of 24 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 24 trivial. 0 not checked. [2024-10-24 16:12:17,660 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-24 16:12:17,660 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1264310381] [2024-10-24 16:12:17,662 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1264310381] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-24 16:12:17,662 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-24 16:12:17,662 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2024-10-24 16:12:17,662 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [804815185] [2024-10-24 16:12:17,663 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-24 16:12:17,663 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2024-10-24 16:12:17,663 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-24 16:12:17,664 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2024-10-24 16:12:17,664 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2024-10-24 16:12:17,664 INFO L87 Difference]: Start difference. First operand 88 states and 98 transitions. Second operand has 5 states, 4 states have (on average 2.75) internal successors, (11), 5 states have internal predecessors, (11), 2 states have call successors, (4), 1 states have call predecessors, (4), 1 states have return successors, (4), 2 states have call predecessors, (4), 2 states have call successors, (4) [2024-10-24 16:12:17,784 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-24 16:12:17,784 INFO L93 Difference]: Finished difference Result 97 states and 111 transitions. [2024-10-24 16:12:17,785 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-10-24 16:12:17,785 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 4 states have (on average 2.75) internal successors, (11), 5 states have internal predecessors, (11), 2 states have call successors, (4), 1 states have call predecessors, (4), 1 states have return successors, (4), 2 states have call predecessors, (4), 2 states have call successors, (4) Word has length 28 [2024-10-24 16:12:17,787 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-24 16:12:17,787 INFO L225 Difference]: With dead ends: 97 [2024-10-24 16:12:17,787 INFO L226 Difference]: Without dead ends: 97 [2024-10-24 16:12:17,788 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 12 GetRequests, 9 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2024-10-24 16:12:17,788 INFO L432 NwaCegarLoop]: 77 mSDtfsCounter, 7 mSDsluCounter, 97 mSDsCounter, 0 mSdLazyCounter, 109 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 7 SdHoareTripleChecker+Valid, 174 SdHoareTripleChecker+Invalid, 109 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 109 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-10-24 16:12:17,789 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [7 Valid, 174 Invalid, 109 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 109 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-10-24 16:12:17,790 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 97 states. [2024-10-24 16:12:17,798 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 97 to 93. [2024-10-24 16:12:17,798 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 93 states, 50 states have (on average 1.78) internal successors, (89), 80 states have internal predecessors, (89), 9 states have call successors, (9), 3 states have call predecessors, (9), 3 states have return successors, (9), 9 states have call predecessors, (9), 9 states have call successors, (9) [2024-10-24 16:12:17,799 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 93 states to 93 states and 107 transitions. [2024-10-24 16:12:17,799 INFO L78 Accepts]: Start accepts. Automaton has 93 states and 107 transitions. Word has length 28 [2024-10-24 16:12:17,799 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-24 16:12:17,799 INFO L471 AbstractCegarLoop]: Abstraction has 93 states and 107 transitions. [2024-10-24 16:12:17,799 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 4 states have (on average 2.75) internal successors, (11), 5 states have internal predecessors, (11), 2 states have call successors, (4), 1 states have call predecessors, (4), 1 states have return successors, (4), 2 states have call predecessors, (4), 2 states have call successors, (4) [2024-10-24 16:12:17,799 INFO L276 IsEmpty]: Start isEmpty. Operand 93 states and 107 transitions. [2024-10-24 16:12:17,800 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 30 [2024-10-24 16:12:17,800 INFO L207 NwaCegarLoop]: Found error trace [2024-10-24 16:12:17,800 INFO L215 NwaCegarLoop]: trace histogram [4, 4, 4, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-24 16:12:17,800 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2024-10-24 16:12:17,800 INFO L396 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr7REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 34 more)] === [2024-10-24 16:12:17,801 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-24 16:12:17,801 INFO L85 PathProgramCache]: Analyzing trace with hash -1828075652, now seen corresponding path program 1 times [2024-10-24 16:12:17,801 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-24 16:12:17,801 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1276495039] [2024-10-24 16:12:17,805 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-24 16:12:17,806 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-24 16:12:17,849 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 16:12:18,223 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2024-10-24 16:12:18,224 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 16:12:18,225 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 7 [2024-10-24 16:12:18,227 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 16:12:18,234 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 12 [2024-10-24 16:12:18,236 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 16:12:18,242 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 17 [2024-10-24 16:12:18,250 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 16:12:18,293 INFO L134 CoverageAnalysis]: Checked inductivity of 24 backedges. 9 proven. 0 refuted. 0 times theorem prover too weak. 15 trivial. 0 not checked. [2024-10-24 16:12:18,294 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-24 16:12:18,294 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1276495039] [2024-10-24 16:12:18,294 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1276495039] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-24 16:12:18,294 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-24 16:12:18,294 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2024-10-24 16:12:18,295 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2081035967] [2024-10-24 16:12:18,295 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-24 16:12:18,295 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2024-10-24 16:12:18,295 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-24 16:12:18,296 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2024-10-24 16:12:18,296 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=21, Invalid=69, Unknown=0, NotChecked=0, Total=90 [2024-10-24 16:12:18,296 INFO L87 Difference]: Start difference. First operand 93 states and 107 transitions. Second operand has 10 states, 8 states have (on average 1.875) internal successors, (15), 10 states have internal predecessors, (15), 2 states have call successors, (4), 1 states have call predecessors, (4), 2 states have return successors, (4), 3 states have call predecessors, (4), 2 states have call successors, (4) [2024-10-24 16:12:18,599 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-24 16:12:18,599 INFO L93 Difference]: Finished difference Result 107 states and 123 transitions. [2024-10-24 16:12:18,599 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2024-10-24 16:12:18,599 INFO L78 Accepts]: Start accepts. Automaton has has 10 states, 8 states have (on average 1.875) internal successors, (15), 10 states have internal predecessors, (15), 2 states have call successors, (4), 1 states have call predecessors, (4), 2 states have return successors, (4), 3 states have call predecessors, (4), 2 states have call successors, (4) Word has length 29 [2024-10-24 16:12:18,600 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-24 16:12:18,600 INFO L225 Difference]: With dead ends: 107 [2024-10-24 16:12:18,600 INFO L226 Difference]: Without dead ends: 107 [2024-10-24 16:12:18,601 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 16 GetRequests, 8 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 15 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=21, Invalid=69, Unknown=0, NotChecked=0, Total=90 [2024-10-24 16:12:18,601 INFO L432 NwaCegarLoop]: 70 mSDtfsCounter, 23 mSDsluCounter, 341 mSDsCounter, 0 mSdLazyCounter, 360 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 23 SdHoareTripleChecker+Valid, 411 SdHoareTripleChecker+Invalid, 360 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 360 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2024-10-24 16:12:18,601 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [23 Valid, 411 Invalid, 360 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 360 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2024-10-24 16:12:18,602 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 107 states. [2024-10-24 16:12:18,606 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 107 to 96. [2024-10-24 16:12:18,606 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 96 states, 53 states have (on average 1.7547169811320755) internal successors, (93), 83 states have internal predecessors, (93), 9 states have call successors, (9), 3 states have call predecessors, (9), 3 states have return successors, (9), 9 states have call predecessors, (9), 9 states have call successors, (9) [2024-10-24 16:12:18,607 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 96 states to 96 states and 111 transitions. [2024-10-24 16:12:18,607 INFO L78 Accepts]: Start accepts. Automaton has 96 states and 111 transitions. Word has length 29 [2024-10-24 16:12:18,607 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-24 16:12:18,607 INFO L471 AbstractCegarLoop]: Abstraction has 96 states and 111 transitions. [2024-10-24 16:12:18,608 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 8 states have (on average 1.875) internal successors, (15), 10 states have internal predecessors, (15), 2 states have call successors, (4), 1 states have call predecessors, (4), 2 states have return successors, (4), 3 states have call predecessors, (4), 2 states have call successors, (4) [2024-10-24 16:12:18,608 INFO L276 IsEmpty]: Start isEmpty. Operand 96 states and 111 transitions. [2024-10-24 16:12:18,608 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 33 [2024-10-24 16:12:18,609 INFO L207 NwaCegarLoop]: Found error trace [2024-10-24 16:12:18,609 INFO L215 NwaCegarLoop]: trace histogram [4, 4, 4, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-24 16:12:18,609 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2024-10-24 16:12:18,609 INFO L396 AbstractCegarLoop]: === Iteration 8 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONMEMORY_LEAK === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 34 more)] === [2024-10-24 16:12:18,609 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-24 16:12:18,613 INFO L85 PathProgramCache]: Analyzing trace with hash -959630336, now seen corresponding path program 1 times [2024-10-24 16:12:18,613 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-24 16:12:18,613 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1075780482] [2024-10-24 16:12:18,613 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-24 16:12:18,613 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-24 16:12:18,641 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 16:12:18,769 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2024-10-24 16:12:18,770 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 16:12:18,772 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 7 [2024-10-24 16:12:18,774 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 16:12:18,811 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 12 [2024-10-24 16:12:18,813 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 16:12:18,819 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 17 [2024-10-24 16:12:18,821 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 16:12:18,823 INFO L134 CoverageAnalysis]: Checked inductivity of 24 backedges. 3 proven. 6 refuted. 0 times theorem prover too weak. 15 trivial. 0 not checked. [2024-10-24 16:12:18,825 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-24 16:12:18,826 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1075780482] [2024-10-24 16:12:18,826 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1075780482] provided 0 perfect and 1 imperfect interpolant sequences [2024-10-24 16:12:18,826 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1910929782] [2024-10-24 16:12:18,826 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-24 16:12:18,826 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-10-24 16:12:18,827 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-10-24 16:12:18,828 INFO L229 MonitoredProcess]: Starting monitored process 4 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-10-24 16:12:18,830 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Waiting until timeout for monitored process [2024-10-24 16:12:18,902 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 16:12:18,904 INFO L255 TraceCheckSpWp]: Trace formula consists of 156 conjuncts, 12 conjuncts are in the unsatisfiable core [2024-10-24 16:12:18,905 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-24 16:12:18,990 INFO L134 CoverageAnalysis]: Checked inductivity of 24 backedges. 6 proven. 3 refuted. 0 times theorem prover too weak. 15 trivial. 0 not checked. [2024-10-24 16:12:18,991 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-10-24 16:12:19,155 INFO L134 CoverageAnalysis]: Checked inductivity of 24 backedges. 6 proven. 3 refuted. 0 times theorem prover too weak. 15 trivial. 0 not checked. [2024-10-24 16:12:19,156 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1910929782] provided 0 perfect and 2 imperfect interpolant sequences [2024-10-24 16:12:19,156 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2024-10-24 16:12:19,156 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [9, 7, 7] total 16 [2024-10-24 16:12:19,157 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [914973058] [2024-10-24 16:12:19,157 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2024-10-24 16:12:19,158 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 16 states [2024-10-24 16:12:19,158 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-24 16:12:19,159 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 16 interpolants. [2024-10-24 16:12:19,160 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=43, Invalid=197, Unknown=0, NotChecked=0, Total=240 [2024-10-24 16:12:19,160 INFO L87 Difference]: Start difference. First operand 96 states and 111 transitions. Second operand has 16 states, 12 states have (on average 2.4166666666666665) internal successors, (29), 15 states have internal predecessors, (29), 9 states have call successors, (11), 2 states have call predecessors, (11), 2 states have return successors, (10), 7 states have call predecessors, (10), 8 states have call successors, (10) [2024-10-24 16:12:19,514 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-24 16:12:19,514 INFO L93 Difference]: Finished difference Result 133 states and 148 transitions. [2024-10-24 16:12:19,515 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2024-10-24 16:12:19,515 INFO L78 Accepts]: Start accepts. Automaton has has 16 states, 12 states have (on average 2.4166666666666665) internal successors, (29), 15 states have internal predecessors, (29), 9 states have call successors, (11), 2 states have call predecessors, (11), 2 states have return successors, (10), 7 states have call predecessors, (10), 8 states have call successors, (10) Word has length 32 [2024-10-24 16:12:19,515 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-24 16:12:19,516 INFO L225 Difference]: With dead ends: 133 [2024-10-24 16:12:19,516 INFO L226 Difference]: Without dead ends: 133 [2024-10-24 16:12:19,517 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 85 GetRequests, 64 SyntacticMatches, 0 SemanticMatches, 21 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 43 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=105, Invalid=401, Unknown=0, NotChecked=0, Total=506 [2024-10-24 16:12:19,518 INFO L432 NwaCegarLoop]: 107 mSDtfsCounter, 181 mSDsluCounter, 1113 mSDsCounter, 0 mSdLazyCounter, 278 mSolverCounterSat, 21 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 181 SdHoareTripleChecker+Valid, 1220 SdHoareTripleChecker+Invalid, 299 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 21 IncrementalHoareTripleChecker+Valid, 278 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2024-10-24 16:12:19,518 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [181 Valid, 1220 Invalid, 299 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [21 Valid, 278 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2024-10-24 16:12:19,519 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 133 states. [2024-10-24 16:12:19,522 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 133 to 96. [2024-10-24 16:12:19,522 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 96 states, 53 states have (on average 1.7358490566037736) internal successors, (92), 83 states have internal predecessors, (92), 9 states have call successors, (9), 3 states have call predecessors, (9), 3 states have return successors, (9), 9 states have call predecessors, (9), 9 states have call successors, (9) [2024-10-24 16:12:19,523 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 96 states to 96 states and 110 transitions. [2024-10-24 16:12:19,527 INFO L78 Accepts]: Start accepts. Automaton has 96 states and 110 transitions. Word has length 32 [2024-10-24 16:12:19,527 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-24 16:12:19,527 INFO L471 AbstractCegarLoop]: Abstraction has 96 states and 110 transitions. [2024-10-24 16:12:19,527 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 16 states, 12 states have (on average 2.4166666666666665) internal successors, (29), 15 states have internal predecessors, (29), 9 states have call successors, (11), 2 states have call predecessors, (11), 2 states have return successors, (10), 7 states have call predecessors, (10), 8 states have call successors, (10) [2024-10-24 16:12:19,527 INFO L276 IsEmpty]: Start isEmpty. Operand 96 states and 110 transitions. [2024-10-24 16:12:19,528 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 32 [2024-10-24 16:12:19,528 INFO L207 NwaCegarLoop]: Found error trace [2024-10-24 16:12:19,528 INFO L215 NwaCegarLoop]: trace histogram [4, 4, 4, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-24 16:12:19,548 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Forceful destruction successful, exit code 0 [2024-10-24 16:12:19,729 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7,4 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-10-24 16:12:19,729 INFO L396 AbstractCegarLoop]: === Iteration 9 === Targeting ULTIMATE.startErr5REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 34 more)] === [2024-10-24 16:12:19,730 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-24 16:12:19,730 INFO L85 PathProgramCache]: Analyzing trace with hash -140251464, now seen corresponding path program 1 times [2024-10-24 16:12:19,730 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-24 16:12:19,730 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [66225249] [2024-10-24 16:12:19,730 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-24 16:12:19,730 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-24 16:12:19,740 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 16:12:19,782 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2024-10-24 16:12:19,783 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 16:12:19,784 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 7 [2024-10-24 16:12:19,785 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 16:12:19,786 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 12 [2024-10-24 16:12:19,787 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 16:12:19,789 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 17 [2024-10-24 16:12:19,789 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 16:12:19,791 INFO L134 CoverageAnalysis]: Checked inductivity of 26 backedges. 1 proven. 1 refuted. 0 times theorem prover too weak. 24 trivial. 0 not checked. [2024-10-24 16:12:19,792 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-24 16:12:19,792 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [66225249] [2024-10-24 16:12:19,792 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [66225249] provided 0 perfect and 1 imperfect interpolant sequences [2024-10-24 16:12:19,792 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1329974084] [2024-10-24 16:12:19,792 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-24 16:12:19,792 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-10-24 16:12:19,792 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-10-24 16:12:19,794 INFO L229 MonitoredProcess]: Starting monitored process 5 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-10-24 16:12:19,796 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Waiting until timeout for monitored process [2024-10-24 16:12:19,863 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 16:12:19,864 INFO L255 TraceCheckSpWp]: Trace formula consists of 151 conjuncts, 4 conjuncts are in the unsatisfiable core [2024-10-24 16:12:19,865 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-24 16:12:19,880 INFO L134 CoverageAnalysis]: Checked inductivity of 26 backedges. 2 proven. 0 refuted. 0 times theorem prover too weak. 24 trivial. 0 not checked. [2024-10-24 16:12:19,880 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-10-24 16:12:19,880 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1329974084] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-24 16:12:19,880 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2024-10-24 16:12:19,881 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [6] total 6 [2024-10-24 16:12:19,881 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1662930623] [2024-10-24 16:12:19,881 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-24 16:12:19,882 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2024-10-24 16:12:19,882 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-24 16:12:19,883 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2024-10-24 16:12:19,883 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2024-10-24 16:12:19,883 INFO L87 Difference]: Start difference. First operand 96 states and 110 transitions. Second operand has 5 states, 5 states have (on average 2.8) internal successors, (14), 5 states have internal predecessors, (14), 1 states have call successors, (4), 1 states have call predecessors, (4), 1 states have return successors, (4), 1 states have call predecessors, (4), 1 states have call successors, (4) [2024-10-24 16:12:19,946 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-24 16:12:19,946 INFO L93 Difference]: Finished difference Result 106 states and 125 transitions. [2024-10-24 16:12:19,946 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-10-24 16:12:19,947 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 2.8) internal successors, (14), 5 states have internal predecessors, (14), 1 states have call successors, (4), 1 states have call predecessors, (4), 1 states have return successors, (4), 1 states have call predecessors, (4), 1 states have call successors, (4) Word has length 31 [2024-10-24 16:12:19,947 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-24 16:12:19,948 INFO L225 Difference]: With dead ends: 106 [2024-10-24 16:12:19,948 INFO L226 Difference]: Without dead ends: 106 [2024-10-24 16:12:19,948 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 44 GetRequests, 40 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2024-10-24 16:12:19,949 INFO L432 NwaCegarLoop]: 78 mSDtfsCounter, 6 mSDsluCounter, 227 mSDsCounter, 0 mSdLazyCounter, 78 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 6 SdHoareTripleChecker+Valid, 305 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.1s IncrementalHoareTripleChecker+Time [2024-10-24 16:12:19,949 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [6 Valid, 305 Invalid, 78 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 78 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-10-24 16:12:19,949 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 106 states. [2024-10-24 16:12:19,952 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 106 to 99. [2024-10-24 16:12:19,953 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 99 states, 56 states have (on average 1.7142857142857142) internal successors, (96), 86 states have internal predecessors, (96), 9 states have call successors, (9), 3 states have call predecessors, (9), 3 states have return successors, (9), 9 states have call predecessors, (9), 9 states have call successors, (9) [2024-10-24 16:12:19,953 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 99 states to 99 states and 114 transitions. [2024-10-24 16:12:19,953 INFO L78 Accepts]: Start accepts. Automaton has 99 states and 114 transitions. Word has length 31 [2024-10-24 16:12:19,954 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-24 16:12:19,954 INFO L471 AbstractCegarLoop]: Abstraction has 99 states and 114 transitions. [2024-10-24 16:12:19,954 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 2.8) internal successors, (14), 5 states have internal predecessors, (14), 1 states have call successors, (4), 1 states have call predecessors, (4), 1 states have return successors, (4), 1 states have call predecessors, (4), 1 states have call successors, (4) [2024-10-24 16:12:19,954 INFO L276 IsEmpty]: Start isEmpty. Operand 99 states and 114 transitions. [2024-10-24 16:12:19,955 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 32 [2024-10-24 16:12:19,955 INFO L207 NwaCegarLoop]: Found error trace [2024-10-24 16:12:19,955 INFO L215 NwaCegarLoop]: trace histogram [4, 4, 4, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-24 16:12:19,974 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Ended with exit code 0 [2024-10-24 16:12:20,159 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8,5 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-10-24 16:12:20,160 INFO L396 AbstractCegarLoop]: === Iteration 10 === Targeting ULTIMATE.startErr8REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 34 more)] === [2024-10-24 16:12:20,160 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-24 16:12:20,160 INFO L85 PathProgramCache]: Analyzing trace with hash -139077796, now seen corresponding path program 1 times [2024-10-24 16:12:20,160 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-24 16:12:20,160 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1756535833] [2024-10-24 16:12:20,160 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-24 16:12:20,161 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-24 16:12:20,173 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 16:12:20,244 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2024-10-24 16:12:20,245 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 16:12:20,247 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 7 [2024-10-24 16:12:20,247 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 16:12:20,249 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 12 [2024-10-24 16:12:20,250 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 16:12:20,254 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 17 [2024-10-24 16:12:20,254 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 16:12:20,256 INFO L134 CoverageAnalysis]: Checked inductivity of 24 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 24 trivial. 0 not checked. [2024-10-24 16:12:20,256 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-24 16:12:20,256 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1756535833] [2024-10-24 16:12:20,256 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1756535833] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-24 16:12:20,256 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-24 16:12:20,256 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-10-24 16:12:20,257 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1616092095] [2024-10-24 16:12:20,257 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-24 16:12:20,257 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-10-24 16:12:20,257 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-24 16:12:20,258 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-10-24 16:12:20,258 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-10-24 16:12:20,258 INFO L87 Difference]: Start difference. First operand 99 states and 114 transitions. Second operand has 3 states, 2 states have (on average 7.0) internal successors, (14), 3 states have internal predecessors, (14), 1 states have call successors, (4), 1 states have call predecessors, (4), 1 states have return successors, (4), 1 states have call predecessors, (4), 1 states have call successors, (4) [2024-10-24 16:12:20,308 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-24 16:12:20,309 INFO L93 Difference]: Finished difference Result 99 states and 114 transitions. [2024-10-24 16:12:20,309 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-10-24 16:12:20,309 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 2 states have (on average 7.0) internal successors, (14), 3 states have internal predecessors, (14), 1 states have call successors, (4), 1 states have call predecessors, (4), 1 states have return successors, (4), 1 states have call predecessors, (4), 1 states have call successors, (4) Word has length 31 [2024-10-24 16:12:20,310 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-24 16:12:20,310 INFO L225 Difference]: With dead ends: 99 [2024-10-24 16:12:20,310 INFO L226 Difference]: Without dead ends: 99 [2024-10-24 16:12:20,310 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 9 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-10-24 16:12:20,311 INFO L432 NwaCegarLoop]: 81 mSDtfsCounter, 7 mSDsluCounter, 50 mSDsCounter, 0 mSdLazyCounter, 44 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 7 SdHoareTripleChecker+Valid, 131 SdHoareTripleChecker+Invalid, 44 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 44 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-10-24 16:12:20,311 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [7 Valid, 131 Invalid, 44 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 44 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-10-24 16:12:20,311 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 99 states. [2024-10-24 16:12:20,317 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 99 to 98. [2024-10-24 16:12:20,317 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 98 states, 56 states have (on average 1.6964285714285714) internal successors, (95), 85 states have internal predecessors, (95), 9 states have call successors, (9), 3 states have call predecessors, (9), 3 states have return successors, (9), 9 states have call predecessors, (9), 9 states have call successors, (9) [2024-10-24 16:12:20,318 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 98 states to 98 states and 113 transitions. [2024-10-24 16:12:20,318 INFO L78 Accepts]: Start accepts. Automaton has 98 states and 113 transitions. Word has length 31 [2024-10-24 16:12:20,318 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-24 16:12:20,318 INFO L471 AbstractCegarLoop]: Abstraction has 98 states and 113 transitions. [2024-10-24 16:12:20,318 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 2 states have (on average 7.0) internal successors, (14), 3 states have internal predecessors, (14), 1 states have call successors, (4), 1 states have call predecessors, (4), 1 states have return successors, (4), 1 states have call predecessors, (4), 1 states have call successors, (4) [2024-10-24 16:12:20,318 INFO L276 IsEmpty]: Start isEmpty. Operand 98 states and 113 transitions. [2024-10-24 16:12:20,319 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 32 [2024-10-24 16:12:20,319 INFO L207 NwaCegarLoop]: Found error trace [2024-10-24 16:12:20,319 INFO L215 NwaCegarLoop]: trace histogram [4, 4, 4, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-24 16:12:20,319 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9 [2024-10-24 16:12:20,321 INFO L396 AbstractCegarLoop]: === Iteration 11 === Targeting ULTIMATE.startErr9REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 34 more)] === [2024-10-24 16:12:20,322 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-24 16:12:20,322 INFO L85 PathProgramCache]: Analyzing trace with hash -139077795, now seen corresponding path program 1 times [2024-10-24 16:12:20,322 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-24 16:12:20,322 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1039936598] [2024-10-24 16:12:20,322 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-24 16:12:20,323 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-24 16:12:20,341 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 16:12:20,429 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2024-10-24 16:12:20,430 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 16:12:20,432 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 7 [2024-10-24 16:12:20,433 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 16:12:20,434 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 12 [2024-10-24 16:12:20,434 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 16:12:20,435 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 17 [2024-10-24 16:12:20,436 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 16:12:20,437 INFO L134 CoverageAnalysis]: Checked inductivity of 24 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 24 trivial. 0 not checked. [2024-10-24 16:12:20,437 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-24 16:12:20,437 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1039936598] [2024-10-24 16:12:20,438 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1039936598] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-24 16:12:20,438 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-24 16:12:20,438 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-10-24 16:12:20,438 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [860419290] [2024-10-24 16:12:20,438 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-24 16:12:20,438 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-10-24 16:12:20,439 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-24 16:12:20,439 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-10-24 16:12:20,439 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-10-24 16:12:20,439 INFO L87 Difference]: Start difference. First operand 98 states and 113 transitions. Second operand has 3 states, 2 states have (on average 7.0) internal successors, (14), 3 states have internal predecessors, (14), 1 states have call successors, (4), 1 states have call predecessors, (4), 1 states have return successors, (4), 1 states have call predecessors, (4), 1 states have call successors, (4) [2024-10-24 16:12:20,484 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-24 16:12:20,485 INFO L93 Difference]: Finished difference Result 98 states and 113 transitions. [2024-10-24 16:12:20,485 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-10-24 16:12:20,485 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 2 states have (on average 7.0) internal successors, (14), 3 states have internal predecessors, (14), 1 states have call successors, (4), 1 states have call predecessors, (4), 1 states have return successors, (4), 1 states have call predecessors, (4), 1 states have call successors, (4) Word has length 31 [2024-10-24 16:12:20,485 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-24 16:12:20,486 INFO L225 Difference]: With dead ends: 98 [2024-10-24 16:12:20,487 INFO L226 Difference]: Without dead ends: 98 [2024-10-24 16:12:20,487 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 9 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-10-24 16:12:20,487 INFO L432 NwaCegarLoop]: 79 mSDtfsCounter, 7 mSDsluCounter, 53 mSDsCounter, 0 mSdLazyCounter, 41 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 7 SdHoareTripleChecker+Valid, 132 SdHoareTripleChecker+Invalid, 41 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 41 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-10-24 16:12:20,488 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [7 Valid, 132 Invalid, 41 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 41 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-10-24 16:12:20,489 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 98 states. [2024-10-24 16:12:20,491 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 98 to 97. [2024-10-24 16:12:20,491 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 97 states, 56 states have (on average 1.6785714285714286) internal successors, (94), 84 states have internal predecessors, (94), 9 states have call successors, (9), 3 states have call predecessors, (9), 3 states have return successors, (9), 9 states have call predecessors, (9), 9 states have call successors, (9) [2024-10-24 16:12:20,492 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 97 states to 97 states and 112 transitions. [2024-10-24 16:12:20,493 INFO L78 Accepts]: Start accepts. Automaton has 97 states and 112 transitions. Word has length 31 [2024-10-24 16:12:20,493 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-24 16:12:20,493 INFO L471 AbstractCegarLoop]: Abstraction has 97 states and 112 transitions. [2024-10-24 16:12:20,493 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 2 states have (on average 7.0) internal successors, (14), 3 states have internal predecessors, (14), 1 states have call successors, (4), 1 states have call predecessors, (4), 1 states have return successors, (4), 1 states have call predecessors, (4), 1 states have call successors, (4) [2024-10-24 16:12:20,493 INFO L276 IsEmpty]: Start isEmpty. Operand 97 states and 112 transitions. [2024-10-24 16:12:20,494 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 33 [2024-10-24 16:12:20,495 INFO L207 NwaCegarLoop]: Found error trace [2024-10-24 16:12:20,496 INFO L215 NwaCegarLoop]: trace histogram [4, 4, 4, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-24 16:12:20,496 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10 [2024-10-24 16:12:20,496 INFO L396 AbstractCegarLoop]: === Iteration 12 === Targeting ULTIMATE.startErr10REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 34 more)] === [2024-10-24 16:12:20,496 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-24 16:12:20,496 INFO L85 PathProgramCache]: Analyzing trace with hash -16444355, now seen corresponding path program 1 times [2024-10-24 16:12:20,496 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-24 16:12:20,496 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1443549794] [2024-10-24 16:12:20,496 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-24 16:12:20,497 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-24 16:12:20,506 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 16:12:20,545 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2024-10-24 16:12:20,546 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 16:12:20,548 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 7 [2024-10-24 16:12:20,549 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 16:12:20,550 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 12 [2024-10-24 16:12:20,551 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 16:12:20,551 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 17 [2024-10-24 16:12:20,552 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 16:12:20,553 INFO L134 CoverageAnalysis]: Checked inductivity of 24 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 24 trivial. 0 not checked. [2024-10-24 16:12:20,554 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-24 16:12:20,555 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1443549794] [2024-10-24 16:12:20,555 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1443549794] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-24 16:12:20,555 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-24 16:12:20,555 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-10-24 16:12:20,557 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1608340630] [2024-10-24 16:12:20,557 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-24 16:12:20,557 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-10-24 16:12:20,557 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-24 16:12:20,558 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-10-24 16:12:20,558 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-10-24 16:12:20,558 INFO L87 Difference]: Start difference. First operand 97 states and 112 transitions. Second operand has 3 states, 2 states have (on average 7.5) internal successors, (15), 3 states have internal predecessors, (15), 1 states have call successors, (4), 1 states have call predecessors, (4), 1 states have return successors, (4), 1 states have call predecessors, (4), 1 states have call successors, (4) [2024-10-24 16:12:20,604 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-24 16:12:20,604 INFO L93 Difference]: Finished difference Result 97 states and 112 transitions. [2024-10-24 16:12:20,605 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-10-24 16:12:20,605 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 2 states have (on average 7.5) internal successors, (15), 3 states have internal predecessors, (15), 1 states have call successors, (4), 1 states have call predecessors, (4), 1 states have return successors, (4), 1 states have call predecessors, (4), 1 states have call successors, (4) Word has length 32 [2024-10-24 16:12:20,605 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-24 16:12:20,606 INFO L225 Difference]: With dead ends: 97 [2024-10-24 16:12:20,607 INFO L226 Difference]: Without dead ends: 97 [2024-10-24 16:12:20,607 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 9 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-10-24 16:12:20,608 INFO L432 NwaCegarLoop]: 79 mSDtfsCounter, 7 mSDsluCounter, 49 mSDsCounter, 0 mSdLazyCounter, 42 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 7 SdHoareTripleChecker+Valid, 128 SdHoareTripleChecker+Invalid, 42 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 42 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-10-24 16:12:20,608 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [7 Valid, 128 Invalid, 42 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 42 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-10-24 16:12:20,609 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 97 states. [2024-10-24 16:12:20,612 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 97 to 96. [2024-10-24 16:12:20,612 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 96 states, 56 states have (on average 1.6607142857142858) internal successors, (93), 83 states have internal predecessors, (93), 9 states have call successors, (9), 3 states have call predecessors, (9), 3 states have return successors, (9), 9 states have call predecessors, (9), 9 states have call successors, (9) [2024-10-24 16:12:20,613 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 96 states to 96 states and 111 transitions. [2024-10-24 16:12:20,613 INFO L78 Accepts]: Start accepts. Automaton has 96 states and 111 transitions. Word has length 32 [2024-10-24 16:12:20,613 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-24 16:12:20,613 INFO L471 AbstractCegarLoop]: Abstraction has 96 states and 111 transitions. [2024-10-24 16:12:20,616 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 2 states have (on average 7.5) internal successors, (15), 3 states have internal predecessors, (15), 1 states have call successors, (4), 1 states have call predecessors, (4), 1 states have return successors, (4), 1 states have call predecessors, (4), 1 states have call successors, (4) [2024-10-24 16:12:20,616 INFO L276 IsEmpty]: Start isEmpty. Operand 96 states and 111 transitions. [2024-10-24 16:12:20,617 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 33 [2024-10-24 16:12:20,617 INFO L207 NwaCegarLoop]: Found error trace [2024-10-24 16:12:20,617 INFO L215 NwaCegarLoop]: trace histogram [4, 4, 4, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-24 16:12:20,617 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable11 [2024-10-24 16:12:20,617 INFO L396 AbstractCegarLoop]: === Iteration 13 === Targeting ULTIMATE.startErr11REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 34 more)] === [2024-10-24 16:12:20,617 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-24 16:12:20,617 INFO L85 PathProgramCache]: Analyzing trace with hash -16444354, now seen corresponding path program 1 times [2024-10-24 16:12:20,618 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-24 16:12:20,618 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1218706642] [2024-10-24 16:12:20,618 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-24 16:12:20,618 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-24 16:12:20,629 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 16:12:20,690 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2024-10-24 16:12:20,691 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 16:12:20,692 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 7 [2024-10-24 16:12:20,693 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 16:12:20,694 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 12 [2024-10-24 16:12:20,695 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 16:12:20,695 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 17 [2024-10-24 16:12:20,696 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 16:12:20,697 INFO L134 CoverageAnalysis]: Checked inductivity of 24 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 24 trivial. 0 not checked. [2024-10-24 16:12:20,697 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-24 16:12:20,697 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1218706642] [2024-10-24 16:12:20,697 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1218706642] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-24 16:12:20,697 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-24 16:12:20,698 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-10-24 16:12:20,698 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [7473725] [2024-10-24 16:12:20,698 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-24 16:12:20,698 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-10-24 16:12:20,698 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-24 16:12:20,699 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-10-24 16:12:20,699 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-10-24 16:12:20,700 INFO L87 Difference]: Start difference. First operand 96 states and 111 transitions. Second operand has 3 states, 2 states have (on average 7.5) internal successors, (15), 3 states have internal predecessors, (15), 1 states have call successors, (4), 1 states have call predecessors, (4), 1 states have return successors, (4), 1 states have call predecessors, (4), 1 states have call successors, (4) [2024-10-24 16:12:20,745 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-24 16:12:20,745 INFO L93 Difference]: Finished difference Result 96 states and 111 transitions. [2024-10-24 16:12:20,745 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-10-24 16:12:20,746 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 2 states have (on average 7.5) internal successors, (15), 3 states have internal predecessors, (15), 1 states have call successors, (4), 1 states have call predecessors, (4), 1 states have return successors, (4), 1 states have call predecessors, (4), 1 states have call successors, (4) Word has length 32 [2024-10-24 16:12:20,746 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-24 16:12:20,747 INFO L225 Difference]: With dead ends: 96 [2024-10-24 16:12:20,747 INFO L226 Difference]: Without dead ends: 96 [2024-10-24 16:12:20,747 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 9 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-10-24 16:12:20,747 INFO L432 NwaCegarLoop]: 77 mSDtfsCounter, 7 mSDsluCounter, 52 mSDsCounter, 0 mSdLazyCounter, 39 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 7 SdHoareTripleChecker+Valid, 129 SdHoareTripleChecker+Invalid, 39 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 39 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-10-24 16:12:20,748 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [7 Valid, 129 Invalid, 39 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 39 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-10-24 16:12:20,748 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 96 states. [2024-10-24 16:12:20,750 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 96 to 95. [2024-10-24 16:12:20,751 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 95 states, 56 states have (on average 1.6428571428571428) internal successors, (92), 82 states have internal predecessors, (92), 9 states have call successors, (9), 3 states have call predecessors, (9), 3 states have return successors, (9), 9 states have call predecessors, (9), 9 states have call successors, (9) [2024-10-24 16:12:20,752 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 95 states to 95 states and 110 transitions. [2024-10-24 16:12:20,752 INFO L78 Accepts]: Start accepts. Automaton has 95 states and 110 transitions. Word has length 32 [2024-10-24 16:12:20,752 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-24 16:12:20,752 INFO L471 AbstractCegarLoop]: Abstraction has 95 states and 110 transitions. [2024-10-24 16:12:20,752 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 2 states have (on average 7.5) internal successors, (15), 3 states have internal predecessors, (15), 1 states have call successors, (4), 1 states have call predecessors, (4), 1 states have return successors, (4), 1 states have call predecessors, (4), 1 states have call successors, (4) [2024-10-24 16:12:20,752 INFO L276 IsEmpty]: Start isEmpty. Operand 95 states and 110 transitions. [2024-10-24 16:12:20,753 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 34 [2024-10-24 16:12:20,754 INFO L207 NwaCegarLoop]: Found error trace [2024-10-24 16:12:20,754 INFO L215 NwaCegarLoop]: trace histogram [4, 4, 4, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-24 16:12:20,754 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable12 [2024-10-24 16:12:20,754 INFO L396 AbstractCegarLoop]: === Iteration 14 === Targeting ULTIMATE.startErr7REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 34 more)] === [2024-10-24 16:12:20,755 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-24 16:12:20,755 INFO L85 PathProgramCache]: Analyzing trace with hash -506150468, now seen corresponding path program 1 times [2024-10-24 16:12:20,755 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-24 16:12:20,755 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [137463934] [2024-10-24 16:12:20,755 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-24 16:12:20,755 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-24 16:12:20,789 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 16:12:21,271 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2024-10-24 16:12:21,273 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 16:12:21,306 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 7 [2024-10-24 16:12:21,307 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 16:12:21,314 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 12 [2024-10-24 16:12:21,316 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 16:12:21,321 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 17 [2024-10-24 16:12:21,325 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 16:12:21,330 INFO L134 CoverageAnalysis]: Checked inductivity of 27 backedges. 0 proven. 12 refuted. 0 times theorem prover too weak. 15 trivial. 0 not checked. [2024-10-24 16:12:21,330 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-24 16:12:21,331 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [137463934] [2024-10-24 16:12:21,331 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [137463934] provided 0 perfect and 1 imperfect interpolant sequences [2024-10-24 16:12:21,331 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1289285093] [2024-10-24 16:12:21,331 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-24 16:12:21,331 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-10-24 16:12:21,331 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-10-24 16:12:21,333 INFO L229 MonitoredProcess]: Starting monitored process 6 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-10-24 16:12:21,336 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (6)] Waiting until timeout for monitored process [2024-10-24 16:12:21,413 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 16:12:21,416 INFO L255 TraceCheckSpWp]: Trace formula consists of 167 conjuncts, 49 conjuncts are in the unsatisfiable core [2024-10-24 16:12:21,419 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-24 16:12:21,430 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 8 treesize of output 7 [2024-10-24 16:12:21,448 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 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 7 treesize of output 6 [2024-10-24 16:12:22,325 INFO L349 Elim1Store]: treesize reduction 24, result has 27.3 percent of original size [2024-10-24 16:12:22,325 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 0 disjoint index pairs (out of 3 index pairs), introduced 2 new quantified variables, introduced 3 case distinctions, treesize of input 26 treesize of output 28 [2024-10-24 16:12:22,477 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 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 0 case distinctions, treesize of input 37 treesize of output 28 [2024-10-24 16:12:22,493 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-10-24 16:12:22,495 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 47 treesize of output 36 [2024-10-24 16:12:22,520 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-10-24 16:12:22,521 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 7 [2024-10-24 16:12:22,532 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 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 0 case distinctions, treesize of input 37 treesize of output 28 [2024-10-24 16:12:22,549 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-10-24 16:12:22,551 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-10-24 16:12:22,552 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 3 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 52 treesize of output 36 [2024-10-24 16:12:22,563 INFO L349 Elim1Store]: treesize reduction 4, result has 50.0 percent of original size [2024-10-24 16:12:22,563 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 11 treesize of output 11 [2024-10-24 16:12:22,939 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 43 treesize of output 33 [2024-10-24 16:12:23,256 INFO L134 CoverageAnalysis]: Checked inductivity of 27 backedges. 18 proven. 3 refuted. 0 times theorem prover too weak. 6 trivial. 0 not checked. [2024-10-24 16:12:23,256 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-10-24 16:12:23,668 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-10-24 16:12:23,669 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 3 select indices, 3 select index equivalence classes, 0 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 3 case distinctions, treesize of input 45 treesize of output 63 [2024-10-24 16:12:24,096 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1289285093] provided 0 perfect and 1 imperfect interpolant sequences [2024-10-24 16:12:24,096 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2024-10-24 16:12:24,097 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [12, 12] total 23 [2024-10-24 16:12:24,097 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1253700805] [2024-10-24 16:12:24,097 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2024-10-24 16:12:24,097 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 24 states [2024-10-24 16:12:24,097 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-24 16:12:24,098 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 24 interpolants. [2024-10-24 16:12:24,099 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=92, Invalid=900, Unknown=0, NotChecked=0, Total=992 [2024-10-24 16:12:24,099 INFO L87 Difference]: Start difference. First operand 95 states and 110 transitions. Second operand has 24 states, 22 states have (on average 1.6818181818181819) internal successors, (37), 23 states have internal predecessors, (37), 3 states have call successors, (7), 2 states have call predecessors, (7), 4 states have return successors, (8), 5 states have call predecessors, (8), 3 states have call successors, (8) [2024-10-24 16:12:25,993 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-24 16:12:25,994 INFO L93 Difference]: Finished difference Result 143 states and 161 transitions. [2024-10-24 16:12:25,994 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 20 states. [2024-10-24 16:12:25,994 INFO L78 Accepts]: Start accepts. Automaton has has 24 states, 22 states have (on average 1.6818181818181819) internal successors, (37), 23 states have internal predecessors, (37), 3 states have call successors, (7), 2 states have call predecessors, (7), 4 states have return successors, (8), 5 states have call predecessors, (8), 3 states have call successors, (8) Word has length 33 [2024-10-24 16:12:25,994 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-24 16:12:25,995 INFO L225 Difference]: With dead ends: 143 [2024-10-24 16:12:25,996 INFO L226 Difference]: Without dead ends: 143 [2024-10-24 16:12:25,997 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 75 GetRequests, 29 SyntacticMatches, 4 SemanticMatches, 42 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 345 ImplicationChecksByTransitivity, 2.3s TimeCoverageRelationStatistics Valid=225, Invalid=1667, Unknown=0, NotChecked=0, Total=1892 [2024-10-24 16:12:25,997 INFO L432 NwaCegarLoop]: 71 mSDtfsCounter, 125 mSDsluCounter, 878 mSDsCounter, 0 mSdLazyCounter, 968 mSolverCounterSat, 12 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.9s Time, 0 mProtectedPredicate, 0 mProtectedAction, 130 SdHoareTripleChecker+Valid, 949 SdHoareTripleChecker+Invalid, 980 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 12 IncrementalHoareTripleChecker+Valid, 968 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.0s IncrementalHoareTripleChecker+Time [2024-10-24 16:12:25,997 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [130 Valid, 949 Invalid, 980 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [12 Valid, 968 Invalid, 0 Unknown, 0 Unchecked, 1.0s Time] [2024-10-24 16:12:25,998 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 143 states. [2024-10-24 16:12:26,003 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 143 to 97. [2024-10-24 16:12:26,004 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 97 states, 57 states have (on average 1.6140350877192982) internal successors, (92), 83 states have internal predecessors, (92), 9 states have call successors, (9), 4 states have call predecessors, (9), 4 states have return successors, (9), 9 states have call predecessors, (9), 9 states have call successors, (9) [2024-10-24 16:12:26,004 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 97 states to 97 states and 110 transitions. [2024-10-24 16:12:26,005 INFO L78 Accepts]: Start accepts. Automaton has 97 states and 110 transitions. Word has length 33 [2024-10-24 16:12:26,005 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-24 16:12:26,005 INFO L471 AbstractCegarLoop]: Abstraction has 97 states and 110 transitions. [2024-10-24 16:12:26,006 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 24 states, 22 states have (on average 1.6818181818181819) internal successors, (37), 23 states have internal predecessors, (37), 3 states have call successors, (7), 2 states have call predecessors, (7), 4 states have return successors, (8), 5 states have call predecessors, (8), 3 states have call successors, (8) [2024-10-24 16:12:26,006 INFO L276 IsEmpty]: Start isEmpty. Operand 97 states and 110 transitions. [2024-10-24 16:12:26,007 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 36 [2024-10-24 16:12:26,007 INFO L207 NwaCegarLoop]: Found error trace [2024-10-24 16:12:26,007 INFO L215 NwaCegarLoop]: trace histogram [4, 4, 4, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-24 16:12:26,022 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (6)] Ended with exit code 0 [2024-10-24 16:12:26,209 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,SelfDestructingSolverStorable13 [2024-10-24 16:12:26,210 INFO L396 AbstractCegarLoop]: === Iteration 15 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONMEMORY_LEAK === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 34 more)] === [2024-10-24 16:12:26,210 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-24 16:12:26,210 INFO L85 PathProgramCache]: Analyzing trace with hash 1507816066, now seen corresponding path program 1 times [2024-10-24 16:12:26,210 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-24 16:12:26,210 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [799403433] [2024-10-24 16:12:26,210 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-24 16:12:26,211 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-24 16:12:26,227 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 16:12:26,547 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2024-10-24 16:12:26,548 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 16:12:26,551 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 7 [2024-10-24 16:12:26,553 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 16:12:26,570 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 12 [2024-10-24 16:12:26,572 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 16:12:26,577 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 17 [2024-10-24 16:12:26,583 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 16:12:26,618 INFO L134 CoverageAnalysis]: Checked inductivity of 25 backedges. 10 proven. 0 refuted. 0 times theorem prover too weak. 15 trivial. 0 not checked. [2024-10-24 16:12:26,618 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-24 16:12:26,618 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [799403433] [2024-10-24 16:12:26,619 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [799403433] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-24 16:12:26,619 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-24 16:12:26,619 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2024-10-24 16:12:26,619 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [305824900] [2024-10-24 16:12:26,619 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-24 16:12:26,619 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2024-10-24 16:12:26,620 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-24 16:12:26,620 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2024-10-24 16:12:26,620 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=20, Invalid=70, Unknown=0, NotChecked=0, Total=90 [2024-10-24 16:12:26,620 INFO L87 Difference]: Start difference. First operand 97 states and 110 transitions. Second operand has 10 states, 8 states have (on average 2.5) internal successors, (20), 9 states have internal predecessors, (20), 4 states have call successors, (5), 2 states have call predecessors, (5), 2 states have return successors, (4), 4 states have call predecessors, (4), 3 states have call successors, (4) [2024-10-24 16:12:26,885 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-24 16:12:26,885 INFO L93 Difference]: Finished difference Result 99 states and 111 transitions. [2024-10-24 16:12:26,885 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2024-10-24 16:12:26,886 INFO L78 Accepts]: Start accepts. Automaton has has 10 states, 8 states have (on average 2.5) internal successors, (20), 9 states have internal predecessors, (20), 4 states have call successors, (5), 2 states have call predecessors, (5), 2 states have return successors, (4), 4 states have call predecessors, (4), 3 states have call successors, (4) Word has length 35 [2024-10-24 16:12:26,886 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-24 16:12:26,886 INFO L225 Difference]: With dead ends: 99 [2024-10-24 16:12:26,886 INFO L226 Difference]: Without dead ends: 99 [2024-10-24 16:12:26,887 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 20 GetRequests, 10 SyntacticMatches, 0 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 17 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=29, Invalid=103, Unknown=0, NotChecked=0, Total=132 [2024-10-24 16:12:26,887 INFO L432 NwaCegarLoop]: 69 mSDtfsCounter, 13 mSDsluCounter, 401 mSDsCounter, 0 mSdLazyCounter, 246 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 15 SdHoareTripleChecker+Valid, 470 SdHoareTripleChecker+Invalid, 247 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 246 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2024-10-24 16:12:26,887 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [15 Valid, 470 Invalid, 247 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 246 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2024-10-24 16:12:26,888 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 99 states. [2024-10-24 16:12:26,890 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 99 to 97. [2024-10-24 16:12:26,890 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 97 states, 57 states have (on average 1.5964912280701755) internal successors, (91), 83 states have internal predecessors, (91), 9 states have call successors, (9), 4 states have call predecessors, (9), 4 states have return successors, (9), 9 states have call predecessors, (9), 9 states have call successors, (9) [2024-10-24 16:12:26,891 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 97 states to 97 states and 109 transitions. [2024-10-24 16:12:26,891 INFO L78 Accepts]: Start accepts. Automaton has 97 states and 109 transitions. Word has length 35 [2024-10-24 16:12:26,891 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-24 16:12:26,891 INFO L471 AbstractCegarLoop]: Abstraction has 97 states and 109 transitions. [2024-10-24 16:12:26,891 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 8 states have (on average 2.5) internal successors, (20), 9 states have internal predecessors, (20), 4 states have call successors, (5), 2 states have call predecessors, (5), 2 states have return successors, (4), 4 states have call predecessors, (4), 3 states have call successors, (4) [2024-10-24 16:12:26,891 INFO L276 IsEmpty]: Start isEmpty. Operand 97 states and 109 transitions. [2024-10-24 16:12:26,892 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 36 [2024-10-24 16:12:26,892 INFO L207 NwaCegarLoop]: Found error trace [2024-10-24 16:12:26,892 INFO L215 NwaCegarLoop]: trace histogram [4, 4, 4, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-24 16:12:26,892 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable14 [2024-10-24 16:12:26,893 INFO L396 AbstractCegarLoop]: === Iteration 16 === Targeting ULTIMATE.startErr5REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 34 more)] === [2024-10-24 16:12:26,893 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-24 16:12:26,893 INFO L85 PathProgramCache]: Analyzing trace with hash -1080469256, now seen corresponding path program 1 times [2024-10-24 16:12:26,893 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-24 16:12:26,893 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [703084817] [2024-10-24 16:12:26,893 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-24 16:12:26,894 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-24 16:12:26,902 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 16:12:26,956 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2024-10-24 16:12:26,957 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 16:12:26,958 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 7 [2024-10-24 16:12:26,962 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 16:12:26,963 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 12 [2024-10-24 16:12:26,964 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 16:12:26,965 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 17 [2024-10-24 16:12:26,969 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 16:12:26,974 INFO L134 CoverageAnalysis]: Checked inductivity of 29 backedges. 2 proven. 3 refuted. 0 times theorem prover too weak. 24 trivial. 0 not checked. [2024-10-24 16:12:26,974 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-24 16:12:26,974 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [703084817] [2024-10-24 16:12:26,974 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [703084817] provided 0 perfect and 1 imperfect interpolant sequences [2024-10-24 16:12:26,974 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [2093179687] [2024-10-24 16:12:26,974 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-24 16:12:26,974 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-10-24 16:12:26,975 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-10-24 16:12:26,977 INFO L229 MonitoredProcess]: Starting monitored process 7 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-10-24 16:12:26,983 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (7)] Waiting until timeout for monitored process [2024-10-24 16:12:27,057 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 16:12:27,059 INFO L255 TraceCheckSpWp]: Trace formula consists of 167 conjuncts, 6 conjuncts are in the unsatisfiable core [2024-10-24 16:12:27,061 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-24 16:12:27,077 INFO L134 CoverageAnalysis]: Checked inductivity of 29 backedges. 2 proven. 3 refuted. 0 times theorem prover too weak. 24 trivial. 0 not checked. [2024-10-24 16:12:27,077 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-10-24 16:12:27,118 INFO L134 CoverageAnalysis]: Checked inductivity of 29 backedges. 2 proven. 3 refuted. 0 times theorem prover too weak. 24 trivial. 0 not checked. [2024-10-24 16:12:27,119 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [2093179687] provided 0 perfect and 2 imperfect interpolant sequences [2024-10-24 16:12:27,119 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2024-10-24 16:12:27,119 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 7, 7] total 7 [2024-10-24 16:12:27,119 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1484660110] [2024-10-24 16:12:27,119 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2024-10-24 16:12:27,119 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2024-10-24 16:12:27,120 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-24 16:12:27,120 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2024-10-24 16:12:27,120 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=29, Unknown=0, NotChecked=0, Total=42 [2024-10-24 16:12:27,120 INFO L87 Difference]: Start difference. First operand 97 states and 109 transitions. Second operand has 7 states, 7 states have (on average 2.5714285714285716) internal successors, (18), 7 states have internal predecessors, (18), 1 states have call successors, (4), 1 states have call predecessors, (4), 1 states have return successors, (4), 1 states have call predecessors, (4), 1 states have call successors, (4) [2024-10-24 16:12:27,203 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-24 16:12:27,203 INFO L93 Difference]: Finished difference Result 116 states and 139 transitions. [2024-10-24 16:12:27,203 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2024-10-24 16:12:27,204 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 2.5714285714285716) internal successors, (18), 7 states have internal predecessors, (18), 1 states have call successors, (4), 1 states have call predecessors, (4), 1 states have return successors, (4), 1 states have call predecessors, (4), 1 states have call successors, (4) Word has length 35 [2024-10-24 16:12:27,204 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-24 16:12:27,204 INFO L225 Difference]: With dead ends: 116 [2024-10-24 16:12:27,204 INFO L226 Difference]: Without dead ends: 116 [2024-10-24 16:12:27,205 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 84 GetRequests, 74 SyntacticMatches, 4 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 8 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=20, Invalid=36, Unknown=0, NotChecked=0, Total=56 [2024-10-24 16:12:27,205 INFO L432 NwaCegarLoop]: 73 mSDtfsCounter, 8 mSDsluCounter, 284 mSDsCounter, 0 mSdLazyCounter, 106 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 8 SdHoareTripleChecker+Valid, 357 SdHoareTripleChecker+Invalid, 107 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 106 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-10-24 16:12:27,205 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [8 Valid, 357 Invalid, 107 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 106 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-10-24 16:12:27,206 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 116 states. [2024-10-24 16:12:27,209 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 116 to 108. [2024-10-24 16:12:27,210 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 108 states, 68 states have (on average 1.6029411764705883) internal successors, (109), 94 states have internal predecessors, (109), 9 states have call successors, (9), 4 states have call predecessors, (9), 4 states have return successors, (9), 9 states have call predecessors, (9), 9 states have call successors, (9) [2024-10-24 16:12:27,210 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 108 states to 108 states and 127 transitions. [2024-10-24 16:12:27,210 INFO L78 Accepts]: Start accepts. Automaton has 108 states and 127 transitions. Word has length 35 [2024-10-24 16:12:27,211 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-24 16:12:27,211 INFO L471 AbstractCegarLoop]: Abstraction has 108 states and 127 transitions. [2024-10-24 16:12:27,211 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 2.5714285714285716) internal successors, (18), 7 states have internal predecessors, (18), 1 states have call successors, (4), 1 states have call predecessors, (4), 1 states have return successors, (4), 1 states have call predecessors, (4), 1 states have call successors, (4) [2024-10-24 16:12:27,211 INFO L276 IsEmpty]: Start isEmpty. Operand 108 states and 127 transitions. [2024-10-24 16:12:27,211 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 38 [2024-10-24 16:12:27,211 INFO L207 NwaCegarLoop]: Found error trace [2024-10-24 16:12:27,212 INFO L215 NwaCegarLoop]: trace histogram [4, 4, 4, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-24 16:12:27,229 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (7)] Ended with exit code 0 [2024-10-24 16:12:27,415 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 7 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable15 [2024-10-24 16:12:27,416 INFO L396 AbstractCegarLoop]: === Iteration 17 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONMEMORY_LEAK === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 34 more)] === [2024-10-24 16:12:27,416 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-24 16:12:27,416 INFO L85 PathProgramCache]: Analyzing trace with hash -193969567, now seen corresponding path program 1 times [2024-10-24 16:12:27,416 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-24 16:12:27,416 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [393561666] [2024-10-24 16:12:27,416 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-24 16:12:27,416 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-24 16:12:27,428 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 16:12:27,488 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2024-10-24 16:12:27,489 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 16:12:27,490 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 7 [2024-10-24 16:12:27,491 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 16:12:27,492 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 12 [2024-10-24 16:12:27,493 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 16:12:27,494 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 17 [2024-10-24 16:12:27,495 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 16:12:27,496 INFO L134 CoverageAnalysis]: Checked inductivity of 24 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 24 trivial. 0 not checked. [2024-10-24 16:12:27,496 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-24 16:12:27,496 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [393561666] [2024-10-24 16:12:27,496 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [393561666] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-24 16:12:27,497 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-24 16:12:27,497 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2024-10-24 16:12:27,497 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [396630079] [2024-10-24 16:12:27,497 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-24 16:12:27,498 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2024-10-24 16:12:27,498 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-24 16:12:27,499 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2024-10-24 16:12:27,499 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2024-10-24 16:12:27,499 INFO L87 Difference]: Start difference. First operand 108 states and 127 transitions. Second operand has 6 states, 5 states have (on average 3.8) internal successors, (19), 5 states have internal predecessors, (19), 2 states have call successors, (5), 2 states have call predecessors, (5), 1 states have return successors, (4), 1 states have call predecessors, (4), 1 states have call successors, (4) [2024-10-24 16:12:27,569 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-24 16:12:27,570 INFO L93 Difference]: Finished difference Result 162 states and 186 transitions. [2024-10-24 16:12:27,570 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2024-10-24 16:12:27,570 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 5 states have (on average 3.8) internal successors, (19), 5 states have internal predecessors, (19), 2 states have call successors, (5), 2 states have call predecessors, (5), 1 states have return successors, (4), 1 states have call predecessors, (4), 1 states have call successors, (4) Word has length 37 [2024-10-24 16:12:27,571 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-24 16:12:27,571 INFO L225 Difference]: With dead ends: 162 [2024-10-24 16:12:27,572 INFO L226 Difference]: Without dead ends: 162 [2024-10-24 16:12:27,574 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 15 GetRequests, 10 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=13, Invalid=29, Unknown=0, NotChecked=0, Total=42 [2024-10-24 16:12:27,574 INFO L432 NwaCegarLoop]: 120 mSDtfsCounter, 48 mSDsluCounter, 433 mSDsCounter, 0 mSdLazyCounter, 80 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 53 SdHoareTripleChecker+Valid, 553 SdHoareTripleChecker+Invalid, 80 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 80 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-10-24 16:12:27,575 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [53 Valid, 553 Invalid, 80 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 80 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-10-24 16:12:27,575 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 162 states. [2024-10-24 16:12:27,579 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 162 to 114. [2024-10-24 16:12:27,581 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 114 states, 72 states have (on average 1.5694444444444444) internal successors, (113), 99 states have internal predecessors, (113), 10 states have call successors, (10), 5 states have call predecessors, (10), 5 states have return successors, (10), 9 states have call predecessors, (10), 10 states have call successors, (10) [2024-10-24 16:12:27,583 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 114 states to 114 states and 133 transitions. [2024-10-24 16:12:27,583 INFO L78 Accepts]: Start accepts. Automaton has 114 states and 133 transitions. Word has length 37 [2024-10-24 16:12:27,583 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-24 16:12:27,583 INFO L471 AbstractCegarLoop]: Abstraction has 114 states and 133 transitions. [2024-10-24 16:12:27,584 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 5 states have (on average 3.8) internal successors, (19), 5 states have internal predecessors, (19), 2 states have call successors, (5), 2 states have call predecessors, (5), 1 states have return successors, (4), 1 states have call predecessors, (4), 1 states have call successors, (4) [2024-10-24 16:12:27,584 INFO L276 IsEmpty]: Start isEmpty. Operand 114 states and 133 transitions. [2024-10-24 16:12:27,584 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 40 [2024-10-24 16:12:27,584 INFO L207 NwaCegarLoop]: Found error trace [2024-10-24 16:12:27,584 INFO L215 NwaCegarLoop]: trace histogram [4, 4, 4, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-24 16:12:27,585 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable16 [2024-10-24 16:12:27,586 INFO L396 AbstractCegarLoop]: === Iteration 18 === Targeting ULTIMATE.startErr12REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 34 more)] === [2024-10-24 16:12:27,586 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-24 16:12:27,586 INFO L85 PathProgramCache]: Analyzing trace with hash -1720969682, now seen corresponding path program 1 times [2024-10-24 16:12:27,587 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-24 16:12:27,587 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [889426932] [2024-10-24 16:12:27,587 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-24 16:12:27,587 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-24 16:12:27,601 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 16:12:27,643 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2024-10-24 16:12:27,644 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 16:12:27,646 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 7 [2024-10-24 16:12:27,647 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 16:12:27,649 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 12 [2024-10-24 16:12:27,650 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 16:12:27,651 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 17 [2024-10-24 16:12:27,652 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 16:12:27,653 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 33 [2024-10-24 16:12:27,655 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 16:12:27,656 INFO L134 CoverageAnalysis]: Checked inductivity of 24 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 24 trivial. 0 not checked. [2024-10-24 16:12:27,656 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-24 16:12:27,657 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [889426932] [2024-10-24 16:12:27,657 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [889426932] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-24 16:12:27,657 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-24 16:12:27,657 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-10-24 16:12:27,657 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [328612830] [2024-10-24 16:12:27,657 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-24 16:12:27,658 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-10-24 16:12:27,658 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-24 16:12:27,659 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-10-24 16:12:27,659 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-10-24 16:12:27,659 INFO L87 Difference]: Start difference. First operand 114 states and 133 transitions. Second operand has 4 states, 3 states have (on average 6.666666666666667) internal successors, (20), 4 states have internal predecessors, (20), 2 states have call successors, (5), 1 states have call predecessors, (5), 1 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) [2024-10-24 16:12:27,744 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-24 16:12:27,744 INFO L93 Difference]: Finished difference Result 110 states and 129 transitions. [2024-10-24 16:12:27,745 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-10-24 16:12:27,745 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 3 states have (on average 6.666666666666667) internal successors, (20), 4 states have internal predecessors, (20), 2 states have call successors, (5), 1 states have call predecessors, (5), 1 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) Word has length 39 [2024-10-24 16:12:27,745 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-24 16:12:27,747 INFO L225 Difference]: With dead ends: 110 [2024-10-24 16:12:27,747 INFO L226 Difference]: Without dead ends: 110 [2024-10-24 16:12:27,747 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 14 GetRequests, 11 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-10-24 16:12:27,748 INFO L432 NwaCegarLoop]: 58 mSDtfsCounter, 54 mSDsluCounter, 52 mSDsCounter, 0 mSdLazyCounter, 84 mSolverCounterSat, 4 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 58 SdHoareTripleChecker+Valid, 110 SdHoareTripleChecker+Invalid, 88 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 4 IncrementalHoareTripleChecker+Valid, 84 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-10-24 16:12:27,748 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [58 Valid, 110 Invalid, 88 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [4 Valid, 84 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-10-24 16:12:27,749 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 110 states. [2024-10-24 16:12:27,751 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 110 to 110. [2024-10-24 16:12:27,752 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 110 states, 72 states have (on average 1.5138888888888888) internal successors, (109), 95 states have internal predecessors, (109), 10 states have call successors, (10), 5 states have call predecessors, (10), 5 states have return successors, (10), 9 states have call predecessors, (10), 10 states have call successors, (10) [2024-10-24 16:12:27,752 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 110 states to 110 states and 129 transitions. [2024-10-24 16:12:27,753 INFO L78 Accepts]: Start accepts. Automaton has 110 states and 129 transitions. Word has length 39 [2024-10-24 16:12:27,753 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-24 16:12:27,753 INFO L471 AbstractCegarLoop]: Abstraction has 110 states and 129 transitions. [2024-10-24 16:12:27,753 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 3 states have (on average 6.666666666666667) internal successors, (20), 4 states have internal predecessors, (20), 2 states have call successors, (5), 1 states have call predecessors, (5), 1 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) [2024-10-24 16:12:27,753 INFO L276 IsEmpty]: Start isEmpty. Operand 110 states and 129 transitions. [2024-10-24 16:12:27,754 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 40 [2024-10-24 16:12:27,754 INFO L207 NwaCegarLoop]: Found error trace [2024-10-24 16:12:27,754 INFO L215 NwaCegarLoop]: trace histogram [4, 4, 4, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-24 16:12:27,754 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable17 [2024-10-24 16:12:27,754 INFO L396 AbstractCegarLoop]: === Iteration 19 === Targeting ULTIMATE.startErr13REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 34 more)] === [2024-10-24 16:12:27,755 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-24 16:12:27,755 INFO L85 PathProgramCache]: Analyzing trace with hash -1720969681, now seen corresponding path program 1 times [2024-10-24 16:12:27,755 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-24 16:12:27,755 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [119860914] [2024-10-24 16:12:27,755 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-24 16:12:27,756 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-24 16:12:27,769 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 16:12:27,829 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2024-10-24 16:12:27,830 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 16:12:27,831 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 7 [2024-10-24 16:12:27,832 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 16:12:27,833 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 12 [2024-10-24 16:12:27,833 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 16:12:27,834 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 17 [2024-10-24 16:12:27,835 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 16:12:27,836 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 33 [2024-10-24 16:12:27,836 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 16:12:27,838 INFO L134 CoverageAnalysis]: Checked inductivity of 24 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 24 trivial. 0 not checked. [2024-10-24 16:12:27,838 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-24 16:12:27,838 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [119860914] [2024-10-24 16:12:27,839 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [119860914] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-24 16:12:27,839 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-24 16:12:27,839 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-10-24 16:12:27,839 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1245810962] [2024-10-24 16:12:27,839 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-24 16:12:27,839 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-10-24 16:12:27,840 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-24 16:12:27,840 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-10-24 16:12:27,840 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-10-24 16:12:27,840 INFO L87 Difference]: Start difference. First operand 110 states and 129 transitions. Second operand has 4 states, 3 states have (on average 6.666666666666667) internal successors, (20), 4 states have internal predecessors, (20), 2 states have call successors, (5), 1 states have call predecessors, (5), 1 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) [2024-10-24 16:12:27,915 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-24 16:12:27,915 INFO L93 Difference]: Finished difference Result 106 states and 125 transitions. [2024-10-24 16:12:27,915 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-10-24 16:12:27,915 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 3 states have (on average 6.666666666666667) internal successors, (20), 4 states have internal predecessors, (20), 2 states have call successors, (5), 1 states have call predecessors, (5), 1 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) Word has length 39 [2024-10-24 16:12:27,916 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-24 16:12:27,916 INFO L225 Difference]: With dead ends: 106 [2024-10-24 16:12:27,916 INFO L226 Difference]: Without dead ends: 106 [2024-10-24 16:12:27,917 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 14 GetRequests, 11 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-10-24 16:12:27,917 INFO L432 NwaCegarLoop]: 64 mSDtfsCounter, 38 mSDsluCounter, 68 mSDsCounter, 0 mSdLazyCounter, 67 mSolverCounterSat, 4 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 41 SdHoareTripleChecker+Valid, 132 SdHoareTripleChecker+Invalid, 71 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 4 IncrementalHoareTripleChecker+Valid, 67 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-10-24 16:12:27,917 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [41 Valid, 132 Invalid, 71 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [4 Valid, 67 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-10-24 16:12:27,918 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 106 states. [2024-10-24 16:12:27,920 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 106 to 106. [2024-10-24 16:12:27,920 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 106 states, 72 states have (on average 1.4583333333333333) internal successors, (105), 91 states have internal predecessors, (105), 10 states have call successors, (10), 5 states have call predecessors, (10), 5 states have return successors, (10), 9 states have call predecessors, (10), 10 states have call successors, (10) [2024-10-24 16:12:27,921 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 106 states to 106 states and 125 transitions. [2024-10-24 16:12:27,921 INFO L78 Accepts]: Start accepts. Automaton has 106 states and 125 transitions. Word has length 39 [2024-10-24 16:12:27,921 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-24 16:12:27,921 INFO L471 AbstractCegarLoop]: Abstraction has 106 states and 125 transitions. [2024-10-24 16:12:27,921 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 3 states have (on average 6.666666666666667) internal successors, (20), 4 states have internal predecessors, (20), 2 states have call successors, (5), 1 states have call predecessors, (5), 1 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) [2024-10-24 16:12:27,922 INFO L276 IsEmpty]: Start isEmpty. Operand 106 states and 125 transitions. [2024-10-24 16:12:27,922 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 40 [2024-10-24 16:12:27,922 INFO L207 NwaCegarLoop]: Found error trace [2024-10-24 16:12:27,922 INFO L215 NwaCegarLoop]: trace histogram [4, 4, 4, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-24 16:12:27,922 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable18 [2024-10-24 16:12:27,923 INFO L396 AbstractCegarLoop]: === Iteration 20 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONMEMORY_LEAK === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 34 more)] === [2024-10-24 16:12:27,923 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-24 16:12:27,923 INFO L85 PathProgramCache]: Analyzing trace with hash -124404542, now seen corresponding path program 1 times [2024-10-24 16:12:27,923 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-24 16:12:27,923 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1144645082] [2024-10-24 16:12:27,923 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-24 16:12:27,923 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-24 16:12:27,932 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 16:12:27,964 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2024-10-24 16:12:27,965 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 16:12:27,966 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 7 [2024-10-24 16:12:27,967 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 16:12:27,968 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 12 [2024-10-24 16:12:27,968 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 16:12:27,969 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 17 [2024-10-24 16:12:27,969 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 16:12:27,970 INFO L134 CoverageAnalysis]: Checked inductivity of 26 backedges. 1 proven. 1 refuted. 0 times theorem prover too weak. 24 trivial. 0 not checked. [2024-10-24 16:12:27,971 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-24 16:12:27,971 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1144645082] [2024-10-24 16:12:27,971 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1144645082] provided 0 perfect and 1 imperfect interpolant sequences [2024-10-24 16:12:27,971 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [2091414019] [2024-10-24 16:12:27,971 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-24 16:12:27,971 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-10-24 16:12:27,972 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-10-24 16:12:27,973 INFO L229 MonitoredProcess]: Starting monitored process 8 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-10-24 16:12:27,975 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (8)] Waiting until timeout for monitored process [2024-10-24 16:12:28,055 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 16:12:28,056 INFO L255 TraceCheckSpWp]: Trace formula consists of 178 conjuncts, 4 conjuncts are in the unsatisfiable core [2024-10-24 16:12:28,058 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-24 16:12:28,075 INFO L134 CoverageAnalysis]: Checked inductivity of 26 backedges. 1 proven. 1 refuted. 0 times theorem prover too weak. 24 trivial. 0 not checked. [2024-10-24 16:12:28,075 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-10-24 16:12:28,107 INFO L134 CoverageAnalysis]: Checked inductivity of 26 backedges. 1 proven. 1 refuted. 0 times theorem prover too weak. 24 trivial. 0 not checked. [2024-10-24 16:12:28,107 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [2091414019] provided 0 perfect and 2 imperfect interpolant sequences [2024-10-24 16:12:28,108 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2024-10-24 16:12:28,108 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [5, 5, 5] total 5 [2024-10-24 16:12:28,108 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1152894053] [2024-10-24 16:12:28,108 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2024-10-24 16:12:28,108 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2024-10-24 16:12:28,108 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-24 16:12:28,109 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2024-10-24 16:12:28,109 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2024-10-24 16:12:28,109 INFO L87 Difference]: Start difference. First operand 106 states and 125 transitions. Second operand has 5 states, 5 states have (on average 4.2) internal successors, (21), 5 states have internal predecessors, (21), 2 states have call successors, (5), 2 states have call predecessors, (5), 1 states have return successors, (4), 1 states have call predecessors, (4), 1 states have call successors, (4) [2024-10-24 16:12:28,172 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-24 16:12:28,172 INFO L93 Difference]: Finished difference Result 106 states and 123 transitions. [2024-10-24 16:12:28,173 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2024-10-24 16:12:28,173 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 4.2) internal successors, (21), 5 states have internal predecessors, (21), 2 states have call successors, (5), 2 states have call predecessors, (5), 1 states have return successors, (4), 1 states have call predecessors, (4), 1 states have call successors, (4) Word has length 39 [2024-10-24 16:12:28,173 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-24 16:12:28,173 INFO L225 Difference]: With dead ends: 106 [2024-10-24 16:12:28,174 INFO L226 Difference]: Without dead ends: 106 [2024-10-24 16:12:28,174 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 91 GetRequests, 83 SyntacticMatches, 3 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=18, Invalid=24, Unknown=0, NotChecked=0, Total=42 [2024-10-24 16:12:28,174 INFO L432 NwaCegarLoop]: 66 mSDtfsCounter, 7 mSDsluCounter, 186 mSDsCounter, 0 mSdLazyCounter, 63 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 7 SdHoareTripleChecker+Valid, 252 SdHoareTripleChecker+Invalid, 65 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 63 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-10-24 16:12:28,174 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [7 Valid, 252 Invalid, 65 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 63 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-10-24 16:12:28,175 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 106 states. [2024-10-24 16:12:28,177 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 106 to 106. [2024-10-24 16:12:28,177 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 106 states, 72 states have (on average 1.4305555555555556) internal successors, (103), 91 states have internal predecessors, (103), 10 states have call successors, (10), 5 states have call predecessors, (10), 5 states have return successors, (10), 9 states have call predecessors, (10), 10 states have call successors, (10) [2024-10-24 16:12:28,178 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 106 states to 106 states and 123 transitions. [2024-10-24 16:12:28,178 INFO L78 Accepts]: Start accepts. Automaton has 106 states and 123 transitions. Word has length 39 [2024-10-24 16:12:28,178 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-24 16:12:28,178 INFO L471 AbstractCegarLoop]: Abstraction has 106 states and 123 transitions. [2024-10-24 16:12:28,178 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 4.2) internal successors, (21), 5 states have internal predecessors, (21), 2 states have call successors, (5), 2 states have call predecessors, (5), 1 states have return successors, (4), 1 states have call predecessors, (4), 1 states have call successors, (4) [2024-10-24 16:12:28,178 INFO L276 IsEmpty]: Start isEmpty. Operand 106 states and 123 transitions. [2024-10-24 16:12:28,178 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 40 [2024-10-24 16:12:28,179 INFO L207 NwaCegarLoop]: Found error trace [2024-10-24 16:12:28,179 INFO L215 NwaCegarLoop]: trace histogram [4, 4, 4, 3, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-24 16:12:28,195 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (8)] Forceful destruction successful, exit code 0 [2024-10-24 16:12:28,379 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable19,8 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-10-24 16:12:28,380 INFO L396 AbstractCegarLoop]: === Iteration 21 === Targeting ULTIMATE.startErr5REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 34 more)] === [2024-10-24 16:12:28,380 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-24 16:12:28,380 INFO L85 PathProgramCache]: Analyzing trace with hash 1582277432, now seen corresponding path program 2 times [2024-10-24 16:12:28,380 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-24 16:12:28,380 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1578310874] [2024-10-24 16:12:28,380 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-24 16:12:28,380 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-24 16:12:28,391 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 16:12:28,512 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2024-10-24 16:12:28,513 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 16:12:28,515 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 7 [2024-10-24 16:12:28,515 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 16:12:28,517 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 12 [2024-10-24 16:12:28,518 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 16:12:28,519 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 17 [2024-10-24 16:12:28,520 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 16:12:28,521 INFO L134 CoverageAnalysis]: Checked inductivity of 36 backedges. 3 proven. 9 refuted. 0 times theorem prover too weak. 24 trivial. 0 not checked. [2024-10-24 16:12:28,521 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-24 16:12:28,521 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1578310874] [2024-10-24 16:12:28,521 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1578310874] provided 0 perfect and 1 imperfect interpolant sequences [2024-10-24 16:12:28,521 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1010835325] [2024-10-24 16:12:28,522 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2024-10-24 16:12:28,522 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-10-24 16:12:28,522 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-10-24 16:12:28,523 INFO L229 MonitoredProcess]: Starting monitored process 9 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-10-24 16:12:28,525 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (9)] Waiting until timeout for monitored process [2024-10-24 16:12:28,606 INFO L227 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2024-10-24 16:12:28,607 INFO L228 tOrderPrioritization]: Conjunction of SSA is unsat [2024-10-24 16:12:28,608 INFO L255 TraceCheckSpWp]: Trace formula consists of 183 conjuncts, 8 conjuncts are in the unsatisfiable core [2024-10-24 16:12:28,609 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-24 16:12:28,760 INFO L134 CoverageAnalysis]: Checked inductivity of 36 backedges. 1 proven. 9 refuted. 0 times theorem prover too weak. 26 trivial. 0 not checked. [2024-10-24 16:12:28,760 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-10-24 16:12:28,826 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 30 treesize of output 26 [2024-10-24 16:12:28,904 INFO L134 CoverageAnalysis]: Checked inductivity of 36 backedges. 1 proven. 9 refuted. 0 times theorem prover too weak. 26 trivial. 0 not checked. [2024-10-24 16:12:28,904 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1010835325] provided 0 perfect and 2 imperfect interpolant sequences [2024-10-24 16:12:28,904 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2024-10-24 16:12:28,904 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 6, 6] total 17 [2024-10-24 16:12:28,904 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [89125994] [2024-10-24 16:12:28,904 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2024-10-24 16:12:28,905 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 18 states [2024-10-24 16:12:28,905 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-24 16:12:28,905 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 18 interpolants. [2024-10-24 16:12:28,905 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=75, Invalid=231, Unknown=0, NotChecked=0, Total=306 [2024-10-24 16:12:28,905 INFO L87 Difference]: Start difference. First operand 106 states and 123 transitions. Second operand has 18 states, 17 states have (on average 3.2941176470588234) internal successors, (56), 18 states have internal predecessors, (56), 4 states have call successors, (10), 1 states have call predecessors, (10), 1 states have return successors, (10), 4 states have call predecessors, (10), 4 states have call successors, (10) [2024-10-24 16:12:29,250 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-24 16:12:29,250 INFO L93 Difference]: Finished difference Result 125 states and 148 transitions. [2024-10-24 16:12:29,250 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 18 states. [2024-10-24 16:12:29,250 INFO L78 Accepts]: Start accepts. Automaton has has 18 states, 17 states have (on average 3.2941176470588234) internal successors, (56), 18 states have internal predecessors, (56), 4 states have call successors, (10), 1 states have call predecessors, (10), 1 states have return successors, (10), 4 states have call predecessors, (10), 4 states have call successors, (10) Word has length 39 [2024-10-24 16:12:29,250 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-24 16:12:29,251 INFO L225 Difference]: With dead ends: 125 [2024-10-24 16:12:29,251 INFO L226 Difference]: Without dead ends: 125 [2024-10-24 16:12:29,252 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 106 GetRequests, 75 SyntacticMatches, 0 SemanticMatches, 31 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 204 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=299, Invalid=757, Unknown=0, NotChecked=0, Total=1056 [2024-10-24 16:12:29,252 INFO L432 NwaCegarLoop]: 60 mSDtfsCounter, 214 mSDsluCounter, 284 mSDsCounter, 0 mSdLazyCounter, 265 mSolverCounterSat, 16 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 219 SdHoareTripleChecker+Valid, 344 SdHoareTripleChecker+Invalid, 281 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 16 IncrementalHoareTripleChecker+Valid, 265 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2024-10-24 16:12:29,252 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [219 Valid, 344 Invalid, 281 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [16 Valid, 265 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2024-10-24 16:12:29,253 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 125 states. [2024-10-24 16:12:29,255 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 125 to 104. [2024-10-24 16:12:29,255 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 104 states, 72 states have (on average 1.3888888888888888) internal successors, (100), 89 states have internal predecessors, (100), 10 states have call successors, (10), 5 states have call predecessors, (10), 5 states have return successors, (10), 9 states have call predecessors, (10), 10 states have call successors, (10) [2024-10-24 16:12:29,255 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 104 states to 104 states and 120 transitions. [2024-10-24 16:12:29,256 INFO L78 Accepts]: Start accepts. Automaton has 104 states and 120 transitions. Word has length 39 [2024-10-24 16:12:29,256 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-24 16:12:29,256 INFO L471 AbstractCegarLoop]: Abstraction has 104 states and 120 transitions. [2024-10-24 16:12:29,256 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 18 states, 17 states have (on average 3.2941176470588234) internal successors, (56), 18 states have internal predecessors, (56), 4 states have call successors, (10), 1 states have call predecessors, (10), 1 states have return successors, (10), 4 states have call predecessors, (10), 4 states have call successors, (10) [2024-10-24 16:12:29,256 INFO L276 IsEmpty]: Start isEmpty. Operand 104 states and 120 transitions. [2024-10-24 16:12:29,260 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 41 [2024-10-24 16:12:29,262 INFO L207 NwaCegarLoop]: Found error trace [2024-10-24 16:12:29,262 INFO L215 NwaCegarLoop]: trace histogram [4, 4, 4, 3, 3, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-24 16:12:29,275 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-10-24 16:12:29,462 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,SelfDestructingSolverStorable20 [2024-10-24 16:12:29,462 INFO L396 AbstractCegarLoop]: === Iteration 22 === Targeting ULTIMATE.startErr7REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 34 more)] === [2024-10-24 16:12:29,463 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-24 16:12:29,463 INFO L85 PathProgramCache]: Analyzing trace with hash 1805960122, now seen corresponding path program 1 times [2024-10-24 16:12:29,463 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-24 16:12:29,463 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1168449691] [2024-10-24 16:12:29,463 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-24 16:12:29,463 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-24 16:12:29,476 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 16:12:29,608 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2024-10-24 16:12:29,609 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 16:12:29,610 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 7 [2024-10-24 16:12:29,611 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 16:12:29,612 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 12 [2024-10-24 16:12:29,613 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 16:12:29,614 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 17 [2024-10-24 16:12:29,615 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 16:12:29,616 INFO L134 CoverageAnalysis]: Checked inductivity of 38 backedges. 3 proven. 11 refuted. 0 times theorem prover too weak. 24 trivial. 0 not checked. [2024-10-24 16:12:29,616 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-24 16:12:29,616 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1168449691] [2024-10-24 16:12:29,616 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1168449691] provided 0 perfect and 1 imperfect interpolant sequences [2024-10-24 16:12:29,616 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [512757443] [2024-10-24 16:12:29,616 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-24 16:12:29,616 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-10-24 16:12:29,617 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-10-24 16:12:29,618 INFO L229 MonitoredProcess]: Starting monitored process 10 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-10-24 16:12:29,619 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (10)] Waiting until timeout for monitored process [2024-10-24 16:12:29,702 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 16:12:29,703 INFO L255 TraceCheckSpWp]: Trace formula consists of 189 conjuncts, 11 conjuncts are in the unsatisfiable core [2024-10-24 16:12:29,705 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-24 16:12:29,876 INFO L134 CoverageAnalysis]: Checked inductivity of 38 backedges. 4 proven. 10 refuted. 0 times theorem prover too weak. 24 trivial. 0 not checked. [2024-10-24 16:12:29,876 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-10-24 16:12:29,958 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 30 treesize of output 26 [2024-10-24 16:12:30,077 INFO L134 CoverageAnalysis]: Checked inductivity of 38 backedges. 4 proven. 10 refuted. 0 times theorem prover too weak. 24 trivial. 0 not checked. [2024-10-24 16:12:30,079 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [512757443] provided 0 perfect and 2 imperfect interpolant sequences [2024-10-24 16:12:30,079 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2024-10-24 16:12:30,079 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [8, 8, 8] total 22 [2024-10-24 16:12:30,079 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [934568362] [2024-10-24 16:12:30,079 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2024-10-24 16:12:30,080 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 23 states [2024-10-24 16:12:30,080 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-24 16:12:30,080 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 23 interpolants. [2024-10-24 16:12:30,081 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=95, Invalid=411, Unknown=0, NotChecked=0, Total=506 [2024-10-24 16:12:30,081 INFO L87 Difference]: Start difference. First operand 104 states and 120 transitions. Second operand has 23 states, 22 states have (on average 2.772727272727273) internal successors, (61), 23 states have internal predecessors, (61), 4 states have call successors, (10), 1 states have call predecessors, (10), 1 states have return successors, (10), 4 states have call predecessors, (10), 4 states have call successors, (10) [2024-10-24 16:12:30,579 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-24 16:12:30,580 INFO L93 Difference]: Finished difference Result 115 states and 131 transitions. [2024-10-24 16:12:30,581 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 21 states. [2024-10-24 16:12:30,581 INFO L78 Accepts]: Start accepts. Automaton has has 23 states, 22 states have (on average 2.772727272727273) internal successors, (61), 23 states have internal predecessors, (61), 4 states have call successors, (10), 1 states have call predecessors, (10), 1 states have return successors, (10), 4 states have call predecessors, (10), 4 states have call successors, (10) Word has length 40 [2024-10-24 16:12:30,581 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-24 16:12:30,584 INFO L225 Difference]: With dead ends: 115 [2024-10-24 16:12:30,584 INFO L226 Difference]: Without dead ends: 115 [2024-10-24 16:12:30,585 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 112 GetRequests, 73 SyntacticMatches, 0 SemanticMatches, 39 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 336 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=383, Invalid=1257, Unknown=0, NotChecked=0, Total=1640 [2024-10-24 16:12:30,585 INFO L432 NwaCegarLoop]: 61 mSDtfsCounter, 168 mSDsluCounter, 167 mSDsCounter, 0 mSdLazyCounter, 298 mSolverCounterSat, 17 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 173 SdHoareTripleChecker+Valid, 228 SdHoareTripleChecker+Invalid, 315 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 17 IncrementalHoareTripleChecker+Valid, 298 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2024-10-24 16:12:30,585 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [173 Valid, 228 Invalid, 315 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [17 Valid, 298 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2024-10-24 16:12:30,586 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 115 states. [2024-10-24 16:12:30,589 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 115 to 104. [2024-10-24 16:12:30,589 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 104 states, 72 states have (on average 1.375) internal successors, (99), 89 states have internal predecessors, (99), 10 states have call successors, (10), 5 states have call predecessors, (10), 5 states have return successors, (10), 9 states have call predecessors, (10), 10 states have call successors, (10) [2024-10-24 16:12:30,590 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 104 states to 104 states and 119 transitions. [2024-10-24 16:12:30,590 INFO L78 Accepts]: Start accepts. Automaton has 104 states and 119 transitions. Word has length 40 [2024-10-24 16:12:30,590 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-24 16:12:30,590 INFO L471 AbstractCegarLoop]: Abstraction has 104 states and 119 transitions. [2024-10-24 16:12:30,590 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 23 states, 22 states have (on average 2.772727272727273) internal successors, (61), 23 states have internal predecessors, (61), 4 states have call successors, (10), 1 states have call predecessors, (10), 1 states have return successors, (10), 4 states have call predecessors, (10), 4 states have call successors, (10) [2024-10-24 16:12:30,591 INFO L276 IsEmpty]: Start isEmpty. Operand 104 states and 119 transitions. [2024-10-24 16:12:30,591 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 43 [2024-10-24 16:12:30,591 INFO L207 NwaCegarLoop]: Found error trace [2024-10-24 16:12:30,591 INFO L215 NwaCegarLoop]: trace histogram [4, 4, 4, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-24 16:12:30,608 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (10)] Ended with exit code 0 [2024-10-24 16:12:30,792 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable21,10 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-10-24 16:12:30,793 INFO L396 AbstractCegarLoop]: === Iteration 23 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONMEMORY_LEAK === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 34 more)] === [2024-10-24 16:12:30,793 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-24 16:12:30,793 INFO L85 PathProgramCache]: Analyzing trace with hash -1321067904, now seen corresponding path program 2 times [2024-10-24 16:12:30,793 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-24 16:12:30,793 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [594813662] [2024-10-24 16:12:30,793 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-24 16:12:30,794 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-24 16:12:30,821 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 16:12:31,561 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2024-10-24 16:12:31,562 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 16:12:31,564 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 7 [2024-10-24 16:12:31,566 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 16:12:31,574 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 12 [2024-10-24 16:12:31,575 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 16:12:31,582 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 17 [2024-10-24 16:12:31,584 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 16:12:31,628 INFO L134 CoverageAnalysis]: Checked inductivity of 31 backedges. 13 proven. 1 refuted. 0 times theorem prover too weak. 17 trivial. 0 not checked. [2024-10-24 16:12:31,629 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-24 16:12:31,629 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [594813662] [2024-10-24 16:12:31,629 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [594813662] provided 0 perfect and 1 imperfect interpolant sequences [2024-10-24 16:12:31,629 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [935996148] [2024-10-24 16:12:31,629 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2024-10-24 16:12:31,630 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-10-24 16:12:31,630 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-10-24 16:12:31,631 INFO L229 MonitoredProcess]: Starting monitored process 11 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-10-24 16:12:31,633 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (11)] Waiting until timeout for monitored process [2024-10-24 16:12:31,719 INFO L227 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2024-10-24 16:12:31,719 INFO L228 tOrderPrioritization]: Conjunction of SSA is unsat [2024-10-24 16:12:31,721 INFO L255 TraceCheckSpWp]: Trace formula consists of 184 conjuncts, 45 conjuncts are in the unsatisfiable core [2024-10-24 16:12:31,723 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-24 16:12:31,944 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 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 15 treesize of output 11 [2024-10-24 16:12:32,013 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-10-24 16:12:32,014 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 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 23 treesize of output 23 [2024-10-24 16:12:33,388 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-10-24 16:12:33,407 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-10-24 16:12:33,408 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 4 select indices, 4 select index equivalence classes, 2 disjoint index pairs (out of 6 index pairs), introduced 4 new quantified variables, introduced 6 case distinctions, treesize of input 43 treesize of output 46 [2024-10-24 16:12:33,675 INFO L134 CoverageAnalysis]: Checked inductivity of 31 backedges. 9 proven. 7 refuted. 0 times theorem prover too weak. 15 trivial. 0 not checked. [2024-10-24 16:12:33,675 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-10-24 16:12:33,956 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-10-24 16:12:33,956 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 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 503 treesize of output 435 [2024-10-24 16:12:36,214 INFO L134 CoverageAnalysis]: Checked inductivity of 31 backedges. 10 proven. 6 refuted. 0 times theorem prover too weak. 15 trivial. 0 not checked. [2024-10-24 16:12:36,214 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [935996148] provided 0 perfect and 2 imperfect interpolant sequences [2024-10-24 16:12:36,214 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2024-10-24 16:12:36,214 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [13, 16, 16] total 38 [2024-10-24 16:12:36,214 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [630838043] [2024-10-24 16:12:36,214 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2024-10-24 16:12:36,215 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 38 states [2024-10-24 16:12:36,215 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-24 16:12:36,216 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 38 interpolants. [2024-10-24 16:12:36,216 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=134, Invalid=1271, Unknown=1, NotChecked=0, Total=1406 [2024-10-24 16:12:36,216 INFO L87 Difference]: Start difference. First operand 104 states and 119 transitions. Second operand has 38 states, 31 states have (on average 1.8709677419354838) internal successors, (58), 34 states have internal predecessors, (58), 9 states have call successors, (11), 2 states have call predecessors, (11), 2 states have return successors, (10), 9 states have call predecessors, (10), 8 states have call successors, (10) [2024-10-24 16:12:37,262 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-24 16:12:37,262 INFO L93 Difference]: Finished difference Result 140 states and 163 transitions. [2024-10-24 16:12:37,262 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 18 states. [2024-10-24 16:12:37,263 INFO L78 Accepts]: Start accepts. Automaton has has 38 states, 31 states have (on average 1.8709677419354838) internal successors, (58), 34 states have internal predecessors, (58), 9 states have call successors, (11), 2 states have call predecessors, (11), 2 states have return successors, (10), 9 states have call predecessors, (10), 8 states have call successors, (10) Word has length 42 [2024-10-24 16:12:37,263 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-24 16:12:37,263 INFO L225 Difference]: With dead ends: 140 [2024-10-24 16:12:37,263 INFO L226 Difference]: Without dead ends: 138 [2024-10-24 16:12:37,264 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 114 GetRequests, 67 SyntacticMatches, 0 SemanticMatches, 47 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 386 ImplicationChecksByTransitivity, 2.9s TimeCoverageRelationStatistics Valid=282, Invalid=2069, Unknown=1, NotChecked=0, Total=2352 [2024-10-24 16:12:37,264 INFO L432 NwaCegarLoop]: 59 mSDtfsCounter, 113 mSDsluCounter, 1065 mSDsCounter, 0 mSdLazyCounter, 738 mSolverCounterSat, 7 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 113 SdHoareTripleChecker+Valid, 1124 SdHoareTripleChecker+Invalid, 745 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 7 IncrementalHoareTripleChecker+Valid, 738 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.5s IncrementalHoareTripleChecker+Time [2024-10-24 16:12:37,265 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [113 Valid, 1124 Invalid, 745 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [7 Valid, 738 Invalid, 0 Unknown, 0 Unchecked, 0.5s Time] [2024-10-24 16:12:37,265 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 138 states. [2024-10-24 16:12:37,267 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 138 to 107. [2024-10-24 16:12:37,267 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 107 states, 75 states have (on average 1.3466666666666667) internal successors, (101), 92 states have internal predecessors, (101), 10 states have call successors, (10), 5 states have call predecessors, (10), 5 states have return successors, (10), 9 states have call predecessors, (10), 10 states have call successors, (10) [2024-10-24 16:12:37,268 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 107 states to 107 states and 121 transitions. [2024-10-24 16:12:37,268 INFO L78 Accepts]: Start accepts. Automaton has 107 states and 121 transitions. Word has length 42 [2024-10-24 16:12:37,268 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-24 16:12:37,268 INFO L471 AbstractCegarLoop]: Abstraction has 107 states and 121 transitions. [2024-10-24 16:12:37,268 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 38 states, 31 states have (on average 1.8709677419354838) internal successors, (58), 34 states have internal predecessors, (58), 9 states have call successors, (11), 2 states have call predecessors, (11), 2 states have return successors, (10), 9 states have call predecessors, (10), 8 states have call successors, (10) [2024-10-24 16:12:37,268 INFO L276 IsEmpty]: Start isEmpty. Operand 107 states and 121 transitions. [2024-10-24 16:12:37,269 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 45 [2024-10-24 16:12:37,269 INFO L207 NwaCegarLoop]: Found error trace [2024-10-24 16:12:37,269 INFO L215 NwaCegarLoop]: trace histogram [4, 4, 4, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-24 16:12:37,285 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (11)] Forceful destruction successful, exit code 0 [2024-10-24 16:12:37,473 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,SelfDestructingSolverStorable22 [2024-10-24 16:12:37,474 INFO L396 AbstractCegarLoop]: === Iteration 24 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONMEMORY_LEAK === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 34 more)] === [2024-10-24 16:12:37,474 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-24 16:12:37,474 INFO L85 PathProgramCache]: Analyzing trace with hash -420872010, now seen corresponding path program 1 times [2024-10-24 16:12:37,474 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-24 16:12:37,474 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1236846091] [2024-10-24 16:12:37,474 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-24 16:12:37,474 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-24 16:12:37,490 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 16:12:37,616 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2024-10-24 16:12:37,617 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 16:12:37,618 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 7 [2024-10-24 16:12:37,619 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 16:12:37,620 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 12 [2024-10-24 16:12:37,620 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 16:12:37,621 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 17 [2024-10-24 16:12:37,622 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 16:12:37,623 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 33 [2024-10-24 16:12:37,624 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 16:12:37,625 INFO L134 CoverageAnalysis]: Checked inductivity of 26 backedges. 2 proven. 0 refuted. 0 times theorem prover too weak. 24 trivial. 0 not checked. [2024-10-24 16:12:37,625 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-24 16:12:37,625 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1236846091] [2024-10-24 16:12:37,625 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1236846091] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-24 16:12:37,625 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-24 16:12:37,625 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2024-10-24 16:12:37,625 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [944646659] [2024-10-24 16:12:37,625 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-24 16:12:37,626 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2024-10-24 16:12:37,626 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-24 16:12:37,626 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2024-10-24 16:12:37,626 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2024-10-24 16:12:37,626 INFO L87 Difference]: Start difference. First operand 107 states and 121 transitions. Second operand has 5 states, 5 states have (on average 4.8) internal successors, (24), 5 states have internal predecessors, (24), 3 states have call successors, (6), 2 states have call predecessors, (6), 1 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) [2024-10-24 16:12:37,702 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-24 16:12:37,702 INFO L93 Difference]: Finished difference Result 132 states and 151 transitions. [2024-10-24 16:12:37,703 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-10-24 16:12:37,703 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 4.8) internal successors, (24), 5 states have internal predecessors, (24), 3 states have call successors, (6), 2 states have call predecessors, (6), 1 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) Word has length 44 [2024-10-24 16:12:37,703 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-24 16:12:37,703 INFO L225 Difference]: With dead ends: 132 [2024-10-24 16:12:37,704 INFO L226 Difference]: Without dead ends: 132 [2024-10-24 16:12:37,704 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 16 GetRequests, 12 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2024-10-24 16:12:37,704 INFO L432 NwaCegarLoop]: 65 mSDtfsCounter, 20 mSDsluCounter, 182 mSDsCounter, 0 mSdLazyCounter, 76 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 23 SdHoareTripleChecker+Valid, 247 SdHoareTripleChecker+Invalid, 76 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 76 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-10-24 16:12:37,704 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [23 Valid, 247 Invalid, 76 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 76 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-10-24 16:12:37,705 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 132 states. [2024-10-24 16:12:37,707 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 132 to 113. [2024-10-24 16:12:37,707 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 113 states, 80 states have (on average 1.325) internal successors, (106), 97 states have internal predecessors, (106), 11 states have call successors, (11), 5 states have call predecessors, (11), 5 states have return successors, (11), 10 states have call predecessors, (11), 11 states have call successors, (11) [2024-10-24 16:12:37,708 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 113 states to 113 states and 128 transitions. [2024-10-24 16:12:37,708 INFO L78 Accepts]: Start accepts. Automaton has 113 states and 128 transitions. Word has length 44 [2024-10-24 16:12:37,708 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-24 16:12:37,708 INFO L471 AbstractCegarLoop]: Abstraction has 113 states and 128 transitions. [2024-10-24 16:12:37,708 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 4.8) internal successors, (24), 5 states have internal predecessors, (24), 3 states have call successors, (6), 2 states have call predecessors, (6), 1 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) [2024-10-24 16:12:37,708 INFO L276 IsEmpty]: Start isEmpty. Operand 113 states and 128 transitions. [2024-10-24 16:12:37,708 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 46 [2024-10-24 16:12:37,709 INFO L207 NwaCegarLoop]: Found error trace [2024-10-24 16:12:37,709 INFO L215 NwaCegarLoop]: trace histogram [4, 4, 4, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-24 16:12:37,709 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable23 [2024-10-24 16:12:37,709 INFO L396 AbstractCegarLoop]: === Iteration 25 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONMEMORY_LEAK === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 34 more)] === [2024-10-24 16:12:37,709 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-24 16:12:37,709 INFO L85 PathProgramCache]: Analyzing trace with hash -324941009, now seen corresponding path program 1 times [2024-10-24 16:12:37,709 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-24 16:12:37,709 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [633306200] [2024-10-24 16:12:37,709 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-24 16:12:37,710 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-24 16:12:37,719 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 16:12:37,895 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2024-10-24 16:12:37,896 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 16:12:37,897 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 7 [2024-10-24 16:12:37,897 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 16:12:37,898 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 12 [2024-10-24 16:12:37,898 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 16:12:37,899 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 17 [2024-10-24 16:12:37,899 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 16:12:37,900 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 33 [2024-10-24 16:12:37,901 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 16:12:37,902 INFO L134 CoverageAnalysis]: Checked inductivity of 26 backedges. 2 proven. 0 refuted. 0 times theorem prover too weak. 24 trivial. 0 not checked. [2024-10-24 16:12:37,902 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-24 16:12:37,902 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [633306200] [2024-10-24 16:12:37,902 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [633306200] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-24 16:12:37,903 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-24 16:12:37,903 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2024-10-24 16:12:37,903 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1206620683] [2024-10-24 16:12:37,903 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-24 16:12:37,903 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2024-10-24 16:12:37,903 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-24 16:12:37,903 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2024-10-24 16:12:37,904 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=57, Unknown=0, NotChecked=0, Total=72 [2024-10-24 16:12:37,904 INFO L87 Difference]: Start difference. First operand 113 states and 128 transitions. Second operand has 9 states, 8 states have (on average 3.125) internal successors, (25), 8 states have internal predecessors, (25), 3 states have call successors, (6), 2 states have call predecessors, (6), 1 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) [2024-10-24 16:12:38,092 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-24 16:12:38,092 INFO L93 Difference]: Finished difference Result 136 states and 154 transitions. [2024-10-24 16:12:38,092 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2024-10-24 16:12:38,092 INFO L78 Accepts]: Start accepts. Automaton has has 9 states, 8 states have (on average 3.125) internal successors, (25), 8 states have internal predecessors, (25), 3 states have call successors, (6), 2 states have call predecessors, (6), 1 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) Word has length 45 [2024-10-24 16:12:38,092 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-24 16:12:38,093 INFO L225 Difference]: With dead ends: 136 [2024-10-24 16:12:38,093 INFO L226 Difference]: Without dead ends: 136 [2024-10-24 16:12:38,093 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 24 GetRequests, 12 SyntacticMatches, 0 SemanticMatches, 12 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 9 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=38, Invalid=144, Unknown=0, NotChecked=0, Total=182 [2024-10-24 16:12:38,094 INFO L432 NwaCegarLoop]: 72 mSDtfsCounter, 31 mSDsluCounter, 459 mSDsCounter, 0 mSdLazyCounter, 213 mSolverCounterSat, 4 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 33 SdHoareTripleChecker+Valid, 531 SdHoareTripleChecker+Invalid, 217 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 4 IncrementalHoareTripleChecker+Valid, 213 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-10-24 16:12:38,094 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [33 Valid, 531 Invalid, 217 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [4 Valid, 213 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-10-24 16:12:38,094 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 136 states. [2024-10-24 16:12:38,097 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 136 to 119. [2024-10-24 16:12:38,097 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 119 states, 84 states have (on average 1.3095238095238095) internal successors, (110), 102 states have internal predecessors, (110), 12 states have call successors, (12), 6 states have call predecessors, (12), 6 states have return successors, (12), 10 states have call predecessors, (12), 12 states have call successors, (12) [2024-10-24 16:12:38,097 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 119 states to 119 states and 134 transitions. [2024-10-24 16:12:38,098 INFO L78 Accepts]: Start accepts. Automaton has 119 states and 134 transitions. Word has length 45 [2024-10-24 16:12:38,098 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-24 16:12:38,098 INFO L471 AbstractCegarLoop]: Abstraction has 119 states and 134 transitions. [2024-10-24 16:12:38,098 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 8 states have (on average 3.125) internal successors, (25), 8 states have internal predecessors, (25), 3 states have call successors, (6), 2 states have call predecessors, (6), 1 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) [2024-10-24 16:12:38,098 INFO L276 IsEmpty]: Start isEmpty. Operand 119 states and 134 transitions. [2024-10-24 16:12:38,098 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 45 [2024-10-24 16:12:38,098 INFO L207 NwaCegarLoop]: Found error trace [2024-10-24 16:12:38,098 INFO L215 NwaCegarLoop]: trace histogram [4, 4, 4, 4, 4, 3, 3, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-24 16:12:38,099 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable24 [2024-10-24 16:12:38,099 INFO L396 AbstractCegarLoop]: === Iteration 26 === Targeting ULTIMATE.startErr7REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 34 more)] === [2024-10-24 16:12:38,099 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-24 16:12:38,099 INFO L85 PathProgramCache]: Analyzing trace with hash -1074041094, now seen corresponding path program 2 times [2024-10-24 16:12:38,099 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-24 16:12:38,099 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2080325968] [2024-10-24 16:12:38,099 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-24 16:12:38,099 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-24 16:12:38,115 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 16:12:38,198 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2024-10-24 16:12:38,199 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 16:12:38,200 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 7 [2024-10-24 16:12:38,201 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 16:12:38,201 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 12 [2024-10-24 16:12:38,202 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 16:12:38,203 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 17 [2024-10-24 16:12:38,203 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 16:12:38,204 INFO L134 CoverageAnalysis]: Checked inductivity of 50 backedges. 8 proven. 18 refuted. 0 times theorem prover too weak. 24 trivial. 0 not checked. [2024-10-24 16:12:38,204 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-24 16:12:38,204 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2080325968] [2024-10-24 16:12:38,204 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2080325968] provided 0 perfect and 1 imperfect interpolant sequences [2024-10-24 16:12:38,204 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [108445046] [2024-10-24 16:12:38,205 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2024-10-24 16:12:38,205 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-10-24 16:12:38,205 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-10-24 16:12:38,208 INFO L229 MonitoredProcess]: Starting monitored process 12 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-10-24 16:12:38,210 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (12)] Waiting until timeout for monitored process [2024-10-24 16:12:38,294 INFO L227 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2024-10-24 16:12:38,294 INFO L228 tOrderPrioritization]: Conjunction of SSA is unsat [2024-10-24 16:12:38,295 INFO L255 TraceCheckSpWp]: Trace formula consists of 205 conjuncts, 8 conjuncts are in the unsatisfiable core [2024-10-24 16:12:38,296 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-24 16:12:38,321 INFO L134 CoverageAnalysis]: Checked inductivity of 50 backedges. 8 proven. 18 refuted. 0 times theorem prover too weak. 24 trivial. 0 not checked. [2024-10-24 16:12:38,321 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-10-24 16:12:38,381 INFO L134 CoverageAnalysis]: Checked inductivity of 50 backedges. 8 proven. 18 refuted. 0 times theorem prover too weak. 24 trivial. 0 not checked. [2024-10-24 16:12:38,381 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [108445046] provided 0 perfect and 2 imperfect interpolant sequences [2024-10-24 16:12:38,381 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2024-10-24 16:12:38,381 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [9, 9, 9] total 9 [2024-10-24 16:12:38,381 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [392628343] [2024-10-24 16:12:38,381 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2024-10-24 16:12:38,382 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2024-10-24 16:12:38,382 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-24 16:12:38,382 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2024-10-24 16:12:38,382 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=20, Invalid=52, Unknown=0, NotChecked=0, Total=72 [2024-10-24 16:12:38,382 INFO L87 Difference]: Start difference. First operand 119 states and 134 transitions. Second operand has 9 states, 9 states have (on average 3.0) internal successors, (27), 9 states have internal predecessors, (27), 1 states have call successors, (4), 1 states have call predecessors, (4), 1 states have return successors, (4), 1 states have call predecessors, (4), 1 states have call successors, (4) [2024-10-24 16:12:38,495 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-24 16:12:38,495 INFO L93 Difference]: Finished difference Result 151 states and 176 transitions. [2024-10-24 16:12:38,496 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2024-10-24 16:12:38,496 INFO L78 Accepts]: Start accepts. Automaton has has 9 states, 9 states have (on average 3.0) internal successors, (27), 9 states have internal predecessors, (27), 1 states have call successors, (4), 1 states have call predecessors, (4), 1 states have return successors, (4), 1 states have call predecessors, (4), 1 states have call successors, (4) Word has length 44 [2024-10-24 16:12:38,496 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-24 16:12:38,497 INFO L225 Difference]: With dead ends: 151 [2024-10-24 16:12:38,497 INFO L226 Difference]: Without dead ends: 151 [2024-10-24 16:12:38,497 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 105 GetRequests, 90 SyntacticMatches, 6 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 23 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=36, Invalid=74, Unknown=0, NotChecked=0, Total=110 [2024-10-24 16:12:38,498 INFO L432 NwaCegarLoop]: 65 mSDtfsCounter, 23 mSDsluCounter, 250 mSDsCounter, 0 mSdLazyCounter, 128 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 23 SdHoareTripleChecker+Valid, 315 SdHoareTripleChecker+Invalid, 129 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 128 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-10-24 16:12:38,498 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [23 Valid, 315 Invalid, 129 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 128 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-10-24 16:12:38,498 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 151 states. [2024-10-24 16:12:38,500 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 151 to 137. [2024-10-24 16:12:38,501 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 137 states, 102 states have (on average 1.3235294117647058) internal successors, (135), 120 states have internal predecessors, (135), 12 states have call successors, (12), 6 states have call predecessors, (12), 6 states have return successors, (12), 10 states have call predecessors, (12), 12 states have call successors, (12) [2024-10-24 16:12:38,503 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 137 states to 137 states and 159 transitions. [2024-10-24 16:12:38,504 INFO L78 Accepts]: Start accepts. Automaton has 137 states and 159 transitions. Word has length 44 [2024-10-24 16:12:38,504 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-24 16:12:38,504 INFO L471 AbstractCegarLoop]: Abstraction has 137 states and 159 transitions. [2024-10-24 16:12:38,505 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 9 states have (on average 3.0) internal successors, (27), 9 states have internal predecessors, (27), 1 states have call successors, (4), 1 states have call predecessors, (4), 1 states have return successors, (4), 1 states have call predecessors, (4), 1 states have call successors, (4) [2024-10-24 16:12:38,505 INFO L276 IsEmpty]: Start isEmpty. Operand 137 states and 159 transitions. [2024-10-24 16:12:38,506 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 49 [2024-10-24 16:12:38,506 INFO L207 NwaCegarLoop]: Found error trace [2024-10-24 16:12:38,506 INFO L215 NwaCegarLoop]: trace histogram [4, 4, 4, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-24 16:12:38,525 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (12)] Forceful destruction successful, exit code 0 [2024-10-24 16:12:38,707 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 12 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable25 [2024-10-24 16:12:38,708 INFO L396 AbstractCegarLoop]: === Iteration 27 === Targeting ULTIMATE.startErr16REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 34 more)] === [2024-10-24 16:12:38,709 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-24 16:12:38,709 INFO L85 PathProgramCache]: Analyzing trace with hash 544593299, now seen corresponding path program 1 times [2024-10-24 16:12:38,709 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-24 16:12:38,709 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [926318057] [2024-10-24 16:12:38,709 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-24 16:12:38,709 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-24 16:12:38,719 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 16:12:38,749 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2024-10-24 16:12:38,750 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 16:12:38,751 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 7 [2024-10-24 16:12:38,751 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 16:12:38,752 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 12 [2024-10-24 16:12:38,753 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 16:12:38,753 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 17 [2024-10-24 16:12:38,754 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 16:12:38,755 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 33 [2024-10-24 16:12:38,755 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 16:12:38,756 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 41 [2024-10-24 16:12:38,757 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 16:12:38,758 INFO L134 CoverageAnalysis]: Checked inductivity of 28 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 28 trivial. 0 not checked. [2024-10-24 16:12:38,758 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-24 16:12:38,758 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [926318057] [2024-10-24 16:12:38,758 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [926318057] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-24 16:12:38,758 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-24 16:12:38,758 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-10-24 16:12:38,759 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [865184650] [2024-10-24 16:12:38,759 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-24 16:12:38,759 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-10-24 16:12:38,759 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-24 16:12:38,759 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-10-24 16:12:38,759 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-10-24 16:12:38,760 INFO L87 Difference]: Start difference. First operand 137 states and 159 transitions. Second operand has 4 states, 3 states have (on average 8.0) internal successors, (24), 4 states have internal predecessors, (24), 2 states have call successors, (6), 1 states have call predecessors, (6), 1 states have return successors, (6), 2 states have call predecessors, (6), 2 states have call successors, (6) [2024-10-24 16:12:38,837 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-24 16:12:38,837 INFO L93 Difference]: Finished difference Result 133 states and 155 transitions. [2024-10-24 16:12:38,837 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-10-24 16:12:38,837 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 3 states have (on average 8.0) internal successors, (24), 4 states have internal predecessors, (24), 2 states have call successors, (6), 1 states have call predecessors, (6), 1 states have return successors, (6), 2 states have call predecessors, (6), 2 states have call successors, (6) Word has length 48 [2024-10-24 16:12:38,838 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-24 16:12:38,838 INFO L225 Difference]: With dead ends: 133 [2024-10-24 16:12:38,838 INFO L226 Difference]: Without dead ends: 133 [2024-10-24 16:12:38,839 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 16 GetRequests, 13 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-10-24 16:12:38,839 INFO L432 NwaCegarLoop]: 52 mSDtfsCounter, 40 mSDsluCounter, 47 mSDsCounter, 0 mSdLazyCounter, 75 mSolverCounterSat, 4 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 43 SdHoareTripleChecker+Valid, 99 SdHoareTripleChecker+Invalid, 79 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 4 IncrementalHoareTripleChecker+Valid, 75 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-10-24 16:12:38,839 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [43 Valid, 99 Invalid, 79 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [4 Valid, 75 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-10-24 16:12:38,840 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 133 states. [2024-10-24 16:12:38,843 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 133 to 133. [2024-10-24 16:12:38,843 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 133 states, 102 states have (on average 1.2843137254901962) internal successors, (131), 116 states have internal predecessors, (131), 12 states have call successors, (12), 6 states have call predecessors, (12), 6 states have return successors, (12), 10 states have call predecessors, (12), 12 states have call successors, (12) [2024-10-24 16:12:38,844 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 133 states to 133 states and 155 transitions. [2024-10-24 16:12:38,844 INFO L78 Accepts]: Start accepts. Automaton has 133 states and 155 transitions. Word has length 48 [2024-10-24 16:12:38,844 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-24 16:12:38,844 INFO L471 AbstractCegarLoop]: Abstraction has 133 states and 155 transitions. [2024-10-24 16:12:38,844 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 3 states have (on average 8.0) internal successors, (24), 4 states have internal predecessors, (24), 2 states have call successors, (6), 1 states have call predecessors, (6), 1 states have return successors, (6), 2 states have call predecessors, (6), 2 states have call successors, (6) [2024-10-24 16:12:38,844 INFO L276 IsEmpty]: Start isEmpty. Operand 133 states and 155 transitions. [2024-10-24 16:12:38,844 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 49 [2024-10-24 16:12:38,845 INFO L207 NwaCegarLoop]: Found error trace [2024-10-24 16:12:38,845 INFO L215 NwaCegarLoop]: trace histogram [4, 4, 4, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-24 16:12:38,845 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable26 [2024-10-24 16:12:38,845 INFO L396 AbstractCegarLoop]: === Iteration 28 === Targeting ULTIMATE.startErr17REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 34 more)] === [2024-10-24 16:12:38,845 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-24 16:12:38,845 INFO L85 PathProgramCache]: Analyzing trace with hash 544593300, now seen corresponding path program 1 times [2024-10-24 16:12:38,845 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-24 16:12:38,845 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1066899671] [2024-10-24 16:12:38,845 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-24 16:12:38,846 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-24 16:12:38,866 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 16:12:38,942 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2024-10-24 16:12:38,943 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 16:12:38,944 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 7 [2024-10-24 16:12:38,944 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 16:12:38,947 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 12 [2024-10-24 16:12:38,947 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 16:12:38,948 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 17 [2024-10-24 16:12:38,949 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 16:12:38,950 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 33 [2024-10-24 16:12:38,950 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 16:12:38,955 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 41 [2024-10-24 16:12:38,956 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 16:12:38,957 INFO L134 CoverageAnalysis]: Checked inductivity of 28 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 28 trivial. 0 not checked. [2024-10-24 16:12:38,958 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-24 16:12:38,958 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1066899671] [2024-10-24 16:12:38,958 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1066899671] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-24 16:12:38,958 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-24 16:12:38,958 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-10-24 16:12:38,958 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [89450940] [2024-10-24 16:12:38,958 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-24 16:12:38,958 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-10-24 16:12:38,958 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-24 16:12:38,959 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-10-24 16:12:38,959 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-10-24 16:12:38,959 INFO L87 Difference]: Start difference. First operand 133 states and 155 transitions. Second operand has 4 states, 3 states have (on average 8.0) internal successors, (24), 4 states have internal predecessors, (24), 2 states have call successors, (6), 1 states have call predecessors, (6), 1 states have return successors, (6), 2 states have call predecessors, (6), 2 states have call successors, (6) [2024-10-24 16:12:39,031 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-24 16:12:39,031 INFO L93 Difference]: Finished difference Result 129 states and 151 transitions. [2024-10-24 16:12:39,032 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-10-24 16:12:39,032 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 3 states have (on average 8.0) internal successors, (24), 4 states have internal predecessors, (24), 2 states have call successors, (6), 1 states have call predecessors, (6), 1 states have return successors, (6), 2 states have call predecessors, (6), 2 states have call successors, (6) Word has length 48 [2024-10-24 16:12:39,032 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-24 16:12:39,033 INFO L225 Difference]: With dead ends: 129 [2024-10-24 16:12:39,033 INFO L226 Difference]: Without dead ends: 129 [2024-10-24 16:12:39,033 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 16 GetRequests, 13 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-10-24 16:12:39,033 INFO L432 NwaCegarLoop]: 55 mSDtfsCounter, 31 mSDsluCounter, 60 mSDsCounter, 0 mSdLazyCounter, 57 mSolverCounterSat, 4 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 33 SdHoareTripleChecker+Valid, 115 SdHoareTripleChecker+Invalid, 61 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 4 IncrementalHoareTripleChecker+Valid, 57 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-10-24 16:12:39,034 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [33 Valid, 115 Invalid, 61 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [4 Valid, 57 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-10-24 16:12:39,034 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 129 states. [2024-10-24 16:12:39,039 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 129 to 129. [2024-10-24 16:12:39,040 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 129 states, 102 states have (on average 1.2450980392156863) internal successors, (127), 112 states have internal predecessors, (127), 12 states have call successors, (12), 6 states have call predecessors, (12), 6 states have return successors, (12), 10 states have call predecessors, (12), 12 states have call successors, (12) [2024-10-24 16:12:39,040 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 129 states to 129 states and 151 transitions. [2024-10-24 16:12:39,040 INFO L78 Accepts]: Start accepts. Automaton has 129 states and 151 transitions. Word has length 48 [2024-10-24 16:12:39,040 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-24 16:12:39,041 INFO L471 AbstractCegarLoop]: Abstraction has 129 states and 151 transitions. [2024-10-24 16:12:39,041 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 3 states have (on average 8.0) internal successors, (24), 4 states have internal predecessors, (24), 2 states have call successors, (6), 1 states have call predecessors, (6), 1 states have return successors, (6), 2 states have call predecessors, (6), 2 states have call successors, (6) [2024-10-24 16:12:39,041 INFO L276 IsEmpty]: Start isEmpty. Operand 129 states and 151 transitions. [2024-10-24 16:12:39,041 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 49 [2024-10-24 16:12:39,041 INFO L207 NwaCegarLoop]: Found error trace [2024-10-24 16:12:39,041 INFO L215 NwaCegarLoop]: trace histogram [5, 5, 4, 4, 4, 4, 4, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-24 16:12:39,041 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable27 [2024-10-24 16:12:39,042 INFO L396 AbstractCegarLoop]: === Iteration 29 === Targeting ULTIMATE.startErr7REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 34 more)] === [2024-10-24 16:12:39,043 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-24 16:12:39,043 INFO L85 PathProgramCache]: Analyzing trace with hash -1693143878, now seen corresponding path program 3 times [2024-10-24 16:12:39,043 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-24 16:12:39,043 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1928633719] [2024-10-24 16:12:39,043 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-24 16:12:39,043 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-24 16:12:39,053 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 16:12:39,237 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2024-10-24 16:12:39,238 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 16:12:39,239 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 7 [2024-10-24 16:12:39,240 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 16:12:39,242 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 12 [2024-10-24 16:12:39,243 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 16:12:39,245 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 17 [2024-10-24 16:12:39,245 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 16:12:39,247 INFO L134 CoverageAnalysis]: Checked inductivity of 66 backedges. 10 proven. 32 refuted. 0 times theorem prover too weak. 24 trivial. 0 not checked. [2024-10-24 16:12:39,248 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-24 16:12:39,248 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1928633719] [2024-10-24 16:12:39,248 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1928633719] provided 0 perfect and 1 imperfect interpolant sequences [2024-10-24 16:12:39,248 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1560704504] [2024-10-24 16:12:39,248 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2024-10-24 16:12:39,248 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-10-24 16:12:39,248 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-10-24 16:12:39,250 INFO L229 MonitoredProcess]: Starting monitored process 13 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-10-24 16:12:39,251 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (13)] Waiting until timeout for monitored process [2024-10-24 16:12:39,334 INFO L227 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 3 check-sat command(s) [2024-10-24 16:12:39,334 INFO L228 tOrderPrioritization]: Conjunction of SSA is unsat [2024-10-24 16:12:39,336 INFO L255 TraceCheckSpWp]: Trace formula consists of 156 conjuncts, 8 conjuncts are in the unsatisfiable core [2024-10-24 16:12:39,338 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-24 16:12:39,477 INFO L134 CoverageAnalysis]: Checked inductivity of 66 backedges. 27 proven. 5 refuted. 0 times theorem prover too weak. 34 trivial. 0 not checked. [2024-10-24 16:12:39,477 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-10-24 16:12:39,705 INFO L134 CoverageAnalysis]: Checked inductivity of 66 backedges. 26 proven. 6 refuted. 0 times theorem prover too weak. 34 trivial. 0 not checked. [2024-10-24 16:12:39,705 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1560704504] provided 0 perfect and 2 imperfect interpolant sequences [2024-10-24 16:12:39,705 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2024-10-24 16:12:39,705 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [10, 8, 8] total 24 [2024-10-24 16:12:39,706 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [919389700] [2024-10-24 16:12:39,706 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2024-10-24 16:12:39,706 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 25 states [2024-10-24 16:12:39,706 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-24 16:12:39,707 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 25 interpolants. [2024-10-24 16:12:39,707 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=105, Invalid=495, Unknown=0, NotChecked=0, Total=600 [2024-10-24 16:12:39,707 INFO L87 Difference]: Start difference. First operand 129 states and 151 transitions. Second operand has 25 states, 24 states have (on average 2.6666666666666665) internal successors, (64), 25 states have internal predecessors, (64), 2 states have call successors, (7), 1 states have call predecessors, (7), 1 states have return successors, (7), 2 states have call predecessors, (7), 2 states have call successors, (7) [2024-10-24 16:12:40,404 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-24 16:12:40,404 INFO L93 Difference]: Finished difference Result 155 states and 182 transitions. [2024-10-24 16:12:40,405 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 32 states. [2024-10-24 16:12:40,405 INFO L78 Accepts]: Start accepts. Automaton has has 25 states, 24 states have (on average 2.6666666666666665) internal successors, (64), 25 states have internal predecessors, (64), 2 states have call successors, (7), 1 states have call predecessors, (7), 1 states have return successors, (7), 2 states have call predecessors, (7), 2 states have call successors, (7) Word has length 48 [2024-10-24 16:12:40,405 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-24 16:12:40,406 INFO L225 Difference]: With dead ends: 155 [2024-10-24 16:12:40,406 INFO L226 Difference]: Without dead ends: 155 [2024-10-24 16:12:40,407 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 148 GetRequests, 96 SyntacticMatches, 0 SemanticMatches, 52 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 627 ImplicationChecksByTransitivity, 0.7s TimeCoverageRelationStatistics Valid=548, Invalid=2314, Unknown=0, NotChecked=0, Total=2862 [2024-10-24 16:12:40,408 INFO L432 NwaCegarLoop]: 56 mSDtfsCounter, 132 mSDsluCounter, 411 mSDsCounter, 0 mSdLazyCounter, 562 mSolverCounterSat, 21 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 137 SdHoareTripleChecker+Valid, 467 SdHoareTripleChecker+Invalid, 583 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 21 IncrementalHoareTripleChecker+Valid, 562 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2024-10-24 16:12:40,408 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [137 Valid, 467 Invalid, 583 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [21 Valid, 562 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2024-10-24 16:12:40,408 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 155 states. [2024-10-24 16:12:40,411 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 155 to 128. [2024-10-24 16:12:40,411 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 128 states, 102 states have (on average 1.2254901960784315) internal successors, (125), 111 states have internal predecessors, (125), 12 states have call successors, (12), 6 states have call predecessors, (12), 6 states have return successors, (12), 10 states have call predecessors, (12), 12 states have call successors, (12) [2024-10-24 16:12:40,411 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 128 states to 128 states and 149 transitions. [2024-10-24 16:12:40,412 INFO L78 Accepts]: Start accepts. Automaton has 128 states and 149 transitions. Word has length 48 [2024-10-24 16:12:40,412 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-24 16:12:40,412 INFO L471 AbstractCegarLoop]: Abstraction has 128 states and 149 transitions. [2024-10-24 16:12:40,412 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 25 states, 24 states have (on average 2.6666666666666665) internal successors, (64), 25 states have internal predecessors, (64), 2 states have call successors, (7), 1 states have call predecessors, (7), 1 states have return successors, (7), 2 states have call predecessors, (7), 2 states have call successors, (7) [2024-10-24 16:12:40,412 INFO L276 IsEmpty]: Start isEmpty. Operand 128 states and 149 transitions. [2024-10-24 16:12:40,413 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 54 [2024-10-24 16:12:40,413 INFO L207 NwaCegarLoop]: Found error trace [2024-10-24 16:12:40,413 INFO L215 NwaCegarLoop]: trace histogram [4, 4, 4, 3, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-24 16:12:40,429 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (13)] Ended with exit code 0 [2024-10-24 16:12:40,613 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 13 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable28 [2024-10-24 16:12:40,614 INFO L396 AbstractCegarLoop]: === Iteration 30 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONMEMORY_LEAK === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 34 more)] === [2024-10-24 16:12:40,614 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-24 16:12:40,614 INFO L85 PathProgramCache]: Analyzing trace with hash -500401876, now seen corresponding path program 1 times [2024-10-24 16:12:40,614 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-24 16:12:40,614 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [274925059] [2024-10-24 16:12:40,614 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-24 16:12:40,614 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-24 16:12:40,630 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 16:12:40,770 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2024-10-24 16:12:40,770 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 16:12:40,772 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 7 [2024-10-24 16:12:40,772 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 16:12:40,773 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 12 [2024-10-24 16:12:40,773 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 16:12:40,774 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 17 [2024-10-24 16:12:40,774 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 16:12:40,775 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 33 [2024-10-24 16:12:40,776 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 16:12:40,776 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 41 [2024-10-24 16:12:40,777 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 16:12:40,778 INFO L134 CoverageAnalysis]: Checked inductivity of 32 backedges. 4 proven. 0 refuted. 0 times theorem prover too weak. 28 trivial. 0 not checked. [2024-10-24 16:12:40,778 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-24 16:12:40,778 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [274925059] [2024-10-24 16:12:40,779 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [274925059] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-24 16:12:40,779 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-24 16:12:40,779 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2024-10-24 16:12:40,779 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1956439046] [2024-10-24 16:12:40,779 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-24 16:12:40,779 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2024-10-24 16:12:40,779 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-24 16:12:40,780 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2024-10-24 16:12:40,780 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=29, Unknown=0, NotChecked=0, Total=42 [2024-10-24 16:12:40,780 INFO L87 Difference]: Start difference. First operand 128 states and 149 transitions. Second operand has 7 states, 7 states have (on average 4.0) internal successors, (28), 7 states have internal predecessors, (28), 3 states have call successors, (7), 2 states have call predecessors, (7), 1 states have return successors, (6), 2 states have call predecessors, (6), 2 states have call successors, (6) [2024-10-24 16:12:40,880 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-24 16:12:40,880 INFO L93 Difference]: Finished difference Result 143 states and 166 transitions. [2024-10-24 16:12:40,880 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2024-10-24 16:12:40,880 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 4.0) internal successors, (28), 7 states have internal predecessors, (28), 3 states have call successors, (7), 2 states have call predecessors, (7), 1 states have return successors, (6), 2 states have call predecessors, (6), 2 states have call successors, (6) Word has length 53 [2024-10-24 16:12:40,880 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-24 16:12:40,881 INFO L225 Difference]: With dead ends: 143 [2024-10-24 16:12:40,881 INFO L226 Difference]: Without dead ends: 143 [2024-10-24 16:12:40,881 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 20 GetRequests, 14 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=17, Invalid=39, Unknown=0, NotChecked=0, Total=56 [2024-10-24 16:12:40,882 INFO L432 NwaCegarLoop]: 53 mSDtfsCounter, 12 mSDsluCounter, 244 mSDsCounter, 0 mSdLazyCounter, 134 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 14 SdHoareTripleChecker+Valid, 297 SdHoareTripleChecker+Invalid, 135 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 134 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-10-24 16:12:40,882 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [14 Valid, 297 Invalid, 135 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 134 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-10-24 16:12:40,883 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 143 states. [2024-10-24 16:12:40,886 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 143 to 131. [2024-10-24 16:12:40,886 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 131 states, 105 states have (on average 1.2190476190476192) internal successors, (128), 113 states have internal predecessors, (128), 12 states have call successors, (12), 6 states have call predecessors, (12), 6 states have return successors, (12), 11 states have call predecessors, (12), 12 states have call successors, (12) [2024-10-24 16:12:40,887 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 131 states to 131 states and 152 transitions. [2024-10-24 16:12:40,887 INFO L78 Accepts]: Start accepts. Automaton has 131 states and 152 transitions. Word has length 53 [2024-10-24 16:12:40,888 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-24 16:12:40,888 INFO L471 AbstractCegarLoop]: Abstraction has 131 states and 152 transitions. [2024-10-24 16:12:40,888 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 4.0) internal successors, (28), 7 states have internal predecessors, (28), 3 states have call successors, (7), 2 states have call predecessors, (7), 1 states have return successors, (6), 2 states have call predecessors, (6), 2 states have call successors, (6) [2024-10-24 16:12:40,888 INFO L276 IsEmpty]: Start isEmpty. Operand 131 states and 152 transitions. [2024-10-24 16:12:40,888 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 55 [2024-10-24 16:12:40,888 INFO L207 NwaCegarLoop]: Found error trace [2024-10-24 16:12:40,889 INFO L215 NwaCegarLoop]: trace histogram [4, 4, 4, 3, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-24 16:12:40,889 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable29 [2024-10-24 16:12:40,889 INFO L396 AbstractCegarLoop]: === Iteration 31 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONMEMORY_LEAK === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 34 more)] === [2024-10-24 16:12:40,889 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-24 16:12:40,889 INFO L85 PathProgramCache]: Analyzing trace with hash 1505583544, now seen corresponding path program 1 times [2024-10-24 16:12:40,889 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-24 16:12:40,889 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1374070906] [2024-10-24 16:12:40,890 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-24 16:12:40,890 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-24 16:12:40,901 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 16:12:41,035 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2024-10-24 16:12:41,036 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 16:12:41,037 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 7 [2024-10-24 16:12:41,037 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 16:12:41,038 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 12 [2024-10-24 16:12:41,038 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 16:12:41,039 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 17 [2024-10-24 16:12:41,039 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 16:12:41,040 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 33 [2024-10-24 16:12:41,041 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 16:12:41,042 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 41 [2024-10-24 16:12:41,042 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 16:12:41,044 INFO L134 CoverageAnalysis]: Checked inductivity of 32 backedges. 4 proven. 0 refuted. 0 times theorem prover too weak. 28 trivial. 0 not checked. [2024-10-24 16:12:41,044 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-24 16:12:41,044 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1374070906] [2024-10-24 16:12:41,044 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1374070906] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-24 16:12:41,044 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-24 16:12:41,044 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2024-10-24 16:12:41,044 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1092628782] [2024-10-24 16:12:41,044 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-24 16:12:41,045 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2024-10-24 16:12:41,045 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-24 16:12:41,045 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2024-10-24 16:12:41,045 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=43, Unknown=0, NotChecked=0, Total=56 [2024-10-24 16:12:41,045 INFO L87 Difference]: Start difference. First operand 131 states and 152 transitions. Second operand has 8 states, 7 states have (on average 4.142857142857143) internal successors, (29), 7 states have internal predecessors, (29), 3 states have call successors, (7), 2 states have call predecessors, (7), 1 states have return successors, (6), 2 states have call predecessors, (6), 2 states have call successors, (6) [2024-10-24 16:12:41,173 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-24 16:12:41,174 INFO L93 Difference]: Finished difference Result 156 states and 182 transitions. [2024-10-24 16:12:41,174 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2024-10-24 16:12:41,174 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 7 states have (on average 4.142857142857143) internal successors, (29), 7 states have internal predecessors, (29), 3 states have call successors, (7), 2 states have call predecessors, (7), 1 states have return successors, (6), 2 states have call predecessors, (6), 2 states have call successors, (6) Word has length 54 [2024-10-24 16:12:41,174 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-24 16:12:41,175 INFO L225 Difference]: With dead ends: 156 [2024-10-24 16:12:41,175 INFO L226 Difference]: Without dead ends: 156 [2024-10-24 16:12:41,175 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 22 GetRequests, 14 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=21, Invalid=69, Unknown=0, NotChecked=0, Total=90 [2024-10-24 16:12:41,176 INFO L432 NwaCegarLoop]: 71 mSDtfsCounter, 21 mSDsluCounter, 369 mSDsCounter, 0 mSdLazyCounter, 158 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 24 SdHoareTripleChecker+Valid, 440 SdHoareTripleChecker+Invalid, 158 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 158 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-10-24 16:12:41,176 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [24 Valid, 440 Invalid, 158 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 158 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-10-24 16:12:41,176 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 156 states. [2024-10-24 16:12:41,180 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 156 to 144. [2024-10-24 16:12:41,180 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 144 states, 115 states have (on average 1.2173913043478262) internal successors, (140), 123 states have internal predecessors, (140), 14 states have call successors, (14), 7 states have call predecessors, (14), 7 states have return successors, (14), 13 states have call predecessors, (14), 14 states have call successors, (14) [2024-10-24 16:12:41,180 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 144 states to 144 states and 168 transitions. [2024-10-24 16:12:41,180 INFO L78 Accepts]: Start accepts. Automaton has 144 states and 168 transitions. Word has length 54 [2024-10-24 16:12:41,181 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-24 16:12:41,181 INFO L471 AbstractCegarLoop]: Abstraction has 144 states and 168 transitions. [2024-10-24 16:12:41,181 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 7 states have (on average 4.142857142857143) internal successors, (29), 7 states have internal predecessors, (29), 3 states have call successors, (7), 2 states have call predecessors, (7), 1 states have return successors, (6), 2 states have call predecessors, (6), 2 states have call successors, (6) [2024-10-24 16:12:41,181 INFO L276 IsEmpty]: Start isEmpty. Operand 144 states and 168 transitions. [2024-10-24 16:12:41,181 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 54 [2024-10-24 16:12:41,181 INFO L207 NwaCegarLoop]: Found error trace [2024-10-24 16:12:41,181 INFO L215 NwaCegarLoop]: trace histogram [4, 4, 4, 3, 3, 3, 3, 3, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-24 16:12:41,182 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable30 [2024-10-24 16:12:41,182 INFO L396 AbstractCegarLoop]: === Iteration 32 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONMEMORY_LEAK === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 34 more)] === [2024-10-24 16:12:41,182 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-24 16:12:41,182 INFO L85 PathProgramCache]: Analyzing trace with hash 689402626, now seen corresponding path program 3 times [2024-10-24 16:12:41,182 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-24 16:12:41,182 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [684985987] [2024-10-24 16:12:41,183 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-24 16:12:41,183 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-24 16:12:41,215 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 16:12:44,059 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2024-10-24 16:12:44,060 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 16:12:44,061 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 7 [2024-10-24 16:12:44,062 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 16:12:44,063 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 12 [2024-10-24 16:12:44,064 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 16:12:44,065 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 17 [2024-10-24 16:12:44,066 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 16:12:44,068 INFO L134 CoverageAnalysis]: Checked inductivity of 57 backedges. 11 proven. 20 refuted. 0 times theorem prover too weak. 26 trivial. 0 not checked. [2024-10-24 16:12:44,068 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-24 16:12:44,068 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [684985987] [2024-10-24 16:12:44,068 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [684985987] provided 0 perfect and 1 imperfect interpolant sequences [2024-10-24 16:12:44,068 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [487399880] [2024-10-24 16:12:44,068 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2024-10-24 16:12:44,068 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-10-24 16:12:44,069 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-10-24 16:12:44,072 INFO L229 MonitoredProcess]: Starting monitored process 14 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-10-24 16:12:44,073 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (14)] Waiting until timeout for monitored process [2024-10-24 16:12:44,172 INFO L227 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 5 check-sat command(s) [2024-10-24 16:12:44,172 INFO L228 tOrderPrioritization]: Conjunction of SSA is unsat [2024-10-24 16:12:44,175 INFO L255 TraceCheckSpWp]: Trace formula consists of 222 conjuncts, 54 conjuncts are in the unsatisfiable core [2024-10-24 16:12:44,177 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-24 16:12:44,185 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 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 7 treesize of output 6 [2024-10-24 16:12:44,610 INFO L349 Elim1Store]: treesize reduction 24, result has 27.3 percent of original size [2024-10-24 16:12:44,610 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 0 disjoint index pairs (out of 3 index pairs), introduced 2 new quantified variables, introduced 3 case distinctions, treesize of input 26 treesize of output 28 [2024-10-24 16:12:44,674 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 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 0 case distinctions, treesize of input 37 treesize of output 28 [2024-10-24 16:12:45,725 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 67 treesize of output 49 [2024-10-24 16:12:45,825 INFO L134 CoverageAnalysis]: Checked inductivity of 57 backedges. 26 proven. 22 refuted. 0 times theorem prover too weak. 9 trivial. 0 not checked. [2024-10-24 16:12:45,825 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-10-24 16:12:46,820 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [487399880] provided 0 perfect and 1 imperfect interpolant sequences [2024-10-24 16:12:46,820 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2024-10-24 16:12:46,820 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [18, 20] total 36 [2024-10-24 16:12:46,820 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [750871702] [2024-10-24 16:12:46,821 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2024-10-24 16:12:46,821 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 36 states [2024-10-24 16:12:46,821 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-24 16:12:46,822 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 36 interpolants. [2024-10-24 16:12:46,822 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=233, Invalid=2119, Unknown=0, NotChecked=0, Total=2352 [2024-10-24 16:12:46,823 INFO L87 Difference]: Start difference. First operand 144 states and 168 transitions. Second operand has 36 states, 35 states have (on average 1.7142857142857142) internal successors, (60), 36 states have internal predecessors, (60), 5 states have call successors, (8), 3 states have call predecessors, (8), 3 states have return successors, (7), 3 states have call predecessors, (7), 4 states have call successors, (7) [2024-10-24 16:12:49,014 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-24 16:12:49,014 INFO L93 Difference]: Finished difference Result 114 states and 125 transitions. [2024-10-24 16:12:49,014 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 28 states. [2024-10-24 16:12:49,014 INFO L78 Accepts]: Start accepts. Automaton has has 36 states, 35 states have (on average 1.7142857142857142) internal successors, (60), 36 states have internal predecessors, (60), 5 states have call successors, (8), 3 states have call predecessors, (8), 3 states have return successors, (7), 3 states have call predecessors, (7), 4 states have call successors, (7) Word has length 53 [2024-10-24 16:12:49,014 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-24 16:12:49,015 INFO L225 Difference]: With dead ends: 114 [2024-10-24 16:12:49,015 INFO L226 Difference]: Without dead ends: 114 [2024-10-24 16:12:49,016 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 126 GetRequests, 62 SyntacticMatches, 3 SemanticMatches, 61 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 850 ImplicationChecksByTransitivity, 3.8s TimeCoverageRelationStatistics Valid=455, Invalid=3451, Unknown=0, NotChecked=0, Total=3906 [2024-10-24 16:12:49,017 INFO L432 NwaCegarLoop]: 52 mSDtfsCounter, 41 mSDsluCounter, 944 mSDsCounter, 0 mSdLazyCounter, 886 mSolverCounterSat, 13 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 42 SdHoareTripleChecker+Valid, 996 SdHoareTripleChecker+Invalid, 899 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 13 IncrementalHoareTripleChecker+Valid, 886 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.2s IncrementalHoareTripleChecker+Time [2024-10-24 16:12:49,017 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [42 Valid, 996 Invalid, 899 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [13 Valid, 886 Invalid, 0 Unknown, 0 Unchecked, 1.2s Time] [2024-10-24 16:12:49,017 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 114 states. [2024-10-24 16:12:49,019 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 114 to 102. [2024-10-24 16:12:49,020 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 102 states, 75 states have (on average 1.16) internal successors, (87), 83 states have internal predecessors, (87), 12 states have call successors, (12), 7 states have call predecessors, (12), 7 states have return successors, (12), 11 states have call predecessors, (12), 12 states have call successors, (12) [2024-10-24 16:12:49,020 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 102 states to 102 states and 111 transitions. [2024-10-24 16:12:49,021 INFO L78 Accepts]: Start accepts. Automaton has 102 states and 111 transitions. Word has length 53 [2024-10-24 16:12:49,021 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-24 16:12:49,021 INFO L471 AbstractCegarLoop]: Abstraction has 102 states and 111 transitions. [2024-10-24 16:12:49,021 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 36 states, 35 states have (on average 1.7142857142857142) internal successors, (60), 36 states have internal predecessors, (60), 5 states have call successors, (8), 3 states have call predecessors, (8), 3 states have return successors, (7), 3 states have call predecessors, (7), 4 states have call successors, (7) [2024-10-24 16:12:49,021 INFO L276 IsEmpty]: Start isEmpty. Operand 102 states and 111 transitions. [2024-10-24 16:12:49,026 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 56 [2024-10-24 16:12:49,027 INFO L207 NwaCegarLoop]: Found error trace [2024-10-24 16:12:49,027 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-24 16:12:49,044 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (14)] Ended with exit code 0 [2024-10-24 16:12:49,227 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,SelfDestructingSolverStorable31 [2024-10-24 16:12:49,228 INFO L396 AbstractCegarLoop]: === Iteration 33 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONMEMORY_LEAK === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 34 more)] === [2024-10-24 16:12:49,228 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-24 16:12:49,228 INFO L85 PathProgramCache]: Analyzing trace with hash -1093975880, now seen corresponding path program 1 times [2024-10-24 16:12:49,228 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-24 16:12:49,228 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [648108509] [2024-10-24 16:12:49,228 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-24 16:12:49,228 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-24 16:12:49,242 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 16:12:49,399 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2024-10-24 16:12:49,400 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 16:12:49,401 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 7 [2024-10-24 16:12:49,402 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 16:12:49,404 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 12 [2024-10-24 16:12:49,405 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 16:12:49,406 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 17 [2024-10-24 16:12:49,407 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 16:12:49,408 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 44 [2024-10-24 16:12:49,409 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 16:12:49,410 INFO L134 CoverageAnalysis]: Checked inductivity of 42 backedges. 4 proven. 2 refuted. 0 times theorem prover too weak. 36 trivial. 0 not checked. [2024-10-24 16:12:49,410 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-24 16:12:49,410 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [648108509] [2024-10-24 16:12:49,411 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [648108509] provided 0 perfect and 1 imperfect interpolant sequences [2024-10-24 16:12:49,411 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1646069211] [2024-10-24 16:12:49,411 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-24 16:12:49,411 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-10-24 16:12:49,411 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-10-24 16:12:49,414 INFO L229 MonitoredProcess]: Starting monitored process 15 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-10-24 16:12:49,415 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (15)] Waiting until timeout for monitored process [2024-10-24 16:12:49,515 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 16:12:49,518 INFO L255 TraceCheckSpWp]: Trace formula consists of 242 conjuncts, 10 conjuncts are in the unsatisfiable core [2024-10-24 16:12:49,520 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-24 16:12:49,600 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 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 15 treesize of output 1 [2024-10-24 16:12:49,644 INFO L134 CoverageAnalysis]: Checked inductivity of 42 backedges. 12 proven. 0 refuted. 0 times theorem prover too weak. 30 trivial. 0 not checked. [2024-10-24 16:12:49,644 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-10-24 16:12:49,645 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1646069211] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-24 16:12:49,645 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2024-10-24 16:12:49,645 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [8] total 11 [2024-10-24 16:12:49,645 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1107957600] [2024-10-24 16:12:49,645 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-24 16:12:49,645 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2024-10-24 16:12:49,645 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-24 16:12:49,646 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2024-10-24 16:12:49,646 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=24, Invalid=86, Unknown=0, NotChecked=0, Total=110 [2024-10-24 16:12:49,646 INFO L87 Difference]: Start difference. First operand 102 states and 111 transitions. Second operand has 7 states, 7 states have (on average 4.428571428571429) internal successors, (31), 7 states have internal predecessors, (31), 3 states have call successors, (6), 3 states have call predecessors, (6), 2 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) [2024-10-24 16:12:53,655 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2024-10-24 16:12:57,662 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2024-10-24 16:13:01,679 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2024-10-24 16:13:05,686 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2024-10-24 16:13:05,772 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-24 16:13:05,772 INFO L93 Difference]: Finished difference Result 140 states and 147 transitions. [2024-10-24 16:13:05,772 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2024-10-24 16:13:05,772 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 4.428571428571429) internal successors, (31), 7 states have internal predecessors, (31), 3 states have call successors, (6), 3 states have call predecessors, (6), 2 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) Word has length 55 [2024-10-24 16:13:05,772 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-24 16:13:05,773 INFO L225 Difference]: With dead ends: 140 [2024-10-24 16:13:05,773 INFO L226 Difference]: Without dead ends: 140 [2024-10-24 16:13:05,773 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 73 GetRequests, 62 SyntacticMatches, 1 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 20 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=30, Invalid=102, Unknown=0, NotChecked=0, Total=132 [2024-10-24 16:13:05,774 INFO L432 NwaCegarLoop]: 88 mSDtfsCounter, 32 mSDsluCounter, 366 mSDsCounter, 0 mSdLazyCounter, 155 mSolverCounterSat, 3 mSolverCounterUnsat, 4 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 16.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 35 SdHoareTripleChecker+Valid, 454 SdHoareTripleChecker+Invalid, 162 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 155 IncrementalHoareTripleChecker+Invalid, 4 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 16.1s IncrementalHoareTripleChecker+Time [2024-10-24 16:13:05,774 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [35 Valid, 454 Invalid, 162 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 155 Invalid, 4 Unknown, 0 Unchecked, 16.1s Time] [2024-10-24 16:13:05,774 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 140 states. [2024-10-24 16:13:05,777 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 140 to 126. [2024-10-24 16:13:05,777 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 126 states, 93 states have (on average 1.1720430107526882) internal successors, (109), 102 states have internal predecessors, (109), 15 states have call successors, (15), 10 states have call predecessors, (15), 10 states have return successors, (15), 13 states have call predecessors, (15), 15 states have call successors, (15) [2024-10-24 16:13:05,778 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 126 states to 126 states and 139 transitions. [2024-10-24 16:13:05,778 INFO L78 Accepts]: Start accepts. Automaton has 126 states and 139 transitions. Word has length 55 [2024-10-24 16:13:05,778 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-24 16:13:05,778 INFO L471 AbstractCegarLoop]: Abstraction has 126 states and 139 transitions. [2024-10-24 16:13:05,778 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 4.428571428571429) internal successors, (31), 7 states have internal predecessors, (31), 3 states have call successors, (6), 3 states have call predecessors, (6), 2 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) [2024-10-24 16:13:05,779 INFO L276 IsEmpty]: Start isEmpty. Operand 126 states and 139 transitions. [2024-10-24 16:13:05,779 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 57 [2024-10-24 16:13:05,779 INFO L207 NwaCegarLoop]: Found error trace [2024-10-24 16:13:05,779 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-24 16:13:05,792 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (15)] Ended with exit code 0 [2024-10-24 16:13:05,980 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable32,15 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-10-24 16:13:05,980 INFO L396 AbstractCegarLoop]: === Iteration 34 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONMEMORY_LEAK === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 34 more)] === [2024-10-24 16:13:05,980 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-24 16:13:05,980 INFO L85 PathProgramCache]: Analyzing trace with hash 283675501, now seen corresponding path program 1 times [2024-10-24 16:13:05,980 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-24 16:13:05,980 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [473312277] [2024-10-24 16:13:05,981 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-24 16:13:05,981 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-24 16:13:05,993 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 16:13:06,163 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2024-10-24 16:13:06,164 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 16:13:06,165 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 7 [2024-10-24 16:13:06,165 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 16:13:06,166 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 12 [2024-10-24 16:13:06,166 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 16:13:06,167 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 17 [2024-10-24 16:13:06,168 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 16:13:06,169 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 44 [2024-10-24 16:13:06,170 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 16:13:06,171 INFO L134 CoverageAnalysis]: Checked inductivity of 42 backedges. 2 proven. 9 refuted. 0 times theorem prover too weak. 31 trivial. 0 not checked. [2024-10-24 16:13:06,172 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-24 16:13:06,172 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [473312277] [2024-10-24 16:13:06,172 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [473312277] provided 0 perfect and 1 imperfect interpolant sequences [2024-10-24 16:13:06,172 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [566590453] [2024-10-24 16:13:06,172 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-24 16:13:06,172 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-10-24 16:13:06,173 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-10-24 16:13:06,174 INFO L229 MonitoredProcess]: Starting monitored process 16 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-10-24 16:13:06,176 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (16)] Waiting until timeout for monitored process [2024-10-24 16:13:06,273 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 16:13:06,278 INFO L255 TraceCheckSpWp]: Trace formula consists of 247 conjuncts, 15 conjuncts are in the unsatisfiable core [2024-10-24 16:13:06,280 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-24 16:13:06,432 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 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 15 treesize of output 1 [2024-10-24 16:13:06,470 INFO L134 CoverageAnalysis]: Checked inductivity of 42 backedges. 3 proven. 15 refuted. 0 times theorem prover too weak. 24 trivial. 0 not checked. [2024-10-24 16:13:06,471 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-10-24 16:13:06,514 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 28 treesize of output 24 [2024-10-24 16:13:06,702 INFO L134 CoverageAnalysis]: Checked inductivity of 42 backedges. 8 proven. 10 refuted. 0 times theorem prover too weak. 24 trivial. 0 not checked. [2024-10-24 16:13:06,702 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [566590453] provided 0 perfect and 2 imperfect interpolant sequences [2024-10-24 16:13:06,702 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2024-10-24 16:13:06,703 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [9, 11, 11] total 19 [2024-10-24 16:13:06,703 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [528776051] [2024-10-24 16:13:06,703 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2024-10-24 16:13:06,703 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 19 states [2024-10-24 16:13:06,703 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-24 16:13:06,704 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 19 interpolants. [2024-10-24 16:13:06,704 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=60, Invalid=282, Unknown=0, NotChecked=0, Total=342 [2024-10-24 16:13:06,704 INFO L87 Difference]: Start difference. First operand 126 states and 139 transitions. Second operand has 19 states, 18 states have (on average 3.7777777777777777) internal successors, (68), 17 states have internal predecessors, (68), 4 states have call successors, (8), 3 states have call predecessors, (8), 1 states have return successors, (6), 3 states have call predecessors, (6), 3 states have call successors, (6) [2024-10-24 16:13:06,937 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-24 16:13:06,937 INFO L93 Difference]: Finished difference Result 137 states and 150 transitions. [2024-10-24 16:13:06,937 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2024-10-24 16:13:06,937 INFO L78 Accepts]: Start accepts. Automaton has has 19 states, 18 states have (on average 3.7777777777777777) internal successors, (68), 17 states have internal predecessors, (68), 4 states have call successors, (8), 3 states have call predecessors, (8), 1 states have return successors, (6), 3 states have call predecessors, (6), 3 states have call successors, (6) Word has length 56 [2024-10-24 16:13:06,937 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-24 16:13:06,938 INFO L225 Difference]: With dead ends: 137 [2024-10-24 16:13:06,938 INFO L226 Difference]: Without dead ends: 137 [2024-10-24 16:13:06,938 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 137 GetRequests, 110 SyntacticMatches, 2 SemanticMatches, 25 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 107 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=141, Invalid=561, Unknown=0, NotChecked=0, Total=702 [2024-10-24 16:13:06,939 INFO L432 NwaCegarLoop]: 61 mSDtfsCounter, 31 mSDsluCounter, 474 mSDsCounter, 0 mSdLazyCounter, 275 mSolverCounterSat, 6 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 33 SdHoareTripleChecker+Valid, 535 SdHoareTripleChecker+Invalid, 281 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 6 IncrementalHoareTripleChecker+Valid, 275 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-10-24 16:13:06,939 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [33 Valid, 535 Invalid, 281 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [6 Valid, 275 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-10-24 16:13:06,939 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 137 states. [2024-10-24 16:13:06,942 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 137 to 130. [2024-10-24 16:13:06,943 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 130 states, 96 states have (on average 1.1666666666666667) internal successors, (112), 105 states have internal predecessors, (112), 15 states have call successors, (15), 11 states have call predecessors, (15), 11 states have return successors, (15), 13 states have call predecessors, (15), 15 states have call successors, (15) [2024-10-24 16:13:06,943 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 130 states to 130 states and 142 transitions. [2024-10-24 16:13:06,943 INFO L78 Accepts]: Start accepts. Automaton has 130 states and 142 transitions. Word has length 56 [2024-10-24 16:13:06,944 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-24 16:13:06,944 INFO L471 AbstractCegarLoop]: Abstraction has 130 states and 142 transitions. [2024-10-24 16:13:06,944 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 19 states, 18 states have (on average 3.7777777777777777) internal successors, (68), 17 states have internal predecessors, (68), 4 states have call successors, (8), 3 states have call predecessors, (8), 1 states have return successors, (6), 3 states have call predecessors, (6), 3 states have call successors, (6) [2024-10-24 16:13:06,944 INFO L276 IsEmpty]: Start isEmpty. Operand 130 states and 142 transitions. [2024-10-24 16:13:06,945 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 63 [2024-10-24 16:13:06,945 INFO L207 NwaCegarLoop]: Found error trace [2024-10-24 16:13:06,945 INFO L215 NwaCegarLoop]: trace histogram [4, 4, 4, 4, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-24 16:13:06,962 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (16)] Ended with exit code 0 [2024-10-24 16:13:07,149 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable33,16 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-10-24 16:13:07,150 INFO L396 AbstractCegarLoop]: === Iteration 35 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONMEMORY_LEAK === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 34 more)] === [2024-10-24 16:13:07,150 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-24 16:13:07,150 INFO L85 PathProgramCache]: Analyzing trace with hash 630198633, now seen corresponding path program 1 times [2024-10-24 16:13:07,150 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-24 16:13:07,150 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [353847595] [2024-10-24 16:13:07,150 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-24 16:13:07,150 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-24 16:13:07,161 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 16:13:07,381 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2024-10-24 16:13:07,382 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 16:13:07,383 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 7 [2024-10-24 16:13:07,384 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 16:13:07,387 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 12 [2024-10-24 16:13:07,388 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 16:13:07,389 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 17 [2024-10-24 16:13:07,390 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 16:13:07,391 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 33 [2024-10-24 16:13:07,391 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 16:13:07,396 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 41 [2024-10-24 16:13:07,397 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 16:13:07,398 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 50 [2024-10-24 16:13:07,399 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 16:13:07,402 INFO L134 CoverageAnalysis]: Checked inductivity of 42 backedges. 6 proven. 0 refuted. 0 times theorem prover too weak. 36 trivial. 0 not checked. [2024-10-24 16:13:07,402 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-24 16:13:07,402 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [353847595] [2024-10-24 16:13:07,402 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [353847595] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-24 16:13:07,403 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-24 16:13:07,403 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2024-10-24 16:13:07,403 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [921248626] [2024-10-24 16:13:07,403 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-24 16:13:07,404 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2024-10-24 16:13:07,404 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-24 16:13:07,404 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2024-10-24 16:13:07,404 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=18, Invalid=72, Unknown=0, NotChecked=0, Total=90 [2024-10-24 16:13:07,405 INFO L87 Difference]: Start difference. First operand 130 states and 142 transitions. Second operand has 10 states, 9 states have (on average 3.5555555555555554) internal successors, (32), 9 states have internal predecessors, (32), 3 states have call successors, (8), 2 states have call predecessors, (8), 1 states have return successors, (7), 2 states have call predecessors, (7), 2 states have call successors, (7) [2024-10-24 16:13:07,567 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-24 16:13:07,568 INFO L93 Difference]: Finished difference Result 134 states and 145 transitions. [2024-10-24 16:13:07,568 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2024-10-24 16:13:07,568 INFO L78 Accepts]: Start accepts. Automaton has has 10 states, 9 states have (on average 3.5555555555555554) internal successors, (32), 9 states have internal predecessors, (32), 3 states have call successors, (8), 2 states have call predecessors, (8), 1 states have return successors, (7), 2 states have call predecessors, (7), 2 states have call successors, (7) Word has length 62 [2024-10-24 16:13:07,568 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-24 16:13:07,569 INFO L225 Difference]: With dead ends: 134 [2024-10-24 16:13:07,569 INFO L226 Difference]: Without dead ends: 134 [2024-10-24 16:13:07,569 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 27 GetRequests, 16 SyntacticMatches, 0 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 11 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=32, Invalid=124, Unknown=0, NotChecked=0, Total=156 [2024-10-24 16:13:07,569 INFO L432 NwaCegarLoop]: 50 mSDtfsCounter, 8 mSDsluCounter, 356 mSDsCounter, 0 mSdLazyCounter, 234 mSolverCounterSat, 4 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 8 SdHoareTripleChecker+Valid, 406 SdHoareTripleChecker+Invalid, 238 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 4 IncrementalHoareTripleChecker+Valid, 234 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-10-24 16:13:07,570 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [8 Valid, 406 Invalid, 238 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [4 Valid, 234 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-10-24 16:13:07,570 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 134 states. [2024-10-24 16:13:07,572 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 134 to 134. [2024-10-24 16:13:07,573 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 134 states, 99 states have (on average 1.1616161616161615) internal successors, (115), 108 states have internal predecessors, (115), 15 states have call successors, (15), 12 states have call predecessors, (15), 12 states have return successors, (15), 13 states have call predecessors, (15), 15 states have call successors, (15) [2024-10-24 16:13:07,573 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 134 states to 134 states and 145 transitions. [2024-10-24 16:13:07,573 INFO L78 Accepts]: Start accepts. Automaton has 134 states and 145 transitions. Word has length 62 [2024-10-24 16:13:07,573 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-24 16:13:07,573 INFO L471 AbstractCegarLoop]: Abstraction has 134 states and 145 transitions. [2024-10-24 16:13:07,573 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 9 states have (on average 3.5555555555555554) internal successors, (32), 9 states have internal predecessors, (32), 3 states have call successors, (8), 2 states have call predecessors, (8), 1 states have return successors, (7), 2 states have call predecessors, (7), 2 states have call successors, (7) [2024-10-24 16:13:07,574 INFO L276 IsEmpty]: Start isEmpty. Operand 134 states and 145 transitions. [2024-10-24 16:13:07,574 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 65 [2024-10-24 16:13:07,574 INFO L207 NwaCegarLoop]: Found error trace [2024-10-24 16:13:07,574 INFO L215 NwaCegarLoop]: trace histogram [4, 4, 4, 3, 3, 3, 3, 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-24 16:13:07,574 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable34 [2024-10-24 16:13:07,574 INFO L396 AbstractCegarLoop]: === Iteration 36 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONMEMORY_LEAK === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 34 more)] === [2024-10-24 16:13:07,575 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-24 16:13:07,575 INFO L85 PathProgramCache]: Analyzing trace with hash -1673127062, now seen corresponding path program 1 times [2024-10-24 16:13:07,575 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-24 16:13:07,575 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [413898806] [2024-10-24 16:13:07,575 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-24 16:13:07,575 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-24 16:13:07,587 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 16:13:07,713 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2024-10-24 16:13:07,714 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 16:13:07,715 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 7 [2024-10-24 16:13:07,715 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 16:13:07,716 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 12 [2024-10-24 16:13:07,717 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 16:13:07,717 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 17 [2024-10-24 16:13:07,718 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 16:13:07,718 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 44 [2024-10-24 16:13:07,719 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 16:13:07,720 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 52 [2024-10-24 16:13:07,721 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 16:13:07,722 INFO L134 CoverageAnalysis]: Checked inductivity of 48 backedges. 4 proven. 10 refuted. 0 times theorem prover too weak. 34 trivial. 0 not checked. [2024-10-24 16:13:07,722 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-24 16:13:07,722 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [413898806] [2024-10-24 16:13:07,722 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [413898806] provided 0 perfect and 1 imperfect interpolant sequences [2024-10-24 16:13:07,723 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [917202440] [2024-10-24 16:13:07,723 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-24 16:13:07,723 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-10-24 16:13:07,723 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-10-24 16:13:07,725 INFO L229 MonitoredProcess]: Starting monitored process 17 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-10-24 16:13:07,726 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (17)] Waiting until timeout for monitored process [2024-10-24 16:13:07,830 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 16:13:07,832 INFO L255 TraceCheckSpWp]: Trace formula consists of 263 conjuncts, 12 conjuncts are in the unsatisfiable core [2024-10-24 16:13:07,834 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-24 16:13:07,920 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 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 15 treesize of output 1 [2024-10-24 16:13:07,990 INFO L134 CoverageAnalysis]: Checked inductivity of 48 backedges. 5 proven. 9 refuted. 0 times theorem prover too weak. 34 trivial. 0 not checked. [2024-10-24 16:13:07,990 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-10-24 16:13:08,024 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 32 treesize of output 28 [2024-10-24 16:13:08,185 INFO L134 CoverageAnalysis]: Checked inductivity of 48 backedges. 5 proven. 9 refuted. 0 times theorem prover too weak. 34 trivial. 0 not checked. [2024-10-24 16:13:08,185 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [917202440] provided 0 perfect and 2 imperfect interpolant sequences [2024-10-24 16:13:08,185 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2024-10-24 16:13:08,185 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 8, 7] total 13 [2024-10-24 16:13:08,185 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1481231036] [2024-10-24 16:13:08,186 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2024-10-24 16:13:08,186 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 13 states [2024-10-24 16:13:08,186 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-24 16:13:08,187 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2024-10-24 16:13:08,187 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=35, Invalid=121, Unknown=0, NotChecked=0, Total=156 [2024-10-24 16:13:08,187 INFO L87 Difference]: Start difference. First operand 134 states and 145 transitions. Second operand has 13 states, 13 states have (on average 5.153846153846154) internal successors, (67), 13 states have internal predecessors, (67), 4 states have call successors, (11), 3 states have call predecessors, (11), 2 states have return successors, (10), 3 states have call predecessors, (10), 3 states have call successors, (10) [2024-10-24 16:13:12,199 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2024-10-24 16:13:16,207 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2024-10-24 16:13:20,238 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2024-10-24 16:13:24,246 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2024-10-24 16:13:28,299 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2024-10-24 16:13:28,422 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-24 16:13:28,423 INFO L93 Difference]: Finished difference Result 147 states and 150 transitions. [2024-10-24 16:13:28,423 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2024-10-24 16:13:28,423 INFO L78 Accepts]: Start accepts. Automaton has has 13 states, 13 states have (on average 5.153846153846154) internal successors, (67), 13 states have internal predecessors, (67), 4 states have call successors, (11), 3 states have call predecessors, (11), 2 states have return successors, (10), 3 states have call predecessors, (10), 3 states have call successors, (10) Word has length 64 [2024-10-24 16:13:28,423 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-24 16:13:28,424 INFO L225 Difference]: With dead ends: 147 [2024-10-24 16:13:28,424 INFO L226 Difference]: Without dead ends: 147 [2024-10-24 16:13:28,424 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 149 GetRequests, 131 SyntacticMatches, 3 SemanticMatches, 15 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 21 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=61, Invalid=211, Unknown=0, NotChecked=0, Total=272 [2024-10-24 16:13:28,424 INFO L432 NwaCegarLoop]: 81 mSDtfsCounter, 57 mSDsluCounter, 595 mSDsCounter, 0 mSdLazyCounter, 342 mSolverCounterSat, 3 mSolverCounterUnsat, 5 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 20.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 61 SdHoareTripleChecker+Valid, 676 SdHoareTripleChecker+Invalid, 350 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 342 IncrementalHoareTripleChecker+Invalid, 5 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 20.2s IncrementalHoareTripleChecker+Time [2024-10-24 16:13:28,424 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [61 Valid, 676 Invalid, 350 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 342 Invalid, 5 Unknown, 0 Unchecked, 20.2s Time] [2024-10-24 16:13:28,425 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 147 states. [2024-10-24 16:13:28,427 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 147 to 133. [2024-10-24 16:13:28,427 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 133 states, 99 states have (on average 1.1515151515151516) internal successors, (114), 107 states have internal predecessors, (114), 14 states have call successors, (14), 12 states have call predecessors, (14), 12 states have return successors, (14), 13 states have call predecessors, (14), 14 states have call successors, (14) [2024-10-24 16:13:28,428 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 133 states to 133 states and 142 transitions. [2024-10-24 16:13:28,428 INFO L78 Accepts]: Start accepts. Automaton has 133 states and 142 transitions. Word has length 64 [2024-10-24 16:13:28,428 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-24 16:13:28,428 INFO L471 AbstractCegarLoop]: Abstraction has 133 states and 142 transitions. [2024-10-24 16:13:28,428 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 13 states, 13 states have (on average 5.153846153846154) internal successors, (67), 13 states have internal predecessors, (67), 4 states have call successors, (11), 3 states have call predecessors, (11), 2 states have return successors, (10), 3 states have call predecessors, (10), 3 states have call successors, (10) [2024-10-24 16:13:28,429 INFO L276 IsEmpty]: Start isEmpty. Operand 133 states and 142 transitions. [2024-10-24 16:13:28,429 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 67 [2024-10-24 16:13:28,429 INFO L207 NwaCegarLoop]: Found error trace [2024-10-24 16:13:28,429 INFO L215 NwaCegarLoop]: trace histogram [4, 4, 4, 4, 4, 4, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-24 16:13:28,444 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (17)] Ended with exit code 0 [2024-10-24 16:13:28,633 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,SelfDestructingSolverStorable35 [2024-10-24 16:13:28,634 INFO L396 AbstractCegarLoop]: === Iteration 37 === Targeting ULTIMATE.startErr26REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 34 more)] === [2024-10-24 16:13:28,634 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-24 16:13:28,634 INFO L85 PathProgramCache]: Analyzing trace with hash -573332262, now seen corresponding path program 1 times [2024-10-24 16:13:28,634 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-24 16:13:28,634 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [554318891] [2024-10-24 16:13:28,634 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-24 16:13:28,634 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-24 16:13:28,644 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 16:13:28,698 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2024-10-24 16:13:28,698 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 16:13:28,700 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 7 [2024-10-24 16:13:28,704 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 16:13:28,705 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 12 [2024-10-24 16:13:28,705 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 16:13:28,706 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 17 [2024-10-24 16:13:28,706 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 16:13:28,707 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 33 [2024-10-24 16:13:28,707 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 16:13:28,712 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 41 [2024-10-24 16:13:28,713 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 16:13:28,714 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 50 [2024-10-24 16:13:28,715 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 16:13:28,716 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 58 [2024-10-24 16:13:28,718 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 16:13:28,719 INFO L134 CoverageAnalysis]: Checked inductivity of 48 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 48 trivial. 0 not checked. [2024-10-24 16:13:28,719 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-24 16:13:28,720 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [554318891] [2024-10-24 16:13:28,720 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [554318891] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-24 16:13:28,720 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-24 16:13:28,720 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2024-10-24 16:13:28,720 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [468186184] [2024-10-24 16:13:28,720 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-24 16:13:28,721 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2024-10-24 16:13:28,721 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-24 16:13:28,721 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2024-10-24 16:13:28,722 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2024-10-24 16:13:28,722 INFO L87 Difference]: Start difference. First operand 133 states and 142 transitions. Second operand has 5 states, 4 states have (on average 8.0) internal successors, (32), 5 states have internal predecessors, (32), 2 states have call successors, (8), 1 states have call predecessors, (8), 1 states have return successors, (8), 2 states have call predecessors, (8), 2 states have call successors, (8) [2024-10-24 16:13:28,795 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-24 16:13:28,795 INFO L93 Difference]: Finished difference Result 130 states and 137 transitions. [2024-10-24 16:13:28,795 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-10-24 16:13:28,795 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 4 states have (on average 8.0) internal successors, (32), 5 states have internal predecessors, (32), 2 states have call successors, (8), 1 states have call predecessors, (8), 1 states have return successors, (8), 2 states have call predecessors, (8), 2 states have call successors, (8) Word has length 66 [2024-10-24 16:13:28,796 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-24 16:13:28,796 INFO L225 Difference]: With dead ends: 130 [2024-10-24 16:13:28,797 INFO L226 Difference]: Without dead ends: 130 [2024-10-24 16:13:28,797 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 20 GetRequests, 17 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2024-10-24 16:13:28,797 INFO L432 NwaCegarLoop]: 41 mSDtfsCounter, 29 mSDsluCounter, 28 mSDsCounter, 0 mSdLazyCounter, 74 mSolverCounterSat, 5 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 33 SdHoareTripleChecker+Valid, 69 SdHoareTripleChecker+Invalid, 79 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 5 IncrementalHoareTripleChecker+Valid, 74 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-10-24 16:13:28,798 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [33 Valid, 69 Invalid, 79 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [5 Valid, 74 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-10-24 16:13:28,798 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 130 states. [2024-10-24 16:13:28,800 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 130 to 130. [2024-10-24 16:13:28,801 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 130 states, 99 states have (on average 1.101010101010101) internal successors, (109), 104 states have internal predecessors, (109), 14 states have call successors, (14), 12 states have call predecessors, (14), 12 states have return successors, (14), 13 states have call predecessors, (14), 14 states have call successors, (14) [2024-10-24 16:13:28,802 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 130 states to 130 states and 137 transitions. [2024-10-24 16:13:28,802 INFO L78 Accepts]: Start accepts. Automaton has 130 states and 137 transitions. Word has length 66 [2024-10-24 16:13:28,802 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-24 16:13:28,802 INFO L471 AbstractCegarLoop]: Abstraction has 130 states and 137 transitions. [2024-10-24 16:13:28,802 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 4 states have (on average 8.0) internal successors, (32), 5 states have internal predecessors, (32), 2 states have call successors, (8), 1 states have call predecessors, (8), 1 states have return successors, (8), 2 states have call predecessors, (8), 2 states have call successors, (8) [2024-10-24 16:13:28,802 INFO L276 IsEmpty]: Start isEmpty. Operand 130 states and 137 transitions. [2024-10-24 16:13:28,803 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 67 [2024-10-24 16:13:28,804 INFO L207 NwaCegarLoop]: Found error trace [2024-10-24 16:13:28,804 INFO L215 NwaCegarLoop]: trace histogram [4, 4, 4, 4, 4, 4, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-24 16:13:28,805 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable36 [2024-10-24 16:13:28,805 INFO L396 AbstractCegarLoop]: === Iteration 38 === Targeting ULTIMATE.startErr27REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 34 more)] === [2024-10-24 16:13:28,805 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-24 16:13:28,805 INFO L85 PathProgramCache]: Analyzing trace with hash -573332261, now seen corresponding path program 1 times [2024-10-24 16:13:28,805 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-24 16:13:28,805 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1387807291] [2024-10-24 16:13:28,806 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-24 16:13:28,806 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-24 16:13:28,826 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 16:13:29,041 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2024-10-24 16:13:29,041 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 16:13:29,042 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 7 [2024-10-24 16:13:29,043 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 16:13:29,044 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 12 [2024-10-24 16:13:29,045 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 16:13:29,047 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 17 [2024-10-24 16:13:29,048 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 16:13:29,049 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 33 [2024-10-24 16:13:29,050 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 16:13:29,052 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 41 [2024-10-24 16:13:29,052 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 16:13:29,054 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 50 [2024-10-24 16:13:29,055 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 16:13:29,057 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 58 [2024-10-24 16:13:29,058 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 16:13:29,060 INFO L134 CoverageAnalysis]: Checked inductivity of 48 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 48 trivial. 0 not checked. [2024-10-24 16:13:29,060 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-24 16:13:29,060 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1387807291] [2024-10-24 16:13:29,060 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1387807291] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-24 16:13:29,060 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-24 16:13:29,061 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2024-10-24 16:13:29,061 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1946263201] [2024-10-24 16:13:29,061 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-24 16:13:29,061 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2024-10-24 16:13:29,061 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-24 16:13:29,062 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2024-10-24 16:13:29,062 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=43, Unknown=0, NotChecked=0, Total=56 [2024-10-24 16:13:29,062 INFO L87 Difference]: Start difference. First operand 130 states and 137 transitions. Second operand has 8 states, 7 states have (on average 4.571428571428571) internal successors, (32), 8 states have internal predecessors, (32), 3 states have call successors, (8), 1 states have call predecessors, (8), 1 states have return successors, (8), 3 states have call predecessors, (8), 3 states have call successors, (8) [2024-10-24 16:13:29,283 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-24 16:13:29,284 INFO L93 Difference]: Finished difference Result 130 states and 136 transitions. [2024-10-24 16:13:29,284 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2024-10-24 16:13:29,284 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 7 states have (on average 4.571428571428571) internal successors, (32), 8 states have internal predecessors, (32), 3 states have call successors, (8), 1 states have call predecessors, (8), 1 states have return successors, (8), 3 states have call predecessors, (8), 3 states have call successors, (8) Word has length 66 [2024-10-24 16:13:29,284 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-24 16:13:29,285 INFO L225 Difference]: With dead ends: 130 [2024-10-24 16:13:29,285 INFO L226 Difference]: Without dead ends: 130 [2024-10-24 16:13:29,285 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 26 GetRequests, 17 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=28, Invalid=82, Unknown=0, NotChecked=0, Total=110 [2024-10-24 16:13:29,287 INFO L432 NwaCegarLoop]: 44 mSDtfsCounter, 13 mSDsluCounter, 158 mSDsCounter, 0 mSdLazyCounter, 253 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 13 SdHoareTripleChecker+Valid, 202 SdHoareTripleChecker+Invalid, 254 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 253 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2024-10-24 16:13:29,287 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [13 Valid, 202 Invalid, 254 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 253 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2024-10-24 16:13:29,288 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 130 states. [2024-10-24 16:13:29,291 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 130 to 130. [2024-10-24 16:13:29,295 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 130 states, 99 states have (on average 1.0909090909090908) internal successors, (108), 104 states have internal predecessors, (108), 14 states have call successors, (14), 12 states have call predecessors, (14), 12 states have return successors, (14), 13 states have call predecessors, (14), 14 states have call successors, (14) [2024-10-24 16:13:29,296 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 130 states to 130 states and 136 transitions. [2024-10-24 16:13:29,296 INFO L78 Accepts]: Start accepts. Automaton has 130 states and 136 transitions. Word has length 66 [2024-10-24 16:13:29,296 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-24 16:13:29,296 INFO L471 AbstractCegarLoop]: Abstraction has 130 states and 136 transitions. [2024-10-24 16:13:29,296 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 7 states have (on average 4.571428571428571) internal successors, (32), 8 states have internal predecessors, (32), 3 states have call successors, (8), 1 states have call predecessors, (8), 1 states have return successors, (8), 3 states have call predecessors, (8), 3 states have call successors, (8) [2024-10-24 16:13:29,296 INFO L276 IsEmpty]: Start isEmpty. Operand 130 states and 136 transitions. [2024-10-24 16:13:29,297 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 69 [2024-10-24 16:13:29,297 INFO L207 NwaCegarLoop]: Found error trace [2024-10-24 16:13:29,297 INFO L215 NwaCegarLoop]: trace histogram [4, 4, 4, 4, 4, 4, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-24 16:13:29,297 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable37 [2024-10-24 16:13:29,298 INFO L396 AbstractCegarLoop]: === Iteration 39 === Targeting ULTIMATE.startErr31REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 34 more)] === [2024-10-24 16:13:29,298 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-24 16:13:29,298 INFO L85 PathProgramCache]: Analyzing trace with hash -1216487010, now seen corresponding path program 1 times [2024-10-24 16:13:29,298 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-24 16:13:29,298 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [526009031] [2024-10-24 16:13:29,298 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-24 16:13:29,298 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-24 16:13:29,324 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 16:13:29,624 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2024-10-24 16:13:29,625 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 16:13:29,626 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 7 [2024-10-24 16:13:29,627 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 16:13:29,629 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 12 [2024-10-24 16:13:29,630 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 16:13:29,631 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 17 [2024-10-24 16:13:29,632 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 16:13:29,633 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 33 [2024-10-24 16:13:29,633 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 16:13:29,634 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 41 [2024-10-24 16:13:29,635 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 16:13:29,636 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 50 [2024-10-24 16:13:29,637 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 16:13:29,638 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 58 [2024-10-24 16:13:29,639 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 16:13:29,641 INFO L134 CoverageAnalysis]: Checked inductivity of 48 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 48 trivial. 0 not checked. [2024-10-24 16:13:29,641 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-24 16:13:29,641 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [526009031] [2024-10-24 16:13:29,641 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [526009031] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-24 16:13:29,641 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-24 16:13:29,641 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2024-10-24 16:13:29,641 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1022222217] [2024-10-24 16:13:29,642 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-24 16:13:29,642 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2024-10-24 16:13:29,643 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-24 16:13:29,643 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2024-10-24 16:13:29,643 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=16, Invalid=56, Unknown=0, NotChecked=0, Total=72 [2024-10-24 16:13:29,643 INFO L87 Difference]: Start difference. First operand 130 states and 136 transitions. Second operand has 9 states, 8 states have (on average 4.25) internal successors, (34), 9 states have internal predecessors, (34), 3 states have call successors, (8), 1 states have call predecessors, (8), 1 states have return successors, (8), 3 states have call predecessors, (8), 3 states have call successors, (8) [2024-10-24 16:13:29,855 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-24 16:13:29,855 INFO L93 Difference]: Finished difference Result 130 states and 135 transitions. [2024-10-24 16:13:29,856 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2024-10-24 16:13:29,856 INFO L78 Accepts]: Start accepts. Automaton has has 9 states, 8 states have (on average 4.25) internal successors, (34), 9 states have internal predecessors, (34), 3 states have call successors, (8), 1 states have call predecessors, (8), 1 states have return successors, (8), 3 states have call predecessors, (8), 3 states have call successors, (8) Word has length 68 [2024-10-24 16:13:29,856 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-24 16:13:29,857 INFO L225 Difference]: With dead ends: 130 [2024-10-24 16:13:29,857 INFO L226 Difference]: Without dead ends: 130 [2024-10-24 16:13:29,857 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 26 GetRequests, 17 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=27, Invalid=83, Unknown=0, NotChecked=0, Total=110 [2024-10-24 16:13:29,857 INFO L432 NwaCegarLoop]: 42 mSDtfsCounter, 9 mSDsluCounter, 181 mSDsCounter, 0 mSdLazyCounter, 287 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 9 SdHoareTripleChecker+Valid, 223 SdHoareTripleChecker+Invalid, 288 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 287 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2024-10-24 16:13:29,858 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [9 Valid, 223 Invalid, 288 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 287 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2024-10-24 16:13:29,858 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 130 states. [2024-10-24 16:13:29,863 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 130 to 130. [2024-10-24 16:13:29,863 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 130 states, 99 states have (on average 1.0808080808080809) internal successors, (107), 104 states have internal predecessors, (107), 14 states have call successors, (14), 12 states have call predecessors, (14), 12 states have return successors, (14), 13 states have call predecessors, (14), 14 states have call successors, (14) [2024-10-24 16:13:29,864 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 130 states to 130 states and 135 transitions. [2024-10-24 16:13:29,864 INFO L78 Accepts]: Start accepts. Automaton has 130 states and 135 transitions. Word has length 68 [2024-10-24 16:13:29,864 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-24 16:13:29,864 INFO L471 AbstractCegarLoop]: Abstraction has 130 states and 135 transitions. [2024-10-24 16:13:29,864 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 8 states have (on average 4.25) internal successors, (34), 9 states have internal predecessors, (34), 3 states have call successors, (8), 1 states have call predecessors, (8), 1 states have return successors, (8), 3 states have call predecessors, (8), 3 states have call successors, (8) [2024-10-24 16:13:29,864 INFO L276 IsEmpty]: Start isEmpty. Operand 130 states and 135 transitions. [2024-10-24 16:13:29,865 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 73 [2024-10-24 16:13:29,865 INFO L207 NwaCegarLoop]: Found error trace [2024-10-24 16:13:29,865 INFO L215 NwaCegarLoop]: trace histogram [5, 4, 4, 4, 4, 4, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-24 16:13:29,866 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable38 [2024-10-24 16:13:29,866 INFO L396 AbstractCegarLoop]: === Iteration 40 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONMEMORY_LEAK === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 34 more)] === [2024-10-24 16:13:29,867 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-24 16:13:29,867 INFO L85 PathProgramCache]: Analyzing trace with hash 478757089, now seen corresponding path program 1 times [2024-10-24 16:13:29,867 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-24 16:13:29,867 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2122283933] [2024-10-24 16:13:29,867 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-24 16:13:29,867 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-24 16:13:29,881 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 16:13:30,447 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2024-10-24 16:13:30,447 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 16:13:30,448 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 7 [2024-10-24 16:13:30,449 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 16:13:30,449 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 12 [2024-10-24 16:13:30,450 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 16:13:30,451 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 17 [2024-10-24 16:13:30,451 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 16:13:30,453 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 33 [2024-10-24 16:13:30,453 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 16:13:30,455 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 41 [2024-10-24 16:13:30,455 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 16:13:30,457 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 50 [2024-10-24 16:13:30,458 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 16:13:30,459 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 58 [2024-10-24 16:13:30,460 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 16:13:30,462 INFO L134 CoverageAnalysis]: Checked inductivity of 56 backedges. 8 proven. 0 refuted. 0 times theorem prover too weak. 48 trivial. 0 not checked. [2024-10-24 16:13:30,462 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-24 16:13:30,462 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2122283933] [2024-10-24 16:13:30,462 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2122283933] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-24 16:13:30,463 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-24 16:13:30,463 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [15] imperfect sequences [] total 15 [2024-10-24 16:13:30,463 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [996658100] [2024-10-24 16:13:30,463 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-24 16:13:30,463 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 15 states [2024-10-24 16:13:30,463 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-24 16:13:30,464 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 15 interpolants. [2024-10-24 16:13:30,464 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=28, Invalid=182, Unknown=0, NotChecked=0, Total=210 [2024-10-24 16:13:30,464 INFO L87 Difference]: Start difference. First operand 130 states and 135 transitions. Second operand has 15 states, 14 states have (on average 2.642857142857143) internal successors, (37), 14 states have internal predecessors, (37), 4 states have call successors, (9), 2 states have call predecessors, (9), 1 states have return successors, (8), 3 states have call predecessors, (8), 3 states have call successors, (8) [2024-10-24 16:13:30,861 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-24 16:13:30,862 INFO L93 Difference]: Finished difference Result 131 states and 135 transitions. [2024-10-24 16:13:30,862 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2024-10-24 16:13:30,862 INFO L78 Accepts]: Start accepts. Automaton has has 15 states, 14 states have (on average 2.642857142857143) internal successors, (37), 14 states have internal predecessors, (37), 4 states have call successors, (9), 2 states have call predecessors, (9), 1 states have return successors, (8), 3 states have call predecessors, (8), 3 states have call successors, (8) Word has length 72 [2024-10-24 16:13:30,863 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-24 16:13:30,863 INFO L225 Difference]: With dead ends: 131 [2024-10-24 16:13:30,863 INFO L226 Difference]: Without dead ends: 131 [2024-10-24 16:13:30,864 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 34 GetRequests, 18 SyntacticMatches, 0 SemanticMatches, 16 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 14 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=41, Invalid=265, Unknown=0, NotChecked=0, Total=306 [2024-10-24 16:13:30,864 INFO L432 NwaCegarLoop]: 43 mSDtfsCounter, 8 mSDsluCounter, 353 mSDsCounter, 0 mSdLazyCounter, 481 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 9 SdHoareTripleChecker+Valid, 396 SdHoareTripleChecker+Invalid, 481 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 481 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2024-10-24 16:13:30,864 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [9 Valid, 396 Invalid, 481 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 481 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2024-10-24 16:13:30,865 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 131 states. [2024-10-24 16:13:30,866 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 131 to 130. [2024-10-24 16:13:30,867 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 130 states, 99 states have (on average 1.0707070707070707) internal successors, (106), 104 states have internal predecessors, (106), 14 states have call successors, (14), 12 states have call predecessors, (14), 12 states have return successors, (14), 13 states have call predecessors, (14), 14 states have call successors, (14) [2024-10-24 16:13:30,867 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 130 states to 130 states and 134 transitions. [2024-10-24 16:13:30,867 INFO L78 Accepts]: Start accepts. Automaton has 130 states and 134 transitions. Word has length 72 [2024-10-24 16:13:30,868 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-24 16:13:30,868 INFO L471 AbstractCegarLoop]: Abstraction has 130 states and 134 transitions. [2024-10-24 16:13:30,868 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 15 states, 14 states have (on average 2.642857142857143) internal successors, (37), 14 states have internal predecessors, (37), 4 states have call successors, (9), 2 states have call predecessors, (9), 1 states have return successors, (8), 3 states have call predecessors, (8), 3 states have call successors, (8) [2024-10-24 16:13:30,868 INFO L276 IsEmpty]: Start isEmpty. Operand 130 states and 134 transitions. [2024-10-24 16:13:30,869 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 74 [2024-10-24 16:13:30,869 INFO L207 NwaCegarLoop]: Found error trace [2024-10-24 16:13:30,869 INFO L215 NwaCegarLoop]: trace histogram [4, 4, 4, 4, 3, 3, 3, 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-24 16:13:30,869 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable39 [2024-10-24 16:13:30,869 INFO L396 AbstractCegarLoop]: === Iteration 41 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONMEMORY_LEAK === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 34 more)] === [2024-10-24 16:13:30,869 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-24 16:13:30,870 INFO L85 PathProgramCache]: Analyzing trace with hash 1526076651, now seen corresponding path program 1 times [2024-10-24 16:13:30,870 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-24 16:13:30,870 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1089110293] [2024-10-24 16:13:30,870 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-24 16:13:30,870 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-24 16:13:30,882 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 16:13:31,094 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2024-10-24 16:13:31,095 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 16:13:31,096 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 7 [2024-10-24 16:13:31,097 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 16:13:31,097 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 12 [2024-10-24 16:13:31,098 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 16:13:31,098 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 17 [2024-10-24 16:13:31,101 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 16:13:31,102 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 44 [2024-10-24 16:13:31,103 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 16:13:31,104 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 52 [2024-10-24 16:13:31,105 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 16:13:31,106 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 61 [2024-10-24 16:13:31,107 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 16:13:31,108 INFO L134 CoverageAnalysis]: Checked inductivity of 58 backedges. 15 proven. 0 refuted. 0 times theorem prover too weak. 43 trivial. 0 not checked. [2024-10-24 16:13:31,108 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-24 16:13:31,108 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1089110293] [2024-10-24 16:13:31,109 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1089110293] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-24 16:13:31,109 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-24 16:13:31,109 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2024-10-24 16:13:31,109 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1939302542] [2024-10-24 16:13:31,109 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-24 16:13:31,109 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2024-10-24 16:13:31,109 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-24 16:13:31,110 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2024-10-24 16:13:31,110 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=18, Invalid=72, Unknown=0, NotChecked=0, Total=90 [2024-10-24 16:13:31,110 INFO L87 Difference]: Start difference. First operand 130 states and 134 transitions. Second operand has 10 states, 9 states have (on average 4.333333333333333) internal successors, (39), 9 states have internal predecessors, (39), 3 states have call successors, (8), 2 states have call predecessors, (8), 1 states have return successors, (7), 2 states have call predecessors, (7), 2 states have call successors, (7) [2024-10-24 16:13:31,262 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-24 16:13:31,262 INFO L93 Difference]: Finished difference Result 134 states and 137 transitions. [2024-10-24 16:13:31,263 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2024-10-24 16:13:31,263 INFO L78 Accepts]: Start accepts. Automaton has has 10 states, 9 states have (on average 4.333333333333333) internal successors, (39), 9 states have internal predecessors, (39), 3 states have call successors, (8), 2 states have call predecessors, (8), 1 states have return successors, (7), 2 states have call predecessors, (7), 2 states have call successors, (7) Word has length 73 [2024-10-24 16:13:31,263 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-24 16:13:31,263 INFO L225 Difference]: With dead ends: 134 [2024-10-24 16:13:31,263 INFO L226 Difference]: Without dead ends: 134 [2024-10-24 16:13:31,264 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 27 GetRequests, 16 SyntacticMatches, 0 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 11 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=32, Invalid=124, Unknown=0, NotChecked=0, Total=156 [2024-10-24 16:13:31,264 INFO L432 NwaCegarLoop]: 48 mSDtfsCounter, 7 mSDsluCounter, 280 mSDsCounter, 0 mSdLazyCounter, 182 mSolverCounterSat, 4 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 7 SdHoareTripleChecker+Valid, 328 SdHoareTripleChecker+Invalid, 186 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 4 IncrementalHoareTripleChecker+Valid, 182 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-10-24 16:13:31,264 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [7 Valid, 328 Invalid, 186 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [4 Valid, 182 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-10-24 16:13:31,265 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 134 states. [2024-10-24 16:13:31,269 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 134 to 134. [2024-10-24 16:13:31,269 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 134 states, 102 states have (on average 1.0686274509803921) internal successors, (109), 107 states have internal predecessors, (109), 14 states have call successors, (14), 13 states have call predecessors, (14), 13 states have return successors, (14), 13 states have call predecessors, (14), 14 states have call successors, (14) [2024-10-24 16:13:31,270 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 134 states to 134 states and 137 transitions. [2024-10-24 16:13:31,270 INFO L78 Accepts]: Start accepts. Automaton has 134 states and 137 transitions. Word has length 73 [2024-10-24 16:13:31,270 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-24 16:13:31,270 INFO L471 AbstractCegarLoop]: Abstraction has 134 states and 137 transitions. [2024-10-24 16:13:31,273 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 9 states have (on average 4.333333333333333) internal successors, (39), 9 states have internal predecessors, (39), 3 states have call successors, (8), 2 states have call predecessors, (8), 1 states have return successors, (7), 2 states have call predecessors, (7), 2 states have call successors, (7) [2024-10-24 16:13:31,273 INFO L276 IsEmpty]: Start isEmpty. Operand 134 states and 137 transitions. [2024-10-24 16:13:31,274 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 77 [2024-10-24 16:13:31,274 INFO L207 NwaCegarLoop]: Found error trace [2024-10-24 16:13:31,274 INFO L215 NwaCegarLoop]: trace histogram [5, 5, 5, 4, 4, 4, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-24 16:13:31,274 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable40 [2024-10-24 16:13:31,274 INFO L396 AbstractCegarLoop]: === Iteration 42 === Targeting ULTIMATE.startErr33ASSERT_VIOLATIONMEMORY_FREE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 34 more)] === [2024-10-24 16:13:31,275 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-24 16:13:31,275 INFO L85 PathProgramCache]: Analyzing trace with hash 1295611771, now seen corresponding path program 1 times [2024-10-24 16:13:31,275 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-24 16:13:31,275 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [858609275] [2024-10-24 16:13:31,275 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-24 16:13:31,275 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-24 16:13:31,287 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 16:13:31,309 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2024-10-24 16:13:31,310 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 16:13:31,311 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 7 [2024-10-24 16:13:31,311 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 16:13:31,312 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 12 [2024-10-24 16:13:31,313 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 16:13:31,314 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 17 [2024-10-24 16:13:31,315 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 16:13:31,316 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 33 [2024-10-24 16:13:31,317 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 16:13:31,317 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 41 [2024-10-24 16:13:31,318 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 16:13:31,319 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 50 [2024-10-24 16:13:31,320 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 16:13:31,321 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 58 [2024-10-24 16:13:31,322 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 16:13:31,323 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 68 [2024-10-24 16:13:31,324 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 16:13:31,325 INFO L134 CoverageAnalysis]: Checked inductivity of 64 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 64 trivial. 0 not checked. [2024-10-24 16:13:31,325 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-24 16:13:31,325 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [858609275] [2024-10-24 16:13:31,325 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [858609275] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-24 16:13:31,325 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-24 16:13:31,325 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-10-24 16:13:31,326 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [48204301] [2024-10-24 16:13:31,326 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-24 16:13:31,327 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-10-24 16:13:31,327 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-24 16:13:31,327 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-10-24 16:13:31,328 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-10-24 16:13:31,328 INFO L87 Difference]: Start difference. First operand 134 states and 137 transitions. Second operand has 3 states, 2 states have (on average 18.5) internal successors, (37), 3 states have internal predecessors, (37), 2 states have call successors, (9), 1 states have call predecessors, (9), 1 states have return successors, (9), 2 states have call predecessors, (9), 2 states have call successors, (9) [2024-10-24 16:13:31,358 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-24 16:13:31,358 INFO L93 Difference]: Finished difference Result 133 states and 136 transitions. [2024-10-24 16:13:31,358 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-10-24 16:13:31,358 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 2 states have (on average 18.5) internal successors, (37), 3 states have internal predecessors, (37), 2 states have call successors, (9), 1 states have call predecessors, (9), 1 states have return successors, (9), 2 states have call predecessors, (9), 2 states have call successors, (9) Word has length 76 [2024-10-24 16:13:31,359 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-24 16:13:31,359 INFO L225 Difference]: With dead ends: 133 [2024-10-24 16:13:31,359 INFO L226 Difference]: Without dead ends: 133 [2024-10-24 16:13:31,359 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 20 GetRequests, 19 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-10-24 16:13:31,360 INFO L432 NwaCegarLoop]: 49 mSDtfsCounter, 4 mSDsluCounter, 11 mSDsCounter, 0 mSdLazyCounter, 27 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 4 SdHoareTripleChecker+Valid, 60 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-10-24 16:13:31,360 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [4 Valid, 60 Invalid, 27 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 27 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-10-24 16:13:31,360 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 133 states. [2024-10-24 16:13:31,363 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 133 to 133. [2024-10-24 16:13:31,364 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 133 states, 102 states have (on average 1.0588235294117647) internal successors, (108), 106 states have internal predecessors, (108), 14 states have call successors, (14), 13 states have call predecessors, (14), 13 states have return successors, (14), 13 states have call predecessors, (14), 14 states have call successors, (14) [2024-10-24 16:13:31,364 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 133 states to 133 states and 136 transitions. [2024-10-24 16:13:31,364 INFO L78 Accepts]: Start accepts. Automaton has 133 states and 136 transitions. Word has length 76 [2024-10-24 16:13:31,364 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-24 16:13:31,365 INFO L471 AbstractCegarLoop]: Abstraction has 133 states and 136 transitions. [2024-10-24 16:13:31,365 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 2 states have (on average 18.5) internal successors, (37), 3 states have internal predecessors, (37), 2 states have call successors, (9), 1 states have call predecessors, (9), 1 states have return successors, (9), 2 states have call predecessors, (9), 2 states have call successors, (9) [2024-10-24 16:13:31,365 INFO L276 IsEmpty]: Start isEmpty. Operand 133 states and 136 transitions. [2024-10-24 16:13:31,365 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 79 [2024-10-24 16:13:31,365 INFO L207 NwaCegarLoop]: Found error trace [2024-10-24 16:13:31,366 INFO L215 NwaCegarLoop]: trace histogram [5, 5, 5, 4, 4, 4, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-24 16:13:31,366 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable41 [2024-10-24 16:13:31,366 INFO L396 AbstractCegarLoop]: === Iteration 43 === Targeting ULTIMATE.startErr35ASSERT_VIOLATIONMEMORY_LEAK === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 34 more)] === [2024-10-24 16:13:31,366 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-24 16:13:31,366 INFO L85 PathProgramCache]: Analyzing trace with hash -457598690, now seen corresponding path program 1 times [2024-10-24 16:13:31,366 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-24 16:13:31,367 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1961216807] [2024-10-24 16:13:31,367 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-24 16:13:31,367 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-24 16:13:31,385 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat