./Ultimate.py --spec ../../sv-benchmarks/c/properties/valid-memsafety.prp --file ../../sv-benchmarks/c/list-simple/sll2n_insert_unequal.i --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for memory safety (deref-memtrack) 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_e9dc0cbb-d2f2-4273-b8e9-d506e75045be/bin/utaipan-verify-NcY6lQBIFX/data/config -Xmx15G -Xms4m -jar /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_e9dc0cbb-d2f2-4273-b8e9-d506e75045be/bin/utaipan-verify-NcY6lQBIFX/plugins/org.eclipse.equinox.launcher_1.5.800.v20200727-1323.jar -data @noDefault -ultimatedata /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_e9dc0cbb-d2f2-4273-b8e9-d506e75045be/bin/utaipan-verify-NcY6lQBIFX/data -tc /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_e9dc0cbb-d2f2-4273-b8e9-d506e75045be/bin/utaipan-verify-NcY6lQBIFX/config/TaipanMemDerefMemtrack.xml -i ../../sv-benchmarks/c/list-simple/sll2n_insert_unequal.i -s /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_e9dc0cbb-d2f2-4273-b8e9-d506e75045be/bin/utaipan-verify-NcY6lQBIFX/config/svcomp-DerefFreeMemtrack-32bit-Taipan_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_e9dc0cbb-d2f2-4273-b8e9-d506e75045be/bin/utaipan-verify-NcY6lQBIFX --witnessprinter.witness.filename witness --witnessprinter.write.witness.besides.input.file false --witnessprinter.graph.data.specification CHECK( init(main()), LTL(G valid-free) ) CHECK( init(main()), LTL(G valid-deref) ) CHECK( init(main()), LTL(G valid-memtrack) ) --witnessprinter.graph.data.producer Taipan --witnessprinter.graph.data.architecture 32bit --witnessprinter.graph.data.programhash 383c6933c6ab916f651364224af1d774f30e162ad506fd2f28fe7f76c4487ba3 --- Real Ultimate output --- This is Ultimate 0.2.3-dev-cf1a783 [2023-11-12 00:56:07,092 INFO L188 SettingsManager]: Resetting all preferences to default values... [2023-11-12 00:56:07,213 INFO L114 SettingsManager]: Loading settings from /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_e9dc0cbb-d2f2-4273-b8e9-d506e75045be/bin/utaipan-verify-NcY6lQBIFX/config/svcomp-DerefFreeMemtrack-32bit-Taipan_Default.epf [2023-11-12 00:56:07,221 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2023-11-12 00:56:07,221 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2023-11-12 00:56:07,252 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2023-11-12 00:56:07,253 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2023-11-12 00:56:07,253 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2023-11-12 00:56:07,254 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2023-11-12 00:56:07,255 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2023-11-12 00:56:07,255 INFO L153 SettingsManager]: * User list type=DISABLED [2023-11-12 00:56:07,256 INFO L151 SettingsManager]: Preferences of Abstract Interpretation differ from their defaults: [2023-11-12 00:56:07,256 INFO L153 SettingsManager]: * Explicit value domain=true [2023-11-12 00:56:07,257 INFO L153 SettingsManager]: * Abstract domain for RCFG-of-the-future=PoormanAbstractDomain [2023-11-12 00:56:07,257 INFO L153 SettingsManager]: * Octagon Domain=false [2023-11-12 00:56:07,258 INFO L153 SettingsManager]: * Abstract domain=CompoundDomain [2023-11-12 00:56:07,258 INFO L153 SettingsManager]: * Check feasibility of abstract posts with an SMT solver=true [2023-11-12 00:56:07,259 INFO L153 SettingsManager]: * Use the RCFG-of-the-future interface=true [2023-11-12 00:56:07,259 INFO L153 SettingsManager]: * Interval Domain=false [2023-11-12 00:56:07,260 INFO L151 SettingsManager]: Preferences of Sifa differ from their defaults: [2023-11-12 00:56:07,260 INFO L153 SettingsManager]: * Call Summarizer=TopInputCallSummarizer [2023-11-12 00:56:07,261 INFO L153 SettingsManager]: * Simplification Technique=POLY_PAC [2023-11-12 00:56:07,262 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2023-11-12 00:56:07,262 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2023-11-12 00:56:07,263 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2023-11-12 00:56:07,263 INFO L153 SettingsManager]: * sizeof long=4 [2023-11-12 00:56:07,264 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2023-11-12 00:56:07,264 INFO L153 SettingsManager]: * sizeof POINTER=4 [2023-11-12 00:56:07,265 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2023-11-12 00:56:07,265 INFO L153 SettingsManager]: * Check for the main procedure if all allocated memory was freed=true [2023-11-12 00:56:07,265 INFO L153 SettingsManager]: * Bitprecise bitfields=true [2023-11-12 00:56:07,266 INFO L153 SettingsManager]: * SV-COMP memtrack compatibility mode=true [2023-11-12 00:56:07,266 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2023-11-12 00:56:07,267 INFO L153 SettingsManager]: * Adapt memory model on pointer casts if necessary=true [2023-11-12 00:56:07,267 INFO L153 SettingsManager]: * Check unreachability of reach_error function=false [2023-11-12 00:56:07,267 INFO L153 SettingsManager]: * sizeof long double=12 [2023-11-12 00:56:07,268 INFO L153 SettingsManager]: * Use constant arrays=true [2023-11-12 00:56:07,268 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2023-11-12 00:56:07,269 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2023-11-12 00:56:07,269 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2023-11-12 00:56:07,269 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2023-11-12 00:56:07,270 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2023-11-12 00:56:07,270 INFO L153 SettingsManager]: * Trace refinement strategy=SIFA_TAIPAN [2023-11-12 00:56:07,270 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2023-11-12 00:56:07,270 INFO L153 SettingsManager]: * Trace refinement exception blacklist=NONE [2023-11-12 00:56:07,270 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2023-11-12 00:56:07,271 INFO L153 SettingsManager]: * Abstract interpretation Mode=USE_PREDICATES 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_e9dc0cbb-d2f2-4273-b8e9-d506e75045be/bin/utaipan-verify-NcY6lQBIFX/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_e9dc0cbb-d2f2-4273-b8e9-d506e75045be/bin/utaipan-verify-NcY6lQBIFX Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Witness filename -> witness Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Write witness besides input file -> false Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data specification -> CHECK( init(main()), LTL(G valid-free) ) CHECK( init(main()), LTL(G valid-deref) ) CHECK( init(main()), LTL(G valid-memtrack) ) Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data producer -> Taipan 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 -> 383c6933c6ab916f651364224af1d774f30e162ad506fd2f28fe7f76c4487ba3 [2023-11-12 00:56:07,580 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2023-11-12 00:56:07,609 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2023-11-12 00:56:07,611 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2023-11-12 00:56:07,612 INFO L270 PluginConnector]: Initializing CDTParser... [2023-11-12 00:56:07,614 INFO L274 PluginConnector]: CDTParser initialized [2023-11-12 00:56:07,615 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_e9dc0cbb-d2f2-4273-b8e9-d506e75045be/bin/utaipan-verify-NcY6lQBIFX/../../sv-benchmarks/c/list-simple/sll2n_insert_unequal.i [2023-11-12 00:56:10,797 INFO L533 CDTParser]: Created temporary CDT project at NULL [2023-11-12 00:56:11,087 INFO L384 CDTParser]: Found 1 translation units. [2023-11-12 00:56:11,087 INFO L180 CDTParser]: Scanning /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_e9dc0cbb-d2f2-4273-b8e9-d506e75045be/sv-benchmarks/c/list-simple/sll2n_insert_unequal.i [2023-11-12 00:56:11,107 INFO L427 CDTParser]: About to delete temporary CDT project at /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_e9dc0cbb-d2f2-4273-b8e9-d506e75045be/bin/utaipan-verify-NcY6lQBIFX/data/a47784c53/8ba413400be44a1f910593f82e1fcc8c/FLAG520cedc36 [2023-11-12 00:56:11,123 INFO L435 CDTParser]: Successfully deleted /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_e9dc0cbb-d2f2-4273-b8e9-d506e75045be/bin/utaipan-verify-NcY6lQBIFX/data/a47784c53/8ba413400be44a1f910593f82e1fcc8c [2023-11-12 00:56:11,125 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2023-11-12 00:56:11,127 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2023-11-12 00:56:11,129 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2023-11-12 00:56:11,129 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2023-11-12 00:56:11,135 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2023-11-12 00:56:11,136 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 12.11 12:56:11" (1/1) ... [2023-11-12 00:56:11,140 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@5bfd2ef2 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.11 12:56:11, skipping insertion in model container [2023-11-12 00:56:11,141 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 12.11 12:56:11" (1/1) ... [2023-11-12 00:56:11,212 INFO L177 MainTranslator]: Built tables and reachable declarations [2023-11-12 00:56:11,507 INFO L209 PostProcessor]: Analyzing one entry point: main [2023-11-12 00:56:11,519 INFO L202 MainTranslator]: Completed pre-run [2023-11-12 00:56:11,568 INFO L209 PostProcessor]: Analyzing one entry point: main [2023-11-12 00:56:11,661 INFO L206 MainTranslator]: Completed translation [2023-11-12 00:56:11,661 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.11 12:56:11 WrapperNode [2023-11-12 00:56:11,661 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2023-11-12 00:56:11,663 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2023-11-12 00:56:11,663 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2023-11-12 00:56:11,663 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2023-11-12 00:56:11,671 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.11 12:56:11" (1/1) ... [2023-11-12 00:56:11,701 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.11 12:56:11" (1/1) ... [2023-11-12 00:56:11,731 INFO L138 Inliner]: procedures = 128, calls = 37, calls flagged for inlining = 7, calls inlined = 7, statements flattened = 157 [2023-11-12 00:56:11,732 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2023-11-12 00:56:11,733 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2023-11-12 00:56:11,733 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2023-11-12 00:56:11,733 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2023-11-12 00:56:11,743 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.11 12:56:11" (1/1) ... [2023-11-12 00:56:11,743 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.11 12:56:11" (1/1) ... [2023-11-12 00:56:11,752 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.11 12:56:11" (1/1) ... [2023-11-12 00:56:11,755 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.11 12:56:11" (1/1) ... [2023-11-12 00:56:11,769 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.11 12:56:11" (1/1) ... [2023-11-12 00:56:11,774 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.11 12:56:11" (1/1) ... [2023-11-12 00:56:11,777 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.11 12:56:11" (1/1) ... [2023-11-12 00:56:11,779 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.11 12:56:11" (1/1) ... [2023-11-12 00:56:11,783 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2023-11-12 00:56:11,784 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2023-11-12 00:56:11,784 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2023-11-12 00:56:11,784 INFO L274 PluginConnector]: RCFGBuilder initialized [2023-11-12 00:56:11,785 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.11 12:56:11" (1/1) ... [2023-11-12 00:56:11,792 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2023-11-12 00:56:11,808 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_e9dc0cbb-d2f2-4273-b8e9-d506e75045be/bin/utaipan-verify-NcY6lQBIFX/z3 [2023-11-12 00:56:11,826 INFO L229 MonitoredProcess]: Starting monitored process 1 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_e9dc0cbb-d2f2-4273-b8e9-d506e75045be/bin/utaipan-verify-NcY6lQBIFX/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (exit command is (exit), workingDir is null) [2023-11-12 00:56:11,834 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_e9dc0cbb-d2f2-4273-b8e9-d506e75045be/bin/utaipan-verify-NcY6lQBIFX/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (1)] Waiting until timeout for monitored process [2023-11-12 00:56:11,857 INFO L130 BoogieDeclarations]: Found specification of procedure read~int [2023-11-12 00:56:11,858 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2023-11-12 00:56:11,858 INFO L130 BoogieDeclarations]: Found specification of procedure node_create [2023-11-12 00:56:11,858 INFO L138 BoogieDeclarations]: Found implementation of procedure node_create [2023-11-12 00:56:11,858 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnHeap [2023-11-12 00:56:11,858 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2023-11-12 00:56:11,858 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2023-11-12 00:56:11,858 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$ [2023-11-12 00:56:11,858 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$ [2023-11-12 00:56:11,859 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2023-11-12 00:56:11,859 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~$Pointer$ [2023-11-12 00:56:11,859 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2023-11-12 00:56:11,859 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2023-11-12 00:56:11,859 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2023-11-12 00:56:11,994 INFO L236 CfgBuilder]: Building ICFG [2023-11-12 00:56:11,996 INFO L262 CfgBuilder]: Building CFG for each procedure with an implementation [2023-11-12 00:56:12,492 INFO L277 CfgBuilder]: Performing block encoding [2023-11-12 00:56:12,554 INFO L297 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2023-11-12 00:56:12,554 INFO L302 CfgBuilder]: Removed 5 assume(true) statements. [2023-11-12 00:56:12,557 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 12.11 12:56:12 BoogieIcfgContainer [2023-11-12 00:56:12,558 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2023-11-12 00:56:12,562 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2023-11-12 00:56:12,563 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2023-11-12 00:56:12,566 INFO L274 PluginConnector]: TraceAbstraction initialized [2023-11-12 00:56:12,566 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 12.11 12:56:11" (1/3) ... [2023-11-12 00:56:12,568 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@2ee2d1f6 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 12.11 12:56:12, skipping insertion in model container [2023-11-12 00:56:12,568 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.11 12:56:11" (2/3) ... [2023-11-12 00:56:12,570 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@2ee2d1f6 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 12.11 12:56:12, skipping insertion in model container [2023-11-12 00:56:12,570 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 12.11 12:56:12" (3/3) ... [2023-11-12 00:56:12,572 INFO L112 eAbstractionObserver]: Analyzing ICFG sll2n_insert_unequal.i [2023-11-12 00:56:12,592 INFO L204 ceAbstractionStarter]: Automizer settings: Hoare:false NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2023-11-12 00:56:12,592 INFO L163 ceAbstractionStarter]: Applying trace abstraction to program that has 39 error locations. [2023-11-12 00:56:12,654 INFO L356 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2023-11-12 00:56:12,661 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=FINITE_AUTOMATA, 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;@4102de2e, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2023-11-12 00:56:12,662 INFO L358 AbstractCegarLoop]: Starting to check reachability of 39 error locations. [2023-11-12 00:56:12,666 INFO L276 IsEmpty]: Start isEmpty. Operand has 84 states, 41 states have (on average 2.2439024390243905) internal successors, (92), 80 states have internal predecessors, (92), 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 00:56:12,671 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 7 [2023-11-12 00:56:12,672 INFO L187 NwaCegarLoop]: Found error trace [2023-11-12 00:56:12,672 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1] [2023-11-12 00:56:12,673 INFO L420 AbstractCegarLoop]: === Iteration 1 === Targeting node_createErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 36 more)] === [2023-11-12 00:56:12,678 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-12 00:56:12,678 INFO L85 PathProgramCache]: Analyzing trace with hash -1932842508, now seen corresponding path program 1 times [2023-11-12 00:56:12,686 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2023-11-12 00:56:12,687 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2076977858] [2023-11-12 00:56:12,687 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-12 00:56:12,687 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-12 00:56:12,792 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-12 00:56:12,998 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 00:56:12,999 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2023-11-12 00:56:12,999 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2076977858] [2023-11-12 00:56:13,000 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2076977858] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-12 00:56:13,000 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-12 00:56:13,000 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2023-11-12 00:56:13,002 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [531184833] [2023-11-12 00:56:13,003 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-12 00:56:13,008 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2023-11-12 00:56:13,009 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2023-11-12 00:56:13,066 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2023-11-12 00:56:13,067 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2023-11-12 00:56:13,070 INFO L87 Difference]: Start difference. First operand has 84 states, 41 states have (on average 2.2439024390243905) internal successors, (92), 80 states have internal predecessors, (92), 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) Second operand has 3 states, 2 states have (on average 2.5) internal successors, (5), 3 states have internal predecessors, (5), 1 states have call successors, (1), 1 states have call predecessors, (1), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-12 00:56:13,255 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-11-12 00:56:13,256 INFO L93 Difference]: Finished difference Result 81 states and 91 transitions. [2023-11-12 00:56:13,257 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2023-11-12 00:56:13,258 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 2 states have (on average 2.5) internal successors, (5), 3 states have internal predecessors, (5), 1 states have call successors, (1), 1 states have call predecessors, (1), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 6 [2023-11-12 00:56:13,259 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-11-12 00:56:13,271 INFO L225 Difference]: With dead ends: 81 [2023-11-12 00:56:13,272 INFO L226 Difference]: Without dead ends: 79 [2023-11-12 00:56:13,274 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2023-11-12 00:56:13,283 INFO L413 NwaCegarLoop]: 68 mSDtfsCounter, 6 mSDsluCounter, 41 mSDsCounter, 0 mSdLazyCounter, 65 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 6 SdHoareTripleChecker+Valid, 109 SdHoareTripleChecker+Invalid, 66 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 65 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2023-11-12 00:56:13,284 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [6 Valid, 109 Invalid, 66 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 65 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2023-11-12 00:56:13,310 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 79 states. [2023-11-12 00:56:13,335 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 79 to 79. [2023-11-12 00:56:13,337 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 79 states, 39 states have (on average 2.1538461538461537) internal successors, (84), 75 states have internal predecessors, (84), 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 00:56:13,339 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 79 states to 79 states and 88 transitions. [2023-11-12 00:56:13,340 INFO L78 Accepts]: Start accepts. Automaton has 79 states and 88 transitions. Word has length 6 [2023-11-12 00:56:13,341 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-11-12 00:56:13,341 INFO L495 AbstractCegarLoop]: Abstraction has 79 states and 88 transitions. [2023-11-12 00:56:13,341 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 2 states have (on average 2.5) internal successors, (5), 3 states have internal predecessors, (5), 1 states have call successors, (1), 1 states have call predecessors, (1), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-12 00:56:13,346 INFO L276 IsEmpty]: Start isEmpty. Operand 79 states and 88 transitions. [2023-11-12 00:56:13,347 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 7 [2023-11-12 00:56:13,347 INFO L187 NwaCegarLoop]: Found error trace [2023-11-12 00:56:13,347 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1] [2023-11-12 00:56:13,347 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2023-11-12 00:56:13,348 INFO L420 AbstractCegarLoop]: === Iteration 2 === Targeting node_createErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 36 more)] === [2023-11-12 00:56:13,348 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-12 00:56:13,348 INFO L85 PathProgramCache]: Analyzing trace with hash -1932842507, now seen corresponding path program 1 times [2023-11-12 00:56:13,349 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2023-11-12 00:56:13,349 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [188314801] [2023-11-12 00:56:13,349 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-12 00:56:13,350 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-12 00:56:13,372 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-12 00:56:13,492 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 00:56:13,492 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2023-11-12 00:56:13,493 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [188314801] [2023-11-12 00:56:13,493 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [188314801] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-12 00:56:13,493 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-12 00:56:13,493 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2023-11-12 00:56:13,494 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [287380158] [2023-11-12 00:56:13,494 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-12 00:56:13,495 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2023-11-12 00:56:13,496 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2023-11-12 00:56:13,496 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2023-11-12 00:56:13,497 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2023-11-12 00:56:13,497 INFO L87 Difference]: Start difference. First operand 79 states and 88 transitions. Second operand has 3 states, 2 states have (on average 2.5) internal successors, (5), 3 states have internal predecessors, (5), 1 states have call successors, (1), 1 states have call predecessors, (1), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-12 00:56:13,598 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-11-12 00:56:13,598 INFO L93 Difference]: Finished difference Result 77 states and 86 transitions. [2023-11-12 00:56:13,599 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2023-11-12 00:56:13,599 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 2 states have (on average 2.5) internal successors, (5), 3 states have internal predecessors, (5), 1 states have call successors, (1), 1 states have call predecessors, (1), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 6 [2023-11-12 00:56:13,600 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-11-12 00:56:13,601 INFO L225 Difference]: With dead ends: 77 [2023-11-12 00:56:13,601 INFO L226 Difference]: Without dead ends: 77 [2023-11-12 00:56:13,601 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2023-11-12 00:56:13,603 INFO L413 NwaCegarLoop]: 67 mSDtfsCounter, 2 mSDsluCounter, 44 mSDsCounter, 0 mSdLazyCounter, 57 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 2 SdHoareTripleChecker+Valid, 111 SdHoareTripleChecker+Invalid, 58 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 57 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2023-11-12 00:56:13,604 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [2 Valid, 111 Invalid, 58 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 57 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2023-11-12 00:56:13,605 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 77 states. [2023-11-12 00:56:13,612 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 77 to 77. [2023-11-12 00:56:13,612 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 77 states, 39 states have (on average 2.1025641025641026) internal successors, (82), 73 states have internal predecessors, (82), 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 00:56:13,614 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 77 states to 77 states and 86 transitions. [2023-11-12 00:56:13,614 INFO L78 Accepts]: Start accepts. Automaton has 77 states and 86 transitions. Word has length 6 [2023-11-12 00:56:13,614 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-11-12 00:56:13,615 INFO L495 AbstractCegarLoop]: Abstraction has 77 states and 86 transitions. [2023-11-12 00:56:13,615 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 2 states have (on average 2.5) internal successors, (5), 3 states have internal predecessors, (5), 1 states have call successors, (1), 1 states have call predecessors, (1), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-12 00:56:13,615 INFO L276 IsEmpty]: Start isEmpty. Operand 77 states and 86 transitions. [2023-11-12 00:56:13,616 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 11 [2023-11-12 00:56:13,616 INFO L187 NwaCegarLoop]: Found error trace [2023-11-12 00:56:13,616 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-11-12 00:56:13,616 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2023-11-12 00:56:13,617 INFO L420 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 36 more)] === [2023-11-12 00:56:13,617 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-12 00:56:13,617 INFO L85 PathProgramCache]: Analyzing trace with hash 2127584166, now seen corresponding path program 1 times [2023-11-12 00:56:13,618 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2023-11-12 00:56:13,618 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1903231741] [2023-11-12 00:56:13,618 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-12 00:56:13,618 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-12 00:56:13,638 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-12 00:56:13,739 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 00:56:13,739 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2023-11-12 00:56:13,740 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1903231741] [2023-11-12 00:56:13,740 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1903231741] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-12 00:56:13,740 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-12 00:56:13,740 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2023-11-12 00:56:13,741 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1623378400] [2023-11-12 00:56:13,741 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-12 00:56:13,741 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2023-11-12 00:56:13,741 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2023-11-12 00:56:13,742 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2023-11-12 00:56:13,743 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2023-11-12 00:56:13,743 INFO L87 Difference]: Start difference. First operand 77 states and 86 transitions. Second operand has 6 states, 4 states have (on average 2.0) internal successors, (8), 5 states have internal predecessors, (8), 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 00:56:13,931 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-11-12 00:56:13,931 INFO L93 Difference]: Finished difference Result 78 states and 89 transitions. [2023-11-12 00:56:13,932 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2023-11-12 00:56:13,932 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 4 states have (on average 2.0) internal successors, (8), 5 states have internal predecessors, (8), 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 10 [2023-11-12 00:56:13,932 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-11-12 00:56:13,935 INFO L225 Difference]: With dead ends: 78 [2023-11-12 00:56:13,935 INFO L226 Difference]: Without dead ends: 78 [2023-11-12 00:56:13,935 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=13, Invalid=29, Unknown=0, NotChecked=0, Total=42 [2023-11-12 00:56:13,937 INFO L413 NwaCegarLoop]: 67 mSDtfsCounter, 5 mSDsluCounter, 159 mSDsCounter, 0 mSdLazyCounter, 208 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 5 SdHoareTripleChecker+Valid, 226 SdHoareTripleChecker+Invalid, 209 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 208 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2023-11-12 00:56:13,938 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [5 Valid, 226 Invalid, 209 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 208 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2023-11-12 00:56:13,939 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 78 states. [2023-11-12 00:56:13,945 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 78 to 76. [2023-11-12 00:56:13,947 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 76 states, 39 states have (on average 2.076923076923077) internal successors, (81), 72 states have internal predecessors, (81), 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 00:56:13,949 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 76 states to 76 states and 85 transitions. [2023-11-12 00:56:13,949 INFO L78 Accepts]: Start accepts. Automaton has 76 states and 85 transitions. Word has length 10 [2023-11-12 00:56:13,949 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-11-12 00:56:13,949 INFO L495 AbstractCegarLoop]: Abstraction has 76 states and 85 transitions. [2023-11-12 00:56:13,950 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 4 states have (on average 2.0) internal successors, (8), 5 states have internal predecessors, (8), 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 00:56:13,950 INFO L276 IsEmpty]: Start isEmpty. Operand 76 states and 85 transitions. [2023-11-12 00:56:13,950 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 11 [2023-11-12 00:56:13,950 INFO L187 NwaCegarLoop]: Found error trace [2023-11-12 00:56:13,951 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-11-12 00:56:13,951 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2023-11-12 00:56:13,951 INFO L420 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 36 more)] === [2023-11-12 00:56:13,952 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-12 00:56:13,952 INFO L85 PathProgramCache]: Analyzing trace with hash 2127584167, now seen corresponding path program 1 times [2023-11-12 00:56:13,952 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2023-11-12 00:56:13,952 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [752912884] [2023-11-12 00:56:13,953 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-12 00:56:13,953 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-12 00:56:13,978 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-12 00:56:14,190 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 00:56:14,190 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2023-11-12 00:56:14,190 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [752912884] [2023-11-12 00:56:14,191 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [752912884] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-12 00:56:14,191 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-12 00:56:14,191 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2023-11-12 00:56:14,191 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [162578264] [2023-11-12 00:56:14,191 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-12 00:56:14,192 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2023-11-12 00:56:14,192 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2023-11-12 00:56:14,193 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2023-11-12 00:56:14,193 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2023-11-12 00:56:14,193 INFO L87 Difference]: Start difference. First operand 76 states and 85 transitions. Second operand has 6 states, 4 states have (on average 2.0) internal successors, (8), 5 states have internal predecessors, (8), 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 00:56:14,393 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-11-12 00:56:14,393 INFO L93 Difference]: Finished difference Result 77 states and 88 transitions. [2023-11-12 00:56:14,394 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2023-11-12 00:56:14,394 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 4 states have (on average 2.0) internal successors, (8), 5 states have internal predecessors, (8), 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 10 [2023-11-12 00:56:14,395 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-11-12 00:56:14,397 INFO L225 Difference]: With dead ends: 77 [2023-11-12 00:56:14,397 INFO L226 Difference]: Without dead ends: 77 [2023-11-12 00:56:14,398 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=13, Invalid=29, Unknown=0, NotChecked=0, Total=42 [2023-11-12 00:56:14,403 INFO L413 NwaCegarLoop]: 67 mSDtfsCounter, 3 mSDsluCounter, 171 mSDsCounter, 0 mSdLazyCounter, 192 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 3 SdHoareTripleChecker+Valid, 238 SdHoareTripleChecker+Invalid, 192 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 192 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2023-11-12 00:56:14,404 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [3 Valid, 238 Invalid, 192 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 192 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2023-11-12 00:56:14,405 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 77 states. [2023-11-12 00:56:14,413 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 77 to 75. [2023-11-12 00:56:14,414 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 75 states, 39 states have (on average 2.051282051282051) internal successors, (80), 71 states have internal predecessors, (80), 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 00:56:14,415 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 75 states to 75 states and 84 transitions. [2023-11-12 00:56:14,415 INFO L78 Accepts]: Start accepts. Automaton has 75 states and 84 transitions. Word has length 10 [2023-11-12 00:56:14,415 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-11-12 00:56:14,415 INFO L495 AbstractCegarLoop]: Abstraction has 75 states and 84 transitions. [2023-11-12 00:56:14,416 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 4 states have (on average 2.0) internal successors, (8), 5 states have internal predecessors, (8), 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 00:56:14,416 INFO L276 IsEmpty]: Start isEmpty. Operand 75 states and 84 transitions. [2023-11-12 00:56:14,416 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 11 [2023-11-12 00:56:14,416 INFO L187 NwaCegarLoop]: Found error trace [2023-11-12 00:56:14,416 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-11-12 00:56:14,417 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2023-11-12 00:56:14,417 INFO L420 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 36 more)] === [2023-11-12 00:56:14,417 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-12 00:56:14,418 INFO L85 PathProgramCache]: Analyzing trace with hash -970133642, now seen corresponding path program 1 times [2023-11-12 00:56:14,418 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2023-11-12 00:56:14,418 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1749532164] [2023-11-12 00:56:14,418 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-12 00:56:14,418 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-12 00:56:14,448 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-12 00:56:14,542 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 00:56:14,542 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2023-11-12 00:56:14,542 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1749532164] [2023-11-12 00:56:14,543 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1749532164] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-12 00:56:14,543 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-12 00:56:14,543 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2023-11-12 00:56:14,543 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1981666332] [2023-11-12 00:56:14,543 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-12 00:56:14,545 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2023-11-12 00:56:14,546 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2023-11-12 00:56:14,546 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2023-11-12 00:56:14,547 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2023-11-12 00:56:14,547 INFO L87 Difference]: Start difference. First operand 75 states and 84 transitions. Second operand has 3 states, 3 states have (on average 2.6666666666666665) internal successors, (8), 3 states have internal predecessors, (8), 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 00:56:14,594 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-11-12 00:56:14,595 INFO L93 Difference]: Finished difference Result 79 states and 89 transitions. [2023-11-12 00:56:14,595 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2023-11-12 00:56:14,595 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 2.6666666666666665) internal successors, (8), 3 states have internal predecessors, (8), 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 10 [2023-11-12 00:56:14,596 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-11-12 00:56:14,599 INFO L225 Difference]: With dead ends: 79 [2023-11-12 00:56:14,600 INFO L226 Difference]: Without dead ends: 79 [2023-11-12 00:56:14,600 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2023-11-12 00:56:14,604 INFO L413 NwaCegarLoop]: 66 mSDtfsCounter, 2 mSDsluCounter, 66 mSDsCounter, 0 mSdLazyCounter, 35 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 3 SdHoareTripleChecker+Valid, 132 SdHoareTripleChecker+Invalid, 35 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 35 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2023-11-12 00:56:14,604 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [3 Valid, 132 Invalid, 35 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 35 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2023-11-12 00:56:14,606 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 79 states. [2023-11-12 00:56:14,624 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 79 to 76. [2023-11-12 00:56:14,625 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 76 states, 40 states have (on average 2.025) internal successors, (81), 72 states have internal predecessors, (81), 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 00:56:14,627 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 76 states to 76 states and 85 transitions. [2023-11-12 00:56:14,627 INFO L78 Accepts]: Start accepts. Automaton has 76 states and 85 transitions. Word has length 10 [2023-11-12 00:56:14,627 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-11-12 00:56:14,627 INFO L495 AbstractCegarLoop]: Abstraction has 76 states and 85 transitions. [2023-11-12 00:56:14,628 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 2.6666666666666665) internal successors, (8), 3 states have internal predecessors, (8), 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 00:56:14,628 INFO L276 IsEmpty]: Start isEmpty. Operand 76 states and 85 transitions. [2023-11-12 00:56:14,629 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 20 [2023-11-12 00:56:14,629 INFO L187 NwaCegarLoop]: Found error trace [2023-11-12 00:56:14,630 INFO L195 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-11-12 00:56:14,630 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2023-11-12 00:56:14,631 INFO L420 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 36 more)] === [2023-11-12 00:56:14,631 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-12 00:56:14,631 INFO L85 PathProgramCache]: Analyzing trace with hash 1416573081, now seen corresponding path program 1 times [2023-11-12 00:56:14,632 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2023-11-12 00:56:14,632 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [118387592] [2023-11-12 00:56:14,632 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-12 00:56:14,632 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-12 00:56:14,679 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-12 00:56:14,809 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 5 trivial. 0 not checked. [2023-11-12 00:56:14,810 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2023-11-12 00:56:14,810 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [118387592] [2023-11-12 00:56:14,811 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [118387592] provided 0 perfect and 1 imperfect interpolant sequences [2023-11-12 00:56:14,811 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [543210845] [2023-11-12 00:56:14,811 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-12 00:56:14,811 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-11-12 00:56:14,812 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_e9dc0cbb-d2f2-4273-b8e9-d506e75045be/bin/utaipan-verify-NcY6lQBIFX/z3 [2023-11-12 00:56:14,816 INFO L229 MonitoredProcess]: Starting monitored process 2 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_e9dc0cbb-d2f2-4273-b8e9-d506e75045be/bin/utaipan-verify-NcY6lQBIFX/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2023-11-12 00:56:14,844 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_e9dc0cbb-d2f2-4273-b8e9-d506e75045be/bin/utaipan-verify-NcY6lQBIFX/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Waiting until timeout for monitored process [2023-11-12 00:56:14,970 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-12 00:56:14,990 INFO L262 TraceCheckSpWp]: Trace formula consists of 245 conjuncts, 5 conjunts are in the unsatisfiable core [2023-11-12 00:56:14,996 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-11-12 00:56:15,062 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 5 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-11-12 00:56:15,062 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2023-11-12 00:56:15,110 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 5 trivial. 0 not checked. [2023-11-12 00:56:15,111 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [543210845] provided 0 perfect and 2 imperfect interpolant sequences [2023-11-12 00:56:15,111 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSifa [1787841820] [2023-11-12 00:56:15,140 INFO L159 IcfgInterpreter]: Started Sifa with 14 locations of interest [2023-11-12 00:56:15,140 INFO L166 IcfgInterpreter]: Building call graph [2023-11-12 00:56:15,145 INFO L171 IcfgInterpreter]: Initial procedures are [ULTIMATE.start] [2023-11-12 00:56:15,151 INFO L176 IcfgInterpreter]: Starting interpretation [2023-11-12 00:56:15,152 INFO L197 IcfgInterpreter]: Interpreting procedure ULTIMATE.start with input of size 1 for LOIs [2023-11-12 00:56:18,149 INFO L197 IcfgInterpreter]: Interpreting procedure node_create with input of size 38 for LOIs [2023-11-12 00:56:18,248 INFO L180 IcfgInterpreter]: Interpretation finished [2023-11-12 00:56:21,257 INFO L133 SifaRunner]: Sifa could not show that error location is unreachable, found '1000#(and (<= 1 |#StackHeapBarrier|) (= |ULTIMATE.start_sll_insert_#in~head#1.offset| 0) (= |ULTIMATE.start_main_~mid_index~0#1| 1) (= |ULTIMATE.start_sll_insert_#in~index#1| 1) (= |ULTIMATE.start_sll_insert_~snd_to_last~0#1.offset| 0) (= |ULTIMATE.start_main_~uneq~0#1| 5) (= 5 |ULTIMATE.start_sll_insert_~data#1|) (= |ULTIMATE.start_sll_insert_~head#1.offset| 0) (<= 2 |ULTIMATE.start_sll_insert_#in~head#1.base|) (= |ULTIMATE.start_sll_insert_#in~data#1| 5) (= |ULTIMATE.start_sll_insert_~snd_to_last~0#1.base| 0) (= |ULTIMATE.start_sll_insert_~new_node~0#1.offset| 0) (or (and (exists ((|v_#valid_96| (Array Int Int))) (and (= |#valid| (store |v_#valid_96| |ULTIMATE.start_sll_insert_~new_node~0#1.base| 1)) (= (select |v_#valid_96| |ULTIMATE.start_sll_insert_~new_node~0#1.base|) 0))) (= 1 (select |#valid| |ULTIMATE.start_sll_insert_~new_node~0#1.base|)) (= |ULTIMATE.start_sll_insert_#in~head#1.base| |ULTIMATE.start_main_~#s~0#1.base|) (exists ((|v_#memory_$Pointer$.offset_73| (Array Int (Array Int Int)))) (= |#memory_$Pointer$.offset| (store |v_#memory_$Pointer$.offset_73| |ULTIMATE.start_sll_insert_~new_node~0#1.base| (store (store (select |v_#memory_$Pointer$.offset_73| |ULTIMATE.start_sll_insert_~new_node~0#1.base|) 4 0) 0 (select (select |#memory_$Pointer$.offset| |ULTIMATE.start_sll_insert_~new_node~0#1.base|) 0))))) (exists ((|v_#length_81| (Array Int Int))) (= |#length| (store |v_#length_81| |ULTIMATE.start_sll_insert_~new_node~0#1.base| 8))) (<= 8 (select |#length| |ULTIMATE.start_sll_insert_~new_node~0#1.base|)) (exists ((|v_#memory_$Pointer$.base_73| (Array Int (Array Int Int)))) (= (store |v_#memory_$Pointer$.base_73| |ULTIMATE.start_sll_insert_~new_node~0#1.base| (store (store (select |v_#memory_$Pointer$.base_73| |ULTIMATE.start_sll_insert_~new_node~0#1.base|) 4 0) 0 (select (select |#memory_$Pointer$.base| |ULTIMATE.start_sll_insert_~new_node~0#1.base|) 0))) |#memory_$Pointer$.base|)) (not (= |ULTIMATE.start_sll_insert_~new_node~0#1.base| 0)) (<= (+ |ULTIMATE.start_sll_insert_~new_node~0#1.base| 1) |#StackHeapBarrier|) (exists ((|v_#memory_int_51| (Array Int (Array Int Int))) (|v_#memory_int_50| (Array Int (Array Int Int)))) (and (= |#memory_int| (store |v_#memory_int_51| |ULTIMATE.start_sll_insert_~new_node~0#1.base| (store (select |v_#memory_int_51| |ULTIMATE.start_sll_insert_~new_node~0#1.base|) 0 5))) (= (store |v_#memory_int_50| |ULTIMATE.start_sll_insert_~new_node~0#1.base| (store (select |v_#memory_int_50| |ULTIMATE.start_sll_insert_~new_node~0#1.base|) 4 (select (select |v_#memory_int_51| |ULTIMATE.start_sll_insert_~new_node~0#1.base|) 4))) |v_#memory_int_51|))) (exists ((|v_old(#memory_$Pointer$.base)_AFTER_CALL_11| (Array Int (Array Int Int)))) (= (select (select |v_old(#memory_$Pointer$.base)_AFTER_CALL_11| |ULTIMATE.start_main_~#s~0#1.base|) 0) |ULTIMATE.start_sll_create_#res#1.base|)) (exists ((|v_old(#memory_$Pointer$.offset)_AFTER_CALL_11| (Array Int (Array Int Int)))) (= (select (select |v_old(#memory_$Pointer$.offset)_AFTER_CALL_11| |ULTIMATE.start_main_~#s~0#1.base|) 0) 0)) (= |ULTIMATE.start_sll_insert_#in~head#1.base| |ULTIMATE.start_sll_insert_~head#1.base|)) (and (exists ((|v_#valid_96| (Array Int Int))) (and (= |#valid| (store |v_#valid_96| |ULTIMATE.start_sll_insert_~new_node~0#1.base| 1)) (= (select |v_#valid_96| |ULTIMATE.start_sll_insert_~new_node~0#1.base|) 0))) (= 1 (select |#valid| |ULTIMATE.start_sll_insert_~new_node~0#1.base|)) (= |ULTIMATE.start_sll_insert_#in~head#1.base| |ULTIMATE.start_main_~#s~0#1.base|) (exists ((|v_#memory_$Pointer$.offset_73| (Array Int (Array Int Int)))) (= |#memory_$Pointer$.offset| (store |v_#memory_$Pointer$.offset_73| |ULTIMATE.start_sll_insert_~new_node~0#1.base| (store (store (select |v_#memory_$Pointer$.offset_73| |ULTIMATE.start_sll_insert_~new_node~0#1.base|) 4 0) 0 (select (select |#memory_$Pointer$.offset| |ULTIMATE.start_sll_insert_~new_node~0#1.base|) 0))))) (exists ((|v_#length_81| (Array Int Int))) (= |#length| (store |v_#length_81| |ULTIMATE.start_sll_insert_~new_node~0#1.base| 8))) (<= 8 (select |#length| |ULTIMATE.start_sll_insert_~new_node~0#1.base|)) (exists ((|v_#memory_$Pointer$.base_73| (Array Int (Array Int Int)))) (= (store |v_#memory_$Pointer$.base_73| |ULTIMATE.start_sll_insert_~new_node~0#1.base| (store (store (select |v_#memory_$Pointer$.base_73| |ULTIMATE.start_sll_insert_~new_node~0#1.base|) 4 0) 0 (select (select |#memory_$Pointer$.base| |ULTIMATE.start_sll_insert_~new_node~0#1.base|) 0))) |#memory_$Pointer$.base|)) (not (= |ULTIMATE.start_sll_insert_~new_node~0#1.base| 0)) (<= (+ |ULTIMATE.start_sll_insert_~new_node~0#1.base| 1) |#StackHeapBarrier|) (exists ((|v_#memory_int_51| (Array Int (Array Int Int))) (|v_#memory_int_50| (Array Int (Array Int Int)))) (and (= |#memory_int| (store |v_#memory_int_51| |ULTIMATE.start_sll_insert_~new_node~0#1.base| (store (select |v_#memory_int_51| |ULTIMATE.start_sll_insert_~new_node~0#1.base|) 0 5))) (= (store |v_#memory_int_50| |ULTIMATE.start_sll_insert_~new_node~0#1.base| (store (select |v_#memory_int_50| |ULTIMATE.start_sll_insert_~new_node~0#1.base|) 4 (select (select |v_#memory_int_51| |ULTIMATE.start_sll_insert_~new_node~0#1.base|) 4))) |v_#memory_int_51|))) (exists ((|v_#memory_$Pointer$.offset_BEFORE_CALL_21| (Array Int (Array Int Int)))) (= (select (select |v_#memory_$Pointer$.offset_BEFORE_CALL_21| |ULTIMATE.start_main_~#s~0#1.base|) 0) 0)) (exists ((|v_old(#memory_$Pointer$.base)_AFTER_CALL_12| (Array Int (Array Int Int)))) (= (select (select |v_old(#memory_$Pointer$.base)_AFTER_CALL_12| |ULTIMATE.start_main_~#s~0#1.base|) 0) |ULTIMATE.start_sll_create_#res#1.base|)) (= |ULTIMATE.start_sll_insert_#in~head#1.base| |ULTIMATE.start_sll_insert_~head#1.base|))) (= |ULTIMATE.start_sll_create_#res#1.offset| 0) (= |ULTIMATE.start_main_~data~0#1| 1) (= |ULTIMATE.start_sll_insert_~index#1| 1) (= |ULTIMATE.start_main_~#s~0#1.offset| 0) (= |ULTIMATE.start_main_~len~0#1| 2) (<= 2 |ULTIMATE.start_sll_insert_~head#1.base|) (<= 2 |ULTIMATE.start_main_~#s~0#1.base|) (not (= (select |#valid| |ULTIMATE.start_sll_insert_~head#1.base|) 1)))' at error location [2023-11-12 00:56:21,257 WARN L311 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: ALGORITHM_FAILED [2023-11-12 00:56:21,257 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2023-11-12 00:56:21,258 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [4, 4, 4] total 5 [2023-11-12 00:56:21,258 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1773906906] [2023-11-12 00:56:21,258 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2023-11-12 00:56:21,259 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2023-11-12 00:56:21,259 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2023-11-12 00:56:21,259 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2023-11-12 00:56:21,261 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=43, Invalid=226, Unknown=3, NotChecked=0, Total=272 [2023-11-12 00:56:21,261 INFO L87 Difference]: Start difference. First operand 76 states and 85 transitions. Second operand has 5 states, 5 states have (on average 3.8) internal successors, (19), 5 states have internal predecessors, (19), 3 states have call successors, (4), 2 states have call predecessors, (4), 2 states have return successors, (4), 3 states have call predecessors, (4), 3 states have call successors, (4) [2023-11-12 00:56:21,321 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-11-12 00:56:21,321 INFO L93 Difference]: Finished difference Result 80 states and 90 transitions. [2023-11-12 00:56:21,322 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2023-11-12 00:56:21,322 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 3.8) internal successors, (19), 5 states have internal predecessors, (19), 3 states have call successors, (4), 2 states have call predecessors, (4), 2 states have return successors, (4), 3 states have call predecessors, (4), 3 states have call successors, (4) Word has length 19 [2023-11-12 00:56:21,322 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-11-12 00:56:21,323 INFO L225 Difference]: With dead ends: 80 [2023-11-12 00:56:21,323 INFO L226 Difference]: Without dead ends: 80 [2023-11-12 00:56:21,323 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 59 GetRequests, 42 SyntacticMatches, 2 SemanticMatches, 15 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 46 ImplicationChecksByTransitivity, 3.0s TimeCoverageRelationStatistics Valid=43, Invalid=226, Unknown=3, NotChecked=0, Total=272 [2023-11-12 00:56:21,324 INFO L413 NwaCegarLoop]: 66 mSDtfsCounter, 2 mSDsluCounter, 130 mSDsCounter, 0 mSdLazyCounter, 55 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 3 SdHoareTripleChecker+Valid, 196 SdHoareTripleChecker+Invalid, 56 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 55 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2023-11-12 00:56:21,325 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [3 Valid, 196 Invalid, 56 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 55 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2023-11-12 00:56:21,325 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 80 states. [2023-11-12 00:56:21,331 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 80 to 80. [2023-11-12 00:56:21,332 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 80 states, 43 states have (on average 1.9534883720930232) internal successors, (84), 75 states have internal predecessors, (84), 3 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) [2023-11-12 00:56:21,335 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 80 states to 80 states and 90 transitions. [2023-11-12 00:56:21,335 INFO L78 Accepts]: Start accepts. Automaton has 80 states and 90 transitions. Word has length 19 [2023-11-12 00:56:21,335 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-11-12 00:56:21,336 INFO L495 AbstractCegarLoop]: Abstraction has 80 states and 90 transitions. [2023-11-12 00:56:21,336 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 3.8) internal successors, (19), 5 states have internal predecessors, (19), 3 states have call successors, (4), 2 states have call predecessors, (4), 2 states have return successors, (4), 3 states have call predecessors, (4), 3 states have call successors, (4) [2023-11-12 00:56:21,336 INFO L276 IsEmpty]: Start isEmpty. Operand 80 states and 90 transitions. [2023-11-12 00:56:21,337 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 29 [2023-11-12 00:56:21,337 INFO L187 NwaCegarLoop]: Found error trace [2023-11-12 00:56:21,338 INFO L195 NwaCegarLoop]: trace histogram [3, 3, 3, 3, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1] [2023-11-12 00:56:21,345 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_e9dc0cbb-d2f2-4273-b8e9-d506e75045be/bin/utaipan-verify-NcY6lQBIFX/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Forceful destruction successful, exit code 0 [2023-11-12 00:56:21,544 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5,2 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_e9dc0cbb-d2f2-4273-b8e9-d506e75045be/bin/utaipan-verify-NcY6lQBIFX/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-11-12 00:56:21,545 INFO L420 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 36 more)] === [2023-11-12 00:56:21,546 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-12 00:56:21,546 INFO L85 PathProgramCache]: Analyzing trace with hash -1137670442, now seen corresponding path program 2 times [2023-11-12 00:56:21,546 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2023-11-12 00:56:21,546 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [149098470] [2023-11-12 00:56:21,546 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-12 00:56:21,547 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-12 00:56:21,604 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-12 00:56:22,177 INFO L134 CoverageAnalysis]: Checked inductivity of 21 backedges. 0 proven. 16 refuted. 0 times theorem prover too weak. 5 trivial. 0 not checked. [2023-11-12 00:56:22,177 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2023-11-12 00:56:22,177 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [149098470] [2023-11-12 00:56:22,178 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [149098470] provided 0 perfect and 1 imperfect interpolant sequences [2023-11-12 00:56:22,178 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [2018183458] [2023-11-12 00:56:22,178 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2023-11-12 00:56:22,178 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-11-12 00:56:22,178 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_e9dc0cbb-d2f2-4273-b8e9-d506e75045be/bin/utaipan-verify-NcY6lQBIFX/z3 [2023-11-12 00:56:22,180 INFO L229 MonitoredProcess]: Starting monitored process 3 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_e9dc0cbb-d2f2-4273-b8e9-d506e75045be/bin/utaipan-verify-NcY6lQBIFX/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2023-11-12 00:56:22,204 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_e9dc0cbb-d2f2-4273-b8e9-d506e75045be/bin/utaipan-verify-NcY6lQBIFX/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Waiting until timeout for monitored process [2023-11-12 00:56:22,372 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 3 check-sat command(s) [2023-11-12 00:56:22,372 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2023-11-12 00:56:22,375 INFO L262 TraceCheckSpWp]: Trace formula consists of 339 conjuncts, 22 conjunts are in the unsatisfiable core [2023-11-12 00:56:22,379 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-11-12 00:56:22,407 INFO L351 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2023-11-12 00:56:22,421 INFO L351 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 5 treesize of output 3 [2023-11-12 00:56:22,428 WARN L876 $PredicateComparison]: unable to prove that (exists ((|node_create_~temp~0#1.base| Int)) (= |c_#valid| (store |c_old(#valid)| |node_create_~temp~0#1.base| 1))) is different from true [2023-11-12 00:56:22,460 INFO L322 Elim1Store]: treesize reduction 15, result has 25.0 percent of original size [2023-11-12 00:56:22,460 INFO L351 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 12 treesize of output 14 [2023-11-12 00:56:22,513 INFO L351 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 5 treesize of output 3 [2023-11-12 00:56:22,529 WARN L876 $PredicateComparison]: unable to prove that (exists ((|node_create_~temp~0#1.base| Int)) (and (<= (+ |node_create_~temp~0#1.base| 1) |c_#StackHeapBarrier|) (= |c_#valid| (store |c_old(#valid)| |node_create_~temp~0#1.base| (select |c_#valid| |node_create_~temp~0#1.base|))))) is different from true [2023-11-12 00:56:22,557 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-11-12 00:56:22,558 INFO L351 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 14 treesize of output 9 [2023-11-12 00:56:22,602 INFO L351 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 5 treesize of output 3 [2023-11-12 00:56:22,634 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-11-12 00:56:22,636 INFO L351 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 14 treesize of output 9 [2023-11-12 00:56:22,642 INFO L134 CoverageAnalysis]: Checked inductivity of 21 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 13 trivial. 8 not checked. [2023-11-12 00:56:22,642 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2023-11-12 00:56:22,721 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [2018183458] provided 0 perfect and 1 imperfect interpolant sequences [2023-11-12 00:56:22,721 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSifa [884732028] [2023-11-12 00:56:22,723 INFO L159 IcfgInterpreter]: Started Sifa with 14 locations of interest [2023-11-12 00:56:22,724 INFO L166 IcfgInterpreter]: Building call graph [2023-11-12 00:56:22,724 INFO L171 IcfgInterpreter]: Initial procedures are [ULTIMATE.start] [2023-11-12 00:56:22,724 INFO L176 IcfgInterpreter]: Starting interpretation [2023-11-12 00:56:22,724 INFO L197 IcfgInterpreter]: Interpreting procedure ULTIMATE.start with input of size 1 for LOIs [2023-11-12 00:56:24,523 INFO L197 IcfgInterpreter]: Interpreting procedure node_create with input of size 38 for LOIs [2023-11-12 00:56:24,599 INFO L180 IcfgInterpreter]: Interpretation finished [2023-11-12 00:56:24,609 WARN L876 $PredicateComparison]: unable to prove that (and (not (= (select |c_#valid| |c_ULTIMATE.start_sll_insert_~head#1.base|) 1)) (= |c_ULTIMATE.start_sll_insert_~index#1| 1) (= |c_ULTIMATE.start_main_~uneq~0#1| 5) (= |c_ULTIMATE.start_sll_insert_~new_node~0#1.offset| 0) (= |c_ULTIMATE.start_main_~#s~0#1.offset| 0) (<= 2 |c_ULTIMATE.start_sll_insert_#in~head#1.base|) (<= 2 |c_ULTIMATE.start_sll_insert_~head#1.base|) (<= 1 |c_#StackHeapBarrier|) (= |c_ULTIMATE.start_sll_insert_~snd_to_last~0#1.offset| 0) (= |c_ULTIMATE.start_sll_create_#res#1.offset| 0) (= |c_ULTIMATE.start_main_~mid_index~0#1| 1) (= |c_ULTIMATE.start_main_~data~0#1| 1) (= |c_ULTIMATE.start_sll_insert_#in~data#1| 5) (= |c_ULTIMATE.start_sll_insert_#in~index#1| 1) (= |c_ULTIMATE.start_sll_insert_~head#1.offset| 0) (= |c_ULTIMATE.start_sll_insert_#in~head#1.offset| 0) (= 5 |c_ULTIMATE.start_sll_insert_~data#1|) (<= 2 |c_ULTIMATE.start_main_~#s~0#1.base|) (let ((.cse0 (exists ((|v_#memory_int_62| (Array Int (Array Int Int))) (|v_#memory_int_63| (Array Int (Array Int Int)))) (let ((.cse11 (select |v_#memory_int_63| |c_ULTIMATE.start_sll_insert_~new_node~0#1.base|))) (and (= |v_#memory_int_63| (store |v_#memory_int_62| |c_ULTIMATE.start_sll_insert_~new_node~0#1.base| (store (select |v_#memory_int_62| |c_ULTIMATE.start_sll_insert_~new_node~0#1.base|) 4 (select .cse11 4)))) (= (store |v_#memory_int_63| |c_ULTIMATE.start_sll_insert_~new_node~0#1.base| (store .cse11 0 5)) |c_#memory_int|))))) (.cse1 (exists ((|v_#valid_109| (Array Int Int))) (and (= |c_#valid| (store |v_#valid_109| |c_ULTIMATE.start_sll_insert_~new_node~0#1.base| 1)) (= (select |v_#valid_109| |c_ULTIMATE.start_sll_insert_~new_node~0#1.base|) 0)))) (.cse2 (<= (+ |c_ULTIMATE.start_sll_insert_~new_node~0#1.base| 1) |c_#StackHeapBarrier|)) (.cse3 (= (select |c_#valid| |c_ULTIMATE.start_sll_insert_~new_node~0#1.base|) 1)) (.cse4 (<= 8 (select |c_#length| |c_ULTIMATE.start_sll_insert_~new_node~0#1.base|))) (.cse5 (= |c_ULTIMATE.start_sll_insert_#in~head#1.base| |c_ULTIMATE.start_main_~#s~0#1.base|)) (.cse6 (= |c_ULTIMATE.start_sll_insert_#in~head#1.base| |c_ULTIMATE.start_sll_insert_~head#1.base|)) (.cse7 (exists ((|v_#memory_$Pointer$.offset_85| (Array Int (Array Int Int)))) (= (store |v_#memory_$Pointer$.offset_85| |c_ULTIMATE.start_sll_insert_~new_node~0#1.base| (store (store (select |v_#memory_$Pointer$.offset_85| |c_ULTIMATE.start_sll_insert_~new_node~0#1.base|) 4 0) 0 (select (select |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_sll_insert_~new_node~0#1.base|) 0))) |c_#memory_$Pointer$.offset|))) (.cse8 (not (= |c_ULTIMATE.start_sll_insert_~new_node~0#1.base| 0))) (.cse9 (exists ((|v_#memory_$Pointer$.base_85| (Array Int (Array Int Int)))) (= |c_#memory_$Pointer$.base| (store |v_#memory_$Pointer$.base_85| |c_ULTIMATE.start_sll_insert_~new_node~0#1.base| (store (store (select |v_#memory_$Pointer$.base_85| |c_ULTIMATE.start_sll_insert_~new_node~0#1.base|) 4 0) 0 (select (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_sll_insert_~new_node~0#1.base|) 0)))))) (.cse10 (exists ((|v_#length_88| (Array Int Int))) (= |c_#length| (store |v_#length_88| |c_ULTIMATE.start_sll_insert_~new_node~0#1.base| 8))))) (or (and (exists ((|v_old(#memory_$Pointer$.offset)_AFTER_CALL_24| (Array Int (Array Int Int)))) (= (select (select |v_old(#memory_$Pointer$.offset)_AFTER_CALL_24| |c_ULTIMATE.start_main_~#s~0#1.base|) 0) 0)) .cse0 .cse1 .cse2 .cse3 .cse4 .cse5 .cse6 .cse7 .cse8 (exists ((|v_old(#memory_$Pointer$.base)_AFTER_CALL_24| (Array Int (Array Int Int)))) (= |c_ULTIMATE.start_sll_create_#res#1.base| (select (select |v_old(#memory_$Pointer$.base)_AFTER_CALL_24| |c_ULTIMATE.start_main_~#s~0#1.base|) 0))) .cse9 .cse10) (and .cse0 .cse1 .cse2 .cse3 .cse4 .cse5 .cse6 .cse7 .cse8 .cse9 .cse10 (exists ((|v_old(#memory_$Pointer$.offset)_AFTER_CALL_25| (Array Int (Array Int Int)))) (= (select (select |v_old(#memory_$Pointer$.offset)_AFTER_CALL_25| |c_ULTIMATE.start_main_~#s~0#1.base|) 0) 0)) (exists ((|v_old(#memory_$Pointer$.base)_AFTER_CALL_25| (Array Int (Array Int Int)))) (= |c_ULTIMATE.start_sll_create_#res#1.base| (select (select |v_old(#memory_$Pointer$.base)_AFTER_CALL_25| |c_ULTIMATE.start_main_~#s~0#1.base|) 0)))))) (= |c_ULTIMATE.start_main_~len~0#1| 2) (= |c_ULTIMATE.start_sll_insert_~snd_to_last~0#1.base| 0)) is different from true [2023-11-12 00:56:28,023 INFO L133 SifaRunner]: Sifa could not show that error location is unreachable, found '1279#(and (<= 1 |#StackHeapBarrier|) (= |ULTIMATE.start_sll_insert_#in~head#1.offset| 0) (= |ULTIMATE.start_main_~mid_index~0#1| 1) (= |ULTIMATE.start_sll_insert_#in~index#1| 1) (= |ULTIMATE.start_sll_insert_~snd_to_last~0#1.offset| 0) (= |ULTIMATE.start_main_~uneq~0#1| 5) (= 5 |ULTIMATE.start_sll_insert_~data#1|) (= |ULTIMATE.start_sll_insert_~head#1.offset| 0) (<= 2 |ULTIMATE.start_sll_insert_#in~head#1.base|) (= |ULTIMATE.start_sll_insert_#in~data#1| 5) (= |ULTIMATE.start_sll_insert_~snd_to_last~0#1.base| 0) (= |ULTIMATE.start_sll_insert_~new_node~0#1.offset| 0) (= |ULTIMATE.start_sll_create_#res#1.offset| 0) (= |ULTIMATE.start_main_~data~0#1| 1) (or (and (exists ((|v_#memory_$Pointer$.offset_85| (Array Int (Array Int Int)))) (= |#memory_$Pointer$.offset| (store |v_#memory_$Pointer$.offset_85| |ULTIMATE.start_sll_insert_~new_node~0#1.base| (store (store (select |v_#memory_$Pointer$.offset_85| |ULTIMATE.start_sll_insert_~new_node~0#1.base|) 4 0) 0 (select (select |#memory_$Pointer$.offset| |ULTIMATE.start_sll_insert_~new_node~0#1.base|) 0))))) (= 1 (select |#valid| |ULTIMATE.start_sll_insert_~new_node~0#1.base|)) (= |ULTIMATE.start_sll_insert_#in~head#1.base| |ULTIMATE.start_main_~#s~0#1.base|) (exists ((|v_old(#memory_$Pointer$.base)_AFTER_CALL_24| (Array Int (Array Int Int)))) (= (select (select |v_old(#memory_$Pointer$.base)_AFTER_CALL_24| |ULTIMATE.start_main_~#s~0#1.base|) 0) |ULTIMATE.start_sll_create_#res#1.base|)) (exists ((|v_#memory_int_62| (Array Int (Array Int Int))) (|v_#memory_int_63| (Array Int (Array Int Int)))) (and (= |#memory_int| (store |v_#memory_int_63| |ULTIMATE.start_sll_insert_~new_node~0#1.base| (store (select |v_#memory_int_63| |ULTIMATE.start_sll_insert_~new_node~0#1.base|) 0 5))) (= (store |v_#memory_int_62| |ULTIMATE.start_sll_insert_~new_node~0#1.base| (store (select |v_#memory_int_62| |ULTIMATE.start_sll_insert_~new_node~0#1.base|) 4 (select (select |v_#memory_int_63| |ULTIMATE.start_sll_insert_~new_node~0#1.base|) 4))) |v_#memory_int_63|))) (<= 8 (select |#length| |ULTIMATE.start_sll_insert_~new_node~0#1.base|)) (not (= |ULTIMATE.start_sll_insert_~new_node~0#1.base| 0)) (<= (+ |ULTIMATE.start_sll_insert_~new_node~0#1.base| 1) |#StackHeapBarrier|) (exists ((|v_#length_88| (Array Int Int))) (= (store |v_#length_88| |ULTIMATE.start_sll_insert_~new_node~0#1.base| 8) |#length|)) (exists ((|v_#memory_$Pointer$.base_85| (Array Int (Array Int Int)))) (= |#memory_$Pointer$.base| (store |v_#memory_$Pointer$.base_85| |ULTIMATE.start_sll_insert_~new_node~0#1.base| (store (store (select |v_#memory_$Pointer$.base_85| |ULTIMATE.start_sll_insert_~new_node~0#1.base|) 4 0) 0 (select (select |#memory_$Pointer$.base| |ULTIMATE.start_sll_insert_~new_node~0#1.base|) 0))))) (exists ((|v_#valid_109| (Array Int Int))) (and (= (select |v_#valid_109| |ULTIMATE.start_sll_insert_~new_node~0#1.base|) 0) (= (store |v_#valid_109| |ULTIMATE.start_sll_insert_~new_node~0#1.base| 1) |#valid|))) (exists ((|v_old(#memory_$Pointer$.offset)_AFTER_CALL_24| (Array Int (Array Int Int)))) (= (select (select |v_old(#memory_$Pointer$.offset)_AFTER_CALL_24| |ULTIMATE.start_main_~#s~0#1.base|) 0) 0)) (= |ULTIMATE.start_sll_insert_#in~head#1.base| |ULTIMATE.start_sll_insert_~head#1.base|)) (and (exists ((|v_#memory_$Pointer$.offset_85| (Array Int (Array Int Int)))) (= |#memory_$Pointer$.offset| (store |v_#memory_$Pointer$.offset_85| |ULTIMATE.start_sll_insert_~new_node~0#1.base| (store (store (select |v_#memory_$Pointer$.offset_85| |ULTIMATE.start_sll_insert_~new_node~0#1.base|) 4 0) 0 (select (select |#memory_$Pointer$.offset| |ULTIMATE.start_sll_insert_~new_node~0#1.base|) 0))))) (= 1 (select |#valid| |ULTIMATE.start_sll_insert_~new_node~0#1.base|)) (= |ULTIMATE.start_sll_insert_#in~head#1.base| |ULTIMATE.start_main_~#s~0#1.base|) (exists ((|v_#memory_int_62| (Array Int (Array Int Int))) (|v_#memory_int_63| (Array Int (Array Int Int)))) (and (= |#memory_int| (store |v_#memory_int_63| |ULTIMATE.start_sll_insert_~new_node~0#1.base| (store (select |v_#memory_int_63| |ULTIMATE.start_sll_insert_~new_node~0#1.base|) 0 5))) (= (store |v_#memory_int_62| |ULTIMATE.start_sll_insert_~new_node~0#1.base| (store (select |v_#memory_int_62| |ULTIMATE.start_sll_insert_~new_node~0#1.base|) 4 (select (select |v_#memory_int_63| |ULTIMATE.start_sll_insert_~new_node~0#1.base|) 4))) |v_#memory_int_63|))) (<= 8 (select |#length| |ULTIMATE.start_sll_insert_~new_node~0#1.base|)) (exists ((|v_old(#memory_$Pointer$.base)_AFTER_CALL_25| (Array Int (Array Int Int)))) (= (select (select |v_old(#memory_$Pointer$.base)_AFTER_CALL_25| |ULTIMATE.start_main_~#s~0#1.base|) 0) |ULTIMATE.start_sll_create_#res#1.base|)) (not (= |ULTIMATE.start_sll_insert_~new_node~0#1.base| 0)) (<= (+ |ULTIMATE.start_sll_insert_~new_node~0#1.base| 1) |#StackHeapBarrier|) (exists ((|v_#length_88| (Array Int Int))) (= (store |v_#length_88| |ULTIMATE.start_sll_insert_~new_node~0#1.base| 8) |#length|)) (exists ((|v_#memory_$Pointer$.base_85| (Array Int (Array Int Int)))) (= |#memory_$Pointer$.base| (store |v_#memory_$Pointer$.base_85| |ULTIMATE.start_sll_insert_~new_node~0#1.base| (store (store (select |v_#memory_$Pointer$.base_85| |ULTIMATE.start_sll_insert_~new_node~0#1.base|) 4 0) 0 (select (select |#memory_$Pointer$.base| |ULTIMATE.start_sll_insert_~new_node~0#1.base|) 0))))) (exists ((|v_#valid_109| (Array Int Int))) (and (= (select |v_#valid_109| |ULTIMATE.start_sll_insert_~new_node~0#1.base|) 0) (= (store |v_#valid_109| |ULTIMATE.start_sll_insert_~new_node~0#1.base| 1) |#valid|))) (= |ULTIMATE.start_sll_insert_#in~head#1.base| |ULTIMATE.start_sll_insert_~head#1.base|) (exists ((|v_old(#memory_$Pointer$.offset)_AFTER_CALL_25| (Array Int (Array Int Int)))) (= (select (select |v_old(#memory_$Pointer$.offset)_AFTER_CALL_25| |ULTIMATE.start_main_~#s~0#1.base|) 0) 0)))) (= |ULTIMATE.start_sll_insert_~index#1| 1) (= |ULTIMATE.start_main_~#s~0#1.offset| 0) (= |ULTIMATE.start_main_~len~0#1| 2) (<= 2 |ULTIMATE.start_sll_insert_~head#1.base|) (<= 2 |ULTIMATE.start_main_~#s~0#1.base|) (not (= (select |#valid| |ULTIMATE.start_sll_insert_~head#1.base|) 1)))' at error location [2023-11-12 00:56:28,023 WARN L311 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: ALGORITHM_FAILED [2023-11-12 00:56:28,024 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2023-11-12 00:56:28,024 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [11, 6] total 14 [2023-11-12 00:56:28,024 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [17904151] [2023-11-12 00:56:28,024 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2023-11-12 00:56:28,024 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 16 states [2023-11-12 00:56:28,025 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2023-11-12 00:56:28,025 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 16 interpolants. [2023-11-12 00:56:28,026 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=100, Invalid=559, Unknown=3, NotChecked=150, Total=812 [2023-11-12 00:56:28,026 INFO L87 Difference]: Start difference. First operand 80 states and 90 transitions. Second operand has 16 states, 11 states have (on average 2.727272727272727) internal successors, (30), 14 states have internal predecessors, (30), 3 states have call successors, (3), 1 states have call predecessors, (3), 5 states have return successors, (6), 3 states have call predecessors, (6), 3 states have call successors, (6) [2023-11-12 00:56:28,424 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-11-12 00:56:28,424 INFO L93 Difference]: Finished difference Result 86 states and 97 transitions. [2023-11-12 00:56:28,425 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2023-11-12 00:56:28,425 INFO L78 Accepts]: Start accepts. Automaton has has 16 states, 11 states have (on average 2.727272727272727) internal successors, (30), 14 states have internal predecessors, (30), 3 states have call successors, (3), 1 states have call predecessors, (3), 5 states have return successors, (6), 3 states have call predecessors, (6), 3 states have call successors, (6) Word has length 28 [2023-11-12 00:56:28,425 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-11-12 00:56:28,426 INFO L225 Difference]: With dead ends: 86 [2023-11-12 00:56:28,426 INFO L226 Difference]: Without dead ends: 86 [2023-11-12 00:56:28,427 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 75 GetRequests, 45 SyntacticMatches, 1 SemanticMatches, 29 ConstructedPredicates, 3 IntricatePredicates, 0 DeprecatedPredicates, 193 ImplicationChecksByTransitivity, 3.7s TimeCoverageRelationStatistics Valid=119, Invalid=646, Unknown=3, NotChecked=162, Total=930 [2023-11-12 00:56:28,428 INFO L413 NwaCegarLoop]: 35 mSDtfsCounter, 168 mSDsluCounter, 159 mSDsCounter, 0 mSdLazyCounter, 271 mSolverCounterSat, 7 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 168 SdHoareTripleChecker+Valid, 194 SdHoareTripleChecker+Invalid, 452 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 7 IncrementalHoareTripleChecker+Valid, 271 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 174 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2023-11-12 00:56:28,428 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [168 Valid, 194 Invalid, 452 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [7 Valid, 271 Invalid, 0 Unknown, 174 Unchecked, 0.3s Time] [2023-11-12 00:56:28,429 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 86 states. [2023-11-12 00:56:28,432 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 86 to 76. [2023-11-12 00:56:28,433 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 76 states, 43 states have (on average 1.8604651162790697) internal successors, (80), 71 states have internal predecessors, (80), 3 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) [2023-11-12 00:56:28,434 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 76 states to 76 states and 86 transitions. [2023-11-12 00:56:28,434 INFO L78 Accepts]: Start accepts. Automaton has 76 states and 86 transitions. Word has length 28 [2023-11-12 00:56:28,434 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-11-12 00:56:28,434 INFO L495 AbstractCegarLoop]: Abstraction has 76 states and 86 transitions. [2023-11-12 00:56:28,435 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 16 states, 11 states have (on average 2.727272727272727) internal successors, (30), 14 states have internal predecessors, (30), 3 states have call successors, (3), 1 states have call predecessors, (3), 5 states have return successors, (6), 3 states have call predecessors, (6), 3 states have call successors, (6) [2023-11-12 00:56:28,435 INFO L276 IsEmpty]: Start isEmpty. Operand 76 states and 86 transitions. [2023-11-12 00:56:28,436 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 29 [2023-11-12 00:56:28,436 INFO L187 NwaCegarLoop]: Found error trace [2023-11-12 00:56:28,436 INFO L195 NwaCegarLoop]: trace histogram [3, 3, 3, 3, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1] [2023-11-12 00:56:28,447 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_e9dc0cbb-d2f2-4273-b8e9-d506e75045be/bin/utaipan-verify-NcY6lQBIFX/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Ended with exit code 0 [2023-11-12 00:56:28,642 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6,3 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_e9dc0cbb-d2f2-4273-b8e9-d506e75045be/bin/utaipan-verify-NcY6lQBIFX/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-11-12 00:56:28,643 INFO L420 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr3REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 36 more)] === [2023-11-12 00:56:28,643 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-12 00:56:28,643 INFO L85 PathProgramCache]: Analyzing trace with hash -1137670441, now seen corresponding path program 1 times [2023-11-12 00:56:28,644 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2023-11-12 00:56:28,644 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [685384732] [2023-11-12 00:56:28,644 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-12 00:56:28,644 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-12 00:56:28,701 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-12 00:56:29,369 INFO L134 CoverageAnalysis]: Checked inductivity of 21 backedges. 0 proven. 13 refuted. 0 times theorem prover too weak. 8 trivial. 0 not checked. [2023-11-12 00:56:29,369 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2023-11-12 00:56:29,369 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [685384732] [2023-11-12 00:56:29,369 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [685384732] provided 0 perfect and 1 imperfect interpolant sequences [2023-11-12 00:56:29,369 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [242812969] [2023-11-12 00:56:29,370 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-12 00:56:29,370 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-11-12 00:56:29,370 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_e9dc0cbb-d2f2-4273-b8e9-d506e75045be/bin/utaipan-verify-NcY6lQBIFX/z3 [2023-11-12 00:56:29,371 INFO L229 MonitoredProcess]: Starting monitored process 4 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_e9dc0cbb-d2f2-4273-b8e9-d506e75045be/bin/utaipan-verify-NcY6lQBIFX/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2023-11-12 00:56:29,384 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_e9dc0cbb-d2f2-4273-b8e9-d506e75045be/bin/utaipan-verify-NcY6lQBIFX/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Waiting until timeout for monitored process [2023-11-12 00:56:29,525 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-12 00:56:29,527 INFO L262 TraceCheckSpWp]: Trace formula consists of 339 conjuncts, 26 conjunts are in the unsatisfiable core [2023-11-12 00:56:29,533 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-11-12 00:56:29,542 INFO L351 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 8 treesize of output 1 [2023-11-12 00:56:29,571 INFO L351 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 5 treesize of output 3 [2023-11-12 00:56:29,579 WARN L876 $PredicateComparison]: unable to prove that (exists ((|node_create_~temp~0#1.base| Int)) (and (<= (+ |node_create_~temp~0#1.base| 1) |c_#StackHeapBarrier|) (= (store |c_old(#length)| |node_create_~temp~0#1.base| (select |c_#length| |node_create_~temp~0#1.base|)) |c_#length|))) is different from true [2023-11-12 00:56:29,604 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-11-12 00:56:29,605 INFO L351 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 14 treesize of output 9 [2023-11-12 00:56:29,633 INFO L351 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 5 treesize of output 3 [2023-11-12 00:56:29,661 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-11-12 00:56:29,662 INFO L351 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 14 treesize of output 9 [2023-11-12 00:56:29,717 INFO L351 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 5 treesize of output 3 [2023-11-12 00:56:29,744 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-11-12 00:56:29,745 INFO L351 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 14 treesize of output 9 [2023-11-12 00:56:29,767 INFO L134 CoverageAnalysis]: Checked inductivity of 21 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 21 trivial. 0 not checked. [2023-11-12 00:56:29,767 INFO L323 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2023-11-12 00:56:29,768 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [242812969] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-12 00:56:29,768 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2023-11-12 00:56:29,768 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [10] total 14 [2023-11-12 00:56:29,768 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1736488630] [2023-11-12 00:56:29,768 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-12 00:56:29,769 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2023-11-12 00:56:29,769 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2023-11-12 00:56:29,769 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2023-11-12 00:56:29,770 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=43, Invalid=170, Unknown=1, NotChecked=26, Total=240 [2023-11-12 00:56:29,770 INFO L87 Difference]: Start difference. First operand 76 states and 86 transitions. Second operand has 7 states, 5 states have (on average 2.2) internal successors, (11), 5 states have internal predecessors, (11), 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 00:56:29,925 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-11-12 00:56:29,925 INFO L93 Difference]: Finished difference Result 74 states and 84 transitions. [2023-11-12 00:56:29,925 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2023-11-12 00:56:29,925 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 5 states have (on average 2.2) internal successors, (11), 5 states have internal predecessors, (11), 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) Word has length 28 [2023-11-12 00:56:29,925 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-11-12 00:56:29,926 INFO L225 Difference]: With dead ends: 74 [2023-11-12 00:56:29,926 INFO L226 Difference]: Without dead ends: 74 [2023-11-12 00:56:29,927 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 42 GetRequests, 27 SyntacticMatches, 0 SemanticMatches, 15 ConstructedPredicates, 1 IntricatePredicates, 0 DeprecatedPredicates, 43 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=51, Invalid=192, Unknown=1, NotChecked=28, Total=272 [2023-11-12 00:56:29,927 INFO L413 NwaCegarLoop]: 52 mSDtfsCounter, 15 mSDsluCounter, 135 mSDsCounter, 0 mSdLazyCounter, 155 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 15 SdHoareTripleChecker+Valid, 187 SdHoareTripleChecker+Invalid, 252 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 155 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 96 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2023-11-12 00:56:29,928 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [15 Valid, 187 Invalid, 252 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 155 Invalid, 0 Unknown, 96 Unchecked, 0.1s Time] [2023-11-12 00:56:29,929 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 74 states. [2023-11-12 00:56:29,932 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 74 to 74. [2023-11-12 00:56:29,932 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 74 states, 43 states have (on average 1.813953488372093) internal successors, (78), 69 states have internal predecessors, (78), 3 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) [2023-11-12 00:56:29,933 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 74 states to 74 states and 84 transitions. [2023-11-12 00:56:29,933 INFO L78 Accepts]: Start accepts. Automaton has 74 states and 84 transitions. Word has length 28 [2023-11-12 00:56:29,934 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-11-12 00:56:29,934 INFO L495 AbstractCegarLoop]: Abstraction has 74 states and 84 transitions. [2023-11-12 00:56:29,934 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 5 states have (on average 2.2) internal successors, (11), 5 states have internal predecessors, (11), 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 00:56:29,934 INFO L276 IsEmpty]: Start isEmpty. Operand 74 states and 84 transitions. [2023-11-12 00:56:29,935 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 31 [2023-11-12 00:56:29,935 INFO L187 NwaCegarLoop]: Found error trace [2023-11-12 00:56:29,936 INFO L195 NwaCegarLoop]: trace histogram [3, 3, 3, 3, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1] [2023-11-12 00:56:29,953 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_e9dc0cbb-d2f2-4273-b8e9-d506e75045be/bin/utaipan-verify-NcY6lQBIFX/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Forceful destruction successful, exit code 0 [2023-11-12 00:56:30,142 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7,4 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_e9dc0cbb-d2f2-4273-b8e9-d506e75045be/bin/utaipan-verify-NcY6lQBIFX/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-11-12 00:56:30,142 INFO L420 AbstractCegarLoop]: === Iteration 9 === Targeting ULTIMATE.startErr4REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 36 more)] === [2023-11-12 00:56:30,142 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-12 00:56:30,142 INFO L85 PathProgramCache]: Analyzing trace with hash 1915535143, now seen corresponding path program 1 times [2023-11-12 00:56:30,143 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2023-11-12 00:56:30,143 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1953506097] [2023-11-12 00:56:30,143 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-12 00:56:30,143 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-12 00:56:30,172 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-12 00:56:30,760 INFO L134 CoverageAnalysis]: Checked inductivity of 21 backedges. 15 proven. 1 refuted. 0 times theorem prover too weak. 5 trivial. 0 not checked. [2023-11-12 00:56:30,760 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2023-11-12 00:56:30,760 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1953506097] [2023-11-12 00:56:30,760 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1953506097] provided 0 perfect and 1 imperfect interpolant sequences [2023-11-12 00:56:30,760 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [56534264] [2023-11-12 00:56:30,760 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-12 00:56:30,761 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-11-12 00:56:30,761 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_e9dc0cbb-d2f2-4273-b8e9-d506e75045be/bin/utaipan-verify-NcY6lQBIFX/z3 [2023-11-12 00:56:30,762 INFO L229 MonitoredProcess]: Starting monitored process 5 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_e9dc0cbb-d2f2-4273-b8e9-d506e75045be/bin/utaipan-verify-NcY6lQBIFX/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2023-11-12 00:56:30,780 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_e9dc0cbb-d2f2-4273-b8e9-d506e75045be/bin/utaipan-verify-NcY6lQBIFX/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Waiting until timeout for monitored process [2023-11-12 00:56:30,930 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-12 00:56:30,932 INFO L262 TraceCheckSpWp]: Trace formula consists of 352 conjuncts, 39 conjunts are in the unsatisfiable core [2023-11-12 00:56:30,936 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-11-12 00:56:30,997 INFO L351 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2023-11-12 00:56:31,151 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 9 treesize of output 5 [2023-11-12 00:56:31,232 WARN L876 $PredicateComparison]: unable to prove that (exists ((|node_create_~temp~0#1.base| Int)) (and (<= (+ |node_create_~temp~0#1.base| 1) |c_#StackHeapBarrier|) (= |c_#memory_$Pointer$.base| (store |c_old(#memory_$Pointer$.base)| |node_create_~temp~0#1.base| (select |c_#memory_$Pointer$.base| |node_create_~temp~0#1.base|))) (= |c_#valid| (store |c_old(#valid)| |node_create_~temp~0#1.base| 1)))) is different from true [2023-11-12 00:56:31,251 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-11-12 00:56:31,252 INFO L351 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 18 treesize of output 13 [2023-11-12 00:56:31,267 INFO L322 Elim1Store]: treesize reduction 27, result has 25.0 percent of original size [2023-11-12 00:56:31,268 INFO L351 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 16 treesize of output 18 [2023-11-12 00:56:31,338 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 17 treesize of output 9 [2023-11-12 00:56:31,363 INFO L134 CoverageAnalysis]: Checked inductivity of 21 backedges. 17 proven. 0 refuted. 0 times theorem prover too weak. 3 trivial. 1 not checked. [2023-11-12 00:56:31,364 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2023-11-12 00:56:33,440 WARN L854 $PredicateComparison]: unable to prove that (forall ((|v_node_create_~temp~0#1.base_26| Int) (v_ArrVal_484 (Array Int Int))) (or (< |c_#StackHeapBarrier| (+ |v_node_create_~temp~0#1.base_26| 1)) (= (select (store |c_#valid| |v_node_create_~temp~0#1.base_26| 1) (select (select (store |c_#memory_$Pointer$.base| |v_node_create_~temp~0#1.base_26| v_ArrVal_484) |c_ULTIMATE.start_sll_insert_~head#1.base|) |c_ULTIMATE.start_sll_insert_~head#1.offset|)) 1))) is different from false [2023-11-12 00:56:33,442 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [56534264] provided 0 perfect and 1 imperfect interpolant sequences [2023-11-12 00:56:33,443 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSifa [1556321533] [2023-11-12 00:56:33,445 INFO L159 IcfgInterpreter]: Started Sifa with 16 locations of interest [2023-11-12 00:56:33,445 INFO L166 IcfgInterpreter]: Building call graph [2023-11-12 00:56:33,446 INFO L171 IcfgInterpreter]: Initial procedures are [ULTIMATE.start] [2023-11-12 00:56:33,446 INFO L176 IcfgInterpreter]: Starting interpretation [2023-11-12 00:56:33,446 INFO L197 IcfgInterpreter]: Interpreting procedure ULTIMATE.start with input of size 1 for LOIs [2023-11-12 00:56:35,478 INFO L197 IcfgInterpreter]: Interpreting procedure node_create with input of size 65 for LOIs [2023-11-12 00:56:35,777 INFO L180 IcfgInterpreter]: Interpretation finished [2023-11-12 00:56:40,365 INFO L133 SifaRunner]: Sifa could not show that error location is unreachable, found '1830#(and (<= 1 |#StackHeapBarrier|) (= |ULTIMATE.start_sll_insert_#in~head#1.offset| 0) (= |ULTIMATE.start_main_~mid_index~0#1| 1) (= |ULTIMATE.start_sll_insert_~snd_to_last~0#1.offset| |ULTIMATE.start_sll_insert_~last~0#1.offset|) (= |ULTIMATE.start_sll_insert_#in~index#1| 1) (= |ULTIMATE.start_main_~uneq~0#1| 5) (= 5 |ULTIMATE.start_sll_insert_~data#1|) (= |ULTIMATE.start_sll_insert_~head#1.offset| 0) (or (and (exists ((|v_#memory_$Pointer$.offset_BEFORE_CALL_60| (Array Int (Array Int Int)))) (= (select (select |v_#memory_$Pointer$.offset_BEFORE_CALL_60| |ULTIMATE.start_main_~#s~0#1.base|) 0) 0)) (exists ((|v_#length_99| (Array Int Int))) (= |#length| (store |v_#length_99| |ULTIMATE.start_sll_insert_~new_node~0#1.base| 8))) (exists ((|v_#memory_$Pointer$.offset_97| (Array Int (Array Int Int)))) (= |#memory_$Pointer$.offset| (store |v_#memory_$Pointer$.offset_97| |ULTIMATE.start_sll_insert_~new_node~0#1.base| (store (store (select |v_#memory_$Pointer$.offset_97| |ULTIMATE.start_sll_insert_~new_node~0#1.base|) 4 0) 0 (select (select |#memory_$Pointer$.offset| |ULTIMATE.start_sll_insert_~new_node~0#1.base|) 0))))) (= 1 (select |#valid| |ULTIMATE.start_sll_insert_~new_node~0#1.base|)) (= |ULTIMATE.start_sll_insert_#in~head#1.base| |ULTIMATE.start_main_~#s~0#1.base|) (<= 8 (select |#length| |ULTIMATE.start_sll_insert_~new_node~0#1.base|)) (exists ((|v_old(#memory_$Pointer$.base)_AFTER_CALL_39| (Array Int (Array Int Int)))) (= (select (select |v_old(#memory_$Pointer$.base)_AFTER_CALL_39| |ULTIMATE.start_main_~#s~0#1.base|) 0) |ULTIMATE.start_sll_create_#res#1.base|)) (exists ((|v_#valid_120| (Array Int Int))) (and (= (select |v_#valid_120| |ULTIMATE.start_sll_insert_~new_node~0#1.base|) 0) (= (store |v_#valid_120| |ULTIMATE.start_sll_insert_~new_node~0#1.base| 1) |#valid|))) (exists ((|v_#memory_$Pointer$.base_101| (Array Int (Array Int Int)))) (= (store |v_#memory_$Pointer$.base_101| |ULTIMATE.start_sll_insert_~new_node~0#1.base| (store (store (select |v_#memory_$Pointer$.base_101| |ULTIMATE.start_sll_insert_~new_node~0#1.base|) 4 0) 0 (select (select |#memory_$Pointer$.base| |ULTIMATE.start_sll_insert_~new_node~0#1.base|) 0))) |#memory_$Pointer$.base|)) (exists ((|v_#memory_int_74| (Array Int (Array Int Int))) (|v_#memory_int_75| (Array Int (Array Int Int)))) (and (= (store |v_#memory_int_74| |ULTIMATE.start_sll_insert_~new_node~0#1.base| (store (select |v_#memory_int_74| |ULTIMATE.start_sll_insert_~new_node~0#1.base|) 4 (select (select |v_#memory_int_75| |ULTIMATE.start_sll_insert_~new_node~0#1.base|) 4))) |v_#memory_int_75|) (= |#memory_int| (store |v_#memory_int_75| |ULTIMATE.start_sll_insert_~new_node~0#1.base| (store (select |v_#memory_int_75| |ULTIMATE.start_sll_insert_~new_node~0#1.base|) 0 5))))) (not (= |ULTIMATE.start_sll_insert_~new_node~0#1.base| 0)) (<= (+ |ULTIMATE.start_sll_insert_~new_node~0#1.base| 1) |#StackHeapBarrier|) (= |ULTIMATE.start_sll_insert_#in~head#1.base| |ULTIMATE.start_sll_insert_~head#1.base|)) (and (exists ((|v_#length_99| (Array Int Int))) (= |#length| (store |v_#length_99| |ULTIMATE.start_sll_insert_~new_node~0#1.base| 8))) (exists ((|v_#memory_$Pointer$.offset_97| (Array Int (Array Int Int)))) (= |#memory_$Pointer$.offset| (store |v_#memory_$Pointer$.offset_97| |ULTIMATE.start_sll_insert_~new_node~0#1.base| (store (store (select |v_#memory_$Pointer$.offset_97| |ULTIMATE.start_sll_insert_~new_node~0#1.base|) 4 0) 0 (select (select |#memory_$Pointer$.offset| |ULTIMATE.start_sll_insert_~new_node~0#1.base|) 0))))) (= 1 (select |#valid| |ULTIMATE.start_sll_insert_~new_node~0#1.base|)) (= |ULTIMATE.start_sll_insert_#in~head#1.base| |ULTIMATE.start_main_~#s~0#1.base|) (exists ((|v_old(#memory_$Pointer$.offset)_AFTER_CALL_38| (Array Int (Array Int Int)))) (= (select (select |v_old(#memory_$Pointer$.offset)_AFTER_CALL_38| |ULTIMATE.start_main_~#s~0#1.base|) 0) 0)) (<= 8 (select |#length| |ULTIMATE.start_sll_insert_~new_node~0#1.base|)) (exists ((|v_#valid_120| (Array Int Int))) (and (= (select |v_#valid_120| |ULTIMATE.start_sll_insert_~new_node~0#1.base|) 0) (= (store |v_#valid_120| |ULTIMATE.start_sll_insert_~new_node~0#1.base| 1) |#valid|))) (exists ((|v_#memory_$Pointer$.base_101| (Array Int (Array Int Int)))) (= (store |v_#memory_$Pointer$.base_101| |ULTIMATE.start_sll_insert_~new_node~0#1.base| (store (store (select |v_#memory_$Pointer$.base_101| |ULTIMATE.start_sll_insert_~new_node~0#1.base|) 4 0) 0 (select (select |#memory_$Pointer$.base| |ULTIMATE.start_sll_insert_~new_node~0#1.base|) 0))) |#memory_$Pointer$.base|)) (exists ((|v_#memory_int_74| (Array Int (Array Int Int))) (|v_#memory_int_75| (Array Int (Array Int Int)))) (and (= (store |v_#memory_int_74| |ULTIMATE.start_sll_insert_~new_node~0#1.base| (store (select |v_#memory_int_74| |ULTIMATE.start_sll_insert_~new_node~0#1.base|) 4 (select (select |v_#memory_int_75| |ULTIMATE.start_sll_insert_~new_node~0#1.base|) 4))) |v_#memory_int_75|) (= |#memory_int| (store |v_#memory_int_75| |ULTIMATE.start_sll_insert_~new_node~0#1.base| (store (select |v_#memory_int_75| |ULTIMATE.start_sll_insert_~new_node~0#1.base|) 0 5))))) (not (= |ULTIMATE.start_sll_insert_~new_node~0#1.base| 0)) (<= (+ |ULTIMATE.start_sll_insert_~new_node~0#1.base| 1) |#StackHeapBarrier|) (= |ULTIMATE.start_sll_insert_#in~head#1.base| |ULTIMATE.start_sll_insert_~head#1.base|) (exists ((|v_old(#memory_$Pointer$.base)_AFTER_CALL_38| (Array Int (Array Int Int)))) (= (select (select |v_old(#memory_$Pointer$.base)_AFTER_CALL_38| |ULTIMATE.start_main_~#s~0#1.base|) 0) |ULTIMATE.start_sll_create_#res#1.base|)))) (<= 4 (select |#length| |ULTIMATE.start_sll_insert_~head#1.base|)) (<= 2 |ULTIMATE.start_sll_insert_#in~head#1.base|) (= |ULTIMATE.start_sll_insert_#in~data#1| 5) (not (= (select |#valid| |ULTIMATE.start_sll_insert_~last~0#1.base|) 1)) (= |ULTIMATE.start_sll_insert_~new_node~0#1.offset| 0) (= |ULTIMATE.start_sll_create_#res#1.offset| 0) (= (select |#valid| |ULTIMATE.start_sll_insert_~head#1.base|) 1) (= |ULTIMATE.start_main_~data~0#1| 1) (= |ULTIMATE.start_sll_insert_~index#1| 1) (= |ULTIMATE.start_main_~#s~0#1.offset| 0) (= (select (select |#memory_$Pointer$.offset| |ULTIMATE.start_sll_insert_~head#1.base|) 0) |ULTIMATE.start_sll_insert_~last~0#1.offset|) (= |ULTIMATE.start_main_~len~0#1| 2) (= (select (select |#memory_$Pointer$.base| |ULTIMATE.start_sll_insert_~head#1.base|) 0) |ULTIMATE.start_sll_insert_~last~0#1.base|) (<= 2 |ULTIMATE.start_sll_insert_~head#1.base|) (<= 2 |ULTIMATE.start_main_~#s~0#1.base|) (= |ULTIMATE.start_sll_insert_~snd_to_last~0#1.base| |ULTIMATE.start_sll_insert_~last~0#1.base|))' at error location [2023-11-12 00:56:40,365 WARN L311 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: ALGORITHM_FAILED [2023-11-12 00:56:40,366 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2023-11-12 00:56:40,366 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [14, 14] total 22 [2023-11-12 00:56:40,366 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [680636919] [2023-11-12 00:56:40,366 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2023-11-12 00:56:40,367 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 23 states [2023-11-12 00:56:40,367 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2023-11-12 00:56:40,368 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 23 interpolants. [2023-11-12 00:56:40,369 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=116, Invalid=1146, Unknown=6, NotChecked=138, Total=1406 [2023-11-12 00:56:40,369 INFO L87 Difference]: Start difference. First operand 74 states and 84 transitions. Second operand has 23 states, 17 states have (on average 2.176470588235294) internal successors, (37), 20 states have internal predecessors, (37), 4 states have call successors, (4), 2 states have call predecessors, (4), 4 states have return successors, (6), 6 states have call predecessors, (6), 4 states have call successors, (6) [2023-11-12 00:56:41,494 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-11-12 00:56:41,494 INFO L93 Difference]: Finished difference Result 85 states and 97 transitions. [2023-11-12 00:56:41,495 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2023-11-12 00:56:41,495 INFO L78 Accepts]: Start accepts. Automaton has has 23 states, 17 states have (on average 2.176470588235294) internal successors, (37), 20 states have internal predecessors, (37), 4 states have call successors, (4), 2 states have call predecessors, (4), 4 states have return successors, (6), 6 states have call predecessors, (6), 4 states have call successors, (6) Word has length 30 [2023-11-12 00:56:41,495 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-11-12 00:56:41,496 INFO L225 Difference]: With dead ends: 85 [2023-11-12 00:56:41,496 INFO L226 Difference]: Without dead ends: 85 [2023-11-12 00:56:41,498 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 85 GetRequests, 41 SyntacticMatches, 1 SemanticMatches, 43 ConstructedPredicates, 2 IntricatePredicates, 0 DeprecatedPredicates, 430 ImplicationChecksByTransitivity, 7.3s TimeCoverageRelationStatistics Valid=175, Invalid=1633, Unknown=6, NotChecked=166, Total=1980 [2023-11-12 00:56:41,498 INFO L413 NwaCegarLoop]: 46 mSDtfsCounter, 128 mSDsluCounter, 527 mSDsCounter, 0 mSdLazyCounter, 876 mSolverCounterSat, 6 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.7s Time, 0 mProtectedPredicate, 0 mProtectedAction, 128 SdHoareTripleChecker+Valid, 573 SdHoareTripleChecker+Invalid, 977 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 6 IncrementalHoareTripleChecker+Valid, 876 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 95 IncrementalHoareTripleChecker+Unchecked, 0.8s IncrementalHoareTripleChecker+Time [2023-11-12 00:56:41,499 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [128 Valid, 573 Invalid, 977 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [6 Valid, 876 Invalid, 0 Unknown, 95 Unchecked, 0.8s Time] [2023-11-12 00:56:41,499 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 85 states. [2023-11-12 00:56:41,502 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 85 to 76. [2023-11-12 00:56:41,503 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 76 states, 45 states have (on average 1.8222222222222222) internal successors, (82), 71 states have internal predecessors, (82), 3 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) [2023-11-12 00:56:41,503 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 76 states to 76 states and 88 transitions. [2023-11-12 00:56:41,504 INFO L78 Accepts]: Start accepts. Automaton has 76 states and 88 transitions. Word has length 30 [2023-11-12 00:56:41,504 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-11-12 00:56:41,504 INFO L495 AbstractCegarLoop]: Abstraction has 76 states and 88 transitions. [2023-11-12 00:56:41,504 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 23 states, 17 states have (on average 2.176470588235294) internal successors, (37), 20 states have internal predecessors, (37), 4 states have call successors, (4), 2 states have call predecessors, (4), 4 states have return successors, (6), 6 states have call predecessors, (6), 4 states have call successors, (6) [2023-11-12 00:56:41,517 INFO L276 IsEmpty]: Start isEmpty. Operand 76 states and 88 transitions. [2023-11-12 00:56:41,518 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 31 [2023-11-12 00:56:41,518 INFO L187 NwaCegarLoop]: Found error trace [2023-11-12 00:56:41,518 INFO L195 NwaCegarLoop]: trace histogram [3, 3, 3, 3, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1] [2023-11-12 00:56:41,530 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_e9dc0cbb-d2f2-4273-b8e9-d506e75045be/bin/utaipan-verify-NcY6lQBIFX/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Forceful destruction successful, exit code 0 [2023-11-12 00:56:41,725 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 5 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_e9dc0cbb-d2f2-4273-b8e9-d506e75045be/bin/utaipan-verify-NcY6lQBIFX/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable8 [2023-11-12 00:56:41,725 INFO L420 AbstractCegarLoop]: === Iteration 10 === Targeting ULTIMATE.startErr5REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 36 more)] === [2023-11-12 00:56:41,725 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-12 00:56:41,725 INFO L85 PathProgramCache]: Analyzing trace with hash 1915535144, now seen corresponding path program 1 times [2023-11-12 00:56:41,726 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2023-11-12 00:56:41,726 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1534206011] [2023-11-12 00:56:41,726 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-12 00:56:41,726 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-12 00:56:41,776 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-12 00:56:42,872 INFO L134 CoverageAnalysis]: Checked inductivity of 21 backedges. 14 proven. 4 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2023-11-12 00:56:42,872 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2023-11-12 00:56:42,872 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1534206011] [2023-11-12 00:56:42,872 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1534206011] provided 0 perfect and 1 imperfect interpolant sequences [2023-11-12 00:56:42,872 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1795484199] [2023-11-12 00:56:42,873 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-12 00:56:42,873 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-11-12 00:56:42,873 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_e9dc0cbb-d2f2-4273-b8e9-d506e75045be/bin/utaipan-verify-NcY6lQBIFX/z3 [2023-11-12 00:56:42,874 INFO L229 MonitoredProcess]: Starting monitored process 6 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_e9dc0cbb-d2f2-4273-b8e9-d506e75045be/bin/utaipan-verify-NcY6lQBIFX/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2023-11-12 00:56:42,896 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_e9dc0cbb-d2f2-4273-b8e9-d506e75045be/bin/utaipan-verify-NcY6lQBIFX/z3 -smt2 -in SMTLIB2_COMPLIANT=true (6)] Waiting until timeout for monitored process [2023-11-12 00:56:43,050 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-12 00:56:43,054 INFO L262 TraceCheckSpWp]: Trace formula consists of 352 conjuncts, 58 conjunts are in the unsatisfiable core [2023-11-12 00:56:43,063 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-11-12 00:56:43,118 INFO L351 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2023-11-12 00:56:43,440 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 25 treesize of output 17 [2023-11-12 00:56:43,446 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 21 treesize of output 13 [2023-11-12 00:56:43,645 WARN L876 $PredicateComparison]: unable to prove that (exists ((|node_create_~temp~0#1.base| Int)) (and (<= (+ |node_create_~temp~0#1.base| 1) |c_#StackHeapBarrier|) (= (store |c_old(#length)| |node_create_~temp~0#1.base| (select |c_#length| |node_create_~temp~0#1.base|)) |c_#length|) (= |c_#memory_$Pointer$.offset| (store |c_old(#memory_$Pointer$.offset)| |node_create_~temp~0#1.base| (select |c_#memory_$Pointer$.offset| |node_create_~temp~0#1.base|))) (= |c_#memory_$Pointer$.base| (store |c_old(#memory_$Pointer$.base)| |node_create_~temp~0#1.base| (select |c_#memory_$Pointer$.base| |node_create_~temp~0#1.base|))) (= 0 (select |c_old(#valid)| |node_create_~temp~0#1.base|)))) is different from true [2023-11-12 00:56:43,672 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-11-12 00:56:43,673 INFO L351 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 33 treesize of output 26 [2023-11-12 00:56:43,703 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-11-12 00:56:43,704 INFO L351 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 24 treesize of output 19 [2023-11-12 00:56:43,710 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-11-12 00:56:43,711 INFO L351 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 33 treesize of output 26 [2023-11-12 00:56:43,729 INFO L322 Elim1Store]: treesize reduction 4, result has 66.7 percent of original size [2023-11-12 00:56:43,729 INFO L351 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 15 treesize of output 15 [2023-11-12 00:56:43,788 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 23 treesize of output 15 [2023-11-12 00:56:43,792 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 28 treesize of output 16 [2023-11-12 00:56:43,838 INFO L134 CoverageAnalysis]: Checked inductivity of 21 backedges. 14 proven. 3 refuted. 0 times theorem prover too weak. 3 trivial. 1 not checked. [2023-11-12 00:56:43,838 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2023-11-12 00:56:44,144 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1795484199] provided 0 perfect and 1 imperfect interpolant sequences [2023-11-12 00:56:44,145 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSifa [2131498024] [2023-11-12 00:56:44,149 INFO L159 IcfgInterpreter]: Started Sifa with 16 locations of interest [2023-11-12 00:56:44,149 INFO L166 IcfgInterpreter]: Building call graph [2023-11-12 00:56:44,150 INFO L171 IcfgInterpreter]: Initial procedures are [ULTIMATE.start] [2023-11-12 00:56:44,150 INFO L176 IcfgInterpreter]: Starting interpretation [2023-11-12 00:56:44,150 INFO L197 IcfgInterpreter]: Interpreting procedure ULTIMATE.start with input of size 1 for LOIs [2023-11-12 00:56:45,787 INFO L197 IcfgInterpreter]: Interpreting procedure node_create with input of size 65 for LOIs [2023-11-12 00:56:45,990 INFO L180 IcfgInterpreter]: Interpretation finished [2023-11-12 00:56:51,020 INFO L133 SifaRunner]: Sifa could not show that error location is unreachable, found '2152#(and (<= 1 |#StackHeapBarrier|) (= |ULTIMATE.start_sll_insert_#in~head#1.offset| 0) (= |ULTIMATE.start_main_~mid_index~0#1| 1) (= |ULTIMATE.start_sll_insert_~snd_to_last~0#1.offset| |ULTIMATE.start_sll_insert_~last~0#1.offset|) (= |ULTIMATE.start_sll_insert_#in~index#1| 1) (= |ULTIMATE.start_main_~uneq~0#1| 5) (= 5 |ULTIMATE.start_sll_insert_~data#1|) (= |ULTIMATE.start_sll_insert_~head#1.offset| 0) (<= 4 (select |#length| |ULTIMATE.start_sll_insert_~head#1.base|)) (<= 2 |ULTIMATE.start_sll_insert_#in~head#1.base|) (= |ULTIMATE.start_sll_insert_#in~data#1| 5) (= |ULTIMATE.start_sll_insert_~new_node~0#1.offset| 0) (or (and (exists ((|v_old(#memory_$Pointer$.offset)_AFTER_CALL_52| (Array Int (Array Int Int)))) (= 0 (select (select |v_old(#memory_$Pointer$.offset)_AFTER_CALL_52| |ULTIMATE.start_main_~#s~0#1.base|) 0))) (= 1 (select |#valid| |ULTIMATE.start_sll_insert_~new_node~0#1.base|)) (= |ULTIMATE.start_sll_insert_#in~head#1.base| |ULTIMATE.start_main_~#s~0#1.base|) (<= 8 (select |#length| |ULTIMATE.start_sll_insert_~new_node~0#1.base|)) (exists ((|v_#memory_int_86| (Array Int (Array Int Int))) (|v_#memory_int_87| (Array Int (Array Int Int)))) (and (= |v_#memory_int_87| (store |v_#memory_int_86| |ULTIMATE.start_sll_insert_~new_node~0#1.base| (store (select |v_#memory_int_86| |ULTIMATE.start_sll_insert_~new_node~0#1.base|) 4 (select (select |v_#memory_int_87| |ULTIMATE.start_sll_insert_~new_node~0#1.base|) 4)))) (= |#memory_int| (store |v_#memory_int_87| |ULTIMATE.start_sll_insert_~new_node~0#1.base| (store (select |v_#memory_int_87| |ULTIMATE.start_sll_insert_~new_node~0#1.base|) 0 5))))) (exists ((|v_#memory_$Pointer$.base_117| (Array Int (Array Int Int)))) (= |#memory_$Pointer$.base| (store |v_#memory_$Pointer$.base_117| |ULTIMATE.start_sll_insert_~new_node~0#1.base| (store (store (select |v_#memory_$Pointer$.base_117| |ULTIMATE.start_sll_insert_~new_node~0#1.base|) 4 0) 0 (select (select |#memory_$Pointer$.base| |ULTIMATE.start_sll_insert_~new_node~0#1.base|) 0))))) (exists ((|v_old(#memory_$Pointer$.base)_AFTER_CALL_52| (Array Int (Array Int Int)))) (= (select (select |v_old(#memory_$Pointer$.base)_AFTER_CALL_52| |ULTIMATE.start_main_~#s~0#1.base|) 0) |ULTIMATE.start_sll_create_#res#1.base|)) (not (= |ULTIMATE.start_sll_insert_~new_node~0#1.base| 0)) (<= (+ |ULTIMATE.start_sll_insert_~new_node~0#1.base| 1) |#StackHeapBarrier|) (exists ((|v_#memory_$Pointer$.offset_113| (Array Int (Array Int Int)))) (= |#memory_$Pointer$.offset| (store |v_#memory_$Pointer$.offset_113| |ULTIMATE.start_sll_insert_~new_node~0#1.base| (store (store (select |v_#memory_$Pointer$.offset_113| |ULTIMATE.start_sll_insert_~new_node~0#1.base|) 4 0) 0 (select (select |#memory_$Pointer$.offset| |ULTIMATE.start_sll_insert_~new_node~0#1.base|) 0))))) (exists ((|v_#length_109| (Array Int Int))) (= |#length| (store |v_#length_109| |ULTIMATE.start_sll_insert_~new_node~0#1.base| 8))) (exists ((|v_#valid_130| (Array Int Int))) (and (= |#valid| (store |v_#valid_130| |ULTIMATE.start_sll_insert_~new_node~0#1.base| 1)) (= (select |v_#valid_130| |ULTIMATE.start_sll_insert_~new_node~0#1.base|) 0))) (= |ULTIMATE.start_sll_insert_#in~head#1.base| |ULTIMATE.start_sll_insert_~head#1.base|)) (and (= 1 (select |#valid| |ULTIMATE.start_sll_insert_~new_node~0#1.base|)) (= |ULTIMATE.start_sll_insert_#in~head#1.base| |ULTIMATE.start_main_~#s~0#1.base|) (<= 8 (select |#length| |ULTIMATE.start_sll_insert_~new_node~0#1.base|)) (exists ((|v_#memory_int_86| (Array Int (Array Int Int))) (|v_#memory_int_87| (Array Int (Array Int Int)))) (and (= |v_#memory_int_87| (store |v_#memory_int_86| |ULTIMATE.start_sll_insert_~new_node~0#1.base| (store (select |v_#memory_int_86| |ULTIMATE.start_sll_insert_~new_node~0#1.base|) 4 (select (select |v_#memory_int_87| |ULTIMATE.start_sll_insert_~new_node~0#1.base|) 4)))) (= |#memory_int| (store |v_#memory_int_87| |ULTIMATE.start_sll_insert_~new_node~0#1.base| (store (select |v_#memory_int_87| |ULTIMATE.start_sll_insert_~new_node~0#1.base|) 0 5))))) (exists ((|v_#memory_$Pointer$.base_117| (Array Int (Array Int Int)))) (= |#memory_$Pointer$.base| (store |v_#memory_$Pointer$.base_117| |ULTIMATE.start_sll_insert_~new_node~0#1.base| (store (store (select |v_#memory_$Pointer$.base_117| |ULTIMATE.start_sll_insert_~new_node~0#1.base|) 4 0) 0 (select (select |#memory_$Pointer$.base| |ULTIMATE.start_sll_insert_~new_node~0#1.base|) 0))))) (not (= |ULTIMATE.start_sll_insert_~new_node~0#1.base| 0)) (<= (+ |ULTIMATE.start_sll_insert_~new_node~0#1.base| 1) |#StackHeapBarrier|) (exists ((|v_#memory_$Pointer$.offset_113| (Array Int (Array Int Int)))) (= |#memory_$Pointer$.offset| (store |v_#memory_$Pointer$.offset_113| |ULTIMATE.start_sll_insert_~new_node~0#1.base| (store (store (select |v_#memory_$Pointer$.offset_113| |ULTIMATE.start_sll_insert_~new_node~0#1.base|) 4 0) 0 (select (select |#memory_$Pointer$.offset| |ULTIMATE.start_sll_insert_~new_node~0#1.base|) 0))))) (exists ((|v_#memory_$Pointer$.offset_BEFORE_CALL_82| (Array Int (Array Int Int)))) (= (select (select |v_#memory_$Pointer$.offset_BEFORE_CALL_82| |ULTIMATE.start_main_~#s~0#1.base|) 0) 0)) (exists ((|v_#length_109| (Array Int Int))) (= |#length| (store |v_#length_109| |ULTIMATE.start_sll_insert_~new_node~0#1.base| 8))) (exists ((|v_#valid_130| (Array Int Int))) (and (= |#valid| (store |v_#valid_130| |ULTIMATE.start_sll_insert_~new_node~0#1.base| 1)) (= (select |v_#valid_130| |ULTIMATE.start_sll_insert_~new_node~0#1.base|) 0))) (= |ULTIMATE.start_sll_insert_#in~head#1.base| |ULTIMATE.start_sll_insert_~head#1.base|) (exists ((|v_old(#memory_$Pointer$.base)_AFTER_CALL_51| (Array Int (Array Int Int)))) (= (select (select |v_old(#memory_$Pointer$.base)_AFTER_CALL_51| |ULTIMATE.start_main_~#s~0#1.base|) 0) |ULTIMATE.start_sll_create_#res#1.base|)))) (= |ULTIMATE.start_sll_create_#res#1.offset| 0) (= (select |#valid| |ULTIMATE.start_sll_insert_~head#1.base|) 1) (= |ULTIMATE.start_main_~data~0#1| 1) (= |ULTIMATE.start_sll_insert_~index#1| 1) (= |ULTIMATE.start_main_~#s~0#1.offset| 0) (= (select (select |#memory_$Pointer$.offset| |ULTIMATE.start_sll_insert_~head#1.base|) 0) |ULTIMATE.start_sll_insert_~last~0#1.offset|) (= |ULTIMATE.start_main_~len~0#1| 2) (= (select (select |#memory_$Pointer$.base| |ULTIMATE.start_sll_insert_~head#1.base|) 0) |ULTIMATE.start_sll_insert_~last~0#1.base|) (<= 2 |ULTIMATE.start_sll_insert_~head#1.base|) (or (< (select |#length| |ULTIMATE.start_sll_insert_~last~0#1.base|) (+ |ULTIMATE.start_sll_insert_~last~0#1.offset| 8)) (< (+ |ULTIMATE.start_sll_insert_~last~0#1.offset| 4) 0)) (<= 2 |ULTIMATE.start_main_~#s~0#1.base|) (= |ULTIMATE.start_sll_insert_~snd_to_last~0#1.base| |ULTIMATE.start_sll_insert_~last~0#1.base|))' at error location [2023-11-12 00:56:51,020 WARN L311 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: ALGORITHM_FAILED [2023-11-12 00:56:51,021 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2023-11-12 00:56:51,021 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [14, 15] total 28 [2023-11-12 00:56:51,021 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [388702072] [2023-11-12 00:56:51,021 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2023-11-12 00:56:51,022 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 29 states [2023-11-12 00:56:51,022 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2023-11-12 00:56:51,023 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 29 interpolants. [2023-11-12 00:56:51,024 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=143, Invalid=1747, Unknown=6, NotChecked=84, Total=1980 [2023-11-12 00:56:51,024 INFO L87 Difference]: Start difference. First operand 76 states and 88 transitions. Second operand has 29 states, 22 states have (on average 1.9090909090909092) internal successors, (42), 25 states have internal predecessors, (42), 4 states have call successors, (4), 3 states have call predecessors, (4), 5 states have return successors, (6), 6 states have call predecessors, (6), 4 states have call successors, (6) [2023-11-12 00:56:52,746 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-11-12 00:56:52,747 INFO L93 Difference]: Finished difference Result 84 states and 96 transitions. [2023-11-12 00:56:52,747 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 16 states. [2023-11-12 00:56:52,747 INFO L78 Accepts]: Start accepts. Automaton has has 29 states, 22 states have (on average 1.9090909090909092) internal successors, (42), 25 states have internal predecessors, (42), 4 states have call successors, (4), 3 states have call predecessors, (4), 5 states have return successors, (6), 6 states have call predecessors, (6), 4 states have call successors, (6) Word has length 30 [2023-11-12 00:56:52,748 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-11-12 00:56:52,749 INFO L225 Difference]: With dead ends: 84 [2023-11-12 00:56:52,749 INFO L226 Difference]: Without dead ends: 84 [2023-11-12 00:56:52,751 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 90 GetRequests, 35 SyntacticMatches, 0 SemanticMatches, 55 ConstructedPredicates, 1 IntricatePredicates, 0 DeprecatedPredicates, 642 ImplicationChecksByTransitivity, 6.8s TimeCoverageRelationStatistics Valid=254, Invalid=2818, Unknown=12, NotChecked=108, Total=3192 [2023-11-12 00:56:52,751 INFO L413 NwaCegarLoop]: 47 mSDtfsCounter, 232 mSDsluCounter, 503 mSDsCounter, 0 mSdLazyCounter, 876 mSolverCounterSat, 10 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.8s Time, 0 mProtectedPredicate, 0 mProtectedAction, 232 SdHoareTripleChecker+Valid, 550 SdHoareTripleChecker+Invalid, 980 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 10 IncrementalHoareTripleChecker+Valid, 876 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 94 IncrementalHoareTripleChecker+Unchecked, 0.9s IncrementalHoareTripleChecker+Time [2023-11-12 00:56:52,752 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [232 Valid, 550 Invalid, 980 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [10 Valid, 876 Invalid, 0 Unknown, 94 Unchecked, 0.9s Time] [2023-11-12 00:56:52,752 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 84 states. [2023-11-12 00:56:52,755 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 84 to 76. [2023-11-12 00:56:52,756 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 76 states, 45 states have (on average 1.8) internal successors, (81), 71 states have internal predecessors, (81), 3 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) [2023-11-12 00:56:52,756 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 76 states to 76 states and 87 transitions. [2023-11-12 00:56:52,757 INFO L78 Accepts]: Start accepts. Automaton has 76 states and 87 transitions. Word has length 30 [2023-11-12 00:56:52,757 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-11-12 00:56:52,757 INFO L495 AbstractCegarLoop]: Abstraction has 76 states and 87 transitions. [2023-11-12 00:56:52,758 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 29 states, 22 states have (on average 1.9090909090909092) internal successors, (42), 25 states have internal predecessors, (42), 4 states have call successors, (4), 3 states have call predecessors, (4), 5 states have return successors, (6), 6 states have call predecessors, (6), 4 states have call successors, (6) [2023-11-12 00:56:52,758 INFO L276 IsEmpty]: Start isEmpty. Operand 76 states and 87 transitions. [2023-11-12 00:56:52,759 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 32 [2023-11-12 00:56:52,759 INFO L187 NwaCegarLoop]: Found error trace [2023-11-12 00:56:52,759 INFO L195 NwaCegarLoop]: trace histogram [3, 3, 3, 3, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-11-12 00:56:52,773 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_e9dc0cbb-d2f2-4273-b8e9-d506e75045be/bin/utaipan-verify-NcY6lQBIFX/z3 -smt2 -in SMTLIB2_COMPLIANT=true (6)] Forceful destruction successful, exit code 0 [2023-11-12 00:56:52,973 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 6 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_e9dc0cbb-d2f2-4273-b8e9-d506e75045be/bin/utaipan-verify-NcY6lQBIFX/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable9 [2023-11-12 00:56:52,973 INFO L420 AbstractCegarLoop]: === Iteration 11 === Targeting ULTIMATE.startErr6REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 36 more)] === [2023-11-12 00:56:52,974 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-12 00:56:52,974 INFO L85 PathProgramCache]: Analyzing trace with hash -747784237, now seen corresponding path program 1 times [2023-11-12 00:56:52,974 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2023-11-12 00:56:52,974 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [91386013] [2023-11-12 00:56:52,974 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-12 00:56:52,975 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-12 00:56:52,999 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-12 00:56:53,041 INFO L134 CoverageAnalysis]: Checked inductivity of 21 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 21 trivial. 0 not checked. [2023-11-12 00:56:53,041 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2023-11-12 00:56:53,042 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [91386013] [2023-11-12 00:56:53,042 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [91386013] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-12 00:56:53,042 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-12 00:56:53,042 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2023-11-12 00:56:53,042 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1281186498] [2023-11-12 00:56:53,043 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-12 00:56:53,043 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2023-11-12 00:56:53,043 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2023-11-12 00:56:53,044 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2023-11-12 00:56:53,044 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2023-11-12 00:56:53,044 INFO L87 Difference]: Start difference. First operand 76 states and 87 transitions. Second operand has 3 states, 3 states have (on average 4.666666666666667) internal successors, (14), 3 states have internal predecessors, (14), 1 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) [2023-11-12 00:56:53,094 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-11-12 00:56:53,094 INFO L93 Difference]: Finished difference Result 80 states and 91 transitions. [2023-11-12 00:56:53,095 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2023-11-12 00:56:53,095 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 4.666666666666667) internal successors, (14), 3 states have internal predecessors, (14), 1 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) Word has length 31 [2023-11-12 00:56:53,095 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-11-12 00:56:53,096 INFO L225 Difference]: With dead ends: 80 [2023-11-12 00:56:53,096 INFO L226 Difference]: Without dead ends: 80 [2023-11-12 00:56:53,096 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2023-11-12 00:56:53,097 INFO L413 NwaCegarLoop]: 60 mSDtfsCounter, 4 mSDsluCounter, 53 mSDsCounter, 0 mSdLazyCounter, 39 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 4 SdHoareTripleChecker+Valid, 113 SdHoareTripleChecker+Invalid, 40 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 39 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2023-11-12 00:56:53,097 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [4 Valid, 113 Invalid, 40 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 39 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2023-11-12 00:56:53,098 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 80 states. [2023-11-12 00:56:53,101 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 80 to 77. [2023-11-12 00:56:53,101 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 77 states, 46 states have (on average 1.7826086956521738) internal successors, (82), 72 states have internal predecessors, (82), 3 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) [2023-11-12 00:56:53,102 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 77 states to 77 states and 88 transitions. [2023-11-12 00:56:53,102 INFO L78 Accepts]: Start accepts. Automaton has 77 states and 88 transitions. Word has length 31 [2023-11-12 00:56:53,103 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-11-12 00:56:53,103 INFO L495 AbstractCegarLoop]: Abstraction has 77 states and 88 transitions. [2023-11-12 00:56:53,103 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 4.666666666666667) internal successors, (14), 3 states have internal predecessors, (14), 1 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) [2023-11-12 00:56:53,103 INFO L276 IsEmpty]: Start isEmpty. Operand 77 states and 88 transitions. [2023-11-12 00:56:53,104 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 33 [2023-11-12 00:56:53,104 INFO L187 NwaCegarLoop]: Found error trace [2023-11-12 00:56:53,105 INFO L195 NwaCegarLoop]: trace histogram [3, 3, 3, 3, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-11-12 00:56:53,105 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10 [2023-11-12 00:56:53,105 INFO L420 AbstractCegarLoop]: === Iteration 12 === Targeting ULTIMATE.startErr10REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 36 more)] === [2023-11-12 00:56:53,105 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-12 00:56:53,106 INFO L85 PathProgramCache]: Analyzing trace with hash -1706469878, now seen corresponding path program 1 times [2023-11-12 00:56:53,106 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2023-11-12 00:56:53,106 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1118700555] [2023-11-12 00:56:53,106 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-12 00:56:53,106 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-12 00:56:53,129 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-12 00:56:53,217 INFO L134 CoverageAnalysis]: Checked inductivity of 21 backedges. 4 proven. 0 refuted. 0 times theorem prover too weak. 17 trivial. 0 not checked. [2023-11-12 00:56:53,217 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2023-11-12 00:56:53,218 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1118700555] [2023-11-12 00:56:53,218 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1118700555] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-12 00:56:53,218 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-12 00:56:53,218 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2023-11-12 00:56:53,218 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1479421001] [2023-11-12 00:56:53,218 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-12 00:56:53,219 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2023-11-12 00:56:53,219 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2023-11-12 00:56:53,220 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2023-11-12 00:56:53,220 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2023-11-12 00:56:53,220 INFO L87 Difference]: Start difference. First operand 77 states and 88 transitions. Second operand has 6 states, 4 states have (on average 4.25) internal successors, (17), 5 states have internal predecessors, (17), 1 states have call successors, (2), 1 states have call predecessors, (2), 2 states have return successors, (2), 2 states have call predecessors, (2), 1 states have call successors, (2) [2023-11-12 00:56:53,367 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-11-12 00:56:53,367 INFO L93 Difference]: Finished difference Result 76 states and 87 transitions. [2023-11-12 00:56:53,368 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2023-11-12 00:56:53,368 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 4 states have (on average 4.25) internal successors, (17), 5 states have internal predecessors, (17), 1 states have call successors, (2), 1 states have call predecessors, (2), 2 states have return successors, (2), 2 states have call predecessors, (2), 1 states have call successors, (2) Word has length 32 [2023-11-12 00:56:53,368 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-11-12 00:56:53,369 INFO L225 Difference]: With dead ends: 76 [2023-11-12 00:56:53,369 INFO L226 Difference]: Without dead ends: 76 [2023-11-12 00:56:53,369 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=13, Invalid=29, Unknown=0, NotChecked=0, Total=42 [2023-11-12 00:56:53,370 INFO L413 NwaCegarLoop]: 52 mSDtfsCounter, 11 mSDsluCounter, 139 mSDsCounter, 0 mSdLazyCounter, 174 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 11 SdHoareTripleChecker+Valid, 191 SdHoareTripleChecker+Invalid, 175 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 174 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2023-11-12 00:56:53,370 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [11 Valid, 191 Invalid, 175 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 174 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2023-11-12 00:56:53,371 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 76 states. [2023-11-12 00:56:53,373 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 76 to 76. [2023-11-12 00:56:53,373 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 76 states, 46 states have (on average 1.7608695652173914) internal successors, (81), 71 states have internal predecessors, (81), 3 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) [2023-11-12 00:56:53,374 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 76 states to 76 states and 87 transitions. [2023-11-12 00:56:53,374 INFO L78 Accepts]: Start accepts. Automaton has 76 states and 87 transitions. Word has length 32 [2023-11-12 00:56:53,374 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-11-12 00:56:53,374 INFO L495 AbstractCegarLoop]: Abstraction has 76 states and 87 transitions. [2023-11-12 00:56:53,374 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 4 states have (on average 4.25) internal successors, (17), 5 states have internal predecessors, (17), 1 states have call successors, (2), 1 states have call predecessors, (2), 2 states have return successors, (2), 2 states have call predecessors, (2), 1 states have call successors, (2) [2023-11-12 00:56:53,374 INFO L276 IsEmpty]: Start isEmpty. Operand 76 states and 87 transitions. [2023-11-12 00:56:53,375 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 33 [2023-11-12 00:56:53,375 INFO L187 NwaCegarLoop]: Found error trace [2023-11-12 00:56:53,375 INFO L195 NwaCegarLoop]: trace histogram [3, 3, 3, 3, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-11-12 00:56:53,376 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable11 [2023-11-12 00:56:53,376 INFO L420 AbstractCegarLoop]: === Iteration 13 === Targeting ULTIMATE.startErr11REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 36 more)] === [2023-11-12 00:56:53,376 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-12 00:56:53,376 INFO L85 PathProgramCache]: Analyzing trace with hash -1706469877, now seen corresponding path program 1 times [2023-11-12 00:56:53,376 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2023-11-12 00:56:53,377 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [985266508] [2023-11-12 00:56:53,377 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-12 00:56:53,377 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-12 00:56:53,402 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-12 00:56:53,567 INFO L134 CoverageAnalysis]: Checked inductivity of 21 backedges. 0 proven. 5 refuted. 0 times theorem prover too weak. 16 trivial. 0 not checked. [2023-11-12 00:56:53,567 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2023-11-12 00:56:53,567 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [985266508] [2023-11-12 00:56:53,567 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [985266508] provided 0 perfect and 1 imperfect interpolant sequences [2023-11-12 00:56:53,568 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [162735784] [2023-11-12 00:56:53,568 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-12 00:56:53,568 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-11-12 00:56:53,568 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_e9dc0cbb-d2f2-4273-b8e9-d506e75045be/bin/utaipan-verify-NcY6lQBIFX/z3 [2023-11-12 00:56:53,569 INFO L229 MonitoredProcess]: Starting monitored process 7 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_e9dc0cbb-d2f2-4273-b8e9-d506e75045be/bin/utaipan-verify-NcY6lQBIFX/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2023-11-12 00:56:53,599 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_e9dc0cbb-d2f2-4273-b8e9-d506e75045be/bin/utaipan-verify-NcY6lQBIFX/z3 -smt2 -in SMTLIB2_COMPLIANT=true (7)] Waiting until timeout for monitored process [2023-11-12 00:56:53,754 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-12 00:56:53,757 INFO L262 TraceCheckSpWp]: Trace formula consists of 368 conjuncts, 5 conjunts are in the unsatisfiable core [2023-11-12 00:56:53,759 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-11-12 00:56:53,788 INFO L134 CoverageAnalysis]: Checked inductivity of 21 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 21 trivial. 0 not checked. [2023-11-12 00:56:53,788 INFO L323 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2023-11-12 00:56:53,788 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [162735784] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-12 00:56:53,788 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2023-11-12 00:56:53,789 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [5] total 5 [2023-11-12 00:56:53,789 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [89902940] [2023-11-12 00:56:53,789 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-12 00:56:53,789 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2023-11-12 00:56:53,789 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2023-11-12 00:56:53,790 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2023-11-12 00:56:53,790 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2023-11-12 00:56:53,790 INFO L87 Difference]: Start difference. First operand 76 states and 87 transitions. Second operand has 4 states, 4 states have (on average 3.75) internal successors, (15), 4 states have internal predecessors, (15), 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 00:56:53,846 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-11-12 00:56:53,846 INFO L93 Difference]: Finished difference Result 75 states and 85 transitions. [2023-11-12 00:56:53,847 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2023-11-12 00:56:53,847 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 3.75) internal successors, (15), 4 states have internal predecessors, (15), 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) Word has length 32 [2023-11-12 00:56:53,848 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-11-12 00:56:53,848 INFO L225 Difference]: With dead ends: 75 [2023-11-12 00:56:53,848 INFO L226 Difference]: Without dead ends: 75 [2023-11-12 00:56:53,849 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 37 GetRequests, 33 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=12, Invalid=18, Unknown=0, NotChecked=0, Total=30 [2023-11-12 00:56:53,849 INFO L413 NwaCegarLoop]: 57 mSDtfsCounter, 69 mSDsluCounter, 58 mSDsCounter, 0 mSdLazyCounter, 38 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 69 SdHoareTripleChecker+Valid, 115 SdHoareTripleChecker+Invalid, 40 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 38 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2023-11-12 00:56:53,850 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [69 Valid, 115 Invalid, 40 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 38 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2023-11-12 00:56:53,850 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 75 states. [2023-11-12 00:56:53,852 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 75 to 75. [2023-11-12 00:56:53,853 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 75 states, 45 states have (on average 1.7555555555555555) internal successors, (79), 70 states have internal predecessors, (79), 3 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) [2023-11-12 00:56:53,853 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 75 states to 75 states and 85 transitions. [2023-11-12 00:56:53,854 INFO L78 Accepts]: Start accepts. Automaton has 75 states and 85 transitions. Word has length 32 [2023-11-12 00:56:53,854 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-11-12 00:56:53,854 INFO L495 AbstractCegarLoop]: Abstraction has 75 states and 85 transitions. [2023-11-12 00:56:53,854 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 3.75) internal successors, (15), 4 states have internal predecessors, (15), 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 00:56:53,854 INFO L276 IsEmpty]: Start isEmpty. Operand 75 states and 85 transitions. [2023-11-12 00:56:53,855 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 33 [2023-11-12 00:56:53,855 INFO L187 NwaCegarLoop]: Found error trace [2023-11-12 00:56:53,856 INFO L195 NwaCegarLoop]: trace histogram [3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1] [2023-11-12 00:56:53,867 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_e9dc0cbb-d2f2-4273-b8e9-d506e75045be/bin/utaipan-verify-NcY6lQBIFX/z3 -smt2 -in SMTLIB2_COMPLIANT=true (7)] Forceful destruction successful, exit code 0 [2023-11-12 00:56:54,062 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 7 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_e9dc0cbb-d2f2-4273-b8e9-d506e75045be/bin/utaipan-verify-NcY6lQBIFX/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable12 [2023-11-12 00:56:54,063 INFO L420 AbstractCegarLoop]: === Iteration 14 === Targeting ULTIMATE.startErr4REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 36 more)] === [2023-11-12 00:56:54,063 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-12 00:56:54,063 INFO L85 PathProgramCache]: Analyzing trace with hash -1711536785, now seen corresponding path program 1 times [2023-11-12 00:56:54,063 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2023-11-12 00:56:54,064 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2045275922] [2023-11-12 00:56:54,064 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-12 00:56:54,064 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-12 00:56:54,088 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-12 00:56:54,243 INFO L134 CoverageAnalysis]: Checked inductivity of 23 backedges. 2 proven. 5 refuted. 0 times theorem prover too weak. 16 trivial. 0 not checked. [2023-11-12 00:56:54,244 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2023-11-12 00:56:54,244 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2045275922] [2023-11-12 00:56:54,244 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2045275922] provided 0 perfect and 1 imperfect interpolant sequences [2023-11-12 00:56:54,244 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [2027102114] [2023-11-12 00:56:54,244 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-12 00:56:54,245 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-11-12 00:56:54,245 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_e9dc0cbb-d2f2-4273-b8e9-d506e75045be/bin/utaipan-verify-NcY6lQBIFX/z3 [2023-11-12 00:56:54,246 INFO L229 MonitoredProcess]: Starting monitored process 8 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_e9dc0cbb-d2f2-4273-b8e9-d506e75045be/bin/utaipan-verify-NcY6lQBIFX/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2023-11-12 00:56:54,269 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_e9dc0cbb-d2f2-4273-b8e9-d506e75045be/bin/utaipan-verify-NcY6lQBIFX/z3 -smt2 -in SMTLIB2_COMPLIANT=true (8)] Waiting until timeout for monitored process [2023-11-12 00:56:54,462 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-12 00:56:54,465 INFO L262 TraceCheckSpWp]: Trace formula consists of 367 conjuncts, 7 conjunts are in the unsatisfiable core [2023-11-12 00:56:54,470 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-11-12 00:56:54,496 INFO L134 CoverageAnalysis]: Checked inductivity of 23 backedges. 2 proven. 0 refuted. 0 times theorem prover too weak. 21 trivial. 0 not checked. [2023-11-12 00:56:54,496 INFO L323 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2023-11-12 00:56:54,496 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [2027102114] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-12 00:56:54,497 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2023-11-12 00:56:54,497 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [6] total 6 [2023-11-12 00:56:54,497 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1891784000] [2023-11-12 00:56:54,497 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-12 00:56:54,497 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2023-11-12 00:56:54,498 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2023-11-12 00:56:54,498 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2023-11-12 00:56:54,498 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2023-11-12 00:56:54,499 INFO L87 Difference]: Start difference. First operand 75 states and 85 transitions. Second operand has 5 states, 5 states have (on average 3.0) internal successors, (15), 5 states have internal predecessors, (15), 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 00:56:54,554 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-11-12 00:56:54,555 INFO L93 Difference]: Finished difference Result 72 states and 81 transitions. [2023-11-12 00:56:54,555 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2023-11-12 00:56:54,555 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 3.0) internal successors, (15), 5 states have internal predecessors, (15), 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) Word has length 32 [2023-11-12 00:56:54,556 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-11-12 00:56:54,556 INFO L225 Difference]: With dead ends: 72 [2023-11-12 00:56:54,556 INFO L226 Difference]: Without dead ends: 72 [2023-11-12 00:56:54,557 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 39 GetRequests, 33 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=21, Invalid=35, Unknown=0, NotChecked=0, Total=56 [2023-11-12 00:56:54,557 INFO L413 NwaCegarLoop]: 55 mSDtfsCounter, 79 mSDsluCounter, 52 mSDsCounter, 0 mSdLazyCounter, 40 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 79 SdHoareTripleChecker+Valid, 107 SdHoareTripleChecker+Invalid, 41 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 40 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2023-11-12 00:56:54,558 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [79 Valid, 107 Invalid, 41 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 40 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2023-11-12 00:56:54,558 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 72 states. [2023-11-12 00:56:54,560 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 72 to 72. [2023-11-12 00:56:54,561 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 72 states, 44 states have (on average 1.7045454545454546) internal successors, (75), 67 states have internal predecessors, (75), 3 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) [2023-11-12 00:56:54,561 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 72 states to 72 states and 81 transitions. [2023-11-12 00:56:54,561 INFO L78 Accepts]: Start accepts. Automaton has 72 states and 81 transitions. Word has length 32 [2023-11-12 00:56:54,562 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-11-12 00:56:54,562 INFO L495 AbstractCegarLoop]: Abstraction has 72 states and 81 transitions. [2023-11-12 00:56:54,562 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 3.0) internal successors, (15), 5 states have internal predecessors, (15), 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 00:56:54,562 INFO L276 IsEmpty]: Start isEmpty. Operand 72 states and 81 transitions. [2023-11-12 00:56:54,563 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 34 [2023-11-12 00:56:54,563 INFO L187 NwaCegarLoop]: Found error trace [2023-11-12 00:56:54,563 INFO L195 NwaCegarLoop]: trace histogram [3, 3, 3, 3, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-11-12 00:56:54,575 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_e9dc0cbb-d2f2-4273-b8e9-d506e75045be/bin/utaipan-verify-NcY6lQBIFX/z3 -smt2 -in SMTLIB2_COMPLIANT=true (8)] Ended with exit code 0 [2023-11-12 00:56:54,774 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 8 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_e9dc0cbb-d2f2-4273-b8e9-d506e75045be/bin/utaipan-verify-NcY6lQBIFX/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable13 [2023-11-12 00:56:54,775 INFO L420 AbstractCegarLoop]: === Iteration 15 === Targeting ULTIMATE.startErr6REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 36 more)] === [2023-11-12 00:56:54,775 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-12 00:56:54,775 INFO L85 PathProgramCache]: Analyzing trace with hash -1517864309, now seen corresponding path program 1 times [2023-11-12 00:56:54,776 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2023-11-12 00:56:54,776 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1351559386] [2023-11-12 00:56:54,776 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-12 00:56:54,776 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-12 00:56:54,800 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-12 00:56:54,855 INFO L134 CoverageAnalysis]: Checked inductivity of 22 backedges. 1 proven. 0 refuted. 0 times theorem prover too weak. 21 trivial. 0 not checked. [2023-11-12 00:56:54,855 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2023-11-12 00:56:54,855 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1351559386] [2023-11-12 00:56:54,855 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1351559386] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-12 00:56:54,855 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-12 00:56:54,855 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2023-11-12 00:56:54,856 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [483425190] [2023-11-12 00:56:54,856 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-12 00:56:54,857 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2023-11-12 00:56:54,857 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2023-11-12 00:56:54,857 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2023-11-12 00:56:54,858 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2023-11-12 00:56:54,858 INFO L87 Difference]: Start difference. First operand 72 states and 81 transitions. Second operand has 4 states, 3 states have (on average 5.333333333333333) internal successors, (16), 4 states have internal predecessors, (16), 1 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) [2023-11-12 00:56:54,945 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-11-12 00:56:54,945 INFO L93 Difference]: Finished difference Result 71 states and 80 transitions. [2023-11-12 00:56:54,946 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2023-11-12 00:56:54,946 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 3 states have (on average 5.333333333333333) internal successors, (16), 4 states have internal predecessors, (16), 1 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) Word has length 33 [2023-11-12 00:56:54,946 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-11-12 00:56:54,947 INFO L225 Difference]: With dead ends: 71 [2023-11-12 00:56:54,947 INFO L226 Difference]: Without dead ends: 71 [2023-11-12 00:56:54,947 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2023-11-12 00:56:54,948 INFO L413 NwaCegarLoop]: 52 mSDtfsCounter, 5 mSDsluCounter, 69 mSDsCounter, 0 mSdLazyCounter, 92 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 5 SdHoareTripleChecker+Valid, 121 SdHoareTripleChecker+Invalid, 92 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 92 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2023-11-12 00:56:54,948 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [5 Valid, 121 Invalid, 92 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 92 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2023-11-12 00:56:54,949 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 71 states. [2023-11-12 00:56:54,951 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 71 to 71. [2023-11-12 00:56:54,951 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 71 states, 44 states have (on average 1.6818181818181819) internal successors, (74), 66 states have internal predecessors, (74), 3 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) [2023-11-12 00:56:54,952 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 71 states to 71 states and 80 transitions. [2023-11-12 00:56:54,952 INFO L78 Accepts]: Start accepts. Automaton has 71 states and 80 transitions. Word has length 33 [2023-11-12 00:56:54,953 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-11-12 00:56:54,953 INFO L495 AbstractCegarLoop]: Abstraction has 71 states and 80 transitions. [2023-11-12 00:56:54,953 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 3 states have (on average 5.333333333333333) internal successors, (16), 4 states have internal predecessors, (16), 1 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) [2023-11-12 00:56:54,953 INFO L276 IsEmpty]: Start isEmpty. Operand 71 states and 80 transitions. [2023-11-12 00:56:54,954 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 34 [2023-11-12 00:56:54,954 INFO L187 NwaCegarLoop]: Found error trace [2023-11-12 00:56:54,954 INFO L195 NwaCegarLoop]: trace histogram [3, 3, 3, 3, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-11-12 00:56:54,954 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable14 [2023-11-12 00:56:54,955 INFO L420 AbstractCegarLoop]: === Iteration 16 === Targeting ULTIMATE.startErr7REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 36 more)] === [2023-11-12 00:56:54,955 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-12 00:56:54,955 INFO L85 PathProgramCache]: Analyzing trace with hash -1517864308, now seen corresponding path program 1 times [2023-11-12 00:56:54,955 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2023-11-12 00:56:54,956 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [413296248] [2023-11-12 00:56:54,956 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-12 00:56:54,956 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-12 00:56:54,981 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-12 00:56:55,075 INFO L134 CoverageAnalysis]: Checked inductivity of 22 backedges. 1 proven. 0 refuted. 0 times theorem prover too weak. 21 trivial. 0 not checked. [2023-11-12 00:56:55,075 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2023-11-12 00:56:55,075 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [413296248] [2023-11-12 00:56:55,075 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [413296248] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-12 00:56:55,076 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-12 00:56:55,076 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2023-11-12 00:56:55,076 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1615133440] [2023-11-12 00:56:55,076 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-12 00:56:55,076 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2023-11-12 00:56:55,077 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2023-11-12 00:56:55,077 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2023-11-12 00:56:55,077 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2023-11-12 00:56:55,077 INFO L87 Difference]: Start difference. First operand 71 states and 80 transitions. Second operand has 4 states, 3 states have (on average 5.333333333333333) internal successors, (16), 4 states have internal predecessors, (16), 1 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) [2023-11-12 00:56:55,175 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-11-12 00:56:55,175 INFO L93 Difference]: Finished difference Result 70 states and 79 transitions. [2023-11-12 00:56:55,176 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2023-11-12 00:56:55,176 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 3 states have (on average 5.333333333333333) internal successors, (16), 4 states have internal predecessors, (16), 1 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) Word has length 33 [2023-11-12 00:56:55,176 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-11-12 00:56:55,177 INFO L225 Difference]: With dead ends: 70 [2023-11-12 00:56:55,177 INFO L226 Difference]: Without dead ends: 70 [2023-11-12 00:56:55,177 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2023-11-12 00:56:55,178 INFO L413 NwaCegarLoop]: 51 mSDtfsCounter, 4 mSDsluCounter, 70 mSDsCounter, 0 mSdLazyCounter, 90 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 4 SdHoareTripleChecker+Valid, 121 SdHoareTripleChecker+Invalid, 90 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 90 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2023-11-12 00:56:55,178 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [4 Valid, 121 Invalid, 90 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 90 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2023-11-12 00:56:55,179 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 70 states. [2023-11-12 00:56:55,181 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 70 to 70. [2023-11-12 00:56:55,181 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 70 states, 44 states have (on average 1.6590909090909092) internal successors, (73), 65 states have internal predecessors, (73), 3 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) [2023-11-12 00:56:55,182 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 70 states to 70 states and 79 transitions. [2023-11-12 00:56:55,182 INFO L78 Accepts]: Start accepts. Automaton has 70 states and 79 transitions. Word has length 33 [2023-11-12 00:56:55,182 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-11-12 00:56:55,183 INFO L495 AbstractCegarLoop]: Abstraction has 70 states and 79 transitions. [2023-11-12 00:56:55,183 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 3 states have (on average 5.333333333333333) internal successors, (16), 4 states have internal predecessors, (16), 1 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) [2023-11-12 00:56:55,183 INFO L276 IsEmpty]: Start isEmpty. Operand 70 states and 79 transitions. [2023-11-12 00:56:55,183 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 35 [2023-11-12 00:56:55,184 INFO L187 NwaCegarLoop]: Found error trace [2023-11-12 00:56:55,184 INFO L195 NwaCegarLoop]: trace histogram [3, 3, 3, 3, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-11-12 00:56:55,184 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable15 [2023-11-12 00:56:55,184 INFO L420 AbstractCegarLoop]: === Iteration 17 === Targeting ULTIMATE.startErr11REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 36 more)] === [2023-11-12 00:56:55,185 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-12 00:56:55,185 INFO L85 PathProgramCache]: Analyzing trace with hash 190846707, now seen corresponding path program 1 times [2023-11-12 00:56:55,185 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2023-11-12 00:56:55,185 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [978374602] [2023-11-12 00:56:55,185 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-12 00:56:55,186 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-12 00:56:55,212 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-12 00:56:55,385 INFO L134 CoverageAnalysis]: Checked inductivity of 22 backedges. 8 proven. 0 refuted. 0 times theorem prover too weak. 14 trivial. 0 not checked. [2023-11-12 00:56:55,386 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2023-11-12 00:56:55,386 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [978374602] [2023-11-12 00:56:55,386 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [978374602] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-12 00:56:55,386 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-12 00:56:55,386 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2023-11-12 00:56:55,386 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1036951434] [2023-11-12 00:56:55,387 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-12 00:56:55,387 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2023-11-12 00:56:55,387 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2023-11-12 00:56:55,388 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2023-11-12 00:56:55,388 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2023-11-12 00:56:55,388 INFO L87 Difference]: Start difference. First operand 70 states and 79 transitions. Second operand has 6 states, 4 states have (on average 5.25) internal successors, (21), 5 states have internal predecessors, (21), 1 states have call successors, (2), 1 states have call predecessors, (2), 2 states have return successors, (2), 2 states have call predecessors, (2), 1 states have call successors, (2) [2023-11-12 00:56:55,530 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-11-12 00:56:55,530 INFO L93 Difference]: Finished difference Result 69 states and 78 transitions. [2023-11-12 00:56:55,530 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2023-11-12 00:56:55,531 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 4 states have (on average 5.25) internal successors, (21), 5 states have internal predecessors, (21), 1 states have call successors, (2), 1 states have call predecessors, (2), 2 states have return successors, (2), 2 states have call predecessors, (2), 1 states have call successors, (2) Word has length 34 [2023-11-12 00:56:55,531 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-11-12 00:56:55,531 INFO L225 Difference]: With dead ends: 69 [2023-11-12 00:56:55,532 INFO L226 Difference]: Without dead ends: 69 [2023-11-12 00:56:55,532 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=13, Invalid=29, Unknown=0, NotChecked=0, Total=42 [2023-11-12 00:56:55,532 INFO L413 NwaCegarLoop]: 50 mSDtfsCounter, 3 mSDsluCounter, 137 mSDsCounter, 0 mSdLazyCounter, 158 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 3 SdHoareTripleChecker+Valid, 187 SdHoareTripleChecker+Invalid, 158 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 158 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2023-11-12 00:56:55,533 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [3 Valid, 187 Invalid, 158 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 158 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2023-11-12 00:56:55,533 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 69 states. [2023-11-12 00:56:55,535 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 69 to 69. [2023-11-12 00:56:55,553 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 69 states, 44 states have (on average 1.6363636363636365) internal successors, (72), 64 states have internal predecessors, (72), 3 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) [2023-11-12 00:56:55,553 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 69 states to 69 states and 78 transitions. [2023-11-12 00:56:55,554 INFO L78 Accepts]: Start accepts. Automaton has 69 states and 78 transitions. Word has length 34 [2023-11-12 00:56:55,554 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-11-12 00:56:55,554 INFO L495 AbstractCegarLoop]: Abstraction has 69 states and 78 transitions. [2023-11-12 00:56:55,554 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 4 states have (on average 5.25) internal successors, (21), 5 states have internal predecessors, (21), 1 states have call successors, (2), 1 states have call predecessors, (2), 2 states have return successors, (2), 2 states have call predecessors, (2), 1 states have call successors, (2) [2023-11-12 00:56:55,554 INFO L276 IsEmpty]: Start isEmpty. Operand 69 states and 78 transitions. [2023-11-12 00:56:55,554 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 36 [2023-11-12 00:56:55,555 INFO L187 NwaCegarLoop]: Found error trace [2023-11-12 00:56:55,555 INFO L195 NwaCegarLoop]: trace histogram [3, 3, 3, 3, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-11-12 00:56:55,555 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable16 [2023-11-12 00:56:55,555 INFO L420 AbstractCegarLoop]: === Iteration 18 === Targeting ULTIMATE.startErr13REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 36 more)] === [2023-11-12 00:56:55,555 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-12 00:56:55,555 INFO L85 PathProgramCache]: Analyzing trace with hash 1621284934, now seen corresponding path program 1 times [2023-11-12 00:56:55,555 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2023-11-12 00:56:55,556 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [63088316] [2023-11-12 00:56:55,556 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-12 00:56:55,556 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-12 00:56:55,589 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-12 00:56:55,735 INFO L134 CoverageAnalysis]: Checked inductivity of 22 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 22 trivial. 0 not checked. [2023-11-12 00:56:55,735 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2023-11-12 00:56:55,735 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [63088316] [2023-11-12 00:56:55,736 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [63088316] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-12 00:56:55,736 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-12 00:56:55,736 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2023-11-12 00:56:55,736 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1058485932] [2023-11-12 00:56:55,736 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-12 00:56:55,737 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2023-11-12 00:56:55,737 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2023-11-12 00:56:55,738 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2023-11-12 00:56:55,738 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=18, Unknown=0, NotChecked=0, Total=30 [2023-11-12 00:56:55,738 INFO L87 Difference]: Start difference. First operand 69 states and 78 transitions. Second operand has 6 states, 4 states have (on average 4.5) internal successors, (18), 6 states have internal predecessors, (18), 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 00:56:55,842 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-11-12 00:56:55,842 INFO L93 Difference]: Finished difference Result 67 states and 76 transitions. [2023-11-12 00:56:55,842 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2023-11-12 00:56:55,843 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 4 states have (on average 4.5) internal successors, (18), 6 states have internal predecessors, (18), 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) Word has length 35 [2023-11-12 00:56:55,843 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-11-12 00:56:55,844 INFO L225 Difference]: With dead ends: 67 [2023-11-12 00:56:55,844 INFO L226 Difference]: Without dead ends: 67 [2023-11-12 00:56:55,844 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=23, Invalid=33, Unknown=0, NotChecked=0, Total=56 [2023-11-12 00:56:55,846 INFO L413 NwaCegarLoop]: 41 mSDtfsCounter, 103 mSDsluCounter, 76 mSDsCounter, 0 mSdLazyCounter, 86 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 104 SdHoareTripleChecker+Valid, 117 SdHoareTripleChecker+Invalid, 88 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 86 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2023-11-12 00:56:55,846 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [104 Valid, 117 Invalid, 88 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 86 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2023-11-12 00:56:55,847 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 67 states. [2023-11-12 00:56:55,848 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 67 to 67. [2023-11-12 00:56:55,849 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 67 states, 44 states have (on average 1.5909090909090908) internal successors, (70), 62 states have internal predecessors, (70), 3 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) [2023-11-12 00:56:55,850 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 67 states to 67 states and 76 transitions. [2023-11-12 00:56:55,850 INFO L78 Accepts]: Start accepts. Automaton has 67 states and 76 transitions. Word has length 35 [2023-11-12 00:56:55,850 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-11-12 00:56:55,850 INFO L495 AbstractCegarLoop]: Abstraction has 67 states and 76 transitions. [2023-11-12 00:56:55,851 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 4 states have (on average 4.5) internal successors, (18), 6 states have internal predecessors, (18), 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 00:56:55,851 INFO L276 IsEmpty]: Start isEmpty. Operand 67 states and 76 transitions. [2023-11-12 00:56:55,853 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 38 [2023-11-12 00:56:55,853 INFO L187 NwaCegarLoop]: Found error trace [2023-11-12 00:56:55,853 INFO L195 NwaCegarLoop]: trace histogram [3, 3, 3, 3, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-11-12 00:56:55,853 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable17 [2023-11-12 00:56:55,854 INFO L420 AbstractCegarLoop]: === Iteration 19 === Targeting ULTIMATE.startErr18REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 36 more)] === [2023-11-12 00:56:55,854 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-12 00:56:55,854 INFO L85 PathProgramCache]: Analyzing trace with hash -1018169420, now seen corresponding path program 1 times [2023-11-12 00:56:55,855 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2023-11-12 00:56:55,855 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1026961193] [2023-11-12 00:56:55,855 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-12 00:56:55,855 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-12 00:56:55,904 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-12 00:56:56,644 INFO L134 CoverageAnalysis]: Checked inductivity of 22 backedges. 18 proven. 1 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2023-11-12 00:56:56,644 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2023-11-12 00:56:56,644 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1026961193] [2023-11-12 00:56:56,644 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1026961193] provided 0 perfect and 1 imperfect interpolant sequences [2023-11-12 00:56:56,645 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1726374461] [2023-11-12 00:56:56,645 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-12 00:56:56,645 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-11-12 00:56:56,645 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_e9dc0cbb-d2f2-4273-b8e9-d506e75045be/bin/utaipan-verify-NcY6lQBIFX/z3 [2023-11-12 00:56:56,647 INFO L229 MonitoredProcess]: Starting monitored process 9 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_e9dc0cbb-d2f2-4273-b8e9-d506e75045be/bin/utaipan-verify-NcY6lQBIFX/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2023-11-12 00:56:56,672 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_e9dc0cbb-d2f2-4273-b8e9-d506e75045be/bin/utaipan-verify-NcY6lQBIFX/z3 -smt2 -in SMTLIB2_COMPLIANT=true (9)] Waiting until timeout for monitored process [2023-11-12 00:56:56,875 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-12 00:56:56,878 INFO L262 TraceCheckSpWp]: Trace formula consists of 407 conjuncts, 42 conjunts are in the unsatisfiable core [2023-11-12 00:56:56,882 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-11-12 00:56:57,097 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 8 treesize of output 4 [2023-11-12 00:56:57,276 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-11-12 00:56:57,277 INFO L351 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 17 treesize of output 12 [2023-11-12 00:56:57,613 INFO L322 Elim1Store]: treesize reduction 36, result has 56.6 percent of original size [2023-11-12 00:56:57,614 INFO L351 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 3 new quantified variables, introduced 3 case distinctions, treesize of input 30 treesize of output 63 [2023-11-12 00:56:58,135 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-11-12 00:56:59,202 INFO L322 Elim1Store]: treesize reduction 200, result has 69.3 percent of original size [2023-11-12 00:56:59,203 INFO L351 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 11 select indices, 11 select index equivalence classes, 2 disjoint index pairs (out of 55 index pairs), introduced 14 new quantified variables, introduced 65 case distinctions, treesize of input 186 treesize of output 600