./Ultimate.py --spec ../sv-benchmarks/c/properties/valid-memsafety.prp --file ../sv-benchmarks/c/locks/test_locks_14-1.c --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for memory safety (deref-memtrack) Using default analysis Version 4f9af400 extending candidate: java ['java'] extending candidate: /usr/bin/java ['java', '/usr/bin/java'] extending candidate: /opt/oracle-jdk-bin-*/bin/java ['java', '/usr/bin/java'] extending candidate: /opt/openjdk-*/bin/java ['java', '/usr/bin/java'] extending candidate: /usr/lib/jvm/java-*-openjdk-amd64/bin/java ['java', '/usr/bin/java', '/usr/lib/jvm/java-1.11.0-openjdk-amd64/bin/java', '/usr/lib/jvm/java-17-openjdk-amd64/bin/java', '/usr/lib/jvm/java-11-openjdk-amd64/bin/java', '/usr/lib/jvm/java-1.17.0-openjdk-amd64/bin/java'] ['/root/.sdkman/candidates/java/21.0.5-tem/bin/java', '-Dosgi.configuration.area=/storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/config', '-Xmx15G', '-Xms4m', '-jar', '/storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/plugins/org.eclipse.equinox.launcher_1.6.800.v20240513-1750.jar', '-data', '@noDefault', '-ultimatedata', '/storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data', '-tc', '/storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/config/AutomizerMemDerefMemtrack.xml', '-i', '../sv-benchmarks/c/locks/test_locks_14-1.c', '-s', '/storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/config/svcomp-DerefFreeMemtrack-32bit-Automizer_Default.epf', '--cacsl2boogietranslator.entry.function', 'main', '--witnessprinter.witness.directory', '/storage/repos/ultimate-jdk21/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) )\nCHECK( init(main()), LTL(G valid-deref) )\nCHECK( init(main()), LTL(G valid-memtrack) )\n\n', '--witnessprinter.graph.data.producer', 'Automizer', '--witnessprinter.graph.data.architecture', '32bit', '--witnessprinter.graph.data.programhash', '1e1f6c8a80d54f6d4b7b413368cc99af6eca243b930331d178961d851b56afbd'] Calling Ultimate with: /root/.sdkman/candidates/java/21.0.5-tem/bin/java -Dosgi.configuration.area=/storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/config -Xmx15G -Xms4m -jar /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/plugins/org.eclipse.equinox.launcher_1.6.800.v20240513-1750.jar -data @noDefault -ultimatedata /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data -tc /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/config/AutomizerMemDerefMemtrack.xml -i ../sv-benchmarks/c/locks/test_locks_14-1.c -s /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/config/svcomp-DerefFreeMemtrack-32bit-Automizer_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /storage/repos/ultimate-jdk21/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 1e1f6c8a80d54f6d4b7b413368cc99af6eca243b930331d178961d851b56afbd --- Real Ultimate output --- This is Ultimate 0.3.0-?-4f9af40 [2024-11-07 16:51:40,773 INFO L188 SettingsManager]: Resetting all preferences to default values... [2024-11-07 16:51:40,855 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/config/svcomp-DerefFreeMemtrack-32bit-Automizer_Default.epf [2024-11-07 16:51:40,861 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2024-11-07 16:51:40,862 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2024-11-07 16:51:40,883 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2024-11-07 16:51:40,884 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2024-11-07 16:51:40,885 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2024-11-07 16:51:40,885 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2024-11-07 16:51:40,885 INFO L153 SettingsManager]: * Use memory slicer=true [2024-11-07 16:51:40,885 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2024-11-07 16:51:40,886 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2024-11-07 16:51:40,886 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2024-11-07 16:51:40,886 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2024-11-07 16:51:40,886 INFO L153 SettingsManager]: * Use SBE=true [2024-11-07 16:51:40,887 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2024-11-07 16:51:40,887 INFO L153 SettingsManager]: * sizeof long=4 [2024-11-07 16:51:40,887 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2024-11-07 16:51:40,887 INFO L153 SettingsManager]: * sizeof POINTER=4 [2024-11-07 16:51:40,887 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2024-11-07 16:51:40,887 INFO L153 SettingsManager]: * Check for the main procedure if all allocated memory was freed=true [2024-11-07 16:51:40,888 INFO L153 SettingsManager]: * Bitprecise bitfields=true [2024-11-07 16:51:40,888 INFO L153 SettingsManager]: * SV-COMP memtrack compatibility mode=true [2024-11-07 16:51:40,888 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2024-11-07 16:51:40,888 INFO L153 SettingsManager]: * Adapt memory model on pointer casts if necessary=true [2024-11-07 16:51:40,888 INFO L153 SettingsManager]: * Allow undefined functions=false [2024-11-07 16:51:40,888 INFO L153 SettingsManager]: * Check unreachability of reach_error function=false [2024-11-07 16:51:40,888 INFO L153 SettingsManager]: * sizeof long double=12 [2024-11-07 16:51:40,888 INFO L153 SettingsManager]: * Use constant arrays=true [2024-11-07 16:51:40,888 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2024-11-07 16:51:40,888 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2024-11-07 16:51:40,888 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2024-11-07 16:51:40,889 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2024-11-07 16:51:40,889 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-11-07 16:51:40,889 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2024-11-07 16:51:40,889 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2024-11-07 16:51:40,889 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2024-11-07 16:51:40,889 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2024-11-07 16:51:40,889 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2024-11-07 16:51:40,889 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2024-11-07 16:51:40,890 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2024-11-07 16:51:40,890 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2024-11-07 16:51:40,890 INFO L153 SettingsManager]: * Looper check in Petri net analysis=SEMANTIC 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-jdk21/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 -> 1e1f6c8a80d54f6d4b7b413368cc99af6eca243b930331d178961d851b56afbd [2024-11-07 16:51:41,234 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2024-11-07 16:51:41,239 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2024-11-07 16:51:41,240 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2024-11-07 16:51:41,241 INFO L270 PluginConnector]: Initializing CDTParser... [2024-11-07 16:51:41,241 INFO L274 PluginConnector]: CDTParser initialized [2024-11-07 16:51:41,242 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/locks/test_locks_14-1.c [2024-11-07 16:51:42,407 INFO L533 CDTParser]: Created temporary CDT project at NULL [2024-11-07 16:51:42,622 INFO L384 CDTParser]: Found 1 translation units. [2024-11-07 16:51:42,622 INFO L180 CDTParser]: Scanning /storage/repos/ultimate-jdk21/releaseScripts/default/sv-benchmarks/c/locks/test_locks_14-1.c [2024-11-07 16:51:42,631 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/30b06a3ce/c790d8f4204f41aa82d296400e1a5693/FLAG3c27712d1 [2024-11-07 16:51:42,972 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/30b06a3ce/c790d8f4204f41aa82d296400e1a5693 [2024-11-07 16:51:42,974 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2024-11-07 16:51:42,975 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2024-11-07 16:51:42,976 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2024-11-07 16:51:42,976 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2024-11-07 16:51:42,979 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2024-11-07 16:51:42,980 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 07.11 04:51:42" (1/1) ... [2024-11-07 16:51:42,980 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@74f12217 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.11 04:51:42, skipping insertion in model container [2024-11-07 16:51:42,981 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 07.11 04:51:42" (1/1) ... [2024-11-07 16:51:42,992 INFO L175 MainTranslator]: Built tables and reachable declarations [2024-11-07 16:51:43,089 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-11-07 16:51:43,097 INFO L200 MainTranslator]: Completed pre-run [2024-11-07 16:51:43,116 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-11-07 16:51:43,126 INFO L204 MainTranslator]: Completed translation [2024-11-07 16:51:43,127 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.11 04:51:43 WrapperNode [2024-11-07 16:51:43,127 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2024-11-07 16:51:43,128 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2024-11-07 16:51:43,128 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2024-11-07 16:51:43,128 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2024-11-07 16:51:43,133 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.11 04:51:43" (1/1) ... [2024-11-07 16:51:43,137 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.11 04:51:43" (1/1) ... [2024-11-07 16:51:43,154 INFO L138 Inliner]: procedures = 12, calls = 8, calls flagged for inlining = 3, calls inlined = 3, statements flattened = 197 [2024-11-07 16:51:43,154 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2024-11-07 16:51:43,154 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2024-11-07 16:51:43,155 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2024-11-07 16:51:43,155 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2024-11-07 16:51:43,161 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.11 04:51:43" (1/1) ... [2024-11-07 16:51:43,161 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.11 04:51:43" (1/1) ... [2024-11-07 16:51:43,162 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.11 04:51:43" (1/1) ... [2024-11-07 16:51:43,171 INFO L175 MemorySlicer]: Split 2 memory accesses to 1 slices as follows [2]. 100 percent of accesses are in the largest equivalence class. The 2 initializations are split as follows [2]. The 0 writes are split as follows [0]. [2024-11-07 16:51:43,172 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.11 04:51:43" (1/1) ... [2024-11-07 16:51:43,172 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.11 04:51:43" (1/1) ... [2024-11-07 16:51:43,175 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.11 04:51:43" (1/1) ... [2024-11-07 16:51:43,178 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.11 04:51:43" (1/1) ... [2024-11-07 16:51:43,179 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.11 04:51:43" (1/1) ... [2024-11-07 16:51:43,180 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.11 04:51:43" (1/1) ... [2024-11-07 16:51:43,181 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2024-11-07 16:51:43,182 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2024-11-07 16:51:43,182 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2024-11-07 16:51:43,182 INFO L274 PluginConnector]: RCFGBuilder initialized [2024-11-07 16:51:43,183 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.11 04:51:43" (1/1) ... [2024-11-07 16:51:43,187 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-11-07 16:51:43,198 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2024-11-07 16:51:43,212 INFO L229 MonitoredProcess]: Starting monitored process 1 with /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (exit command is (exit), workingDir is null) [2024-11-07 16:51:43,220 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Waiting until timeout for monitored process [2024-11-07 16:51:43,239 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2024-11-07 16:51:43,239 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2024-11-07 16:51:43,239 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2024-11-07 16:51:43,239 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#0 [2024-11-07 16:51:43,311 INFO L238 CfgBuilder]: Building ICFG [2024-11-07 16:51:43,313 INFO L264 CfgBuilder]: Building CFG for each procedure with an implementation [2024-11-07 16:51:43,551 INFO L? ?]: Removed 34 outVars from TransFormulas that were not future-live. [2024-11-07 16:51:43,551 INFO L287 CfgBuilder]: Performing block encoding [2024-11-07 16:51:43,562 INFO L311 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2024-11-07 16:51:43,562 INFO L316 CfgBuilder]: Removed 1 assume(true) statements. [2024-11-07 16:51:43,563 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 07.11 04:51:43 BoogieIcfgContainer [2024-11-07 16:51:43,563 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2024-11-07 16:51:43,564 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2024-11-07 16:51:43,564 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2024-11-07 16:51:43,568 INFO L274 PluginConnector]: TraceAbstraction initialized [2024-11-07 16:51:43,568 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 07.11 04:51:42" (1/3) ... [2024-11-07 16:51:43,569 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@22cdf239 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 07.11 04:51:43, skipping insertion in model container [2024-11-07 16:51:43,569 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.11 04:51:43" (2/3) ... [2024-11-07 16:51:43,569 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@22cdf239 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 07.11 04:51:43, skipping insertion in model container [2024-11-07 16:51:43,569 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 07.11 04:51:43" (3/3) ... [2024-11-07 16:51:43,570 INFO L112 eAbstractionObserver]: Analyzing ICFG test_locks_14-1.c [2024-11-07 16:51:43,581 INFO L214 ceAbstractionStarter]: Automizer settings: Hoare:None NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2024-11-07 16:51:43,581 INFO L154 ceAbstractionStarter]: Applying trace abstraction to program that has 2 error locations. [2024-11-07 16:51:43,607 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2024-11-07 16:51:43,615 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;@4fa70b8d, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2024-11-07 16:51:43,615 INFO L334 AbstractCegarLoop]: Starting to check reachability of 2 error locations. [2024-11-07 16:51:43,618 INFO L276 IsEmpty]: Start isEmpty. Operand has 55 states, 52 states have (on average 1.9038461538461537) internal successors, (99), 54 states have internal predecessors, (99), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-07 16:51:43,622 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 6 [2024-11-07 16:51:43,622 INFO L207 NwaCegarLoop]: Found error trace [2024-11-07 16:51:43,622 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1] [2024-11-07 16:51:43,623 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_LEAK === [ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_LEAK] === [2024-11-07 16:51:43,626 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-07 16:51:43,626 INFO L85 PathProgramCache]: Analyzing trace with hash 28943013, now seen corresponding path program 1 times [2024-11-07 16:51:43,631 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-07 16:51:43,631 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1868401161] [2024-11-07 16:51:43,632 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-07 16:51:43,632 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-07 16:51:43,725 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 16:51:43,770 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-07 16:51:43,771 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-07 16:51:43,771 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1868401161] [2024-11-07 16:51:43,773 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1868401161] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-07 16:51:43,773 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-07 16:51:43,774 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-11-07 16:51:43,775 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [669708924] [2024-11-07 16:51:43,776 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-07 16:51:43,779 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2024-11-07 16:51:43,779 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-07 16:51:43,798 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2024-11-07 16:51:43,799 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2024-11-07 16:51:43,800 INFO L87 Difference]: Start difference. First operand has 55 states, 52 states have (on average 1.9038461538461537) internal successors, (99), 54 states have internal predecessors, (99), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Second operand has 2 states, 2 states have (on average 2.5) internal successors, (5), 2 states have internal predecessors, (5), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-07 16:51:43,810 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-07 16:51:43,811 INFO L93 Difference]: Finished difference Result 54 states and 95 transitions. [2024-11-07 16:51:43,812 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2024-11-07 16:51:43,813 INFO L78 Accepts]: Start accepts. Automaton has has 2 states, 2 states have (on average 2.5) internal successors, (5), 2 states have internal predecessors, (5), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 5 [2024-11-07 16:51:43,813 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-07 16:51:43,817 INFO L225 Difference]: With dead ends: 54 [2024-11-07 16:51:43,817 INFO L226 Difference]: Without dead ends: 52 [2024-11-07 16:51:43,818 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 2 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-07 16:51:43,820 INFO L432 NwaCegarLoop]: 95 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, 95 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-07 16:51:43,820 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 95 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 0 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-11-07 16:51:43,829 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 52 states. [2024-11-07 16:51:43,838 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 52 to 52. [2024-11-07 16:51:43,839 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 52 states, 50 states have (on average 1.86) internal successors, (93), 51 states have internal predecessors, (93), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-07 16:51:43,841 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 52 states to 52 states and 93 transitions. [2024-11-07 16:51:43,842 INFO L78 Accepts]: Start accepts. Automaton has 52 states and 93 transitions. Word has length 5 [2024-11-07 16:51:43,842 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-07 16:51:43,842 INFO L471 AbstractCegarLoop]: Abstraction has 52 states and 93 transitions. [2024-11-07 16:51:43,842 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 2 states, 2 states have (on average 2.5) internal successors, (5), 2 states have internal predecessors, (5), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-07 16:51:43,842 INFO L276 IsEmpty]: Start isEmpty. Operand 52 states and 93 transitions. [2024-11-07 16:51:43,843 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 7 [2024-11-07 16:51:43,843 INFO L207 NwaCegarLoop]: Found error trace [2024-11-07 16:51:43,843 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1] [2024-11-07 16:51:43,843 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2024-11-07 16:51:43,843 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_LEAK === [ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_LEAK] === [2024-11-07 16:51:43,843 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-07 16:51:43,843 INFO L85 PathProgramCache]: Analyzing trace with hash 889700142, now seen corresponding path program 1 times [2024-11-07 16:51:43,844 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-07 16:51:43,844 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2077383332] [2024-11-07 16:51:43,844 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-07 16:51:43,844 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-07 16:51:43,854 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 16:51:43,883 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-07 16:51:43,883 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-07 16:51:43,883 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2077383332] [2024-11-07 16:51:43,883 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2077383332] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-07 16:51:43,883 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-07 16:51:43,883 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-11-07 16:51:43,884 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1579602880] [2024-11-07 16:51:43,884 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-07 16:51:43,884 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-07 16:51:43,885 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-07 16:51:43,885 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-07 16:51:43,885 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-07 16:51:43,885 INFO L87 Difference]: Start difference. First operand 52 states and 93 transitions. Second operand has 3 states, 2 states have (on average 3.0) internal successors, (6), 3 states have internal predecessors, (6), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-07 16:51:43,892 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-07 16:51:43,893 INFO L93 Difference]: Finished difference Result 51 states and 92 transitions. [2024-11-07 16:51:43,893 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-07 16:51:43,893 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 2 states have (on average 3.0) internal successors, (6), 3 states have internal predecessors, (6), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 6 [2024-11-07 16:51:43,893 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-07 16:51:43,894 INFO L225 Difference]: With dead ends: 51 [2024-11-07 16:51:43,894 INFO L226 Difference]: Without dead ends: 49 [2024-11-07 16:51:43,894 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 1 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-07 16:51:43,895 INFO L432 NwaCegarLoop]: 92 mSDtfsCounter, 87 mSDsluCounter, 0 mSDsCounter, 0 mSdLazyCounter, 1 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 87 SdHoareTripleChecker+Valid, 92 SdHoareTripleChecker+Invalid, 1 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 1 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-11-07 16:51:43,895 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [87 Valid, 92 Invalid, 1 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 1 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-11-07 16:51:43,895 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 49 states. [2024-11-07 16:51:43,897 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 49 to 49. [2024-11-07 16:51:43,897 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 49 states, 48 states have (on average 1.875) internal successors, (90), 48 states have internal predecessors, (90), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-07 16:51:43,898 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 49 states to 49 states and 90 transitions. [2024-11-07 16:51:43,898 INFO L78 Accepts]: Start accepts. Automaton has 49 states and 90 transitions. Word has length 6 [2024-11-07 16:51:43,898 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-07 16:51:43,898 INFO L471 AbstractCegarLoop]: Abstraction has 49 states and 90 transitions. [2024-11-07 16:51:43,899 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 2 states have (on average 3.0) internal successors, (6), 3 states have internal predecessors, (6), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-07 16:51:43,899 INFO L276 IsEmpty]: Start isEmpty. Operand 49 states and 90 transitions. [2024-11-07 16:51:43,899 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2024-11-07 16:51:43,899 INFO L207 NwaCegarLoop]: Found error trace [2024-11-07 16:51:43,899 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-07 16:51:43,899 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2024-11-07 16:51:43,900 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK === [ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_LEAK] === [2024-11-07 16:51:43,900 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-07 16:51:43,900 INFO L85 PathProgramCache]: Analyzing trace with hash -1188558766, now seen corresponding path program 1 times [2024-11-07 16:51:43,900 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-07 16:51:43,900 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1851802998] [2024-11-07 16:51:43,900 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-07 16:51:43,900 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-07 16:51:43,916 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 16:51:43,955 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-07 16:51:43,955 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-07 16:51:43,955 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1851802998] [2024-11-07 16:51:43,955 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1851802998] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-07 16:51:43,955 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-07 16:51:43,955 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-11-07 16:51:43,955 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1205983160] [2024-11-07 16:51:43,955 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-07 16:51:43,956 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-07 16:51:43,956 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-07 16:51:43,956 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-07 16:51:43,956 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-07 16:51:43,956 INFO L87 Difference]: Start difference. First operand 49 states and 90 transitions. Second operand has 3 states, 3 states have (on average 7.333333333333333) internal successors, (22), 3 states have internal predecessors, (22), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-07 16:51:43,974 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-07 16:51:43,974 INFO L93 Difference]: Finished difference Result 95 states and 175 transitions. [2024-11-07 16:51:43,974 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-07 16:51:43,974 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 7.333333333333333) internal successors, (22), 3 states have internal predecessors, (22), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 22 [2024-11-07 16:51:43,974 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-07 16:51:43,975 INFO L225 Difference]: With dead ends: 95 [2024-11-07 16:51:43,975 INFO L226 Difference]: Without dead ends: 95 [2024-11-07 16:51:43,975 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-07 16:51:43,976 INFO L432 NwaCegarLoop]: 93 mSDtfsCounter, 69 mSDsluCounter, 85 mSDsCounter, 0 mSdLazyCounter, 6 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 69 SdHoareTripleChecker+Valid, 178 SdHoareTripleChecker+Invalid, 6 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 6 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-11-07 16:51:43,976 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [69 Valid, 178 Invalid, 6 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 6 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-11-07 16:51:43,977 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 95 states. [2024-11-07 16:51:43,980 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 95 to 64. [2024-11-07 16:51:43,980 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 64 states, 63 states have (on average 1.8888888888888888) internal successors, (119), 63 states have internal predecessors, (119), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-07 16:51:43,981 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 64 states to 64 states and 119 transitions. [2024-11-07 16:51:43,981 INFO L78 Accepts]: Start accepts. Automaton has 64 states and 119 transitions. Word has length 22 [2024-11-07 16:51:43,981 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-07 16:51:43,981 INFO L471 AbstractCegarLoop]: Abstraction has 64 states and 119 transitions. [2024-11-07 16:51:43,982 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 7.333333333333333) internal successors, (22), 3 states have internal predecessors, (22), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-07 16:51:43,982 INFO L276 IsEmpty]: Start isEmpty. Operand 64 states and 119 transitions. [2024-11-07 16:51:43,982 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2024-11-07 16:51:43,982 INFO L207 NwaCegarLoop]: Found error trace [2024-11-07 16:51:43,982 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-07 16:51:43,982 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2024-11-07 16:51:43,982 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK === [ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_LEAK] === [2024-11-07 16:51:43,983 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-07 16:51:43,983 INFO L85 PathProgramCache]: Analyzing trace with hash 1112263824, now seen corresponding path program 1 times [2024-11-07 16:51:43,983 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-07 16:51:43,983 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1656994908] [2024-11-07 16:51:43,983 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-07 16:51:43,983 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-07 16:51:44,012 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 16:51:44,082 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-07 16:51:44,082 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-07 16:51:44,082 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1656994908] [2024-11-07 16:51:44,082 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1656994908] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-07 16:51:44,082 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-07 16:51:44,082 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-11-07 16:51:44,083 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [223901407] [2024-11-07 16:51:44,083 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-07 16:51:44,083 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-07 16:51:44,083 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-07 16:51:44,084 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-07 16:51:44,084 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-07 16:51:44,084 INFO L87 Difference]: Start difference. First operand 64 states and 119 transitions. Second operand has 3 states, 3 states have (on average 7.333333333333333) internal successors, (22), 3 states have internal predecessors, (22), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-07 16:51:44,109 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-07 16:51:44,109 INFO L93 Difference]: Finished difference Result 95 states and 173 transitions. [2024-11-07 16:51:44,109 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-07 16:51:44,109 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 7.333333333333333) internal successors, (22), 3 states have internal predecessors, (22), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 22 [2024-11-07 16:51:44,109 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-07 16:51:44,110 INFO L225 Difference]: With dead ends: 95 [2024-11-07 16:51:44,110 INFO L226 Difference]: Without dead ends: 95 [2024-11-07 16:51:44,110 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-07 16:51:44,110 INFO L432 NwaCegarLoop]: 117 mSDtfsCounter, 69 mSDsluCounter, 84 mSDsCounter, 0 mSdLazyCounter, 5 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 69 SdHoareTripleChecker+Valid, 201 SdHoareTripleChecker+Invalid, 7 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 5 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-11-07 16:51:44,110 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [69 Valid, 201 Invalid, 7 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 5 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-11-07 16:51:44,111 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 95 states. [2024-11-07 16:51:44,114 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 95 to 92. [2024-11-07 16:51:44,115 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 92 states, 91 states have (on average 1.879120879120879) internal successors, (171), 91 states have internal predecessors, (171), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-07 16:51:44,116 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 92 states to 92 states and 171 transitions. [2024-11-07 16:51:44,116 INFO L78 Accepts]: Start accepts. Automaton has 92 states and 171 transitions. Word has length 22 [2024-11-07 16:51:44,116 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-07 16:51:44,116 INFO L471 AbstractCegarLoop]: Abstraction has 92 states and 171 transitions. [2024-11-07 16:51:44,116 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 7.333333333333333) internal successors, (22), 3 states have internal predecessors, (22), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-07 16:51:44,116 INFO L276 IsEmpty]: Start isEmpty. Operand 92 states and 171 transitions. [2024-11-07 16:51:44,116 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 24 [2024-11-07 16:51:44,116 INFO L207 NwaCegarLoop]: Found error trace [2024-11-07 16:51:44,116 INFO L215 NwaCegarLoop]: trace histogram [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-07 16:51:44,116 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2024-11-07 16:51:44,116 INFO L396 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK === [ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_LEAK] === [2024-11-07 16:51:44,117 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-07 16:51:44,117 INFO L85 PathProgramCache]: Analyzing trace with hash 1815949700, now seen corresponding path program 1 times [2024-11-07 16:51:44,117 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-07 16:51:44,117 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1939257076] [2024-11-07 16:51:44,117 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-07 16:51:44,117 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-07 16:51:44,132 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 16:51:44,188 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-07 16:51:44,188 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-07 16:51:44,188 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1939257076] [2024-11-07 16:51:44,188 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1939257076] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-07 16:51:44,188 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-07 16:51:44,189 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-11-07 16:51:44,189 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [775455516] [2024-11-07 16:51:44,189 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-07 16:51:44,189 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-07 16:51:44,189 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-07 16:51:44,189 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-07 16:51:44,189 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-07 16:51:44,189 INFO L87 Difference]: Start difference. First operand 92 states and 171 transitions. Second operand has 3 states, 3 states have (on average 7.666666666666667) internal successors, (23), 3 states have internal predecessors, (23), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-07 16:51:44,211 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-07 16:51:44,211 INFO L93 Difference]: Finished difference Result 98 states and 175 transitions. [2024-11-07 16:51:44,212 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-07 16:51:44,212 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 7.666666666666667) internal successors, (23), 3 states have internal predecessors, (23), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 23 [2024-11-07 16:51:44,212 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-07 16:51:44,212 INFO L225 Difference]: With dead ends: 98 [2024-11-07 16:51:44,212 INFO L226 Difference]: Without dead ends: 98 [2024-11-07 16:51:44,212 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-07 16:51:44,213 INFO L432 NwaCegarLoop]: 144 mSDtfsCounter, 71 mSDsluCounter, 83 mSDsCounter, 0 mSdLazyCounter, 5 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 71 SdHoareTripleChecker+Valid, 227 SdHoareTripleChecker+Invalid, 6 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 5 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-11-07 16:51:44,213 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [71 Valid, 227 Invalid, 6 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 5 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-11-07 16:51:44,214 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 98 states. [2024-11-07 16:51:44,220 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 98 to 95. [2024-11-07 16:51:44,220 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 95 states, 94 states have (on average 1.8404255319148937) internal successors, (173), 94 states have internal predecessors, (173), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-07 16:51:44,221 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 95 states to 95 states and 173 transitions. [2024-11-07 16:51:44,221 INFO L78 Accepts]: Start accepts. Automaton has 95 states and 173 transitions. Word has length 23 [2024-11-07 16:51:44,221 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-07 16:51:44,221 INFO L471 AbstractCegarLoop]: Abstraction has 95 states and 173 transitions. [2024-11-07 16:51:44,221 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 7.666666666666667) internal successors, (23), 3 states have internal predecessors, (23), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-07 16:51:44,221 INFO L276 IsEmpty]: Start isEmpty. Operand 95 states and 173 transitions. [2024-11-07 16:51:44,222 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 24 [2024-11-07 16:51:44,222 INFO L207 NwaCegarLoop]: Found error trace [2024-11-07 16:51:44,222 INFO L215 NwaCegarLoop]: trace histogram [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-07 16:51:44,222 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2024-11-07 16:51:44,222 INFO L396 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK === [ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_LEAK] === [2024-11-07 16:51:44,222 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-07 16:51:44,224 INFO L85 PathProgramCache]: Analyzing trace with hash 127005958, now seen corresponding path program 1 times [2024-11-07 16:51:44,224 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-07 16:51:44,225 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1930707407] [2024-11-07 16:51:44,225 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-07 16:51:44,225 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-07 16:51:44,257 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 16:51:44,290 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-07 16:51:44,290 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-07 16:51:44,290 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1930707407] [2024-11-07 16:51:44,290 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1930707407] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-07 16:51:44,290 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-07 16:51:44,290 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-11-07 16:51:44,290 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1022961503] [2024-11-07 16:51:44,290 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-07 16:51:44,290 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-07 16:51:44,290 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-07 16:51:44,291 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-07 16:51:44,291 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-07 16:51:44,291 INFO L87 Difference]: Start difference. First operand 95 states and 173 transitions. Second operand has 3 states, 3 states have (on average 7.666666666666667) internal successors, (23), 3 states have internal predecessors, (23), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-07 16:51:44,302 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-07 16:51:44,302 INFO L93 Difference]: Finished difference Result 181 states and 332 transitions. [2024-11-07 16:51:44,302 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-07 16:51:44,302 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 7.666666666666667) internal successors, (23), 3 states have internal predecessors, (23), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 23 [2024-11-07 16:51:44,302 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-07 16:51:44,303 INFO L225 Difference]: With dead ends: 181 [2024-11-07 16:51:44,303 INFO L226 Difference]: Without dead ends: 181 [2024-11-07 16:51:44,303 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-07 16:51:44,304 INFO L432 NwaCegarLoop]: 92 mSDtfsCounter, 66 mSDsluCounter, 84 mSDsCounter, 0 mSdLazyCounter, 6 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 66 SdHoareTripleChecker+Valid, 176 SdHoareTripleChecker+Invalid, 6 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 6 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-11-07 16:51:44,304 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [66 Valid, 176 Invalid, 6 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 6 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-11-07 16:51:44,304 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 181 states. [2024-11-07 16:51:44,308 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 181 to 126. [2024-11-07 16:51:44,309 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 126 states, 125 states have (on average 1.84) internal successors, (230), 125 states have internal predecessors, (230), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-07 16:51:44,310 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 126 states to 126 states and 230 transitions. [2024-11-07 16:51:44,310 INFO L78 Accepts]: Start accepts. Automaton has 126 states and 230 transitions. Word has length 23 [2024-11-07 16:51:44,310 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-07 16:51:44,310 INFO L471 AbstractCegarLoop]: Abstraction has 126 states and 230 transitions. [2024-11-07 16:51:44,310 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 7.666666666666667) internal successors, (23), 3 states have internal predecessors, (23), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-07 16:51:44,310 INFO L276 IsEmpty]: Start isEmpty. Operand 126 states and 230 transitions. [2024-11-07 16:51:44,311 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 24 [2024-11-07 16:51:44,311 INFO L207 NwaCegarLoop]: Found error trace [2024-11-07 16:51:44,311 INFO L215 NwaCegarLoop]: trace histogram [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-07 16:51:44,311 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2024-11-07 16:51:44,311 INFO L396 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK === [ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_LEAK] === [2024-11-07 16:51:44,311 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-07 16:51:44,311 INFO L85 PathProgramCache]: Analyzing trace with hash -1867138748, now seen corresponding path program 1 times [2024-11-07 16:51:44,312 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-07 16:51:44,312 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [351685915] [2024-11-07 16:51:44,312 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-07 16:51:44,312 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-07 16:51:44,319 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 16:51:44,341 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-07 16:51:44,341 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-07 16:51:44,341 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [351685915] [2024-11-07 16:51:44,341 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [351685915] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-07 16:51:44,341 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-07 16:51:44,341 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-11-07 16:51:44,341 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [70213905] [2024-11-07 16:51:44,341 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-07 16:51:44,342 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-07 16:51:44,342 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-07 16:51:44,342 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-07 16:51:44,342 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-07 16:51:44,342 INFO L87 Difference]: Start difference. First operand 126 states and 230 transitions. Second operand has 3 states, 3 states have (on average 7.666666666666667) internal successors, (23), 3 states have internal predecessors, (23), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-07 16:51:44,362 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-07 16:51:44,362 INFO L93 Difference]: Finished difference Result 183 states and 330 transitions. [2024-11-07 16:51:44,362 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-07 16:51:44,362 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 7.666666666666667) internal successors, (23), 3 states have internal predecessors, (23), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 23 [2024-11-07 16:51:44,362 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-07 16:51:44,363 INFO L225 Difference]: With dead ends: 183 [2024-11-07 16:51:44,363 INFO L226 Difference]: Without dead ends: 183 [2024-11-07 16:51:44,363 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-07 16:51:44,364 INFO L432 NwaCegarLoop]: 119 mSDtfsCounter, 68 mSDsluCounter, 83 mSDsCounter, 0 mSdLazyCounter, 5 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 68 SdHoareTripleChecker+Valid, 202 SdHoareTripleChecker+Invalid, 7 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 5 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-11-07 16:51:44,365 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [68 Valid, 202 Invalid, 7 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 5 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-11-07 16:51:44,366 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 183 states. [2024-11-07 16:51:44,373 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 183 to 180. [2024-11-07 16:51:44,374 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 180 states, 179 states have (on average 1.8324022346368716) internal successors, (328), 179 states have internal predecessors, (328), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-07 16:51:44,379 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 180 states to 180 states and 328 transitions. [2024-11-07 16:51:44,380 INFO L78 Accepts]: Start accepts. Automaton has 180 states and 328 transitions. Word has length 23 [2024-11-07 16:51:44,380 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-07 16:51:44,380 INFO L471 AbstractCegarLoop]: Abstraction has 180 states and 328 transitions. [2024-11-07 16:51:44,380 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 7.666666666666667) internal successors, (23), 3 states have internal predecessors, (23), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-07 16:51:44,380 INFO L276 IsEmpty]: Start isEmpty. Operand 180 states and 328 transitions. [2024-11-07 16:51:44,381 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 25 [2024-11-07 16:51:44,381 INFO L207 NwaCegarLoop]: Found error trace [2024-11-07 16:51:44,381 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-07 16:51:44,381 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2024-11-07 16:51:44,381 INFO L396 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK === [ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_LEAK] === [2024-11-07 16:51:44,382 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-07 16:51:44,382 INFO L85 PathProgramCache]: Analyzing trace with hash -351206245, now seen corresponding path program 1 times [2024-11-07 16:51:44,382 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-07 16:51:44,382 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1029908909] [2024-11-07 16:51:44,382 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-07 16:51:44,382 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-07 16:51:44,396 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 16:51:44,411 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-07 16:51:44,411 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-07 16:51:44,411 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1029908909] [2024-11-07 16:51:44,411 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1029908909] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-07 16:51:44,411 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-07 16:51:44,411 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-11-07 16:51:44,412 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [646505279] [2024-11-07 16:51:44,412 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-07 16:51:44,412 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-07 16:51:44,412 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-07 16:51:44,412 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-07 16:51:44,412 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-07 16:51:44,412 INFO L87 Difference]: Start difference. First operand 180 states and 328 transitions. Second operand has 3 states, 3 states have (on average 8.0) internal successors, (24), 3 states have internal predecessors, (24), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-07 16:51:44,421 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-07 16:51:44,422 INFO L93 Difference]: Finished difference Result 185 states and 330 transitions. [2024-11-07 16:51:44,422 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-07 16:51:44,422 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 8.0) internal successors, (24), 3 states have internal predecessors, (24), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 24 [2024-11-07 16:51:44,422 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-07 16:51:44,423 INFO L225 Difference]: With dead ends: 185 [2024-11-07 16:51:44,423 INFO L226 Difference]: Without dead ends: 185 [2024-11-07 16:51:44,423 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-07 16:51:44,423 INFO L432 NwaCegarLoop]: 141 mSDtfsCounter, 70 mSDsluCounter, 82 mSDsCounter, 0 mSdLazyCounter, 5 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 70 SdHoareTripleChecker+Valid, 223 SdHoareTripleChecker+Invalid, 6 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 5 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-11-07 16:51:44,425 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [70 Valid, 223 Invalid, 6 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 5 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-11-07 16:51:44,425 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 185 states. [2024-11-07 16:51:44,430 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 185 to 182. [2024-11-07 16:51:44,430 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 182 states, 181 states have (on average 1.8121546961325967) internal successors, (328), 181 states have internal predecessors, (328), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-07 16:51:44,435 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 182 states to 182 states and 328 transitions. [2024-11-07 16:51:44,435 INFO L78 Accepts]: Start accepts. Automaton has 182 states and 328 transitions. Word has length 24 [2024-11-07 16:51:44,435 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-07 16:51:44,435 INFO L471 AbstractCegarLoop]: Abstraction has 182 states and 328 transitions. [2024-11-07 16:51:44,435 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 8.0) internal successors, (24), 3 states have internal predecessors, (24), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-07 16:51:44,435 INFO L276 IsEmpty]: Start isEmpty. Operand 182 states and 328 transitions. [2024-11-07 16:51:44,436 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 25 [2024-11-07 16:51:44,436 INFO L207 NwaCegarLoop]: Found error trace [2024-11-07 16:51:44,436 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-07 16:51:44,436 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2024-11-07 16:51:44,436 INFO L396 AbstractCegarLoop]: === Iteration 9 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK === [ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_LEAK] === [2024-11-07 16:51:44,436 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-07 16:51:44,440 INFO L85 PathProgramCache]: Analyzing trace with hash -2040149987, now seen corresponding path program 1 times [2024-11-07 16:51:44,440 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-07 16:51:44,440 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [876753105] [2024-11-07 16:51:44,440 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-07 16:51:44,440 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-07 16:51:44,449 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 16:51:44,482 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-07 16:51:44,482 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-07 16:51:44,483 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [876753105] [2024-11-07 16:51:44,483 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [876753105] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-07 16:51:44,483 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-07 16:51:44,483 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-11-07 16:51:44,483 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [357384685] [2024-11-07 16:51:44,483 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-07 16:51:44,484 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-07 16:51:44,485 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-07 16:51:44,485 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-07 16:51:44,485 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-07 16:51:44,485 INFO L87 Difference]: Start difference. First operand 182 states and 328 transitions. Second operand has 3 states, 3 states have (on average 8.0) internal successors, (24), 3 states have internal predecessors, (24), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-07 16:51:44,502 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-07 16:51:44,503 INFO L93 Difference]: Finished difference Result 353 states and 630 transitions. [2024-11-07 16:51:44,503 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-07 16:51:44,503 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 8.0) internal successors, (24), 3 states have internal predecessors, (24), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 24 [2024-11-07 16:51:44,503 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-07 16:51:44,504 INFO L225 Difference]: With dead ends: 353 [2024-11-07 16:51:44,506 INFO L226 Difference]: Without dead ends: 353 [2024-11-07 16:51:44,506 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-07 16:51:44,507 INFO L432 NwaCegarLoop]: 95 mSDtfsCounter, 68 mSDsluCounter, 83 mSDsCounter, 0 mSdLazyCounter, 5 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 68 SdHoareTripleChecker+Valid, 178 SdHoareTripleChecker+Invalid, 7 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 5 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-11-07 16:51:44,507 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [68 Valid, 178 Invalid, 7 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 5 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-11-07 16:51:44,508 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 353 states. [2024-11-07 16:51:44,518 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 353 to 350. [2024-11-07 16:51:44,519 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 350 states, 349 states have (on average 1.7994269340974212) internal successors, (628), 349 states have internal predecessors, (628), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-07 16:51:44,520 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 350 states to 350 states and 628 transitions. [2024-11-07 16:51:44,520 INFO L78 Accepts]: Start accepts. Automaton has 350 states and 628 transitions. Word has length 24 [2024-11-07 16:51:44,520 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-07 16:51:44,520 INFO L471 AbstractCegarLoop]: Abstraction has 350 states and 628 transitions. [2024-11-07 16:51:44,520 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 8.0) internal successors, (24), 3 states have internal predecessors, (24), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-07 16:51:44,520 INFO L276 IsEmpty]: Start isEmpty. Operand 350 states and 628 transitions. [2024-11-07 16:51:44,524 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 25 [2024-11-07 16:51:44,524 INFO L207 NwaCegarLoop]: Found error trace [2024-11-07 16:51:44,524 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-07 16:51:44,524 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2024-11-07 16:51:44,524 INFO L396 AbstractCegarLoop]: === Iteration 10 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK === [ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_LEAK] === [2024-11-07 16:51:44,524 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-07 16:51:44,524 INFO L85 PathProgramCache]: Analyzing trace with hash -46005281, now seen corresponding path program 1 times [2024-11-07 16:51:44,524 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-07 16:51:44,524 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [733899375] [2024-11-07 16:51:44,524 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-07 16:51:44,524 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-07 16:51:44,536 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 16:51:44,556 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-07 16:51:44,557 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-07 16:51:44,557 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [733899375] [2024-11-07 16:51:44,557 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [733899375] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-07 16:51:44,557 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-07 16:51:44,557 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-11-07 16:51:44,557 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [910377568] [2024-11-07 16:51:44,557 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-07 16:51:44,558 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-07 16:51:44,558 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-07 16:51:44,559 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-07 16:51:44,559 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-07 16:51:44,559 INFO L87 Difference]: Start difference. First operand 350 states and 628 transitions. Second operand has 3 states, 3 states have (on average 8.0) internal successors, (24), 3 states have internal predecessors, (24), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-07 16:51:44,575 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-07 16:51:44,575 INFO L93 Difference]: Finished difference Result 449 states and 810 transitions. [2024-11-07 16:51:44,575 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-07 16:51:44,576 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 8.0) internal successors, (24), 3 states have internal predecessors, (24), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 24 [2024-11-07 16:51:44,576 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-07 16:51:44,577 INFO L225 Difference]: With dead ends: 449 [2024-11-07 16:51:44,577 INFO L226 Difference]: Without dead ends: 449 [2024-11-07 16:51:44,577 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-07 16:51:44,577 INFO L432 NwaCegarLoop]: 163 mSDtfsCounter, 63 mSDsluCounter, 82 mSDsCounter, 0 mSdLazyCounter, 5 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 63 SdHoareTripleChecker+Valid, 245 SdHoareTripleChecker+Invalid, 5 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 5 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-11-07 16:51:44,578 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [63 Valid, 245 Invalid, 5 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 5 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-11-07 16:51:44,578 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 449 states. [2024-11-07 16:51:44,583 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 449 to 350. [2024-11-07 16:51:44,584 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 350 states, 349 states have (on average 1.7879656160458453) internal successors, (624), 349 states have internal predecessors, (624), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-07 16:51:44,585 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 350 states to 350 states and 624 transitions. [2024-11-07 16:51:44,585 INFO L78 Accepts]: Start accepts. Automaton has 350 states and 624 transitions. Word has length 24 [2024-11-07 16:51:44,585 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-07 16:51:44,585 INFO L471 AbstractCegarLoop]: Abstraction has 350 states and 624 transitions. [2024-11-07 16:51:44,585 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 8.0) internal successors, (24), 3 states have internal predecessors, (24), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-07 16:51:44,585 INFO L276 IsEmpty]: Start isEmpty. Operand 350 states and 624 transitions. [2024-11-07 16:51:44,587 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2024-11-07 16:51:44,587 INFO L207 NwaCegarLoop]: Found error trace [2024-11-07 16:51:44,587 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-07 16:51:44,587 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9 [2024-11-07 16:51:44,587 INFO L396 AbstractCegarLoop]: === Iteration 11 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK === [ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_LEAK] === [2024-11-07 16:51:44,588 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-07 16:51:44,588 INFO L85 PathProgramCache]: Analyzing trace with hash 1186446767, now seen corresponding path program 1 times [2024-11-07 16:51:44,588 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-07 16:51:44,588 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1991910070] [2024-11-07 16:51:44,588 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-07 16:51:44,588 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-07 16:51:44,597 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 16:51:44,626 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-07 16:51:44,626 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-07 16:51:44,626 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1991910070] [2024-11-07 16:51:44,626 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1991910070] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-07 16:51:44,626 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-07 16:51:44,627 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-11-07 16:51:44,627 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [593479156] [2024-11-07 16:51:44,627 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-07 16:51:44,627 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-07 16:51:44,627 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-07 16:51:44,627 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-07 16:51:44,628 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-07 16:51:44,628 INFO L87 Difference]: Start difference. First operand 350 states and 624 transitions. Second operand has 3 states, 3 states have (on average 8.333333333333334) internal successors, (25), 3 states have internal predecessors, (25), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-07 16:51:44,641 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-07 16:51:44,641 INFO L93 Difference]: Finished difference Result 661 states and 1186 transitions. [2024-11-07 16:51:44,641 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-07 16:51:44,641 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 8.333333333333334) internal successors, (25), 3 states have internal predecessors, (25), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 25 [2024-11-07 16:51:44,641 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-07 16:51:44,643 INFO L225 Difference]: With dead ends: 661 [2024-11-07 16:51:44,644 INFO L226 Difference]: Without dead ends: 661 [2024-11-07 16:51:44,644 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-07 16:51:44,645 INFO L432 NwaCegarLoop]: 90 mSDtfsCounter, 60 mSDsluCounter, 82 mSDsCounter, 0 mSdLazyCounter, 6 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 60 SdHoareTripleChecker+Valid, 172 SdHoareTripleChecker+Invalid, 6 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 6 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-11-07 16:51:44,645 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [60 Valid, 172 Invalid, 6 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 6 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-11-07 16:51:44,646 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 661 states. [2024-11-07 16:51:44,653 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 661 to 482. [2024-11-07 16:51:44,654 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 482 states, 481 states have (on average 1.762993762993763) internal successors, (848), 481 states have internal predecessors, (848), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-07 16:51:44,655 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 482 states to 482 states and 848 transitions. [2024-11-07 16:51:44,655 INFO L78 Accepts]: Start accepts. Automaton has 482 states and 848 transitions. Word has length 25 [2024-11-07 16:51:44,655 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-07 16:51:44,655 INFO L471 AbstractCegarLoop]: Abstraction has 482 states and 848 transitions. [2024-11-07 16:51:44,655 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 8.333333333333334) internal successors, (25), 3 states have internal predecessors, (25), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-07 16:51:44,655 INFO L276 IsEmpty]: Start isEmpty. Operand 482 states and 848 transitions. [2024-11-07 16:51:44,656 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2024-11-07 16:51:44,656 INFO L207 NwaCegarLoop]: Found error trace [2024-11-07 16:51:44,656 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-07 16:51:44,656 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10 [2024-11-07 16:51:44,656 INFO L396 AbstractCegarLoop]: === Iteration 12 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK === [ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_LEAK] === [2024-11-07 16:51:44,657 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-07 16:51:44,657 INFO L85 PathProgramCache]: Analyzing trace with hash -807697939, now seen corresponding path program 1 times [2024-11-07 16:51:44,657 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-07 16:51:44,657 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [587312896] [2024-11-07 16:51:44,657 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-07 16:51:44,658 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-07 16:51:44,665 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 16:51:44,686 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-07 16:51:44,687 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-07 16:51:44,687 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [587312896] [2024-11-07 16:51:44,687 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [587312896] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-07 16:51:44,687 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-07 16:51:44,687 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-11-07 16:51:44,687 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2066768056] [2024-11-07 16:51:44,687 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-07 16:51:44,687 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-07 16:51:44,687 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-07 16:51:44,688 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-07 16:51:44,688 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-07 16:51:44,689 INFO L87 Difference]: Start difference. First operand 482 states and 848 transitions. Second operand has 3 states, 3 states have (on average 8.333333333333334) internal successors, (25), 3 states have internal predecessors, (25), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-07 16:51:44,706 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-07 16:51:44,706 INFO L93 Difference]: Finished difference Result 685 states and 1198 transitions. [2024-11-07 16:51:44,706 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-07 16:51:44,706 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 8.333333333333334) internal successors, (25), 3 states have internal predecessors, (25), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 25 [2024-11-07 16:51:44,706 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-07 16:51:44,708 INFO L225 Difference]: With dead ends: 685 [2024-11-07 16:51:44,709 INFO L226 Difference]: Without dead ends: 685 [2024-11-07 16:51:44,709 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-07 16:51:44,711 INFO L432 NwaCegarLoop]: 123 mSDtfsCounter, 66 mSDsluCounter, 81 mSDsCounter, 0 mSdLazyCounter, 5 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 66 SdHoareTripleChecker+Valid, 204 SdHoareTripleChecker+Invalid, 7 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 5 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-11-07 16:51:44,712 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [66 Valid, 204 Invalid, 7 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 5 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-11-07 16:51:44,713 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 685 states. [2024-11-07 16:51:44,727 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 685 to 682. [2024-11-07 16:51:44,728 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 682 states, 681 states have (on average 1.7562408223201176) internal successors, (1196), 681 states have internal predecessors, (1196), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-07 16:51:44,730 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 682 states to 682 states and 1196 transitions. [2024-11-07 16:51:44,730 INFO L78 Accepts]: Start accepts. Automaton has 682 states and 1196 transitions. Word has length 25 [2024-11-07 16:51:44,730 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-07 16:51:44,730 INFO L471 AbstractCegarLoop]: Abstraction has 682 states and 1196 transitions. [2024-11-07 16:51:44,730 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 8.333333333333334) internal successors, (25), 3 states have internal predecessors, (25), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-07 16:51:44,730 INFO L276 IsEmpty]: Start isEmpty. Operand 682 states and 1196 transitions. [2024-11-07 16:51:44,731 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 27 [2024-11-07 16:51:44,731 INFO L207 NwaCegarLoop]: Found error trace [2024-11-07 16:51:44,733 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-07 16:51:44,733 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable11 [2024-11-07 16:51:44,733 INFO L396 AbstractCegarLoop]: === Iteration 13 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK === [ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_LEAK] === [2024-11-07 16:51:44,733 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-07 16:51:44,734 INFO L85 PathProgramCache]: Analyzing trace with hash -1868258392, now seen corresponding path program 1 times [2024-11-07 16:51:44,734 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-07 16:51:44,734 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1092678433] [2024-11-07 16:51:44,735 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-07 16:51:44,735 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-07 16:51:44,742 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 16:51:44,760 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-07 16:51:44,760 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-07 16:51:44,761 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1092678433] [2024-11-07 16:51:44,761 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1092678433] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-07 16:51:44,761 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-07 16:51:44,761 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-11-07 16:51:44,761 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1109060004] [2024-11-07 16:51:44,761 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-07 16:51:44,762 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-07 16:51:44,762 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-07 16:51:44,762 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-07 16:51:44,762 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-07 16:51:44,762 INFO L87 Difference]: Start difference. First operand 682 states and 1196 transitions. Second operand has 3 states, 3 states have (on average 8.666666666666666) internal successors, (26), 3 states have internal predecessors, (26), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-07 16:51:44,773 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-07 16:51:44,773 INFO L93 Difference]: Finished difference Result 697 states and 1206 transitions. [2024-11-07 16:51:44,773 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-07 16:51:44,774 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 8.666666666666666) internal successors, (26), 3 states have internal predecessors, (26), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 26 [2024-11-07 16:51:44,774 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-07 16:51:44,776 INFO L225 Difference]: With dead ends: 697 [2024-11-07 16:51:44,776 INFO L226 Difference]: Without dead ends: 697 [2024-11-07 16:51:44,776 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-07 16:51:44,776 INFO L432 NwaCegarLoop]: 135 mSDtfsCounter, 68 mSDsluCounter, 80 mSDsCounter, 0 mSdLazyCounter, 5 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 68 SdHoareTripleChecker+Valid, 215 SdHoareTripleChecker+Invalid, 6 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 5 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-11-07 16:51:44,776 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [68 Valid, 215 Invalid, 6 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 5 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-11-07 16:51:44,777 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 697 states. [2024-11-07 16:51:44,784 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 697 to 694. [2024-11-07 16:51:44,785 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 694 states, 693 states have (on average 1.7373737373737375) internal successors, (1204), 693 states have internal predecessors, (1204), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-07 16:51:44,787 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 694 states to 694 states and 1204 transitions. [2024-11-07 16:51:44,787 INFO L78 Accepts]: Start accepts. Automaton has 694 states and 1204 transitions. Word has length 26 [2024-11-07 16:51:44,787 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-07 16:51:44,787 INFO L471 AbstractCegarLoop]: Abstraction has 694 states and 1204 transitions. [2024-11-07 16:51:44,787 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 8.666666666666666) internal successors, (26), 3 states have internal predecessors, (26), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-07 16:51:44,787 INFO L276 IsEmpty]: Start isEmpty. Operand 694 states and 1204 transitions. [2024-11-07 16:51:44,788 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 27 [2024-11-07 16:51:44,788 INFO L207 NwaCegarLoop]: Found error trace [2024-11-07 16:51:44,788 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-07 16:51:44,788 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable12 [2024-11-07 16:51:44,788 INFO L396 AbstractCegarLoop]: === Iteration 14 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK === [ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_LEAK] === [2024-11-07 16:51:44,789 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-07 16:51:44,789 INFO L85 PathProgramCache]: Analyzing trace with hash 737765162, now seen corresponding path program 1 times [2024-11-07 16:51:44,789 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-07 16:51:44,789 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1058660112] [2024-11-07 16:51:44,789 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-07 16:51:44,789 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-07 16:51:44,794 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 16:51:44,805 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-07 16:51:44,805 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-07 16:51:44,805 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1058660112] [2024-11-07 16:51:44,805 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1058660112] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-07 16:51:44,805 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-07 16:51:44,805 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-11-07 16:51:44,805 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1862461749] [2024-11-07 16:51:44,805 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-07 16:51:44,806 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-07 16:51:44,806 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-07 16:51:44,806 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-07 16:51:44,806 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-07 16:51:44,806 INFO L87 Difference]: Start difference. First operand 694 states and 1204 transitions. Second operand has 3 states, 3 states have (on average 8.666666666666666) internal successors, (26), 3 states have internal predecessors, (26), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-07 16:51:44,818 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-07 16:51:44,818 INFO L93 Difference]: Finished difference Result 1289 states and 2254 transitions. [2024-11-07 16:51:44,818 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-07 16:51:44,818 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 8.666666666666666) internal successors, (26), 3 states have internal predecessors, (26), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 26 [2024-11-07 16:51:44,818 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-07 16:51:44,821 INFO L225 Difference]: With dead ends: 1289 [2024-11-07 16:51:44,821 INFO L226 Difference]: Without dead ends: 1289 [2024-11-07 16:51:44,822 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-07 16:51:44,822 INFO L432 NwaCegarLoop]: 89 mSDtfsCounter, 57 mSDsluCounter, 81 mSDsCounter, 0 mSdLazyCounter, 6 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 57 SdHoareTripleChecker+Valid, 170 SdHoareTripleChecker+Invalid, 6 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 6 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-11-07 16:51:44,822 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [57 Valid, 170 Invalid, 6 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 6 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-11-07 16:51:44,823 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1289 states. [2024-11-07 16:51:44,833 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1289 to 966. [2024-11-07 16:51:44,835 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 966 states, 965 states have (on average 1.7036269430051814) internal successors, (1644), 965 states have internal predecessors, (1644), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-07 16:51:44,849 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 966 states to 966 states and 1644 transitions. [2024-11-07 16:51:44,849 INFO L78 Accepts]: Start accepts. Automaton has 966 states and 1644 transitions. Word has length 26 [2024-11-07 16:51:44,849 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-07 16:51:44,849 INFO L471 AbstractCegarLoop]: Abstraction has 966 states and 1644 transitions. [2024-11-07 16:51:44,850 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 8.666666666666666) internal successors, (26), 3 states have internal predecessors, (26), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-07 16:51:44,850 INFO L276 IsEmpty]: Start isEmpty. Operand 966 states and 1644 transitions. [2024-11-07 16:51:44,852 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 27 [2024-11-07 16:51:44,853 INFO L207 NwaCegarLoop]: Found error trace [2024-11-07 16:51:44,853 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-07 16:51:44,853 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable13 [2024-11-07 16:51:44,853 INFO L396 AbstractCegarLoop]: === Iteration 15 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK === [ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_LEAK] === [2024-11-07 16:51:44,853 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-07 16:51:44,853 INFO L85 PathProgramCache]: Analyzing trace with hash -1256379544, now seen corresponding path program 1 times [2024-11-07 16:51:44,853 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-07 16:51:44,853 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1054299407] [2024-11-07 16:51:44,854 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-07 16:51:44,854 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-07 16:51:44,859 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 16:51:44,869 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-07 16:51:44,869 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-07 16:51:44,869 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1054299407] [2024-11-07 16:51:44,869 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1054299407] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-07 16:51:44,869 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-07 16:51:44,870 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-11-07 16:51:44,870 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [716995857] [2024-11-07 16:51:44,870 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-07 16:51:44,870 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-07 16:51:44,870 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-07 16:51:44,870 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-07 16:51:44,870 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-07 16:51:44,870 INFO L87 Difference]: Start difference. First operand 966 states and 1644 transitions. Second operand has 3 states, 3 states have (on average 8.666666666666666) internal successors, (26), 3 states have internal predecessors, (26), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-07 16:51:44,883 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-07 16:51:44,883 INFO L93 Difference]: Finished difference Result 1353 states and 2294 transitions. [2024-11-07 16:51:44,883 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-07 16:51:44,884 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 8.666666666666666) internal successors, (26), 3 states have internal predecessors, (26), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 26 [2024-11-07 16:51:44,884 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-07 16:51:44,887 INFO L225 Difference]: With dead ends: 1353 [2024-11-07 16:51:44,887 INFO L226 Difference]: Without dead ends: 1353 [2024-11-07 16:51:44,887 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-07 16:51:44,887 INFO L432 NwaCegarLoop]: 125 mSDtfsCounter, 65 mSDsluCounter, 80 mSDsCounter, 0 mSdLazyCounter, 5 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 65 SdHoareTripleChecker+Valid, 205 SdHoareTripleChecker+Invalid, 7 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 5 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-11-07 16:51:44,888 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [65 Valid, 205 Invalid, 7 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 5 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-11-07 16:51:44,888 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1353 states. [2024-11-07 16:51:44,900 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1353 to 1350. [2024-11-07 16:51:44,901 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1350 states, 1349 states have (on average 1.6990363232023722) internal successors, (2292), 1349 states have internal predecessors, (2292), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-07 16:51:44,905 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1350 states to 1350 states and 2292 transitions. [2024-11-07 16:51:44,905 INFO L78 Accepts]: Start accepts. Automaton has 1350 states and 2292 transitions. Word has length 26 [2024-11-07 16:51:44,905 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-07 16:51:44,905 INFO L471 AbstractCegarLoop]: Abstraction has 1350 states and 2292 transitions. [2024-11-07 16:51:44,905 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 8.666666666666666) internal successors, (26), 3 states have internal predecessors, (26), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-07 16:51:44,905 INFO L276 IsEmpty]: Start isEmpty. Operand 1350 states and 2292 transitions. [2024-11-07 16:51:44,906 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 28 [2024-11-07 16:51:44,906 INFO L207 NwaCegarLoop]: Found error trace [2024-11-07 16:51:44,906 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-07 16:51:44,906 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable14 [2024-11-07 16:51:44,906 INFO L396 AbstractCegarLoop]: === Iteration 16 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK === [ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_LEAK] === [2024-11-07 16:51:44,907 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-07 16:51:44,907 INFO L85 PathProgramCache]: Analyzing trace with hash 1402491608, now seen corresponding path program 1 times [2024-11-07 16:51:44,907 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-07 16:51:44,907 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [90348486] [2024-11-07 16:51:44,907 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-07 16:51:44,907 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-07 16:51:44,912 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 16:51:44,923 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-07 16:51:44,923 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-07 16:51:44,923 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [90348486] [2024-11-07 16:51:44,923 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [90348486] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-07 16:51:44,923 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-07 16:51:44,923 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-11-07 16:51:44,923 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [618607239] [2024-11-07 16:51:44,923 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-07 16:51:44,923 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-07 16:51:44,923 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-07 16:51:44,924 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-07 16:51:44,924 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-07 16:51:44,924 INFO L87 Difference]: Start difference. First operand 1350 states and 2292 transitions. Second operand has 3 states, 3 states have (on average 9.0) internal successors, (27), 3 states have internal predecessors, (27), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-07 16:51:44,935 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-07 16:51:44,935 INFO L93 Difference]: Finished difference Result 1369 states and 2294 transitions. [2024-11-07 16:51:44,936 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-07 16:51:44,936 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 9.0) internal successors, (27), 3 states have internal predecessors, (27), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 27 [2024-11-07 16:51:44,936 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-07 16:51:44,939 INFO L225 Difference]: With dead ends: 1369 [2024-11-07 16:51:44,939 INFO L226 Difference]: Without dead ends: 1369 [2024-11-07 16:51:44,939 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-07 16:51:44,939 INFO L432 NwaCegarLoop]: 132 mSDtfsCounter, 67 mSDsluCounter, 79 mSDsCounter, 0 mSdLazyCounter, 5 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 67 SdHoareTripleChecker+Valid, 211 SdHoareTripleChecker+Invalid, 6 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 5 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-11-07 16:51:44,940 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [67 Valid, 211 Invalid, 6 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 5 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-11-07 16:51:44,940 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1369 states. [2024-11-07 16:51:44,952 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1369 to 1366. [2024-11-07 16:51:44,953 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1366 states, 1365 states have (on average 1.6791208791208792) internal successors, (2292), 1365 states have internal predecessors, (2292), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-07 16:51:44,957 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1366 states to 1366 states and 2292 transitions. [2024-11-07 16:51:44,957 INFO L78 Accepts]: Start accepts. Automaton has 1366 states and 2292 transitions. Word has length 27 [2024-11-07 16:51:44,957 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-07 16:51:44,957 INFO L471 AbstractCegarLoop]: Abstraction has 1366 states and 2292 transitions. [2024-11-07 16:51:44,957 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 9.0) internal successors, (27), 3 states have internal predecessors, (27), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-07 16:51:44,957 INFO L276 IsEmpty]: Start isEmpty. Operand 1366 states and 2292 transitions. [2024-11-07 16:51:44,958 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 28 [2024-11-07 16:51:44,958 INFO L207 NwaCegarLoop]: Found error trace [2024-11-07 16:51:44,958 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-07 16:51:44,958 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable15 [2024-11-07 16:51:44,958 INFO L396 AbstractCegarLoop]: === Iteration 17 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK === [ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_LEAK] === [2024-11-07 16:51:44,958 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-07 16:51:44,959 INFO L85 PathProgramCache]: Analyzing trace with hash -286452134, now seen corresponding path program 1 times [2024-11-07 16:51:44,959 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-07 16:51:44,959 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1373749178] [2024-11-07 16:51:44,959 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-07 16:51:44,959 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-07 16:51:44,964 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 16:51:44,974 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-07 16:51:44,975 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-07 16:51:44,975 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1373749178] [2024-11-07 16:51:44,975 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1373749178] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-07 16:51:44,975 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-07 16:51:44,975 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-11-07 16:51:44,975 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1999378015] [2024-11-07 16:51:44,975 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-07 16:51:44,975 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-07 16:51:44,975 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-07 16:51:44,975 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-07 16:51:44,975 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-07 16:51:44,975 INFO L87 Difference]: Start difference. First operand 1366 states and 2292 transitions. Second operand has 3 states, 3 states have (on average 9.0) internal successors, (27), 3 states have internal predecessors, (27), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-07 16:51:45,004 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-07 16:51:45,004 INFO L93 Difference]: Finished difference Result 2505 states and 4246 transitions. [2024-11-07 16:51:45,005 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-07 16:51:45,005 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 9.0) internal successors, (27), 3 states have internal predecessors, (27), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 27 [2024-11-07 16:51:45,005 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-07 16:51:45,010 INFO L225 Difference]: With dead ends: 2505 [2024-11-07 16:51:45,010 INFO L226 Difference]: Without dead ends: 2505 [2024-11-07 16:51:45,011 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-07 16:51:45,011 INFO L432 NwaCegarLoop]: 88 mSDtfsCounter, 54 mSDsluCounter, 80 mSDsCounter, 0 mSdLazyCounter, 6 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 54 SdHoareTripleChecker+Valid, 168 SdHoareTripleChecker+Invalid, 6 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 6 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-11-07 16:51:45,011 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [54 Valid, 168 Invalid, 6 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 6 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-11-07 16:51:45,012 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2505 states. [2024-11-07 16:51:45,029 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2505 to 1926. [2024-11-07 16:51:45,031 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1926 states, 1925 states have (on average 1.6394805194805195) internal successors, (3156), 1925 states have internal predecessors, (3156), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-07 16:51:45,035 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1926 states to 1926 states and 3156 transitions. [2024-11-07 16:51:45,035 INFO L78 Accepts]: Start accepts. Automaton has 1926 states and 3156 transitions. Word has length 27 [2024-11-07 16:51:45,035 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-07 16:51:45,035 INFO L471 AbstractCegarLoop]: Abstraction has 1926 states and 3156 transitions. [2024-11-07 16:51:45,036 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 9.0) internal successors, (27), 3 states have internal predecessors, (27), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-07 16:51:45,036 INFO L276 IsEmpty]: Start isEmpty. Operand 1926 states and 3156 transitions. [2024-11-07 16:51:45,037 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 28 [2024-11-07 16:51:45,037 INFO L207 NwaCegarLoop]: Found error trace [2024-11-07 16:51:45,038 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-07 16:51:45,038 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable16 [2024-11-07 16:51:45,038 INFO L396 AbstractCegarLoop]: === Iteration 18 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK === [ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_LEAK] === [2024-11-07 16:51:45,038 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-07 16:51:45,038 INFO L85 PathProgramCache]: Analyzing trace with hash 2014370456, now seen corresponding path program 1 times [2024-11-07 16:51:45,038 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-07 16:51:45,038 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1880559577] [2024-11-07 16:51:45,038 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-07 16:51:45,039 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-07 16:51:45,044 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 16:51:45,057 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-07 16:51:45,057 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-07 16:51:45,057 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1880559577] [2024-11-07 16:51:45,057 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1880559577] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-07 16:51:45,057 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-07 16:51:45,057 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-11-07 16:51:45,057 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1751294394] [2024-11-07 16:51:45,058 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-07 16:51:45,058 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-07 16:51:45,058 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-07 16:51:45,058 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-07 16:51:45,058 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-07 16:51:45,058 INFO L87 Difference]: Start difference. First operand 1926 states and 3156 transitions. Second operand has 3 states, 3 states have (on average 9.0) internal successors, (27), 3 states have internal predecessors, (27), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-07 16:51:45,077 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-07 16:51:45,077 INFO L93 Difference]: Finished difference Result 2665 states and 4358 transitions. [2024-11-07 16:51:45,077 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-07 16:51:45,078 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 9.0) internal successors, (27), 3 states have internal predecessors, (27), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 27 [2024-11-07 16:51:45,078 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-07 16:51:45,083 INFO L225 Difference]: With dead ends: 2665 [2024-11-07 16:51:45,083 INFO L226 Difference]: Without dead ends: 2665 [2024-11-07 16:51:45,083 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-07 16:51:45,084 INFO L432 NwaCegarLoop]: 127 mSDtfsCounter, 64 mSDsluCounter, 79 mSDsCounter, 0 mSdLazyCounter, 5 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 64 SdHoareTripleChecker+Valid, 206 SdHoareTripleChecker+Invalid, 7 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 5 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-11-07 16:51:45,084 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [64 Valid, 206 Invalid, 7 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 5 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-11-07 16:51:45,085 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2665 states. [2024-11-07 16:51:45,114 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2665 to 2662. [2024-11-07 16:51:45,117 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 2662 states, 2661 states have (on average 1.636978579481398) internal successors, (4356), 2661 states have internal predecessors, (4356), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-07 16:51:45,123 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2662 states to 2662 states and 4356 transitions. [2024-11-07 16:51:45,123 INFO L78 Accepts]: Start accepts. Automaton has 2662 states and 4356 transitions. Word has length 27 [2024-11-07 16:51:45,124 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-07 16:51:45,124 INFO L471 AbstractCegarLoop]: Abstraction has 2662 states and 4356 transitions. [2024-11-07 16:51:45,124 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 9.0) internal successors, (27), 3 states have internal predecessors, (27), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-07 16:51:45,124 INFO L276 IsEmpty]: Start isEmpty. Operand 2662 states and 4356 transitions. [2024-11-07 16:51:45,126 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 29 [2024-11-07 16:51:45,126 INFO L207 NwaCegarLoop]: Found error trace [2024-11-07 16:51:45,126 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-07 16:51:45,126 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable17 [2024-11-07 16:51:45,126 INFO L396 AbstractCegarLoop]: === Iteration 19 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK === [ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_LEAK] === [2024-11-07 16:51:45,126 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-07 16:51:45,126 INFO L85 PathProgramCache]: Analyzing trace with hash -283462925, now seen corresponding path program 1 times [2024-11-07 16:51:45,126 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-07 16:51:45,127 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1380462945] [2024-11-07 16:51:45,127 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-07 16:51:45,127 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-07 16:51:45,132 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 16:51:45,143 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-07 16:51:45,143 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-07 16:51:45,143 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1380462945] [2024-11-07 16:51:45,143 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1380462945] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-07 16:51:45,144 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-07 16:51:45,144 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-11-07 16:51:45,144 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [163816784] [2024-11-07 16:51:45,144 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-07 16:51:45,144 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-07 16:51:45,144 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-07 16:51:45,145 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-07 16:51:45,145 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-07 16:51:45,145 INFO L87 Difference]: Start difference. First operand 2662 states and 4356 transitions. Second operand has 3 states, 3 states have (on average 9.333333333333334) internal successors, (28), 3 states have internal predecessors, (28), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-07 16:51:45,177 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-07 16:51:45,177 INFO L93 Difference]: Finished difference Result 2697 states and 4358 transitions. [2024-11-07 16:51:45,178 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-07 16:51:45,178 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 9.333333333333334) internal successors, (28), 3 states have internal predecessors, (28), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 28 [2024-11-07 16:51:45,178 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-07 16:51:45,187 INFO L225 Difference]: With dead ends: 2697 [2024-11-07 16:51:45,191 INFO L226 Difference]: Without dead ends: 2697 [2024-11-07 16:51:45,191 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-07 16:51:45,191 INFO L432 NwaCegarLoop]: 129 mSDtfsCounter, 66 mSDsluCounter, 78 mSDsCounter, 0 mSdLazyCounter, 5 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 66 SdHoareTripleChecker+Valid, 207 SdHoareTripleChecker+Invalid, 6 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 5 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-11-07 16:51:45,192 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [66 Valid, 207 Invalid, 6 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 5 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-11-07 16:51:45,193 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2697 states. [2024-11-07 16:51:45,256 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2697 to 2694. [2024-11-07 16:51:45,262 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 2694 states, 2693 states have (on average 1.617526921648719) internal successors, (4356), 2693 states have internal predecessors, (4356), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-07 16:51:45,275 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2694 states to 2694 states and 4356 transitions. [2024-11-07 16:51:45,275 INFO L78 Accepts]: Start accepts. Automaton has 2694 states and 4356 transitions. Word has length 28 [2024-11-07 16:51:45,275 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-07 16:51:45,275 INFO L471 AbstractCegarLoop]: Abstraction has 2694 states and 4356 transitions. [2024-11-07 16:51:45,276 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 9.333333333333334) internal successors, (28), 3 states have internal predecessors, (28), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-07 16:51:45,276 INFO L276 IsEmpty]: Start isEmpty. Operand 2694 states and 4356 transitions. [2024-11-07 16:51:45,281 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 29 [2024-11-07 16:51:45,281 INFO L207 NwaCegarLoop]: Found error trace [2024-11-07 16:51:45,281 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-07 16:51:45,282 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable18 [2024-11-07 16:51:45,282 INFO L396 AbstractCegarLoop]: === Iteration 20 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK === [ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_LEAK] === [2024-11-07 16:51:45,282 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-07 16:51:45,282 INFO L85 PathProgramCache]: Analyzing trace with hash -1972406667, now seen corresponding path program 1 times [2024-11-07 16:51:45,282 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-07 16:51:45,282 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [438578248] [2024-11-07 16:51:45,282 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-07 16:51:45,283 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-07 16:51:45,291 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 16:51:45,313 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-07 16:51:45,313 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-07 16:51:45,313 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [438578248] [2024-11-07 16:51:45,313 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [438578248] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-07 16:51:45,313 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-07 16:51:45,313 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-11-07 16:51:45,313 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1285221175] [2024-11-07 16:51:45,314 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-07 16:51:45,314 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-07 16:51:45,314 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-07 16:51:45,314 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-07 16:51:45,314 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-07 16:51:45,314 INFO L87 Difference]: Start difference. First operand 2694 states and 4356 transitions. Second operand has 3 states, 3 states have (on average 9.333333333333334) internal successors, (28), 3 states have internal predecessors, (28), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-07 16:51:45,355 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-07 16:51:45,359 INFO L93 Difference]: Finished difference Result 4873 states and 7974 transitions. [2024-11-07 16:51:45,359 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-07 16:51:45,359 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 9.333333333333334) internal successors, (28), 3 states have internal predecessors, (28), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 28 [2024-11-07 16:51:45,360 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-07 16:51:45,381 INFO L225 Difference]: With dead ends: 4873 [2024-11-07 16:51:45,381 INFO L226 Difference]: Without dead ends: 4873 [2024-11-07 16:51:45,381 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-07 16:51:45,382 INFO L432 NwaCegarLoop]: 87 mSDtfsCounter, 51 mSDsluCounter, 79 mSDsCounter, 0 mSdLazyCounter, 6 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 51 SdHoareTripleChecker+Valid, 166 SdHoareTripleChecker+Invalid, 6 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 6 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-11-07 16:51:45,382 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [51 Valid, 166 Invalid, 6 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 6 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-11-07 16:51:45,389 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 4873 states. [2024-11-07 16:51:45,439 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 4873 to 3846. [2024-11-07 16:51:45,443 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3846 states, 3845 states have (on average 1.5739921976592979) internal successors, (6052), 3845 states have internal predecessors, (6052), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-07 16:51:45,452 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3846 states to 3846 states and 6052 transitions. [2024-11-07 16:51:45,452 INFO L78 Accepts]: Start accepts. Automaton has 3846 states and 6052 transitions. Word has length 28 [2024-11-07 16:51:45,452 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-07 16:51:45,452 INFO L471 AbstractCegarLoop]: Abstraction has 3846 states and 6052 transitions. [2024-11-07 16:51:45,452 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 9.333333333333334) internal successors, (28), 3 states have internal predecessors, (28), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-07 16:51:45,452 INFO L276 IsEmpty]: Start isEmpty. Operand 3846 states and 6052 transitions. [2024-11-07 16:51:45,455 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 29 [2024-11-07 16:51:45,455 INFO L207 NwaCegarLoop]: Found error trace [2024-11-07 16:51:45,455 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-07 16:51:45,455 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable19 [2024-11-07 16:51:45,455 INFO L396 AbstractCegarLoop]: === Iteration 21 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK === [ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_LEAK] === [2024-11-07 16:51:45,455 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-07 16:51:45,456 INFO L85 PathProgramCache]: Analyzing trace with hash 328415923, now seen corresponding path program 1 times [2024-11-07 16:51:45,456 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-07 16:51:45,456 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2120792392] [2024-11-07 16:51:45,456 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-07 16:51:45,456 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-07 16:51:45,461 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 16:51:45,471 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-07 16:51:45,471 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-07 16:51:45,471 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2120792392] [2024-11-07 16:51:45,471 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2120792392] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-07 16:51:45,471 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-07 16:51:45,472 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-11-07 16:51:45,472 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [625335970] [2024-11-07 16:51:45,472 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-07 16:51:45,472 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-07 16:51:45,472 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-07 16:51:45,472 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-07 16:51:45,472 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-07 16:51:45,472 INFO L87 Difference]: Start difference. First operand 3846 states and 6052 transitions. Second operand has 3 states, 3 states have (on average 9.333333333333334) internal successors, (28), 3 states have internal predecessors, (28), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-07 16:51:45,511 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-07 16:51:45,512 INFO L93 Difference]: Finished difference Result 5257 states and 8262 transitions. [2024-11-07 16:51:45,512 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-07 16:51:45,512 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 9.333333333333334) internal successors, (28), 3 states have internal predecessors, (28), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 28 [2024-11-07 16:51:45,512 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-07 16:51:45,522 INFO L225 Difference]: With dead ends: 5257 [2024-11-07 16:51:45,522 INFO L226 Difference]: Without dead ends: 5257 [2024-11-07 16:51:45,522 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-07 16:51:45,522 INFO L432 NwaCegarLoop]: 129 mSDtfsCounter, 63 mSDsluCounter, 78 mSDsCounter, 0 mSdLazyCounter, 5 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 63 SdHoareTripleChecker+Valid, 207 SdHoareTripleChecker+Invalid, 7 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 5 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-11-07 16:51:45,523 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [63 Valid, 207 Invalid, 7 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 5 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-11-07 16:51:45,525 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 5257 states. [2024-11-07 16:51:45,564 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 5257 to 5254. [2024-11-07 16:51:45,569 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 5254 states, 5253 states have (on average 1.5724347991623835) internal successors, (8260), 5253 states have internal predecessors, (8260), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-07 16:51:45,584 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5254 states to 5254 states and 8260 transitions. [2024-11-07 16:51:45,585 INFO L78 Accepts]: Start accepts. Automaton has 5254 states and 8260 transitions. Word has length 28 [2024-11-07 16:51:45,585 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-07 16:51:45,585 INFO L471 AbstractCegarLoop]: Abstraction has 5254 states and 8260 transitions. [2024-11-07 16:51:45,585 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 9.333333333333334) internal successors, (28), 3 states have internal predecessors, (28), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-07 16:51:45,585 INFO L276 IsEmpty]: Start isEmpty. Operand 5254 states and 8260 transitions. [2024-11-07 16:51:45,588 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 30 [2024-11-07 16:51:45,588 INFO L207 NwaCegarLoop]: Found error trace [2024-11-07 16:51:45,588 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-07 16:51:45,588 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable20 [2024-11-07 16:51:45,588 INFO L396 AbstractCegarLoop]: === Iteration 22 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK === [ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_LEAK] === [2024-11-07 16:51:45,588 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-07 16:51:45,589 INFO L85 PathProgramCache]: Analyzing trace with hash -1008435325, now seen corresponding path program 1 times [2024-11-07 16:51:45,589 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-07 16:51:45,589 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1868210574] [2024-11-07 16:51:45,589 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-07 16:51:45,589 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-07 16:51:45,596 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 16:51:45,608 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-07 16:51:45,608 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-07 16:51:45,608 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1868210574] [2024-11-07 16:51:45,608 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1868210574] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-07 16:51:45,608 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-07 16:51:45,608 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-11-07 16:51:45,609 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1129862732] [2024-11-07 16:51:45,609 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-07 16:51:45,609 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-07 16:51:45,609 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-07 16:51:45,609 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-07 16:51:45,609 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-07 16:51:45,609 INFO L87 Difference]: Start difference. First operand 5254 states and 8260 transitions. Second operand has 3 states, 3 states have (on average 9.666666666666666) internal successors, (29), 3 states have internal predecessors, (29), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-07 16:51:45,633 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-07 16:51:45,634 INFO L93 Difference]: Finished difference Result 5321 states and 8262 transitions. [2024-11-07 16:51:45,634 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-07 16:51:45,635 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 9.666666666666666) internal successors, (29), 3 states have internal predecessors, (29), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 29 [2024-11-07 16:51:45,635 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-07 16:51:45,648 INFO L225 Difference]: With dead ends: 5321 [2024-11-07 16:51:45,650 INFO L226 Difference]: Without dead ends: 5321 [2024-11-07 16:51:45,650 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-07 16:51:45,651 INFO L432 NwaCegarLoop]: 126 mSDtfsCounter, 65 mSDsluCounter, 77 mSDsCounter, 0 mSdLazyCounter, 5 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 65 SdHoareTripleChecker+Valid, 203 SdHoareTripleChecker+Invalid, 6 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 5 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-11-07 16:51:45,651 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [65 Valid, 203 Invalid, 6 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 5 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-11-07 16:51:45,654 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 5321 states. [2024-11-07 16:51:45,714 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 5321 to 5318. [2024-11-07 16:51:45,723 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 5318 states, 5317 states have (on average 1.5535076170772992) internal successors, (8260), 5317 states have internal predecessors, (8260), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-07 16:51:45,737 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5318 states to 5318 states and 8260 transitions. [2024-11-07 16:51:45,737 INFO L78 Accepts]: Start accepts. Automaton has 5318 states and 8260 transitions. Word has length 29 [2024-11-07 16:51:45,737 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-07 16:51:45,737 INFO L471 AbstractCegarLoop]: Abstraction has 5318 states and 8260 transitions. [2024-11-07 16:51:45,737 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 9.666666666666666) internal successors, (29), 3 states have internal predecessors, (29), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-07 16:51:45,737 INFO L276 IsEmpty]: Start isEmpty. Operand 5318 states and 8260 transitions. [2024-11-07 16:51:45,740 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 30 [2024-11-07 16:51:45,740 INFO L207 NwaCegarLoop]: Found error trace [2024-11-07 16:51:45,740 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-07 16:51:45,740 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable21 [2024-11-07 16:51:45,740 INFO L396 AbstractCegarLoop]: === Iteration 23 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK === [ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_LEAK] === [2024-11-07 16:51:45,741 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-07 16:51:45,741 INFO L85 PathProgramCache]: Analyzing trace with hash 1597588229, now seen corresponding path program 1 times [2024-11-07 16:51:45,741 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-07 16:51:45,741 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1090229995] [2024-11-07 16:51:45,741 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-07 16:51:45,741 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-07 16:51:45,747 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 16:51:45,760 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-07 16:51:45,760 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-07 16:51:45,760 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1090229995] [2024-11-07 16:51:45,760 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1090229995] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-07 16:51:45,760 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-07 16:51:45,760 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-11-07 16:51:45,760 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [257873032] [2024-11-07 16:51:45,760 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-07 16:51:45,760 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-07 16:51:45,760 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-07 16:51:45,761 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-07 16:51:45,761 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-07 16:51:45,761 INFO L87 Difference]: Start difference. First operand 5318 states and 8260 transitions. Second operand has 3 states, 3 states have (on average 9.666666666666666) internal successors, (29), 3 states have internal predecessors, (29), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-07 16:51:45,817 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-07 16:51:45,817 INFO L93 Difference]: Finished difference Result 9481 states and 14918 transitions. [2024-11-07 16:51:45,817 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-07 16:51:45,818 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 9.666666666666666) internal successors, (29), 3 states have internal predecessors, (29), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 29 [2024-11-07 16:51:45,818 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-07 16:51:45,830 INFO L225 Difference]: With dead ends: 9481 [2024-11-07 16:51:45,830 INFO L226 Difference]: Without dead ends: 9481 [2024-11-07 16:51:45,830 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-07 16:51:45,830 INFO L432 NwaCegarLoop]: 86 mSDtfsCounter, 48 mSDsluCounter, 78 mSDsCounter, 0 mSdLazyCounter, 6 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 48 SdHoareTripleChecker+Valid, 164 SdHoareTripleChecker+Invalid, 6 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 6 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-11-07 16:51:45,831 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [48 Valid, 164 Invalid, 6 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 6 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-11-07 16:51:45,835 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 9481 states. [2024-11-07 16:51:45,916 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 9481 to 7686. [2024-11-07 16:51:45,927 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 7686 states, 7685 states have (on average 1.5078724788549123) internal successors, (11588), 7685 states have internal predecessors, (11588), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-07 16:51:45,949 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7686 states to 7686 states and 11588 transitions. [2024-11-07 16:51:45,949 INFO L78 Accepts]: Start accepts. Automaton has 7686 states and 11588 transitions. Word has length 29 [2024-11-07 16:51:45,950 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-07 16:51:45,950 INFO L471 AbstractCegarLoop]: Abstraction has 7686 states and 11588 transitions. [2024-11-07 16:51:45,950 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 9.666666666666666) internal successors, (29), 3 states have internal predecessors, (29), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-07 16:51:45,950 INFO L276 IsEmpty]: Start isEmpty. Operand 7686 states and 11588 transitions. [2024-11-07 16:51:45,957 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 30 [2024-11-07 16:51:45,957 INFO L207 NwaCegarLoop]: Found error trace [2024-11-07 16:51:45,957 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-07 16:51:45,957 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable22 [2024-11-07 16:51:45,957 INFO L396 AbstractCegarLoop]: === Iteration 24 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK === [ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_LEAK] === [2024-11-07 16:51:45,958 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-07 16:51:45,958 INFO L85 PathProgramCache]: Analyzing trace with hash -396556477, now seen corresponding path program 1 times [2024-11-07 16:51:45,958 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-07 16:51:45,958 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1303579723] [2024-11-07 16:51:45,958 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-07 16:51:45,958 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-07 16:51:45,966 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 16:51:45,986 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-07 16:51:45,986 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-07 16:51:45,986 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1303579723] [2024-11-07 16:51:45,986 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1303579723] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-07 16:51:45,986 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-07 16:51:45,986 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-11-07 16:51:45,986 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [321621142] [2024-11-07 16:51:45,986 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-07 16:51:45,986 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-07 16:51:45,987 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-07 16:51:45,987 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-07 16:51:45,987 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-07 16:51:45,987 INFO L87 Difference]: Start difference. First operand 7686 states and 11588 transitions. Second operand has 3 states, 3 states have (on average 9.666666666666666) internal successors, (29), 3 states have internal predecessors, (29), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-07 16:51:46,039 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-07 16:51:46,039 INFO L93 Difference]: Finished difference Result 10377 states and 15622 transitions. [2024-11-07 16:51:46,039 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-07 16:51:46,040 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 9.666666666666666) internal successors, (29), 3 states have internal predecessors, (29), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 29 [2024-11-07 16:51:46,040 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-07 16:51:46,052 INFO L225 Difference]: With dead ends: 10377 [2024-11-07 16:51:46,052 INFO L226 Difference]: Without dead ends: 10377 [2024-11-07 16:51:46,053 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-07 16:51:46,053 INFO L432 NwaCegarLoop]: 131 mSDtfsCounter, 62 mSDsluCounter, 77 mSDsCounter, 0 mSdLazyCounter, 5 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 62 SdHoareTripleChecker+Valid, 208 SdHoareTripleChecker+Invalid, 7 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 5 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-11-07 16:51:46,054 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [62 Valid, 208 Invalid, 7 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 5 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-11-07 16:51:46,060 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 10377 states. [2024-11-07 16:51:46,165 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 10377 to 10374. [2024-11-07 16:51:46,174 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 10374 states, 10373 states have (on average 1.5058324496288442) internal successors, (15620), 10373 states have internal predecessors, (15620), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-07 16:51:46,200 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 10374 states to 10374 states and 15620 transitions. [2024-11-07 16:51:46,200 INFO L78 Accepts]: Start accepts. Automaton has 10374 states and 15620 transitions. Word has length 29 [2024-11-07 16:51:46,200 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-07 16:51:46,200 INFO L471 AbstractCegarLoop]: Abstraction has 10374 states and 15620 transitions. [2024-11-07 16:51:46,200 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 9.666666666666666) internal successors, (29), 3 states have internal predecessors, (29), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-07 16:51:46,201 INFO L276 IsEmpty]: Start isEmpty. Operand 10374 states and 15620 transitions. [2024-11-07 16:51:46,206 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 31 [2024-11-07 16:51:46,206 INFO L207 NwaCegarLoop]: Found error trace [2024-11-07 16:51:46,206 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-07 16:51:46,207 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable23 [2024-11-07 16:51:46,207 INFO L396 AbstractCegarLoop]: === Iteration 25 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK === [ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_LEAK] === [2024-11-07 16:51:46,207 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-07 16:51:46,207 INFO L85 PathProgramCache]: Analyzing trace with hash -2007732674, now seen corresponding path program 1 times [2024-11-07 16:51:46,207 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-07 16:51:46,207 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [56464538] [2024-11-07 16:51:46,207 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-07 16:51:46,208 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-07 16:51:46,214 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 16:51:46,225 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-07 16:51:46,225 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-07 16:51:46,225 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [56464538] [2024-11-07 16:51:46,225 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [56464538] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-07 16:51:46,225 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-07 16:51:46,225 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-11-07 16:51:46,226 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1507772536] [2024-11-07 16:51:46,226 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-07 16:51:46,226 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-07 16:51:46,226 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-07 16:51:46,226 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-07 16:51:46,227 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-07 16:51:46,227 INFO L87 Difference]: Start difference. First operand 10374 states and 15620 transitions. Second operand has 3 states, 3 states have (on average 10.0) internal successors, (30), 3 states have internal predecessors, (30), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-07 16:51:46,273 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-07 16:51:46,273 INFO L93 Difference]: Finished difference Result 10505 states and 15622 transitions. [2024-11-07 16:51:46,273 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-07 16:51:46,273 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 10.0) internal successors, (30), 3 states have internal predecessors, (30), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 30 [2024-11-07 16:51:46,273 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-07 16:51:46,285 INFO L225 Difference]: With dead ends: 10505 [2024-11-07 16:51:46,285 INFO L226 Difference]: Without dead ends: 10505 [2024-11-07 16:51:46,285 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-07 16:51:46,285 INFO L432 NwaCegarLoop]: 123 mSDtfsCounter, 64 mSDsluCounter, 76 mSDsCounter, 0 mSdLazyCounter, 5 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 64 SdHoareTripleChecker+Valid, 199 SdHoareTripleChecker+Invalid, 6 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 5 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-11-07 16:51:46,286 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [64 Valid, 199 Invalid, 6 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 5 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-11-07 16:51:46,292 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 10505 states. [2024-11-07 16:51:46,421 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 10505 to 10502. [2024-11-07 16:51:46,430 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 10502 states, 10501 states have (on average 1.4874773831063708) internal successors, (15620), 10501 states have internal predecessors, (15620), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-07 16:51:46,446 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 10502 states to 10502 states and 15620 transitions. [2024-11-07 16:51:46,446 INFO L78 Accepts]: Start accepts. Automaton has 10502 states and 15620 transitions. Word has length 30 [2024-11-07 16:51:46,447 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-07 16:51:46,447 INFO L471 AbstractCegarLoop]: Abstraction has 10502 states and 15620 transitions. [2024-11-07 16:51:46,447 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 10.0) internal successors, (30), 3 states have internal predecessors, (30), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-07 16:51:46,447 INFO L276 IsEmpty]: Start isEmpty. Operand 10502 states and 15620 transitions. [2024-11-07 16:51:46,452 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 31 [2024-11-07 16:51:46,453 INFO L207 NwaCegarLoop]: Found error trace [2024-11-07 16:51:46,453 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-07 16:51:46,453 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable24 [2024-11-07 16:51:46,453 INFO L396 AbstractCegarLoop]: === Iteration 26 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK === [ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_LEAK] === [2024-11-07 16:51:46,453 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-07 16:51:46,453 INFO L85 PathProgramCache]: Analyzing trace with hash 598290880, now seen corresponding path program 1 times [2024-11-07 16:51:46,453 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-07 16:51:46,453 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1496127507] [2024-11-07 16:51:46,454 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-07 16:51:46,454 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-07 16:51:46,458 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 16:51:46,468 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-07 16:51:46,469 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-07 16:51:46,469 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1496127507] [2024-11-07 16:51:46,469 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1496127507] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-07 16:51:46,469 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-07 16:51:46,469 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-11-07 16:51:46,469 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [323194979] [2024-11-07 16:51:46,469 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-07 16:51:46,469 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-07 16:51:46,469 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-07 16:51:46,470 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-07 16:51:46,470 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-07 16:51:46,470 INFO L87 Difference]: Start difference. First operand 10502 states and 15620 transitions. Second operand has 3 states, 3 states have (on average 10.0) internal successors, (30), 3 states have internal predecessors, (30), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-07 16:51:46,568 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-07 16:51:46,569 INFO L93 Difference]: Finished difference Result 18441 states and 27782 transitions. [2024-11-07 16:51:46,569 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-07 16:51:46,569 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 10.0) internal successors, (30), 3 states have internal predecessors, (30), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 30 [2024-11-07 16:51:46,569 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-07 16:51:46,589 INFO L225 Difference]: With dead ends: 18441 [2024-11-07 16:51:46,589 INFO L226 Difference]: Without dead ends: 18441 [2024-11-07 16:51:46,590 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-07 16:51:46,590 INFO L432 NwaCegarLoop]: 85 mSDtfsCounter, 45 mSDsluCounter, 77 mSDsCounter, 0 mSdLazyCounter, 6 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 45 SdHoareTripleChecker+Valid, 162 SdHoareTripleChecker+Invalid, 6 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 6 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-11-07 16:51:46,590 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [45 Valid, 162 Invalid, 6 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 6 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-11-07 16:51:46,597 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 18441 states. [2024-11-07 16:51:46,761 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 18441 to 15366. [2024-11-07 16:51:46,778 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 15366 states, 15365 states have (on average 1.4414578587699316) internal successors, (22148), 15365 states have internal predecessors, (22148), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-07 16:51:46,810 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 15366 states to 15366 states and 22148 transitions. [2024-11-07 16:51:46,811 INFO L78 Accepts]: Start accepts. Automaton has 15366 states and 22148 transitions. Word has length 30 [2024-11-07 16:51:46,811 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-07 16:51:46,811 INFO L471 AbstractCegarLoop]: Abstraction has 15366 states and 22148 transitions. [2024-11-07 16:51:46,811 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 10.0) internal successors, (30), 3 states have internal predecessors, (30), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-07 16:51:46,811 INFO L276 IsEmpty]: Start isEmpty. Operand 15366 states and 22148 transitions. [2024-11-07 16:51:46,826 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 31 [2024-11-07 16:51:46,826 INFO L207 NwaCegarLoop]: Found error trace [2024-11-07 16:51:46,826 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-07 16:51:46,826 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable25 [2024-11-07 16:51:46,827 INFO L396 AbstractCegarLoop]: === Iteration 27 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK === [ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_LEAK] === [2024-11-07 16:51:46,827 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-07 16:51:46,827 INFO L85 PathProgramCache]: Analyzing trace with hash -1395853826, now seen corresponding path program 1 times [2024-11-07 16:51:46,827 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-07 16:51:46,827 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [749861726] [2024-11-07 16:51:46,827 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-07 16:51:46,827 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-07 16:51:46,833 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 16:51:46,845 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-07 16:51:46,845 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-07 16:51:46,845 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [749861726] [2024-11-07 16:51:46,845 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [749861726] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-07 16:51:46,845 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-07 16:51:46,846 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-11-07 16:51:46,846 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2046653479] [2024-11-07 16:51:46,846 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-07 16:51:46,846 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-07 16:51:46,846 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-07 16:51:46,847 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-07 16:51:46,847 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-07 16:51:46,847 INFO L87 Difference]: Start difference. First operand 15366 states and 22148 transitions. Second operand has 3 states, 3 states have (on average 10.0) internal successors, (30), 3 states have internal predecessors, (30), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-07 16:51:46,895 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-07 16:51:46,896 INFO L93 Difference]: Finished difference Result 20489 states and 29446 transitions. [2024-11-07 16:51:46,896 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-07 16:51:46,896 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 10.0) internal successors, (30), 3 states have internal predecessors, (30), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 30 [2024-11-07 16:51:46,896 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-07 16:51:46,926 INFO L225 Difference]: With dead ends: 20489 [2024-11-07 16:51:46,926 INFO L226 Difference]: Without dead ends: 20489 [2024-11-07 16:51:46,926 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-07 16:51:46,926 INFO L432 NwaCegarLoop]: 133 mSDtfsCounter, 61 mSDsluCounter, 76 mSDsCounter, 0 mSdLazyCounter, 5 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 61 SdHoareTripleChecker+Valid, 209 SdHoareTripleChecker+Invalid, 7 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 5 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-11-07 16:51:46,927 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [61 Valid, 209 Invalid, 7 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 5 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-11-07 16:51:46,936 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 20489 states. [2024-11-07 16:51:47,132 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 20489 to 20486. [2024-11-07 16:51:47,155 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 20486 states, 20485 states have (on average 1.437344398340249) internal successors, (29444), 20485 states have internal predecessors, (29444), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-07 16:51:47,192 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 20486 states to 20486 states and 29444 transitions. [2024-11-07 16:51:47,192 INFO L78 Accepts]: Start accepts. Automaton has 20486 states and 29444 transitions. Word has length 30 [2024-11-07 16:51:47,192 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-07 16:51:47,192 INFO L471 AbstractCegarLoop]: Abstraction has 20486 states and 29444 transitions. [2024-11-07 16:51:47,193 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 10.0) internal successors, (30), 3 states have internal predecessors, (30), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-07 16:51:47,193 INFO L276 IsEmpty]: Start isEmpty. Operand 20486 states and 29444 transitions. [2024-11-07 16:51:47,208 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 32 [2024-11-07 16:51:47,208 INFO L207 NwaCegarLoop]: Found error trace [2024-11-07 16:51:47,208 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-07 16:51:47,209 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable26 [2024-11-07 16:51:47,209 INFO L396 AbstractCegarLoop]: === Iteration 28 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK === [ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_LEAK] === [2024-11-07 16:51:47,209 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-07 16:51:47,209 INFO L85 PathProgramCache]: Analyzing trace with hash 1373798446, now seen corresponding path program 1 times [2024-11-07 16:51:47,209 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-07 16:51:47,209 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [231007105] [2024-11-07 16:51:47,209 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-07 16:51:47,209 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-07 16:51:47,215 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 16:51:47,230 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-07 16:51:47,230 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-07 16:51:47,230 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [231007105] [2024-11-07 16:51:47,230 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [231007105] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-07 16:51:47,230 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-07 16:51:47,230 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-11-07 16:51:47,230 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1269832152] [2024-11-07 16:51:47,230 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-07 16:51:47,230 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-07 16:51:47,231 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-07 16:51:47,231 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-07 16:51:47,231 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-07 16:51:47,231 INFO L87 Difference]: Start difference. First operand 20486 states and 29444 transitions. Second operand has 3 states, 3 states have (on average 10.333333333333334) internal successors, (31), 3 states have internal predecessors, (31), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-07 16:51:47,330 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-07 16:51:47,330 INFO L93 Difference]: Finished difference Result 20745 states and 29446 transitions. [2024-11-07 16:51:47,330 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-07 16:51:47,331 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 10.333333333333334) internal successors, (31), 3 states have internal predecessors, (31), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 31 [2024-11-07 16:51:47,331 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-07 16:51:47,355 INFO L225 Difference]: With dead ends: 20745 [2024-11-07 16:51:47,355 INFO L226 Difference]: Without dead ends: 20745 [2024-11-07 16:51:47,355 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-07 16:51:47,356 INFO L432 NwaCegarLoop]: 120 mSDtfsCounter, 63 mSDsluCounter, 75 mSDsCounter, 0 mSdLazyCounter, 5 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 63 SdHoareTripleChecker+Valid, 195 SdHoareTripleChecker+Invalid, 6 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 5 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-11-07 16:51:47,356 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [63 Valid, 195 Invalid, 6 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 5 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-11-07 16:51:47,360 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 20745 states. [2024-11-07 16:51:47,474 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 20745 to 20742. [2024-11-07 16:51:47,495 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 20742 states, 20741 states have (on average 1.4196036835253845) internal successors, (29444), 20741 states have internal predecessors, (29444), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-07 16:51:47,525 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 20742 states to 20742 states and 29444 transitions. [2024-11-07 16:51:47,526 INFO L78 Accepts]: Start accepts. Automaton has 20742 states and 29444 transitions. Word has length 31 [2024-11-07 16:51:47,526 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-07 16:51:47,526 INFO L471 AbstractCegarLoop]: Abstraction has 20742 states and 29444 transitions. [2024-11-07 16:51:47,526 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 10.333333333333334) internal successors, (31), 3 states have internal predecessors, (31), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-07 16:51:47,526 INFO L276 IsEmpty]: Start isEmpty. Operand 20742 states and 29444 transitions. [2024-11-07 16:51:47,538 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 32 [2024-11-07 16:51:47,538 INFO L207 NwaCegarLoop]: Found error trace [2024-11-07 16:51:47,539 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-07 16:51:47,539 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable27 [2024-11-07 16:51:47,539 INFO L396 AbstractCegarLoop]: === Iteration 29 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK === [ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_LEAK] === [2024-11-07 16:51:47,539 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-07 16:51:47,539 INFO L85 PathProgramCache]: Analyzing trace with hash -315145296, now seen corresponding path program 1 times [2024-11-07 16:51:47,539 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-07 16:51:47,539 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [134386383] [2024-11-07 16:51:47,539 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-07 16:51:47,539 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-07 16:51:47,544 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 16:51:47,554 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-07 16:51:47,554 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-07 16:51:47,554 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [134386383] [2024-11-07 16:51:47,554 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [134386383] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-07 16:51:47,554 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-07 16:51:47,554 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-11-07 16:51:47,554 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [670280272] [2024-11-07 16:51:47,554 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-07 16:51:47,555 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-07 16:51:47,555 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-07 16:51:47,555 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-07 16:51:47,555 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-07 16:51:47,555 INFO L87 Difference]: Start difference. First operand 20742 states and 29444 transitions. Second operand has 3 states, 3 states have (on average 10.333333333333334) internal successors, (31), 3 states have internal predecessors, (31), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-07 16:51:47,609 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-07 16:51:47,609 INFO L93 Difference]: Finished difference Result 35849 states and 51462 transitions. [2024-11-07 16:51:47,609 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-07 16:51:47,609 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 10.333333333333334) internal successors, (31), 3 states have internal predecessors, (31), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 31 [2024-11-07 16:51:47,609 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-07 16:51:47,659 INFO L225 Difference]: With dead ends: 35849 [2024-11-07 16:51:47,659 INFO L226 Difference]: Without dead ends: 35849 [2024-11-07 16:51:47,660 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-07 16:51:47,660 INFO L432 NwaCegarLoop]: 84 mSDtfsCounter, 42 mSDsluCounter, 76 mSDsCounter, 0 mSdLazyCounter, 6 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 42 SdHoareTripleChecker+Valid, 160 SdHoareTripleChecker+Invalid, 6 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 6 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-11-07 16:51:47,660 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [42 Valid, 160 Invalid, 6 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 6 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-11-07 16:51:47,670 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 35849 states. [2024-11-07 16:51:47,901 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 35849 to 30726. [2024-11-07 16:51:47,927 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 30726 states, 30725 states have (on average 1.3749064279902359) internal successors, (42244), 30725 states have internal predecessors, (42244), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-07 16:51:47,960 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 30726 states to 30726 states and 42244 transitions. [2024-11-07 16:51:47,961 INFO L78 Accepts]: Start accepts. Automaton has 30726 states and 42244 transitions. Word has length 31 [2024-11-07 16:51:47,961 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-07 16:51:47,961 INFO L471 AbstractCegarLoop]: Abstraction has 30726 states and 42244 transitions. [2024-11-07 16:51:47,961 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 10.333333333333334) internal successors, (31), 3 states have internal predecessors, (31), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-07 16:51:47,961 INFO L276 IsEmpty]: Start isEmpty. Operand 30726 states and 42244 transitions. [2024-11-07 16:51:47,981 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 32 [2024-11-07 16:51:47,981 INFO L207 NwaCegarLoop]: Found error trace [2024-11-07 16:51:47,981 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-07 16:51:47,981 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable28 [2024-11-07 16:51:47,981 INFO L396 AbstractCegarLoop]: === Iteration 30 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK === [ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_LEAK] === [2024-11-07 16:51:47,982 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-07 16:51:47,982 INFO L85 PathProgramCache]: Analyzing trace with hash 1985677294, now seen corresponding path program 1 times [2024-11-07 16:51:47,982 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-07 16:51:47,982 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [591393135] [2024-11-07 16:51:47,982 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-07 16:51:47,982 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-07 16:51:47,986 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 16:51:47,996 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-07 16:51:47,996 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-07 16:51:47,996 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [591393135] [2024-11-07 16:51:47,996 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [591393135] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-07 16:51:47,996 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-07 16:51:47,996 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-11-07 16:51:47,996 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [252225636] [2024-11-07 16:51:47,996 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-07 16:51:47,996 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-07 16:51:47,996 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-07 16:51:47,996 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-07 16:51:47,996 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-07 16:51:47,996 INFO L87 Difference]: Start difference. First operand 30726 states and 42244 transitions. Second operand has 3 states, 3 states have (on average 10.333333333333334) internal successors, (31), 3 states have internal predecessors, (31), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-07 16:51:48,060 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-07 16:51:48,060 INFO L93 Difference]: Finished difference Result 40457 states and 55302 transitions. [2024-11-07 16:51:48,060 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-07 16:51:48,060 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 10.333333333333334) internal successors, (31), 3 states have internal predecessors, (31), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 31 [2024-11-07 16:51:48,060 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-07 16:51:48,116 INFO L225 Difference]: With dead ends: 40457 [2024-11-07 16:51:48,116 INFO L226 Difference]: Without dead ends: 40457 [2024-11-07 16:51:48,117 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-07 16:51:48,117 INFO L432 NwaCegarLoop]: 135 mSDtfsCounter, 60 mSDsluCounter, 75 mSDsCounter, 0 mSdLazyCounter, 5 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 60 SdHoareTripleChecker+Valid, 210 SdHoareTripleChecker+Invalid, 7 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 5 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-11-07 16:51:48,117 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [60 Valid, 210 Invalid, 7 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 5 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-11-07 16:51:48,131 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 40457 states. [2024-11-07 16:51:48,575 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 40457 to 40454. [2024-11-07 16:51:48,616 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 40454 states, 40453 states have (on average 1.3670185153140681) internal successors, (55300), 40453 states have internal predecessors, (55300), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-07 16:51:48,674 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 40454 states to 40454 states and 55300 transitions. [2024-11-07 16:51:48,675 INFO L78 Accepts]: Start accepts. Automaton has 40454 states and 55300 transitions. Word has length 31 [2024-11-07 16:51:48,675 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-07 16:51:48,675 INFO L471 AbstractCegarLoop]: Abstraction has 40454 states and 55300 transitions. [2024-11-07 16:51:48,675 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 10.333333333333334) internal successors, (31), 3 states have internal predecessors, (31), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-07 16:51:48,675 INFO L276 IsEmpty]: Start isEmpty. Operand 40454 states and 55300 transitions. [2024-11-07 16:51:48,696 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 33 [2024-11-07 16:51:48,696 INFO L207 NwaCegarLoop]: Found error trace [2024-11-07 16:51:48,696 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-07 16:51:48,696 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable29 [2024-11-07 16:51:48,696 INFO L396 AbstractCegarLoop]: === Iteration 31 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK === [ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_LEAK] === [2024-11-07 16:51:48,697 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-07 16:51:48,697 INFO L85 PathProgramCache]: Analyzing trace with hash -1172908663, now seen corresponding path program 1 times [2024-11-07 16:51:48,697 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-07 16:51:48,697 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1624373346] [2024-11-07 16:51:48,697 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-07 16:51:48,697 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-07 16:51:48,703 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 16:51:48,715 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-07 16:51:48,715 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-07 16:51:48,715 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1624373346] [2024-11-07 16:51:48,715 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1624373346] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-07 16:51:48,715 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-07 16:51:48,715 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-11-07 16:51:48,715 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1638042880] [2024-11-07 16:51:48,715 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-07 16:51:48,716 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-07 16:51:48,716 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-07 16:51:48,716 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-07 16:51:48,716 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-07 16:51:48,716 INFO L87 Difference]: Start difference. First operand 40454 states and 55300 transitions. Second operand has 3 states, 3 states have (on average 10.666666666666666) internal successors, (32), 3 states have internal predecessors, (32), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-07 16:51:48,806 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-07 16:51:48,806 INFO L93 Difference]: Finished difference Result 40969 states and 55302 transitions. [2024-11-07 16:51:48,806 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-07 16:51:48,806 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 10.666666666666666) internal successors, (32), 3 states have internal predecessors, (32), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 32 [2024-11-07 16:51:48,807 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-07 16:51:48,868 INFO L225 Difference]: With dead ends: 40969 [2024-11-07 16:51:48,869 INFO L226 Difference]: Without dead ends: 40969 [2024-11-07 16:51:48,869 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-07 16:51:48,869 INFO L432 NwaCegarLoop]: 117 mSDtfsCounter, 62 mSDsluCounter, 74 mSDsCounter, 0 mSdLazyCounter, 5 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 62 SdHoareTripleChecker+Valid, 191 SdHoareTripleChecker+Invalid, 6 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 5 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-11-07 16:51:48,870 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [62 Valid, 191 Invalid, 6 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 5 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-11-07 16:51:48,885 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 40969 states. [2024-11-07 16:51:49,269 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 40969 to 40966. [2024-11-07 16:51:49,307 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 40966 states, 40965 states have (on average 1.3499328695227633) internal successors, (55300), 40965 states have internal predecessors, (55300), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-07 16:51:49,366 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 40966 states to 40966 states and 55300 transitions. [2024-11-07 16:51:49,366 INFO L78 Accepts]: Start accepts. Automaton has 40966 states and 55300 transitions. Word has length 32 [2024-11-07 16:51:49,367 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-07 16:51:49,367 INFO L471 AbstractCegarLoop]: Abstraction has 40966 states and 55300 transitions. [2024-11-07 16:51:49,367 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 10.666666666666666) internal successors, (32), 3 states have internal predecessors, (32), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-07 16:51:49,367 INFO L276 IsEmpty]: Start isEmpty. Operand 40966 states and 55300 transitions. [2024-11-07 16:51:49,386 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 33 [2024-11-07 16:51:49,386 INFO L207 NwaCegarLoop]: Found error trace [2024-11-07 16:51:49,386 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-07 16:51:49,386 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable30 [2024-11-07 16:51:49,386 INFO L396 AbstractCegarLoop]: === Iteration 32 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK === [ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_LEAK] === [2024-11-07 16:51:49,387 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-07 16:51:49,387 INFO L85 PathProgramCache]: Analyzing trace with hash 1433114891, now seen corresponding path program 1 times [2024-11-07 16:51:49,387 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-07 16:51:49,387 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [832256656] [2024-11-07 16:51:49,387 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-07 16:51:49,387 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-07 16:51:49,393 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 16:51:49,404 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-07 16:51:49,404 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-07 16:51:49,404 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [832256656] [2024-11-07 16:51:49,404 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [832256656] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-07 16:51:49,404 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-07 16:51:49,405 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-11-07 16:51:49,405 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1048825842] [2024-11-07 16:51:49,405 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-07 16:51:49,405 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-07 16:51:49,405 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-07 16:51:49,405 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-07 16:51:49,405 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-07 16:51:49,406 INFO L87 Difference]: Start difference. First operand 40966 states and 55300 transitions. Second operand has 3 states, 3 states have (on average 10.666666666666666) internal successors, (32), 3 states have internal predecessors, (32), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-07 16:51:49,555 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-07 16:51:49,556 INFO L93 Difference]: Finished difference Result 79881 states and 104454 transitions. [2024-11-07 16:51:49,556 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-07 16:51:49,556 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 10.666666666666666) internal successors, (32), 3 states have internal predecessors, (32), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 32 [2024-11-07 16:51:49,556 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-07 16:51:49,651 INFO L225 Difference]: With dead ends: 79881 [2024-11-07 16:51:49,651 INFO L226 Difference]: Without dead ends: 79881 [2024-11-07 16:51:49,652 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-07 16:51:49,652 INFO L432 NwaCegarLoop]: 103 mSDtfsCounter, 60 mSDsluCounter, 75 mSDsCounter, 0 mSdLazyCounter, 5 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 60 SdHoareTripleChecker+Valid, 178 SdHoareTripleChecker+Invalid, 7 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 5 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-11-07 16:51:49,653 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [60 Valid, 178 Invalid, 7 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 5 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-11-07 16:51:49,696 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 79881 states. [2024-11-07 16:51:50,608 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 79881 to 79878. [2024-11-07 16:51:50,711 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 79878 states, 79877 states have (on average 1.3076605280618951) internal successors, (104452), 79877 states have internal predecessors, (104452), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-07 16:51:50,907 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 79878 states to 79878 states and 104452 transitions. [2024-11-07 16:51:50,910 INFO L78 Accepts]: Start accepts. Automaton has 79878 states and 104452 transitions. Word has length 32 [2024-11-07 16:51:50,910 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-07 16:51:50,910 INFO L471 AbstractCegarLoop]: Abstraction has 79878 states and 104452 transitions. [2024-11-07 16:51:50,910 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 10.666666666666666) internal successors, (32), 3 states have internal predecessors, (32), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-07 16:51:50,910 INFO L276 IsEmpty]: Start isEmpty. Operand 79878 states and 104452 transitions. [2024-11-07 16:51:50,967 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 33 [2024-11-07 16:51:50,968 INFO L207 NwaCegarLoop]: Found error trace [2024-11-07 16:51:50,968 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-07 16:51:50,971 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable31 [2024-11-07 16:51:50,971 INFO L396 AbstractCegarLoop]: === Iteration 33 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK === [ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_LEAK] === [2024-11-07 16:51:50,972 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-07 16:51:50,972 INFO L85 PathProgramCache]: Analyzing trace with hash -867707699, now seen corresponding path program 1 times [2024-11-07 16:51:50,972 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-07 16:51:50,972 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [352419332] [2024-11-07 16:51:50,972 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-07 16:51:50,972 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-07 16:51:50,984 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 16:51:51,005 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-07 16:51:51,009 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-07 16:51:51,009 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [352419332] [2024-11-07 16:51:51,009 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [352419332] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-07 16:51:51,009 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-07 16:51:51,009 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-11-07 16:51:51,009 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [289728179] [2024-11-07 16:51:51,009 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-07 16:51:51,009 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-07 16:51:51,009 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-07 16:51:51,010 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-07 16:51:51,010 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-07 16:51:51,010 INFO L87 Difference]: Start difference. First operand 79878 states and 104452 transitions. Second operand has 3 states, 3 states have (on average 10.666666666666666) internal successors, (32), 3 states have internal predecessors, (32), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-07 16:51:51,433 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-07 16:51:51,433 INFO L93 Difference]: Finished difference Result 88073 states and 117766 transitions. [2024-11-07 16:51:51,438 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-07 16:51:51,438 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 10.666666666666666) internal successors, (32), 3 states have internal predecessors, (32), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 32 [2024-11-07 16:51:51,438 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-07 16:51:51,597 INFO L225 Difference]: With dead ends: 88073 [2024-11-07 16:51:51,601 INFO L226 Difference]: Without dead ends: 88073 [2024-11-07 16:51:51,601 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-07 16:51:51,602 INFO L432 NwaCegarLoop]: 131 mSDtfsCounter, 39 mSDsluCounter, 74 mSDsCounter, 0 mSdLazyCounter, 5 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 39 SdHoareTripleChecker+Valid, 205 SdHoareTripleChecker+Invalid, 5 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 5 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-11-07 16:51:51,602 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [39 Valid, 205 Invalid, 5 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 5 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-11-07 16:51:51,677 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 88073 states. [2024-11-07 16:51:52,616 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 88073 to 79878. [2024-11-07 16:51:52,682 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 79878 states, 79877 states have (on average 1.2948408177573019) internal successors, (103428), 79877 states have internal predecessors, (103428), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-07 16:51:52,871 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 79878 states to 79878 states and 103428 transitions. [2024-11-07 16:51:52,872 INFO L78 Accepts]: Start accepts. Automaton has 79878 states and 103428 transitions. Word has length 32 [2024-11-07 16:51:52,872 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-07 16:51:52,872 INFO L471 AbstractCegarLoop]: Abstraction has 79878 states and 103428 transitions. [2024-11-07 16:51:52,872 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 10.666666666666666) internal successors, (32), 3 states have internal predecessors, (32), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-07 16:51:52,872 INFO L276 IsEmpty]: Start isEmpty. Operand 79878 states and 103428 transitions. [2024-11-07 16:51:52,908 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 34 [2024-11-07 16:51:52,909 INFO L207 NwaCegarLoop]: Found error trace [2024-11-07 16:51:52,909 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-07 16:51:52,909 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable32 [2024-11-07 16:51:52,910 INFO L396 AbstractCegarLoop]: === Iteration 34 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK === [ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_LEAK] === [2024-11-07 16:51:52,910 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-07 16:51:52,910 INFO L85 PathProgramCache]: Analyzing trace with hash 1483560153, now seen corresponding path program 1 times [2024-11-07 16:51:52,910 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-07 16:51:52,910 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1038057921] [2024-11-07 16:51:52,910 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-07 16:51:52,910 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-07 16:51:52,916 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 16:51:52,927 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-07 16:51:52,927 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-07 16:51:52,927 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1038057921] [2024-11-07 16:51:52,928 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1038057921] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-07 16:51:52,928 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-07 16:51:52,928 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-11-07 16:51:52,928 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1785734730] [2024-11-07 16:51:52,928 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-07 16:51:52,928 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-07 16:51:52,928 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-07 16:51:52,929 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-07 16:51:52,929 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-07 16:51:52,929 INFO L87 Difference]: Start difference. First operand 79878 states and 103428 transitions. Second operand has 3 states, 3 states have (on average 11.0) internal successors, (33), 3 states have internal predecessors, (33), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-07 16:51:53,272 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-07 16:51:53,272 INFO L93 Difference]: Finished difference Result 134153 states and 174086 transitions. [2024-11-07 16:51:53,273 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-07 16:51:53,273 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 11.0) internal successors, (33), 3 states have internal predecessors, (33), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 33 [2024-11-07 16:51:53,273 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-07 16:51:53,399 INFO L225 Difference]: With dead ends: 134153 [2024-11-07 16:51:53,399 INFO L226 Difference]: Without dead ends: 134153 [2024-11-07 16:51:53,399 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-07 16:51:53,400 INFO L432 NwaCegarLoop]: 82 mSDtfsCounter, 36 mSDsluCounter, 74 mSDsCounter, 0 mSdLazyCounter, 6 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 36 SdHoareTripleChecker+Valid, 156 SdHoareTripleChecker+Invalid, 6 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 6 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-11-07 16:51:53,400 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [36 Valid, 156 Invalid, 6 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 6 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-11-07 16:51:53,450 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 134153 states. [2024-11-07 16:51:54,547 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 134153 to 121862. [2024-11-07 16:51:54,618 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 121862 states, 121861 states have (on average 1.260485307030141) internal successors, (153604), 121861 states have internal predecessors, (153604), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-07 16:51:54,823 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 121862 states to 121862 states and 153604 transitions. [2024-11-07 16:51:54,824 INFO L78 Accepts]: Start accepts. Automaton has 121862 states and 153604 transitions. Word has length 33 [2024-11-07 16:51:54,824 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-07 16:51:54,824 INFO L471 AbstractCegarLoop]: Abstraction has 121862 states and 153604 transitions. [2024-11-07 16:51:54,824 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 11.0) internal successors, (33), 3 states have internal predecessors, (33), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-07 16:51:54,824 INFO L276 IsEmpty]: Start isEmpty. Operand 121862 states and 153604 transitions. [2024-11-07 16:51:54,883 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 34 [2024-11-07 16:51:54,883 INFO L207 NwaCegarLoop]: Found error trace [2024-11-07 16:51:54,883 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-07 16:51:54,883 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable33 [2024-11-07 16:51:54,883 INFO L396 AbstractCegarLoop]: === Iteration 35 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK === [ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_LEAK] === [2024-11-07 16:51:54,884 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-07 16:51:54,884 INFO L85 PathProgramCache]: Analyzing trace with hash -510584553, now seen corresponding path program 1 times [2024-11-07 16:51:54,884 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-07 16:51:54,884 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [268326454] [2024-11-07 16:51:54,884 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-07 16:51:54,884 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-07 16:51:54,890 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 16:51:54,912 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-07 16:51:54,912 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-07 16:51:54,912 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [268326454] [2024-11-07 16:51:54,912 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [268326454] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-07 16:51:54,912 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-07 16:51:54,913 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-11-07 16:51:54,913 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1311660854] [2024-11-07 16:51:54,913 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-07 16:51:54,913 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-07 16:51:54,913 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-07 16:51:54,913 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-07 16:51:54,913 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-07 16:51:54,913 INFO L87 Difference]: Start difference. First operand 121862 states and 153604 transitions. Second operand has 3 states, 3 states have (on average 11.0) internal successors, (33), 3 states have internal predecessors, (33), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-07 16:51:55,436 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-07 16:51:55,436 INFO L93 Difference]: Finished difference Result 156681 states and 194566 transitions. [2024-11-07 16:51:55,437 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-07 16:51:55,437 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 11.0) internal successors, (33), 3 states have internal predecessors, (33), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 33 [2024-11-07 16:51:55,437 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-07 16:51:55,600 INFO L225 Difference]: With dead ends: 156681 [2024-11-07 16:51:55,601 INFO L226 Difference]: Without dead ends: 156681 [2024-11-07 16:51:55,601 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-07 16:51:55,601 INFO L432 NwaCegarLoop]: 139 mSDtfsCounter, 58 mSDsluCounter, 73 mSDsCounter, 0 mSdLazyCounter, 5 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 58 SdHoareTripleChecker+Valid, 212 SdHoareTripleChecker+Invalid, 7 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 5 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-11-07 16:51:55,602 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [58 Valid, 212 Invalid, 7 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 5 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-11-07 16:51:55,661 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 156681 states. [2024-11-07 16:51:56,900 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 156681 to 156678. [2024-11-07 16:51:57,022 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 156678 states, 156677 states have (on average 1.2418159653299463) internal successors, (194564), 156677 states have internal predecessors, (194564), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-07 16:51:57,325 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 156678 states to 156678 states and 194564 transitions. [2024-11-07 16:51:57,325 INFO L78 Accepts]: Start accepts. Automaton has 156678 states and 194564 transitions. Word has length 33 [2024-11-07 16:51:57,325 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-07 16:51:57,325 INFO L471 AbstractCegarLoop]: Abstraction has 156678 states and 194564 transitions. [2024-11-07 16:51:57,325 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 11.0) internal successors, (33), 3 states have internal predecessors, (33), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-07 16:51:57,326 INFO L276 IsEmpty]: Start isEmpty. Operand 156678 states and 194564 transitions. [2024-11-07 16:51:57,735 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 35 [2024-11-07 16:51:57,735 INFO L207 NwaCegarLoop]: Found error trace [2024-11-07 16:51:57,735 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-07 16:51:57,735 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable34 [2024-11-07 16:51:57,736 INFO L396 AbstractCegarLoop]: === Iteration 36 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK === [ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_LEAK] === [2024-11-07 16:51:57,736 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-07 16:51:57,736 INFO L85 PathProgramCache]: Analyzing trace with hash -1247593450, now seen corresponding path program 1 times [2024-11-07 16:51:57,736 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-07 16:51:57,736 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [191389136] [2024-11-07 16:51:57,736 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-07 16:51:57,736 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-07 16:51:57,741 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 16:51:57,751 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-07 16:51:57,751 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-07 16:51:57,751 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [191389136] [2024-11-07 16:51:57,751 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [191389136] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-07 16:51:57,751 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-07 16:51:57,751 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-11-07 16:51:57,751 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [100335107] [2024-11-07 16:51:57,751 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-07 16:51:57,752 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-07 16:51:57,752 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-07 16:51:57,752 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-07 16:51:57,752 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-07 16:51:57,752 INFO L87 Difference]: Start difference. First operand 156678 states and 194564 transitions. Second operand has 3 states, 3 states have (on average 11.333333333333334) internal successors, (34), 3 states have internal predecessors, (34), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-07 16:51:58,076 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-07 16:51:58,077 INFO L93 Difference]: Finished difference Result 159753 states and 196614 transitions. [2024-11-07 16:51:58,077 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-07 16:51:58,077 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 11.333333333333334) internal successors, (34), 3 states have internal predecessors, (34), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 34 [2024-11-07 16:51:58,078 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-07 16:51:58,268 INFO L225 Difference]: With dead ends: 159753 [2024-11-07 16:51:58,269 INFO L226 Difference]: Without dead ends: 159753 [2024-11-07 16:51:58,269 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-07 16:51:58,269 INFO L432 NwaCegarLoop]: 111 mSDtfsCounter, 60 mSDsluCounter, 72 mSDsCounter, 0 mSdLazyCounter, 5 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 60 SdHoareTripleChecker+Valid, 183 SdHoareTripleChecker+Invalid, 6 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 5 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-11-07 16:51:58,270 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [60 Valid, 183 Invalid, 6 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 5 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-11-07 16:51:58,351 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 159753 states. [2024-11-07 16:51:59,709 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 159753 to 159750. [2024-11-07 16:51:59,834 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 159750 states, 159749 states have (on average 1.2307557480798001) internal successors, (196612), 159749 states have internal predecessors, (196612), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-07 16:52:00,038 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 159750 states to 159750 states and 196612 transitions. [2024-11-07 16:52:00,038 INFO L78 Accepts]: Start accepts. Automaton has 159750 states and 196612 transitions. Word has length 34 [2024-11-07 16:52:00,039 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-07 16:52:00,039 INFO L471 AbstractCegarLoop]: Abstraction has 159750 states and 196612 transitions. [2024-11-07 16:52:00,039 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 11.333333333333334) internal successors, (34), 3 states have internal predecessors, (34), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-07 16:52:00,039 INFO L276 IsEmpty]: Start isEmpty. Operand 159750 states and 196612 transitions. [2024-11-07 16:52:00,442 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 35 [2024-11-07 16:52:00,443 INFO L207 NwaCegarLoop]: Found error trace [2024-11-07 16:52:00,443 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-07 16:52:00,443 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable35 [2024-11-07 16:52:00,443 INFO L396 AbstractCegarLoop]: === Iteration 37 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK === [ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_LEAK] === [2024-11-07 16:52:00,443 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-07 16:52:00,444 INFO L85 PathProgramCache]: Analyzing trace with hash 1358430104, now seen corresponding path program 1 times [2024-11-07 16:52:00,444 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-07 16:52:00,444 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1178629383] [2024-11-07 16:52:00,444 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-07 16:52:00,444 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-07 16:52:00,450 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 16:52:00,463 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-07 16:52:00,463 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-07 16:52:00,463 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1178629383] [2024-11-07 16:52:00,463 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1178629383] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-07 16:52:00,463 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-07 16:52:00,463 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-11-07 16:52:00,464 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2081579274] [2024-11-07 16:52:00,464 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-07 16:52:00,464 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-07 16:52:00,464 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-07 16:52:00,465 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-07 16:52:00,465 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-07 16:52:00,465 INFO L87 Difference]: Start difference. First operand 159750 states and 196612 transitions. Second operand has 3 states, 3 states have (on average 11.333333333333334) internal successors, (34), 3 states have internal predecessors, (34), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-07 16:52:01,052 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-07 16:52:01,053 INFO L93 Difference]: Finished difference Result 262153 states and 319494 transitions. [2024-11-07 16:52:01,053 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-07 16:52:01,053 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 11.333333333333334) internal successors, (34), 3 states have internal predecessors, (34), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 34 [2024-11-07 16:52:01,053 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-07 16:52:01,354 INFO L225 Difference]: With dead ends: 262153 [2024-11-07 16:52:01,354 INFO L226 Difference]: Without dead ends: 262153 [2024-11-07 16:52:01,355 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-07 16:52:01,355 INFO L432 NwaCegarLoop]: 81 mSDtfsCounter, 33 mSDsluCounter, 73 mSDsCounter, 0 mSdLazyCounter, 6 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 33 SdHoareTripleChecker+Valid, 154 SdHoareTripleChecker+Invalid, 6 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 6 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-11-07 16:52:01,355 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [33 Valid, 154 Invalid, 6 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 6 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-11-07 16:52:01,486 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 262153 states. [2024-11-07 16:52:03,481 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 262153 to 245766. [2024-11-07 16:52:03,642 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 245766 states, 245765 states have (on average 1.1999918621447319) internal successors, (294916), 245765 states have internal predecessors, (294916), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-07 16:52:03,945 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 245766 states to 245766 states and 294916 transitions. [2024-11-07 16:52:03,946 INFO L78 Accepts]: Start accepts. Automaton has 245766 states and 294916 transitions. Word has length 34 [2024-11-07 16:52:03,946 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-07 16:52:03,946 INFO L471 AbstractCegarLoop]: Abstraction has 245766 states and 294916 transitions. [2024-11-07 16:52:03,946 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 11.333333333333334) internal successors, (34), 3 states have internal predecessors, (34), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-07 16:52:03,946 INFO L276 IsEmpty]: Start isEmpty. Operand 245766 states and 294916 transitions. [2024-11-07 16:52:04,568 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 35 [2024-11-07 16:52:04,569 INFO L207 NwaCegarLoop]: Found error trace [2024-11-07 16:52:04,569 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-07 16:52:04,569 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable36 [2024-11-07 16:52:04,570 INFO L396 AbstractCegarLoop]: === Iteration 38 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK === [ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_LEAK] === [2024-11-07 16:52:04,570 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-07 16:52:04,570 INFO L85 PathProgramCache]: Analyzing trace with hash -635714602, now seen corresponding path program 1 times [2024-11-07 16:52:04,570 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-07 16:52:04,570 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [759098813] [2024-11-07 16:52:04,571 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-07 16:52:04,571 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-07 16:52:04,580 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 16:52:04,605 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-07 16:52:04,606 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-07 16:52:04,606 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [759098813] [2024-11-07 16:52:04,606 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [759098813] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-07 16:52:04,606 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-07 16:52:04,606 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-11-07 16:52:04,606 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2072597305] [2024-11-07 16:52:04,606 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-07 16:52:04,606 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-07 16:52:04,606 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-07 16:52:04,606 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-07 16:52:04,606 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-07 16:52:04,606 INFO L87 Difference]: Start difference. First operand 245766 states and 294916 transitions. Second operand has 3 states, 3 states have (on average 11.333333333333334) internal successors, (34), 3 states have internal predecessors, (34), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-07 16:52:05,453 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-07 16:52:05,454 INFO L93 Difference]: Finished difference Result 311305 states and 364550 transitions. [2024-11-07 16:52:05,454 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-07 16:52:05,454 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 11.333333333333334) internal successors, (34), 3 states have internal predecessors, (34), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 34 [2024-11-07 16:52:05,455 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-07 16:52:05,908 INFO L225 Difference]: With dead ends: 311305 [2024-11-07 16:52:05,908 INFO L226 Difference]: Without dead ends: 311305 [2024-11-07 16:52:05,908 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-07 16:52:05,909 INFO L432 NwaCegarLoop]: 141 mSDtfsCounter, 57 mSDsluCounter, 72 mSDsCounter, 0 mSdLazyCounter, 5 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 57 SdHoareTripleChecker+Valid, 213 SdHoareTripleChecker+Invalid, 7 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 5 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-11-07 16:52:05,909 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [57 Valid, 213 Invalid, 7 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 5 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-11-07 16:52:06,074 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 311305 states. [2024-11-07 16:52:08,808 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 311305 to 311302. [2024-11-07 16:52:09,050 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 311302 states, 311301 states have (on average 1.1710466718706332) internal successors, (364548), 311301 states have internal predecessors, (364548), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-07 16:52:10,132 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 311302 states to 311302 states and 364548 transitions. [2024-11-07 16:52:10,133 INFO L78 Accepts]: Start accepts. Automaton has 311302 states and 364548 transitions. Word has length 34 [2024-11-07 16:52:10,133 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-07 16:52:10,133 INFO L471 AbstractCegarLoop]: Abstraction has 311302 states and 364548 transitions. [2024-11-07 16:52:10,133 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 11.333333333333334) internal successors, (34), 3 states have internal predecessors, (34), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-07 16:52:10,134 INFO L276 IsEmpty]: Start isEmpty. Operand 311302 states and 364548 transitions. [2024-11-07 16:52:10,374 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 36 [2024-11-07 16:52:10,375 INFO L207 NwaCegarLoop]: Found error trace [2024-11-07 16:52:10,375 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-07 16:52:10,375 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable37 [2024-11-07 16:52:10,376 INFO L396 AbstractCegarLoop]: === Iteration 39 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK === [ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_LEAK] === [2024-11-07 16:52:10,376 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-07 16:52:10,376 INFO L85 PathProgramCache]: Analyzing trace with hash -831647102, now seen corresponding path program 1 times [2024-11-07 16:52:10,376 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-07 16:52:10,376 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1659542561] [2024-11-07 16:52:10,376 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-07 16:52:10,376 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-07 16:52:10,388 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 16:52:10,421 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-07 16:52:10,421 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-07 16:52:10,421 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1659542561] [2024-11-07 16:52:10,422 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1659542561] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-07 16:52:10,422 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-07 16:52:10,422 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-11-07 16:52:10,422 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [264764300] [2024-11-07 16:52:10,422 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-07 16:52:10,422 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-07 16:52:10,422 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-07 16:52:10,422 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-07 16:52:10,423 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-07 16:52:10,423 INFO L87 Difference]: Start difference. First operand 311302 states and 364548 transitions. Second operand has 3 states, 3 states have (on average 11.666666666666666) internal successors, (35), 3 states have internal predecessors, (35), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-07 16:52:11,278 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-07 16:52:11,279 INFO L93 Difference]: Finished difference Result 315401 states and 364550 transitions. [2024-11-07 16:52:11,279 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-07 16:52:11,279 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 11.666666666666666) internal successors, (35), 3 states have internal predecessors, (35), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 35 [2024-11-07 16:52:11,279 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-07 16:52:12,154 INFO L225 Difference]: With dead ends: 315401 [2024-11-07 16:52:12,155 INFO L226 Difference]: Without dead ends: 315401 [2024-11-07 16:52:12,155 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-07 16:52:12,155 INFO L432 NwaCegarLoop]: 108 mSDtfsCounter, 59 mSDsluCounter, 71 mSDsCounter, 0 mSdLazyCounter, 5 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 59 SdHoareTripleChecker+Valid, 179 SdHoareTripleChecker+Invalid, 6 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 5 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-11-07 16:52:12,155 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [59 Valid, 179 Invalid, 6 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 5 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-11-07 16:52:12,268 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 315401 states. [2024-11-07 16:52:14,585 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 315401 to 315398. [2024-11-07 16:52:14,832 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 315398 states, 315397 states have (on average 1.1558385146339376) internal successors, (364548), 315397 states have internal predecessors, (364548), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-07 16:52:15,898 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 315398 states to 315398 states and 364548 transitions. [2024-11-07 16:52:15,899 INFO L78 Accepts]: Start accepts. Automaton has 315398 states and 364548 transitions. Word has length 35 [2024-11-07 16:52:15,899 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-07 16:52:15,899 INFO L471 AbstractCegarLoop]: Abstraction has 315398 states and 364548 transitions. [2024-11-07 16:52:15,899 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 11.666666666666666) internal successors, (35), 3 states have internal predecessors, (35), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-07 16:52:15,899 INFO L276 IsEmpty]: Start isEmpty. Operand 315398 states and 364548 transitions. [2024-11-07 16:52:16,103 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 36 [2024-11-07 16:52:16,104 INFO L207 NwaCegarLoop]: Found error trace [2024-11-07 16:52:16,104 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-07 16:52:16,104 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable38 [2024-11-07 16:52:16,104 INFO L396 AbstractCegarLoop]: === Iteration 40 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK === [ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_LEAK] === [2024-11-07 16:52:16,104 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-07 16:52:16,105 INFO L85 PathProgramCache]: Analyzing trace with hash 1774376452, now seen corresponding path program 1 times [2024-11-07 16:52:16,105 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-07 16:52:16,105 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1924342478] [2024-11-07 16:52:16,105 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-07 16:52:16,105 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-07 16:52:16,110 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 16:52:16,121 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-07 16:52:16,121 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-07 16:52:16,121 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1924342478] [2024-11-07 16:52:16,122 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1924342478] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-07 16:52:16,122 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-07 16:52:16,122 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-11-07 16:52:16,122 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1774584586] [2024-11-07 16:52:16,122 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-07 16:52:16,122 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-07 16:52:16,122 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-07 16:52:16,122 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-07 16:52:16,122 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-07 16:52:16,123 INFO L87 Difference]: Start difference. First operand 315398 states and 364548 transitions. Second operand has 3 states, 3 states have (on average 11.666666666666666) internal successors, (35), 3 states have internal predecessors, (35), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)