./Ultimate.py --spec ../sv-benchmarks/c/properties/valid-memsafety.prp --file ../sv-benchmarks/c/verifythis/duplets.c --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for memory safety (deref-memtrack) Using default analysis Version c7c6ca5d Calling Ultimate with: /root/.sdkman/candidates/java/11.0.12-open/bin/java -Dosgi.configuration.area=/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/config -Xmx15G -Xms4m -jar /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/plugins/org.eclipse.equinox.launcher_1.5.800.v20200727-1323.jar -data @noDefault -ultimatedata /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data -tc /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/AutomizerMemDerefMemtrack.xml -i ../sv-benchmarks/c/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-?-c7c6ca5-m [2024-11-09 07:39:36,272 INFO L188 SettingsManager]: Resetting all preferences to default values... [2024-11-09 07:39:36,344 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-DerefFreeMemtrack-32bit-Automizer_Default.epf [2024-11-09 07:39:36,349 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2024-11-09 07:39:36,349 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2024-11-09 07:39:36,373 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2024-11-09 07:39:36,374 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2024-11-09 07:39:36,374 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2024-11-09 07:39:36,375 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2024-11-09 07:39:36,375 INFO L153 SettingsManager]: * Use memory slicer=true [2024-11-09 07:39:36,376 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2024-11-09 07:39:36,376 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2024-11-09 07:39:36,376 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2024-11-09 07:39:36,377 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2024-11-09 07:39:36,379 INFO L153 SettingsManager]: * Use SBE=true [2024-11-09 07:39:36,380 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2024-11-09 07:39:36,381 INFO L153 SettingsManager]: * sizeof long=4 [2024-11-09 07:39:36,381 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2024-11-09 07:39:36,385 INFO L153 SettingsManager]: * sizeof POINTER=4 [2024-11-09 07:39:36,385 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2024-11-09 07:39:36,386 INFO L153 SettingsManager]: * Check for the main procedure if all allocated memory was freed=true [2024-11-09 07:39:36,387 INFO L153 SettingsManager]: * Bitprecise bitfields=true [2024-11-09 07:39:36,387 INFO L153 SettingsManager]: * SV-COMP memtrack compatibility mode=true [2024-11-09 07:39:36,387 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2024-11-09 07:39:36,388 INFO L153 SettingsManager]: * Adapt memory model on pointer casts if necessary=true [2024-11-09 07:39:36,388 INFO L153 SettingsManager]: * Allow undefined functions=false [2024-11-09 07:39:36,388 INFO L153 SettingsManager]: * Check unreachability of reach_error function=false [2024-11-09 07:39:36,388 INFO L153 SettingsManager]: * sizeof long double=12 [2024-11-09 07:39:36,389 INFO L153 SettingsManager]: * Use constant arrays=true [2024-11-09 07:39:36,389 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2024-11-09 07:39:36,389 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2024-11-09 07:39:36,389 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2024-11-09 07:39:36,390 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2024-11-09 07:39:36,390 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-11-09 07:39:36,391 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2024-11-09 07:39:36,391 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2024-11-09 07:39:36,392 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2024-11-09 07:39:36,392 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2024-11-09 07:39:36,392 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2024-11-09 07:39:36,393 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2024-11-09 07:39:36,393 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2024-11-09 07:39:36,393 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2024-11-09 07:39:36,393 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-11-09 07:39:36,671 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2024-11-09 07:39:36,698 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2024-11-09 07:39:36,701 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2024-11-09 07:39:36,702 INFO L270 PluginConnector]: Initializing CDTParser... [2024-11-09 07:39:36,703 INFO L274 PluginConnector]: CDTParser initialized [2024-11-09 07:39:36,704 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/verifythis/duplets.c [2024-11-09 07:39:38,294 INFO L533 CDTParser]: Created temporary CDT project at NULL [2024-11-09 07:39:38,477 INFO L384 CDTParser]: Found 1 translation units. [2024-11-09 07:39:38,478 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/verifythis/duplets.c [2024-11-09 07:39:38,487 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/f3515f6f7/10d3bf6c4093417495d8c0b203f098d4/FLAGea86dd8d9 [2024-11-09 07:39:38,499 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/f3515f6f7/10d3bf6c4093417495d8c0b203f098d4 [2024-11-09 07:39:38,501 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2024-11-09 07:39:38,502 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2024-11-09 07:39:38,504 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2024-11-09 07:39:38,504 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2024-11-09 07:39:38,508 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2024-11-09 07:39:38,508 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 09.11 07:39:38" (1/1) ... [2024-11-09 07:39:38,509 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@5e64bca0 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.11 07:39:38, skipping insertion in model container [2024-11-09 07:39:38,509 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 09.11 07:39:38" (1/1) ... [2024-11-09 07:39:38,532 INFO L175 MainTranslator]: Built tables and reachable declarations [2024-11-09 07:39:38,740 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-11-09 07:39:38,752 INFO L200 MainTranslator]: Completed pre-run [2024-11-09 07:39:38,778 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-11-09 07:39:38,795 INFO L204 MainTranslator]: Completed translation [2024-11-09 07:39:38,795 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.11 07:39:38 WrapperNode [2024-11-09 07:39:38,796 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2024-11-09 07:39:38,797 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2024-11-09 07:39:38,797 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2024-11-09 07:39:38,797 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2024-11-09 07:39:38,805 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.11 07:39:38" (1/1) ... [2024-11-09 07:39:38,814 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.11 07:39:38" (1/1) ... [2024-11-09 07:39:38,839 INFO L138 Inliner]: procedures = 21, calls = 44, calls flagged for inlining = 6, calls inlined = 6, statements flattened = 132 [2024-11-09 07:39:38,840 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2024-11-09 07:39:38,841 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2024-11-09 07:39:38,841 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2024-11-09 07:39:38,841 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2024-11-09 07:39:38,851 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.11 07:39:38" (1/1) ... [2024-11-09 07:39:38,852 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.11 07:39:38" (1/1) ... [2024-11-09 07:39:38,854 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.11 07:39:38" (1/1) ... [2024-11-09 07:39:38,870 INFO L175 MemorySlicer]: Split 19 memory accesses to 4 slices as follows [2, 5, 5, 7]. 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, 1, 1, 3]. [2024-11-09 07:39:38,870 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.11 07:39:38" (1/1) ... [2024-11-09 07:39:38,871 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.11 07:39:38" (1/1) ... [2024-11-09 07:39:38,878 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.11 07:39:38" (1/1) ... [2024-11-09 07:39:38,886 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.11 07:39:38" (1/1) ... [2024-11-09 07:39:38,888 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.11 07:39:38" (1/1) ... [2024-11-09 07:39:38,889 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.11 07:39:38" (1/1) ... [2024-11-09 07:39:38,892 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2024-11-09 07:39:38,895 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2024-11-09 07:39:38,895 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2024-11-09 07:39:38,895 INFO L274 PluginConnector]: RCFGBuilder initialized [2024-11-09 07:39:38,896 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.11 07:39:38" (1/1) ... [2024-11-09 07:39:38,902 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-11-09 07:39:38,914 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-09 07:39:38,934 INFO L229 MonitoredProcess]: Starting monitored process 1 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (exit command is (exit), workingDir is null) [2024-11-09 07:39:38,937 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Waiting until timeout for monitored process [2024-11-09 07:39:38,988 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2024-11-09 07:39:38,988 INFO L130 BoogieDeclarations]: Found specification of procedure assume_abort_if_not [2024-11-09 07:39:38,988 INFO L138 BoogieDeclarations]: Found implementation of procedure assume_abort_if_not [2024-11-09 07:39:38,988 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#0 [2024-11-09 07:39:38,990 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#1 [2024-11-09 07:39:38,990 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#2 [2024-11-09 07:39:38,990 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#3 [2024-11-09 07:39:38,990 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2024-11-09 07:39:38,990 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#0 [2024-11-09 07:39:38,990 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#1 [2024-11-09 07:39:38,990 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#2 [2024-11-09 07:39:38,992 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#3 [2024-11-09 07:39:38,992 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnHeap [2024-11-09 07:39:38,993 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2024-11-09 07:39:38,993 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2024-11-09 07:39:38,993 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#0 [2024-11-09 07:39:38,993 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#1 [2024-11-09 07:39:38,994 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#2 [2024-11-09 07:39:38,994 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#3 [2024-11-09 07:39:38,994 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_assert [2024-11-09 07:39:38,994 INFO L138 BoogieDeclarations]: Found implementation of procedure __VERIFIER_assert [2024-11-09 07:39:38,994 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2024-11-09 07:39:39,117 INFO L238 CfgBuilder]: Building ICFG [2024-11-09 07:39:39,120 INFO L264 CfgBuilder]: Building CFG for each procedure with an implementation [2024-11-09 07:39:39,558 INFO L? ?]: Removed 107 outVars from TransFormulas that were not future-live. [2024-11-09 07:39:39,559 INFO L287 CfgBuilder]: Performing block encoding [2024-11-09 07:39:39,580 INFO L311 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2024-11-09 07:39:39,580 INFO L316 CfgBuilder]: Removed 2 assume(true) statements. [2024-11-09 07:39:39,581 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 09.11 07:39:39 BoogieIcfgContainer [2024-11-09 07:39:39,581 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2024-11-09 07:39:39,583 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2024-11-09 07:39:39,583 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2024-11-09 07:39:39,586 INFO L274 PluginConnector]: TraceAbstraction initialized [2024-11-09 07:39:39,586 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 09.11 07:39:38" (1/3) ... [2024-11-09 07:39:39,587 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@527ef7c7 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 09.11 07:39:39, skipping insertion in model container [2024-11-09 07:39:39,587 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.11 07:39:38" (2/3) ... [2024-11-09 07:39:39,587 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@527ef7c7 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 09.11 07:39:39, skipping insertion in model container [2024-11-09 07:39:39,587 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 09.11 07:39:39" (3/3) ... [2024-11-09 07:39:39,588 INFO L112 eAbstractionObserver]: Analyzing ICFG duplets.c [2024-11-09 07:39:39,605 INFO L214 ceAbstractionStarter]: Automizer settings: Hoare:None NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2024-11-09 07:39:39,605 INFO L154 ceAbstractionStarter]: Applying trace abstraction to program that has 37 error locations. [2024-11-09 07:39:39,647 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2024-11-09 07:39:39,653 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;@219ada4b, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2024-11-09 07:39:39,653 INFO L334 AbstractCegarLoop]: Starting to check reachability of 37 error locations. [2024-11-09 07:39:39,657 INFO L276 IsEmpty]: Start isEmpty. Operand has 102 states, 53 states have (on average 1.8679245283018868) internal successors, (99), 90 states have internal predecessors, (99), 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-11-09 07:39:39,664 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 27 [2024-11-09 07:39:39,664 INFO L207 NwaCegarLoop]: Found error trace [2024-11-09 07:39:39,665 INFO L215 NwaCegarLoop]: trace histogram [4, 4, 4, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-09 07:39:39,665 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-11-09 07:39:39,670 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-09 07:39:39,670 INFO L85 PathProgramCache]: Analyzing trace with hash 1682769483, now seen corresponding path program 1 times [2024-11-09 07:39:39,678 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-09 07:39:39,678 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1266295364] [2024-11-09 07:39:39,678 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-09 07:39:39,679 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-09 07:39:39,791 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 07:39:39,855 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-11-09 07:39:39,858 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 07:39:39,864 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 9 [2024-11-09 07:39:39,868 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 07:39:39,876 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 14 [2024-11-09 07:39:39,879 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 07:39:39,883 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 19 [2024-11-09 07:39:39,886 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 07:39:39,891 INFO L134 CoverageAnalysis]: Checked inductivity of 24 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 24 trivial. 0 not checked. [2024-11-09 07:39:39,894 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-09 07:39:39,894 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1266295364] [2024-11-09 07:39:39,895 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1266295364] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-09 07:39:39,895 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-09 07:39:39,896 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-11-09 07:39:39,897 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [742563843] [2024-11-09 07:39:39,898 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-09 07:39:39,901 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2024-11-09 07:39:39,902 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-09 07:39:39,926 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2024-11-09 07:39:39,927 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2024-11-09 07:39:39,930 INFO L87 Difference]: Start difference. First operand has 102 states, 53 states have (on average 1.8679245283018868) internal successors, (99), 90 states have internal predecessors, (99), 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 4.5) internal successors, (9), 2 states have internal predecessors, (9), 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-11-09 07:39:39,954 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-09 07:39:39,954 INFO L93 Difference]: Finished difference Result 101 states and 112 transitions. [2024-11-09 07:39:39,955 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2024-11-09 07:39:39,957 INFO L78 Accepts]: Start accepts. Automaton has has 2 states, 2 states have (on average 4.5) internal successors, (9), 2 states have internal predecessors, (9), 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 26 [2024-11-09 07:39:39,957 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-09 07:39:39,965 INFO L225 Difference]: With dead ends: 101 [2024-11-09 07:39:39,965 INFO L226 Difference]: Without dead ends: 99 [2024-11-09 07:39:39,967 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-11-09 07:39:39,973 INFO L432 NwaCegarLoop]: 112 mSDtfsCounter, 0 mSDsluCounter, 0 mSDsCounter, 0 mSdLazyCounter, 0 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 112 SdHoareTripleChecker+Invalid, 0 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 0 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-11-09 07:39:39,974 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 112 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 0 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-11-09 07:39:39,993 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 99 states. [2024-11-09 07:39:40,015 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 99 to 99. [2024-11-09 07:39:40,017 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 99 states, 51 states have (on average 1.803921568627451) internal successors, (92), 87 states have internal predecessors, (92), 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-11-09 07:39:40,019 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 99 states to 99 states and 110 transitions. [2024-11-09 07:39:40,020 INFO L78 Accepts]: Start accepts. Automaton has 99 states and 110 transitions. Word has length 26 [2024-11-09 07:39:40,020 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-09 07:39:40,020 INFO L471 AbstractCegarLoop]: Abstraction has 99 states and 110 transitions. [2024-11-09 07:39:40,020 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 2 states, 2 states have (on average 4.5) internal successors, (9), 2 states have internal predecessors, (9), 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-11-09 07:39:40,021 INFO L276 IsEmpty]: Start isEmpty. Operand 99 states and 110 transitions. [2024-11-09 07:39:40,022 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 27 [2024-11-09 07:39:40,022 INFO L207 NwaCegarLoop]: Found error trace [2024-11-09 07:39:40,022 INFO L215 NwaCegarLoop]: trace histogram [4, 4, 4, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-09 07:39:40,022 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2024-11-09 07:39:40,023 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-11-09 07:39:40,023 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-09 07:39:40,023 INFO L85 PathProgramCache]: Analyzing trace with hash 230580555, now seen corresponding path program 1 times [2024-11-09 07:39:40,024 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-09 07:39:40,024 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [712998612] [2024-11-09 07:39:40,024 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-09 07:39:40,024 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-09 07:39:40,060 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 07:39:40,309 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-11-09 07:39:40,311 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 07:39:40,319 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 9 [2024-11-09 07:39:40,325 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 07:39:40,337 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 14 [2024-11-09 07:39:40,341 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 07:39:40,351 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 19 [2024-11-09 07:39:40,357 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 07:39:40,362 INFO L134 CoverageAnalysis]: Checked inductivity of 24 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 24 trivial. 0 not checked. [2024-11-09 07:39:40,363 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-09 07:39:40,363 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [712998612] [2024-11-09 07:39:40,363 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [712998612] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-09 07:39:40,363 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-09 07:39:40,364 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-11-09 07:39:40,364 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1413044765] [2024-11-09 07:39:40,364 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-09 07:39:40,365 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-11-09 07:39:40,365 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-09 07:39:40,366 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-11-09 07:39:40,366 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-11-09 07:39:40,366 INFO L87 Difference]: Start difference. First operand 99 states and 110 transitions. Second operand has 4 states, 3 states have (on average 3.0) internal successors, (9), 4 states have internal predecessors, (9), 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-11-09 07:39:40,512 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-09 07:39:40,513 INFO L93 Difference]: Finished difference Result 97 states and 108 transitions. [2024-11-09 07:39:40,513 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-11-09 07:39:40,513 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 3 states have (on average 3.0) internal successors, (9), 4 states have internal predecessors, (9), 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 26 [2024-11-09 07:39:40,514 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-09 07:39:40,514 INFO L225 Difference]: With dead ends: 97 [2024-11-09 07:39:40,515 INFO L226 Difference]: Without dead ends: 97 [2024-11-09 07:39:40,515 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 11 GetRequests, 9 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-11-09 07:39:40,516 INFO L432 NwaCegarLoop]: 103 mSDtfsCounter, 1 mSDsluCounter, 123 mSDsCounter, 0 mSdLazyCounter, 91 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1 SdHoareTripleChecker+Valid, 226 SdHoareTripleChecker+Invalid, 92 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 91 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-11-09 07:39:40,520 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [1 Valid, 226 Invalid, 92 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 91 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-11-09 07:39:40,521 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 97 states. [2024-11-09 07:39:40,528 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 97 to 97. [2024-11-09 07:39:40,529 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 97 states, 51 states have (on average 1.7647058823529411) internal successors, (90), 85 states have internal predecessors, (90), 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-11-09 07:39:40,531 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 97 states to 97 states and 108 transitions. [2024-11-09 07:39:40,531 INFO L78 Accepts]: Start accepts. Automaton has 97 states and 108 transitions. Word has length 26 [2024-11-09 07:39:40,532 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-09 07:39:40,533 INFO L471 AbstractCegarLoop]: Abstraction has 97 states and 108 transitions. [2024-11-09 07:39:40,533 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 3 states have (on average 3.0) internal successors, (9), 4 states have internal predecessors, (9), 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-11-09 07:39:40,533 INFO L276 IsEmpty]: Start isEmpty. Operand 97 states and 108 transitions. [2024-11-09 07:39:40,533 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 27 [2024-11-09 07:39:40,534 INFO L207 NwaCegarLoop]: Found error trace [2024-11-09 07:39:40,534 INFO L215 NwaCegarLoop]: trace histogram [4, 4, 4, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-09 07:39:40,534 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2024-11-09 07:39:40,534 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-11-09 07:39:40,535 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-09 07:39:40,535 INFO L85 PathProgramCache]: Analyzing trace with hash 230580556, now seen corresponding path program 1 times [2024-11-09 07:39:40,535 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-09 07:39:40,535 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1337049365] [2024-11-09 07:39:40,535 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-09 07:39:40,535 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-09 07:39:40,596 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 07:39:41,028 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-11-09 07:39:41,035 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 07:39:41,079 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 9 [2024-11-09 07:39:41,083 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 07:39:41,122 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 14 [2024-11-09 07:39:41,126 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 07:39:41,133 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 19 [2024-11-09 07:39:41,136 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 07:39:41,144 INFO L134 CoverageAnalysis]: Checked inductivity of 24 backedges. 0 proven. 12 refuted. 0 times theorem prover too weak. 12 trivial. 0 not checked. [2024-11-09 07:39:41,144 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-09 07:39:41,144 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1337049365] [2024-11-09 07:39:41,144 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1337049365] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-09 07:39:41,145 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1067502332] [2024-11-09 07:39:41,145 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-09 07:39:41,145 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-09 07:39:41,145 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-09 07:39:41,149 INFO L229 MonitoredProcess]: Starting monitored process 2 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-11-09 07:39:41,151 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Waiting until timeout for monitored process [2024-11-09 07:39:41,237 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 07:39:41,239 INFO L255 TraceCheckSpWp]: Trace formula consists of 107 conjuncts, 29 conjuncts are in the unsatisfiable core [2024-11-09 07:39:41,248 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-09 07:39:41,347 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-11-09 07:39:41,845 INFO L134 CoverageAnalysis]: Checked inductivity of 24 backedges. 8 proven. 12 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2024-11-09 07:39:41,847 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-11-09 07:39:42,283 INFO L134 CoverageAnalysis]: Checked inductivity of 24 backedges. 0 proven. 12 refuted. 0 times theorem prover too weak. 12 trivial. 0 not checked. [2024-11-09 07:39:42,284 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1067502332] provided 0 perfect and 2 imperfect interpolant sequences [2024-11-09 07:39:42,284 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2024-11-09 07:39:42,284 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 11, 7] total 19 [2024-11-09 07:39:42,284 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [748315096] [2024-11-09 07:39:42,285 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2024-11-09 07:39:42,285 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 20 states [2024-11-09 07:39:42,285 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-09 07:39:42,286 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 20 interpolants. [2024-11-09 07:39:42,286 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=68, Invalid=312, Unknown=0, NotChecked=0, Total=380 [2024-11-09 07:39:42,287 INFO L87 Difference]: Start difference. First operand 97 states and 108 transitions. Second operand has 20 states, 16 states have (on average 1.75) internal successors, (28), 17 states have internal predecessors, (28), 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-11-09 07:39:46,420 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-11-09 07:39:47,008 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-09 07:39:47,009 INFO L93 Difference]: Finished difference Result 132 states and 144 transitions. [2024-11-09 07:39:47,012 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2024-11-09 07:39:47,013 INFO L78 Accepts]: Start accepts. Automaton has has 20 states, 16 states have (on average 1.75) internal successors, (28), 17 states have internal predecessors, (28), 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 26 [2024-11-09 07:39:47,013 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-09 07:39:47,014 INFO L225 Difference]: With dead ends: 132 [2024-11-09 07:39:47,014 INFO L226 Difference]: Without dead ends: 132 [2024-11-09 07:39:47,015 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 71 GetRequests, 43 SyntacticMatches, 4 SemanticMatches, 24 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 164 ImplicationChecksByTransitivity, 0.6s TimeCoverageRelationStatistics Valid=122, Invalid=528, Unknown=0, NotChecked=0, Total=650 [2024-11-09 07:39:47,016 INFO L432 NwaCegarLoop]: 77 mSDtfsCounter, 344 mSDsluCounter, 611 mSDsCounter, 0 mSdLazyCounter, 605 mSolverCounterSat, 45 mSolverCounterUnsat, 1 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 4.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 345 SdHoareTripleChecker+Valid, 688 SdHoareTripleChecker+Invalid, 651 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 45 IncrementalHoareTripleChecker+Valid, 605 IncrementalHoareTripleChecker+Invalid, 1 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 4.5s IncrementalHoareTripleChecker+Time [2024-11-09 07:39:47,019 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [345 Valid, 688 Invalid, 651 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [45 Valid, 605 Invalid, 1 Unknown, 0 Unchecked, 4.5s Time] [2024-11-09 07:39:47,023 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 132 states. [2024-11-09 07:39:47,030 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 132 to 100. [2024-11-09 07:39:47,030 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 100 states, 54 states have (on average 1.7037037037037037) internal successors, (92), 87 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-11-09 07:39:47,032 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 100 states to 100 states and 110 transitions. [2024-11-09 07:39:47,032 INFO L78 Accepts]: Start accepts. Automaton has 100 states and 110 transitions. Word has length 26 [2024-11-09 07:39:47,032 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-09 07:39:47,032 INFO L471 AbstractCegarLoop]: Abstraction has 100 states and 110 transitions. [2024-11-09 07:39:47,033 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 20 states, 16 states have (on average 1.75) internal successors, (28), 17 states have internal predecessors, (28), 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-11-09 07:39:47,033 INFO L276 IsEmpty]: Start isEmpty. Operand 100 states and 110 transitions. [2024-11-09 07:39:47,034 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 28 [2024-11-09 07:39:47,034 INFO L207 NwaCegarLoop]: Found error trace [2024-11-09 07:39:47,034 INFO L215 NwaCegarLoop]: trace histogram [4, 4, 4, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-09 07:39:47,048 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Ended with exit code 0 [2024-11-09 07:39:47,238 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-11-09 07:39:47,239 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-11-09 07:39:47,240 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-09 07:39:47,240 INFO L85 PathProgramCache]: Analyzing trace with hash -1441937394, now seen corresponding path program 1 times [2024-11-09 07:39:47,240 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-09 07:39:47,240 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [294557700] [2024-11-09 07:39:47,240 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-09 07:39:47,240 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-09 07:39:47,273 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 07:39:47,535 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-11-09 07:39:47,537 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 07:39:47,567 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 9 [2024-11-09 07:39:47,570 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 07:39:47,576 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 14 [2024-11-09 07:39:47,579 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 07:39:47,598 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 19 [2024-11-09 07:39:47,601 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 07:39:47,608 INFO L134 CoverageAnalysis]: Checked inductivity of 24 backedges. 3 proven. 9 refuted. 0 times theorem prover too weak. 12 trivial. 0 not checked. [2024-11-09 07:39:47,608 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-09 07:39:47,608 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [294557700] [2024-11-09 07:39:47,609 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [294557700] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-09 07:39:47,609 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [156732372] [2024-11-09 07:39:47,609 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-09 07:39:47,609 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-09 07:39:47,609 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-09 07:39:47,611 INFO L229 MonitoredProcess]: Starting monitored process 3 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-11-09 07:39:47,627 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Waiting until timeout for monitored process [2024-11-09 07:39:47,697 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 07:39:47,699 INFO L255 TraceCheckSpWp]: Trace formula consists of 115 conjuncts, 32 conjuncts are in the unsatisfiable core [2024-11-09 07:39:47,702 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-09 07:39:47,739 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-11-09 07:39:48,506 INFO L134 CoverageAnalysis]: Checked inductivity of 24 backedges. 14 proven. 9 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2024-11-09 07:39:48,507 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-11-09 07:39:49,115 INFO L134 CoverageAnalysis]: Checked inductivity of 24 backedges. 3 proven. 12 refuted. 0 times theorem prover too weak. 9 trivial. 0 not checked. [2024-11-09 07:39:49,116 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [156732372] provided 0 perfect and 2 imperfect interpolant sequences [2024-11-09 07:39:49,116 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2024-11-09 07:39:49,117 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [8, 11, 10] total 24 [2024-11-09 07:39:49,117 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1182538860] [2024-11-09 07:39:49,117 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2024-11-09 07:39:49,117 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 25 states [2024-11-09 07:39:49,117 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-09 07:39:49,118 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 25 interpolants. [2024-11-09 07:39:49,119 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=92, Invalid=508, Unknown=0, NotChecked=0, Total=600 [2024-11-09 07:39:49,120 INFO L87 Difference]: Start difference. First operand 100 states and 110 transitions. Second operand has 25 states, 21 states have (on average 1.7619047619047619) internal successors, (37), 22 states have internal predecessors, (37), 7 states have call successors, (10), 3 states have call predecessors, (10), 6 states have return successors, (12), 9 states have call predecessors, (12), 7 states have call successors, (12) [2024-11-09 07:39:50,120 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-09 07:39:50,120 INFO L93 Difference]: Finished difference Result 131 states and 143 transitions. [2024-11-09 07:39:50,121 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2024-11-09 07:39:50,121 INFO L78 Accepts]: Start accepts. Automaton has has 25 states, 21 states have (on average 1.7619047619047619) internal successors, (37), 22 states have internal predecessors, (37), 7 states have call successors, (10), 3 states have call predecessors, (10), 6 states have return successors, (12), 9 states have call predecessors, (12), 7 states have call successors, (12) Word has length 27 [2024-11-09 07:39:50,122 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-09 07:39:50,123 INFO L225 Difference]: With dead ends: 131 [2024-11-09 07:39:50,123 INFO L226 Difference]: Without dead ends: 131 [2024-11-09 07:39:50,123 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 74 GetRequests, 42 SyntacticMatches, 3 SemanticMatches, 29 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 238 ImplicationChecksByTransitivity, 0.9s TimeCoverageRelationStatistics Valid=155, Invalid=775, Unknown=0, NotChecked=0, Total=930 [2024-11-09 07:39:50,124 INFO L432 NwaCegarLoop]: 61 mSDtfsCounter, 456 mSDsluCounter, 585 mSDsCounter, 0 mSdLazyCounter, 628 mSolverCounterSat, 55 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.6s Time, 0 mProtectedPredicate, 0 mProtectedAction, 457 SdHoareTripleChecker+Valid, 646 SdHoareTripleChecker+Invalid, 683 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 55 IncrementalHoareTripleChecker+Valid, 628 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.7s IncrementalHoareTripleChecker+Time [2024-11-09 07:39:50,125 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [457 Valid, 646 Invalid, 683 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [55 Valid, 628 Invalid, 0 Unknown, 0 Unchecked, 0.7s Time] [2024-11-09 07:39:50,126 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 131 states. [2024-11-09 07:39:50,130 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 131 to 99. [2024-11-09 07:39:50,131 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 99 states, 54 states have (on average 1.6851851851851851) internal successors, (91), 86 states have internal predecessors, (91), 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-11-09 07:39:50,132 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 99 states to 99 states and 109 transitions. [2024-11-09 07:39:50,132 INFO L78 Accepts]: Start accepts. Automaton has 99 states and 109 transitions. Word has length 27 [2024-11-09 07:39:50,132 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-09 07:39:50,133 INFO L471 AbstractCegarLoop]: Abstraction has 99 states and 109 transitions. [2024-11-09 07:39:50,133 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 25 states, 21 states have (on average 1.7619047619047619) internal successors, (37), 22 states have internal predecessors, (37), 7 states have call successors, (10), 3 states have call predecessors, (10), 6 states have return successors, (12), 9 states have call predecessors, (12), 7 states have call successors, (12) [2024-11-09 07:39:50,133 INFO L276 IsEmpty]: Start isEmpty. Operand 99 states and 109 transitions. [2024-11-09 07:39:50,134 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 32 [2024-11-09 07:39:50,134 INFO L207 NwaCegarLoop]: Found error trace [2024-11-09 07:39:50,134 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-11-09 07:39:50,152 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Ended with exit code 0 [2024-11-09 07:39:50,338 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-11-09 07:39:50,339 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-11-09 07:39:50,339 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-09 07:39:50,340 INFO L85 PathProgramCache]: Analyzing trace with hash -559990634, now seen corresponding path program 1 times [2024-11-09 07:39:50,340 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-09 07:39:50,340 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [304194202] [2024-11-09 07:39:50,340 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-09 07:39:50,341 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-09 07:39:50,367 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 07:39:50,531 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-11-09 07:39:50,532 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 07:39:50,533 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 9 [2024-11-09 07:39:50,535 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 07:39:50,540 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 14 [2024-11-09 07:39:50,542 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 07:39:50,545 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 19 [2024-11-09 07:39:50,547 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 07:39:50,550 INFO L134 CoverageAnalysis]: Checked inductivity of 24 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 24 trivial. 0 not checked. [2024-11-09 07:39:50,551 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-09 07:39:50,551 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [304194202] [2024-11-09 07:39:50,551 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [304194202] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-09 07:39:50,552 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-09 07:39:50,552 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2024-11-09 07:39:50,552 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1330621302] [2024-11-09 07:39:50,552 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-09 07:39:50,552 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2024-11-09 07:39:50,552 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-09 07:39:50,553 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2024-11-09 07:39:50,553 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2024-11-09 07:39:50,553 INFO L87 Difference]: Start difference. First operand 99 states and 109 transitions. Second operand has 6 states, 5 states have (on average 2.8) internal successors, (14), 6 states have internal predecessors, (14), 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-11-09 07:39:50,711 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-09 07:39:50,712 INFO L93 Difference]: Finished difference Result 94 states and 104 transitions. [2024-11-09 07:39:50,712 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2024-11-09 07:39:50,712 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 5 states have (on average 2.8) internal successors, (14), 6 states have internal predecessors, (14), 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 31 [2024-11-09 07:39:50,713 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-09 07:39:50,713 INFO L225 Difference]: With dead ends: 94 [2024-11-09 07:39:50,713 INFO L226 Difference]: Without dead ends: 94 [2024-11-09 07:39:50,714 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 15 GetRequests, 10 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=14, Invalid=28, Unknown=0, NotChecked=0, Total=42 [2024-11-09 07:39:50,715 INFO L432 NwaCegarLoop]: 66 mSDtfsCounter, 78 mSDsluCounter, 124 mSDsCounter, 0 mSdLazyCounter, 188 mSolverCounterSat, 5 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 83 SdHoareTripleChecker+Valid, 190 SdHoareTripleChecker+Invalid, 193 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 5 IncrementalHoareTripleChecker+Valid, 188 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-11-09 07:39:50,715 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [83 Valid, 190 Invalid, 193 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [5 Valid, 188 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-11-09 07:39:50,716 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 94 states. [2024-11-09 07:39:50,719 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 94 to 94. [2024-11-09 07:39:50,720 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 94 states, 54 states have (on average 1.5925925925925926) internal successors, (86), 81 states have internal predecessors, (86), 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-11-09 07:39:50,721 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 94 states to 94 states and 104 transitions. [2024-11-09 07:39:50,721 INFO L78 Accepts]: Start accepts. Automaton has 94 states and 104 transitions. Word has length 31 [2024-11-09 07:39:50,721 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-09 07:39:50,721 INFO L471 AbstractCegarLoop]: Abstraction has 94 states and 104 transitions. [2024-11-09 07:39:50,721 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 5 states have (on average 2.8) internal successors, (14), 6 states have internal predecessors, (14), 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-11-09 07:39:50,722 INFO L276 IsEmpty]: Start isEmpty. Operand 94 states and 104 transitions. [2024-11-09 07:39:50,722 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 32 [2024-11-09 07:39:50,722 INFO L207 NwaCegarLoop]: Found error trace [2024-11-09 07:39:50,722 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-11-09 07:39:50,723 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2024-11-09 07:39:50,723 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-11-09 07:39:50,723 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-09 07:39:50,723 INFO L85 PathProgramCache]: Analyzing trace with hash -559990633, now seen corresponding path program 1 times [2024-11-09 07:39:50,724 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-09 07:39:50,724 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1834995653] [2024-11-09 07:39:50,724 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-09 07:39:50,724 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-09 07:39:50,739 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 07:39:51,078 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-11-09 07:39:51,080 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 07:39:51,081 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 9 [2024-11-09 07:39:51,083 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 07:39:51,089 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 14 [2024-11-09 07:39:51,092 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 07:39:51,097 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 19 [2024-11-09 07:39:51,099 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 07:39:51,105 INFO L134 CoverageAnalysis]: Checked inductivity of 24 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 24 trivial. 0 not checked. [2024-11-09 07:39:51,105 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-09 07:39:51,105 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1834995653] [2024-11-09 07:39:51,106 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1834995653] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-09 07:39:51,106 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-09 07:39:51,106 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2024-11-09 07:39:51,106 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [572202005] [2024-11-09 07:39:51,106 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-09 07:39:51,107 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2024-11-09 07:39:51,107 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-09 07:39:51,107 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2024-11-09 07:39:51,108 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=29, Unknown=0, NotChecked=0, Total=42 [2024-11-09 07:39:51,108 INFO L87 Difference]: Start difference. First operand 94 states and 104 transitions. Second operand has 7 states, 6 states have (on average 2.3333333333333335) internal successors, (14), 7 states have internal predecessors, (14), 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-11-09 07:39:51,416 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-09 07:39:51,416 INFO L93 Difference]: Finished difference Result 125 states and 144 transitions. [2024-11-09 07:39:51,416 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2024-11-09 07:39:51,417 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 6 states have (on average 2.3333333333333335) internal successors, (14), 7 states have internal predecessors, (14), 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 31 [2024-11-09 07:39:51,417 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-09 07:39:51,418 INFO L225 Difference]: With dead ends: 125 [2024-11-09 07:39:51,418 INFO L226 Difference]: Without dead ends: 125 [2024-11-09 07:39:51,418 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 15 GetRequests, 9 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=17, Invalid=39, Unknown=0, NotChecked=0, Total=56 [2024-11-09 07:39:51,419 INFO L432 NwaCegarLoop]: 63 mSDtfsCounter, 80 mSDsluCounter, 175 mSDsCounter, 0 mSdLazyCounter, 278 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 85 SdHoareTripleChecker+Valid, 238 SdHoareTripleChecker+Invalid, 280 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 278 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2024-11-09 07:39:51,419 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [85 Valid, 238 Invalid, 280 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 278 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2024-11-09 07:39:51,420 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 125 states. [2024-11-09 07:39:51,429 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 125 to 113. [2024-11-09 07:39:51,433 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 113 states, 70 states have (on average 1.6571428571428573) internal successors, (116), 97 states have internal predecessors, (116), 12 states have call successors, (12), 3 states have call predecessors, (12), 3 states have return successors, (12), 12 states have call predecessors, (12), 12 states have call successors, (12) [2024-11-09 07:39:51,434 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 113 states to 113 states and 140 transitions. [2024-11-09 07:39:51,434 INFO L78 Accepts]: Start accepts. Automaton has 113 states and 140 transitions. Word has length 31 [2024-11-09 07:39:51,434 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-09 07:39:51,435 INFO L471 AbstractCegarLoop]: Abstraction has 113 states and 140 transitions. [2024-11-09 07:39:51,435 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 6 states have (on average 2.3333333333333335) internal successors, (14), 7 states have internal predecessors, (14), 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-11-09 07:39:51,435 INFO L276 IsEmpty]: Start isEmpty. Operand 113 states and 140 transitions. [2024-11-09 07:39:51,436 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 33 [2024-11-09 07:39:51,436 INFO L207 NwaCegarLoop]: Found error trace [2024-11-09 07:39:51,436 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-11-09 07:39:51,436 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2024-11-09 07:39:51,436 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-11-09 07:39:51,437 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-09 07:39:51,437 INFO L85 PathProgramCache]: Analyzing trace with hash -179840453, now seen corresponding path program 1 times [2024-11-09 07:39:51,437 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-09 07:39:51,437 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1771800423] [2024-11-09 07:39:51,437 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-09 07:39:51,438 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-09 07:39:51,472 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 07:39:52,087 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-11-09 07:39:52,089 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 07:39:52,091 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 9 [2024-11-09 07:39:52,094 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 07:39:52,108 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 14 [2024-11-09 07:39:52,111 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 07:39:52,123 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 19 [2024-11-09 07:39:52,125 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 07:39:52,167 INFO L134 CoverageAnalysis]: Checked inductivity of 24 backedges. 9 proven. 0 refuted. 0 times theorem prover too weak. 15 trivial. 0 not checked. [2024-11-09 07:39:52,168 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-09 07:39:52,168 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1771800423] [2024-11-09 07:39:52,168 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1771800423] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-09 07:39:52,168 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-09 07:39:52,168 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [11] imperfect sequences [] total 11 [2024-11-09 07:39:52,168 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [88232875] [2024-11-09 07:39:52,168 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-09 07:39:52,169 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 12 states [2024-11-09 07:39:52,169 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-09 07:39:52,170 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2024-11-09 07:39:52,170 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=28, Invalid=104, Unknown=0, NotChecked=0, Total=132 [2024-11-09 07:39:52,170 INFO L87 Difference]: Start difference. First operand 113 states and 140 transitions. Second operand has 12 states, 10 states have (on average 1.8) internal successors, (18), 12 states have internal predecessors, (18), 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-11-09 07:39:52,621 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-09 07:39:52,621 INFO L93 Difference]: Finished difference Result 136 states and 157 transitions. [2024-11-09 07:39:52,621 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2024-11-09 07:39:52,622 INFO L78 Accepts]: Start accepts. Automaton has has 12 states, 10 states have (on average 1.8) internal successors, (18), 12 states have internal predecessors, (18), 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 32 [2024-11-09 07:39:52,622 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-09 07:39:52,623 INFO L225 Difference]: With dead ends: 136 [2024-11-09 07:39:52,623 INFO L226 Difference]: Without dead ends: 136 [2024-11-09 07:39:52,623 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 21 GetRequests, 8 SyntacticMatches, 0 SemanticMatches, 13 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 23 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=53, Invalid=157, Unknown=0, NotChecked=0, Total=210 [2024-11-09 07:39:52,624 INFO L432 NwaCegarLoop]: 64 mSDtfsCounter, 105 mSDsluCounter, 295 mSDsCounter, 0 mSdLazyCounter, 427 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 110 SdHoareTripleChecker+Valid, 359 SdHoareTripleChecker+Invalid, 428 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 427 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2024-11-09 07:39:52,624 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [110 Valid, 359 Invalid, 428 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 427 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time] [2024-11-09 07:39:52,625 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 136 states. [2024-11-09 07:39:52,629 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 136 to 116. [2024-11-09 07:39:52,629 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 116 states, 73 states have (on average 1.643835616438356) internal successors, (120), 100 states have internal predecessors, (120), 12 states have call successors, (12), 3 states have call predecessors, (12), 3 states have return successors, (12), 12 states have call predecessors, (12), 12 states have call successors, (12) [2024-11-09 07:39:52,630 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 116 states to 116 states and 144 transitions. [2024-11-09 07:39:52,630 INFO L78 Accepts]: Start accepts. Automaton has 116 states and 144 transitions. Word has length 32 [2024-11-09 07:39:52,631 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-09 07:39:52,631 INFO L471 AbstractCegarLoop]: Abstraction has 116 states and 144 transitions. [2024-11-09 07:39:52,631 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 12 states, 10 states have (on average 1.8) internal successors, (18), 12 states have internal predecessors, (18), 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-11-09 07:39:52,631 INFO L276 IsEmpty]: Start isEmpty. Operand 116 states and 144 transitions. [2024-11-09 07:39:52,632 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 36 [2024-11-09 07:39:52,632 INFO L207 NwaCegarLoop]: Found error trace [2024-11-09 07:39:52,632 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-11-09 07:39:52,632 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2024-11-09 07:39:52,633 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-11-09 07:39:52,633 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-09 07:39:52,633 INFO L85 PathProgramCache]: Analyzing trace with hash 1549055201, now seen corresponding path program 1 times [2024-11-09 07:39:52,633 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-09 07:39:52,633 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [754818785] [2024-11-09 07:39:52,634 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-09 07:39:52,634 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-09 07:39:52,655 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 07:39:52,775 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-11-09 07:39:52,776 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 07:39:52,778 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 9 [2024-11-09 07:39:52,779 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 07:39:52,782 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 14 [2024-11-09 07:39:52,784 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 07:39:52,811 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 19 [2024-11-09 07:39:52,812 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 07:39:52,815 INFO L134 CoverageAnalysis]: Checked inductivity of 24 backedges. 6 proven. 3 refuted. 0 times theorem prover too weak. 15 trivial. 0 not checked. [2024-11-09 07:39:52,815 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-09 07:39:52,815 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [754818785] [2024-11-09 07:39:52,816 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [754818785] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-09 07:39:52,816 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [531816449] [2024-11-09 07:39:52,816 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-09 07:39:52,816 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-09 07:39:52,816 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-09 07:39:52,818 INFO L229 MonitoredProcess]: Starting monitored process 4 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-11-09 07:39:52,820 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Waiting until timeout for monitored process [2024-11-09 07:39:52,914 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 07:39:52,919 INFO L255 TraceCheckSpWp]: Trace formula consists of 190 conjuncts, 16 conjuncts are in the unsatisfiable core [2024-11-09 07:39:52,922 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-09 07:39:53,028 INFO L134 CoverageAnalysis]: Checked inductivity of 24 backedges. 6 proven. 3 refuted. 0 times theorem prover too weak. 15 trivial. 0 not checked. [2024-11-09 07:39:53,028 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-11-09 07:39:53,216 INFO L134 CoverageAnalysis]: Checked inductivity of 24 backedges. 6 proven. 3 refuted. 0 times theorem prover too weak. 15 trivial. 0 not checked. [2024-11-09 07:39:53,216 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [531816449] provided 0 perfect and 2 imperfect interpolant sequences [2024-11-09 07:39:53,216 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2024-11-09 07:39:53,216 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [9, 9, 8] total 17 [2024-11-09 07:39:53,216 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1669639036] [2024-11-09 07:39:53,216 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2024-11-09 07:39:53,217 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 17 states [2024-11-09 07:39:53,217 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-09 07:39:53,217 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 17 interpolants. [2024-11-09 07:39:53,218 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=46, Invalid=226, Unknown=0, NotChecked=0, Total=272 [2024-11-09 07:39:53,218 INFO L87 Difference]: Start difference. First operand 116 states and 144 transitions. Second operand has 17 states, 14 states have (on average 2.5714285714285716) internal successors, (36), 17 states have internal predecessors, (36), 8 states have call successors, (11), 2 states have call predecessors, (11), 2 states have return successors, (10), 7 states have call predecessors, (10), 7 states have call successors, (10) [2024-11-09 07:39:53,425 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-09 07:39:53,426 INFO L93 Difference]: Finished difference Result 136 states and 151 transitions. [2024-11-09 07:39:53,426 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2024-11-09 07:39:53,426 INFO L78 Accepts]: Start accepts. Automaton has has 17 states, 14 states have (on average 2.5714285714285716) internal successors, (36), 17 states have internal predecessors, (36), 8 states have call successors, (11), 2 states have call predecessors, (11), 2 states have return successors, (10), 7 states have call predecessors, (10), 7 states have call successors, (10) Word has length 35 [2024-11-09 07:39:53,426 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-09 07:39:53,427 INFO L225 Difference]: With dead ends: 136 [2024-11-09 07:39:53,427 INFO L226 Difference]: Without dead ends: 136 [2024-11-09 07:39:53,428 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 88 GetRequests, 68 SyntacticMatches, 1 SemanticMatches, 19 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 36 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=78, Invalid=342, Unknown=0, NotChecked=0, Total=420 [2024-11-09 07:39:53,428 INFO L432 NwaCegarLoop]: 84 mSDtfsCounter, 122 mSDsluCounter, 901 mSDsCounter, 0 mSdLazyCounter, 235 mSolverCounterSat, 4 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 127 SdHoareTripleChecker+Valid, 985 SdHoareTripleChecker+Invalid, 239 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 4 IncrementalHoareTripleChecker+Valid, 235 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-11-09 07:39:53,428 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [127 Valid, 985 Invalid, 239 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [4 Valid, 235 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-11-09 07:39:53,429 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 136 states. [2024-11-09 07:39:53,438 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 136 to 116. [2024-11-09 07:39:53,439 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 116 states, 73 states have (on average 1.63013698630137) internal successors, (119), 100 states have internal predecessors, (119), 12 states have call successors, (12), 3 states have call predecessors, (12), 3 states have return successors, (12), 12 states have call predecessors, (12), 12 states have call successors, (12) [2024-11-09 07:39:53,440 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 116 states to 116 states and 143 transitions. [2024-11-09 07:39:53,440 INFO L78 Accepts]: Start accepts. Automaton has 116 states and 143 transitions. Word has length 35 [2024-11-09 07:39:53,440 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-09 07:39:53,440 INFO L471 AbstractCegarLoop]: Abstraction has 116 states and 143 transitions. [2024-11-09 07:39:53,440 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 17 states, 14 states have (on average 2.5714285714285716) internal successors, (36), 17 states have internal predecessors, (36), 8 states have call successors, (11), 2 states have call predecessors, (11), 2 states have return successors, (10), 7 states have call predecessors, (10), 7 states have call successors, (10) [2024-11-09 07:39:53,440 INFO L276 IsEmpty]: Start isEmpty. Operand 116 states and 143 transitions. [2024-11-09 07:39:53,443 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 35 [2024-11-09 07:39:53,444 INFO L207 NwaCegarLoop]: Found error trace [2024-11-09 07:39:53,444 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] [2024-11-09 07:39:53,462 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Forceful destruction successful, exit code 0 [2024-11-09 07:39:53,648 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-11-09 07:39:53,649 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-11-09 07:39:53,649 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-09 07:39:53,649 INFO L85 PathProgramCache]: Analyzing trace with hash -1029157449, now seen corresponding path program 1 times [2024-11-09 07:39:53,649 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-09 07:39:53,650 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1270024365] [2024-11-09 07:39:53,650 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-09 07:39:53,650 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-09 07:39:53,663 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 07:39:53,713 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-11-09 07:39:53,714 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 07:39:53,716 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 9 [2024-11-09 07:39:53,716 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 07:39:53,718 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 14 [2024-11-09 07:39:53,719 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 07:39:53,720 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 19 [2024-11-09 07:39:53,721 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 07:39:53,722 INFO L134 CoverageAnalysis]: Checked inductivity of 26 backedges. 1 proven. 1 refuted. 0 times theorem prover too weak. 24 trivial. 0 not checked. [2024-11-09 07:39:53,722 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-09 07:39:53,722 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1270024365] [2024-11-09 07:39:53,722 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1270024365] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-09 07:39:53,722 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [646403632] [2024-11-09 07:39:53,723 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-09 07:39:53,723 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-09 07:39:53,723 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-09 07:39:53,725 INFO L229 MonitoredProcess]: Starting monitored process 5 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-11-09 07:39:53,726 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Waiting until timeout for monitored process [2024-11-09 07:39:53,813 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 07:39:53,815 INFO L255 TraceCheckSpWp]: Trace formula consists of 185 conjuncts, 4 conjuncts are in the unsatisfiable core [2024-11-09 07:39:53,816 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-09 07:39:53,824 INFO L134 CoverageAnalysis]: Checked inductivity of 26 backedges. 2 proven. 0 refuted. 0 times theorem prover too weak. 24 trivial. 0 not checked. [2024-11-09 07:39:53,824 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-11-09 07:39:53,825 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [646403632] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-09 07:39:53,825 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2024-11-09 07:39:53,825 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [6] total 6 [2024-11-09 07:39:53,825 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [492805737] [2024-11-09 07:39:53,825 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-09 07:39:53,825 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2024-11-09 07:39:53,826 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-09 07:39:53,827 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2024-11-09 07:39:53,827 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2024-11-09 07:39:53,827 INFO L87 Difference]: Start difference. First operand 116 states and 143 transitions. Second operand has 5 states, 5 states have (on average 3.4) internal successors, (17), 5 states have internal predecessors, (17), 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-11-09 07:39:53,862 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-09 07:39:53,862 INFO L93 Difference]: Finished difference Result 128 states and 160 transitions. [2024-11-09 07:39:53,862 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-11-09 07:39:53,863 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 3.4) internal successors, (17), 5 states have internal predecessors, (17), 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 34 [2024-11-09 07:39:53,863 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-09 07:39:53,864 INFO L225 Difference]: With dead ends: 128 [2024-11-09 07:39:53,864 INFO L226 Difference]: Without dead ends: 128 [2024-11-09 07:39:53,864 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 47 GetRequests, 43 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-11-09 07:39:53,864 INFO L432 NwaCegarLoop]: 92 mSDtfsCounter, 7 mSDsluCounter, 176 mSDsCounter, 0 mSdLazyCounter, 38 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 7 SdHoareTripleChecker+Valid, 268 SdHoareTripleChecker+Invalid, 38 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 38 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-11-09 07:39:53,865 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [7 Valid, 268 Invalid, 38 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 38 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-11-09 07:39:53,865 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 128 states. [2024-11-09 07:39:53,870 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 128 to 119. [2024-11-09 07:39:53,872 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 119 states, 76 states have (on average 1.618421052631579) internal successors, (123), 103 states have internal predecessors, (123), 12 states have call successors, (12), 3 states have call predecessors, (12), 3 states have return successors, (12), 12 states have call predecessors, (12), 12 states have call successors, (12) [2024-11-09 07:39:53,873 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 119 states to 119 states and 147 transitions. [2024-11-09 07:39:53,873 INFO L78 Accepts]: Start accepts. Automaton has 119 states and 147 transitions. Word has length 34 [2024-11-09 07:39:53,873 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-09 07:39:53,874 INFO L471 AbstractCegarLoop]: Abstraction has 119 states and 147 transitions. [2024-11-09 07:39:53,874 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 3.4) internal successors, (17), 5 states have internal predecessors, (17), 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-11-09 07:39:53,874 INFO L276 IsEmpty]: Start isEmpty. Operand 119 states and 147 transitions. [2024-11-09 07:39:53,874 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 35 [2024-11-09 07:39:53,874 INFO L207 NwaCegarLoop]: Found error trace [2024-11-09 07:39:53,875 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] [2024-11-09 07:39:53,893 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Ended with exit code 0 [2024-11-09 07:39:54,075 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-11-09 07:39:54,076 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-11-09 07:39:54,076 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-09 07:39:54,076 INFO L85 PathProgramCache]: Analyzing trace with hash -1027983781, now seen corresponding path program 1 times [2024-11-09 07:39:54,077 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-09 07:39:54,077 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1588517782] [2024-11-09 07:39:54,077 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-09 07:39:54,077 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-09 07:39:54,091 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 07:39:54,143 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-11-09 07:39:54,144 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 07:39:54,145 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 9 [2024-11-09 07:39:54,147 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 07:39:54,148 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 14 [2024-11-09 07:39:54,149 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 07:39:54,150 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 19 [2024-11-09 07:39:54,151 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 07:39:54,151 INFO L134 CoverageAnalysis]: Checked inductivity of 24 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 24 trivial. 0 not checked. [2024-11-09 07:39:54,152 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-09 07:39:54,152 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1588517782] [2024-11-09 07:39:54,152 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1588517782] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-09 07:39:54,152 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-09 07:39:54,152 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-11-09 07:39:54,152 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [965855666] [2024-11-09 07:39:54,152 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-09 07:39:54,154 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-09 07:39:54,154 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-09 07:39:54,154 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-09 07:39:54,155 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-09 07:39:54,155 INFO L87 Difference]: Start difference. First operand 119 states and 147 transitions. Second operand has 3 states, 2 states have (on average 8.5) internal successors, (17), 3 states have internal predecessors, (17), 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-11-09 07:39:54,193 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-09 07:39:54,193 INFO L93 Difference]: Finished difference Result 119 states and 147 transitions. [2024-11-09 07:39:54,193 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-09 07:39:54,194 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 2 states have (on average 8.5) internal successors, (17), 3 states have internal predecessors, (17), 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 34 [2024-11-09 07:39:54,194 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-09 07:39:54,195 INFO L225 Difference]: With dead ends: 119 [2024-11-09 07:39:54,195 INFO L226 Difference]: Without dead ends: 119 [2024-11-09 07:39:54,195 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-11-09 07:39:54,196 INFO L432 NwaCegarLoop]: 96 mSDtfsCounter, 8 mSDsluCounter, 56 mSDsCounter, 0 mSdLazyCounter, 34 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 8 SdHoareTripleChecker+Valid, 152 SdHoareTripleChecker+Invalid, 34 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 34 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-11-09 07:39:54,196 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [8 Valid, 152 Invalid, 34 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 34 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-11-09 07:39:54,196 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 119 states. [2024-11-09 07:39:54,201 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 119 to 118. [2024-11-09 07:39:54,202 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 118 states, 76 states have (on average 1.605263157894737) internal successors, (122), 102 states have internal predecessors, (122), 12 states have call successors, (12), 3 states have call predecessors, (12), 3 states have return successors, (12), 12 states have call predecessors, (12), 12 states have call successors, (12) [2024-11-09 07:39:54,203 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 118 states to 118 states and 146 transitions. [2024-11-09 07:39:54,203 INFO L78 Accepts]: Start accepts. Automaton has 118 states and 146 transitions. Word has length 34 [2024-11-09 07:39:54,203 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-09 07:39:54,204 INFO L471 AbstractCegarLoop]: Abstraction has 118 states and 146 transitions. [2024-11-09 07:39:54,204 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 2 states have (on average 8.5) internal successors, (17), 3 states have internal predecessors, (17), 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-11-09 07:39:54,204 INFO L276 IsEmpty]: Start isEmpty. Operand 118 states and 146 transitions. [2024-11-09 07:39:54,204 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 35 [2024-11-09 07:39:54,206 INFO L207 NwaCegarLoop]: Found error trace [2024-11-09 07:39:54,206 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] [2024-11-09 07:39:54,207 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9 [2024-11-09 07:39:54,207 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-11-09 07:39:54,207 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-09 07:39:54,207 INFO L85 PathProgramCache]: Analyzing trace with hash -1027983780, now seen corresponding path program 1 times [2024-11-09 07:39:54,207 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-09 07:39:54,208 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2018926295] [2024-11-09 07:39:54,208 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-09 07:39:54,208 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-09 07:39:54,224 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 07:39:54,319 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-11-09 07:39:54,320 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 07:39:54,322 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 9 [2024-11-09 07:39:54,323 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 07:39:54,324 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 14 [2024-11-09 07:39:54,325 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 07:39:54,326 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 19 [2024-11-09 07:39:54,326 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 07:39:54,327 INFO L134 CoverageAnalysis]: Checked inductivity of 24 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 24 trivial. 0 not checked. [2024-11-09 07:39:54,328 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-09 07:39:54,328 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2018926295] [2024-11-09 07:39:54,328 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2018926295] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-09 07:39:54,328 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-09 07:39:54,328 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-11-09 07:39:54,328 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [751028635] [2024-11-09 07:39:54,329 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-09 07:39:54,329 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-09 07:39:54,329 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-09 07:39:54,330 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-09 07:39:54,330 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-09 07:39:54,330 INFO L87 Difference]: Start difference. First operand 118 states and 146 transitions. Second operand has 3 states, 2 states have (on average 8.5) internal successors, (17), 3 states have internal predecessors, (17), 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-11-09 07:39:54,372 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-09 07:39:54,372 INFO L93 Difference]: Finished difference Result 118 states and 146 transitions. [2024-11-09 07:39:54,373 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-09 07:39:54,374 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 2 states have (on average 8.5) internal successors, (17), 3 states have internal predecessors, (17), 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 34 [2024-11-09 07:39:54,374 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-09 07:39:54,374 INFO L225 Difference]: With dead ends: 118 [2024-11-09 07:39:54,375 INFO L226 Difference]: Without dead ends: 118 [2024-11-09 07:39:54,375 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-11-09 07:39:54,375 INFO L432 NwaCegarLoop]: 94 mSDtfsCounter, 8 mSDsluCounter, 57 mSDsCounter, 0 mSdLazyCounter, 33 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 8 SdHoareTripleChecker+Valid, 151 SdHoareTripleChecker+Invalid, 33 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 33 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-11-09 07:39:54,376 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [8 Valid, 151 Invalid, 33 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 33 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-11-09 07:39:54,376 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 118 states. [2024-11-09 07:39:54,379 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 118 to 117. [2024-11-09 07:39:54,380 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 117 states, 76 states have (on average 1.5921052631578947) internal successors, (121), 101 states have internal predecessors, (121), 12 states have call successors, (12), 3 states have call predecessors, (12), 3 states have return successors, (12), 12 states have call predecessors, (12), 12 states have call successors, (12) [2024-11-09 07:39:54,380 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 117 states to 117 states and 145 transitions. [2024-11-09 07:39:54,381 INFO L78 Accepts]: Start accepts. Automaton has 117 states and 145 transitions. Word has length 34 [2024-11-09 07:39:54,381 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-09 07:39:54,381 INFO L471 AbstractCegarLoop]: Abstraction has 117 states and 145 transitions. [2024-11-09 07:39:54,381 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 2 states have (on average 8.5) internal successors, (17), 3 states have internal predecessors, (17), 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-11-09 07:39:54,381 INFO L276 IsEmpty]: Start isEmpty. Operand 117 states and 145 transitions. [2024-11-09 07:39:54,383 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 36 [2024-11-09 07:39:54,383 INFO L207 NwaCegarLoop]: Found error trace [2024-11-09 07:39:54,383 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-11-09 07:39:54,383 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10 [2024-11-09 07:39:54,384 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-11-09 07:39:54,384 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-09 07:39:54,384 INFO L85 PathProgramCache]: Analyzing trace with hash -1802726114, now seen corresponding path program 1 times [2024-11-09 07:39:54,384 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-09 07:39:54,384 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1889533332] [2024-11-09 07:39:54,385 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-09 07:39:54,385 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-09 07:39:54,398 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 07:39:54,472 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-11-09 07:39:54,473 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 07:39:54,475 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 9 [2024-11-09 07:39:54,476 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 07:39:54,477 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 14 [2024-11-09 07:39:54,478 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 07:39:54,479 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 19 [2024-11-09 07:39:54,480 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 07:39:54,482 INFO L134 CoverageAnalysis]: Checked inductivity of 24 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 24 trivial. 0 not checked. [2024-11-09 07:39:54,483 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-09 07:39:54,483 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1889533332] [2024-11-09 07:39:54,483 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1889533332] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-09 07:39:54,483 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-09 07:39:54,483 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-11-09 07:39:54,483 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1633091899] [2024-11-09 07:39:54,484 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-09 07:39:54,487 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-09 07:39:54,487 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-09 07:39:54,487 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-09 07:39:54,487 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-09 07:39:54,488 INFO L87 Difference]: Start difference. First operand 117 states and 145 transitions. Second operand has 3 states, 2 states have (on average 9.0) internal successors, (18), 3 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-11-09 07:39:54,531 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-09 07:39:54,531 INFO L93 Difference]: Finished difference Result 117 states and 145 transitions. [2024-11-09 07:39:54,532 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-09 07:39:54,532 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 2 states have (on average 9.0) internal successors, (18), 3 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-11-09 07:39:54,532 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-09 07:39:54,533 INFO L225 Difference]: With dead ends: 117 [2024-11-09 07:39:54,533 INFO L226 Difference]: Without dead ends: 117 [2024-11-09 07:39:54,533 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-11-09 07:39:54,534 INFO L432 NwaCegarLoop]: 93 mSDtfsCounter, 8 mSDsluCounter, 55 mSDsCounter, 0 mSdLazyCounter, 33 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 8 SdHoareTripleChecker+Valid, 148 SdHoareTripleChecker+Invalid, 33 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 33 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-11-09 07:39:54,534 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [8 Valid, 148 Invalid, 33 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 33 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-11-09 07:39:54,535 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 117 states. [2024-11-09 07:39:54,537 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 117 to 116. [2024-11-09 07:39:54,538 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 116 states, 76 states have (on average 1.5789473684210527) internal successors, (120), 100 states have internal predecessors, (120), 12 states have call successors, (12), 3 states have call predecessors, (12), 3 states have return successors, (12), 12 states have call predecessors, (12), 12 states have call successors, (12) [2024-11-09 07:39:54,538 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 116 states to 116 states and 144 transitions. [2024-11-09 07:39:54,539 INFO L78 Accepts]: Start accepts. Automaton has 116 states and 144 transitions. Word has length 35 [2024-11-09 07:39:54,539 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-09 07:39:54,539 INFO L471 AbstractCegarLoop]: Abstraction has 116 states and 144 transitions. [2024-11-09 07:39:54,539 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 2 states have (on average 9.0) internal successors, (18), 3 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-11-09 07:39:54,539 INFO L276 IsEmpty]: Start isEmpty. Operand 116 states and 144 transitions. [2024-11-09 07:39:54,540 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 36 [2024-11-09 07:39:54,540 INFO L207 NwaCegarLoop]: Found error trace [2024-11-09 07:39:54,540 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-11-09 07:39:54,540 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable11 [2024-11-09 07:39:54,541 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-11-09 07:39:54,541 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-09 07:39:54,541 INFO L85 PathProgramCache]: Analyzing trace with hash -1802726113, now seen corresponding path program 1 times [2024-11-09 07:39:54,541 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-09 07:39:54,541 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [580634439] [2024-11-09 07:39:54,542 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-09 07:39:54,542 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-09 07:39:54,556 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 07:39:54,637 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-11-09 07:39:54,638 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 07:39:54,639 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 9 [2024-11-09 07:39:54,640 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 07:39:54,641 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 14 [2024-11-09 07:39:54,642 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 07:39:54,643 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 19 [2024-11-09 07:39:54,644 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 07:39:54,645 INFO L134 CoverageAnalysis]: Checked inductivity of 24 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 24 trivial. 0 not checked. [2024-11-09 07:39:54,645 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-09 07:39:54,645 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [580634439] [2024-11-09 07:39:54,645 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [580634439] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-09 07:39:54,646 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-09 07:39:54,646 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-11-09 07:39:54,646 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1150177500] [2024-11-09 07:39:54,646 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-09 07:39:54,646 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-09 07:39:54,647 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-09 07:39:54,647 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-09 07:39:54,647 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-09 07:39:54,648 INFO L87 Difference]: Start difference. First operand 116 states and 144 transitions. Second operand has 3 states, 2 states have (on average 9.0) internal successors, (18), 3 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-11-09 07:39:54,692 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-09 07:39:54,692 INFO L93 Difference]: Finished difference Result 116 states and 144 transitions. [2024-11-09 07:39:54,693 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-09 07:39:54,693 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 2 states have (on average 9.0) internal successors, (18), 3 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-11-09 07:39:54,693 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-09 07:39:54,694 INFO L225 Difference]: With dead ends: 116 [2024-11-09 07:39:54,694 INFO L226 Difference]: Without dead ends: 116 [2024-11-09 07:39:54,694 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-11-09 07:39:54,695 INFO L432 NwaCegarLoop]: 91 mSDtfsCounter, 8 mSDsluCounter, 56 mSDsCounter, 0 mSdLazyCounter, 32 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 8 SdHoareTripleChecker+Valid, 147 SdHoareTripleChecker+Invalid, 32 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 32 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-11-09 07:39:54,695 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [8 Valid, 147 Invalid, 32 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 32 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-11-09 07:39:54,696 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 116 states. [2024-11-09 07:39:54,698 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 116 to 115. [2024-11-09 07:39:54,699 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 115 states, 76 states have (on average 1.5657894736842106) internal successors, (119), 99 states have internal predecessors, (119), 12 states have call successors, (12), 3 states have call predecessors, (12), 3 states have return successors, (12), 12 states have call predecessors, (12), 12 states have call successors, (12) [2024-11-09 07:39:54,699 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 115 states to 115 states and 143 transitions. [2024-11-09 07:39:54,699 INFO L78 Accepts]: Start accepts. Automaton has 115 states and 143 transitions. Word has length 35 [2024-11-09 07:39:54,700 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-09 07:39:54,700 INFO L471 AbstractCegarLoop]: Abstraction has 115 states and 143 transitions. [2024-11-09 07:39:54,700 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 2 states have (on average 9.0) internal successors, (18), 3 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-11-09 07:39:54,700 INFO L276 IsEmpty]: Start isEmpty. Operand 115 states and 143 transitions. [2024-11-09 07:39:54,701 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 39 [2024-11-09 07:39:54,701 INFO L207 NwaCegarLoop]: Found error trace [2024-11-09 07:39:54,702 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] [2024-11-09 07:39:54,702 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable12 [2024-11-09 07:39:54,702 INFO L396 AbstractCegarLoop]: === Iteration 14 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONMEMORY_LEAK === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 34 more)] === [2024-11-09 07:39:54,702 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-09 07:39:54,702 INFO L85 PathProgramCache]: Analyzing trace with hash 1032731137, now seen corresponding path program 1 times [2024-11-09 07:39:54,702 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-09 07:39:54,703 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1348646394] [2024-11-09 07:39:54,703 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-09 07:39:54,703 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-09 07:39:54,718 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 07:39:54,993 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-11-09 07:39:54,994 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 07:39:54,996 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 9 [2024-11-09 07:39:54,997 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 07:39:55,002 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 14 [2024-11-09 07:39:55,003 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 07:39:55,007 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 19 [2024-11-09 07:39:55,010 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 07:39:55,041 INFO L134 CoverageAnalysis]: Checked inductivity of 25 backedges. 10 proven. 0 refuted. 0 times theorem prover too weak. 15 trivial. 0 not checked. [2024-11-09 07:39:55,041 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-09 07:39:55,042 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1348646394] [2024-11-09 07:39:55,042 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1348646394] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-09 07:39:55,042 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-09 07:39:55,042 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [12] imperfect sequences [] total 12 [2024-11-09 07:39:55,042 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [885523662] [2024-11-09 07:39:55,042 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-09 07:39:55,043 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 12 states [2024-11-09 07:39:55,043 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-09 07:39:55,043 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2024-11-09 07:39:55,043 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=24, Invalid=108, Unknown=0, NotChecked=0, Total=132 [2024-11-09 07:39:55,044 INFO L87 Difference]: Start difference. First operand 115 states and 143 transitions. Second operand has 12 states, 10 states have (on average 2.3) internal successors, (23), 11 states have internal predecessors, (23), 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-11-09 07:39:55,381 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-09 07:39:55,382 INFO L93 Difference]: Finished difference Result 133 states and 148 transitions. [2024-11-09 07:39:55,382 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2024-11-09 07:39:55,383 INFO L78 Accepts]: Start accepts. Automaton has has 12 states, 10 states have (on average 2.3) internal successors, (23), 11 states have internal predecessors, (23), 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 38 [2024-11-09 07:39:55,383 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-09 07:39:55,384 INFO L225 Difference]: With dead ends: 133 [2024-11-09 07:39:55,384 INFO L226 Difference]: Without dead ends: 133 [2024-11-09 07:39:55,384 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 24 GetRequests, 10 SyntacticMatches, 0 SemanticMatches, 14 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 26 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=44, Invalid=196, Unknown=0, NotChecked=0, Total=240 [2024-11-09 07:39:55,385 INFO L432 NwaCegarLoop]: 77 mSDtfsCounter, 91 mSDsluCounter, 513 mSDsCounter, 0 mSdLazyCounter, 325 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 98 SdHoareTripleChecker+Valid, 590 SdHoareTripleChecker+Invalid, 326 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 325 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2024-11-09 07:39:55,385 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [98 Valid, 590 Invalid, 326 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 325 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2024-11-09 07:39:55,386 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 133 states. [2024-11-09 07:39:55,389 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 133 to 115. [2024-11-09 07:39:55,389 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 115 states, 76 states have (on average 1.5526315789473684) internal successors, (118), 99 states have internal predecessors, (118), 12 states have call successors, (12), 3 states have call predecessors, (12), 3 states have return successors, (12), 12 states have call predecessors, (12), 12 states have call successors, (12) [2024-11-09 07:39:55,390 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 115 states to 115 states and 142 transitions. [2024-11-09 07:39:55,390 INFO L78 Accepts]: Start accepts. Automaton has 115 states and 142 transitions. Word has length 38 [2024-11-09 07:39:55,390 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-09 07:39:55,390 INFO L471 AbstractCegarLoop]: Abstraction has 115 states and 142 transitions. [2024-11-09 07:39:55,393 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 12 states, 10 states have (on average 2.3) internal successors, (23), 11 states have internal predecessors, (23), 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-11-09 07:39:55,393 INFO L276 IsEmpty]: Start isEmpty. Operand 115 states and 142 transitions. [2024-11-09 07:39:55,393 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 38 [2024-11-09 07:39:55,395 INFO L207 NwaCegarLoop]: Found error trace [2024-11-09 07:39:55,396 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, 1, 1] [2024-11-09 07:39:55,396 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable13 [2024-11-09 07:39:55,396 INFO L396 AbstractCegarLoop]: === Iteration 15 === Targeting ULTIMATE.startErr7REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 34 more)] === [2024-11-09 07:39:55,396 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-09 07:39:55,396 INFO L85 PathProgramCache]: Analyzing trace with hash -1539377740, now seen corresponding path program 1 times [2024-11-09 07:39:55,396 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-09 07:39:55,397 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [823892071] [2024-11-09 07:39:55,397 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-09 07:39:55,397 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-09 07:39:55,444 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 07:39:55,955 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-11-09 07:39:55,957 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 07:39:55,993 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 9 [2024-11-09 07:39:55,995 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 07:39:56,000 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 14 [2024-11-09 07:39:56,001 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 07:39:56,006 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 19 [2024-11-09 07:39:56,007 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 07:39:56,011 INFO L134 CoverageAnalysis]: Checked inductivity of 27 backedges. 0 proven. 12 refuted. 0 times theorem prover too weak. 15 trivial. 0 not checked. [2024-11-09 07:39:56,012 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-09 07:39:56,012 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [823892071] [2024-11-09 07:39:56,012 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [823892071] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-09 07:39:56,012 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [40377411] [2024-11-09 07:39:56,012 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-09 07:39:56,012 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-09 07:39:56,012 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-09 07:39:56,015 INFO L229 MonitoredProcess]: Starting monitored process 6 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-11-09 07:39:56,016 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (6)] Waiting until timeout for monitored process [2024-11-09 07:39:56,117 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 07:39:56,122 INFO L255 TraceCheckSpWp]: Trace formula consists of 201 conjuncts, 63 conjuncts are in the unsatisfiable core [2024-11-09 07:39:56,126 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-09 07:39:56,135 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-11-09 07:39:56,891 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 13 treesize of output 9 [2024-11-09 07:39:57,040 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-11-09 07:39:57,042 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 19 treesize of output 19 [2024-11-09 07:39:57,174 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-11-09 07:39:57,175 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-11-09 07:39:57,181 INFO L349 Elim1Store]: treesize reduction 7, result has 12.5 percent of original size [2024-11-09 07:39:57,181 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 2 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 62 treesize of output 50 [2024-11-09 07:39:57,210 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-11-09 07:39:57,211 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-11-09 07:39:57,228 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-11-09 07:39:57,229 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-11-09 07:39:57,231 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-11-09 07:39:57,242 INFO L349 Elim1Store]: treesize reduction 21, result has 30.0 percent of original size [2024-11-09 07:39:57,242 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 4 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 2 case distinctions, treesize of input 67 treesize of output 54 [2024-11-09 07:39:57,265 INFO L349 Elim1Store]: treesize reduction 4, result has 50.0 percent of original size [2024-11-09 07:39:57,266 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 11 treesize of output 11 [2024-11-09 07:39:58,049 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-11-09 07:39:58,049 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 6 select indices, 6 select index equivalence classes, 1 disjoint index pairs (out of 15 index pairs), introduced 6 new quantified variables, introduced 15 case distinctions, treesize of input 153 treesize of output 233 [2024-11-09 07:40:41,858 INFO L134 CoverageAnalysis]: Checked inductivity of 27 backedges. 18 proven. 3 refuted. 0 times theorem prover too weak. 6 trivial. 0 not checked. [2024-11-09 07:40:41,859 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-11-09 07:40:42,379 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-11-09 07:40:42,379 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-11-09 07:40:42,428 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-11-09 07:40:42,428 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 385 treesize of output 345 [2024-11-09 07:40:43,245 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [40377411] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-09 07:40:43,245 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2024-11-09 07:40:43,245 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [14, 15] total 28 [2024-11-09 07:40:43,245 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [998242265] [2024-11-09 07:40:43,245 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2024-11-09 07:40:43,246 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 29 states [2024-11-09 07:40:43,246 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-09 07:40:43,246 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 29 interpolants. [2024-11-09 07:40:43,247 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=130, Invalid=1352, Unknown=0, NotChecked=0, Total=1482 [2024-11-09 07:40:43,247 INFO L87 Difference]: Start difference. First operand 115 states and 142 transitions. Second operand has 29 states, 27 states have (on average 1.6296296296296295) internal successors, (44), 28 states have internal predecessors, (44), 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-11-09 07:40:46,570 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-09 07:40:46,571 INFO L93 Difference]: Finished difference Result 146 states and 163 transitions. [2024-11-09 07:40:46,571 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 25 states. [2024-11-09 07:40:46,571 INFO L78 Accepts]: Start accepts. Automaton has has 29 states, 27 states have (on average 1.6296296296296295) internal successors, (44), 28 states have internal predecessors, (44), 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 37 [2024-11-09 07:40:46,571 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-09 07:40:46,572 INFO L225 Difference]: With dead ends: 146 [2024-11-09 07:40:46,572 INFO L226 Difference]: Without dead ends: 146 [2024-11-09 07:40:46,573 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 86 GetRequests, 30 SyntacticMatches, 4 SemanticMatches, 52 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 666 ImplicationChecksByTransitivity, 3.8s TimeCoverageRelationStatistics Valid=362, Invalid=2500, Unknown=0, NotChecked=0, Total=2862 [2024-11-09 07:40:46,574 INFO L432 NwaCegarLoop]: 39 mSDtfsCounter, 279 mSDsluCounter, 551 mSDsCounter, 0 mSdLazyCounter, 1502 mSolverCounterSat, 29 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 282 SdHoareTripleChecker+Valid, 590 SdHoareTripleChecker+Invalid, 1531 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 29 IncrementalHoareTripleChecker+Valid, 1502 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.3s IncrementalHoareTripleChecker+Time [2024-11-09 07:40:46,574 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [282 Valid, 590 Invalid, 1531 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [29 Valid, 1502 Invalid, 0 Unknown, 0 Unchecked, 1.3s Time] [2024-11-09 07:40:46,574 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 146 states. [2024-11-09 07:40:46,578 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 146 to 103. [2024-11-09 07:40:46,579 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 103 states, 67 states have (on average 1.4477611940298507) internal successors, (97), 89 states have internal predecessors, (97), 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-11-09 07:40:46,579 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 103 states to 103 states and 115 transitions. [2024-11-09 07:40:46,579 INFO L78 Accepts]: Start accepts. Automaton has 103 states and 115 transitions. Word has length 37 [2024-11-09 07:40:46,579 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-09 07:40:46,579 INFO L471 AbstractCegarLoop]: Abstraction has 103 states and 115 transitions. [2024-11-09 07:40:46,580 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 29 states, 27 states have (on average 1.6296296296296295) internal successors, (44), 28 states have internal predecessors, (44), 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-11-09 07:40:46,580 INFO L276 IsEmpty]: Start isEmpty. Operand 103 states and 115 transitions. [2024-11-09 07:40:46,580 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 40 [2024-11-09 07:40:46,580 INFO L207 NwaCegarLoop]: Found error trace [2024-11-09 07:40:46,580 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, 1, 1, 1, 1] [2024-11-09 07:40:46,600 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (6)] Forceful destruction successful, exit code 0 [2024-11-09 07:40:46,781 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,SelfDestructingSolverStorable14 [2024-11-09 07:40:46,781 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-11-09 07:40:46,782 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-09 07:40:46,782 INFO L85 PathProgramCache]: Analyzing trace with hash -1874432272, now seen corresponding path program 1 times [2024-11-09 07:40:46,782 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-09 07:40:46,782 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1814348624] [2024-11-09 07:40:46,782 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-09 07:40:46,782 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-09 07:40:46,799 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 07:40:46,860 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-11-09 07:40:46,861 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 07:40:46,862 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 9 [2024-11-09 07:40:46,862 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 07:40:46,863 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 14 [2024-11-09 07:40:46,864 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 07:40:46,865 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 19 [2024-11-09 07:40:46,865 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 07:40:46,866 INFO L134 CoverageAnalysis]: Checked inductivity of 29 backedges. 2 proven. 3 refuted. 0 times theorem prover too weak. 24 trivial. 0 not checked. [2024-11-09 07:40:46,867 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-09 07:40:46,867 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1814348624] [2024-11-09 07:40:46,867 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1814348624] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-09 07:40:46,867 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [2001674927] [2024-11-09 07:40:46,867 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-09 07:40:46,867 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-09 07:40:46,867 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-09 07:40:46,869 INFO L229 MonitoredProcess]: Starting monitored process 7 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-11-09 07:40:46,870 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (7)] Waiting until timeout for monitored process [2024-11-09 07:40:46,966 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 07:40:46,968 INFO L255 TraceCheckSpWp]: Trace formula consists of 201 conjuncts, 6 conjuncts are in the unsatisfiable core [2024-11-09 07:40:46,970 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-09 07:40:47,002 INFO L134 CoverageAnalysis]: Checked inductivity of 29 backedges. 2 proven. 3 refuted. 0 times theorem prover too weak. 24 trivial. 0 not checked. [2024-11-09 07:40:47,003 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-11-09 07:40:47,045 INFO L134 CoverageAnalysis]: Checked inductivity of 29 backedges. 2 proven. 3 refuted. 0 times theorem prover too weak. 24 trivial. 0 not checked. [2024-11-09 07:40:47,046 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [2001674927] provided 0 perfect and 2 imperfect interpolant sequences [2024-11-09 07:40:47,046 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2024-11-09 07:40:47,046 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 7, 7] total 7 [2024-11-09 07:40:47,046 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1596839498] [2024-11-09 07:40:47,046 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2024-11-09 07:40:47,046 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2024-11-09 07:40:47,047 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-09 07:40:47,047 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2024-11-09 07:40:47,047 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=29, Unknown=0, NotChecked=0, Total=42 [2024-11-09 07:40:47,047 INFO L87 Difference]: Start difference. First operand 103 states and 115 transitions. Second operand has 7 states, 7 states have (on average 3.142857142857143) internal successors, (22), 7 states have internal predecessors, (22), 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-11-09 07:40:47,112 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-09 07:40:47,112 INFO L93 Difference]: Finished difference Result 126 states and 149 transitions. [2024-11-09 07:40:47,112 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2024-11-09 07:40:47,113 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 3.142857142857143) internal successors, (22), 7 states have internal predecessors, (22), 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 39 [2024-11-09 07:40:47,113 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-09 07:40:47,113 INFO L225 Difference]: With dead ends: 126 [2024-11-09 07:40:47,114 INFO L226 Difference]: Without dead ends: 126 [2024-11-09 07:40:47,114 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 92 GetRequests, 82 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-11-09 07:40:47,114 INFO L432 NwaCegarLoop]: 86 mSDtfsCounter, 9 mSDsluCounter, 332 mSDsCounter, 0 mSdLazyCounter, 74 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 9 SdHoareTripleChecker+Valid, 418 SdHoareTripleChecker+Invalid, 75 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 74 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-11-09 07:40:47,114 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [9 Valid, 418 Invalid, 75 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 74 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-11-09 07:40:47,115 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 126 states. [2024-11-09 07:40:47,117 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 126 to 116. [2024-11-09 07:40:47,118 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 116 states, 80 states have (on average 1.4625) internal successors, (117), 102 states have internal predecessors, (117), 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-11-09 07:40:47,118 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 116 states to 116 states and 135 transitions. [2024-11-09 07:40:47,118 INFO L78 Accepts]: Start accepts. Automaton has 116 states and 135 transitions. Word has length 39 [2024-11-09 07:40:47,118 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-09 07:40:47,119 INFO L471 AbstractCegarLoop]: Abstraction has 116 states and 135 transitions. [2024-11-09 07:40:47,119 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 3.142857142857143) internal successors, (22), 7 states have internal predecessors, (22), 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-11-09 07:40:47,119 INFO L276 IsEmpty]: Start isEmpty. Operand 116 states and 135 transitions. [2024-11-09 07:40:47,119 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 42 [2024-11-09 07:40:47,119 INFO L207 NwaCegarLoop]: Found error trace [2024-11-09 07:40:47,119 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, 1, 1] [2024-11-09 07:40:47,135 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (7)] Ended with exit code 0 [2024-11-09 07:40:47,320 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-11-09 07:40:47,320 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-11-09 07:40:47,320 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-09 07:40:47,321 INFO L85 PathProgramCache]: Analyzing trace with hash 1633101304, now seen corresponding path program 1 times [2024-11-09 07:40:47,321 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-09 07:40:47,321 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [14843277] [2024-11-09 07:40:47,321 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-09 07:40:47,321 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-09 07:40:47,335 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 07:40:47,387 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-11-09 07:40:47,388 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 07:40:47,389 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 9 [2024-11-09 07:40:47,390 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 07:40:47,390 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 14 [2024-11-09 07:40:47,391 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 07:40:47,392 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 19 [2024-11-09 07:40:47,392 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 07:40:47,393 INFO L134 CoverageAnalysis]: Checked inductivity of 24 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 24 trivial. 0 not checked. [2024-11-09 07:40:47,393 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-09 07:40:47,393 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [14843277] [2024-11-09 07:40:47,394 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [14843277] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-09 07:40:47,394 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-09 07:40:47,394 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2024-11-09 07:40:47,394 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1555254555] [2024-11-09 07:40:47,394 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-09 07:40:47,395 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2024-11-09 07:40:47,395 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-09 07:40:47,396 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2024-11-09 07:40:47,396 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2024-11-09 07:40:47,396 INFO L87 Difference]: Start difference. First operand 116 states and 135 transitions. Second operand has 6 states, 5 states have (on average 4.6) internal successors, (23), 5 states have internal predecessors, (23), 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-11-09 07:40:47,431 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-09 07:40:47,431 INFO L93 Difference]: Finished difference Result 170 states and 194 transitions. [2024-11-09 07:40:47,431 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2024-11-09 07:40:47,432 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 5 states have (on average 4.6) internal successors, (23), 5 states have internal predecessors, (23), 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 41 [2024-11-09 07:40:47,432 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-09 07:40:47,433 INFO L225 Difference]: With dead ends: 170 [2024-11-09 07:40:47,433 INFO L226 Difference]: Without dead ends: 170 [2024-11-09 07:40:47,433 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-11-09 07:40:47,434 INFO L432 NwaCegarLoop]: 105 mSDtfsCounter, 48 mSDsluCounter, 399 mSDsCounter, 0 mSdLazyCounter, 28 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 53 SdHoareTripleChecker+Valid, 504 SdHoareTripleChecker+Invalid, 28 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 28 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-11-09 07:40:47,434 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [53 Valid, 504 Invalid, 28 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 28 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-11-09 07:40:47,434 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 170 states. [2024-11-09 07:40:47,440 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 170 to 122. [2024-11-09 07:40:47,440 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 122 states, 84 states have (on average 1.4404761904761905) internal successors, (121), 107 states have internal predecessors, (121), 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-11-09 07:40:47,441 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 122 states to 122 states and 141 transitions. [2024-11-09 07:40:47,441 INFO L78 Accepts]: Start accepts. Automaton has 122 states and 141 transitions. Word has length 41 [2024-11-09 07:40:47,442 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-09 07:40:47,442 INFO L471 AbstractCegarLoop]: Abstraction has 122 states and 141 transitions. [2024-11-09 07:40:47,443 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 5 states have (on average 4.6) internal successors, (23), 5 states have internal predecessors, (23), 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-11-09 07:40:47,443 INFO L276 IsEmpty]: Start isEmpty. Operand 122 states and 141 transitions. [2024-11-09 07:40:47,443 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 44 [2024-11-09 07:40:47,443 INFO L207 NwaCegarLoop]: Found error trace [2024-11-09 07:40:47,443 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, 1, 1, 1, 1] [2024-11-09 07:40:47,444 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable16 [2024-11-09 07:40:47,444 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-11-09 07:40:47,444 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-09 07:40:47,444 INFO L85 PathProgramCache]: Analyzing trace with hash 1747480581, now seen corresponding path program 1 times [2024-11-09 07:40:47,444 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-09 07:40:47,445 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [637198462] [2024-11-09 07:40:47,445 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-09 07:40:47,445 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-09 07:40:47,458 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 07:40:47,505 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-11-09 07:40:47,506 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 07:40:47,507 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 9 [2024-11-09 07:40:47,507 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 07:40:47,508 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 14 [2024-11-09 07:40:47,509 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 07:40:47,511 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 19 [2024-11-09 07:40:47,512 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 07:40:47,513 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 37 [2024-11-09 07:40:47,514 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 07:40:47,515 INFO L134 CoverageAnalysis]: Checked inductivity of 24 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 24 trivial. 0 not checked. [2024-11-09 07:40:47,515 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-09 07:40:47,515 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [637198462] [2024-11-09 07:40:47,515 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [637198462] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-09 07:40:47,516 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-09 07:40:47,516 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-11-09 07:40:47,516 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1403744254] [2024-11-09 07:40:47,516 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-09 07:40:47,516 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-11-09 07:40:47,516 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-09 07:40:47,516 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-11-09 07:40:47,516 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-11-09 07:40:47,517 INFO L87 Difference]: Start difference. First operand 122 states and 141 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, (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-11-09 07:40:47,593 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-09 07:40:47,593 INFO L93 Difference]: Finished difference Result 118 states and 137 transitions. [2024-11-09 07:40:47,594 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-11-09 07:40:47,594 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, (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 43 [2024-11-09 07:40:47,594 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-09 07:40:47,596 INFO L225 Difference]: With dead ends: 118 [2024-11-09 07:40:47,596 INFO L226 Difference]: Without dead ends: 118 [2024-11-09 07:40:47,596 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-11-09 07:40:47,597 INFO L432 NwaCegarLoop]: 70 mSDtfsCounter, 56 mSDsluCounter, 68 mSDsCounter, 0 mSdLazyCounter, 68 mSolverCounterSat, 4 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 60 SdHoareTripleChecker+Valid, 138 SdHoareTripleChecker+Invalid, 72 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 4 IncrementalHoareTripleChecker+Valid, 68 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-11-09 07:40:47,597 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [60 Valid, 138 Invalid, 72 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [4 Valid, 68 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-11-09 07:40:47,597 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 118 states. [2024-11-09 07:40:47,600 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 118 to 118. [2024-11-09 07:40:47,601 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 118 states, 84 states have (on average 1.3928571428571428) internal successors, (117), 103 states have internal predecessors, (117), 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-11-09 07:40:47,602 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 118 states to 118 states and 137 transitions. [2024-11-09 07:40:47,602 INFO L78 Accepts]: Start accepts. Automaton has 118 states and 137 transitions. Word has length 43 [2024-11-09 07:40:47,603 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-09 07:40:47,603 INFO L471 AbstractCegarLoop]: Abstraction has 118 states and 137 transitions. [2024-11-09 07:40:47,603 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, (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-11-09 07:40:47,603 INFO L276 IsEmpty]: Start isEmpty. Operand 118 states and 137 transitions. [2024-11-09 07:40:47,603 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 44 [2024-11-09 07:40:47,603 INFO L207 NwaCegarLoop]: Found error trace [2024-11-09 07:40:47,604 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, 1, 1, 1, 1] [2024-11-09 07:40:47,604 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable17 [2024-11-09 07:40:47,604 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-11-09 07:40:47,604 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-09 07:40:47,604 INFO L85 PathProgramCache]: Analyzing trace with hash 1747480582, now seen corresponding path program 1 times [2024-11-09 07:40:47,604 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-09 07:40:47,604 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [682929427] [2024-11-09 07:40:47,605 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-09 07:40:47,605 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-09 07:40:47,619 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 07:40:47,691 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-11-09 07:40:47,692 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 07:40:47,693 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 9 [2024-11-09 07:40:47,694 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 07:40:47,695 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 14 [2024-11-09 07:40:47,695 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 07:40:47,696 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 19 [2024-11-09 07:40:47,696 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 07:40:47,697 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 37 [2024-11-09 07:40:47,698 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 07:40:47,699 INFO L134 CoverageAnalysis]: Checked inductivity of 24 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 24 trivial. 0 not checked. [2024-11-09 07:40:47,700 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-09 07:40:47,700 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [682929427] [2024-11-09 07:40:47,700 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [682929427] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-09 07:40:47,700 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-09 07:40:47,700 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-11-09 07:40:47,700 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [898800801] [2024-11-09 07:40:47,700 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-09 07:40:47,700 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-11-09 07:40:47,700 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-09 07:40:47,701 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-11-09 07:40:47,701 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-11-09 07:40:47,701 INFO L87 Difference]: Start difference. First operand 118 states and 137 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, (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-11-09 07:40:47,776 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-09 07:40:47,776 INFO L93 Difference]: Finished difference Result 114 states and 133 transitions. [2024-11-09 07:40:47,777 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-11-09 07:40:47,777 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, (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 43 [2024-11-09 07:40:47,777 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-09 07:40:47,778 INFO L225 Difference]: With dead ends: 114 [2024-11-09 07:40:47,778 INFO L226 Difference]: Without dead ends: 114 [2024-11-09 07:40:47,778 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-11-09 07:40:47,778 INFO L432 NwaCegarLoop]: 73 mSDtfsCounter, 44 mSDsluCounter, 67 mSDsCounter, 0 mSdLazyCounter, 67 mSolverCounterSat, 4 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 47 SdHoareTripleChecker+Valid, 140 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-11-09 07:40:47,779 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [47 Valid, 140 Invalid, 71 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [4 Valid, 67 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-11-09 07:40:47,780 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 114 states. [2024-11-09 07:40:47,784 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 114 to 114. [2024-11-09 07:40:47,784 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 114 states, 84 states have (on average 1.3452380952380953) 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-11-09 07:40:47,785 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 114 states to 114 states and 133 transitions. [2024-11-09 07:40:47,785 INFO L78 Accepts]: Start accepts. Automaton has 114 states and 133 transitions. Word has length 43 [2024-11-09 07:40:47,785 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-09 07:40:47,785 INFO L471 AbstractCegarLoop]: Abstraction has 114 states and 133 transitions. [2024-11-09 07:40:47,785 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, (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-11-09 07:40:47,785 INFO L276 IsEmpty]: Start isEmpty. Operand 114 states and 133 transitions. [2024-11-09 07:40:47,785 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 44 [2024-11-09 07:40:47,785 INFO L207 NwaCegarLoop]: Found error trace [2024-11-09 07:40:47,786 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, 1, 1, 1, 1] [2024-11-09 07:40:47,786 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable18 [2024-11-09 07:40:47,786 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-11-09 07:40:47,786 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-09 07:40:47,786 INFO L85 PathProgramCache]: Analyzing trace with hash -531163462, now seen corresponding path program 1 times [2024-11-09 07:40:47,786 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-09 07:40:47,786 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [440757335] [2024-11-09 07:40:47,787 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-09 07:40:47,787 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-09 07:40:47,800 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 07:40:47,845 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-11-09 07:40:47,846 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 07:40:47,847 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 9 [2024-11-09 07:40:47,848 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 07:40:47,849 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 14 [2024-11-09 07:40:47,850 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 07:40:47,851 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 19 [2024-11-09 07:40:47,852 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 07:40:47,853 INFO L134 CoverageAnalysis]: Checked inductivity of 26 backedges. 1 proven. 1 refuted. 0 times theorem prover too weak. 24 trivial. 0 not checked. [2024-11-09 07:40:47,853 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-09 07:40:47,853 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [440757335] [2024-11-09 07:40:47,853 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [440757335] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-09 07:40:47,853 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [433391854] [2024-11-09 07:40:47,853 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-09 07:40:47,853 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-09 07:40:47,853 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-09 07:40:47,855 INFO L229 MonitoredProcess]: Starting monitored process 8 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-11-09 07:40:47,857 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (8)] Waiting until timeout for monitored process [2024-11-09 07:40:47,958 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 07:40:47,960 INFO L255 TraceCheckSpWp]: Trace formula consists of 212 conjuncts, 4 conjuncts are in the unsatisfiable core [2024-11-09 07:40:47,961 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-09 07:40:47,978 INFO L134 CoverageAnalysis]: Checked inductivity of 26 backedges. 1 proven. 1 refuted. 0 times theorem prover too weak. 24 trivial. 0 not checked. [2024-11-09 07:40:47,979 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-11-09 07:40:48,014 INFO L134 CoverageAnalysis]: Checked inductivity of 26 backedges. 1 proven. 1 refuted. 0 times theorem prover too weak. 24 trivial. 0 not checked. [2024-11-09 07:40:48,014 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [433391854] provided 0 perfect and 2 imperfect interpolant sequences [2024-11-09 07:40:48,015 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2024-11-09 07:40:48,015 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [5, 5, 5] total 5 [2024-11-09 07:40:48,015 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1137509866] [2024-11-09 07:40:48,015 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2024-11-09 07:40:48,015 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2024-11-09 07:40:48,015 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-09 07:40:48,016 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2024-11-09 07:40:48,016 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2024-11-09 07:40:48,016 INFO L87 Difference]: Start difference. First operand 114 states and 133 transitions. Second operand has 5 states, 5 states have (on average 5.0) internal successors, (25), 5 states have internal predecessors, (25), 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-11-09 07:40:48,055 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-09 07:40:48,055 INFO L93 Difference]: Finished difference Result 114 states and 131 transitions. [2024-11-09 07:40:48,056 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2024-11-09 07:40:48,056 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 5.0) internal successors, (25), 5 states have internal predecessors, (25), 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 43 [2024-11-09 07:40:48,056 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-09 07:40:48,056 INFO L225 Difference]: With dead ends: 114 [2024-11-09 07:40:48,057 INFO L226 Difference]: Without dead ends: 114 [2024-11-09 07:40:48,057 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 99 GetRequests, 91 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-11-09 07:40:48,058 INFO L432 NwaCegarLoop]: 79 mSDtfsCounter, 10 mSDsluCounter, 145 mSDsCounter, 0 mSdLazyCounter, 30 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 10 SdHoareTripleChecker+Valid, 224 SdHoareTripleChecker+Invalid, 32 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 30 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-11-09 07:40:48,058 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [10 Valid, 224 Invalid, 32 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 30 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-11-09 07:40:48,059 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 114 states. [2024-11-09 07:40:48,063 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 114 to 114. [2024-11-09 07:40:48,064 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 114 states, 84 states have (on average 1.3214285714285714) internal successors, (111), 99 states have internal predecessors, (111), 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-11-09 07:40:48,064 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 114 states to 114 states and 131 transitions. [2024-11-09 07:40:48,064 INFO L78 Accepts]: Start accepts. Automaton has 114 states and 131 transitions. Word has length 43 [2024-11-09 07:40:48,065 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-09 07:40:48,065 INFO L471 AbstractCegarLoop]: Abstraction has 114 states and 131 transitions. [2024-11-09 07:40:48,065 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 5.0) internal successors, (25), 5 states have internal predecessors, (25), 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-11-09 07:40:48,065 INFO L276 IsEmpty]: Start isEmpty. Operand 114 states and 131 transitions. [2024-11-09 07:40:48,065 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 45 [2024-11-09 07:40:48,065 INFO L207 NwaCegarLoop]: Found error trace [2024-11-09 07:40:48,065 INFO L215 NwaCegarLoop]: trace histogram [4, 4, 4, 3, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-09 07:40:48,082 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (8)] Ended with exit code 0 [2024-11-09 07:40:48,266 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-11-09 07:40:48,266 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-11-09 07:40:48,266 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-09 07:40:48,266 INFO L85 PathProgramCache]: Analyzing trace with hash 1184442711, now seen corresponding path program 2 times [2024-11-09 07:40:48,267 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-09 07:40:48,267 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1590074338] [2024-11-09 07:40:48,267 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-09 07:40:48,267 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-09 07:40:48,279 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 07:40:48,416 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-11-09 07:40:48,417 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 07:40:48,418 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 9 [2024-11-09 07:40:48,419 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 07:40:48,420 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 14 [2024-11-09 07:40:48,421 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 07:40:48,423 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 19 [2024-11-09 07:40:48,425 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 07:40:48,427 INFO L134 CoverageAnalysis]: Checked inductivity of 37 backedges. 3 proven. 10 refuted. 0 times theorem prover too weak. 24 trivial. 0 not checked. [2024-11-09 07:40:48,427 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-09 07:40:48,427 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1590074338] [2024-11-09 07:40:48,427 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1590074338] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-09 07:40:48,427 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1778660797] [2024-11-09 07:40:48,427 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2024-11-09 07:40:48,427 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-09 07:40:48,428 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-09 07:40:48,430 INFO L229 MonitoredProcess]: Starting monitored process 9 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-11-09 07:40:48,432 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (9)] Waiting until timeout for monitored process [2024-11-09 07:40:48,538 INFO L227 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2024-11-09 07:40:48,539 INFO L228 tOrderPrioritization]: Conjunction of SSA is unsat [2024-11-09 07:40:48,540 INFO L255 TraceCheckSpWp]: Trace formula consists of 217 conjuncts, 10 conjuncts are in the unsatisfiable core [2024-11-09 07:40:48,542 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-09 07:40:48,702 INFO L134 CoverageAnalysis]: Checked inductivity of 37 backedges. 1 proven. 9 refuted. 0 times theorem prover too weak. 27 trivial. 0 not checked. [2024-11-09 07:40:48,703 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-11-09 07:40:48,773 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-11-09 07:40:48,845 INFO L134 CoverageAnalysis]: Checked inductivity of 37 backedges. 1 proven. 9 refuted. 0 times theorem prover too weak. 27 trivial. 0 not checked. [2024-11-09 07:40:48,846 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1778660797] provided 0 perfect and 2 imperfect interpolant sequences [2024-11-09 07:40:48,846 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2024-11-09 07:40:48,846 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [8, 7, 7] total 20 [2024-11-09 07:40:48,846 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1028741374] [2024-11-09 07:40:48,846 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2024-11-09 07:40:48,846 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 21 states [2024-11-09 07:40:48,846 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-09 07:40:48,847 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 21 interpolants. [2024-11-09 07:40:48,847 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=84, Invalid=336, Unknown=0, NotChecked=0, Total=420 [2024-11-09 07:40:48,847 INFO L87 Difference]: Start difference. First operand 114 states and 131 transitions. Second operand has 21 states, 20 states have (on average 3.35) internal successors, (67), 21 states have internal predecessors, (67), 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-11-09 07:40:49,238 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-09 07:40:49,239 INFO L93 Difference]: Finished difference Result 136 states and 159 transitions. [2024-11-09 07:40:49,239 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 19 states. [2024-11-09 07:40:49,239 INFO L78 Accepts]: Start accepts. Automaton has has 21 states, 20 states have (on average 3.35) internal successors, (67), 21 states have internal predecessors, (67), 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 44 [2024-11-09 07:40:49,239 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-09 07:40:49,240 INFO L225 Difference]: With dead ends: 136 [2024-11-09 07:40:49,240 INFO L226 Difference]: Without dead ends: 136 [2024-11-09 07:40:49,241 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 117 GetRequests, 83 SyntacticMatches, 0 SemanticMatches, 34 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 233 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=308, Invalid=952, Unknown=0, NotChecked=0, Total=1260 [2024-11-09 07:40:49,241 INFO L432 NwaCegarLoop]: 74 mSDtfsCounter, 166 mSDsluCounter, 626 mSDsCounter, 0 mSdLazyCounter, 382 mSolverCounterSat, 9 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 171 SdHoareTripleChecker+Valid, 700 SdHoareTripleChecker+Invalid, 391 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 9 IncrementalHoareTripleChecker+Valid, 382 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2024-11-09 07:40:49,241 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [171 Valid, 700 Invalid, 391 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [9 Valid, 382 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2024-11-09 07:40:49,242 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 136 states. [2024-11-09 07:40:49,246 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 136 to 113. [2024-11-09 07:40:49,248 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 113 states, 84 states have (on average 1.2976190476190477) internal successors, (109), 98 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-11-09 07:40:49,249 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 113 states to 113 states and 129 transitions. [2024-11-09 07:40:49,250 INFO L78 Accepts]: Start accepts. Automaton has 113 states and 129 transitions. Word has length 44 [2024-11-09 07:40:49,250 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-09 07:40:49,250 INFO L471 AbstractCegarLoop]: Abstraction has 113 states and 129 transitions. [2024-11-09 07:40:49,251 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 21 states, 20 states have (on average 3.35) internal successors, (67), 21 states have internal predecessors, (67), 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-11-09 07:40:49,251 INFO L276 IsEmpty]: Start isEmpty. Operand 113 states and 129 transitions. [2024-11-09 07:40:49,251 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 47 [2024-11-09 07:40:49,251 INFO L207 NwaCegarLoop]: Found error trace [2024-11-09 07:40:49,252 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] [2024-11-09 07:40:49,269 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (9)] Forceful destruction successful, exit code 0 [2024-11-09 07:40:49,452 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-11-09 07:40:49,453 INFO L396 AbstractCegarLoop]: === Iteration 22 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONMEMORY_LEAK === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 34 more)] === [2024-11-09 07:40:49,453 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-09 07:40:49,453 INFO L85 PathProgramCache]: Analyzing trace with hash 1321655688, now seen corresponding path program 2 times [2024-11-09 07:40:49,453 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-09 07:40:49,453 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [444271782] [2024-11-09 07:40:49,453 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-09 07:40:49,453 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-09 07:40:49,490 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 07:40:50,551 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-11-09 07:40:50,552 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 07:40:50,554 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 9 [2024-11-09 07:40:50,556 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 07:40:50,596 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 14 [2024-11-09 07:40:50,599 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 07:40:50,637 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 19 [2024-11-09 07:40:50,639 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 07:40:50,699 INFO L134 CoverageAnalysis]: Checked inductivity of 31 backedges. 13 proven. 1 refuted. 0 times theorem prover too weak. 17 trivial. 0 not checked. [2024-11-09 07:40:50,700 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-09 07:40:50,700 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [444271782] [2024-11-09 07:40:50,700 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [444271782] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-09 07:40:50,700 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1950762377] [2024-11-09 07:40:50,700 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2024-11-09 07:40:50,700 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-09 07:40:50,701 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-09 07:40:50,702 INFO L229 MonitoredProcess]: Starting monitored process 10 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-11-09 07:40:50,703 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (10)] Waiting until timeout for monitored process [2024-11-09 07:40:50,821 INFO L227 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2024-11-09 07:40:50,822 INFO L228 tOrderPrioritization]: Conjunction of SSA is unsat [2024-11-09 07:40:50,824 INFO L255 TraceCheckSpWp]: Trace formula consists of 218 conjuncts, 58 conjuncts are in the unsatisfiable core [2024-11-09 07:40:50,827 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-09 07:40:51,071 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-11-09 07:40:51,133 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-11-09 07:40:51,133 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-11-09 07:40:51,487 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-11-09 07:40:51,508 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-11-09 07:40:51,509 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-11-09 07:40:51,740 INFO L134 CoverageAnalysis]: Checked inductivity of 31 backedges. 9 proven. 7 refuted. 0 times theorem prover too weak. 15 trivial. 0 not checked. [2024-11-09 07:40:51,741 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-11-09 07:40:52,108 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-11-09 07:40:52,108 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-11-09 07:40:57,038 INFO L134 CoverageAnalysis]: Checked inductivity of 31 backedges. 10 proven. 6 refuted. 0 times theorem prover too weak. 15 trivial. 0 not checked. [2024-11-09 07:40:57,038 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1950762377] provided 0 perfect and 2 imperfect interpolant sequences [2024-11-09 07:40:57,038 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2024-11-09 07:40:57,038 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [17, 18, 17] total 45 [2024-11-09 07:40:57,039 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2061101598] [2024-11-09 07:40:57,039 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2024-11-09 07:40:57,039 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 45 states [2024-11-09 07:40:57,039 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-09 07:40:57,040 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 45 interpolants. [2024-11-09 07:40:57,040 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=152, Invalid=1828, Unknown=0, NotChecked=0, Total=1980 [2024-11-09 07:40:57,041 INFO L87 Difference]: Start difference. First operand 113 states and 129 transitions. Second operand has 45 states, 37 states have (on average 1.837837837837838) internal successors, (68), 40 states have internal predecessors, (68), 10 states have call successors, (11), 2 states have call predecessors, (11), 2 states have return successors, (10), 10 states have call predecessors, (10), 9 states have call successors, (10)