./Ultimate.py --spec ../../sv-benchmarks/c/properties/valid-memsafety.prp --file ../../sv-benchmarks/c/loop-industry-pattern/aiob_4.c.v+lhb-reducer.c --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for memory safety (deref-memtrack) Using default analysis Version e7bb482b Calling Ultimate with: /usr/lib/jvm/java-11-openjdk-amd64/bin/java -Dosgi.configuration.area=/tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_caa5f2f3-6cb0-43bd-95b0-ab16c9f4f5a2/bin/uautomizer-verify-WvqO1wxjHP/data/config -Xmx15G -Xms4m -jar /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_caa5f2f3-6cb0-43bd-95b0-ab16c9f4f5a2/bin/uautomizer-verify-WvqO1wxjHP/plugins/org.eclipse.equinox.launcher_1.5.800.v20200727-1323.jar -data @noDefault -ultimatedata /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_caa5f2f3-6cb0-43bd-95b0-ab16c9f4f5a2/bin/uautomizer-verify-WvqO1wxjHP/data -tc /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_caa5f2f3-6cb0-43bd-95b0-ab16c9f4f5a2/bin/uautomizer-verify-WvqO1wxjHP/config/AutomizerMemDerefMemtrack.xml -i ../../sv-benchmarks/c/loop-industry-pattern/aiob_4.c.v+lhb-reducer.c -s /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_caa5f2f3-6cb0-43bd-95b0-ab16c9f4f5a2/bin/uautomizer-verify-WvqO1wxjHP/config/svcomp-DerefFreeMemtrack-32bit-Automizer_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_caa5f2f3-6cb0-43bd-95b0-ab16c9f4f5a2/bin/uautomizer-verify-WvqO1wxjHP --witnessprinter.witness.filename witness.graphml --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 de5a591efb40e891e226106d8590a7409596f3a27aca8b697af826abd4fe5201 --- Real Ultimate output --- This is Ultimate 0.2.3-dev-e7bb482 [2023-11-06 21:55:43,238 INFO L188 SettingsManager]: Resetting all preferences to default values... [2023-11-06 21:55:43,351 INFO L114 SettingsManager]: Loading settings from /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_caa5f2f3-6cb0-43bd-95b0-ab16c9f4f5a2/bin/uautomizer-verify-WvqO1wxjHP/config/svcomp-DerefFreeMemtrack-32bit-Automizer_Default.epf [2023-11-06 21:55:43,359 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2023-11-06 21:55:43,360 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2023-11-06 21:55:43,401 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2023-11-06 21:55:43,402 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2023-11-06 21:55:43,402 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2023-11-06 21:55:43,403 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2023-11-06 21:55:43,408 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2023-11-06 21:55:43,409 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2023-11-06 21:55:43,410 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2023-11-06 21:55:43,410 INFO L153 SettingsManager]: * Use SBE=true [2023-11-06 21:55:43,412 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2023-11-06 21:55:43,413 INFO L153 SettingsManager]: * sizeof long=4 [2023-11-06 21:55:43,413 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2023-11-06 21:55:43,414 INFO L153 SettingsManager]: * sizeof POINTER=4 [2023-11-06 21:55:43,414 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2023-11-06 21:55:43,415 INFO L153 SettingsManager]: * Check for the main procedure if all allocated memory was freed=true [2023-11-06 21:55:43,415 INFO L153 SettingsManager]: * Bitprecise bitfields=true [2023-11-06 21:55:43,415 INFO L153 SettingsManager]: * SV-COMP memtrack compatibility mode=true [2023-11-06 21:55:43,416 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2023-11-06 21:55:43,418 INFO L153 SettingsManager]: * Adapt memory model on pointer casts if necessary=true [2023-11-06 21:55:43,418 INFO L153 SettingsManager]: * Check unreachability of reach_error function=false [2023-11-06 21:55:43,419 INFO L153 SettingsManager]: * sizeof long double=12 [2023-11-06 21:55:43,419 INFO L153 SettingsManager]: * Use constant arrays=true [2023-11-06 21:55:43,420 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2023-11-06 21:55:43,420 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2023-11-06 21:55:43,421 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2023-11-06 21:55:43,421 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2023-11-06 21:55:43,423 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2023-11-06 21:55:43,423 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2023-11-06 21:55:43,423 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2023-11-06 21:55:43,423 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2023-11-06 21:55:43,424 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2023-11-06 21:55:43,424 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2023-11-06 21:55:43,424 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2023-11-06 21:55:43,424 INFO L153 SettingsManager]: * Independence relation used for large block encoding in concurrent analysis=SYNTACTIC [2023-11-06 21:55:43,425 INFO L153 SettingsManager]: * Looper check in Petri net analysis=SEMANTIC WARNING: An illegal reflective access operation has occurred WARNING: Illegal reflective access by com.sun.xml.bind.v2.runtime.reflect.opt.Injector$1 (file:/tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_caa5f2f3-6cb0-43bd-95b0-ab16c9f4f5a2/bin/uautomizer-verify-WvqO1wxjHP/plugins/com.sun.xml.bind_2.2.0.v201505121915.jar) to method java.lang.ClassLoader.defineClass(java.lang.String,byte[],int,int) WARNING: Please consider reporting this to the maintainers of com.sun.xml.bind.v2.runtime.reflect.opt.Injector$1 WARNING: Use --illegal-access=warn to enable warnings of further illegal reflective access operations WARNING: All illegal access operations will be denied in a future release Applying setting for plugin de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator: Entry function -> main Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Witness directory -> /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_caa5f2f3-6cb0-43bd-95b0-ab16c9f4f5a2/bin/uautomizer-verify-WvqO1wxjHP Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Witness filename -> witness.graphml 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 -> de5a591efb40e891e226106d8590a7409596f3a27aca8b697af826abd4fe5201 [2023-11-06 21:55:43,749 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2023-11-06 21:55:43,771 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2023-11-06 21:55:43,774 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2023-11-06 21:55:43,775 INFO L270 PluginConnector]: Initializing CDTParser... [2023-11-06 21:55:43,776 INFO L274 PluginConnector]: CDTParser initialized [2023-11-06 21:55:43,777 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_caa5f2f3-6cb0-43bd-95b0-ab16c9f4f5a2/bin/uautomizer-verify-WvqO1wxjHP/../../sv-benchmarks/c/loop-industry-pattern/aiob_4.c.v+lhb-reducer.c [2023-11-06 21:55:46,958 INFO L533 CDTParser]: Created temporary CDT project at NULL [2023-11-06 21:55:47,217 INFO L384 CDTParser]: Found 1 translation units. [2023-11-06 21:55:47,218 INFO L180 CDTParser]: Scanning /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_caa5f2f3-6cb0-43bd-95b0-ab16c9f4f5a2/sv-benchmarks/c/loop-industry-pattern/aiob_4.c.v+lhb-reducer.c [2023-11-06 21:55:47,230 INFO L427 CDTParser]: About to delete temporary CDT project at /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_caa5f2f3-6cb0-43bd-95b0-ab16c9f4f5a2/bin/uautomizer-verify-WvqO1wxjHP/data/16c968e04/3ee4d3bce5a04f9eb76ced007c2a0a95/FLAG2b9468c42 [2023-11-06 21:55:47,245 INFO L435 CDTParser]: Successfully deleted /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_caa5f2f3-6cb0-43bd-95b0-ab16c9f4f5a2/bin/uautomizer-verify-WvqO1wxjHP/data/16c968e04/3ee4d3bce5a04f9eb76ced007c2a0a95 [2023-11-06 21:55:47,247 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2023-11-06 21:55:47,249 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2023-11-06 21:55:47,250 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2023-11-06 21:55:47,251 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2023-11-06 21:55:47,256 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2023-11-06 21:55:47,257 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 06.11 09:55:47" (1/1) ... [2023-11-06 21:55:47,258 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@569e122d and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.11 09:55:47, skipping insertion in model container [2023-11-06 21:55:47,258 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 06.11 09:55:47" (1/1) ... [2023-11-06 21:55:47,307 INFO L177 MainTranslator]: Built tables and reachable declarations [2023-11-06 21:55:47,597 INFO L209 PostProcessor]: Analyzing one entry point: main [2023-11-06 21:55:47,608 INFO L202 MainTranslator]: Completed pre-run [2023-11-06 21:55:47,757 INFO L209 PostProcessor]: Analyzing one entry point: main [2023-11-06 21:55:47,766 WARN L672 CHandler]: The function fopen is called, but not defined or handled by StandardFunctionHandler. [2023-11-06 21:55:47,774 INFO L206 MainTranslator]: Completed translation [2023-11-06 21:55:47,775 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.11 09:55:47 WrapperNode [2023-11-06 21:55:47,775 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2023-11-06 21:55:47,776 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2023-11-06 21:55:47,776 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2023-11-06 21:55:47,777 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2023-11-06 21:55:47,785 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.11 09:55:47" (1/1) ... [2023-11-06 21:55:47,806 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.11 09:55:47" (1/1) ... [2023-11-06 21:55:47,874 INFO L138 Inliner]: procedures = 17, calls = 294, calls flagged for inlining = 3, calls inlined = 3, statements flattened = 794 [2023-11-06 21:55:47,874 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2023-11-06 21:55:47,875 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2023-11-06 21:55:47,875 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2023-11-06 21:55:47,875 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2023-11-06 21:55:47,887 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.11 09:55:47" (1/1) ... [2023-11-06 21:55:47,892 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.11 09:55:47" (1/1) ... [2023-11-06 21:55:47,903 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.11 09:55:47" (1/1) ... [2023-11-06 21:55:47,903 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.11 09:55:47" (1/1) ... [2023-11-06 21:55:47,942 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.11 09:55:47" (1/1) ... [2023-11-06 21:55:47,947 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.11 09:55:47" (1/1) ... [2023-11-06 21:55:47,958 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.11 09:55:47" (1/1) ... [2023-11-06 21:55:47,976 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.11 09:55:47" (1/1) ... [2023-11-06 21:55:47,984 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2023-11-06 21:55:47,985 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2023-11-06 21:55:47,985 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2023-11-06 21:55:47,986 INFO L274 PluginConnector]: RCFGBuilder initialized [2023-11-06 21:55:47,986 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.11 09:55:47" (1/1) ... [2023-11-06 21:55:47,993 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2023-11-06 21:55:48,005 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_caa5f2f3-6cb0-43bd-95b0-ab16c9f4f5a2/bin/uautomizer-verify-WvqO1wxjHP/z3 [2023-11-06 21:55:48,019 INFO L229 MonitoredProcess]: Starting monitored process 1 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_caa5f2f3-6cb0-43bd-95b0-ab16c9f4f5a2/bin/uautomizer-verify-WvqO1wxjHP/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (exit command is (exit), workingDir is null) [2023-11-06 21:55:48,036 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_caa5f2f3-6cb0-43bd-95b0-ab16c9f4f5a2/bin/uautomizer-verify-WvqO1wxjHP/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (1)] Waiting until timeout for monitored process [2023-11-06 21:55:48,065 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$ [2023-11-06 21:55:48,066 INFO L130 BoogieDeclarations]: Found specification of procedure fopen [2023-11-06 21:55:48,067 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2023-11-06 21:55:48,067 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2023-11-06 21:55:48,067 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2023-11-06 21:55:48,068 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2023-11-06 21:55:48,068 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2023-11-06 21:55:48,068 INFO L130 BoogieDeclarations]: Found specification of procedure read~int [2023-11-06 21:55:48,068 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2023-11-06 21:55:48,267 INFO L236 CfgBuilder]: Building ICFG [2023-11-06 21:55:48,269 INFO L262 CfgBuilder]: Building CFG for each procedure with an implementation [2023-11-06 21:55:49,295 INFO L277 CfgBuilder]: Performing block encoding [2023-11-06 21:55:49,309 INFO L297 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2023-11-06 21:55:49,309 INFO L302 CfgBuilder]: Removed 0 assume(true) statements. [2023-11-06 21:55:49,311 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 06.11 09:55:49 BoogieIcfgContainer [2023-11-06 21:55:49,312 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2023-11-06 21:55:49,314 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2023-11-06 21:55:49,315 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2023-11-06 21:55:49,319 INFO L274 PluginConnector]: TraceAbstraction initialized [2023-11-06 21:55:49,320 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 06.11 09:55:47" (1/3) ... [2023-11-06 21:55:49,321 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@491431c8 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 06.11 09:55:49, skipping insertion in model container [2023-11-06 21:55:49,322 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.11 09:55:47" (2/3) ... [2023-11-06 21:55:49,324 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@491431c8 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 06.11 09:55:49, skipping insertion in model container [2023-11-06 21:55:49,324 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 06.11 09:55:49" (3/3) ... [2023-11-06 21:55:49,325 INFO L112 eAbstractionObserver]: Analyzing ICFG aiob_4.c.v+lhb-reducer.c [2023-11-06 21:55:49,344 INFO L203 ceAbstractionStarter]: Automizer settings: Hoare:false NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2023-11-06 21:55:49,345 INFO L162 ceAbstractionStarter]: Applying trace abstraction to program that has 104 error locations. [2023-11-06 21:55:49,401 INFO L356 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2023-11-06 21:55:49,409 INFO L357 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, mHoare=false, mAutomataTypeConcurrency=PETRI_NET, mHoareTripleChecks=INCREMENTAL, mHoareAnnotationPositions=All, 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;@1921c63b, mLbeIndependenceSettings=[IndependenceType=SYNTACTIC, AbstractionType=NONE, UseConditional=, UseSemiCommutativity=, Solver=, SolverTimeout=] [2023-11-06 21:55:49,410 INFO L358 AbstractCegarLoop]: Starting to check reachability of 104 error locations. [2023-11-06 21:55:49,416 INFO L276 IsEmpty]: Start isEmpty. Operand has 246 states, 141 states have (on average 2.0354609929078014) internal successors, (287), 245 states have internal predecessors, (287), 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) [2023-11-06 21:55:49,423 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 5 [2023-11-06 21:55:49,423 INFO L187 NwaCegarLoop]: Found error trace [2023-11-06 21:55:49,424 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1] [2023-11-06 21:55:49,424 INFO L420 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr103ASSERT_VIOLATIONMEMORY_LEAK === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 101 more)] === [2023-11-06 21:55:49,431 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-11-06 21:55:49,432 INFO L85 PathProgramCache]: Analyzing trace with hash 926012, now seen corresponding path program 1 times [2023-11-06 21:55:49,444 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-06 21:55:49,445 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [491330294] [2023-11-06 21:55:49,446 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-06 21:55:49,446 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-06 21:55:49,591 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 21:55:49,827 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-11-06 21:55:49,828 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-06 21:55:49,828 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [491330294] [2023-11-06 21:55:49,829 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [491330294] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-06 21:55:49,829 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-06 21:55:49,829 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2023-11-06 21:55:49,831 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1005527989] [2023-11-06 21:55:49,832 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-06 21:55:49,836 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2023-11-06 21:55:49,836 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-06 21:55:49,873 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2023-11-06 21:55:49,874 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2023-11-06 21:55:49,877 INFO L87 Difference]: Start difference. First operand has 246 states, 141 states have (on average 2.0354609929078014) internal successors, (287), 245 states have internal predecessors, (287), 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 4 states, 3 states have (on average 1.3333333333333333) internal successors, (4), 4 states have internal predecessors, (4), 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) [2023-11-06 21:55:50,230 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-11-06 21:55:50,230 INFO L93 Difference]: Finished difference Result 246 states and 276 transitions. [2023-11-06 21:55:50,232 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2023-11-06 21:55:50,234 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 3 states have (on average 1.3333333333333333) internal successors, (4), 4 states have internal predecessors, (4), 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 4 [2023-11-06 21:55:50,234 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-11-06 21:55:50,246 INFO L225 Difference]: With dead ends: 246 [2023-11-06 21:55:50,246 INFO L226 Difference]: Without dead ends: 243 [2023-11-06 21:55:50,248 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2023-11-06 21:55:50,252 INFO L413 NwaCegarLoop]: 189 mSDtfsCounter, 166 mSDsluCounter, 190 mSDsCounter, 0 mSdLazyCounter, 278 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 166 SdHoareTripleChecker+Valid, 379 SdHoareTripleChecker+Invalid, 279 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 278 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2023-11-06 21:55:50,253 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [166 Valid, 379 Invalid, 279 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 278 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2023-11-06 21:55:50,271 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 243 states. [2023-11-06 21:55:50,297 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 243 to 243. [2023-11-06 21:55:50,299 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 243 states, 139 states have (on average 1.9568345323741008) internal successors, (272), 242 states have internal predecessors, (272), 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) [2023-11-06 21:55:50,303 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 243 states to 243 states and 272 transitions. [2023-11-06 21:55:50,304 INFO L78 Accepts]: Start accepts. Automaton has 243 states and 272 transitions. Word has length 4 [2023-11-06 21:55:50,305 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-11-06 21:55:50,305 INFO L495 AbstractCegarLoop]: Abstraction has 243 states and 272 transitions. [2023-11-06 21:55:50,305 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 3 states have (on average 1.3333333333333333) internal successors, (4), 4 states have internal predecessors, (4), 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) [2023-11-06 21:55:50,305 INFO L276 IsEmpty]: Start isEmpty. Operand 243 states and 272 transitions. [2023-11-06 21:55:50,306 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 5 [2023-11-06 21:55:50,306 INFO L187 NwaCegarLoop]: Found error trace [2023-11-06 21:55:50,306 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1] [2023-11-06 21:55:50,306 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2023-11-06 21:55:50,307 INFO L420 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 101 more)] === [2023-11-06 21:55:50,308 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-11-06 21:55:50,308 INFO L85 PathProgramCache]: Analyzing trace with hash 925669, now seen corresponding path program 1 times [2023-11-06 21:55:50,308 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-06 21:55:50,308 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1947785808] [2023-11-06 21:55:50,309 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-06 21:55:50,309 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-06 21:55:50,326 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 21:55:50,416 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-11-06 21:55:50,417 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-06 21:55:50,417 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1947785808] [2023-11-06 21:55:50,417 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1947785808] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-06 21:55:50,417 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-06 21:55:50,418 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2023-11-06 21:55:50,418 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [789305372] [2023-11-06 21:55:50,418 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-06 21:55:50,419 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2023-11-06 21:55:50,420 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-06 21:55:50,420 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2023-11-06 21:55:50,420 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2023-11-06 21:55:50,421 INFO L87 Difference]: Start difference. First operand 243 states and 272 transitions. Second operand has 4 states, 3 states have (on average 1.3333333333333333) internal successors, (4), 4 states have internal predecessors, (4), 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) [2023-11-06 21:55:50,832 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-11-06 21:55:50,833 INFO L93 Difference]: Finished difference Result 202 states and 231 transitions. [2023-11-06 21:55:50,833 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2023-11-06 21:55:50,833 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 3 states have (on average 1.3333333333333333) internal successors, (4), 4 states have internal predecessors, (4), 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 4 [2023-11-06 21:55:50,833 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-11-06 21:55:50,835 INFO L225 Difference]: With dead ends: 202 [2023-11-06 21:55:50,835 INFO L226 Difference]: Without dead ends: 202 [2023-11-06 21:55:50,836 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2023-11-06 21:55:50,837 INFO L413 NwaCegarLoop]: 97 mSDtfsCounter, 393 mSDsluCounter, 0 mSDsCounter, 0 mSdLazyCounter, 199 mSolverCounterSat, 42 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 393 SdHoareTripleChecker+Valid, 97 SdHoareTripleChecker+Invalid, 241 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 42 IncrementalHoareTripleChecker+Valid, 199 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2023-11-06 21:55:50,838 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [393 Valid, 97 Invalid, 241 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [42 Valid, 199 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time] [2023-11-06 21:55:50,839 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 202 states. [2023-11-06 21:55:50,849 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 202 to 202. [2023-11-06 21:55:50,850 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 202 states, 139 states have (on average 1.6618705035971224) internal successors, (231), 201 states have internal predecessors, (231), 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) [2023-11-06 21:55:50,852 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 202 states to 202 states and 231 transitions. [2023-11-06 21:55:50,852 INFO L78 Accepts]: Start accepts. Automaton has 202 states and 231 transitions. Word has length 4 [2023-11-06 21:55:50,852 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-11-06 21:55:50,853 INFO L495 AbstractCegarLoop]: Abstraction has 202 states and 231 transitions. [2023-11-06 21:55:50,853 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 3 states have (on average 1.3333333333333333) internal successors, (4), 4 states have internal predecessors, (4), 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) [2023-11-06 21:55:50,853 INFO L276 IsEmpty]: Start isEmpty. Operand 202 states and 231 transitions. [2023-11-06 21:55:50,853 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 5 [2023-11-06 21:55:50,853 INFO L187 NwaCegarLoop]: Found error trace [2023-11-06 21:55:50,854 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1] [2023-11-06 21:55:50,854 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2023-11-06 21:55:50,854 INFO L420 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 101 more)] === [2023-11-06 21:55:50,855 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-11-06 21:55:50,855 INFO L85 PathProgramCache]: Analyzing trace with hash 925670, now seen corresponding path program 1 times [2023-11-06 21:55:50,855 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-06 21:55:50,855 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1578048557] [2023-11-06 21:55:50,855 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-06 21:55:50,856 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-06 21:55:50,876 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 21:55:51,013 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-11-06 21:55:51,014 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-06 21:55:51,014 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1578048557] [2023-11-06 21:55:51,015 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1578048557] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-06 21:55:51,015 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-06 21:55:51,015 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2023-11-06 21:55:51,017 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1010971188] [2023-11-06 21:55:51,017 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-06 21:55:51,018 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2023-11-06 21:55:51,018 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-06 21:55:51,019 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2023-11-06 21:55:51,019 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2023-11-06 21:55:51,019 INFO L87 Difference]: Start difference. First operand 202 states and 231 transitions. Second operand has 4 states, 3 states have (on average 1.3333333333333333) internal successors, (4), 4 states have internal predecessors, (4), 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) [2023-11-06 21:55:51,292 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-11-06 21:55:51,292 INFO L93 Difference]: Finished difference Result 161 states and 190 transitions. [2023-11-06 21:55:51,292 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2023-11-06 21:55:51,293 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 3 states have (on average 1.3333333333333333) internal successors, (4), 4 states have internal predecessors, (4), 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 4 [2023-11-06 21:55:51,293 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-11-06 21:55:51,294 INFO L225 Difference]: With dead ends: 161 [2023-11-06 21:55:51,294 INFO L226 Difference]: Without dead ends: 161 [2023-11-06 21:55:51,295 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2023-11-06 21:55:51,296 INFO L413 NwaCegarLoop]: 97 mSDtfsCounter, 342 mSDsluCounter, 1 mSDsCounter, 0 mSdLazyCounter, 126 mSolverCounterSat, 42 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 342 SdHoareTripleChecker+Valid, 98 SdHoareTripleChecker+Invalid, 168 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 42 IncrementalHoareTripleChecker+Valid, 126 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2023-11-06 21:55:51,297 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [342 Valid, 98 Invalid, 168 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [42 Valid, 126 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2023-11-06 21:55:51,298 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 161 states. [2023-11-06 21:55:51,311 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 161 to 161. [2023-11-06 21:55:51,311 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 161 states, 139 states have (on average 1.3669064748201438) internal successors, (190), 160 states have internal predecessors, (190), 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) [2023-11-06 21:55:51,312 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 161 states to 161 states and 190 transitions. [2023-11-06 21:55:51,313 INFO L78 Accepts]: Start accepts. Automaton has 161 states and 190 transitions. Word has length 4 [2023-11-06 21:55:51,313 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-11-06 21:55:51,313 INFO L495 AbstractCegarLoop]: Abstraction has 161 states and 190 transitions. [2023-11-06 21:55:51,313 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 3 states have (on average 1.3333333333333333) internal successors, (4), 4 states have internal predecessors, (4), 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) [2023-11-06 21:55:51,313 INFO L276 IsEmpty]: Start isEmpty. Operand 161 states and 190 transitions. [2023-11-06 21:55:51,317 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 89 [2023-11-06 21:55:51,317 INFO L187 NwaCegarLoop]: Found error trace [2023-11-06 21:55:51,317 INFO L195 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-11-06 21:55:51,317 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2023-11-06 21:55:51,318 INFO L420 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr103ASSERT_VIOLATIONMEMORY_LEAK === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 101 more)] === [2023-11-06 21:55:51,318 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-11-06 21:55:51,318 INFO L85 PathProgramCache]: Analyzing trace with hash 619894771, now seen corresponding path program 1 times [2023-11-06 21:55:51,319 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-06 21:55:51,319 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [628640444] [2023-11-06 21:55:51,319 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-06 21:55:51,319 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-06 21:55:51,481 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 21:55:51,869 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-11-06 21:55:51,869 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-06 21:55:51,870 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [628640444] [2023-11-06 21:55:51,870 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [628640444] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-06 21:55:51,870 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-06 21:55:51,870 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2023-11-06 21:55:51,871 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [596727932] [2023-11-06 21:55:51,871 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-06 21:55:51,872 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2023-11-06 21:55:51,873 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-06 21:55:51,874 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2023-11-06 21:55:51,874 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2023-11-06 21:55:51,875 INFO L87 Difference]: Start difference. First operand 161 states and 190 transitions. Second operand has 3 states, 3 states have (on average 29.333333333333332) internal successors, (88), 3 states have internal predecessors, (88), 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) [2023-11-06 21:55:51,945 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-11-06 21:55:51,945 INFO L93 Difference]: Finished difference Result 163 states and 190 transitions. [2023-11-06 21:55:51,946 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2023-11-06 21:55:51,946 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 29.333333333333332) internal successors, (88), 3 states have internal predecessors, (88), 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 88 [2023-11-06 21:55:51,947 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-11-06 21:55:51,949 INFO L225 Difference]: With dead ends: 163 [2023-11-06 21:55:51,949 INFO L226 Difference]: Without dead ends: 163 [2023-11-06 21:55:51,949 INFO L412 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 [2023-11-06 21:55:51,961 INFO L413 NwaCegarLoop]: 187 mSDtfsCounter, 91 mSDsluCounter, 60 mSDsCounter, 0 mSdLazyCounter, 38 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 91 SdHoareTripleChecker+Valid, 247 SdHoareTripleChecker+Invalid, 39 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 38 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2023-11-06 21:55:51,962 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [91 Valid, 247 Invalid, 39 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 38 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2023-11-06 21:55:51,963 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 163 states. [2023-11-06 21:55:51,975 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 163 to 161. [2023-11-06 21:55:51,976 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 161 states, 139 states have (on average 1.3597122302158273) internal successors, (189), 160 states have internal predecessors, (189), 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) [2023-11-06 21:55:51,977 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 161 states to 161 states and 189 transitions. [2023-11-06 21:55:51,977 INFO L78 Accepts]: Start accepts. Automaton has 161 states and 189 transitions. Word has length 88 [2023-11-06 21:55:51,978 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-11-06 21:55:51,978 INFO L495 AbstractCegarLoop]: Abstraction has 161 states and 189 transitions. [2023-11-06 21:55:51,978 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 29.333333333333332) internal successors, (88), 3 states have internal predecessors, (88), 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) [2023-11-06 21:55:51,979 INFO L276 IsEmpty]: Start isEmpty. Operand 161 states and 189 transitions. [2023-11-06 21:55:51,981 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 90 [2023-11-06 21:55:51,982 INFO L187 NwaCegarLoop]: Found error trace [2023-11-06 21:55:51,982 INFO L195 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-11-06 21:55:51,982 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2023-11-06 21:55:51,982 INFO L420 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr103ASSERT_VIOLATIONMEMORY_LEAK === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 101 more)] === [2023-11-06 21:55:51,983 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-11-06 21:55:51,983 INFO L85 PathProgramCache]: Analyzing trace with hash 2036637964, now seen corresponding path program 1 times [2023-11-06 21:55:51,983 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-06 21:55:51,984 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1374424238] [2023-11-06 21:55:51,984 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-06 21:55:51,984 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-06 21:55:52,080 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 21:55:52,343 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-11-06 21:55:52,343 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-06 21:55:52,343 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1374424238] [2023-11-06 21:55:52,344 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1374424238] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-06 21:55:52,344 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-06 21:55:52,344 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2023-11-06 21:55:52,344 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [451917190] [2023-11-06 21:55:52,345 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-06 21:55:52,346 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2023-11-06 21:55:52,347 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-06 21:55:52,347 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2023-11-06 21:55:52,347 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2023-11-06 21:55:52,348 INFO L87 Difference]: Start difference. First operand 161 states and 189 transitions. Second operand has 3 states, 3 states have (on average 29.666666666666668) internal successors, (89), 3 states have internal predecessors, (89), 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) [2023-11-06 21:55:52,357 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-11-06 21:55:52,357 INFO L93 Difference]: Finished difference Result 161 states and 188 transitions. [2023-11-06 21:55:52,358 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2023-11-06 21:55:52,358 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 29.666666666666668) internal successors, (89), 3 states have internal predecessors, (89), 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 89 [2023-11-06 21:55:52,361 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-11-06 21:55:52,362 INFO L225 Difference]: With dead ends: 161 [2023-11-06 21:55:52,362 INFO L226 Difference]: Without dead ends: 161 [2023-11-06 21:55:52,362 INFO L412 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 [2023-11-06 21:55:52,368 INFO L413 NwaCegarLoop]: 187 mSDtfsCounter, 101 mSDsluCounter, 85 mSDsCounter, 0 mSdLazyCounter, 2 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 101 SdHoareTripleChecker+Valid, 272 SdHoareTripleChecker+Invalid, 2 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 2 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2023-11-06 21:55:52,369 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [101 Valid, 272 Invalid, 2 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 2 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2023-11-06 21:55:52,370 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 161 states. [2023-11-06 21:55:52,381 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 161 to 161. [2023-11-06 21:55:52,382 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 161 states, 139 states have (on average 1.3525179856115108) internal successors, (188), 160 states have internal predecessors, (188), 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) [2023-11-06 21:55:52,383 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 161 states to 161 states and 188 transitions. [2023-11-06 21:55:52,383 INFO L78 Accepts]: Start accepts. Automaton has 161 states and 188 transitions. Word has length 89 [2023-11-06 21:55:52,383 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-11-06 21:55:52,383 INFO L495 AbstractCegarLoop]: Abstraction has 161 states and 188 transitions. [2023-11-06 21:55:52,384 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 29.666666666666668) internal successors, (89), 3 states have internal predecessors, (89), 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) [2023-11-06 21:55:52,384 INFO L276 IsEmpty]: Start isEmpty. Operand 161 states and 188 transitions. [2023-11-06 21:55:52,387 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 90 [2023-11-06 21:55:52,387 INFO L187 NwaCegarLoop]: Found error trace [2023-11-06 21:55:52,387 INFO L195 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-11-06 21:55:52,387 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2023-11-06 21:55:52,388 INFO L420 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr82REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 101 more)] === [2023-11-06 21:55:52,388 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-11-06 21:55:52,388 INFO L85 PathProgramCache]: Analyzing trace with hash 2036637796, now seen corresponding path program 1 times [2023-11-06 21:55:52,389 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-06 21:55:52,389 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [371447944] [2023-11-06 21:55:52,389 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-06 21:55:52,389 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-06 21:55:52,506 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 21:55:52,764 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-11-06 21:55:52,764 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-06 21:55:52,764 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [371447944] [2023-11-06 21:55:52,764 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [371447944] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-06 21:55:52,765 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-06 21:55:52,765 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2023-11-06 21:55:52,765 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [152564457] [2023-11-06 21:55:52,765 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-06 21:55:52,767 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2023-11-06 21:55:52,767 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-06 21:55:52,767 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2023-11-06 21:55:52,768 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2023-11-06 21:55:52,768 INFO L87 Difference]: Start difference. First operand 161 states and 188 transitions. Second operand has 4 states, 3 states have (on average 29.666666666666668) internal successors, (89), 4 states have internal predecessors, (89), 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) [2023-11-06 21:55:52,990 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-11-06 21:55:52,990 INFO L93 Difference]: Finished difference Result 160 states and 187 transitions. [2023-11-06 21:55:52,991 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2023-11-06 21:55:52,991 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 3 states have (on average 29.666666666666668) internal successors, (89), 4 states have internal predecessors, (89), 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 89 [2023-11-06 21:55:52,992 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-11-06 21:55:52,993 INFO L225 Difference]: With dead ends: 160 [2023-11-06 21:55:52,993 INFO L226 Difference]: Without dead ends: 160 [2023-11-06 21:55:52,993 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2023-11-06 21:55:52,994 INFO L413 NwaCegarLoop]: 129 mSDtfsCounter, 141 mSDsluCounter, 84 mSDsCounter, 0 mSdLazyCounter, 203 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 141 SdHoareTripleChecker+Valid, 213 SdHoareTripleChecker+Invalid, 203 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 203 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2023-11-06 21:55:52,994 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [141 Valid, 213 Invalid, 203 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 203 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2023-11-06 21:55:52,995 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 160 states. [2023-11-06 21:55:52,998 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 160 to 160. [2023-11-06 21:55:52,998 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 160 states, 139 states have (on average 1.3453237410071943) internal successors, (187), 159 states have internal predecessors, (187), 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) [2023-11-06 21:55:52,999 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 160 states to 160 states and 187 transitions. [2023-11-06 21:55:52,999 INFO L78 Accepts]: Start accepts. Automaton has 160 states and 187 transitions. Word has length 89 [2023-11-06 21:55:52,999 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-11-06 21:55:52,999 INFO L495 AbstractCegarLoop]: Abstraction has 160 states and 187 transitions. [2023-11-06 21:55:53,003 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 3 states have (on average 29.666666666666668) internal successors, (89), 4 states have internal predecessors, (89), 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) [2023-11-06 21:55:53,003 INFO L276 IsEmpty]: Start isEmpty. Operand 160 states and 187 transitions. [2023-11-06 21:55:53,007 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 90 [2023-11-06 21:55:53,007 INFO L187 NwaCegarLoop]: Found error trace [2023-11-06 21:55:53,008 INFO L195 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-11-06 21:55:53,008 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2023-11-06 21:55:53,009 INFO L420 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr83REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 101 more)] === [2023-11-06 21:55:53,009 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-11-06 21:55:53,010 INFO L85 PathProgramCache]: Analyzing trace with hash 2036637797, now seen corresponding path program 1 times [2023-11-06 21:55:53,010 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-06 21:55:53,011 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [732948092] [2023-11-06 21:55:53,012 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-06 21:55:53,012 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-06 21:55:53,091 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 21:55:53,573 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-11-06 21:55:53,573 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-06 21:55:53,573 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [732948092] [2023-11-06 21:55:53,574 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [732948092] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-06 21:55:53,574 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-06 21:55:53,574 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2023-11-06 21:55:53,574 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1185304069] [2023-11-06 21:55:53,574 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-06 21:55:53,575 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2023-11-06 21:55:53,575 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-06 21:55:53,575 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2023-11-06 21:55:53,576 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2023-11-06 21:55:53,576 INFO L87 Difference]: Start difference. First operand 160 states and 187 transitions. Second operand has 5 states, 4 states have (on average 22.25) internal successors, (89), 5 states have internal predecessors, (89), 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) [2023-11-06 21:55:53,958 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-11-06 21:55:53,958 INFO L93 Difference]: Finished difference Result 159 states and 186 transitions. [2023-11-06 21:55:53,958 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2023-11-06 21:55:53,958 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 4 states have (on average 22.25) internal successors, (89), 5 states have internal predecessors, (89), 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 89 [2023-11-06 21:55:53,959 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-11-06 21:55:53,960 INFO L225 Difference]: With dead ends: 159 [2023-11-06 21:55:53,960 INFO L226 Difference]: Without dead ends: 159 [2023-11-06 21:55:53,960 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=22, Invalid=34, Unknown=0, NotChecked=0, Total=56 [2023-11-06 21:55:53,961 INFO L413 NwaCegarLoop]: 128 mSDtfsCounter, 210 mSDsluCounter, 137 mSDsCounter, 0 mSdLazyCounter, 255 mSolverCounterSat, 10 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 210 SdHoareTripleChecker+Valid, 265 SdHoareTripleChecker+Invalid, 265 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 10 IncrementalHoareTripleChecker+Valid, 255 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2023-11-06 21:55:53,961 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [210 Valid, 265 Invalid, 265 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [10 Valid, 255 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2023-11-06 21:55:53,962 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 159 states. [2023-11-06 21:55:53,965 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 159 to 159. [2023-11-06 21:55:53,965 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 159 states, 139 states have (on average 1.3381294964028776) internal successors, (186), 158 states have internal predecessors, (186), 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) [2023-11-06 21:55:53,966 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 159 states to 159 states and 186 transitions. [2023-11-06 21:55:53,966 INFO L78 Accepts]: Start accepts. Automaton has 159 states and 186 transitions. Word has length 89 [2023-11-06 21:55:53,966 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-11-06 21:55:53,967 INFO L495 AbstractCegarLoop]: Abstraction has 159 states and 186 transitions. [2023-11-06 21:55:53,967 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 4 states have (on average 22.25) internal successors, (89), 5 states have internal predecessors, (89), 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) [2023-11-06 21:55:53,967 INFO L276 IsEmpty]: Start isEmpty. Operand 159 states and 186 transitions. [2023-11-06 21:55:53,968 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 92 [2023-11-06 21:55:53,968 INFO L187 NwaCegarLoop]: Found error trace [2023-11-06 21:55:53,968 INFO L195 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-11-06 21:55:53,969 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2023-11-06 21:55:53,969 INFO L420 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr103ASSERT_VIOLATIONMEMORY_LEAK === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 101 more)] === [2023-11-06 21:55:53,969 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-11-06 21:55:53,969 INFO L85 PathProgramCache]: Analyzing trace with hash -1296152919, now seen corresponding path program 1 times [2023-11-06 21:55:53,970 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-06 21:55:53,970 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [246519205] [2023-11-06 21:55:53,970 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-06 21:55:53,970 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-06 21:55:54,065 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 21:55:54,959 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-11-06 21:55:54,959 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-06 21:55:54,959 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [246519205] [2023-11-06 21:55:54,959 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [246519205] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-06 21:55:54,960 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-06 21:55:54,960 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2023-11-06 21:55:54,960 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2029852423] [2023-11-06 21:55:54,960 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-06 21:55:54,961 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2023-11-06 21:55:54,961 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-06 21:55:54,962 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2023-11-06 21:55:54,962 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=21, Invalid=51, Unknown=0, NotChecked=0, Total=72 [2023-11-06 21:55:54,962 INFO L87 Difference]: Start difference. First operand 159 states and 186 transitions. Second operand has 9 states, 8 states have (on average 11.375) internal successors, (91), 9 states have internal predecessors, (91), 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) [2023-11-06 21:55:55,332 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-11-06 21:55:55,332 INFO L93 Difference]: Finished difference Result 158 states and 185 transitions. [2023-11-06 21:55:55,333 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2023-11-06 21:55:55,333 INFO L78 Accepts]: Start accepts. Automaton has has 9 states, 8 states have (on average 11.375) internal successors, (91), 9 states have internal predecessors, (91), 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 91 [2023-11-06 21:55:55,334 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-11-06 21:55:55,335 INFO L225 Difference]: With dead ends: 158 [2023-11-06 21:55:55,335 INFO L226 Difference]: Without dead ends: 157 [2023-11-06 21:55:55,335 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 14 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=21, Invalid=51, Unknown=0, NotChecked=0, Total=72 [2023-11-06 21:55:55,336 INFO L413 NwaCegarLoop]: 85 mSDtfsCounter, 140 mSDsluCounter, 209 mSDsCounter, 0 mSdLazyCounter, 365 mSolverCounterSat, 29 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 140 SdHoareTripleChecker+Valid, 294 SdHoareTripleChecker+Invalid, 394 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 29 IncrementalHoareTripleChecker+Valid, 365 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2023-11-06 21:55:55,336 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [140 Valid, 294 Invalid, 394 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [29 Valid, 365 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2023-11-06 21:55:55,337 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 157 states. [2023-11-06 21:55:55,340 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 157 to 157. [2023-11-06 21:55:55,341 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 157 states, 138 states have (on average 1.1376811594202898) internal successors, (157), 156 states have internal predecessors, (157), 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) [2023-11-06 21:55:55,342 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 157 states to 157 states and 157 transitions. [2023-11-06 21:55:55,342 INFO L78 Accepts]: Start accepts. Automaton has 157 states and 157 transitions. Word has length 91 [2023-11-06 21:55:55,342 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-11-06 21:55:55,343 INFO L495 AbstractCegarLoop]: Abstraction has 157 states and 157 transitions. [2023-11-06 21:55:55,343 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 8 states have (on average 11.375) internal successors, (91), 9 states have internal predecessors, (91), 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) [2023-11-06 21:55:55,343 INFO L276 IsEmpty]: Start isEmpty. Operand 157 states and 157 transitions. [2023-11-06 21:55:55,345 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 95 [2023-11-06 21:55:55,345 INFO L187 NwaCegarLoop]: Found error trace [2023-11-06 21:55:55,345 INFO L195 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-11-06 21:55:55,345 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2023-11-06 21:55:55,346 INFO L420 AbstractCegarLoop]: === Iteration 9 === Targeting ULTIMATE.startErr84REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 101 more)] === [2023-11-06 21:55:55,346 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-11-06 21:55:55,347 INFO L85 PathProgramCache]: Analyzing trace with hash -2145244098, now seen corresponding path program 1 times [2023-11-06 21:55:55,347 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-06 21:55:55,347 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [512739219] [2023-11-06 21:55:55,347 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-06 21:55:55,348 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-06 21:55:55,410 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 21:55:55,586 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-11-06 21:55:55,587 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-06 21:55:55,587 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [512739219] [2023-11-06 21:55:55,587 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [512739219] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-06 21:55:55,587 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-06 21:55:55,587 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2023-11-06 21:55:55,588 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [734062976] [2023-11-06 21:55:55,588 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-06 21:55:55,588 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2023-11-06 21:55:55,589 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-06 21:55:55,589 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2023-11-06 21:55:55,589 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2023-11-06 21:55:55,590 INFO L87 Difference]: Start difference. First operand 157 states and 157 transitions. Second operand has 5 states, 4 states have (on average 23.5) internal successors, (94), 5 states have internal predecessors, (94), 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) [2023-11-06 21:55:55,757 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-11-06 21:55:55,757 INFO L93 Difference]: Finished difference Result 156 states and 156 transitions. [2023-11-06 21:55:55,757 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2023-11-06 21:55:55,758 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 4 states have (on average 23.5) internal successors, (94), 5 states have internal predecessors, (94), 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 94 [2023-11-06 21:55:55,758 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-11-06 21:55:55,759 INFO L225 Difference]: With dead ends: 156 [2023-11-06 21:55:55,759 INFO L226 Difference]: Without dead ends: 156 [2023-11-06 21:55:55,760 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=17, Invalid=25, Unknown=0, NotChecked=0, Total=42 [2023-11-06 21:55:55,760 INFO L413 NwaCegarLoop]: 127 mSDtfsCounter, 198 mSDsluCounter, 171 mSDsCounter, 0 mSdLazyCounter, 121 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 198 SdHoareTripleChecker+Valid, 298 SdHoareTripleChecker+Invalid, 122 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 121 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2023-11-06 21:55:55,761 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [198 Valid, 298 Invalid, 122 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 121 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2023-11-06 21:55:55,772 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 156 states. [2023-11-06 21:55:55,774 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 156 to 156. [2023-11-06 21:55:55,775 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 156 states, 138 states have (on average 1.1304347826086956) internal successors, (156), 155 states have internal predecessors, (156), 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) [2023-11-06 21:55:55,776 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 156 states to 156 states and 156 transitions. [2023-11-06 21:55:55,780 INFO L78 Accepts]: Start accepts. Automaton has 156 states and 156 transitions. Word has length 94 [2023-11-06 21:55:55,780 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-11-06 21:55:55,781 INFO L495 AbstractCegarLoop]: Abstraction has 156 states and 156 transitions. [2023-11-06 21:55:55,781 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 4 states have (on average 23.5) internal successors, (94), 5 states have internal predecessors, (94), 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) [2023-11-06 21:55:55,781 INFO L276 IsEmpty]: Start isEmpty. Operand 156 states and 156 transitions. [2023-11-06 21:55:55,782 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 95 [2023-11-06 21:55:55,782 INFO L187 NwaCegarLoop]: Found error trace [2023-11-06 21:55:55,782 INFO L195 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-11-06 21:55:55,783 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2023-11-06 21:55:55,783 INFO L420 AbstractCegarLoop]: === Iteration 10 === Targeting ULTIMATE.startErr85REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 101 more)] === [2023-11-06 21:55:55,784 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-11-06 21:55:55,784 INFO L85 PathProgramCache]: Analyzing trace with hash -2145244097, now seen corresponding path program 1 times [2023-11-06 21:55:55,784 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-06 21:55:55,784 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1898567454] [2023-11-06 21:55:55,784 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-06 21:55:55,785 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-06 21:55:55,850 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 21:55:56,283 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-11-06 21:55:56,283 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-06 21:55:56,283 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1898567454] [2023-11-06 21:55:56,283 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1898567454] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-06 21:55:56,284 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-06 21:55:56,284 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2023-11-06 21:55:56,284 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [823735228] [2023-11-06 21:55:56,284 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-06 21:55:56,285 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2023-11-06 21:55:56,285 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-06 21:55:56,285 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2023-11-06 21:55:56,286 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2023-11-06 21:55:56,286 INFO L87 Difference]: Start difference. First operand 156 states and 156 transitions. Second operand has 5 states, 4 states have (on average 23.5) internal successors, (94), 5 states have internal predecessors, (94), 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) [2023-11-06 21:55:56,619 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-11-06 21:55:56,620 INFO L93 Difference]: Finished difference Result 155 states and 155 transitions. [2023-11-06 21:55:56,620 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2023-11-06 21:55:56,621 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 4 states have (on average 23.5) internal successors, (94), 5 states have internal predecessors, (94), 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 94 [2023-11-06 21:55:56,621 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-11-06 21:55:56,622 INFO L225 Difference]: With dead ends: 155 [2023-11-06 21:55:56,622 INFO L226 Difference]: Without dead ends: 155 [2023-11-06 21:55:56,622 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=22, Invalid=34, Unknown=0, NotChecked=0, Total=56 [2023-11-06 21:55:56,623 INFO L413 NwaCegarLoop]: 126 mSDtfsCounter, 166 mSDsluCounter, 137 mSDsCounter, 0 mSdLazyCounter, 173 mSolverCounterSat, 9 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 166 SdHoareTripleChecker+Valid, 263 SdHoareTripleChecker+Invalid, 182 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 9 IncrementalHoareTripleChecker+Valid, 173 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2023-11-06 21:55:56,623 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [166 Valid, 263 Invalid, 182 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [9 Valid, 173 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2023-11-06 21:55:56,624 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 155 states. [2023-11-06 21:55:56,626 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 155 to 155. [2023-11-06 21:55:56,627 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 155 states, 138 states have (on average 1.1231884057971016) internal successors, (155), 154 states have internal predecessors, (155), 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) [2023-11-06 21:55:56,627 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 155 states to 155 states and 155 transitions. [2023-11-06 21:55:56,627 INFO L78 Accepts]: Start accepts. Automaton has 155 states and 155 transitions. Word has length 94 [2023-11-06 21:55:56,628 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-11-06 21:55:56,628 INFO L495 AbstractCegarLoop]: Abstraction has 155 states and 155 transitions. [2023-11-06 21:55:56,628 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 4 states have (on average 23.5) internal successors, (94), 5 states have internal predecessors, (94), 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) [2023-11-06 21:55:56,628 INFO L276 IsEmpty]: Start isEmpty. Operand 155 states and 155 transitions. [2023-11-06 21:55:56,629 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 100 [2023-11-06 21:55:56,629 INFO L187 NwaCegarLoop]: Found error trace [2023-11-06 21:55:56,629 INFO L195 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-11-06 21:55:56,629 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9 [2023-11-06 21:55:56,630 INFO L420 AbstractCegarLoop]: === Iteration 11 === Targeting ULTIMATE.startErr86REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 101 more)] === [2023-11-06 21:55:56,630 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-11-06 21:55:56,630 INFO L85 PathProgramCache]: Analyzing trace with hash -837057419, now seen corresponding path program 1 times [2023-11-06 21:55:56,630 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-06 21:55:56,630 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [189657999] [2023-11-06 21:55:56,631 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-06 21:55:56,631 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-06 21:55:56,703 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 21:55:56,890 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-11-06 21:55:56,890 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-06 21:55:56,891 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [189657999] [2023-11-06 21:55:56,891 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [189657999] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-06 21:55:56,891 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-06 21:55:56,891 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2023-11-06 21:55:56,891 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1337690338] [2023-11-06 21:55:56,892 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-06 21:55:56,892 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2023-11-06 21:55:56,892 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-06 21:55:56,893 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2023-11-06 21:55:56,893 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2023-11-06 21:55:56,893 INFO L87 Difference]: Start difference. First operand 155 states and 155 transitions. Second operand has 5 states, 4 states have (on average 24.75) internal successors, (99), 5 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) [2023-11-06 21:55:57,056 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-11-06 21:55:57,057 INFO L93 Difference]: Finished difference Result 154 states and 154 transitions. [2023-11-06 21:55:57,057 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2023-11-06 21:55:57,057 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 4 states have (on average 24.75) internal successors, (99), 5 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) Word has length 99 [2023-11-06 21:55:57,058 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-11-06 21:55:57,058 INFO L225 Difference]: With dead ends: 154 [2023-11-06 21:55:57,059 INFO L226 Difference]: Without dead ends: 154 [2023-11-06 21:55:57,059 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=17, Invalid=25, Unknown=0, NotChecked=0, Total=42 [2023-11-06 21:55:57,059 INFO L413 NwaCegarLoop]: 126 mSDtfsCounter, 182 mSDsluCounter, 174 mSDsCounter, 0 mSdLazyCounter, 122 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 182 SdHoareTripleChecker+Valid, 300 SdHoareTripleChecker+Invalid, 123 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 122 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2023-11-06 21:55:57,060 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [182 Valid, 300 Invalid, 123 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 122 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2023-11-06 21:55:57,060 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 154 states. [2023-11-06 21:55:57,063 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 154 to 154. [2023-11-06 21:55:57,063 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 154 states, 138 states have (on average 1.1159420289855073) internal successors, (154), 153 states have internal predecessors, (154), 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) [2023-11-06 21:55:57,064 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 154 states to 154 states and 154 transitions. [2023-11-06 21:55:57,064 INFO L78 Accepts]: Start accepts. Automaton has 154 states and 154 transitions. Word has length 99 [2023-11-06 21:55:57,065 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-11-06 21:55:57,065 INFO L495 AbstractCegarLoop]: Abstraction has 154 states and 154 transitions. [2023-11-06 21:55:57,065 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 4 states have (on average 24.75) internal successors, (99), 5 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) [2023-11-06 21:55:57,065 INFO L276 IsEmpty]: Start isEmpty. Operand 154 states and 154 transitions. [2023-11-06 21:55:57,066 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 100 [2023-11-06 21:55:57,066 INFO L187 NwaCegarLoop]: Found error trace [2023-11-06 21:55:57,067 INFO L195 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-11-06 21:55:57,067 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10 [2023-11-06 21:55:57,067 INFO L420 AbstractCegarLoop]: === Iteration 12 === Targeting ULTIMATE.startErr87REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 101 more)] === [2023-11-06 21:55:57,068 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-11-06 21:55:57,068 INFO L85 PathProgramCache]: Analyzing trace with hash -837057418, now seen corresponding path program 1 times [2023-11-06 21:55:57,068 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-06 21:55:57,068 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1654181804] [2023-11-06 21:55:57,068 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-06 21:55:57,069 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-06 21:55:57,132 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 21:55:57,798 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-11-06 21:55:57,799 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-06 21:55:57,799 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1654181804] [2023-11-06 21:55:57,799 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1654181804] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-06 21:55:57,799 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-06 21:55:57,799 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2023-11-06 21:55:57,800 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [149389995] [2023-11-06 21:55:57,800 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-06 21:55:57,800 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2023-11-06 21:55:57,800 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-06 21:55:57,801 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2023-11-06 21:55:57,801 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=14, Invalid=28, Unknown=0, NotChecked=0, Total=42 [2023-11-06 21:55:57,802 INFO L87 Difference]: Start difference. First operand 154 states and 154 transitions. Second operand has 7 states, 6 states have (on average 16.5) internal successors, (99), 7 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) [2023-11-06 21:55:58,122 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-11-06 21:55:58,122 INFO L93 Difference]: Finished difference Result 153 states and 153 transitions. [2023-11-06 21:55:58,122 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2023-11-06 21:55:58,123 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 6 states have (on average 16.5) internal successors, (99), 7 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) Word has length 99 [2023-11-06 21:55:58,123 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-11-06 21:55:58,124 INFO L225 Difference]: With dead ends: 153 [2023-11-06 21:55:58,124 INFO L226 Difference]: Without dead ends: 153 [2023-11-06 21:55:58,124 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 9 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=42, Invalid=68, Unknown=0, NotChecked=0, Total=110 [2023-11-06 21:55:58,125 INFO L413 NwaCegarLoop]: 125 mSDtfsCounter, 270 mSDsluCounter, 143 mSDsCounter, 0 mSdLazyCounter, 179 mSolverCounterSat, 9 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 270 SdHoareTripleChecker+Valid, 268 SdHoareTripleChecker+Invalid, 188 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 9 IncrementalHoareTripleChecker+Valid, 179 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2023-11-06 21:55:58,125 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [270 Valid, 268 Invalid, 188 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [9 Valid, 179 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2023-11-06 21:55:58,126 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 153 states. [2023-11-06 21:55:58,128 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 153 to 153. [2023-11-06 21:55:58,128 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 153 states, 138 states have (on average 1.108695652173913) internal successors, (153), 152 states have internal predecessors, (153), 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) [2023-11-06 21:55:58,129 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 153 states to 153 states and 153 transitions. [2023-11-06 21:55:58,129 INFO L78 Accepts]: Start accepts. Automaton has 153 states and 153 transitions. Word has length 99 [2023-11-06 21:55:58,129 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-11-06 21:55:58,130 INFO L495 AbstractCegarLoop]: Abstraction has 153 states and 153 transitions. [2023-11-06 21:55:58,130 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 6 states have (on average 16.5) internal successors, (99), 7 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) [2023-11-06 21:55:58,130 INFO L276 IsEmpty]: Start isEmpty. Operand 153 states and 153 transitions. [2023-11-06 21:55:58,131 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 105 [2023-11-06 21:55:58,131 INFO L187 NwaCegarLoop]: Found error trace [2023-11-06 21:55:58,131 INFO L195 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-11-06 21:55:58,131 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable11 [2023-11-06 21:55:58,131 INFO L420 AbstractCegarLoop]: === Iteration 13 === Targeting ULTIMATE.startErr88REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 101 more)] === [2023-11-06 21:55:58,135 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-11-06 21:55:58,135 INFO L85 PathProgramCache]: Analyzing trace with hash -586464657, now seen corresponding path program 1 times [2023-11-06 21:55:58,136 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-06 21:55:58,136 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [499591198] [2023-11-06 21:55:58,136 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-06 21:55:58,136 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-06 21:55:58,229 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 21:55:58,412 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-11-06 21:55:58,412 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-06 21:55:58,413 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [499591198] [2023-11-06 21:55:58,413 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [499591198] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-06 21:55:58,413 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-06 21:55:58,413 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2023-11-06 21:55:58,413 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [992582665] [2023-11-06 21:55:58,414 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-06 21:55:58,414 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2023-11-06 21:55:58,414 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-06 21:55:58,415 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2023-11-06 21:55:58,415 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2023-11-06 21:55:58,416 INFO L87 Difference]: Start difference. First operand 153 states and 153 transitions. Second operand has 5 states, 4 states have (on average 26.0) internal successors, (104), 5 states have internal predecessors, (104), 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) [2023-11-06 21:55:58,566 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-11-06 21:55:58,566 INFO L93 Difference]: Finished difference Result 152 states and 152 transitions. [2023-11-06 21:55:58,566 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2023-11-06 21:55:58,567 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 4 states have (on average 26.0) internal successors, (104), 5 states have internal predecessors, (104), 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 104 [2023-11-06 21:55:58,567 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-11-06 21:55:58,568 INFO L225 Difference]: With dead ends: 152 [2023-11-06 21:55:58,568 INFO L226 Difference]: Without dead ends: 152 [2023-11-06 21:55:58,568 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=17, Invalid=25, Unknown=0, NotChecked=0, Total=42 [2023-11-06 21:55:58,569 INFO L413 NwaCegarLoop]: 125 mSDtfsCounter, 166 mSDsluCounter, 177 mSDsCounter, 0 mSdLazyCounter, 123 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 166 SdHoareTripleChecker+Valid, 302 SdHoareTripleChecker+Invalid, 124 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 123 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2023-11-06 21:55:58,569 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [166 Valid, 302 Invalid, 124 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 123 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2023-11-06 21:55:58,570 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 152 states. [2023-11-06 21:55:58,572 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 152 to 152. [2023-11-06 21:55:58,572 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 152 states, 138 states have (on average 1.1014492753623188) internal successors, (152), 151 states have internal predecessors, (152), 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) [2023-11-06 21:55:58,573 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 152 states to 152 states and 152 transitions. [2023-11-06 21:55:58,573 INFO L78 Accepts]: Start accepts. Automaton has 152 states and 152 transitions. Word has length 104 [2023-11-06 21:55:58,573 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-11-06 21:55:58,573 INFO L495 AbstractCegarLoop]: Abstraction has 152 states and 152 transitions. [2023-11-06 21:55:58,574 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 4 states have (on average 26.0) internal successors, (104), 5 states have internal predecessors, (104), 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) [2023-11-06 21:55:58,574 INFO L276 IsEmpty]: Start isEmpty. Operand 152 states and 152 transitions. [2023-11-06 21:55:58,574 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 105 [2023-11-06 21:55:58,575 INFO L187 NwaCegarLoop]: Found error trace [2023-11-06 21:55:58,575 INFO L195 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-11-06 21:55:58,575 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable12 [2023-11-06 21:55:58,575 INFO L420 AbstractCegarLoop]: === Iteration 14 === Targeting ULTIMATE.startErr89REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 101 more)] === [2023-11-06 21:55:58,575 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-11-06 21:55:58,575 INFO L85 PathProgramCache]: Analyzing trace with hash -586464656, now seen corresponding path program 1 times [2023-11-06 21:55:58,576 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-06 21:55:58,579 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1132984608] [2023-11-06 21:55:58,579 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-06 21:55:58,579 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-06 21:55:58,659 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 21:55:59,200 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-11-06 21:55:59,200 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-06 21:55:59,201 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1132984608] [2023-11-06 21:55:59,201 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1132984608] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-06 21:55:59,201 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-06 21:55:59,201 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2023-11-06 21:55:59,201 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1318318585] [2023-11-06 21:55:59,201 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-06 21:55:59,202 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2023-11-06 21:55:59,202 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-06 21:55:59,203 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2023-11-06 21:55:59,203 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2023-11-06 21:55:59,203 INFO L87 Difference]: Start difference. First operand 152 states and 152 transitions. Second operand has 6 states, 5 states have (on average 20.8) internal successors, (104), 6 states have internal predecessors, (104), 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) [2023-11-06 21:55:59,510 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-11-06 21:55:59,511 INFO L93 Difference]: Finished difference Result 151 states and 151 transitions. [2023-11-06 21:55:59,511 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2023-11-06 21:55:59,511 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 5 states have (on average 20.8) internal successors, (104), 6 states have internal predecessors, (104), 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 104 [2023-11-06 21:55:59,512 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-11-06 21:55:59,512 INFO L225 Difference]: With dead ends: 151 [2023-11-06 21:55:59,513 INFO L226 Difference]: Without dead ends: 151 [2023-11-06 21:55:59,513 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=34, Invalid=56, Unknown=0, NotChecked=0, Total=90 [2023-11-06 21:55:59,513 INFO L413 NwaCegarLoop]: 124 mSDtfsCounter, 192 mSDsluCounter, 146 mSDsCounter, 0 mSdLazyCounter, 180 mSolverCounterSat, 9 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 192 SdHoareTripleChecker+Valid, 270 SdHoareTripleChecker+Invalid, 189 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 9 IncrementalHoareTripleChecker+Valid, 180 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2023-11-06 21:55:59,514 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [192 Valid, 270 Invalid, 189 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [9 Valid, 180 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2023-11-06 21:55:59,514 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 151 states. [2023-11-06 21:55:59,516 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 151 to 151. [2023-11-06 21:55:59,517 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 151 states, 138 states have (on average 1.0942028985507246) internal successors, (151), 150 states have internal predecessors, (151), 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) [2023-11-06 21:55:59,517 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 151 states to 151 states and 151 transitions. [2023-11-06 21:55:59,518 INFO L78 Accepts]: Start accepts. Automaton has 151 states and 151 transitions. Word has length 104 [2023-11-06 21:55:59,518 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-11-06 21:55:59,518 INFO L495 AbstractCegarLoop]: Abstraction has 151 states and 151 transitions. [2023-11-06 21:55:59,519 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 5 states have (on average 20.8) internal successors, (104), 6 states have internal predecessors, (104), 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) [2023-11-06 21:55:59,520 INFO L276 IsEmpty]: Start isEmpty. Operand 151 states and 151 transitions. [2023-11-06 21:55:59,520 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 110 [2023-11-06 21:55:59,521 INFO L187 NwaCegarLoop]: Found error trace [2023-11-06 21:55:59,521 INFO L195 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-11-06 21:55:59,521 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable13 [2023-11-06 21:55:59,521 INFO L420 AbstractCegarLoop]: === Iteration 15 === Targeting ULTIMATE.startErr90REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 101 more)] === [2023-11-06 21:55:59,522 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-11-06 21:55:59,522 INFO L85 PathProgramCache]: Analyzing trace with hash -84099962, now seen corresponding path program 1 times [2023-11-06 21:55:59,522 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-06 21:55:59,522 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [54317869] [2023-11-06 21:55:59,522 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-06 21:55:59,523 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-06 21:55:59,599 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 21:55:59,815 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-11-06 21:55:59,815 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-06 21:55:59,815 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [54317869] [2023-11-06 21:55:59,815 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [54317869] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-06 21:55:59,816 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-06 21:55:59,816 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2023-11-06 21:55:59,816 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [379404608] [2023-11-06 21:55:59,816 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-06 21:55:59,817 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2023-11-06 21:55:59,817 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-06 21:55:59,817 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2023-11-06 21:55:59,818 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2023-11-06 21:55:59,818 INFO L87 Difference]: Start difference. First operand 151 states and 151 transitions. Second operand has 5 states, 4 states have (on average 27.25) internal successors, (109), 5 states have internal predecessors, (109), 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) [2023-11-06 21:55:59,974 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-11-06 21:55:59,975 INFO L93 Difference]: Finished difference Result 150 states and 150 transitions. [2023-11-06 21:55:59,975 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2023-11-06 21:55:59,975 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 4 states have (on average 27.25) internal successors, (109), 5 states have internal predecessors, (109), 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 109 [2023-11-06 21:55:59,976 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-11-06 21:55:59,977 INFO L225 Difference]: With dead ends: 150 [2023-11-06 21:55:59,977 INFO L226 Difference]: Without dead ends: 150 [2023-11-06 21:55:59,977 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=17, Invalid=25, Unknown=0, NotChecked=0, Total=42 [2023-11-06 21:55:59,978 INFO L413 NwaCegarLoop]: 124 mSDtfsCounter, 150 mSDsluCounter, 180 mSDsCounter, 0 mSdLazyCounter, 124 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 150 SdHoareTripleChecker+Valid, 304 SdHoareTripleChecker+Invalid, 125 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 124 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2023-11-06 21:55:59,978 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [150 Valid, 304 Invalid, 125 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 124 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2023-11-06 21:55:59,979 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 150 states. [2023-11-06 21:55:59,981 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 150 to 150. [2023-11-06 21:55:59,981 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 150 states, 138 states have (on average 1.0869565217391304) internal successors, (150), 149 states have internal predecessors, (150), 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) [2023-11-06 21:55:59,982 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 150 states to 150 states and 150 transitions. [2023-11-06 21:55:59,982 INFO L78 Accepts]: Start accepts. Automaton has 150 states and 150 transitions. Word has length 109 [2023-11-06 21:55:59,982 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-11-06 21:55:59,982 INFO L495 AbstractCegarLoop]: Abstraction has 150 states and 150 transitions. [2023-11-06 21:55:59,982 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 4 states have (on average 27.25) internal successors, (109), 5 states have internal predecessors, (109), 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) [2023-11-06 21:55:59,983 INFO L276 IsEmpty]: Start isEmpty. Operand 150 states and 150 transitions. [2023-11-06 21:55:59,983 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 110 [2023-11-06 21:55:59,984 INFO L187 NwaCegarLoop]: Found error trace [2023-11-06 21:55:59,986 INFO L195 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-11-06 21:55:59,987 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable14 [2023-11-06 21:55:59,987 INFO L420 AbstractCegarLoop]: === Iteration 16 === Targeting ULTIMATE.startErr91REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 101 more)] === [2023-11-06 21:55:59,987 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-11-06 21:55:59,987 INFO L85 PathProgramCache]: Analyzing trace with hash -84099961, now seen corresponding path program 1 times [2023-11-06 21:55:59,988 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-06 21:55:59,988 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1410563460] [2023-11-06 21:55:59,988 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-06 21:55:59,988 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-06 21:56:00,065 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 21:56:00,701 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-11-06 21:56:00,701 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-06 21:56:00,701 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1410563460] [2023-11-06 21:56:00,703 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1410563460] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-06 21:56:00,704 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-06 21:56:00,704 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2023-11-06 21:56:00,704 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2048823049] [2023-11-06 21:56:00,704 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-06 21:56:00,705 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2023-11-06 21:56:00,705 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-06 21:56:00,706 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2023-11-06 21:56:00,706 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=14, Invalid=28, Unknown=0, NotChecked=0, Total=42 [2023-11-06 21:56:00,706 INFO L87 Difference]: Start difference. First operand 150 states and 150 transitions. Second operand has 7 states, 6 states have (on average 18.166666666666668) internal successors, (109), 7 states have internal predecessors, (109), 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) [2023-11-06 21:56:01,066 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-11-06 21:56:01,066 INFO L93 Difference]: Finished difference Result 149 states and 149 transitions. [2023-11-06 21:56:01,067 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2023-11-06 21:56:01,068 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 6 states have (on average 18.166666666666668) internal successors, (109), 7 states have internal predecessors, (109), 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 109 [2023-11-06 21:56:01,068 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-11-06 21:56:01,069 INFO L225 Difference]: With dead ends: 149 [2023-11-06 21:56:01,069 INFO L226 Difference]: Without dead ends: 149 [2023-11-06 21:56:01,069 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 9 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=42, Invalid=68, Unknown=0, NotChecked=0, Total=110 [2023-11-06 21:56:01,070 INFO L413 NwaCegarLoop]: 123 mSDtfsCounter, 187 mSDsluCounter, 190 mSDsCounter, 0 mSdLazyCounter, 224 mSolverCounterSat, 9 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 187 SdHoareTripleChecker+Valid, 313 SdHoareTripleChecker+Invalid, 233 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 9 IncrementalHoareTripleChecker+Valid, 224 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2023-11-06 21:56:01,070 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [187 Valid, 313 Invalid, 233 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [9 Valid, 224 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2023-11-06 21:56:01,071 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 149 states. [2023-11-06 21:56:01,074 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 149 to 149. [2023-11-06 21:56:01,074 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 149 states, 138 states have (on average 1.0797101449275361) internal successors, (149), 148 states have internal predecessors, (149), 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) [2023-11-06 21:56:01,075 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 149 states to 149 states and 149 transitions. [2023-11-06 21:56:01,076 INFO L78 Accepts]: Start accepts. Automaton has 149 states and 149 transitions. Word has length 109 [2023-11-06 21:56:01,076 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-11-06 21:56:01,076 INFO L495 AbstractCegarLoop]: Abstraction has 149 states and 149 transitions. [2023-11-06 21:56:01,076 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 6 states have (on average 18.166666666666668) internal successors, (109), 7 states have internal predecessors, (109), 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) [2023-11-06 21:56:01,077 INFO L276 IsEmpty]: Start isEmpty. Operand 149 states and 149 transitions. [2023-11-06 21:56:01,077 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 115 [2023-11-06 21:56:01,078 INFO L187 NwaCegarLoop]: Found error trace [2023-11-06 21:56:01,078 INFO L195 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-11-06 21:56:01,078 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable15 [2023-11-06 21:56:01,078 INFO L420 AbstractCegarLoop]: === Iteration 17 === Targeting ULTIMATE.startErr92REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 101 more)] === [2023-11-06 21:56:01,079 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-11-06 21:56:01,079 INFO L85 PathProgramCache]: Analyzing trace with hash 1126073504, now seen corresponding path program 1 times [2023-11-06 21:56:01,080 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-06 21:56:01,080 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1888770791] [2023-11-06 21:56:01,080 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-06 21:56:01,080 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-06 21:56:01,151 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 21:56:01,354 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-11-06 21:56:01,355 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-06 21:56:01,355 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1888770791] [2023-11-06 21:56:01,355 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1888770791] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-06 21:56:01,355 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-06 21:56:01,355 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2023-11-06 21:56:01,356 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [585193996] [2023-11-06 21:56:01,356 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-06 21:56:01,356 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2023-11-06 21:56:01,357 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-06 21:56:01,357 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2023-11-06 21:56:01,357 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2023-11-06 21:56:01,358 INFO L87 Difference]: Start difference. First operand 149 states and 149 transitions. Second operand has 5 states, 4 states have (on average 28.5) internal successors, (114), 5 states have internal predecessors, (114), 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) [2023-11-06 21:56:01,516 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-11-06 21:56:01,516 INFO L93 Difference]: Finished difference Result 148 states and 148 transitions. [2023-11-06 21:56:01,516 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2023-11-06 21:56:01,517 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 4 states have (on average 28.5) internal successors, (114), 5 states have internal predecessors, (114), 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 114 [2023-11-06 21:56:01,517 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-11-06 21:56:01,518 INFO L225 Difference]: With dead ends: 148 [2023-11-06 21:56:01,518 INFO L226 Difference]: Without dead ends: 148 [2023-11-06 21:56:01,518 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=17, Invalid=25, Unknown=0, NotChecked=0, Total=42 [2023-11-06 21:56:01,519 INFO L413 NwaCegarLoop]: 123 mSDtfsCounter, 134 mSDsluCounter, 183 mSDsCounter, 0 mSdLazyCounter, 125 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 134 SdHoareTripleChecker+Valid, 306 SdHoareTripleChecker+Invalid, 126 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 125 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2023-11-06 21:56:01,519 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [134 Valid, 306 Invalid, 126 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 125 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2023-11-06 21:56:01,520 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 148 states. [2023-11-06 21:56:01,522 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 148 to 148. [2023-11-06 21:56:01,522 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 148 states, 138 states have (on average 1.0724637681159421) internal successors, (148), 147 states have internal predecessors, (148), 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) [2023-11-06 21:56:01,523 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 148 states to 148 states and 148 transitions. [2023-11-06 21:56:01,523 INFO L78 Accepts]: Start accepts. Automaton has 148 states and 148 transitions. Word has length 114 [2023-11-06 21:56:01,524 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-11-06 21:56:01,524 INFO L495 AbstractCegarLoop]: Abstraction has 148 states and 148 transitions. [2023-11-06 21:56:01,524 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 4 states have (on average 28.5) internal successors, (114), 5 states have internal predecessors, (114), 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) [2023-11-06 21:56:01,524 INFO L276 IsEmpty]: Start isEmpty. Operand 148 states and 148 transitions. [2023-11-06 21:56:01,525 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 115 [2023-11-06 21:56:01,525 INFO L187 NwaCegarLoop]: Found error trace [2023-11-06 21:56:01,525 INFO L195 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-11-06 21:56:01,525 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable16 [2023-11-06 21:56:01,526 INFO L420 AbstractCegarLoop]: === Iteration 18 === Targeting ULTIMATE.startErr93REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 101 more)] === [2023-11-06 21:56:01,526 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-11-06 21:56:01,526 INFO L85 PathProgramCache]: Analyzing trace with hash 1126073505, now seen corresponding path program 1 times [2023-11-06 21:56:01,526 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-06 21:56:01,526 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1880659753] [2023-11-06 21:56:01,526 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-06 21:56:01,527 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-06 21:56:01,599 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 21:56:02,176 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-11-06 21:56:02,176 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-06 21:56:02,176 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1880659753] [2023-11-06 21:56:02,177 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1880659753] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-06 21:56:02,177 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-06 21:56:02,177 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2023-11-06 21:56:02,177 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [757478033] [2023-11-06 21:56:02,177 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-06 21:56:02,178 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2023-11-06 21:56:02,178 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-06 21:56:02,179 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2023-11-06 21:56:02,179 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2023-11-06 21:56:02,179 INFO L87 Difference]: Start difference. First operand 148 states and 148 transitions. Second operand has 6 states, 5 states have (on average 22.8) internal successors, (114), 6 states have internal predecessors, (114), 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) [2023-11-06 21:56:02,505 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-11-06 21:56:02,506 INFO L93 Difference]: Finished difference Result 147 states and 147 transitions. [2023-11-06 21:56:02,506 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2023-11-06 21:56:02,506 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 5 states have (on average 22.8) internal successors, (114), 6 states have internal predecessors, (114), 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 114 [2023-11-06 21:56:02,507 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-11-06 21:56:02,507 INFO L225 Difference]: With dead ends: 147 [2023-11-06 21:56:02,508 INFO L226 Difference]: Without dead ends: 147 [2023-11-06 21:56:02,508 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=34, Invalid=56, Unknown=0, NotChecked=0, Total=90 [2023-11-06 21:56:02,508 INFO L413 NwaCegarLoop]: 122 mSDtfsCounter, 156 mSDsluCounter, 152 mSDsCounter, 0 mSdLazyCounter, 182 mSolverCounterSat, 9 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 156 SdHoareTripleChecker+Valid, 274 SdHoareTripleChecker+Invalid, 191 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 9 IncrementalHoareTripleChecker+Valid, 182 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2023-11-06 21:56:02,509 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [156 Valid, 274 Invalid, 191 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [9 Valid, 182 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2023-11-06 21:56:02,509 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 147 states. [2023-11-06 21:56:02,512 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 147 to 147. [2023-11-06 21:56:02,512 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 147 states, 138 states have (on average 1.065217391304348) internal successors, (147), 146 states have internal predecessors, (147), 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) [2023-11-06 21:56:02,513 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 147 states to 147 states and 147 transitions. [2023-11-06 21:56:02,513 INFO L78 Accepts]: Start accepts. Automaton has 147 states and 147 transitions. Word has length 114 [2023-11-06 21:56:02,513 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-11-06 21:56:02,513 INFO L495 AbstractCegarLoop]: Abstraction has 147 states and 147 transitions. [2023-11-06 21:56:02,514 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 5 states have (on average 22.8) internal successors, (114), 6 states have internal predecessors, (114), 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) [2023-11-06 21:56:02,514 INFO L276 IsEmpty]: Start isEmpty. Operand 147 states and 147 transitions. [2023-11-06 21:56:02,515 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 120 [2023-11-06 21:56:02,515 INFO L187 NwaCegarLoop]: Found error trace [2023-11-06 21:56:02,515 INFO L195 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-11-06 21:56:02,516 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable17 [2023-11-06 21:56:02,517 INFO L420 AbstractCegarLoop]: === Iteration 19 === Targeting ULTIMATE.startErr94REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 101 more)] === [2023-11-06 21:56:02,517 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-11-06 21:56:02,517 INFO L85 PathProgramCache]: Analyzing trace with hash 1580157079, now seen corresponding path program 1 times [2023-11-06 21:56:02,517 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-06 21:56:02,518 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [546562307] [2023-11-06 21:56:02,518 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-06 21:56:02,518 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-06 21:56:02,584 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 21:56:02,811 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-11-06 21:56:02,811 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-06 21:56:02,812 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [546562307] [2023-11-06 21:56:02,812 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [546562307] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-06 21:56:02,812 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-06 21:56:02,812 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2023-11-06 21:56:02,812 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [187845957] [2023-11-06 21:56:02,812 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-06 21:56:02,814 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2023-11-06 21:56:02,814 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-06 21:56:02,815 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2023-11-06 21:56:02,815 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2023-11-06 21:56:02,815 INFO L87 Difference]: Start difference. First operand 147 states and 147 transitions. Second operand has 5 states, 4 states have (on average 29.75) internal successors, (119), 5 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) [2023-11-06 21:56:02,971 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-11-06 21:56:02,971 INFO L93 Difference]: Finished difference Result 146 states and 146 transitions. [2023-11-06 21:56:02,971 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2023-11-06 21:56:02,972 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 4 states have (on average 29.75) internal successors, (119), 5 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) Word has length 119 [2023-11-06 21:56:02,972 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-11-06 21:56:02,973 INFO L225 Difference]: With dead ends: 146 [2023-11-06 21:56:02,973 INFO L226 Difference]: Without dead ends: 146 [2023-11-06 21:56:02,973 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=17, Invalid=25, Unknown=0, NotChecked=0, Total=42 [2023-11-06 21:56:02,974 INFO L413 NwaCegarLoop]: 122 mSDtfsCounter, 118 mSDsluCounter, 186 mSDsCounter, 0 mSdLazyCounter, 126 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 118 SdHoareTripleChecker+Valid, 308 SdHoareTripleChecker+Invalid, 127 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 126 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2023-11-06 21:56:02,974 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [118 Valid, 308 Invalid, 127 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 126 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2023-11-06 21:56:02,975 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 146 states. [2023-11-06 21:56:02,977 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 146 to 146. [2023-11-06 21:56:02,977 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 146 states, 138 states have (on average 1.0579710144927537) internal successors, (146), 145 states have internal predecessors, (146), 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) [2023-11-06 21:56:02,978 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 146 states to 146 states and 146 transitions. [2023-11-06 21:56:02,978 INFO L78 Accepts]: Start accepts. Automaton has 146 states and 146 transitions. Word has length 119 [2023-11-06 21:56:02,978 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-11-06 21:56:02,978 INFO L495 AbstractCegarLoop]: Abstraction has 146 states and 146 transitions. [2023-11-06 21:56:02,978 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 4 states have (on average 29.75) internal successors, (119), 5 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) [2023-11-06 21:56:02,979 INFO L276 IsEmpty]: Start isEmpty. Operand 146 states and 146 transitions. [2023-11-06 21:56:02,979 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 120 [2023-11-06 21:56:02,979 INFO L187 NwaCegarLoop]: Found error trace [2023-11-06 21:56:02,980 INFO L195 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-11-06 21:56:02,981 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable18 [2023-11-06 21:56:02,981 INFO L420 AbstractCegarLoop]: === Iteration 20 === Targeting ULTIMATE.startErr95REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 101 more)] === [2023-11-06 21:56:02,982 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-11-06 21:56:02,982 INFO L85 PathProgramCache]: Analyzing trace with hash 1580157080, now seen corresponding path program 1 times [2023-11-06 21:56:02,982 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-06 21:56:02,982 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [213170599] [2023-11-06 21:56:02,982 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-06 21:56:02,983 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-06 21:56:03,072 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 21:56:03,643 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-11-06 21:56:03,643 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-06 21:56:03,643 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [213170599] [2023-11-06 21:56:03,643 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [213170599] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-06 21:56:03,643 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-06 21:56:03,644 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2023-11-06 21:56:03,646 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1102066855] [2023-11-06 21:56:03,646 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-06 21:56:03,646 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2023-11-06 21:56:03,647 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-06 21:56:03,647 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2023-11-06 21:56:03,647 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2023-11-06 21:56:03,648 INFO L87 Difference]: Start difference. First operand 146 states and 146 transitions. Second operand has 6 states, 5 states have (on average 23.8) internal successors, (119), 6 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) [2023-11-06 21:56:03,970 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-11-06 21:56:03,970 INFO L93 Difference]: Finished difference Result 145 states and 145 transitions. [2023-11-06 21:56:03,970 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2023-11-06 21:56:03,971 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 5 states have (on average 23.8) internal successors, (119), 6 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) Word has length 119 [2023-11-06 21:56:03,971 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-11-06 21:56:03,972 INFO L225 Difference]: With dead ends: 145 [2023-11-06 21:56:03,972 INFO L226 Difference]: Without dead ends: 145 [2023-11-06 21:56:03,972 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=34, Invalid=56, Unknown=0, NotChecked=0, Total=90 [2023-11-06 21:56:03,973 INFO L413 NwaCegarLoop]: 121 mSDtfsCounter, 138 mSDsluCounter, 155 mSDsCounter, 0 mSdLazyCounter, 183 mSolverCounterSat, 9 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 138 SdHoareTripleChecker+Valid, 276 SdHoareTripleChecker+Invalid, 192 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 9 IncrementalHoareTripleChecker+Valid, 183 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2023-11-06 21:56:03,973 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [138 Valid, 276 Invalid, 192 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [9 Valid, 183 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2023-11-06 21:56:03,974 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 145 states. [2023-11-06 21:56:03,976 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 145 to 145. [2023-11-06 21:56:03,976 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 145 states, 138 states have (on average 1.0507246376811594) internal successors, (145), 144 states have internal predecessors, (145), 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) [2023-11-06 21:56:03,977 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 145 states to 145 states and 145 transitions. [2023-11-06 21:56:03,977 INFO L78 Accepts]: Start accepts. Automaton has 145 states and 145 transitions. Word has length 119 [2023-11-06 21:56:03,977 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-11-06 21:56:03,977 INFO L495 AbstractCegarLoop]: Abstraction has 145 states and 145 transitions. [2023-11-06 21:56:03,977 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 5 states have (on average 23.8) internal successors, (119), 6 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) [2023-11-06 21:56:03,977 INFO L276 IsEmpty]: Start isEmpty. Operand 145 states and 145 transitions. [2023-11-06 21:56:03,978 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 125 [2023-11-06 21:56:03,979 INFO L187 NwaCegarLoop]: Found error trace [2023-11-06 21:56:03,979 INFO L195 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-11-06 21:56:03,979 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable19 [2023-11-06 21:56:03,979 INFO L420 AbstractCegarLoop]: === Iteration 21 === Targeting ULTIMATE.startErr97REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 101 more)] === [2023-11-06 21:56:03,979 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-11-06 21:56:03,980 INFO L85 PathProgramCache]: Analyzing trace with hash 345305810, now seen corresponding path program 1 times [2023-11-06 21:56:03,981 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-06 21:56:03,981 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [919205113] [2023-11-06 21:56:03,981 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-06 21:56:03,982 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-06 21:56:04,068 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 21:56:04,759 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-11-06 21:56:04,759 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-06 21:56:04,760 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [919205113] [2023-11-06 21:56:04,760 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [919205113] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-06 21:56:04,760 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-06 21:56:04,760 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2023-11-06 21:56:04,761 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1209161521] [2023-11-06 21:56:04,761 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-06 21:56:04,762 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2023-11-06 21:56:04,763 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-06 21:56:04,764 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2023-11-06 21:56:04,764 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2023-11-06 21:56:04,764 INFO L87 Difference]: Start difference. First operand 145 states and 145 transitions. Second operand has 6 states, 5 states have (on average 24.8) internal successors, (124), 6 states have internal predecessors, (124), 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) [2023-11-06 21:56:05,098 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-11-06 21:56:05,098 INFO L93 Difference]: Finished difference Result 144 states and 144 transitions. [2023-11-06 21:56:05,099 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2023-11-06 21:56:05,099 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 5 states have (on average 24.8) internal successors, (124), 6 states have internal predecessors, (124), 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 124 [2023-11-06 21:56:05,099 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-11-06 21:56:05,100 INFO L225 Difference]: With dead ends: 144 [2023-11-06 21:56:05,100 INFO L226 Difference]: Without dead ends: 144 [2023-11-06 21:56:05,100 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=34, Invalid=56, Unknown=0, NotChecked=0, Total=90 [2023-11-06 21:56:05,101 INFO L413 NwaCegarLoop]: 120 mSDtfsCounter, 124 mSDsluCounter, 158 mSDsCounter, 0 mSdLazyCounter, 185 mSolverCounterSat, 9 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 124 SdHoareTripleChecker+Valid, 278 SdHoareTripleChecker+Invalid, 194 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 9 IncrementalHoareTripleChecker+Valid, 185 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2023-11-06 21:56:05,101 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [124 Valid, 278 Invalid, 194 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [9 Valid, 185 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2023-11-06 21:56:05,102 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 144 states. [2023-11-06 21:56:05,104 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 144 to 144. [2023-11-06 21:56:05,105 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 144 states, 138 states have (on average 1.0434782608695652) internal successors, (144), 143 states have internal predecessors, (144), 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) [2023-11-06 21:56:05,105 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 144 states to 144 states and 144 transitions. [2023-11-06 21:56:05,105 INFO L78 Accepts]: Start accepts. Automaton has 144 states and 144 transitions. Word has length 124 [2023-11-06 21:56:05,106 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-11-06 21:56:05,106 INFO L495 AbstractCegarLoop]: Abstraction has 144 states and 144 transitions. [2023-11-06 21:56:05,106 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 5 states have (on average 24.8) internal successors, (124), 6 states have internal predecessors, (124), 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) [2023-11-06 21:56:05,106 INFO L276 IsEmpty]: Start isEmpty. Operand 144 states and 144 transitions. [2023-11-06 21:56:05,107 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 125 [2023-11-06 21:56:05,107 INFO L187 NwaCegarLoop]: Found error trace [2023-11-06 21:56:05,107 INFO L195 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-11-06 21:56:05,108 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable20 [2023-11-06 21:56:05,110 INFO L420 AbstractCegarLoop]: === Iteration 22 === Targeting ULTIMATE.startErr96REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 101 more)] === [2023-11-06 21:56:05,110 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-11-06 21:56:05,111 INFO L85 PathProgramCache]: Analyzing trace with hash 345305809, now seen corresponding path program 1 times [2023-11-06 21:56:05,111 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-06 21:56:05,111 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1266779492] [2023-11-06 21:56:05,111 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-06 21:56:05,111 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-06 21:56:05,177 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 21:56:05,388 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-11-06 21:56:05,388 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-06 21:56:05,389 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1266779492] [2023-11-06 21:56:05,389 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1266779492] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-06 21:56:05,389 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-06 21:56:05,389 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2023-11-06 21:56:05,390 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1405138170] [2023-11-06 21:56:05,390 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-06 21:56:05,390 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2023-11-06 21:56:05,390 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-06 21:56:05,391 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2023-11-06 21:56:05,391 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2023-11-06 21:56:05,391 INFO L87 Difference]: Start difference. First operand 144 states and 144 transitions. Second operand has 5 states, 4 states have (on average 31.0) internal successors, (124), 5 states have internal predecessors, (124), 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) [2023-11-06 21:56:05,547 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-11-06 21:56:05,548 INFO L93 Difference]: Finished difference Result 143 states and 143 transitions. [2023-11-06 21:56:05,550 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2023-11-06 21:56:05,550 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 4 states have (on average 31.0) internal successors, (124), 5 states have internal predecessors, (124), 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 124 [2023-11-06 21:56:05,551 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-11-06 21:56:05,551 INFO L225 Difference]: With dead ends: 143 [2023-11-06 21:56:05,551 INFO L226 Difference]: Without dead ends: 143 [2023-11-06 21:56:05,552 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=17, Invalid=25, Unknown=0, NotChecked=0, Total=42 [2023-11-06 21:56:05,552 INFO L413 NwaCegarLoop]: 121 mSDtfsCounter, 99 mSDsluCounter, 189 mSDsCounter, 0 mSdLazyCounter, 126 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 99 SdHoareTripleChecker+Valid, 310 SdHoareTripleChecker+Invalid, 127 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 126 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2023-11-06 21:56:05,553 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [99 Valid, 310 Invalid, 127 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 126 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2023-11-06 21:56:05,553 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 143 states. [2023-11-06 21:56:05,555 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 143 to 143. [2023-11-06 21:56:05,555 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 143 states, 138 states have (on average 1.036231884057971) internal successors, (143), 142 states have internal predecessors, (143), 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) [2023-11-06 21:56:05,557 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 143 states to 143 states and 143 transitions. [2023-11-06 21:56:05,557 INFO L78 Accepts]: Start accepts. Automaton has 143 states and 143 transitions. Word has length 124 [2023-11-06 21:56:05,558 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-11-06 21:56:05,558 INFO L495 AbstractCegarLoop]: Abstraction has 143 states and 143 transitions. [2023-11-06 21:56:05,558 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 4 states have (on average 31.0) internal successors, (124), 5 states have internal predecessors, (124), 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) [2023-11-06 21:56:05,558 INFO L276 IsEmpty]: Start isEmpty. Operand 143 states and 143 transitions. [2023-11-06 21:56:05,559 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 130 [2023-11-06 21:56:05,560 INFO L187 NwaCegarLoop]: Found error trace [2023-11-06 21:56:05,560 INFO L195 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-11-06 21:56:05,560 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable21 [2023-11-06 21:56:05,561 INFO L420 AbstractCegarLoop]: === Iteration 23 === Targeting ULTIMATE.startErr98REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 101 more)] === [2023-11-06 21:56:05,561 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-11-06 21:56:05,561 INFO L85 PathProgramCache]: Analyzing trace with hash 286927016, now seen corresponding path program 1 times [2023-11-06 21:56:05,561 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-06 21:56:05,562 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1608611349] [2023-11-06 21:56:05,562 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-06 21:56:05,562 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-06 21:56:05,642 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 21:56:05,889 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-11-06 21:56:05,889 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-06 21:56:05,889 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1608611349] [2023-11-06 21:56:05,889 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1608611349] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-06 21:56:05,890 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-06 21:56:05,890 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2023-11-06 21:56:05,891 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1262750041] [2023-11-06 21:56:05,891 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-06 21:56:05,892 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2023-11-06 21:56:05,892 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-06 21:56:05,892 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2023-11-06 21:56:05,893 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2023-11-06 21:56:05,893 INFO L87 Difference]: Start difference. First operand 143 states and 143 transitions. Second operand has 5 states, 4 states have (on average 32.25) internal successors, (129), 5 states have internal predecessors, (129), 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) [2023-11-06 21:56:06,052 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-11-06 21:56:06,052 INFO L93 Difference]: Finished difference Result 143 states and 143 transitions. [2023-11-06 21:56:06,053 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2023-11-06 21:56:06,053 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 4 states have (on average 32.25) internal successors, (129), 5 states have internal predecessors, (129), 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 129 [2023-11-06 21:56:06,053 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-11-06 21:56:06,054 INFO L225 Difference]: With dead ends: 143 [2023-11-06 21:56:06,054 INFO L226 Difference]: Without dead ends: 143 [2023-11-06 21:56:06,055 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=17, Invalid=25, Unknown=0, NotChecked=0, Total=42 [2023-11-06 21:56:06,055 INFO L413 NwaCegarLoop]: 119 mSDtfsCounter, 77 mSDsluCounter, 199 mSDsCounter, 0 mSdLazyCounter, 133 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 77 SdHoareTripleChecker+Valid, 318 SdHoareTripleChecker+Invalid, 134 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 133 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2023-11-06 21:56:06,055 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [77 Valid, 318 Invalid, 134 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 133 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2023-11-06 21:56:06,056 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 143 states. [2023-11-06 21:56:06,058 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 143 to 142. [2023-11-06 21:56:06,059 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 142 states, 138 states have (on average 1.0289855072463767) internal successors, (142), 141 states have internal predecessors, (142), 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) [2023-11-06 21:56:06,059 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 142 states to 142 states and 142 transitions. [2023-11-06 21:56:06,059 INFO L78 Accepts]: Start accepts. Automaton has 142 states and 142 transitions. Word has length 129 [2023-11-06 21:56:06,060 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-11-06 21:56:06,060 INFO L495 AbstractCegarLoop]: Abstraction has 142 states and 142 transitions. [2023-11-06 21:56:06,060 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 4 states have (on average 32.25) internal successors, (129), 5 states have internal predecessors, (129), 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) [2023-11-06 21:56:06,061 INFO L276 IsEmpty]: Start isEmpty. Operand 142 states and 142 transitions. [2023-11-06 21:56:06,062 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 130 [2023-11-06 21:56:06,062 INFO L187 NwaCegarLoop]: Found error trace [2023-11-06 21:56:06,062 INFO L195 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-11-06 21:56:06,062 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable22 [2023-11-06 21:56:06,063 INFO L420 AbstractCegarLoop]: === Iteration 24 === Targeting ULTIMATE.startErr99REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 101 more)] === [2023-11-06 21:56:06,063 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-11-06 21:56:06,063 INFO L85 PathProgramCache]: Analyzing trace with hash 286927017, now seen corresponding path program 1 times [2023-11-06 21:56:06,063 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-06 21:56:06,064 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1494953847] [2023-11-06 21:56:06,064 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-06 21:56:06,064 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-06 21:56:06,147 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 21:56:06,786 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-11-06 21:56:06,786 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-06 21:56:06,786 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1494953847] [2023-11-06 21:56:06,787 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1494953847] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-06 21:56:06,787 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-06 21:56:06,787 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2023-11-06 21:56:06,787 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [42960072] [2023-11-06 21:56:06,788 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-06 21:56:06,788 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2023-11-06 21:56:06,788 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-06 21:56:06,789 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2023-11-06 21:56:06,791 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=14, Invalid=28, Unknown=0, NotChecked=0, Total=42 [2023-11-06 21:56:06,792 INFO L87 Difference]: Start difference. First operand 142 states and 142 transitions. Second operand has 7 states, 6 states have (on average 21.5) internal successors, (129), 7 states have internal predecessors, (129), 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) [2023-11-06 21:56:07,127 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-11-06 21:56:07,128 INFO L93 Difference]: Finished difference Result 142 states and 142 transitions. [2023-11-06 21:56:07,128 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2023-11-06 21:56:07,128 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 6 states have (on average 21.5) internal successors, (129), 7 states have internal predecessors, (129), 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 129 [2023-11-06 21:56:07,129 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-11-06 21:56:07,130 INFO L225 Difference]: With dead ends: 142 [2023-11-06 21:56:07,130 INFO L226 Difference]: Without dead ends: 142 [2023-11-06 21:56:07,130 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=35, Invalid=55, Unknown=0, NotChecked=0, Total=90 [2023-11-06 21:56:07,131 INFO L413 NwaCegarLoop]: 118 mSDtfsCounter, 93 mSDsluCounter, 168 mSDsCounter, 0 mSdLazyCounter, 190 mSolverCounterSat, 9 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 93 SdHoareTripleChecker+Valid, 286 SdHoareTripleChecker+Invalid, 199 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 9 IncrementalHoareTripleChecker+Valid, 190 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2023-11-06 21:56:07,131 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [93 Valid, 286 Invalid, 199 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [9 Valid, 190 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2023-11-06 21:56:07,132 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 142 states. [2023-11-06 21:56:07,134 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 142 to 141. [2023-11-06 21:56:07,134 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 141 states, 138 states have (on average 1.0217391304347827) internal successors, (141), 140 states have internal predecessors, (141), 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) [2023-11-06 21:56:07,135 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 141 states to 141 states and 141 transitions. [2023-11-06 21:56:07,135 INFO L78 Accepts]: Start accepts. Automaton has 141 states and 141 transitions. Word has length 129 [2023-11-06 21:56:07,135 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-11-06 21:56:07,135 INFO L495 AbstractCegarLoop]: Abstraction has 141 states and 141 transitions. [2023-11-06 21:56:07,135 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 6 states have (on average 21.5) internal successors, (129), 7 states have internal predecessors, (129), 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) [2023-11-06 21:56:07,136 INFO L276 IsEmpty]: Start isEmpty. Operand 141 states and 141 transitions. [2023-11-06 21:56:07,138 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 136 [2023-11-06 21:56:07,138 INFO L187 NwaCegarLoop]: Found error trace [2023-11-06 21:56:07,138 INFO L195 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-11-06 21:56:07,139 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable23 [2023-11-06 21:56:07,139 INFO L420 AbstractCegarLoop]: === Iteration 25 === Targeting ULTIMATE.startErr102ASSERT_VIOLATIONMEMORY_LEAK === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 101 more)] === [2023-11-06 21:56:07,139 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-11-06 21:56:07,140 INFO L85 PathProgramCache]: Analyzing trace with hash 209434460, now seen corresponding path program 1 times [2023-11-06 21:56:07,140 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-06 21:56:07,140 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [90621991] [2023-11-06 21:56:07,140 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-06 21:56:07,141 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-06 21:56:07,220 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 21:56:07,962 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-11-06 21:56:07,962 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-06 21:56:07,963 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [90621991] [2023-11-06 21:56:07,963 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [90621991] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-06 21:56:07,963 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-06 21:56:07,963 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [15] imperfect sequences [] total 15 [2023-11-06 21:56:07,963 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [378553045] [2023-11-06 21:56:07,964 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-06 21:56:07,964 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 15 states [2023-11-06 21:56:07,965 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-06 21:56:07,965 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 15 interpolants. [2023-11-06 21:56:07,965 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=31, Invalid=179, Unknown=0, NotChecked=0, Total=210 [2023-11-06 21:56:07,966 INFO L87 Difference]: Start difference. First operand 141 states and 141 transitions. Second operand has 15 states, 15 states have (on average 9.0) internal successors, (135), 15 states have internal predecessors, (135), 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) [2023-11-06 21:56:08,337 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-11-06 21:56:08,337 INFO L93 Difference]: Finished difference Result 150 states and 150 transitions. [2023-11-06 21:56:08,338 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2023-11-06 21:56:08,338 INFO L78 Accepts]: Start accepts. Automaton has has 15 states, 15 states have (on average 9.0) internal successors, (135), 15 states have internal predecessors, (135), 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 135 [2023-11-06 21:56:08,338 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-11-06 21:56:08,339 INFO L225 Difference]: With dead ends: 150 [2023-11-06 21:56:08,339 INFO L226 Difference]: Without dead ends: 150 [2023-11-06 21:56:08,340 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 23 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 21 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 35 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=63, Invalid=443, Unknown=0, NotChecked=0, Total=506 [2023-11-06 21:56:08,340 INFO L413 NwaCegarLoop]: 110 mSDtfsCounter, 133 mSDsluCounter, 1071 mSDsCounter, 0 mSdLazyCounter, 335 mSolverCounterSat, 8 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 133 SdHoareTripleChecker+Valid, 1181 SdHoareTripleChecker+Invalid, 343 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 8 IncrementalHoareTripleChecker+Valid, 335 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2023-11-06 21:56:08,341 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [133 Valid, 1181 Invalid, 343 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [8 Valid, 335 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2023-11-06 21:56:08,341 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 150 states. [2023-11-06 21:56:08,344 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 150 to 144. [2023-11-06 21:56:08,350 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 144 states, 141 states have (on average 1.0212765957446808) internal successors, (144), 143 states have internal predecessors, (144), 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) [2023-11-06 21:56:08,351 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 144 states to 144 states and 144 transitions. [2023-11-06 21:56:08,351 INFO L78 Accepts]: Start accepts. Automaton has 144 states and 144 transitions. Word has length 135 [2023-11-06 21:56:08,351 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-11-06 21:56:08,351 INFO L495 AbstractCegarLoop]: Abstraction has 144 states and 144 transitions. [2023-11-06 21:56:08,352 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 15 states, 15 states have (on average 9.0) internal successors, (135), 15 states have internal predecessors, (135), 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) [2023-11-06 21:56:08,352 INFO L276 IsEmpty]: Start isEmpty. Operand 144 states and 144 transitions. [2023-11-06 21:56:08,353 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 136 [2023-11-06 21:56:08,353 INFO L187 NwaCegarLoop]: Found error trace [2023-11-06 21:56:08,354 INFO L195 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-11-06 21:56:08,354 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable24 [2023-11-06 21:56:08,354 INFO L420 AbstractCegarLoop]: === Iteration 26 === Targeting ULTIMATE.startErr100REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 101 more)] === [2023-11-06 21:56:08,355 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-11-06 21:56:08,355 INFO L85 PathProgramCache]: Analyzing trace with hash 209419630, now seen corresponding path program 1 times [2023-11-06 21:56:08,355 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-06 21:56:08,355 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1202183372] [2023-11-06 21:56:08,355 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-06 21:56:08,355 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-06 21:56:08,421 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 21:56:08,624 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-11-06 21:56:08,625 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-06 21:56:08,625 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1202183372] [2023-11-06 21:56:08,625 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1202183372] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-06 21:56:08,625 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-06 21:56:08,625 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2023-11-06 21:56:08,626 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [680680407] [2023-11-06 21:56:08,626 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-06 21:56:08,626 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2023-11-06 21:56:08,627 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-06 21:56:08,627 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2023-11-06 21:56:08,627 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2023-11-06 21:56:08,628 INFO L87 Difference]: Start difference. First operand 144 states and 144 transitions. Second operand has 5 states, 4 states have (on average 33.75) internal successors, (135), 5 states have internal predecessors, (135), 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) [2023-11-06 21:56:08,778 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-11-06 21:56:08,778 INFO L93 Difference]: Finished difference Result 143 states and 143 transitions. [2023-11-06 21:56:08,778 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2023-11-06 21:56:08,778 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 4 states have (on average 33.75) internal successors, (135), 5 states have internal predecessors, (135), 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 135 [2023-11-06 21:56:08,779 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-11-06 21:56:08,780 INFO L225 Difference]: With dead ends: 143 [2023-11-06 21:56:08,780 INFO L226 Difference]: Without dead ends: 143 [2023-11-06 21:56:08,780 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=17, Invalid=25, Unknown=0, NotChecked=0, Total=42 [2023-11-06 21:56:08,781 INFO L413 NwaCegarLoop]: 119 mSDtfsCounter, 65 mSDsluCounter, 199 mSDsCounter, 0 mSdLazyCounter, 131 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 65 SdHoareTripleChecker+Valid, 318 SdHoareTripleChecker+Invalid, 132 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 131 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2023-11-06 21:56:08,781 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [65 Valid, 318 Invalid, 132 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 131 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2023-11-06 21:56:08,782 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 143 states. [2023-11-06 21:56:08,783 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 143 to 143. [2023-11-06 21:56:08,784 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 143 states, 141 states have (on average 1.0141843971631206) internal successors, (143), 142 states have internal predecessors, (143), 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) [2023-11-06 21:56:08,784 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 143 states to 143 states and 143 transitions. [2023-11-06 21:56:08,784 INFO L78 Accepts]: Start accepts. Automaton has 143 states and 143 transitions. Word has length 135 [2023-11-06 21:56:08,785 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-11-06 21:56:08,785 INFO L495 AbstractCegarLoop]: Abstraction has 143 states and 143 transitions. [2023-11-06 21:56:08,785 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 4 states have (on average 33.75) internal successors, (135), 5 states have internal predecessors, (135), 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) [2023-11-06 21:56:08,785 INFO L276 IsEmpty]: Start isEmpty. Operand 143 states and 143 transitions. [2023-11-06 21:56:08,786 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 136 [2023-11-06 21:56:08,786 INFO L187 NwaCegarLoop]: Found error trace [2023-11-06 21:56:08,786 INFO L195 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-11-06 21:56:08,787 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable25 [2023-11-06 21:56:08,787 INFO L420 AbstractCegarLoop]: === Iteration 27 === Targeting ULTIMATE.startErr101REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 101 more)] === [2023-11-06 21:56:08,787 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-11-06 21:56:08,787 INFO L85 PathProgramCache]: Analyzing trace with hash 209419631, now seen corresponding path program 1 times [2023-11-06 21:56:08,787 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-06 21:56:08,788 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1527012321] [2023-11-06 21:56:08,790 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-06 21:56:08,790 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-06 21:56:08,868 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 21:56:09,576 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-11-06 21:56:09,576 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-06 21:56:09,576 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1527012321] [2023-11-06 21:56:09,577 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1527012321] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-06 21:56:09,577 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-06 21:56:09,577 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2023-11-06 21:56:09,577 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [545405190] [2023-11-06 21:56:09,578 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-06 21:56:09,578 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2023-11-06 21:56:09,578 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-06 21:56:09,579 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2023-11-06 21:56:09,579 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=14, Invalid=28, Unknown=0, NotChecked=0, Total=42 [2023-11-06 21:56:09,580 INFO L87 Difference]: Start difference. First operand 143 states and 143 transitions. Second operand has 7 states, 6 states have (on average 22.5) internal successors, (135), 7 states have internal predecessors, (135), 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) [2023-11-06 21:56:09,930 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-11-06 21:56:09,930 INFO L93 Difference]: Finished difference Result 142 states and 142 transitions. [2023-11-06 21:56:09,931 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2023-11-06 21:56:09,931 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 6 states have (on average 22.5) internal successors, (135), 7 states have internal predecessors, (135), 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 135 [2023-11-06 21:56:09,931 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-11-06 21:56:09,932 INFO L225 Difference]: With dead ends: 142 [2023-11-06 21:56:09,932 INFO L226 Difference]: Without dead ends: 142 [2023-11-06 21:56:09,932 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=35, Invalid=55, Unknown=0, NotChecked=0, Total=90 [2023-11-06 21:56:09,933 INFO L413 NwaCegarLoop]: 118 mSDtfsCounter, 72 mSDsluCounter, 250 mSDsCounter, 0 mSdLazyCounter, 275 mSolverCounterSat, 9 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 72 SdHoareTripleChecker+Valid, 368 SdHoareTripleChecker+Invalid, 284 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 9 IncrementalHoareTripleChecker+Valid, 275 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2023-11-06 21:56:09,933 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [72 Valid, 368 Invalid, 284 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [9 Valid, 275 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2023-11-06 21:56:09,934 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 142 states. [2023-11-06 21:56:09,936 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 142 to 142. [2023-11-06 21:56:09,936 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 142 states, 141 states have (on average 1.0070921985815602) internal successors, (142), 141 states have internal predecessors, (142), 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) [2023-11-06 21:56:09,937 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 142 states to 142 states and 142 transitions. [2023-11-06 21:56:09,937 INFO L78 Accepts]: Start accepts. Automaton has 142 states and 142 transitions. Word has length 135 [2023-11-06 21:56:09,937 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-11-06 21:56:09,937 INFO L495 AbstractCegarLoop]: Abstraction has 142 states and 142 transitions. [2023-11-06 21:56:09,937 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 6 states have (on average 22.5) internal successors, (135), 7 states have internal predecessors, (135), 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) [2023-11-06 21:56:09,937 INFO L276 IsEmpty]: Start isEmpty. Operand 142 states and 142 transitions. [2023-11-06 21:56:09,939 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 142 [2023-11-06 21:56:09,939 INFO L187 NwaCegarLoop]: Found error trace [2023-11-06 21:56:09,939 INFO L195 NwaCegarLoop]: trace histogram [2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-11-06 21:56:09,939 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable26 [2023-11-06 21:56:09,939 INFO L420 AbstractCegarLoop]: === Iteration 28 === Targeting ULTIMATE.startErr102ASSERT_VIOLATIONMEMORY_LEAK === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 101 more)] === [2023-11-06 21:56:09,945 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-11-06 21:56:09,945 INFO L85 PathProgramCache]: Analyzing trace with hash -787745937, now seen corresponding path program 1 times [2023-11-06 21:56:09,945 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-06 21:56:09,945 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [100910965] [2023-11-06 21:56:09,946 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-06 21:56:09,946 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-06 21:56:10,036 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 21:56:10,965 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-11-06 21:56:10,965 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-06 21:56:10,965 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [100910965] [2023-11-06 21:56:10,966 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [100910965] provided 0 perfect and 1 imperfect interpolant sequences [2023-11-06 21:56:10,966 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [401712056] [2023-11-06 21:56:10,966 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-06 21:56:10,966 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-11-06 21:56:10,967 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_caa5f2f3-6cb0-43bd-95b0-ab16c9f4f5a2/bin/uautomizer-verify-WvqO1wxjHP/z3 [2023-11-06 21:56:10,970 INFO L229 MonitoredProcess]: Starting monitored process 2 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_caa5f2f3-6cb0-43bd-95b0-ab16c9f4f5a2/bin/uautomizer-verify-WvqO1wxjHP/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2023-11-06 21:56:10,985 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_caa5f2f3-6cb0-43bd-95b0-ab16c9f4f5a2/bin/uautomizer-verify-WvqO1wxjHP/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Waiting until timeout for monitored process [2023-11-06 21:56:11,467 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 21:56:11,475 INFO L262 TraceCheckSpWp]: Trace formula consists of 1270 conjuncts, 25 conjunts are in the unsatisfiable core [2023-11-06 21:56:11,487 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-11-06 21:56:11,621 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-11-06 21:56:11,621 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2023-11-06 21:56:12,142 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-11-06 21:56:12,143 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [401712056] provided 0 perfect and 2 imperfect interpolant sequences [2023-11-06 21:56:12,144 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2023-11-06 21:56:12,144 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [16, 14, 14] total 29 [2023-11-06 21:56:12,144 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1417871044] [2023-11-06 21:56:12,144 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2023-11-06 21:56:12,145 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 29 states [2023-11-06 21:56:12,145 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-06 21:56:12,146 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 29 interpolants. [2023-11-06 21:56:12,147 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=207, Invalid=605, Unknown=0, NotChecked=0, Total=812 [2023-11-06 21:56:12,147 INFO L87 Difference]: Start difference. First operand 142 states and 142 transitions. Second operand has 29 states, 29 states have (on average 7.137931034482759) internal successors, (207), 29 states have internal predecessors, (207), 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) [2023-11-06 21:56:22,370 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-11-06 21:56:22,370 INFO L93 Difference]: Finished difference Result 217 states and 217 transitions. [2023-11-06 21:56:22,370 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 28 states. [2023-11-06 21:56:22,371 INFO L78 Accepts]: Start accepts. Automaton has has 29 states, 29 states have (on average 7.137931034482759) internal successors, (207), 29 states have internal predecessors, (207), 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 141 [2023-11-06 21:56:22,371 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-11-06 21:56:22,372 INFO L225 Difference]: With dead ends: 217 [2023-11-06 21:56:22,373 INFO L226 Difference]: Without dead ends: 217 [2023-11-06 21:56:22,374 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 318 GetRequests, 269 SyntacticMatches, 0 SemanticMatches, 49 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 288 ImplicationChecksByTransitivity, 10.1s TimeCoverageRelationStatistics Valid=683, Invalid=1867, Unknown=0, NotChecked=0, Total=2550 [2023-11-06 21:56:22,375 INFO L413 NwaCegarLoop]: 110 mSDtfsCounter, 586 mSDsluCounter, 1299 mSDsCounter, 0 mSdLazyCounter, 503 mSolverCounterSat, 73 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 586 SdHoareTripleChecker+Valid, 1409 SdHoareTripleChecker+Invalid, 576 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 73 IncrementalHoareTripleChecker+Valid, 503 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.6s IncrementalHoareTripleChecker+Time [2023-11-06 21:56:22,375 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [586 Valid, 1409 Invalid, 576 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [73 Valid, 503 Invalid, 0 Unknown, 0 Unchecked, 0.6s Time] [2023-11-06 21:56:22,376 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 217 states. [2023-11-06 21:56:22,379 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 217 to 214. [2023-11-06 21:56:22,379 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 214 states, 213 states have (on average 1.0046948356807512) internal successors, (214), 213 states have internal predecessors, (214), 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) [2023-11-06 21:56:22,380 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 214 states to 214 states and 214 transitions. [2023-11-06 21:56:22,380 INFO L78 Accepts]: Start accepts. Automaton has 214 states and 214 transitions. Word has length 141 [2023-11-06 21:56:22,381 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-11-06 21:56:22,381 INFO L495 AbstractCegarLoop]: Abstraction has 214 states and 214 transitions. [2023-11-06 21:56:22,381 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 29 states, 29 states have (on average 7.137931034482759) internal successors, (207), 29 states have internal predecessors, (207), 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) [2023-11-06 21:56:22,381 INFO L276 IsEmpty]: Start isEmpty. Operand 214 states and 214 transitions. [2023-11-06 21:56:22,384 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 214 [2023-11-06 21:56:22,384 INFO L187 NwaCegarLoop]: Found error trace [2023-11-06 21:56:22,384 INFO L195 NwaCegarLoop]: trace histogram [14, 14, 13, 13, 13, 13, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-11-06 21:56:22,393 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_caa5f2f3-6cb0-43bd-95b0-ab16c9f4f5a2/bin/uautomizer-verify-WvqO1wxjHP/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Forceful destruction successful, exit code 0 [2023-11-06 21:56:22,592 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 2 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_caa5f2f3-6cb0-43bd-95b0-ab16c9f4f5a2/bin/uautomizer-verify-WvqO1wxjHP/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable27 [2023-11-06 21:56:22,593 INFO L420 AbstractCegarLoop]: === Iteration 29 === Targeting ULTIMATE.startErr102ASSERT_VIOLATIONMEMORY_LEAK === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 101 more)] === [2023-11-06 21:56:22,593 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-11-06 21:56:22,593 INFO L85 PathProgramCache]: Analyzing trace with hash 780952787, now seen corresponding path program 2 times [2023-11-06 21:56:22,593 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-06 21:56:22,593 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [967796633] [2023-11-06 21:56:22,594 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-06 21:56:22,594 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-06 21:56:22,757 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 21:56:24,541 INFO L134 CoverageAnalysis]: Checked inductivity of 507 backedges. 0 proven. 507 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-11-06 21:56:24,541 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-06 21:56:24,541 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [967796633] [2023-11-06 21:56:24,541 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [967796633] provided 0 perfect and 1 imperfect interpolant sequences [2023-11-06 21:56:24,542 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1809878061] [2023-11-06 21:56:24,542 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2023-11-06 21:56:24,542 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-11-06 21:56:24,542 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_caa5f2f3-6cb0-43bd-95b0-ab16c9f4f5a2/bin/uautomizer-verify-WvqO1wxjHP/z3 [2023-11-06 21:56:24,544 INFO L229 MonitoredProcess]: Starting monitored process 3 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_caa5f2f3-6cb0-43bd-95b0-ab16c9f4f5a2/bin/uautomizer-verify-WvqO1wxjHP/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2023-11-06 21:56:24,575 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_caa5f2f3-6cb0-43bd-95b0-ab16c9f4f5a2/bin/uautomizer-verify-WvqO1wxjHP/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Waiting until timeout for monitored process [2023-11-06 21:56:26,050 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2023-11-06 21:56:26,050 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2023-11-06 21:56:26,061 INFO L262 TraceCheckSpWp]: Trace formula consists of 1774 conjuncts, 49 conjunts are in the unsatisfiable core [2023-11-06 21:56:26,073 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-11-06 21:56:26,276 INFO L134 CoverageAnalysis]: Checked inductivity of 507 backedges. 0 proven. 507 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-11-06 21:56:26,276 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2023-11-06 21:56:27,912 INFO L134 CoverageAnalysis]: Checked inductivity of 507 backedges. 0 proven. 507 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-11-06 21:56:27,912 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1809878061] provided 0 perfect and 2 imperfect interpolant sequences [2023-11-06 21:56:27,913 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2023-11-06 21:56:27,913 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [28, 26, 26] total 53 [2023-11-06 21:56:27,913 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [256239825] [2023-11-06 21:56:27,913 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2023-11-06 21:56:27,914 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 53 states [2023-11-06 21:56:27,915 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-06 21:56:27,918 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 53 interpolants. [2023-11-06 21:56:27,920 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=681, Invalid=2075, Unknown=0, NotChecked=0, Total=2756 [2023-11-06 21:56:27,921 INFO L87 Difference]: Start difference. First operand 214 states and 214 transitions. Second operand has 53 states, 53 states have (on average 6.622641509433962) internal successors, (351), 53 states have internal predecessors, (351), 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) [2023-11-06 21:57:42,973 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-11-06 21:57:42,974 INFO L93 Difference]: Finished difference Result 337 states and 337 transitions. [2023-11-06 21:57:42,974 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 48 states. [2023-11-06 21:57:42,974 INFO L78 Accepts]: Start accepts. Automaton has has 53 states, 53 states have (on average 6.622641509433962) internal successors, (351), 53 states have internal predecessors, (351), 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 213 [2023-11-06 21:57:42,975 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-11-06 21:57:42,977 INFO L225 Difference]: With dead ends: 337 [2023-11-06 21:57:42,977 INFO L226 Difference]: Without dead ends: 337 [2023-11-06 21:57:42,981 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 494 GetRequests, 401 SyntacticMatches, 0 SemanticMatches, 93 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1045 ImplicationChecksByTransitivity, 75.4s TimeCoverageRelationStatistics Valid=2208, Invalid=6722, Unknown=0, NotChecked=0, Total=8930 [2023-11-06 21:57:42,982 INFO L413 NwaCegarLoop]: 134 mSDtfsCounter, 439 mSDsluCounter, 3233 mSDsCounter, 0 mSdLazyCounter, 2067 mSolverCounterSat, 43 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 439 SdHoareTripleChecker+Valid, 3367 SdHoareTripleChecker+Invalid, 2110 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 43 IncrementalHoareTripleChecker+Valid, 2067 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.2s IncrementalHoareTripleChecker+Time [2023-11-06 21:57:42,982 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [439 Valid, 3367 Invalid, 2110 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [43 Valid, 2067 Invalid, 0 Unknown, 0 Unchecked, 1.2s Time] [2023-11-06 21:57:42,983 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 337 states. [2023-11-06 21:57:42,990 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 337 to 334. [2023-11-06 21:57:42,990 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 334 states, 333 states have (on average 1.003003003003003) internal successors, (334), 333 states have internal predecessors, (334), 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) [2023-11-06 21:57:42,992 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 334 states to 334 states and 334 transitions. [2023-11-06 21:57:42,992 INFO L78 Accepts]: Start accepts. Automaton has 334 states and 334 transitions. Word has length 213 [2023-11-06 21:57:42,993 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-11-06 21:57:42,993 INFO L495 AbstractCegarLoop]: Abstraction has 334 states and 334 transitions. [2023-11-06 21:57:42,993 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 53 states, 53 states have (on average 6.622641509433962) internal successors, (351), 53 states have internal predecessors, (351), 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) [2023-11-06 21:57:42,993 INFO L276 IsEmpty]: Start isEmpty. Operand 334 states and 334 transitions. [2023-11-06 21:57:42,999 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 334 [2023-11-06 21:57:42,999 INFO L187 NwaCegarLoop]: Found error trace [2023-11-06 21:57:42,999 INFO L195 NwaCegarLoop]: trace histogram [34, 34, 33, 33, 33, 33, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-11-06 21:57:43,012 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_caa5f2f3-6cb0-43bd-95b0-ab16c9f4f5a2/bin/uautomizer-verify-WvqO1wxjHP/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Forceful destruction successful, exit code 0 [2023-11-06 21:57:43,208 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 3 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_caa5f2f3-6cb0-43bd-95b0-ab16c9f4f5a2/bin/uautomizer-verify-WvqO1wxjHP/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable28 [2023-11-06 21:57:43,209 INFO L420 AbstractCegarLoop]: === Iteration 30 === Targeting ULTIMATE.startErr102ASSERT_VIOLATIONMEMORY_LEAK === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 101 more)] === [2023-11-06 21:57:43,209 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-11-06 21:57:43,209 INFO L85 PathProgramCache]: Analyzing trace with hash -360951345, now seen corresponding path program 3 times [2023-11-06 21:57:43,209 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-06 21:57:43,210 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1788337507] [2023-11-06 21:57:43,210 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-06 21:57:43,210 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-06 21:57:45,088 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 21:57:51,064 INFO L134 CoverageAnalysis]: Checked inductivity of 3267 backedges. 99 proven. 3168 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-11-06 21:57:51,067 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-06 21:57:51,067 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1788337507] [2023-11-06 21:57:51,067 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1788337507] provided 0 perfect and 1 imperfect interpolant sequences [2023-11-06 21:57:51,067 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [642012369] [2023-11-06 21:57:51,068 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2023-11-06 21:57:51,068 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-11-06 21:57:51,068 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_caa5f2f3-6cb0-43bd-95b0-ab16c9f4f5a2/bin/uautomizer-verify-WvqO1wxjHP/z3 [2023-11-06 21:57:51,069 INFO L229 MonitoredProcess]: Starting monitored process 4 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_caa5f2f3-6cb0-43bd-95b0-ab16c9f4f5a2/bin/uautomizer-verify-WvqO1wxjHP/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2023-11-06 21:57:51,092 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_caa5f2f3-6cb0-43bd-95b0-ab16c9f4f5a2/bin/uautomizer-verify-WvqO1wxjHP/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Waiting until timeout for monitored process [2023-11-06 21:57:56,327 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 3 check-sat command(s) [2023-11-06 21:57:56,328 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2023-11-06 21:57:56,341 INFO L262 TraceCheckSpWp]: Trace formula consists of 1312 conjuncts, 91 conjunts are in the unsatisfiable core [2023-11-06 21:57:56,355 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-11-06 21:58:05,975 INFO L322 Elim1Store]: treesize reduction 12, result has 85.9 percent of original size [2023-11-06 21:58:05,976 INFO L351 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 10 select indices, 10 select index equivalence classes, 28 disjoint index pairs (out of 45 index pairs), introduced 10 new quantified variables, introduced 45 case distinctions, treesize of input 71 treesize of output 103 [2023-11-06 21:58:06,995 INFO L134 CoverageAnalysis]: Checked inductivity of 3267 backedges. 96 proven. 163 refuted. 0 times theorem prover too weak. 3008 trivial. 0 not checked. [2023-11-06 21:58:06,995 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2023-11-06 21:58:17,701 INFO L134 CoverageAnalysis]: Checked inductivity of 3267 backedges. 0 proven. 259 refuted. 0 times theorem prover too weak. 3008 trivial. 0 not checked. [2023-11-06 21:58:17,701 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [642012369] provided 0 perfect and 2 imperfect interpolant sequences [2023-11-06 21:58:17,702 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2023-11-06 21:58:17,702 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [50, 25, 22] total 94 [2023-11-06 21:58:17,702 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [498155805] [2023-11-06 21:58:17,703 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2023-11-06 21:58:17,704 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 94 states [2023-11-06 21:58:17,704 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-06 21:58:17,706 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 94 interpolants. [2023-11-06 21:58:17,709 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=1466, Invalid=7276, Unknown=0, NotChecked=0, Total=8742 [2023-11-06 21:58:17,709 INFO L87 Difference]: Start difference. First operand 334 states and 334 transitions. Second operand has 94 states, 94 states have (on average 5.73404255319149) internal successors, (539), 94 states have internal predecessors, (539), 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) [2023-11-06 21:58:46,329 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-11-06 21:58:46,330 INFO L93 Difference]: Finished difference Result 328 states and 327 transitions. [2023-11-06 21:58:46,330 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 119 states. [2023-11-06 21:58:46,330 INFO L78 Accepts]: Start accepts. Automaton has has 94 states, 94 states have (on average 5.73404255319149) internal successors, (539), 94 states have internal predecessors, (539), 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 333 [2023-11-06 21:58:46,331 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-11-06 21:58:46,331 INFO L225 Difference]: With dead ends: 328 [2023-11-06 21:58:46,331 INFO L226 Difference]: Without dead ends: 0 [2023-11-06 21:58:46,344 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 831 GetRequests, 622 SyntacticMatches, 0 SemanticMatches, 209 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 9091 ImplicationChecksByTransitivity, 30.5s TimeCoverageRelationStatistics Valid=5591, Invalid=38719, Unknown=0, NotChecked=0, Total=44310 [2023-11-06 21:58:46,345 INFO L413 NwaCegarLoop]: 84 mSDtfsCounter, 1447 mSDsluCounter, 2924 mSDsCounter, 0 mSdLazyCounter, 11784 mSolverCounterSat, 77 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 6.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1447 SdHoareTripleChecker+Valid, 3008 SdHoareTripleChecker+Invalid, 11861 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.1s SdHoareTripleChecker+Time, 77 IncrementalHoareTripleChecker+Valid, 11784 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 7.0s IncrementalHoareTripleChecker+Time [2023-11-06 21:58:46,345 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [1447 Valid, 3008 Invalid, 11861 Unknown, 0 Unchecked, 0.1s Time], IncrementalHoareTripleChecker [77 Valid, 11784 Invalid, 0 Unknown, 0 Unchecked, 7.0s Time] [2023-11-06 21:58:46,346 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 0 states. [2023-11-06 21:58:46,346 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 0 to 0. [2023-11-06 21:58:46,346 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 0 states, 0 states have (on average 0.0) internal successors, (0), 0 states have internal predecessors, (0), 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) [2023-11-06 21:58:46,346 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 0 states to 0 states and 0 transitions. [2023-11-06 21:58:46,347 INFO L78 Accepts]: Start accepts. Automaton has 0 states and 0 transitions. Word has length 333 [2023-11-06 21:58:46,347 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-11-06 21:58:46,347 INFO L495 AbstractCegarLoop]: Abstraction has 0 states and 0 transitions. [2023-11-06 21:58:46,347 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 94 states, 94 states have (on average 5.73404255319149) internal successors, (539), 94 states have internal predecessors, (539), 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) [2023-11-06 21:58:46,348 INFO L276 IsEmpty]: Start isEmpty. Operand 0 states and 0 transitions. [2023-11-06 21:58:46,348 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2023-11-06 21:58:46,350 INFO L805 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE (103 of 104 remaining) [2023-11-06 21:58:46,351 INFO L805 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (102 of 104 remaining) [2023-11-06 21:58:46,351 INFO L805 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (101 of 104 remaining) [2023-11-06 21:58:46,351 INFO L805 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr3REQUIRES_VIOLATIONMEMORY_DEREFERENCE (100 of 104 remaining) [2023-11-06 21:58:46,352 INFO L805 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr4REQUIRES_VIOLATIONMEMORY_DEREFERENCE (99 of 104 remaining) [2023-11-06 21:58:46,352 INFO L805 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr5REQUIRES_VIOLATIONMEMORY_DEREFERENCE (98 of 104 remaining) [2023-11-06 21:58:46,352 INFO L805 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr6REQUIRES_VIOLATIONMEMORY_DEREFERENCE (97 of 104 remaining) [2023-11-06 21:58:46,352 INFO L805 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr7REQUIRES_VIOLATIONMEMORY_DEREFERENCE (96 of 104 remaining) [2023-11-06 21:58:46,352 INFO L805 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr8REQUIRES_VIOLATIONMEMORY_DEREFERENCE (95 of 104 remaining) [2023-11-06 21:58:46,353 INFO L805 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr9REQUIRES_VIOLATIONMEMORY_DEREFERENCE (94 of 104 remaining) [2023-11-06 21:58:46,353 INFO L805 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr10REQUIRES_VIOLATIONMEMORY_DEREFERENCE (93 of 104 remaining) [2023-11-06 21:58:46,353 INFO L805 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr11REQUIRES_VIOLATIONMEMORY_DEREFERENCE (92 of 104 remaining) [2023-11-06 21:58:46,353 INFO L805 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr12REQUIRES_VIOLATIONMEMORY_DEREFERENCE (91 of 104 remaining) [2023-11-06 21:58:46,353 INFO L805 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr13REQUIRES_VIOLATIONMEMORY_DEREFERENCE (90 of 104 remaining) [2023-11-06 21:58:46,354 INFO L805 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr14REQUIRES_VIOLATIONMEMORY_DEREFERENCE (89 of 104 remaining) [2023-11-06 21:58:46,354 INFO L805 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr15REQUIRES_VIOLATIONMEMORY_DEREFERENCE (88 of 104 remaining) [2023-11-06 21:58:46,354 INFO L805 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr16REQUIRES_VIOLATIONMEMORY_DEREFERENCE (87 of 104 remaining) [2023-11-06 21:58:46,354 INFO L805 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr17REQUIRES_VIOLATIONMEMORY_DEREFERENCE (86 of 104 remaining) [2023-11-06 21:58:46,355 INFO L805 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr18REQUIRES_VIOLATIONMEMORY_DEREFERENCE (85 of 104 remaining) [2023-11-06 21:58:46,355 INFO L805 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr19REQUIRES_VIOLATIONMEMORY_DEREFERENCE (84 of 104 remaining) [2023-11-06 21:58:46,355 INFO L805 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr20REQUIRES_VIOLATIONMEMORY_DEREFERENCE (83 of 104 remaining) [2023-11-06 21:58:46,355 INFO L805 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr21REQUIRES_VIOLATIONMEMORY_DEREFERENCE (82 of 104 remaining) [2023-11-06 21:58:46,355 INFO L805 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr22REQUIRES_VIOLATIONMEMORY_DEREFERENCE (81 of 104 remaining) [2023-11-06 21:58:46,356 INFO L805 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr23REQUIRES_VIOLATIONMEMORY_DEREFERENCE (80 of 104 remaining) [2023-11-06 21:58:46,356 INFO L805 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr24REQUIRES_VIOLATIONMEMORY_DEREFERENCE (79 of 104 remaining) [2023-11-06 21:58:46,356 INFO L805 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr25REQUIRES_VIOLATIONMEMORY_DEREFERENCE (78 of 104 remaining) [2023-11-06 21:58:46,356 INFO L805 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr26REQUIRES_VIOLATIONMEMORY_DEREFERENCE (77 of 104 remaining) [2023-11-06 21:58:46,356 INFO L805 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr27REQUIRES_VIOLATIONMEMORY_DEREFERENCE (76 of 104 remaining) [2023-11-06 21:58:46,357 INFO L805 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr28REQUIRES_VIOLATIONMEMORY_DEREFERENCE (75 of 104 remaining) [2023-11-06 21:58:46,357 INFO L805 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr29REQUIRES_VIOLATIONMEMORY_DEREFERENCE (74 of 104 remaining) [2023-11-06 21:58:46,357 INFO L805 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr30REQUIRES_VIOLATIONMEMORY_DEREFERENCE (73 of 104 remaining) [2023-11-06 21:58:46,357 INFO L805 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr31REQUIRES_VIOLATIONMEMORY_DEREFERENCE (72 of 104 remaining) [2023-11-06 21:58:46,357 INFO L805 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr32REQUIRES_VIOLATIONMEMORY_DEREFERENCE (71 of 104 remaining) [2023-11-06 21:58:46,358 INFO L805 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr33REQUIRES_VIOLATIONMEMORY_DEREFERENCE (70 of 104 remaining) [2023-11-06 21:58:46,358 INFO L805 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr34REQUIRES_VIOLATIONMEMORY_DEREFERENCE (69 of 104 remaining) [2023-11-06 21:58:46,358 INFO L805 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr35REQUIRES_VIOLATIONMEMORY_DEREFERENCE (68 of 104 remaining) [2023-11-06 21:58:46,358 INFO L805 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr36REQUIRES_VIOLATIONMEMORY_DEREFERENCE (67 of 104 remaining) [2023-11-06 21:58:46,358 INFO L805 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr37REQUIRES_VIOLATIONMEMORY_DEREFERENCE (66 of 104 remaining) [2023-11-06 21:58:46,359 INFO L805 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr38REQUIRES_VIOLATIONMEMORY_DEREFERENCE (65 of 104 remaining) [2023-11-06 21:58:46,359 INFO L805 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr39REQUIRES_VIOLATIONMEMORY_DEREFERENCE (64 of 104 remaining) [2023-11-06 21:58:46,359 INFO L805 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr40REQUIRES_VIOLATIONMEMORY_DEREFERENCE (63 of 104 remaining) [2023-11-06 21:58:46,359 INFO L805 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr41REQUIRES_VIOLATIONMEMORY_DEREFERENCE (62 of 104 remaining) [2023-11-06 21:58:46,359 INFO L805 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr42REQUIRES_VIOLATIONMEMORY_DEREFERENCE (61 of 104 remaining) [2023-11-06 21:58:46,360 INFO L805 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr43REQUIRES_VIOLATIONMEMORY_DEREFERENCE (60 of 104 remaining) [2023-11-06 21:58:46,360 INFO L805 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr44REQUIRES_VIOLATIONMEMORY_DEREFERENCE (59 of 104 remaining) [2023-11-06 21:58:46,360 INFO L805 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr45REQUIRES_VIOLATIONMEMORY_DEREFERENCE (58 of 104 remaining) [2023-11-06 21:58:46,360 INFO L805 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr46REQUIRES_VIOLATIONMEMORY_DEREFERENCE (57 of 104 remaining) [2023-11-06 21:58:46,360 INFO L805 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr47REQUIRES_VIOLATIONMEMORY_DEREFERENCE (56 of 104 remaining) [2023-11-06 21:58:46,360 INFO L805 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr48REQUIRES_VIOLATIONMEMORY_DEREFERENCE (55 of 104 remaining) [2023-11-06 21:58:46,361 INFO L805 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr49REQUIRES_VIOLATIONMEMORY_DEREFERENCE (54 of 104 remaining) [2023-11-06 21:58:46,361 INFO L805 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr50REQUIRES_VIOLATIONMEMORY_DEREFERENCE (53 of 104 remaining) [2023-11-06 21:58:46,361 INFO L805 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr51REQUIRES_VIOLATIONMEMORY_DEREFERENCE (52 of 104 remaining) [2023-11-06 21:58:46,361 INFO L805 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr52REQUIRES_VIOLATIONMEMORY_DEREFERENCE (51 of 104 remaining) [2023-11-06 21:58:46,361 INFO L805 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr53REQUIRES_VIOLATIONMEMORY_DEREFERENCE (50 of 104 remaining) [2023-11-06 21:58:46,362 INFO L805 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr54REQUIRES_VIOLATIONMEMORY_DEREFERENCE (49 of 104 remaining) [2023-11-06 21:58:46,362 INFO L805 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr55REQUIRES_VIOLATIONMEMORY_DEREFERENCE (48 of 104 remaining) [2023-11-06 21:58:46,362 INFO L805 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr56REQUIRES_VIOLATIONMEMORY_DEREFERENCE (47 of 104 remaining) [2023-11-06 21:58:46,362 INFO L805 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr57REQUIRES_VIOLATIONMEMORY_DEREFERENCE (46 of 104 remaining) [2023-11-06 21:58:46,362 INFO L805 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr58REQUIRES_VIOLATIONMEMORY_DEREFERENCE (45 of 104 remaining) [2023-11-06 21:58:46,363 INFO L805 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr59REQUIRES_VIOLATIONMEMORY_DEREFERENCE (44 of 104 remaining) [2023-11-06 21:58:46,363 INFO L805 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr60REQUIRES_VIOLATIONMEMORY_DEREFERENCE (43 of 104 remaining) [2023-11-06 21:58:46,363 INFO L805 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr61REQUIRES_VIOLATIONMEMORY_DEREFERENCE (42 of 104 remaining) [2023-11-06 21:58:46,363 INFO L805 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr62REQUIRES_VIOLATIONMEMORY_DEREFERENCE (41 of 104 remaining) [2023-11-06 21:58:46,363 INFO L805 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr63REQUIRES_VIOLATIONMEMORY_DEREFERENCE (40 of 104 remaining) [2023-11-06 21:58:46,364 INFO L805 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr64REQUIRES_VIOLATIONMEMORY_DEREFERENCE (39 of 104 remaining) [2023-11-06 21:58:46,364 INFO L805 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr65REQUIRES_VIOLATIONMEMORY_DEREFERENCE (38 of 104 remaining) [2023-11-06 21:58:46,364 INFO L805 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr66REQUIRES_VIOLATIONMEMORY_DEREFERENCE (37 of 104 remaining) [2023-11-06 21:58:46,364 INFO L805 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr67REQUIRES_VIOLATIONMEMORY_DEREFERENCE (36 of 104 remaining) [2023-11-06 21:58:46,364 INFO L805 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr68REQUIRES_VIOLATIONMEMORY_DEREFERENCE (35 of 104 remaining) [2023-11-06 21:58:46,365 INFO L805 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr69REQUIRES_VIOLATIONMEMORY_DEREFERENCE (34 of 104 remaining) [2023-11-06 21:58:46,365 INFO L805 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr70REQUIRES_VIOLATIONMEMORY_DEREFERENCE (33 of 104 remaining) [2023-11-06 21:58:46,365 INFO L805 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr71REQUIRES_VIOLATIONMEMORY_DEREFERENCE (32 of 104 remaining) [2023-11-06 21:58:46,365 INFO L805 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr72REQUIRES_VIOLATIONMEMORY_DEREFERENCE (31 of 104 remaining) [2023-11-06 21:58:46,365 INFO L805 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr73REQUIRES_VIOLATIONMEMORY_DEREFERENCE (30 of 104 remaining) [2023-11-06 21:58:46,366 INFO L805 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr74REQUIRES_VIOLATIONMEMORY_DEREFERENCE (29 of 104 remaining) [2023-11-06 21:58:46,366 INFO L805 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr75REQUIRES_VIOLATIONMEMORY_DEREFERENCE (28 of 104 remaining) [2023-11-06 21:58:46,366 INFO L805 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr76REQUIRES_VIOLATIONMEMORY_DEREFERENCE (27 of 104 remaining) [2023-11-06 21:58:46,366 INFO L805 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr77REQUIRES_VIOLATIONMEMORY_DEREFERENCE (26 of 104 remaining) [2023-11-06 21:58:46,366 INFO L805 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr78REQUIRES_VIOLATIONMEMORY_DEREFERENCE (25 of 104 remaining) [2023-11-06 21:58:46,367 INFO L805 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr79REQUIRES_VIOLATIONMEMORY_DEREFERENCE (24 of 104 remaining) [2023-11-06 21:58:46,367 INFO L805 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr80REQUIRES_VIOLATIONMEMORY_DEREFERENCE (23 of 104 remaining) [2023-11-06 21:58:46,367 INFO L805 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr81REQUIRES_VIOLATIONMEMORY_DEREFERENCE (22 of 104 remaining) [2023-11-06 21:58:46,367 INFO L805 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr82REQUIRES_VIOLATIONMEMORY_DEREFERENCE (21 of 104 remaining) [2023-11-06 21:58:46,367 INFO L805 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr83REQUIRES_VIOLATIONMEMORY_DEREFERENCE (20 of 104 remaining) [2023-11-06 21:58:46,368 INFO L805 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr84REQUIRES_VIOLATIONMEMORY_DEREFERENCE (19 of 104 remaining) [2023-11-06 21:58:46,368 INFO L805 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr85REQUIRES_VIOLATIONMEMORY_DEREFERENCE (18 of 104 remaining) [2023-11-06 21:58:46,368 INFO L805 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr86REQUIRES_VIOLATIONMEMORY_DEREFERENCE (17 of 104 remaining) [2023-11-06 21:58:46,368 INFO L805 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr87REQUIRES_VIOLATIONMEMORY_DEREFERENCE (16 of 104 remaining) [2023-11-06 21:58:46,368 INFO L805 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr88REQUIRES_VIOLATIONMEMORY_DEREFERENCE (15 of 104 remaining) [2023-11-06 21:58:46,369 INFO L805 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr89REQUIRES_VIOLATIONMEMORY_DEREFERENCE (14 of 104 remaining) [2023-11-06 21:58:46,369 INFO L805 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr90REQUIRES_VIOLATIONMEMORY_DEREFERENCE (13 of 104 remaining) [2023-11-06 21:58:46,369 INFO L805 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr91REQUIRES_VIOLATIONMEMORY_DEREFERENCE (12 of 104 remaining) [2023-11-06 21:58:46,369 INFO L805 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr92REQUIRES_VIOLATIONMEMORY_DEREFERENCE (11 of 104 remaining) [2023-11-06 21:58:46,369 INFO L805 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr93REQUIRES_VIOLATIONMEMORY_DEREFERENCE (10 of 104 remaining) [2023-11-06 21:58:46,370 INFO L805 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr94REQUIRES_VIOLATIONMEMORY_DEREFERENCE (9 of 104 remaining) [2023-11-06 21:58:46,370 INFO L805 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr95REQUIRES_VIOLATIONMEMORY_DEREFERENCE (8 of 104 remaining) [2023-11-06 21:58:46,370 INFO L805 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr96REQUIRES_VIOLATIONMEMORY_DEREFERENCE (7 of 104 remaining) [2023-11-06 21:58:46,370 INFO L805 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr97REQUIRES_VIOLATIONMEMORY_DEREFERENCE (6 of 104 remaining) [2023-11-06 21:58:46,370 INFO L805 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr98REQUIRES_VIOLATIONMEMORY_DEREFERENCE (5 of 104 remaining) [2023-11-06 21:58:46,371 INFO L805 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr99REQUIRES_VIOLATIONMEMORY_DEREFERENCE (4 of 104 remaining) [2023-11-06 21:58:46,371 INFO L805 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr100REQUIRES_VIOLATIONMEMORY_DEREFERENCE (3 of 104 remaining) [2023-11-06 21:58:46,371 INFO L805 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr101REQUIRES_VIOLATIONMEMORY_DEREFERENCE (2 of 104 remaining) [2023-11-06 21:58:46,371 INFO L805 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr102ASSERT_VIOLATIONMEMORY_LEAK (1 of 104 remaining) [2023-11-06 21:58:46,371 INFO L805 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr103ASSERT_VIOLATIONMEMORY_LEAK (0 of 104 remaining) [2023-11-06 21:58:46,388 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_caa5f2f3-6cb0-43bd-95b0-ab16c9f4f5a2/bin/uautomizer-verify-WvqO1wxjHP/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Forceful destruction successful, exit code 0 [2023-11-06 21:58:46,586 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable29,4 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_caa5f2f3-6cb0-43bd-95b0-ab16c9f4f5a2/bin/uautomizer-verify-WvqO1wxjHP/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-11-06 21:58:46,589 INFO L445 BasicCegarLoop]: Path program histogram: [3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-11-06 21:58:46,594 INFO L178 ceAbstractionStarter]: Computing trace abstraction results [2023-11-06 21:58:46,601 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 06.11 09:58:46 BoogieIcfgContainer [2023-11-06 21:58:46,602 INFO L131 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2023-11-06 21:58:46,602 INFO L112 PluginConnector]: ------------------------Witness Printer---------------------------- [2023-11-06 21:58:46,602 INFO L270 PluginConnector]: Initializing Witness Printer... [2023-11-06 21:58:46,603 INFO L274 PluginConnector]: Witness Printer initialized [2023-11-06 21:58:46,603 INFO L184 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 06.11 09:55:49" (3/4) ... [2023-11-06 21:58:46,609 INFO L137 WitnessPrinter]: Generating witness for correct program [2023-11-06 21:58:46,634 INFO L939 BoogieBacktranslator]: Reduced CFG by removing 62 nodes and edges [2023-11-06 21:58:46,636 INFO L939 BoogieBacktranslator]: Reduced CFG by removing 10 nodes and edges [2023-11-06 21:58:46,638 INFO L939 BoogieBacktranslator]: Reduced CFG by removing 6 nodes and edges [2023-11-06 21:58:46,640 INFO L939 BoogieBacktranslator]: Reduced CFG by removing 2 nodes and edges [2023-11-06 21:58:46,642 INFO L939 BoogieBacktranslator]: Reduced CFG by removing 1 nodes and edges [2023-11-06 21:58:46,966 INFO L149 WitnessManager]: Wrote witness to /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_caa5f2f3-6cb0-43bd-95b0-ab16c9f4f5a2/bin/uautomizer-verify-WvqO1wxjHP/witness.graphml.graphml [2023-11-06 21:58:46,966 INFO L149 WitnessManager]: Wrote witness to /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_caa5f2f3-6cb0-43bd-95b0-ab16c9f4f5a2/bin/uautomizer-verify-WvqO1wxjHP/witness.graphml.yaml [2023-11-06 21:58:46,967 INFO L131 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2023-11-06 21:58:46,969 INFO L158 Benchmark]: Toolchain (without parser) took 179718.91ms. Allocated memory was 153.1MB in the beginning and 654.3MB in the end (delta: 501.2MB). Free memory was 113.0MB in the beginning and 375.3MB in the end (delta: -262.3MB). Peak memory consumption was 239.4MB. Max. memory is 16.1GB. [2023-11-06 21:58:46,969 INFO L158 Benchmark]: CDTParser took 0.29ms. Allocated memory is still 153.1MB. Free memory is still 125.7MB. There was no memory consumed. Max. memory is 16.1GB. [2023-11-06 21:58:46,969 INFO L158 Benchmark]: CACSL2BoogieTranslator took 524.86ms. Allocated memory is still 153.1MB. Free memory was 113.0MB in the beginning and 92.0MB in the end (delta: 21.0MB). Peak memory consumption was 21.0MB. Max. memory is 16.1GB. [2023-11-06 21:58:46,972 INFO L158 Benchmark]: Boogie Procedure Inliner took 98.41ms. Allocated memory is still 153.1MB. Free memory was 91.5MB in the beginning and 87.3MB in the end (delta: 4.2MB). Peak memory consumption was 4.2MB. Max. memory is 16.1GB. [2023-11-06 21:58:46,972 INFO L158 Benchmark]: Boogie Preprocessor took 109.46ms. Allocated memory is still 153.1MB. Free memory was 87.3MB in the beginning and 82.5MB in the end (delta: 4.8MB). Peak memory consumption was 4.2MB. Max. memory is 16.1GB. [2023-11-06 21:58:46,973 INFO L158 Benchmark]: RCFGBuilder took 1326.66ms. Allocated memory was 153.1MB in the beginning and 201.3MB in the end (delta: 48.2MB). Free memory was 82.5MB in the beginning and 137.9MB in the end (delta: -55.4MB). Peak memory consumption was 41.7MB. Max. memory is 16.1GB. [2023-11-06 21:58:46,976 INFO L158 Benchmark]: TraceAbstraction took 177287.24ms. Allocated memory was 201.3MB in the beginning and 654.3MB in the end (delta: 453.0MB). Free memory was 136.9MB in the beginning and 396.7MB in the end (delta: -259.8MB). Peak memory consumption was 193.5MB. Max. memory is 16.1GB. [2023-11-06 21:58:46,982 INFO L158 Benchmark]: Witness Printer took 365.14ms. Allocated memory is still 654.3MB. Free memory was 396.7MB in the beginning and 375.3MB in the end (delta: 21.3MB). Peak memory consumption was 21.0MB. Max. memory is 16.1GB. [2023-11-06 21:58:46,984 INFO L338 ainManager$Toolchain]: ####################### End [Toolchain 1] ####################### --- Results --- * Results from de.uni_freiburg.informatik.ultimate.core: - StatisticsResult: Toolchain Benchmarks Benchmark results are: * CDTParser took 0.29ms. Allocated memory is still 153.1MB. Free memory is still 125.7MB. There was no memory consumed. Max. memory is 16.1GB. * CACSL2BoogieTranslator took 524.86ms. Allocated memory is still 153.1MB. Free memory was 113.0MB in the beginning and 92.0MB in the end (delta: 21.0MB). Peak memory consumption was 21.0MB. Max. memory is 16.1GB. * Boogie Procedure Inliner took 98.41ms. Allocated memory is still 153.1MB. Free memory was 91.5MB in the beginning and 87.3MB in the end (delta: 4.2MB). Peak memory consumption was 4.2MB. Max. memory is 16.1GB. * Boogie Preprocessor took 109.46ms. Allocated memory is still 153.1MB. Free memory was 87.3MB in the beginning and 82.5MB in the end (delta: 4.8MB). Peak memory consumption was 4.2MB. Max. memory is 16.1GB. * RCFGBuilder took 1326.66ms. Allocated memory was 153.1MB in the beginning and 201.3MB in the end (delta: 48.2MB). Free memory was 82.5MB in the beginning and 137.9MB in the end (delta: -55.4MB). Peak memory consumption was 41.7MB. Max. memory is 16.1GB. * TraceAbstraction took 177287.24ms. Allocated memory was 201.3MB in the beginning and 654.3MB in the end (delta: 453.0MB). Free memory was 136.9MB in the beginning and 396.7MB in the end (delta: -259.8MB). Peak memory consumption was 193.5MB. Max. memory is 16.1GB. * Witness Printer took 365.14ms. Allocated memory is still 654.3MB. Free memory was 396.7MB in the beginning and 375.3MB in the end (delta: 21.3MB). Peak memory consumption was 21.0MB. Max. memory is 16.1GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - StatisticsResult: ErrorAutomatonStatistics NumberErrorTraces: 0, NumberStatementsAllTraces: 0, NumberRelevantStatements: 0, 0.0s ErrorAutomatonConstructionTimeTotal, 0.0s FaulLocalizationTime, NumberStatementsFirstTrace: -1, TraceLengthAvg: 0, 0.0s ErrorAutomatonConstructionTimeAvg, 0.0s ErrorAutomatonDifferenceTimeAvg, 0.0s ErrorAutomatonDifferenceTimeTotal, NumberOfNoEnhancement: 0, NumberOfFiniteEnhancement: 0, NumberOfInfiniteEnhancement: 0 - PositiveResult [Line: -1]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: -1]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: -1]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: -1]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: -1]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: -1]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: -1]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: -1]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: -1]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: -1]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: -1]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: -1]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: -1]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: -1]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: -1]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: -1]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: -1]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: -1]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: -1]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: -1]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: -1]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: -1]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: -1]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: -1]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: -1]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: -1]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: -1]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: -1]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: -1]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: -1]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: -1]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: -1]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: -1]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: -1]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: -1]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: -1]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: -1]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: -1]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: -1]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: -1]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: -1]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: -1]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: -1]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: -1]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: -1]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: -1]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: -1]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: -1]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: -1]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: -1]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: -1]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: -1]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: -1]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: -1]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: -1]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: -1]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: -1]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: -1]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: -1]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: -1]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: -1]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: -1]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: -1]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: -1]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: -1]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: -1]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: -1]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: -1]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: -1]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: -1]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: -1]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: -1]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: -1]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: -1]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: -1]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: -1]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: -1]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: -1]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: -1]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: -1]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: -1]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: -1]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: -1]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: -1]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: -1]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: -1]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: -1]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: -1]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: -1]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: -1]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: -1]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: -1]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: -1]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: -1]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: -1]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: -1]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: -1]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: -1]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: -1]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: -1]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: -1]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: -1]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: 4]: all allocated memory was freed For all program executions holds that all allocated memory was freed at this location - PositiveResult [Line: 130]: all allocated memory was freed For all program executions holds that all allocated memory was freed at this location - StatisticsResult: Ultimate Automizer benchmark data CFG has 1 procedures, 246 locations, 104 error locations. Started 1 CEGAR loops. OverallTime: 177.2s, OverallIterations: 30, TraceHistogramMax: 34, PathProgramHistogramMax: 3, EmptinessCheckTime: 0.1s, AutomataDifference: 121.0s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 0.0s, HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 6776 SdHoareTripleChecker+Valid, 14.3s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 6776 mSDsluCounter, 16190 SdHoareTripleChecker+Invalid, 12.4s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 12450 mSDsCounter, 416 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 19057 IncrementalHoareTripleChecker+Invalid, 19473 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 416 mSolverCounterUnsat, 3740 mSDtfsCounter, 19057 mSolverCounterSat, 0.2s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 1838 GetRequests, 1323 SyntacticMatches, 0 SemanticMatches, 515 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 10527 ImplicationChecksByTransitivity, 117.7s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=334occurred in iteration=29, InterpolantAutomatonStates: 356, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s DumpTime, AutomataMinimizationStatistics: 0.2s AutomataMinimizationTime, 30 MinimizatonAttempts, 16 StatesRemovedByMinimization, 6 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.6s SsaConstructionTime, 9.2s SatisfiabilityAnalysisTime, 43.3s InterpolantComputationTime, 4021 NumberOfCodeBlocks, 3835 NumberOfCodeBlocksAsserted, 36 NumberOfCheckSat, 4672 ConstructedInterpolants, 238 QuantifiedInterpolants, 41350 SizeOfPredicates, 33 NumberOfNonLiveVariables, 4356 ConjunctsInSsa, 165 ConjunctsInUnsatCore, 36 InterpolantComputations, 27 PerfectInterpolantSequences, 6211/11331 InterpolantCoveringCapability, INVARIANT_SYNTHESIS: No data available, INTERPOLANT_CONSOLIDATION: No data available, ABSTRACT_INTERPRETATION: No data available, PDR: No data available, ACCELERATED_INTERPOLATION: No data available, SIFA: No data available, ReuseStatistics: No data available - AllSpecificationsHoldResult: All specifications hold 104 specifications checked. All of them hold RESULT: Ultimate proved your program to be correct! [2023-11-06 21:58:47,034 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_caa5f2f3-6cb0-43bd-95b0-ab16c9f4f5a2/bin/uautomizer-verify-WvqO1wxjHP/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (1)] Ended with exit code 0 Received shutdown request... --- End real Ultimate output --- Execution finished normally Writing output log to file Ultimate.log Result: TRUE