./Ultimate.py --spec ../../sv-benchmarks/c/properties/valid-memcleanup.prp --file ../../sv-benchmarks/c/list-ext3-properties/sll_of_sll_nondet_append-2.i --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for memory safety (memcleanup) Using default analysis Version cf1a7837 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_e0c54d7e-3715-4ac8-8647-fe59e51db918/bin/uautomizer-verify-uTZkv6EMXl/data/config -Xmx15G -Xms4m -jar /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_e0c54d7e-3715-4ac8-8647-fe59e51db918/bin/uautomizer-verify-uTZkv6EMXl/plugins/org.eclipse.equinox.launcher_1.5.800.v20200727-1323.jar -data @noDefault -ultimatedata /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_e0c54d7e-3715-4ac8-8647-fe59e51db918/bin/uautomizer-verify-uTZkv6EMXl/data -tc /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_e0c54d7e-3715-4ac8-8647-fe59e51db918/bin/uautomizer-verify-uTZkv6EMXl/config/AutomizerMemDerefMemtrack.xml -i ../../sv-benchmarks/c/list-ext3-properties/sll_of_sll_nondet_append-2.i -s /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_e0c54d7e-3715-4ac8-8647-fe59e51db918/bin/uautomizer-verify-uTZkv6EMXl/config/svcomp-MemCleanup-32bit-Automizer_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_e0c54d7e-3715-4ac8-8647-fe59e51db918/bin/uautomizer-verify-uTZkv6EMXl --witnessprinter.witness.filename witness --witnessprinter.write.witness.besides.input.file false --witnessprinter.graph.data.specification CHECK( init(main()), LTL(G valid-memcleanup) ) --witnessprinter.graph.data.producer Automizer --witnessprinter.graph.data.architecture 32bit --witnessprinter.graph.data.programhash 68e1c5cf050539b3ee8f058d38ff7af5aea2a400d05e41e0185e4509f45301e0 --- Real Ultimate output --- This is Ultimate 0.2.3-dev-cf1a783 [2023-11-12 02:33:07,341 INFO L188 SettingsManager]: Resetting all preferences to default values... [2023-11-12 02:33:07,449 INFO L114 SettingsManager]: Loading settings from /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_e0c54d7e-3715-4ac8-8647-fe59e51db918/bin/uautomizer-verify-uTZkv6EMXl/config/svcomp-MemCleanup-32bit-Automizer_Default.epf [2023-11-12 02:33:07,463 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2023-11-12 02:33:07,463 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2023-11-12 02:33:07,507 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2023-11-12 02:33:07,508 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2023-11-12 02:33:07,508 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2023-11-12 02:33:07,509 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2023-11-12 02:33:07,514 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2023-11-12 02:33:07,515 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2023-11-12 02:33:07,515 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2023-11-12 02:33:07,515 INFO L153 SettingsManager]: * Use SBE=true [2023-11-12 02:33:07,518 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2023-11-12 02:33:07,518 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2023-11-12 02:33:07,518 INFO L153 SettingsManager]: * sizeof long=4 [2023-11-12 02:33:07,519 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2023-11-12 02:33:07,519 INFO L153 SettingsManager]: * sizeof POINTER=4 [2023-11-12 02:33:07,520 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2023-11-12 02:33:07,520 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2023-11-12 02:33:07,520 INFO L153 SettingsManager]: * Check for the main procedure if all allocated memory was freed=true [2023-11-12 02:33:07,521 INFO L153 SettingsManager]: * Bitprecise bitfields=true [2023-11-12 02:33:07,521 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2023-11-12 02:33:07,522 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2023-11-12 02:33:07,522 INFO L153 SettingsManager]: * Adapt memory model on pointer casts if necessary=true [2023-11-12 02:33:07,522 INFO L153 SettingsManager]: * Check unreachability of reach_error function=false [2023-11-12 02:33:07,523 INFO L153 SettingsManager]: * sizeof long double=12 [2023-11-12 02:33:07,523 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2023-11-12 02:33:07,524 INFO L153 SettingsManager]: * Use constant arrays=true [2023-11-12 02:33:07,524 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2023-11-12 02:33:07,525 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2023-11-12 02:33:07,526 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2023-11-12 02:33:07,526 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2023-11-12 02:33:07,526 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2023-11-12 02:33:07,526 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2023-11-12 02:33:07,527 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2023-11-12 02:33:07,527 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2023-11-12 02:33:07,527 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2023-11-12 02:33:07,527 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2023-11-12 02:33:07,527 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2023-11-12 02:33:07,528 INFO L153 SettingsManager]: * Independence relation used for large block encoding in concurrent analysis=SYNTACTIC [2023-11-12 02:33:07,528 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_e0c54d7e-3715-4ac8-8647-fe59e51db918/bin/uautomizer-verify-uTZkv6EMXl/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_e0c54d7e-3715-4ac8-8647-fe59e51db918/bin/uautomizer-verify-uTZkv6EMXl Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Witness filename -> witness Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Write witness besides input file -> false Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data specification -> CHECK( init(main()), LTL(G valid-memcleanup) ) 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 -> 68e1c5cf050539b3ee8f058d38ff7af5aea2a400d05e41e0185e4509f45301e0 [2023-11-12 02:33:07,797 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2023-11-12 02:33:07,829 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2023-11-12 02:33:07,831 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2023-11-12 02:33:07,833 INFO L270 PluginConnector]: Initializing CDTParser... [2023-11-12 02:33:07,833 INFO L274 PluginConnector]: CDTParser initialized [2023-11-12 02:33:07,834 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_e0c54d7e-3715-4ac8-8647-fe59e51db918/bin/uautomizer-verify-uTZkv6EMXl/../../sv-benchmarks/c/list-ext3-properties/sll_of_sll_nondet_append-2.i [2023-11-12 02:33:10,972 INFO L533 CDTParser]: Created temporary CDT project at NULL [2023-11-12 02:33:11,233 INFO L384 CDTParser]: Found 1 translation units. [2023-11-12 02:33:11,234 INFO L180 CDTParser]: Scanning /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_e0c54d7e-3715-4ac8-8647-fe59e51db918/sv-benchmarks/c/list-ext3-properties/sll_of_sll_nondet_append-2.i [2023-11-12 02:33:11,261 INFO L427 CDTParser]: About to delete temporary CDT project at /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_e0c54d7e-3715-4ac8-8647-fe59e51db918/bin/uautomizer-verify-uTZkv6EMXl/data/2194e9ee5/0b7809b2577c4c66a3cff09a62c498a9/FLAG96e6a90f4 [2023-11-12 02:33:11,278 INFO L435 CDTParser]: Successfully deleted /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_e0c54d7e-3715-4ac8-8647-fe59e51db918/bin/uautomizer-verify-uTZkv6EMXl/data/2194e9ee5/0b7809b2577c4c66a3cff09a62c498a9 [2023-11-12 02:33:11,281 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2023-11-12 02:33:11,282 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2023-11-12 02:33:11,284 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2023-11-12 02:33:11,284 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2023-11-12 02:33:11,290 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2023-11-12 02:33:11,290 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 12.11 02:33:11" (1/1) ... [2023-11-12 02:33:11,291 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@1c7f74be and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.11 02:33:11, skipping insertion in model container [2023-11-12 02:33:11,292 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 12.11 02:33:11" (1/1) ... [2023-11-12 02:33:11,342 INFO L177 MainTranslator]: Built tables and reachable declarations [2023-11-12 02:33:11,675 INFO L209 PostProcessor]: Analyzing one entry point: main [2023-11-12 02:33:11,686 INFO L202 MainTranslator]: Completed pre-run [2023-11-12 02:33:11,735 INFO L209 PostProcessor]: Analyzing one entry point: main [2023-11-12 02:33:11,770 INFO L206 MainTranslator]: Completed translation [2023-11-12 02:33:11,771 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.11 02:33:11 WrapperNode [2023-11-12 02:33:11,771 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2023-11-12 02:33:11,772 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2023-11-12 02:33:11,772 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2023-11-12 02:33:11,773 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2023-11-12 02:33:11,781 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.11 02:33:11" (1/1) ... [2023-11-12 02:33:11,796 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.11 02:33:11" (1/1) ... [2023-11-12 02:33:11,826 INFO L138 Inliner]: procedures = 129, calls = 41, calls flagged for inlining = 7, calls inlined = 7, statements flattened = 187 [2023-11-12 02:33:11,826 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2023-11-12 02:33:11,827 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2023-11-12 02:33:11,827 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2023-11-12 02:33:11,827 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2023-11-12 02:33:11,837 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.11 02:33:11" (1/1) ... [2023-11-12 02:33:11,837 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.11 02:33:11" (1/1) ... [2023-11-12 02:33:11,842 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.11 02:33:11" (1/1) ... [2023-11-12 02:33:11,842 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.11 02:33:11" (1/1) ... [2023-11-12 02:33:11,852 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.11 02:33:11" (1/1) ... [2023-11-12 02:33:11,857 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.11 02:33:11" (1/1) ... [2023-11-12 02:33:11,860 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.11 02:33:11" (1/1) ... [2023-11-12 02:33:11,862 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.11 02:33:11" (1/1) ... [2023-11-12 02:33:11,866 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2023-11-12 02:33:11,867 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2023-11-12 02:33:11,867 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2023-11-12 02:33:11,867 INFO L274 PluginConnector]: RCFGBuilder initialized [2023-11-12 02:33:11,868 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.11 02:33:11" (1/1) ... [2023-11-12 02:33:11,879 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2023-11-12 02:33:11,892 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_e0c54d7e-3715-4ac8-8647-fe59e51db918/bin/uautomizer-verify-uTZkv6EMXl/z3 [2023-11-12 02:33:11,911 INFO L229 MonitoredProcess]: Starting monitored process 1 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_e0c54d7e-3715-4ac8-8647-fe59e51db918/bin/uautomizer-verify-uTZkv6EMXl/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (exit command is (exit), workingDir is null) [2023-11-12 02:33:11,945 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_e0c54d7e-3715-4ac8-8647-fe59e51db918/bin/uautomizer-verify-uTZkv6EMXl/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (1)] Waiting until timeout for monitored process [2023-11-12 02:33:11,957 INFO L130 BoogieDeclarations]: Found specification of procedure myexit [2023-11-12 02:33:11,957 INFO L138 BoogieDeclarations]: Found implementation of procedure myexit [2023-11-12 02:33:11,958 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnHeap [2023-11-12 02:33:11,958 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2023-11-12 02:33:11,958 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2023-11-12 02:33:11,958 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$ [2023-11-12 02:33:11,958 INFO L130 BoogieDeclarations]: Found specification of procedure sll_append [2023-11-12 02:33:11,959 INFO L138 BoogieDeclarations]: Found implementation of procedure sll_append [2023-11-12 02:33:11,959 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$ [2023-11-12 02:33:11,959 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2023-11-12 02:33:11,959 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~$Pointer$ [2023-11-12 02:33:11,960 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2023-11-12 02:33:11,960 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2023-11-12 02:33:11,960 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2023-11-12 02:33:12,121 INFO L236 CfgBuilder]: Building ICFG [2023-11-12 02:33:12,124 INFO L262 CfgBuilder]: Building CFG for each procedure with an implementation [2023-11-12 02:33:12,176 INFO L770 $ProcedureCfgBuilder]: dead code at ProgramPoint myexitFINAL: assume true; [2023-11-12 02:33:12,492 INFO L277 CfgBuilder]: Performing block encoding [2023-11-12 02:33:12,504 INFO L297 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2023-11-12 02:33:12,507 INFO L302 CfgBuilder]: Removed 9 assume(true) statements. [2023-11-12 02:33:12,510 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 12.11 02:33:12 BoogieIcfgContainer [2023-11-12 02:33:12,510 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2023-11-12 02:33:12,515 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2023-11-12 02:33:12,516 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2023-11-12 02:33:12,520 INFO L274 PluginConnector]: TraceAbstraction initialized [2023-11-12 02:33:12,521 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 12.11 02:33:11" (1/3) ... [2023-11-12 02:33:12,522 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@78ecd41e and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 12.11 02:33:12, skipping insertion in model container [2023-11-12 02:33:12,522 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.11 02:33:11" (2/3) ... [2023-11-12 02:33:12,523 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@78ecd41e and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 12.11 02:33:12, skipping insertion in model container [2023-11-12 02:33:12,523 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 12.11 02:33:12" (3/3) ... [2023-11-12 02:33:12,525 INFO L112 eAbstractionObserver]: Analyzing ICFG sll_of_sll_nondet_append-2.i [2023-11-12 02:33:12,549 INFO L204 ceAbstractionStarter]: Automizer settings: Hoare:false NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2023-11-12 02:33:12,549 INFO L163 ceAbstractionStarter]: Applying trace abstraction to program that has 2 error locations. [2023-11-12 02:33:12,598 INFO L356 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2023-11-12 02:33:12,605 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;@6cd93816, mLbeIndependenceSettings=[IndependenceType=SYNTACTIC, AbstractionType=NONE, UseConditional=, UseSemiCommutativity=, Solver=, SolverTimeout=] [2023-11-12 02:33:12,606 INFO L358 AbstractCegarLoop]: Starting to check reachability of 2 error locations. [2023-11-12 02:33:12,610 INFO L276 IsEmpty]: Start isEmpty. Operand has 55 states, 47 states have (on average 1.6170212765957446) internal successors, (76), 50 states have internal predecessors, (76), 4 states have call successors, (4), 2 states have call predecessors, (4), 1 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2023-11-12 02:33:12,620 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 21 [2023-11-12 02:33:12,621 INFO L187 NwaCegarLoop]: Found error trace [2023-11-12 02:33:12,622 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] [2023-11-12 02:33:12,622 INFO L420 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_LEAK === [ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_LEAK] === [2023-11-12 02:33:12,638 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-12 02:33:12,638 INFO L85 PathProgramCache]: Analyzing trace with hash -165227221, now seen corresponding path program 1 times [2023-11-12 02:33:12,649 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-12 02:33:12,649 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1951552585] [2023-11-12 02:33:12,650 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-12 02:33:12,650 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-12 02:33:12,869 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-12 02:33:13,015 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2023-11-12 02:33:13,032 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-12 02:33:13,056 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-12 02:33:13,057 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-12 02:33:13,057 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1951552585] [2023-11-12 02:33:13,058 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1951552585] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-12 02:33:13,058 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-12 02:33:13,058 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2023-11-12 02:33:13,060 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [364164265] [2023-11-12 02:33:13,061 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-12 02:33:13,065 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2023-11-12 02:33:13,066 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-12 02:33:13,098 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2023-11-12 02:33:13,099 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2023-11-12 02:33:13,102 INFO L87 Difference]: Start difference. First operand has 55 states, 47 states have (on average 1.6170212765957446) internal successors, (76), 50 states have internal predecessors, (76), 4 states have call successors, (4), 2 states have call predecessors, (4), 1 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) Second operand has 3 states, 3 states have (on average 6.0) internal successors, (18), 2 states have internal predecessors, (18), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2023-11-12 02:33:13,180 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-11-12 02:33:13,181 INFO L93 Difference]: Finished difference Result 54 states and 70 transitions. [2023-11-12 02:33:13,182 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2023-11-12 02:33:13,183 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 6.0) internal successors, (18), 2 states have internal predecessors, (18), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 20 [2023-11-12 02:33:13,184 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-11-12 02:33:13,191 INFO L225 Difference]: With dead ends: 54 [2023-11-12 02:33:13,191 INFO L226 Difference]: Without dead ends: 48 [2023-11-12 02:33:13,193 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2023-11-12 02:33:13,197 INFO L413 NwaCegarLoop]: 67 mSDtfsCounter, 2 mSDsluCounter, 42 mSDsCounter, 0 mSdLazyCounter, 25 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 2 SdHoareTripleChecker+Valid, 109 SdHoareTripleChecker+Invalid, 28 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 25 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2023-11-12 02:33:13,198 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [2 Valid, 109 Invalid, 28 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 25 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2023-11-12 02:33:13,215 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 48 states. [2023-11-12 02:33:13,232 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 48 to 48. [2023-11-12 02:33:13,233 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 48 states, 43 states have (on average 1.3488372093023255) internal successors, (58), 44 states have internal predecessors, (58), 2 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2023-11-12 02:33:13,235 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 48 states to 48 states and 62 transitions. [2023-11-12 02:33:13,236 INFO L78 Accepts]: Start accepts. Automaton has 48 states and 62 transitions. Word has length 20 [2023-11-12 02:33:13,236 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-11-12 02:33:13,237 INFO L495 AbstractCegarLoop]: Abstraction has 48 states and 62 transitions. [2023-11-12 02:33:13,237 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 6.0) internal successors, (18), 2 states have internal predecessors, (18), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2023-11-12 02:33:13,237 INFO L276 IsEmpty]: Start isEmpty. Operand 48 states and 62 transitions. [2023-11-12 02:33:13,239 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 21 [2023-11-12 02:33:13,239 INFO L187 NwaCegarLoop]: Found error trace [2023-11-12 02:33:13,239 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] [2023-11-12 02:33:13,239 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2023-11-12 02:33:13,240 INFO L420 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_LEAK === [ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_LEAK] === [2023-11-12 02:33:13,240 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-12 02:33:13,240 INFO L85 PathProgramCache]: Analyzing trace with hash -939358433, now seen corresponding path program 1 times [2023-11-12 02:33:13,241 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-12 02:33:13,241 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [523987184] [2023-11-12 02:33:13,241 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-12 02:33:13,241 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-12 02:33:13,291 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-12 02:33:13,466 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2023-11-12 02:33:13,486 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-12 02:33:13,513 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-12 02:33:13,513 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-12 02:33:13,513 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [523987184] [2023-11-12 02:33:13,513 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [523987184] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-12 02:33:13,514 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-12 02:33:13,514 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2023-11-12 02:33:13,514 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1095474535] [2023-11-12 02:33:13,514 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-12 02:33:13,515 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2023-11-12 02:33:13,516 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-12 02:33:13,516 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2023-11-12 02:33:13,517 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2023-11-12 02:33:13,517 INFO L87 Difference]: Start difference. First operand 48 states and 62 transitions. Second operand has 4 states, 4 states have (on average 4.5) internal successors, (18), 3 states have internal predecessors, (18), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2023-11-12 02:33:13,615 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-11-12 02:33:13,615 INFO L93 Difference]: Finished difference Result 55 states and 72 transitions. [2023-11-12 02:33:13,615 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2023-11-12 02:33:13,616 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 4.5) internal successors, (18), 3 states have internal predecessors, (18), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 20 [2023-11-12 02:33:13,616 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-11-12 02:33:13,617 INFO L225 Difference]: With dead ends: 55 [2023-11-12 02:33:13,617 INFO L226 Difference]: Without dead ends: 55 [2023-11-12 02:33:13,622 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 3 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-12 02:33:13,623 INFO L413 NwaCegarLoop]: 59 mSDtfsCounter, 7 mSDsluCounter, 84 mSDsCounter, 0 mSdLazyCounter, 40 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 8 SdHoareTripleChecker+Valid, 143 SdHoareTripleChecker+Invalid, 43 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 40 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2023-11-12 02:33:13,624 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [8 Valid, 143 Invalid, 43 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 40 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2023-11-12 02:33:13,627 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 55 states. [2023-11-12 02:33:13,633 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 55 to 49. [2023-11-12 02:33:13,633 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 49 states, 44 states have (on average 1.3409090909090908) internal successors, (59), 45 states have internal predecessors, (59), 2 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2023-11-12 02:33:13,635 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 49 states to 49 states and 63 transitions. [2023-11-12 02:33:13,635 INFO L78 Accepts]: Start accepts. Automaton has 49 states and 63 transitions. Word has length 20 [2023-11-12 02:33:13,635 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-11-12 02:33:13,636 INFO L495 AbstractCegarLoop]: Abstraction has 49 states and 63 transitions. [2023-11-12 02:33:13,636 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 4.5) internal successors, (18), 3 states have internal predecessors, (18), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2023-11-12 02:33:13,636 INFO L276 IsEmpty]: Start isEmpty. Operand 49 states and 63 transitions. [2023-11-12 02:33:13,637 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2023-11-12 02:33:13,637 INFO L187 NwaCegarLoop]: Found error trace [2023-11-12 02:33:13,638 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] [2023-11-12 02:33:13,638 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2023-11-12 02:33:13,638 INFO L420 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_LEAK === [ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_LEAK] === [2023-11-12 02:33:13,639 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-12 02:33:13,639 INFO L85 PathProgramCache]: Analyzing trace with hash -1599016021, now seen corresponding path program 1 times [2023-11-12 02:33:13,639 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-12 02:33:13,639 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1160111484] [2023-11-12 02:33:13,640 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-12 02:33:13,640 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-12 02:33:13,669 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-12 02:33:13,805 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 8 [2023-11-12 02:33:13,817 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-12 02:33:13,827 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-11-12 02:33:13,828 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-12 02:33:13,828 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1160111484] [2023-11-12 02:33:13,828 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1160111484] provided 0 perfect and 1 imperfect interpolant sequences [2023-11-12 02:33:13,829 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [786442056] [2023-11-12 02:33:13,829 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-12 02:33:13,829 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-11-12 02:33:13,829 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_e0c54d7e-3715-4ac8-8647-fe59e51db918/bin/uautomizer-verify-uTZkv6EMXl/z3 [2023-11-12 02:33:13,833 INFO L229 MonitoredProcess]: Starting monitored process 2 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_e0c54d7e-3715-4ac8-8647-fe59e51db918/bin/uautomizer-verify-uTZkv6EMXl/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2023-11-12 02:33:13,836 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_e0c54d7e-3715-4ac8-8647-fe59e51db918/bin/uautomizer-verify-uTZkv6EMXl/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Waiting until timeout for monitored process [2023-11-12 02:33:13,991 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-12 02:33:13,997 INFO L262 TraceCheckSpWp]: Trace formula consists of 198 conjuncts, 5 conjunts are in the unsatisfiable core [2023-11-12 02:33:14,006 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-11-12 02:33:14,131 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-11-12 02:33:14,132 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2023-11-12 02:33:14,178 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-11-12 02:33:14,178 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [786442056] provided 0 perfect and 2 imperfect interpolant sequences [2023-11-12 02:33:14,178 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2023-11-12 02:33:14,179 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [5, 4, 4] total 8 [2023-11-12 02:33:14,179 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [897391157] [2023-11-12 02:33:14,179 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2023-11-12 02:33:14,180 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2023-11-12 02:33:14,180 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-12 02:33:14,181 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2023-11-12 02:33:14,181 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=22, Invalid=34, Unknown=0, NotChecked=0, Total=56 [2023-11-12 02:33:14,181 INFO L87 Difference]: Start difference. First operand 49 states and 63 transitions. Second operand has 8 states, 8 states have (on average 5.875) internal successors, (47), 7 states have internal predecessors, (47), 1 states have call successors, (3), 3 states have call predecessors, (3), 2 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) [2023-11-12 02:33:14,305 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-11-12 02:33:14,305 INFO L93 Difference]: Finished difference Result 78 states and 99 transitions. [2023-11-12 02:33:14,306 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2023-11-12 02:33:14,306 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 8 states have (on average 5.875) internal successors, (47), 7 states have internal predecessors, (47), 1 states have call successors, (3), 3 states have call predecessors, (3), 2 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) Word has length 25 [2023-11-12 02:33:14,306 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-11-12 02:33:14,308 INFO L225 Difference]: With dead ends: 78 [2023-11-12 02:33:14,308 INFO L226 Difference]: Without dead ends: 78 [2023-11-12 02:33:14,308 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 54 GetRequests, 47 SyntacticMatches, 1 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 13 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=22, Invalid=34, Unknown=0, NotChecked=0, Total=56 [2023-11-12 02:33:14,309 INFO L413 NwaCegarLoop]: 65 mSDtfsCounter, 47 mSDsluCounter, 142 mSDsCounter, 0 mSdLazyCounter, 81 mSolverCounterSat, 11 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 50 SdHoareTripleChecker+Valid, 207 SdHoareTripleChecker+Invalid, 92 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 11 IncrementalHoareTripleChecker+Valid, 81 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2023-11-12 02:33:14,310 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [50 Valid, 207 Invalid, 92 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [11 Valid, 81 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2023-11-12 02:33:14,311 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 78 states. [2023-11-12 02:33:14,317 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 78 to 66. [2023-11-12 02:33:14,318 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 66 states, 59 states have (on average 1.3389830508474576) internal successors, (79), 60 states have internal predecessors, (79), 4 states have call successors, (4), 1 states have call predecessors, (4), 1 states have return successors, (4), 4 states have call predecessors, (4), 4 states have call successors, (4) [2023-11-12 02:33:14,319 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 66 states to 66 states and 87 transitions. [2023-11-12 02:33:14,320 INFO L78 Accepts]: Start accepts. Automaton has 66 states and 87 transitions. Word has length 25 [2023-11-12 02:33:14,320 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-11-12 02:33:14,320 INFO L495 AbstractCegarLoop]: Abstraction has 66 states and 87 transitions. [2023-11-12 02:33:14,320 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 5.875) internal successors, (47), 7 states have internal predecessors, (47), 1 states have call successors, (3), 3 states have call predecessors, (3), 2 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) [2023-11-12 02:33:14,321 INFO L276 IsEmpty]: Start isEmpty. Operand 66 states and 87 transitions. [2023-11-12 02:33:14,322 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 36 [2023-11-12 02:33:14,323 INFO L187 NwaCegarLoop]: Found error trace [2023-11-12 02:33:14,323 INFO L195 NwaCegarLoop]: trace histogram [3, 3, 3, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-11-12 02:33:14,334 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_e0c54d7e-3715-4ac8-8647-fe59e51db918/bin/uautomizer-verify-uTZkv6EMXl/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Forceful destruction successful, exit code 0 [2023-11-12 02:33:14,528 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2,2 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_e0c54d7e-3715-4ac8-8647-fe59e51db918/bin/uautomizer-verify-uTZkv6EMXl/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-11-12 02:33:14,529 INFO L420 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_LEAK === [ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_LEAK] === [2023-11-12 02:33:14,529 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-12 02:33:14,530 INFO L85 PathProgramCache]: Analyzing trace with hash 2125835307, now seen corresponding path program 2 times [2023-11-12 02:33:14,530 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-12 02:33:14,530 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [42183134] [2023-11-12 02:33:14,530 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-12 02:33:14,531 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-12 02:33:14,564 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-12 02:33:14,691 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 18 [2023-11-12 02:33:14,704 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-12 02:33:14,797 INFO L134 CoverageAnalysis]: Checked inductivity of 18 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 18 trivial. 0 not checked. [2023-11-12 02:33:14,798 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-12 02:33:14,798 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [42183134] [2023-11-12 02:33:14,798 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [42183134] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-12 02:33:14,798 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-12 02:33:14,798 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2023-11-12 02:33:14,799 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [171628032] [2023-11-12 02:33:14,799 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-12 02:33:14,799 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2023-11-12 02:33:14,799 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-12 02:33:14,800 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2023-11-12 02:33:14,800 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2023-11-12 02:33:14,800 INFO L87 Difference]: Start difference. First operand 66 states and 87 transitions. Second operand has 7 states, 7 states have (on average 3.2857142857142856) internal successors, (23), 6 states have internal predecessors, (23), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2023-11-12 02:33:14,925 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-11-12 02:33:14,925 INFO L93 Difference]: Finished difference Result 78 states and 104 transitions. [2023-11-12 02:33:14,926 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2023-11-12 02:33:14,926 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 3.2857142857142856) internal successors, (23), 6 states have internal predecessors, (23), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 35 [2023-11-12 02:33:14,927 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-11-12 02:33:14,929 INFO L225 Difference]: With dead ends: 78 [2023-11-12 02:33:14,929 INFO L226 Difference]: Without dead ends: 78 [2023-11-12 02:33:14,930 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=26, Invalid=64, Unknown=0, NotChecked=0, Total=90 [2023-11-12 02:33:14,931 INFO L413 NwaCegarLoop]: 55 mSDtfsCounter, 55 mSDsluCounter, 205 mSDsCounter, 0 mSdLazyCounter, 58 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 58 SdHoareTripleChecker+Valid, 260 SdHoareTripleChecker+Invalid, 59 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 58 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2023-11-12 02:33:14,931 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [58 Valid, 260 Invalid, 59 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 58 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2023-11-12 02:33:14,932 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 78 states. [2023-11-12 02:33:14,939 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 78 to 76. [2023-11-12 02:33:14,940 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 76 states, 68 states have (on average 1.338235294117647) internal successors, (91), 70 states have internal predecessors, (91), 4 states have call successors, (4), 1 states have call predecessors, (4), 2 states have return successors, (7), 4 states have call predecessors, (7), 4 states have call successors, (7) [2023-11-12 02:33:14,941 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 76 states to 76 states and 102 transitions. [2023-11-12 02:33:14,941 INFO L78 Accepts]: Start accepts. Automaton has 76 states and 102 transitions. Word has length 35 [2023-11-12 02:33:14,942 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-11-12 02:33:14,942 INFO L495 AbstractCegarLoop]: Abstraction has 76 states and 102 transitions. [2023-11-12 02:33:14,942 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 3.2857142857142856) internal successors, (23), 6 states have internal predecessors, (23), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2023-11-12 02:33:14,942 INFO L276 IsEmpty]: Start isEmpty. Operand 76 states and 102 transitions. [2023-11-12 02:33:14,944 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 39 [2023-11-12 02:33:14,944 INFO L187 NwaCegarLoop]: Found error trace [2023-11-12 02:33:14,945 INFO L195 NwaCegarLoop]: trace histogram [3, 3, 3, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-11-12 02:33:14,945 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2023-11-12 02:33:14,945 INFO L420 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_LEAK === [ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_LEAK] === [2023-11-12 02:33:14,945 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-12 02:33:14,946 INFO L85 PathProgramCache]: Analyzing trace with hash 1159237773, now seen corresponding path program 1 times [2023-11-12 02:33:14,946 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-12 02:33:14,946 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [105771871] [2023-11-12 02:33:14,946 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-12 02:33:14,946 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-12 02:33:14,977 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-12 02:33:15,095 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 18 [2023-11-12 02:33:15,109 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-12 02:33:15,219 INFO L134 CoverageAnalysis]: Checked inductivity of 19 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 18 trivial. 0 not checked. [2023-11-12 02:33:15,219 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-12 02:33:15,219 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [105771871] [2023-11-12 02:33:15,220 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [105771871] provided 0 perfect and 1 imperfect interpolant sequences [2023-11-12 02:33:15,220 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1887673596] [2023-11-12 02:33:15,220 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-12 02:33:15,220 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-11-12 02:33:15,220 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_e0c54d7e-3715-4ac8-8647-fe59e51db918/bin/uautomizer-verify-uTZkv6EMXl/z3 [2023-11-12 02:33:15,235 INFO L229 MonitoredProcess]: Starting monitored process 3 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_e0c54d7e-3715-4ac8-8647-fe59e51db918/bin/uautomizer-verify-uTZkv6EMXl/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2023-11-12 02:33:15,263 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_e0c54d7e-3715-4ac8-8647-fe59e51db918/bin/uautomizer-verify-uTZkv6EMXl/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Waiting until timeout for monitored process [2023-11-12 02:33:15,387 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-12 02:33:15,389 INFO L262 TraceCheckSpWp]: Trace formula consists of 252 conjuncts, 9 conjunts are in the unsatisfiable core [2023-11-12 02:33:15,393 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-11-12 02:33:15,495 INFO L134 CoverageAnalysis]: Checked inductivity of 19 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 18 trivial. 0 not checked. [2023-11-12 02:33:15,495 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2023-11-12 02:33:15,759 INFO L134 CoverageAnalysis]: Checked inductivity of 19 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 18 trivial. 0 not checked. [2023-11-12 02:33:15,759 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1887673596] provided 0 perfect and 2 imperfect interpolant sequences [2023-11-12 02:33:15,760 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2023-11-12 02:33:15,760 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [8, 7, 7] total 14 [2023-11-12 02:33:15,760 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [793774264] [2023-11-12 02:33:15,760 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2023-11-12 02:33:15,762 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 14 states [2023-11-12 02:33:15,762 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-12 02:33:15,765 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 14 interpolants. [2023-11-12 02:33:15,766 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=41, Invalid=141, Unknown=0, NotChecked=0, Total=182 [2023-11-12 02:33:15,768 INFO L87 Difference]: Start difference. First operand 76 states and 102 transitions. Second operand has 14 states, 14 states have (on average 3.2857142857142856) internal successors, (46), 13 states have internal predecessors, (46), 2 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (2), 1 states have call predecessors, (2), 2 states have call successors, (2) [2023-11-12 02:33:15,938 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-11-12 02:33:15,938 INFO L93 Difference]: Finished difference Result 90 states and 121 transitions. [2023-11-12 02:33:15,939 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2023-11-12 02:33:15,939 INFO L78 Accepts]: Start accepts. Automaton has has 14 states, 14 states have (on average 3.2857142857142856) internal successors, (46), 13 states have internal predecessors, (46), 2 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (2), 1 states have call predecessors, (2), 2 states have call successors, (2) Word has length 38 [2023-11-12 02:33:15,940 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-11-12 02:33:15,943 INFO L225 Difference]: With dead ends: 90 [2023-11-12 02:33:15,946 INFO L226 Difference]: Without dead ends: 90 [2023-11-12 02:33:15,947 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 88 GetRequests, 69 SyntacticMatches, 1 SemanticMatches, 18 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 44 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=104, Invalid=276, Unknown=0, NotChecked=0, Total=380 [2023-11-12 02:33:15,948 INFO L413 NwaCegarLoop]: 55 mSDtfsCounter, 71 mSDsluCounter, 291 mSDsCounter, 0 mSdLazyCounter, 77 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 74 SdHoareTripleChecker+Valid, 346 SdHoareTripleChecker+Invalid, 79 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 77 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2023-11-12 02:33:15,948 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [74 Valid, 346 Invalid, 79 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 77 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2023-11-12 02:33:15,951 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 90 states. [2023-11-12 02:33:15,963 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 90 to 79. [2023-11-12 02:33:15,966 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 79 states, 71 states have (on average 1.3380281690140845) internal successors, (95), 73 states have internal predecessors, (95), 4 states have call successors, (4), 1 states have call predecessors, (4), 2 states have return successors, (7), 4 states have call predecessors, (7), 4 states have call successors, (7) [2023-11-12 02:33:15,969 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 79 states to 79 states and 106 transitions. [2023-11-12 02:33:15,969 INFO L78 Accepts]: Start accepts. Automaton has 79 states and 106 transitions. Word has length 38 [2023-11-12 02:33:15,969 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-11-12 02:33:15,975 INFO L495 AbstractCegarLoop]: Abstraction has 79 states and 106 transitions. [2023-11-12 02:33:15,976 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 14 states, 14 states have (on average 3.2857142857142856) internal successors, (46), 13 states have internal predecessors, (46), 2 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (2), 1 states have call predecessors, (2), 2 states have call successors, (2) [2023-11-12 02:33:15,977 INFO L276 IsEmpty]: Start isEmpty. Operand 79 states and 106 transitions. [2023-11-12 02:33:15,979 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 42 [2023-11-12 02:33:15,982 INFO L187 NwaCegarLoop]: Found error trace [2023-11-12 02:33:15,982 INFO L195 NwaCegarLoop]: trace histogram [3, 3, 3, 3, 3, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-11-12 02:33:15,993 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_e0c54d7e-3715-4ac8-8647-fe59e51db918/bin/uautomizer-verify-uTZkv6EMXl/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Ended with exit code 0 [2023-11-12 02:33:16,188 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4,3 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_e0c54d7e-3715-4ac8-8647-fe59e51db918/bin/uautomizer-verify-uTZkv6EMXl/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-11-12 02:33:16,188 INFO L420 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_LEAK === [ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_LEAK] === [2023-11-12 02:33:16,189 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-12 02:33:16,189 INFO L85 PathProgramCache]: Analyzing trace with hash -1287145237, now seen corresponding path program 2 times [2023-11-12 02:33:16,189 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-12 02:33:16,189 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1365092878] [2023-11-12 02:33:16,189 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-12 02:33:16,190 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-12 02:33:16,219 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-12 02:33:16,342 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 18 [2023-11-12 02:33:16,358 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-12 02:33:16,522 INFO L134 CoverageAnalysis]: Checked inductivity of 23 backedges. 0 proven. 5 refuted. 0 times theorem prover too weak. 18 trivial. 0 not checked. [2023-11-12 02:33:16,523 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-12 02:33:16,523 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1365092878] [2023-11-12 02:33:16,523 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1365092878] provided 0 perfect and 1 imperfect interpolant sequences [2023-11-12 02:33:16,523 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [560859313] [2023-11-12 02:33:16,524 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2023-11-12 02:33:16,524 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-11-12 02:33:16,524 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_e0c54d7e-3715-4ac8-8647-fe59e51db918/bin/uautomizer-verify-uTZkv6EMXl/z3 [2023-11-12 02:33:16,541 INFO L229 MonitoredProcess]: Starting monitored process 4 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_e0c54d7e-3715-4ac8-8647-fe59e51db918/bin/uautomizer-verify-uTZkv6EMXl/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2023-11-12 02:33:16,556 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_e0c54d7e-3715-4ac8-8647-fe59e51db918/bin/uautomizer-verify-uTZkv6EMXl/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Waiting until timeout for monitored process [2023-11-12 02:33:16,681 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s) [2023-11-12 02:33:16,681 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2023-11-12 02:33:16,683 INFO L262 TraceCheckSpWp]: Trace formula consists of 187 conjuncts, 23 conjunts are in the unsatisfiable core [2023-11-12 02:33:16,686 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-11-12 02:33:16,938 INFO L351 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 1 [2023-11-12 02:33:17,001 INFO L351 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 8 [2023-11-12 02:33:17,024 INFO L134 CoverageAnalysis]: Checked inductivity of 23 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 23 trivial. 0 not checked. [2023-11-12 02:33:17,025 INFO L323 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2023-11-12 02:33:17,025 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [560859313] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-12 02:33:17,025 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2023-11-12 02:33:17,025 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [9] total 16 [2023-11-12 02:33:17,025 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [278771843] [2023-11-12 02:33:17,026 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-12 02:33:17,026 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2023-11-12 02:33:17,026 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-12 02:33:17,027 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2023-11-12 02:33:17,027 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=33, Invalid=207, Unknown=0, NotChecked=0, Total=240 [2023-11-12 02:33:17,027 INFO L87 Difference]: Start difference. First operand 79 states and 106 transitions. Second operand has 9 states, 9 states have (on average 2.888888888888889) internal successors, (26), 8 states have internal predecessors, (26), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2023-11-12 02:33:17,308 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-11-12 02:33:17,308 INFO L93 Difference]: Finished difference Result 154 states and 221 transitions. [2023-11-12 02:33:17,308 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2023-11-12 02:33:17,309 INFO L78 Accepts]: Start accepts. Automaton has has 9 states, 9 states have (on average 2.888888888888889) internal successors, (26), 8 states have internal predecessors, (26), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 41 [2023-11-12 02:33:17,309 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-11-12 02:33:17,311 INFO L225 Difference]: With dead ends: 154 [2023-11-12 02:33:17,311 INFO L226 Difference]: Without dead ends: 154 [2023-11-12 02:33:17,311 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 54 GetRequests, 35 SyntacticMatches, 0 SemanticMatches, 19 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 30 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=56, Invalid=364, Unknown=0, NotChecked=0, Total=420 [2023-11-12 02:33:17,312 INFO L413 NwaCegarLoop]: 61 mSDtfsCounter, 128 mSDsluCounter, 323 mSDsCounter, 0 mSdLazyCounter, 169 mSolverCounterSat, 5 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 130 SdHoareTripleChecker+Valid, 384 SdHoareTripleChecker+Invalid, 174 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 5 IncrementalHoareTripleChecker+Valid, 169 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2023-11-12 02:33:17,313 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [130 Valid, 384 Invalid, 174 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [5 Valid, 169 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2023-11-12 02:33:17,314 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 154 states. [2023-11-12 02:33:17,323 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 154 to 95. [2023-11-12 02:33:17,324 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 95 states, 86 states have (on average 1.3372093023255813) internal successors, (115), 88 states have internal predecessors, (115), 4 states have call successors, (4), 1 states have call predecessors, (4), 3 states have return successors, (11), 5 states have call predecessors, (11), 4 states have call successors, (11) [2023-11-12 02:33:17,325 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 95 states to 95 states and 130 transitions. [2023-11-12 02:33:17,325 INFO L78 Accepts]: Start accepts. Automaton has 95 states and 130 transitions. Word has length 41 [2023-11-12 02:33:17,325 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-11-12 02:33:17,325 INFO L495 AbstractCegarLoop]: Abstraction has 95 states and 130 transitions. [2023-11-12 02:33:17,326 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 9 states have (on average 2.888888888888889) internal successors, (26), 8 states have internal predecessors, (26), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2023-11-12 02:33:17,326 INFO L276 IsEmpty]: Start isEmpty. Operand 95 states and 130 transitions. [2023-11-12 02:33:17,327 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 42 [2023-11-12 02:33:17,328 INFO L187 NwaCegarLoop]: Found error trace [2023-11-12 02:33:17,328 INFO L195 NwaCegarLoop]: trace histogram [3, 3, 3, 3, 3, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-11-12 02:33:17,338 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_e0c54d7e-3715-4ac8-8647-fe59e51db918/bin/uautomizer-verify-uTZkv6EMXl/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Ended with exit code 0 [2023-11-12 02:33:17,533 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5,4 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_e0c54d7e-3715-4ac8-8647-fe59e51db918/bin/uautomizer-verify-uTZkv6EMXl/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-11-12 02:33:17,534 INFO L420 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK === [ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_LEAK] === [2023-11-12 02:33:17,534 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-12 02:33:17,534 INFO L85 PathProgramCache]: Analyzing trace with hash -1286797143, now seen corresponding path program 1 times [2023-11-12 02:33:17,534 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-12 02:33:17,535 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [609333780] [2023-11-12 02:33:17,535 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-12 02:33:17,535 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-12 02:33:17,568 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-12 02:33:17,651 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 18 [2023-11-12 02:33:17,666 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-12 02:33:17,684 INFO L134 CoverageAnalysis]: Checked inductivity of 23 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 23 trivial. 0 not checked. [2023-11-12 02:33:17,685 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-12 02:33:17,685 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [609333780] [2023-11-12 02:33:17,685 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [609333780] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-12 02:33:17,685 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-12 02:33:17,686 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2023-11-12 02:33:17,686 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2028263367] [2023-11-12 02:33:17,686 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-12 02:33:17,686 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2023-11-12 02:33:17,687 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-12 02:33:17,687 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2023-11-12 02:33:17,687 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2023-11-12 02:33:17,688 INFO L87 Difference]: Start difference. First operand 95 states and 130 transitions. Second operand has 5 states, 5 states have (on average 5.2) internal successors, (26), 4 states have internal predecessors, (26), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2023-11-12 02:33:17,799 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-11-12 02:33:17,799 INFO L93 Difference]: Finished difference Result 128 states and 173 transitions. [2023-11-12 02:33:17,800 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2023-11-12 02:33:17,800 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 5.2) internal successors, (26), 4 states have internal predecessors, (26), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 41 [2023-11-12 02:33:17,801 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-11-12 02:33:17,804 INFO L225 Difference]: With dead ends: 128 [2023-11-12 02:33:17,804 INFO L226 Difference]: Without dead ends: 128 [2023-11-12 02:33:17,805 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2023-11-12 02:33:17,805 INFO L413 NwaCegarLoop]: 58 mSDtfsCounter, 86 mSDsluCounter, 96 mSDsCounter, 0 mSdLazyCounter, 69 mSolverCounterSat, 5 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 87 SdHoareTripleChecker+Valid, 154 SdHoareTripleChecker+Invalid, 74 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 5 IncrementalHoareTripleChecker+Valid, 69 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2023-11-12 02:33:17,806 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [87 Valid, 154 Invalid, 74 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [5 Valid, 69 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2023-11-12 02:33:17,807 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 128 states. [2023-11-12 02:33:17,818 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 128 to 95. [2023-11-12 02:33:17,819 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 95 states, 86 states have (on average 1.3372093023255813) internal successors, (115), 88 states have internal predecessors, (115), 4 states have call successors, (4), 1 states have call predecessors, (4), 3 states have return successors, (11), 5 states have call predecessors, (11), 4 states have call successors, (11) [2023-11-12 02:33:17,820 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 95 states to 95 states and 130 transitions. [2023-11-12 02:33:17,820 INFO L78 Accepts]: Start accepts. Automaton has 95 states and 130 transitions. Word has length 41 [2023-11-12 02:33:17,820 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-11-12 02:33:17,820 INFO L495 AbstractCegarLoop]: Abstraction has 95 states and 130 transitions. [2023-11-12 02:33:17,821 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 5.2) internal successors, (26), 4 states have internal predecessors, (26), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2023-11-12 02:33:17,821 INFO L276 IsEmpty]: Start isEmpty. Operand 95 states and 130 transitions. [2023-11-12 02:33:17,824 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 45 [2023-11-12 02:33:17,833 INFO L187 NwaCegarLoop]: Found error trace [2023-11-12 02:33:17,834 INFO L195 NwaCegarLoop]: trace histogram [3, 3, 3, 3, 3, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-11-12 02:33:17,834 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2023-11-12 02:33:17,834 INFO L420 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_LEAK === [ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_LEAK] === [2023-11-12 02:33:17,835 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-12 02:33:17,835 INFO L85 PathProgramCache]: Analyzing trace with hash -1159349289, now seen corresponding path program 1 times [2023-11-12 02:33:17,835 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-12 02:33:17,836 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1361118104] [2023-11-12 02:33:17,836 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-12 02:33:17,836 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-12 02:33:17,871 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-12 02:33:18,046 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 18 [2023-11-12 02:33:18,062 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-12 02:33:18,190 INFO L134 CoverageAnalysis]: Checked inductivity of 23 backedges. 0 proven. 5 refuted. 0 times theorem prover too weak. 18 trivial. 0 not checked. [2023-11-12 02:33:18,191 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-12 02:33:18,191 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1361118104] [2023-11-12 02:33:18,191 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1361118104] provided 0 perfect and 1 imperfect interpolant sequences [2023-11-12 02:33:18,191 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [393921694] [2023-11-12 02:33:18,191 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-12 02:33:18,192 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-11-12 02:33:18,192 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_e0c54d7e-3715-4ac8-8647-fe59e51db918/bin/uautomizer-verify-uTZkv6EMXl/z3 [2023-11-12 02:33:18,193 INFO L229 MonitoredProcess]: Starting monitored process 5 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_e0c54d7e-3715-4ac8-8647-fe59e51db918/bin/uautomizer-verify-uTZkv6EMXl/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2023-11-12 02:33:18,216 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_e0c54d7e-3715-4ac8-8647-fe59e51db918/bin/uautomizer-verify-uTZkv6EMXl/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Waiting until timeout for monitored process [2023-11-12 02:33:18,363 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-12 02:33:18,366 INFO L262 TraceCheckSpWp]: Trace formula consists of 289 conjuncts, 10 conjunts are in the unsatisfiable core [2023-11-12 02:33:18,369 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-11-12 02:33:18,463 INFO L134 CoverageAnalysis]: Checked inductivity of 23 backedges. 0 proven. 5 refuted. 0 times theorem prover too weak. 18 trivial. 0 not checked. [2023-11-12 02:33:18,463 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2023-11-12 02:33:18,760 INFO L134 CoverageAnalysis]: Checked inductivity of 23 backedges. 0 proven. 5 refuted. 0 times theorem prover too weak. 18 trivial. 0 not checked. [2023-11-12 02:33:18,761 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [393921694] provided 0 perfect and 2 imperfect interpolant sequences [2023-11-12 02:33:18,761 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2023-11-12 02:33:18,761 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [9, 8, 8] total 15 [2023-11-12 02:33:18,762 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1709144252] [2023-11-12 02:33:18,762 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2023-11-12 02:33:18,763 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 15 states [2023-11-12 02:33:18,763 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-12 02:33:18,767 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 15 interpolants. [2023-11-12 02:33:18,768 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=52, Invalid=158, Unknown=0, NotChecked=0, Total=210 [2023-11-12 02:33:18,768 INFO L87 Difference]: Start difference. First operand 95 states and 130 transitions. Second operand has 15 states, 15 states have (on average 3.2) internal successors, (48), 14 states have internal predecessors, (48), 1 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2023-11-12 02:33:19,003 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-11-12 02:33:19,003 INFO L93 Difference]: Finished difference Result 113 states and 155 transitions. [2023-11-12 02:33:19,004 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2023-11-12 02:33:19,004 INFO L78 Accepts]: Start accepts. Automaton has has 15 states, 15 states have (on average 3.2) internal successors, (48), 14 states have internal predecessors, (48), 1 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 44 [2023-11-12 02:33:19,004 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-11-12 02:33:19,009 INFO L225 Difference]: With dead ends: 113 [2023-11-12 02:33:19,009 INFO L226 Difference]: Without dead ends: 113 [2023-11-12 02:33:19,009 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 103 GetRequests, 80 SyntacticMatches, 2 SemanticMatches, 21 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 68 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=151, Invalid=355, Unknown=0, NotChecked=0, Total=506 [2023-11-12 02:33:19,011 INFO L413 NwaCegarLoop]: 55 mSDtfsCounter, 79 mSDsluCounter, 322 mSDsCounter, 0 mSdLazyCounter, 81 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 82 SdHoareTripleChecker+Valid, 377 SdHoareTripleChecker+Invalid, 83 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 81 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2023-11-12 02:33:19,011 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [82 Valid, 377 Invalid, 83 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 81 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2023-11-12 02:33:19,012 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 113 states. [2023-11-12 02:33:19,031 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 113 to 98. [2023-11-12 02:33:19,032 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 98 states, 89 states have (on average 1.3370786516853932) internal successors, (119), 91 states have internal predecessors, (119), 4 states have call successors, (4), 1 states have call predecessors, (4), 3 states have return successors, (11), 5 states have call predecessors, (11), 4 states have call successors, (11) [2023-11-12 02:33:19,033 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 98 states to 98 states and 134 transitions. [2023-11-12 02:33:19,033 INFO L78 Accepts]: Start accepts. Automaton has 98 states and 134 transitions. Word has length 44 [2023-11-12 02:33:19,033 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-11-12 02:33:19,034 INFO L495 AbstractCegarLoop]: Abstraction has 98 states and 134 transitions. [2023-11-12 02:33:19,034 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 15 states, 15 states have (on average 3.2) internal successors, (48), 14 states have internal predecessors, (48), 1 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2023-11-12 02:33:19,034 INFO L276 IsEmpty]: Start isEmpty. Operand 98 states and 134 transitions. [2023-11-12 02:33:19,035 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 48 [2023-11-12 02:33:19,035 INFO L187 NwaCegarLoop]: Found error trace [2023-11-12 02:33:19,035 INFO L195 NwaCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-11-12 02:33:19,048 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_e0c54d7e-3715-4ac8-8647-fe59e51db918/bin/uautomizer-verify-uTZkv6EMXl/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Forceful destruction successful, exit code 0 [2023-11-12 02:33:19,236 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7,5 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_e0c54d7e-3715-4ac8-8647-fe59e51db918/bin/uautomizer-verify-uTZkv6EMXl/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-11-12 02:33:19,236 INFO L420 AbstractCegarLoop]: === Iteration 9 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_LEAK === [ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_LEAK] === [2023-11-12 02:33:19,237 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-12 02:33:19,237 INFO L85 PathProgramCache]: Analyzing trace with hash -274684491, now seen corresponding path program 2 times [2023-11-12 02:33:19,237 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-12 02:33:19,237 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1300668809] [2023-11-12 02:33:19,237 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-12 02:33:19,237 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-12 02:33:19,279 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-12 02:33:19,748 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 18 [2023-11-12 02:33:19,771 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-12 02:33:20,323 INFO L134 CoverageAnalysis]: Checked inductivity of 30 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 30 trivial. 0 not checked. [2023-11-12 02:33:20,323 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-12 02:33:20,323 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1300668809] [2023-11-12 02:33:20,324 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1300668809] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-12 02:33:20,324 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-12 02:33:20,324 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [12] imperfect sequences [] total 12 [2023-11-12 02:33:20,324 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1858339173] [2023-11-12 02:33:20,325 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-12 02:33:20,325 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 12 states [2023-11-12 02:33:20,325 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-12 02:33:20,326 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2023-11-12 02:33:20,327 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=22, Invalid=110, Unknown=0, NotChecked=0, Total=132 [2023-11-12 02:33:20,327 INFO L87 Difference]: Start difference. First operand 98 states and 134 transitions. Second operand has 12 states, 12 states have (on average 2.4166666666666665) internal successors, (29), 10 states have internal predecessors, (29), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2023-11-12 02:33:21,106 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-11-12 02:33:21,106 INFO L93 Difference]: Finished difference Result 170 states and 247 transitions. [2023-11-12 02:33:21,107 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2023-11-12 02:33:21,107 INFO L78 Accepts]: Start accepts. Automaton has has 12 states, 12 states have (on average 2.4166666666666665) internal successors, (29), 10 states have internal predecessors, (29), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 47 [2023-11-12 02:33:21,107 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-11-12 02:33:21,109 INFO L225 Difference]: With dead ends: 170 [2023-11-12 02:33:21,109 INFO L226 Difference]: Without dead ends: 170 [2023-11-12 02:33:21,109 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 22 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 20 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 38 ImplicationChecksByTransitivity, 0.6s TimeCoverageRelationStatistics Valid=80, Invalid=382, Unknown=0, NotChecked=0, Total=462 [2023-11-12 02:33:21,110 INFO L413 NwaCegarLoop]: 85 mSDtfsCounter, 114 mSDsluCounter, 558 mSDsCounter, 0 mSdLazyCounter, 353 mSolverCounterSat, 8 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 116 SdHoareTripleChecker+Valid, 643 SdHoareTripleChecker+Invalid, 361 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 8 IncrementalHoareTripleChecker+Valid, 353 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2023-11-12 02:33:21,110 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [116 Valid, 643 Invalid, 361 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [8 Valid, 353 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time] [2023-11-12 02:33:21,111 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 170 states. [2023-11-12 02:33:21,120 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 170 to 92. [2023-11-12 02:33:21,121 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 92 states, 83 states have (on average 1.3132530120481927) internal successors, (109), 85 states have internal predecessors, (109), 4 states have call successors, (4), 1 states have call predecessors, (4), 3 states have return successors, (11), 5 states have call predecessors, (11), 4 states have call successors, (11) [2023-11-12 02:33:21,121 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 92 states to 92 states and 124 transitions. [2023-11-12 02:33:21,122 INFO L78 Accepts]: Start accepts. Automaton has 92 states and 124 transitions. Word has length 47 [2023-11-12 02:33:21,122 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-11-12 02:33:21,122 INFO L495 AbstractCegarLoop]: Abstraction has 92 states and 124 transitions. [2023-11-12 02:33:21,122 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 12 states, 12 states have (on average 2.4166666666666665) internal successors, (29), 10 states have internal predecessors, (29), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2023-11-12 02:33:21,123 INFO L276 IsEmpty]: Start isEmpty. Operand 92 states and 124 transitions. [2023-11-12 02:33:21,123 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 50 [2023-11-12 02:33:21,124 INFO L187 NwaCegarLoop]: Found error trace [2023-11-12 02:33:21,124 INFO L195 NwaCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 3, 3, 2, 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-12 02:33:21,124 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2023-11-12 02:33:21,124 INFO L420 AbstractCegarLoop]: === Iteration 10 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_LEAK === [ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_LEAK] === [2023-11-12 02:33:21,125 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-12 02:33:21,125 INFO L85 PathProgramCache]: Analyzing trace with hash 257130064, now seen corresponding path program 1 times [2023-11-12 02:33:21,125 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-12 02:33:21,125 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1291325900] [2023-11-12 02:33:21,125 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-12 02:33:21,126 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-12 02:33:21,161 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-12 02:33:21,560 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 18 [2023-11-12 02:33:21,580 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-12 02:33:22,164 INFO L134 CoverageAnalysis]: Checked inductivity of 32 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 30 trivial. 0 not checked. [2023-11-12 02:33:22,164 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-12 02:33:22,165 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1291325900] [2023-11-12 02:33:22,165 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1291325900] provided 0 perfect and 1 imperfect interpolant sequences [2023-11-12 02:33:22,165 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1083077663] [2023-11-12 02:33:22,165 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-12 02:33:22,165 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-11-12 02:33:22,166 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_e0c54d7e-3715-4ac8-8647-fe59e51db918/bin/uautomizer-verify-uTZkv6EMXl/z3 [2023-11-12 02:33:22,167 INFO L229 MonitoredProcess]: Starting monitored process 6 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_e0c54d7e-3715-4ac8-8647-fe59e51db918/bin/uautomizer-verify-uTZkv6EMXl/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2023-11-12 02:33:22,188 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_e0c54d7e-3715-4ac8-8647-fe59e51db918/bin/uautomizer-verify-uTZkv6EMXl/z3 -smt2 -in SMTLIB2_COMPLIANT=true (6)] Waiting until timeout for monitored process [2023-11-12 02:33:22,364 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-12 02:33:22,367 INFO L262 TraceCheckSpWp]: Trace formula consists of 330 conjuncts, 49 conjunts are in the unsatisfiable core [2023-11-12 02:33:22,378 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-11-12 02:33:22,599 INFO L351 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 7 treesize of output 3 [2023-11-12 02:33:22,604 INFO L351 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 7 treesize of output 3 [2023-11-12 02:33:27,665 WARN L876 $PredicateComparison]: unable to prove that (or (exists ((|sll_append_~new_last~0#1.base| Int)) (and (exists ((|v_sll_append_sll_create_~new_head~0#1.base_32| Int) (v_DerPreprocessor_31 (Array Int Int)) (|v_sll_append_sll_create_~new_head~0#1.base_30| Int) (v_DerPreprocessor_15 (Array Int Int)) (v_DerPreprocessor_16 (Array Int Int)) (v_DerPreprocessor_17 (Array Int Int))) (and (<= (+ |v_sll_append_sll_create_~new_head~0#1.base_32| 1) |c_#StackHeapBarrier|) (not (= |v_sll_append_sll_create_~new_head~0#1.base_32| |sll_append_~new_last~0#1.base|)) (= (select (select (store (store (store |c_old(#memory_$Pointer$.offset)| |v_sll_append_sll_create_~new_head~0#1.base_30| (store (select |c_old(#memory_$Pointer$.offset)| |v_sll_append_sll_create_~new_head~0#1.base_30|) 0 0)) |v_sll_append_sll_create_~new_head~0#1.base_32| v_DerPreprocessor_31) |sll_append_~new_last~0#1.base| v_DerPreprocessor_16) |c_sll_append_#in~head#1.base|) |c_sll_append_#in~head#1.offset|) |c_sll_append_~temp~0#1.offset|) (= (select (select (store (store (store |c_old(#memory_$Pointer$.base)| |v_sll_append_sll_create_~new_head~0#1.base_30| (store (select |c_old(#memory_$Pointer$.base)| |v_sll_append_sll_create_~new_head~0#1.base_30|) 0 0)) |v_sll_append_sll_create_~new_head~0#1.base_32| v_DerPreprocessor_17) |sll_append_~new_last~0#1.base| v_DerPreprocessor_15) |c_sll_append_#in~head#1.base|) |c_sll_append_#in~head#1.offset|) |c_sll_append_~temp~0#1.base|))) (<= (+ |sll_append_~new_last~0#1.base| 1) |c_#StackHeapBarrier|))) (exists ((|sll_append_~new_last~0#1.base| Int)) (and (exists ((|v_sll_append_sll_create_~new_head~0#1.base_31| Int) (|v_sll_append_sll_create_~new_head~0#1.base_30| Int) (v_DerPreprocessor_15 (Array Int Int)) (v_DerPreprocessor_16 (Array Int Int)) (v_DerPreprocessor_28 (Array Int Int)) (v_DerPreprocessor_23 (Array Int Int))) (and (= |c_sll_append_~temp~0#1.offset| (select (select (store (store (store |c_old(#memory_$Pointer$.offset)| |v_sll_append_sll_create_~new_head~0#1.base_30| (store (select |c_old(#memory_$Pointer$.offset)| |v_sll_append_sll_create_~new_head~0#1.base_30|) 0 0)) |v_sll_append_sll_create_~new_head~0#1.base_31| v_DerPreprocessor_28) |sll_append_~new_last~0#1.base| v_DerPreprocessor_16) |c_sll_append_#in~head#1.base|) |c_sll_append_#in~head#1.offset|)) (= |c_sll_append_~temp~0#1.base| (select (select (store (store (store |c_old(#memory_$Pointer$.base)| |v_sll_append_sll_create_~new_head~0#1.base_30| (store (select |c_old(#memory_$Pointer$.base)| |v_sll_append_sll_create_~new_head~0#1.base_30|) 0 0)) |v_sll_append_sll_create_~new_head~0#1.base_31| v_DerPreprocessor_23) |sll_append_~new_last~0#1.base| v_DerPreprocessor_15) |c_sll_append_#in~head#1.base|) |c_sll_append_#in~head#1.offset|)) (not (= |v_sll_append_sll_create_~new_head~0#1.base_31| |sll_append_~new_last~0#1.base|)) (<= (+ |v_sll_append_sll_create_~new_head~0#1.base_31| 1) |c_#StackHeapBarrier|))) (<= (+ |sll_append_~new_last~0#1.base| 1) |c_#StackHeapBarrier|))) (exists ((|sll_append_~new_last~0#1.base| Int)) (and (<= (+ |sll_append_~new_last~0#1.base| 1) |c_#StackHeapBarrier|) (exists ((|v_sll_append_sll_create_~new_head~0#1.base_30| Int) (v_DerPreprocessor_15 (Array Int Int)) (v_DerPreprocessor_16 (Array Int Int))) (and (= (select (select (store (store |c_old(#memory_$Pointer$.base)| |v_sll_append_sll_create_~new_head~0#1.base_30| (store (select |c_old(#memory_$Pointer$.base)| |v_sll_append_sll_create_~new_head~0#1.base_30|) 0 0)) |sll_append_~new_last~0#1.base| v_DerPreprocessor_15) |c_sll_append_#in~head#1.base|) |c_sll_append_#in~head#1.offset|) |c_sll_append_~temp~0#1.base|) (= |c_sll_append_~temp~0#1.offset| (select (select (store (store |c_old(#memory_$Pointer$.offset)| |v_sll_append_sll_create_~new_head~0#1.base_30| (store (select |c_old(#memory_$Pointer$.offset)| |v_sll_append_sll_create_~new_head~0#1.base_30|) 0 0)) |sll_append_~new_last~0#1.base| v_DerPreprocessor_16) |c_sll_append_#in~head#1.base|) |c_sll_append_#in~head#1.offset|)))))) (exists ((|sll_append_~new_last~0#1.base| Int)) (and (exists ((|v_sll_append_sll_create_~new_head~0#1.base_32| Int) (|v_sll_append_sll_create_~new_head~0#1.base_31| Int) (v_DerPreprocessor_20 (Array Int Int)) (v_DerPreprocessor_21 (Array Int Int)) (|v_sll_append_sll_create_~new_head~0#1.base_30| Int) (v_DerPreprocessor_26 (Array Int Int)) (v_DerPreprocessor_15 (Array Int Int)) (v_DerPreprocessor_16 (Array Int Int)) (v_DerPreprocessor_25 (Array Int Int))) (and (not (= |v_sll_append_sll_create_~new_head~0#1.base_32| |v_sll_append_sll_create_~new_head~0#1.base_31|)) (= |c_sll_append_~temp~0#1.base| (select (select (store (store (store (store |c_old(#memory_$Pointer$.base)| |v_sll_append_sll_create_~new_head~0#1.base_30| (store (select |c_old(#memory_$Pointer$.base)| |v_sll_append_sll_create_~new_head~0#1.base_30|) 0 0)) |v_sll_append_sll_create_~new_head~0#1.base_31| v_DerPreprocessor_20) |v_sll_append_sll_create_~new_head~0#1.base_32| v_DerPreprocessor_21) |sll_append_~new_last~0#1.base| v_DerPreprocessor_15) |c_sll_append_#in~head#1.base|) |c_sll_append_#in~head#1.offset|)) (<= (+ |v_sll_append_sll_create_~new_head~0#1.base_32| 1) |c_#StackHeapBarrier|) (not (= |v_sll_append_sll_create_~new_head~0#1.base_31| |sll_append_~new_last~0#1.base|)) (not (= |v_sll_append_sll_create_~new_head~0#1.base_32| |sll_append_~new_last~0#1.base|)) (= |c_sll_append_~temp~0#1.offset| (select (select (store (store (store (store |c_old(#memory_$Pointer$.offset)| |v_sll_append_sll_create_~new_head~0#1.base_30| (store (select |c_old(#memory_$Pointer$.offset)| |v_sll_append_sll_create_~new_head~0#1.base_30|) 0 0)) |v_sll_append_sll_create_~new_head~0#1.base_31| v_DerPreprocessor_25) |v_sll_append_sll_create_~new_head~0#1.base_32| v_DerPreprocessor_26) |sll_append_~new_last~0#1.base| v_DerPreprocessor_16) |c_sll_append_#in~head#1.base|) |c_sll_append_#in~head#1.offset|)) (<= (+ |v_sll_append_sll_create_~new_head~0#1.base_31| 1) |c_#StackHeapBarrier|))) (<= (+ |sll_append_~new_last~0#1.base| 1) |c_#StackHeapBarrier|)))) is different from true [2023-11-12 02:33:28,163 WARN L876 $PredicateComparison]: unable to prove that (or (exists ((|v_sll_append_sll_create_~new_head~0#1.base_32| Int) (|sll_append_~new_last~0#1.base| Int) (v_DerPreprocessor_31 (Array Int Int)) (|v_sll_append_sll_create_~new_head~0#1.base_30| Int) (v_DerPreprocessor_16 (Array Int Int))) (and (not (= (select (select (store (store (store |c_old(#memory_$Pointer$.offset)| |v_sll_append_sll_create_~new_head~0#1.base_30| (store (select |c_old(#memory_$Pointer$.offset)| |v_sll_append_sll_create_~new_head~0#1.base_30|) 0 0)) |v_sll_append_sll_create_~new_head~0#1.base_32| v_DerPreprocessor_31) |sll_append_~new_last~0#1.base| v_DerPreprocessor_16) |c_sll_append_#in~head#1.base|) |c_sll_append_#in~head#1.offset|) 0)) (<= (+ |v_sll_append_sll_create_~new_head~0#1.base_32| 1) |c_#StackHeapBarrier|) (<= (+ |sll_append_~new_last~0#1.base| 1) |c_#StackHeapBarrier|) (not (= |v_sll_append_sll_create_~new_head~0#1.base_32| |sll_append_~new_last~0#1.base|)))) (exists ((|v_sll_append_sll_create_~new_head~0#1.base_32| Int) (|v_sll_append_sll_create_~new_head~0#1.base_31| Int) (|sll_append_~new_last~0#1.base| Int) (|v_sll_append_sll_create_~new_head~0#1.base_30| Int) (v_DerPreprocessor_26 (Array Int Int)) (v_DerPreprocessor_16 (Array Int Int)) (v_DerPreprocessor_25 (Array Int Int))) (and (not (= |v_sll_append_sll_create_~new_head~0#1.base_32| |v_sll_append_sll_create_~new_head~0#1.base_31|)) (<= (+ |v_sll_append_sll_create_~new_head~0#1.base_32| 1) |c_#StackHeapBarrier|) (not (= |v_sll_append_sll_create_~new_head~0#1.base_31| |sll_append_~new_last~0#1.base|)) (<= (+ |sll_append_~new_last~0#1.base| 1) |c_#StackHeapBarrier|) (not (= |v_sll_append_sll_create_~new_head~0#1.base_32| |sll_append_~new_last~0#1.base|)) (not (= (select (select (store (store (store (store |c_old(#memory_$Pointer$.offset)| |v_sll_append_sll_create_~new_head~0#1.base_30| (store (select |c_old(#memory_$Pointer$.offset)| |v_sll_append_sll_create_~new_head~0#1.base_30|) 0 0)) |v_sll_append_sll_create_~new_head~0#1.base_31| v_DerPreprocessor_25) |v_sll_append_sll_create_~new_head~0#1.base_32| v_DerPreprocessor_26) |sll_append_~new_last~0#1.base| v_DerPreprocessor_16) |c_sll_append_#in~head#1.base|) |c_sll_append_#in~head#1.offset|) 0)) (<= (+ |v_sll_append_sll_create_~new_head~0#1.base_31| 1) |c_#StackHeapBarrier|))) (exists ((|v_sll_append_sll_create_~new_head~0#1.base_31| Int) (|sll_append_~new_last~0#1.base| Int) (|v_sll_append_sll_create_~new_head~0#1.base_30| Int) (v_DerPreprocessor_16 (Array Int Int)) (v_DerPreprocessor_28 (Array Int Int))) (and (not (= (select (select (store (store (store |c_old(#memory_$Pointer$.offset)| |v_sll_append_sll_create_~new_head~0#1.base_30| (store (select |c_old(#memory_$Pointer$.offset)| |v_sll_append_sll_create_~new_head~0#1.base_30|) 0 0)) |v_sll_append_sll_create_~new_head~0#1.base_31| v_DerPreprocessor_28) |sll_append_~new_last~0#1.base| v_DerPreprocessor_16) |c_sll_append_#in~head#1.base|) |c_sll_append_#in~head#1.offset|) 0)) (not (= |v_sll_append_sll_create_~new_head~0#1.base_31| |sll_append_~new_last~0#1.base|)) (<= (+ |sll_append_~new_last~0#1.base| 1) |c_#StackHeapBarrier|) (<= (+ |v_sll_append_sll_create_~new_head~0#1.base_31| 1) |c_#StackHeapBarrier|))) (exists ((|sll_append_~new_last~0#1.base| Int) (|v_sll_append_sll_create_~new_head~0#1.base_30| Int) (v_DerPreprocessor_16 (Array Int Int))) (and (not (= 0 (select (select (store (store |c_old(#memory_$Pointer$.offset)| |v_sll_append_sll_create_~new_head~0#1.base_30| (store (select |c_old(#memory_$Pointer$.offset)| |v_sll_append_sll_create_~new_head~0#1.base_30|) 0 0)) |sll_append_~new_last~0#1.base| v_DerPreprocessor_16) |c_sll_append_#in~head#1.base|) |c_sll_append_#in~head#1.offset|))) (<= (+ |sll_append_~new_last~0#1.base| 1) |c_#StackHeapBarrier|))) (exists ((|v_sll_append_sll_create_~new_head~0#1.base_31| Int) (|sll_append_~new_last~0#1.base| Int) (|v_sll_append_sll_create_~new_head~0#1.base_30| Int) (v_DerPreprocessor_15 (Array Int Int)) (v_DerPreprocessor_23 (Array Int Int))) (and (not (= |v_sll_append_sll_create_~new_head~0#1.base_31| |sll_append_~new_last~0#1.base|)) (<= (+ |sll_append_~new_last~0#1.base| 1) |c_#StackHeapBarrier|) (not (= (select (select (store (store (store |c_old(#memory_$Pointer$.base)| |v_sll_append_sll_create_~new_head~0#1.base_30| (store (select |c_old(#memory_$Pointer$.base)| |v_sll_append_sll_create_~new_head~0#1.base_30|) 0 0)) |v_sll_append_sll_create_~new_head~0#1.base_31| v_DerPreprocessor_23) |sll_append_~new_last~0#1.base| v_DerPreprocessor_15) |c_sll_append_#in~head#1.base|) |c_sll_append_#in~head#1.offset|) 0)) (<= (+ |v_sll_append_sll_create_~new_head~0#1.base_31| 1) |c_#StackHeapBarrier|))) (exists ((|v_sll_append_sll_create_~new_head~0#1.base_32| Int) (|sll_append_~new_last~0#1.base| Int) (|v_sll_append_sll_create_~new_head~0#1.base_30| Int) (v_DerPreprocessor_15 (Array Int Int)) (v_DerPreprocessor_17 (Array Int Int))) (and (<= (+ |v_sll_append_sll_create_~new_head~0#1.base_32| 1) |c_#StackHeapBarrier|) (not (= (select (select (store (store (store |c_old(#memory_$Pointer$.base)| |v_sll_append_sll_create_~new_head~0#1.base_30| (store (select |c_old(#memory_$Pointer$.base)| |v_sll_append_sll_create_~new_head~0#1.base_30|) 0 0)) |v_sll_append_sll_create_~new_head~0#1.base_32| v_DerPreprocessor_17) |sll_append_~new_last~0#1.base| v_DerPreprocessor_15) |c_sll_append_#in~head#1.base|) |c_sll_append_#in~head#1.offset|) 0)) (<= (+ |sll_append_~new_last~0#1.base| 1) |c_#StackHeapBarrier|) (not (= |v_sll_append_sll_create_~new_head~0#1.base_32| |sll_append_~new_last~0#1.base|)))) (exists ((|v_sll_append_sll_create_~new_head~0#1.base_32| Int) (|v_sll_append_sll_create_~new_head~0#1.base_31| Int) (|sll_append_~new_last~0#1.base| Int) (v_DerPreprocessor_20 (Array Int Int)) (v_DerPreprocessor_21 (Array Int Int)) (|v_sll_append_sll_create_~new_head~0#1.base_30| Int) (v_DerPreprocessor_15 (Array Int Int))) (and (not (= |v_sll_append_sll_create_~new_head~0#1.base_32| |v_sll_append_sll_create_~new_head~0#1.base_31|)) (not (= (select (select (store (store (store (store |c_old(#memory_$Pointer$.base)| |v_sll_append_sll_create_~new_head~0#1.base_30| (store (select |c_old(#memory_$Pointer$.base)| |v_sll_append_sll_create_~new_head~0#1.base_30|) 0 0)) |v_sll_append_sll_create_~new_head~0#1.base_31| v_DerPreprocessor_20) |v_sll_append_sll_create_~new_head~0#1.base_32| v_DerPreprocessor_21) |sll_append_~new_last~0#1.base| v_DerPreprocessor_15) |c_sll_append_#in~head#1.base|) |c_sll_append_#in~head#1.offset|) 0)) (<= (+ |v_sll_append_sll_create_~new_head~0#1.base_32| 1) |c_#StackHeapBarrier|) (not (= |v_sll_append_sll_create_~new_head~0#1.base_31| |sll_append_~new_last~0#1.base|)) (<= (+ |sll_append_~new_last~0#1.base| 1) |c_#StackHeapBarrier|) (not (= |v_sll_append_sll_create_~new_head~0#1.base_32| |sll_append_~new_last~0#1.base|)) (<= (+ |v_sll_append_sll_create_~new_head~0#1.base_31| 1) |c_#StackHeapBarrier|))) (exists ((|sll_append_~new_last~0#1.base| Int) (|v_sll_append_sll_create_~new_head~0#1.base_30| Int) (v_DerPreprocessor_15 (Array Int Int))) (and (not (= (select (select (store (store |c_old(#memory_$Pointer$.base)| |v_sll_append_sll_create_~new_head~0#1.base_30| (store (select |c_old(#memory_$Pointer$.base)| |v_sll_append_sll_create_~new_head~0#1.base_30|) 0 0)) |sll_append_~new_last~0#1.base| v_DerPreprocessor_15) |c_sll_append_#in~head#1.base|) |c_sll_append_#in~head#1.offset|) 0)) (<= (+ |sll_append_~new_last~0#1.base| 1) |c_#StackHeapBarrier|)))) is different from true [2023-11-12 02:33:29,652 INFO L134 CoverageAnalysis]: Checked inductivity of 32 backedges. 0 proven. 12 refuted. 0 times theorem prover too weak. 20 trivial. 0 not checked. [2023-11-12 02:33:29,653 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2023-11-12 02:33:32,105 WARN L854 $PredicateComparison]: unable to prove that (and (forall ((|v_sll_append_sll_create_~new_head~0#1.base_44| Int)) (or (forall ((|v_sll_append_~new_last~0#1.base_17| Int)) (or (forall ((|v_sll_append_sll_create_~new_head~0#1.base_42| Int)) (or (forall ((v_ArrVal_953 (Array Int Int)) (v_ArrVal_952 (Array Int Int)) (|v_sll_append_sll_create_~new_head~0#1.base_45| Int) (v_ArrVal_950 (Array Int Int))) (= (select (select (store (store (store (store |c_#memory_$Pointer$.base| |v_sll_append_sll_create_~new_head~0#1.base_45| (store (select |c_#memory_$Pointer$.base| |v_sll_append_sll_create_~new_head~0#1.base_45|) 0 0)) |v_sll_append_sll_create_~new_head~0#1.base_44| v_ArrVal_952) |v_sll_append_sll_create_~new_head~0#1.base_42| v_ArrVal_950) |v_sll_append_~new_last~0#1.base_17| v_ArrVal_953) |c_ULTIMATE.start_main_~#head~1#1.base|) |c_ULTIMATE.start_main_~#head~1#1.offset|) 0)) (< |c_#StackHeapBarrier| (+ |v_sll_append_sll_create_~new_head~0#1.base_42| 1)))) (< |c_#StackHeapBarrier| (+ |v_sll_append_~new_last~0#1.base_17| 1)))) (< |c_#StackHeapBarrier| (+ |v_sll_append_sll_create_~new_head~0#1.base_44| 1)))) (forall ((|v_sll_append_sll_create_~new_head~0#1.base_44| Int)) (or (< |c_#StackHeapBarrier| (+ |v_sll_append_sll_create_~new_head~0#1.base_44| 1)) (forall ((|v_sll_append_~new_last~0#1.base_17| Int)) (or (forall ((|v_sll_append_sll_create_~new_head~0#1.base_42| Int)) (or (forall ((|v_sll_append_sll_create_~new_head~0#1.base_45| Int) (v_ArrVal_954 (Array Int Int)) (v_ArrVal_947 (Array Int Int)) (v_ArrVal_951 (Array Int Int))) (= (select (select (store (store (store (store |c_#memory_$Pointer$.offset| |v_sll_append_sll_create_~new_head~0#1.base_45| (store (select |c_#memory_$Pointer$.offset| |v_sll_append_sll_create_~new_head~0#1.base_45|) 0 0)) |v_sll_append_sll_create_~new_head~0#1.base_44| v_ArrVal_954) |v_sll_append_sll_create_~new_head~0#1.base_42| v_ArrVal_951) |v_sll_append_~new_last~0#1.base_17| v_ArrVal_947) |c_ULTIMATE.start_main_~#head~1#1.base|) |c_ULTIMATE.start_main_~#head~1#1.offset|) 0)) (< |c_#StackHeapBarrier| (+ |v_sll_append_sll_create_~new_head~0#1.base_42| 1)))) (< |c_#StackHeapBarrier| (+ |v_sll_append_~new_last~0#1.base_17| 1))))))) is different from false [2023-11-12 02:33:32,112 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1083077663] provided 0 perfect and 1 imperfect interpolant sequences [2023-11-12 02:33:32,112 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2023-11-12 02:33:32,112 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [11, 15] total 24 [2023-11-12 02:33:32,112 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1469393100] [2023-11-12 02:33:32,112 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2023-11-12 02:33:32,113 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 24 states [2023-11-12 02:33:32,113 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-12 02:33:32,114 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 24 interpolants. [2023-11-12 02:33:32,114 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=80, Invalid=387, Unknown=7, NotChecked=126, Total=600 [2023-11-12 02:33:32,114 INFO L87 Difference]: Start difference. First operand 92 states and 124 transitions. Second operand has 24 states, 24 states have (on average 2.5833333333333335) internal successors, (62), 21 states have internal predecessors, (62), 2 states have call successors, (2), 2 states have call predecessors, (2), 2 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2023-11-12 02:33:41,254 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.28s for a HTC check with result INVALID. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2023-11-12 02:33:48,790 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2023-11-12 02:33:50,228 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.03s for a HTC check with result INVALID. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2023-11-12 02:33:52,574 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.68s for a HTC check with result INVALID. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2023-11-12 02:33:53,806 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.23s for a HTC check with result INVALID. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0]