./Ultimate.py --spec ../../sv-benchmarks/c/properties/valid-memsafety.prp --file ../../sv-benchmarks/c/memsafety-broom/sll-shared-before.i --full-output --architecture 64bit -------------------------------------------------------------------------------- Checking for memory safety (deref-memtrack) Using default analysis Version 9bd2c7ff 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_602ba9ca-a736-459a-9819-f7cae6315876/bin/utaipan-verify-t7M7D8N6sZ/data/config -Xmx15G -Xms4m -jar /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_602ba9ca-a736-459a-9819-f7cae6315876/bin/utaipan-verify-t7M7D8N6sZ/plugins/org.eclipse.equinox.launcher_1.5.800.v20200727-1323.jar -data @noDefault -ultimatedata /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_602ba9ca-a736-459a-9819-f7cae6315876/bin/utaipan-verify-t7M7D8N6sZ/data -tc /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_602ba9ca-a736-459a-9819-f7cae6315876/bin/utaipan-verify-t7M7D8N6sZ/config/TaipanMemDerefMemtrack.xml -i ../../sv-benchmarks/c/memsafety-broom/sll-shared-before.i -s /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_602ba9ca-a736-459a-9819-f7cae6315876/bin/utaipan-verify-t7M7D8N6sZ/config/svcomp-DerefFreeMemtrack-64bit-Taipan_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_602ba9ca-a736-459a-9819-f7cae6315876/bin/utaipan-verify-t7M7D8N6sZ --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 64bit --witnessprinter.graph.data.programhash 332869ec37f6f5fc1ff0b6d6275b635675d9112e392919be0a978cd693d61f8f --- Real Ultimate output --- This is Ultimate 0.2.3-dev-9bd2c7f [2023-11-19 05:24:25,501 INFO L188 SettingsManager]: Resetting all preferences to default values... [2023-11-19 05:24:25,575 INFO L114 SettingsManager]: Loading settings from /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_602ba9ca-a736-459a-9819-f7cae6315876/bin/utaipan-verify-t7M7D8N6sZ/config/svcomp-DerefFreeMemtrack-64bit-Taipan_Default.epf [2023-11-19 05:24:25,580 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2023-11-19 05:24:25,580 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2023-11-19 05:24:25,605 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2023-11-19 05:24:25,606 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2023-11-19 05:24:25,607 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2023-11-19 05:24:25,607 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2023-11-19 05:24:25,608 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2023-11-19 05:24:25,608 INFO L153 SettingsManager]: * User list type=DISABLED [2023-11-19 05:24:25,609 INFO L151 SettingsManager]: Preferences of Abstract Interpretation differ from their defaults: [2023-11-19 05:24:25,610 INFO L153 SettingsManager]: * Explicit value domain=true [2023-11-19 05:24:25,610 INFO L153 SettingsManager]: * Abstract domain for RCFG-of-the-future=PoormanAbstractDomain [2023-11-19 05:24:25,610 INFO L153 SettingsManager]: * Octagon Domain=false [2023-11-19 05:24:25,611 INFO L153 SettingsManager]: * Abstract domain=CompoundDomain [2023-11-19 05:24:25,612 INFO L153 SettingsManager]: * Check feasibility of abstract posts with an SMT solver=true [2023-11-19 05:24:25,612 INFO L153 SettingsManager]: * Use the RCFG-of-the-future interface=true [2023-11-19 05:24:25,612 INFO L153 SettingsManager]: * Interval Domain=false [2023-11-19 05:24:25,613 INFO L151 SettingsManager]: Preferences of Sifa differ from their defaults: [2023-11-19 05:24:25,613 INFO L153 SettingsManager]: * Call Summarizer=TopInputCallSummarizer [2023-11-19 05:24:25,614 INFO L153 SettingsManager]: * Simplification Technique=POLY_PAC [2023-11-19 05:24:25,614 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2023-11-19 05:24:25,615 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2023-11-19 05:24:25,615 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2023-11-19 05:24:25,616 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2023-11-19 05:24:25,616 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2023-11-19 05:24:25,616 INFO L153 SettingsManager]: * Check for the main procedure if all allocated memory was freed=true [2023-11-19 05:24:25,617 INFO L153 SettingsManager]: * Bitprecise bitfields=true [2023-11-19 05:24:25,617 INFO L153 SettingsManager]: * SV-COMP memtrack compatibility mode=true [2023-11-19 05:24:25,617 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2023-11-19 05:24:25,618 INFO L153 SettingsManager]: * Adapt memory model on pointer casts if necessary=true [2023-11-19 05:24:25,618 INFO L153 SettingsManager]: * Check unreachability of reach_error function=false [2023-11-19 05:24:25,618 INFO L153 SettingsManager]: * Use constant arrays=true [2023-11-19 05:24:25,619 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2023-11-19 05:24:25,619 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2023-11-19 05:24:25,619 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2023-11-19 05:24:25,619 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2023-11-19 05:24:25,620 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2023-11-19 05:24:25,620 INFO L153 SettingsManager]: * Trace refinement strategy=SIFA_TAIPAN [2023-11-19 05:24:25,620 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2023-11-19 05:24:25,620 INFO L153 SettingsManager]: * Trace refinement exception blacklist=NONE [2023-11-19 05:24:25,621 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2023-11-19 05:24:25,621 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_602ba9ca-a736-459a-9819-f7cae6315876/bin/utaipan-verify-t7M7D8N6sZ/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_602ba9ca-a736-459a-9819-f7cae6315876/bin/utaipan-verify-t7M7D8N6sZ 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 -> 64bit Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data programhash -> 332869ec37f6f5fc1ff0b6d6275b635675d9112e392919be0a978cd693d61f8f [2023-11-19 05:24:25,922 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2023-11-19 05:24:25,952 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2023-11-19 05:24:25,954 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2023-11-19 05:24:25,957 INFO L270 PluginConnector]: Initializing CDTParser... [2023-11-19 05:24:25,957 INFO L274 PluginConnector]: CDTParser initialized [2023-11-19 05:24:25,959 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_602ba9ca-a736-459a-9819-f7cae6315876/bin/utaipan-verify-t7M7D8N6sZ/../../sv-benchmarks/c/memsafety-broom/sll-shared-before.i [2023-11-19 05:24:29,032 INFO L533 CDTParser]: Created temporary CDT project at NULL [2023-11-19 05:24:29,314 INFO L384 CDTParser]: Found 1 translation units. [2023-11-19 05:24:29,315 INFO L180 CDTParser]: Scanning /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_602ba9ca-a736-459a-9819-f7cae6315876/sv-benchmarks/c/memsafety-broom/sll-shared-before.i [2023-11-19 05:24:29,348 INFO L427 CDTParser]: About to delete temporary CDT project at /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_602ba9ca-a736-459a-9819-f7cae6315876/bin/utaipan-verify-t7M7D8N6sZ/data/6ac66e0c6/d3eef433e580426e8fae85d748e8e489/FLAG7d62479c9 [2023-11-19 05:24:29,595 INFO L435 CDTParser]: Successfully deleted /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_602ba9ca-a736-459a-9819-f7cae6315876/bin/utaipan-verify-t7M7D8N6sZ/data/6ac66e0c6/d3eef433e580426e8fae85d748e8e489 [2023-11-19 05:24:29,598 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2023-11-19 05:24:29,600 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2023-11-19 05:24:29,603 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2023-11-19 05:24:29,603 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2023-11-19 05:24:29,609 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2023-11-19 05:24:29,613 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 19.11 05:24:29" (1/1) ... [2023-11-19 05:24:29,614 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@25da5d60 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.11 05:24:29, skipping insertion in model container [2023-11-19 05:24:29,614 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 19.11 05:24:29" (1/1) ... [2023-11-19 05:24:29,702 INFO L177 MainTranslator]: Built tables and reachable declarations [2023-11-19 05:24:29,894 WARN L635 FunctionHandler]: implicit declaration of function __builtin_bswap16 [2023-11-19 05:24:30,042 INFO L209 PostProcessor]: Analyzing one entry point: main [2023-11-19 05:24:30,057 INFO L202 MainTranslator]: Completed pre-run [2023-11-19 05:24:30,094 WARN L635 FunctionHandler]: implicit declaration of function __builtin_bswap16 [2023-11-19 05:24:30,145 INFO L209 PostProcessor]: Analyzing one entry point: main [2023-11-19 05:24:30,175 WARN L675 CHandler]: The function __builtin_bswap16 is called, but not defined or handled by StandardFunctionHandler. [2023-11-19 05:24:30,184 INFO L206 MainTranslator]: Completed translation [2023-11-19 05:24:30,185 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.11 05:24:30 WrapperNode [2023-11-19 05:24:30,185 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2023-11-19 05:24:30,186 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2023-11-19 05:24:30,186 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2023-11-19 05:24:30,187 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2023-11-19 05:24:30,195 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.11 05:24:30" (1/1) ... [2023-11-19 05:24:30,217 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.11 05:24:30" (1/1) ... [2023-11-19 05:24:30,241 INFO L138 Inliner]: procedures = 121, calls = 19, calls flagged for inlining = 4, calls inlined = 4, statements flattened = 60 [2023-11-19 05:24:30,242 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2023-11-19 05:24:30,243 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2023-11-19 05:24:30,243 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2023-11-19 05:24:30,243 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2023-11-19 05:24:30,253 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.11 05:24:30" (1/1) ... [2023-11-19 05:24:30,254 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.11 05:24:30" (1/1) ... [2023-11-19 05:24:30,257 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.11 05:24:30" (1/1) ... [2023-11-19 05:24:30,258 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.11 05:24:30" (1/1) ... [2023-11-19 05:24:30,266 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.11 05:24:30" (1/1) ... [2023-11-19 05:24:30,272 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.11 05:24:30" (1/1) ... [2023-11-19 05:24:30,274 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.11 05:24:30" (1/1) ... [2023-11-19 05:24:30,276 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.11 05:24:30" (1/1) ... [2023-11-19 05:24:30,279 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2023-11-19 05:24:30,280 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2023-11-19 05:24:30,281 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2023-11-19 05:24:30,281 INFO L274 PluginConnector]: RCFGBuilder initialized [2023-11-19 05:24:30,282 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.11 05:24:30" (1/1) ... [2023-11-19 05:24:30,287 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2023-11-19 05:24:30,303 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_602ba9ca-a736-459a-9819-f7cae6315876/bin/utaipan-verify-t7M7D8N6sZ/z3 [2023-11-19 05:24:30,322 INFO L229 MonitoredProcess]: Starting monitored process 1 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_602ba9ca-a736-459a-9819-f7cae6315876/bin/utaipan-verify-t7M7D8N6sZ/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (exit command is (exit), workingDir is null) [2023-11-19 05:24:30,350 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_602ba9ca-a736-459a-9819-f7cae6315876/bin/utaipan-verify-t7M7D8N6sZ/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (1)] Waiting until timeout for monitored process [2023-11-19 05:24:30,371 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2023-11-19 05:24:30,371 INFO L130 BoogieDeclarations]: Found specification of procedure alloc_and_zero [2023-11-19 05:24:30,371 INFO L138 BoogieDeclarations]: Found implementation of procedure alloc_and_zero [2023-11-19 05:24:30,371 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnHeap [2023-11-19 05:24:30,372 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$ [2023-11-19 05:24:30,372 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$ [2023-11-19 05:24:30,372 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2023-11-19 05:24:30,372 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2023-11-19 05:24:30,374 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2023-11-19 05:24:30,554 INFO L236 CfgBuilder]: Building ICFG [2023-11-19 05:24:30,557 INFO L262 CfgBuilder]: Building CFG for each procedure with an implementation [2023-11-19 05:24:30,956 INFO L277 CfgBuilder]: Performing block encoding [2023-11-19 05:24:31,009 INFO L297 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2023-11-19 05:24:31,009 INFO L302 CfgBuilder]: Removed 2 assume(true) statements. [2023-11-19 05:24:31,015 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 19.11 05:24:31 BoogieIcfgContainer [2023-11-19 05:24:31,015 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2023-11-19 05:24:31,018 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2023-11-19 05:24:31,018 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2023-11-19 05:24:31,022 INFO L274 PluginConnector]: TraceAbstraction initialized [2023-11-19 05:24:31,023 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 19.11 05:24:29" (1/3) ... [2023-11-19 05:24:31,024 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@60cca242 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 19.11 05:24:31, skipping insertion in model container [2023-11-19 05:24:31,024 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.11 05:24:30" (2/3) ... [2023-11-19 05:24:31,025 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@60cca242 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 19.11 05:24:31, skipping insertion in model container [2023-11-19 05:24:31,025 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 19.11 05:24:31" (3/3) ... [2023-11-19 05:24:31,027 INFO L112 eAbstractionObserver]: Analyzing ICFG sll-shared-before.i [2023-11-19 05:24:31,049 INFO L203 ceAbstractionStarter]: Automizer settings: Hoare:false NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2023-11-19 05:24:31,050 INFO L162 ceAbstractionStarter]: Applying trace abstraction to program that has 23 error locations. [2023-11-19 05:24:31,103 INFO L356 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2023-11-19 05:24:31,112 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;@49523f17, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2023-11-19 05:24:31,113 INFO L358 AbstractCegarLoop]: Starting to check reachability of 23 error locations. [2023-11-19 05:24:31,117 INFO L276 IsEmpty]: Start isEmpty. Operand has 49 states, 22 states have (on average 2.1818181818181817) internal successors, (48), 45 states have internal predecessors, (48), 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-19 05:24:31,123 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 3 [2023-11-19 05:24:31,123 INFO L187 NwaCegarLoop]: Found error trace [2023-11-19 05:24:31,124 INFO L195 NwaCegarLoop]: trace histogram [1, 1] [2023-11-19 05:24:31,125 INFO L420 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [alloc_and_zeroErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, alloc_and_zeroErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 20 more)] === [2023-11-19 05:24:31,131 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-19 05:24:31,131 INFO L85 PathProgramCache]: Analyzing trace with hash 3854, now seen corresponding path program 1 times [2023-11-19 05:24:31,143 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2023-11-19 05:24:31,143 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [504394799] [2023-11-19 05:24:31,144 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-19 05:24:31,144 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-19 05:24:31,293 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-19 05:24:31,439 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-19 05:24:31,440 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2023-11-19 05:24:31,441 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [504394799] [2023-11-19 05:24:31,441 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [504394799] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-19 05:24:31,442 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-19 05:24:31,442 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2023-11-19 05:24:31,444 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1356405146] [2023-11-19 05:24:31,445 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-19 05:24:31,450 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2023-11-19 05:24:31,451 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2023-11-19 05:24:31,498 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2023-11-19 05:24:31,499 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2023-11-19 05:24:31,502 INFO L87 Difference]: Start difference. First operand has 49 states, 22 states have (on average 2.1818181818181817) internal successors, (48), 45 states have internal predecessors, (48), 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 1.0) internal successors, (2), 2 states have internal predecessors, (2), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-19 05:24:31,641 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-11-19 05:24:31,641 INFO L93 Difference]: Finished difference Result 48 states and 50 transitions. [2023-11-19 05:24:31,643 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2023-11-19 05:24:31,645 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 2 states have (on average 1.0) internal successors, (2), 2 states have internal predecessors, (2), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 2 [2023-11-19 05:24:31,646 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-11-19 05:24:31,655 INFO L225 Difference]: With dead ends: 48 [2023-11-19 05:24:31,655 INFO L226 Difference]: Without dead ends: 47 [2023-11-19 05:24:31,658 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 1 GetRequests, 0 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-19 05:24:31,665 INFO L413 NwaCegarLoop]: 39 mSDtfsCounter, 2 mSDsluCounter, 20 mSDsCounter, 0 mSdLazyCounter, 38 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 2 SdHoareTripleChecker+Valid, 59 SdHoareTripleChecker+Invalid, 38 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 38 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2023-11-19 05:24:31,667 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [2 Valid, 59 Invalid, 38 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 38 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2023-11-19 05:24:31,691 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 47 states. [2023-11-19 05:24:31,720 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 47 to 47. [2023-11-19 05:24:31,722 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 47 states, 22 states have (on average 2.0454545454545454) internal successors, (45), 43 states have internal predecessors, (45), 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-19 05:24:31,725 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 47 states to 47 states and 49 transitions. [2023-11-19 05:24:31,727 INFO L78 Accepts]: Start accepts. Automaton has 47 states and 49 transitions. Word has length 2 [2023-11-19 05:24:31,727 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-11-19 05:24:31,728 INFO L495 AbstractCegarLoop]: Abstraction has 47 states and 49 transitions. [2023-11-19 05:24:31,728 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 2 states have (on average 1.0) internal successors, (2), 2 states have internal predecessors, (2), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-19 05:24:31,730 INFO L276 IsEmpty]: Start isEmpty. Operand 47 states and 49 transitions. [2023-11-19 05:24:31,730 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 3 [2023-11-19 05:24:31,731 INFO L187 NwaCegarLoop]: Found error trace [2023-11-19 05:24:31,731 INFO L195 NwaCegarLoop]: trace histogram [1, 1] [2023-11-19 05:24:31,731 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2023-11-19 05:24:31,736 INFO L420 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [alloc_and_zeroErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, alloc_and_zeroErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 20 more)] === [2023-11-19 05:24:31,737 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-19 05:24:31,737 INFO L85 PathProgramCache]: Analyzing trace with hash 3855, now seen corresponding path program 1 times [2023-11-19 05:24:31,738 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2023-11-19 05:24:31,739 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [631701943] [2023-11-19 05:24:31,739 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-19 05:24:31,740 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-19 05:24:31,769 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-19 05:24:31,880 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-19 05:24:31,881 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2023-11-19 05:24:31,881 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [631701943] [2023-11-19 05:24:31,882 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [631701943] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-19 05:24:31,882 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-19 05:24:31,882 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2023-11-19 05:24:31,882 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1107249132] [2023-11-19 05:24:31,882 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-19 05:24:31,884 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2023-11-19 05:24:31,884 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2023-11-19 05:24:31,885 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2023-11-19 05:24:31,885 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2023-11-19 05:24:31,885 INFO L87 Difference]: Start difference. First operand 47 states and 49 transitions. Second operand has 3 states, 2 states have (on average 1.0) internal successors, (2), 2 states have internal predecessors, (2), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-19 05:24:31,943 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-11-19 05:24:31,944 INFO L93 Difference]: Finished difference Result 46 states and 48 transitions. [2023-11-19 05:24:31,944 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2023-11-19 05:24:31,944 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 2 states have (on average 1.0) internal successors, (2), 2 states have internal predecessors, (2), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 2 [2023-11-19 05:24:31,945 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-11-19 05:24:31,945 INFO L225 Difference]: With dead ends: 46 [2023-11-19 05:24:31,946 INFO L226 Difference]: Without dead ends: 46 [2023-11-19 05:24:31,946 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 1 GetRequests, 0 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-19 05:24:31,948 INFO L413 NwaCegarLoop]: 39 mSDtfsCounter, 1 mSDsluCounter, 21 mSDsCounter, 0 mSdLazyCounter, 34 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1 SdHoareTripleChecker+Valid, 60 SdHoareTripleChecker+Invalid, 34 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 34 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2023-11-19 05:24:31,949 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [1 Valid, 60 Invalid, 34 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 34 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2023-11-19 05:24:31,950 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 46 states. [2023-11-19 05:24:31,954 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 46 to 46. [2023-11-19 05:24:31,954 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 46 states, 22 states have (on average 2.0) internal successors, (44), 42 states have internal predecessors, (44), 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-19 05:24:31,956 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 46 states to 46 states and 48 transitions. [2023-11-19 05:24:31,956 INFO L78 Accepts]: Start accepts. Automaton has 46 states and 48 transitions. Word has length 2 [2023-11-19 05:24:31,956 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-11-19 05:24:31,957 INFO L495 AbstractCegarLoop]: Abstraction has 46 states and 48 transitions. [2023-11-19 05:24:31,957 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 2 states have (on average 1.0) internal successors, (2), 2 states have internal predecessors, (2), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-19 05:24:31,957 INFO L276 IsEmpty]: Start isEmpty. Operand 46 states and 48 transitions. [2023-11-19 05:24:31,957 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 6 [2023-11-19 05:24:31,958 INFO L187 NwaCegarLoop]: Found error trace [2023-11-19 05:24:31,958 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1] [2023-11-19 05:24:31,958 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2023-11-19 05:24:31,958 INFO L420 AbstractCegarLoop]: === Iteration 3 === Targeting alloc_and_zeroErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [alloc_and_zeroErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, alloc_and_zeroErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 20 more)] === [2023-11-19 05:24:31,959 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-19 05:24:31,959 INFO L85 PathProgramCache]: Analyzing trace with hash 117426514, now seen corresponding path program 1 times [2023-11-19 05:24:31,959 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2023-11-19 05:24:31,960 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [983937017] [2023-11-19 05:24:31,960 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-19 05:24:31,960 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-19 05:24:31,995 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-19 05:24:32,115 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-19 05:24:32,115 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2023-11-19 05:24:32,115 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [983937017] [2023-11-19 05:24:32,116 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [983937017] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-19 05:24:32,116 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-19 05:24:32,116 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2023-11-19 05:24:32,119 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [730159825] [2023-11-19 05:24:32,119 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-19 05:24:32,120 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2023-11-19 05:24:32,120 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2023-11-19 05:24:32,121 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2023-11-19 05:24:32,121 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2023-11-19 05:24:32,121 INFO L87 Difference]: Start difference. First operand 46 states and 48 transitions. Second operand has 3 states, 2 states have (on average 2.0) internal successors, (4), 3 states have internal predecessors, (4), 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-19 05:24:32,211 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-11-19 05:24:32,211 INFO L93 Difference]: Finished difference Result 45 states and 47 transitions. [2023-11-19 05:24:32,212 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2023-11-19 05:24:32,213 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 2 states have (on average 2.0) internal successors, (4), 3 states have internal predecessors, (4), 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 5 [2023-11-19 05:24:32,214 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-11-19 05:24:32,218 INFO L225 Difference]: With dead ends: 45 [2023-11-19 05:24:32,219 INFO L226 Difference]: Without dead ends: 45 [2023-11-19 05:24:32,220 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-19 05:24:32,222 INFO L413 NwaCegarLoop]: 37 mSDtfsCounter, 2 mSDsluCounter, 21 mSDsCounter, 0 mSdLazyCounter, 33 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 2 SdHoareTripleChecker+Valid, 58 SdHoareTripleChecker+Invalid, 33 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 33 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2023-11-19 05:24:32,224 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [2 Valid, 58 Invalid, 33 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 33 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2023-11-19 05:24:32,227 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 45 states. [2023-11-19 05:24:32,233 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 45 to 45. [2023-11-19 05:24:32,235 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 45 states, 22 states have (on average 1.9545454545454546) internal successors, (43), 41 states have internal predecessors, (43), 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-19 05:24:32,237 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 45 states to 45 states and 47 transitions. [2023-11-19 05:24:32,238 INFO L78 Accepts]: Start accepts. Automaton has 45 states and 47 transitions. Word has length 5 [2023-11-19 05:24:32,238 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-11-19 05:24:32,239 INFO L495 AbstractCegarLoop]: Abstraction has 45 states and 47 transitions. [2023-11-19 05:24:32,239 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 2 states have (on average 2.0) internal successors, (4), 3 states have internal predecessors, (4), 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-19 05:24:32,239 INFO L276 IsEmpty]: Start isEmpty. Operand 45 states and 47 transitions. [2023-11-19 05:24:32,241 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 6 [2023-11-19 05:24:32,241 INFO L187 NwaCegarLoop]: Found error trace [2023-11-19 05:24:32,241 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1] [2023-11-19 05:24:32,241 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2023-11-19 05:24:32,242 INFO L420 AbstractCegarLoop]: === Iteration 4 === Targeting alloc_and_zeroErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [alloc_and_zeroErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, alloc_and_zeroErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 20 more)] === [2023-11-19 05:24:32,243 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-19 05:24:32,243 INFO L85 PathProgramCache]: Analyzing trace with hash 117426515, now seen corresponding path program 1 times [2023-11-19 05:24:32,244 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2023-11-19 05:24:32,244 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [176549961] [2023-11-19 05:24:32,244 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-19 05:24:32,244 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-19 05:24:32,282 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-19 05:24:32,437 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-19 05:24:32,444 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2023-11-19 05:24:32,444 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [176549961] [2023-11-19 05:24:32,445 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [176549961] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-19 05:24:32,445 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-19 05:24:32,445 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2023-11-19 05:24:32,445 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1640997997] [2023-11-19 05:24:32,445 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-19 05:24:32,446 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2023-11-19 05:24:32,446 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2023-11-19 05:24:32,447 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2023-11-19 05:24:32,447 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2023-11-19 05:24:32,447 INFO L87 Difference]: Start difference. First operand 45 states and 47 transitions. Second operand has 3 states, 2 states have (on average 2.0) internal successors, (4), 3 states have internal predecessors, (4), 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-19 05:24:32,502 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-11-19 05:24:32,502 INFO L93 Difference]: Finished difference Result 44 states and 46 transitions. [2023-11-19 05:24:32,503 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2023-11-19 05:24:32,503 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 2 states have (on average 2.0) internal successors, (4), 3 states have internal predecessors, (4), 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 5 [2023-11-19 05:24:32,503 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-11-19 05:24:32,504 INFO L225 Difference]: With dead ends: 44 [2023-11-19 05:24:32,504 INFO L226 Difference]: Without dead ends: 44 [2023-11-19 05:24:32,505 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-19 05:24:32,506 INFO L413 NwaCegarLoop]: 37 mSDtfsCounter, 1 mSDsluCounter, 26 mSDsCounter, 0 mSdLazyCounter, 27 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1 SdHoareTripleChecker+Valid, 63 SdHoareTripleChecker+Invalid, 27 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 27 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2023-11-19 05:24:32,507 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [1 Valid, 63 Invalid, 27 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 27 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2023-11-19 05:24:32,508 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 44 states. [2023-11-19 05:24:32,511 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 44 to 44. [2023-11-19 05:24:32,512 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 44 states, 22 states have (on average 1.9090909090909092) internal successors, (42), 40 states have internal predecessors, (42), 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-19 05:24:32,513 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 44 states to 44 states and 46 transitions. [2023-11-19 05:24:32,513 INFO L78 Accepts]: Start accepts. Automaton has 44 states and 46 transitions. Word has length 5 [2023-11-19 05:24:32,513 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-11-19 05:24:32,514 INFO L495 AbstractCegarLoop]: Abstraction has 44 states and 46 transitions. [2023-11-19 05:24:32,514 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 2 states have (on average 2.0) internal successors, (4), 3 states have internal predecessors, (4), 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-19 05:24:32,514 INFO L276 IsEmpty]: Start isEmpty. Operand 44 states and 46 transitions. [2023-11-19 05:24:32,515 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 9 [2023-11-19 05:24:32,515 INFO L187 NwaCegarLoop]: Found error trace [2023-11-19 05:24:32,515 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1] [2023-11-19 05:24:32,515 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2023-11-19 05:24:32,515 INFO L420 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [alloc_and_zeroErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, alloc_and_zeroErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 20 more)] === [2023-11-19 05:24:32,516 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-19 05:24:32,516 INFO L85 PathProgramCache]: Analyzing trace with hash -2142245720, now seen corresponding path program 1 times [2023-11-19 05:24:32,516 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2023-11-19 05:24:32,517 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [108212932] [2023-11-19 05:24:32,517 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-19 05:24:32,517 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-19 05:24:32,534 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-19 05:24:32,653 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-19 05:24:32,654 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2023-11-19 05:24:32,654 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [108212932] [2023-11-19 05:24:32,654 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [108212932] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-19 05:24:32,654 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-19 05:24:32,654 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2023-11-19 05:24:32,655 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2139131017] [2023-11-19 05:24:32,655 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-19 05:24:32,657 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2023-11-19 05:24:32,657 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2023-11-19 05:24:32,658 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2023-11-19 05:24:32,659 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2023-11-19 05:24:32,659 INFO L87 Difference]: Start difference. First operand 44 states and 46 transitions. Second operand has 5 states, 3 states have (on average 2.0) internal successors, (6), 4 states have internal predecessors, (6), 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-19 05:24:32,785 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-11-19 05:24:32,785 INFO L93 Difference]: Finished difference Result 45 states and 49 transitions. [2023-11-19 05:24:32,786 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2023-11-19 05:24:32,786 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 3 states have (on average 2.0) internal successors, (6), 4 states have internal predecessors, (6), 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 8 [2023-11-19 05:24:32,786 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-11-19 05:24:32,792 INFO L225 Difference]: With dead ends: 45 [2023-11-19 05:24:32,792 INFO L226 Difference]: Without dead ends: 45 [2023-11-19 05:24:32,792 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2023-11-19 05:24:32,797 INFO L413 NwaCegarLoop]: 27 mSDtfsCounter, 11 mSDsluCounter, 46 mSDsCounter, 0 mSdLazyCounter, 87 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 11 SdHoareTripleChecker+Valid, 73 SdHoareTripleChecker+Invalid, 90 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 87 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2023-11-19 05:24:32,798 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [11 Valid, 73 Invalid, 90 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 87 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2023-11-19 05:24:32,802 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 45 states. [2023-11-19 05:24:32,808 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 45 to 41. [2023-11-19 05:24:32,814 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 41 states, 22 states have (on average 1.7727272727272727) internal successors, (39), 37 states have internal predecessors, (39), 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-19 05:24:32,815 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 41 states to 41 states and 43 transitions. [2023-11-19 05:24:32,816 INFO L78 Accepts]: Start accepts. Automaton has 41 states and 43 transitions. Word has length 8 [2023-11-19 05:24:32,816 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-11-19 05:24:32,817 INFO L495 AbstractCegarLoop]: Abstraction has 41 states and 43 transitions. [2023-11-19 05:24:32,817 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 3 states have (on average 2.0) internal successors, (6), 4 states have internal predecessors, (6), 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-19 05:24:32,817 INFO L276 IsEmpty]: Start isEmpty. Operand 41 states and 43 transitions. [2023-11-19 05:24:32,818 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 9 [2023-11-19 05:24:32,818 INFO L187 NwaCegarLoop]: Found error trace [2023-11-19 05:24:32,819 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1] [2023-11-19 05:24:32,819 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2023-11-19 05:24:32,819 INFO L420 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr3REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [alloc_and_zeroErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, alloc_and_zeroErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 20 more)] === [2023-11-19 05:24:32,821 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-19 05:24:32,821 INFO L85 PathProgramCache]: Analyzing trace with hash -2142245719, now seen corresponding path program 1 times [2023-11-19 05:24:32,821 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2023-11-19 05:24:32,822 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [916538000] [2023-11-19 05:24:32,822 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-19 05:24:32,822 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-19 05:24:32,846 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-19 05:24:33,101 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-19 05:24:33,101 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2023-11-19 05:24:33,101 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [916538000] [2023-11-19 05:24:33,101 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [916538000] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-19 05:24:33,102 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-19 05:24:33,102 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2023-11-19 05:24:33,102 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1919948383] [2023-11-19 05:24:33,102 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-19 05:24:33,103 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2023-11-19 05:24:33,103 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2023-11-19 05:24:33,103 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2023-11-19 05:24:33,104 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2023-11-19 05:24:33,105 INFO L87 Difference]: Start difference. First operand 41 states and 43 transitions. Second operand has 6 states, 4 states have (on average 1.5) internal successors, (6), 5 states have internal predecessors, (6), 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-19 05:24:33,220 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-11-19 05:24:33,220 INFO L93 Difference]: Finished difference Result 44 states and 48 transitions. [2023-11-19 05:24:33,221 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2023-11-19 05:24:33,221 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 4 states have (on average 1.5) internal successors, (6), 5 states have internal predecessors, (6), 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 8 [2023-11-19 05:24:33,222 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-11-19 05:24:33,222 INFO L225 Difference]: With dead ends: 44 [2023-11-19 05:24:33,222 INFO L226 Difference]: Without dead ends: 44 [2023-11-19 05:24:33,223 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-19 05:24:33,223 INFO L413 NwaCegarLoop]: 31 mSDtfsCounter, 5 mSDsluCounter, 83 mSDsCounter, 0 mSdLazyCounter, 90 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 5 SdHoareTripleChecker+Valid, 114 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-19 05:24:33,224 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [5 Valid, 114 Invalid, 90 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 90 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2023-11-19 05:24:33,225 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 44 states. [2023-11-19 05:24:33,228 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 44 to 40. [2023-11-19 05:24:33,229 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 40 states, 22 states have (on average 1.7272727272727273) internal successors, (38), 36 states have internal predecessors, (38), 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-19 05:24:33,229 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 40 states to 40 states and 42 transitions. [2023-11-19 05:24:33,230 INFO L78 Accepts]: Start accepts. Automaton has 40 states and 42 transitions. Word has length 8 [2023-11-19 05:24:33,230 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-11-19 05:24:33,230 INFO L495 AbstractCegarLoop]: Abstraction has 40 states and 42 transitions. [2023-11-19 05:24:33,230 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 4 states have (on average 1.5) internal successors, (6), 5 states have internal predecessors, (6), 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-19 05:24:33,230 INFO L276 IsEmpty]: Start isEmpty. Operand 40 states and 42 transitions. [2023-11-19 05:24:33,231 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 13 [2023-11-19 05:24:33,231 INFO L187 NwaCegarLoop]: Found error trace [2023-11-19 05:24:33,231 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-11-19 05:24:33,231 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2023-11-19 05:24:33,232 INFO L420 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr12ASSERT_VIOLATIONMEMORY_FREE === [alloc_and_zeroErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, alloc_and_zeroErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 20 more)] === [2023-11-19 05:24:33,232 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-19 05:24:33,232 INFO L85 PathProgramCache]: Analyzing trace with hash -944395741, now seen corresponding path program 1 times [2023-11-19 05:24:33,233 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2023-11-19 05:24:33,233 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1670939637] [2023-11-19 05:24:33,233 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-19 05:24:33,233 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-19 05:24:33,261 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-19 05:24:33,288 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-19 05:24:33,289 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2023-11-19 05:24:33,289 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1670939637] [2023-11-19 05:24:33,289 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1670939637] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-19 05:24:33,289 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-19 05:24:33,289 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2023-11-19 05:24:33,290 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1782858240] [2023-11-19 05:24:33,290 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-19 05:24:33,290 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2023-11-19 05:24:33,290 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2023-11-19 05:24:33,291 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2023-11-19 05:24:33,291 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2023-11-19 05:24:33,291 INFO L87 Difference]: Start difference. First operand 40 states and 42 transitions. Second operand has 3 states, 2 states have (on average 5.0) internal successors, (10), 3 states have internal predecessors, (10), 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-19 05:24:33,307 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-11-19 05:24:33,308 INFO L93 Difference]: Finished difference Result 39 states and 41 transitions. [2023-11-19 05:24:33,308 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2023-11-19 05:24:33,308 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 2 states have (on average 5.0) internal successors, (10), 3 states have internal predecessors, (10), 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 12 [2023-11-19 05:24:33,309 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-11-19 05:24:33,309 INFO L225 Difference]: With dead ends: 39 [2023-11-19 05:24:33,309 INFO L226 Difference]: Without dead ends: 39 [2023-11-19 05:24:33,310 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-19 05:24:33,313 INFO L413 NwaCegarLoop]: 31 mSDtfsCounter, 28 mSDsluCounter, 3 mSDsCounter, 0 mSdLazyCounter, 11 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 29 SdHoareTripleChecker+Valid, 34 SdHoareTripleChecker+Invalid, 11 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 11 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2023-11-19 05:24:33,313 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [29 Valid, 34 Invalid, 11 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 11 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2023-11-19 05:24:33,314 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 39 states. [2023-11-19 05:24:33,319 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 39 to 39. [2023-11-19 05:24:33,319 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 39 states, 22 states have (on average 1.6818181818181819) internal successors, (37), 35 states have internal predecessors, (37), 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-19 05:24:33,321 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 39 states to 39 states and 41 transitions. [2023-11-19 05:24:33,321 INFO L78 Accepts]: Start accepts. Automaton has 39 states and 41 transitions. Word has length 12 [2023-11-19 05:24:33,321 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-11-19 05:24:33,321 INFO L495 AbstractCegarLoop]: Abstraction has 39 states and 41 transitions. [2023-11-19 05:24:33,321 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 2 states have (on average 5.0) internal successors, (10), 3 states have internal predecessors, (10), 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-19 05:24:33,322 INFO L276 IsEmpty]: Start isEmpty. Operand 39 states and 41 transitions. [2023-11-19 05:24:33,322 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 14 [2023-11-19 05:24:33,322 INFO L187 NwaCegarLoop]: Found error trace [2023-11-19 05:24:33,322 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-11-19 05:24:33,323 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2023-11-19 05:24:33,323 INFO L420 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr13ASSERT_VIOLATIONMEMORY_FREE === [alloc_and_zeroErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, alloc_and_zeroErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 20 more)] === [2023-11-19 05:24:33,323 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-19 05:24:33,323 INFO L85 PathProgramCache]: Analyzing trace with hash 788503184, now seen corresponding path program 1 times [2023-11-19 05:24:33,323 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2023-11-19 05:24:33,324 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [168790129] [2023-11-19 05:24:33,324 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-19 05:24:33,324 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-19 05:24:33,348 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-19 05:24:33,377 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-19 05:24:33,377 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2023-11-19 05:24:33,378 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [168790129] [2023-11-19 05:24:33,378 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [168790129] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-19 05:24:33,378 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-19 05:24:33,378 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2023-11-19 05:24:33,378 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1477736620] [2023-11-19 05:24:33,378 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-19 05:24:33,379 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2023-11-19 05:24:33,379 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2023-11-19 05:24:33,380 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2023-11-19 05:24:33,380 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2023-11-19 05:24:33,380 INFO L87 Difference]: Start difference. First operand 39 states and 41 transitions. Second operand has 3 states, 2 states have (on average 5.5) internal successors, (11), 3 states have internal predecessors, (11), 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-19 05:24:33,406 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-11-19 05:24:33,406 INFO L93 Difference]: Finished difference Result 38 states and 40 transitions. [2023-11-19 05:24:33,406 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2023-11-19 05:24:33,407 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 2 states have (on average 5.5) internal successors, (11), 3 states have internal predecessors, (11), 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 13 [2023-11-19 05:24:33,408 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-11-19 05:24:33,409 INFO L225 Difference]: With dead ends: 38 [2023-11-19 05:24:33,409 INFO L226 Difference]: Without dead ends: 38 [2023-11-19 05:24:33,409 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-19 05:24:33,411 INFO L413 NwaCegarLoop]: 26 mSDtfsCounter, 26 mSDsluCounter, 0 mSDsCounter, 0 mSdLazyCounter, 18 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 27 SdHoareTripleChecker+Valid, 26 SdHoareTripleChecker+Invalid, 18 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 18 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2023-11-19 05:24:33,412 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [27 Valid, 26 Invalid, 18 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 18 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2023-11-19 05:24:33,413 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 38 states. [2023-11-19 05:24:33,420 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 38 to 38. [2023-11-19 05:24:33,422 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 38 states, 22 states have (on average 1.6363636363636365) internal successors, (36), 34 states have internal predecessors, (36), 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-19 05:24:33,425 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 38 states to 38 states and 40 transitions. [2023-11-19 05:24:33,425 INFO L78 Accepts]: Start accepts. Automaton has 38 states and 40 transitions. Word has length 13 [2023-11-19 05:24:33,425 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-11-19 05:24:33,426 INFO L495 AbstractCegarLoop]: Abstraction has 38 states and 40 transitions. [2023-11-19 05:24:33,426 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 2 states have (on average 5.5) internal successors, (11), 3 states have internal predecessors, (11), 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-19 05:24:33,426 INFO L276 IsEmpty]: Start isEmpty. Operand 38 states and 40 transitions. [2023-11-19 05:24:33,427 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 15 [2023-11-19 05:24:33,427 INFO L187 NwaCegarLoop]: Found error trace [2023-11-19 05:24:33,427 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-11-19 05:24:33,427 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2023-11-19 05:24:33,428 INFO L420 AbstractCegarLoop]: === Iteration 9 === Targeting ULTIMATE.startErr14ASSERT_VIOLATIONMEMORY_FREE === [alloc_and_zeroErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, alloc_and_zeroErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 20 more)] === [2023-11-19 05:24:33,428 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-19 05:24:33,428 INFO L85 PathProgramCache]: Analyzing trace with hash -1326204987, now seen corresponding path program 1 times [2023-11-19 05:24:33,428 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2023-11-19 05:24:33,428 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1764606590] [2023-11-19 05:24:33,429 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-19 05:24:33,429 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-19 05:24:33,460 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-19 05:24:33,624 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-11-19 05:24:33,625 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2023-11-19 05:24:33,625 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1764606590] [2023-11-19 05:24:33,625 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1764606590] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-19 05:24:33,625 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-19 05:24:33,625 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2023-11-19 05:24:33,626 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1080878116] [2023-11-19 05:24:33,626 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-19 05:24:33,626 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2023-11-19 05:24:33,627 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2023-11-19 05:24:33,627 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2023-11-19 05:24:33,627 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2023-11-19 05:24:33,628 INFO L87 Difference]: Start difference. First operand 38 states and 40 transitions. Second operand has 6 states, 4 states have (on average 3.0) internal successors, (12), 4 states have internal predecessors, (12), 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-19 05:24:33,753 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-11-19 05:24:33,753 INFO L93 Difference]: Finished difference Result 37 states and 39 transitions. [2023-11-19 05:24:33,754 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2023-11-19 05:24:33,754 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 4 states have (on average 3.0) internal successors, (12), 4 states have internal predecessors, (12), 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 14 [2023-11-19 05:24:33,754 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-11-19 05:24:33,755 INFO L225 Difference]: With dead ends: 37 [2023-11-19 05:24:33,761 INFO L226 Difference]: Without dead ends: 37 [2023-11-19 05:24:33,762 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=16, Invalid=26, Unknown=0, NotChecked=0, Total=42 [2023-11-19 05:24:33,764 INFO L413 NwaCegarLoop]: 21 mSDtfsCounter, 12 mSDsluCounter, 51 mSDsCounter, 0 mSdLazyCounter, 91 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 12 SdHoareTripleChecker+Valid, 72 SdHoareTripleChecker+Invalid, 94 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 91 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2023-11-19 05:24:33,764 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [12 Valid, 72 Invalid, 94 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 91 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2023-11-19 05:24:33,766 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 37 states. [2023-11-19 05:24:33,772 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 37 to 37. [2023-11-19 05:24:33,773 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 37 states, 22 states have (on average 1.5909090909090908) internal successors, (35), 33 states have internal predecessors, (35), 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-19 05:24:33,773 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 37 states to 37 states and 39 transitions. [2023-11-19 05:24:33,773 INFO L78 Accepts]: Start accepts. Automaton has 37 states and 39 transitions. Word has length 14 [2023-11-19 05:24:33,774 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-11-19 05:24:33,774 INFO L495 AbstractCegarLoop]: Abstraction has 37 states and 39 transitions. [2023-11-19 05:24:33,774 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 4 states have (on average 3.0) internal successors, (12), 4 states have internal predecessors, (12), 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-19 05:24:33,774 INFO L276 IsEmpty]: Start isEmpty. Operand 37 states and 39 transitions. [2023-11-19 05:24:33,774 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 16 [2023-11-19 05:24:33,775 INFO L187 NwaCegarLoop]: Found error trace [2023-11-19 05:24:33,775 INFO L195 NwaCegarLoop]: trace histogram [2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-11-19 05:24:33,775 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2023-11-19 05:24:33,775 INFO L420 AbstractCegarLoop]: === Iteration 10 === Targeting ULTIMATE.startErr4REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [alloc_and_zeroErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, alloc_and_zeroErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 20 more)] === [2023-11-19 05:24:33,776 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-19 05:24:33,776 INFO L85 PathProgramCache]: Analyzing trace with hash 1889403663, now seen corresponding path program 1 times [2023-11-19 05:24:33,776 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2023-11-19 05:24:33,776 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1109338029] [2023-11-19 05:24:33,776 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-19 05:24:33,776 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-19 05:24:33,805 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-19 05:24:34,015 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 1 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-11-19 05:24:34,016 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2023-11-19 05:24:34,016 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1109338029] [2023-11-19 05:24:34,016 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1109338029] provided 0 perfect and 1 imperfect interpolant sequences [2023-11-19 05:24:34,016 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [321745479] [2023-11-19 05:24:34,016 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-19 05:24:34,016 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-11-19 05:24:34,017 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_602ba9ca-a736-459a-9819-f7cae6315876/bin/utaipan-verify-t7M7D8N6sZ/z3 [2023-11-19 05:24:34,020 INFO L229 MonitoredProcess]: Starting monitored process 2 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_602ba9ca-a736-459a-9819-f7cae6315876/bin/utaipan-verify-t7M7D8N6sZ/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2023-11-19 05:24:34,027 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_602ba9ca-a736-459a-9819-f7cae6315876/bin/utaipan-verify-t7M7D8N6sZ/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Waiting until timeout for monitored process [2023-11-19 05:24:34,135 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-19 05:24:34,137 INFO L262 TraceCheckSpWp]: Trace formula consists of 166 conjuncts, 8 conjunts are in the unsatisfiable core [2023-11-19 05:24:34,143 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-11-19 05:24:34,238 WARN L876 $PredicateComparison]: unable to prove that (exists ((alloc_and_zero_~pi~0.base Int)) (and (= (select |c_old(#valid)| alloc_and_zero_~pi~0.base) 0) (= |c_#valid| (store |c_old(#valid)| alloc_and_zero_~pi~0.base (select |c_#valid| alloc_and_zero_~pi~0.base))))) is different from true [2023-11-19 05:24:34,303 INFO L349 Elim1Store]: treesize reduction 20, result has 33.3 percent of original size [2023-11-19 05:24:34,304 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 2 case distinctions, treesize of input 19 treesize of output 16 [2023-11-19 05:24:34,312 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 3 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-11-19 05:24:34,313 INFO L323 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2023-11-19 05:24:34,313 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [321745479] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-19 05:24:34,313 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2023-11-19 05:24:34,313 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [8] total 9 [2023-11-19 05:24:34,314 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [657728678] [2023-11-19 05:24:34,314 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-19 05:24:34,315 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2023-11-19 05:24:34,315 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2023-11-19 05:24:34,315 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2023-11-19 05:24:34,316 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=19, Invalid=56, Unknown=1, NotChecked=14, Total=90 [2023-11-19 05:24:34,316 INFO L87 Difference]: Start difference. First operand 37 states and 39 transitions. Second operand has 5 states, 4 states have (on average 2.75) internal successors, (11), 4 states have internal predecessors, (11), 2 states have call successors, (2), 2 states have call predecessors, (2), 2 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2023-11-19 05:24:34,369 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-11-19 05:24:34,369 INFO L93 Difference]: Finished difference Result 43 states and 47 transitions. [2023-11-19 05:24:34,369 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2023-11-19 05:24:34,370 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 4 states have (on average 2.75) internal successors, (11), 4 states have internal predecessors, (11), 2 states have call successors, (2), 2 states have call predecessors, (2), 2 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) Word has length 15 [2023-11-19 05:24:34,370 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-11-19 05:24:34,370 INFO L225 Difference]: With dead ends: 43 [2023-11-19 05:24:34,371 INFO L226 Difference]: Without dead ends: 43 [2023-11-19 05:24:34,371 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 23 GetRequests, 15 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 1 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=19, Invalid=56, Unknown=1, NotChecked=14, Total=90 [2023-11-19 05:24:34,372 INFO L413 NwaCegarLoop]: 24 mSDtfsCounter, 9 mSDsluCounter, 25 mSDsCounter, 0 mSdLazyCounter, 51 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 9 SdHoareTripleChecker+Valid, 49 SdHoareTripleChecker+Invalid, 108 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 51 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 54 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2023-11-19 05:24:34,373 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [9 Valid, 49 Invalid, 108 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 51 Invalid, 0 Unknown, 54 Unchecked, 0.0s Time] [2023-11-19 05:24:34,374 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 43 states. [2023-11-19 05:24:34,385 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 43 to 41. [2023-11-19 05:24:34,386 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 41 states, 25 states have (on average 1.6) internal successors, (40), 36 states have internal predecessors, (40), 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-19 05:24:34,386 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 41 states to 41 states and 46 transitions. [2023-11-19 05:24:34,387 INFO L78 Accepts]: Start accepts. Automaton has 41 states and 46 transitions. Word has length 15 [2023-11-19 05:24:34,387 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-11-19 05:24:34,387 INFO L495 AbstractCegarLoop]: Abstraction has 41 states and 46 transitions. [2023-11-19 05:24:34,387 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 4 states have (on average 2.75) internal successors, (11), 4 states have internal predecessors, (11), 2 states have call successors, (2), 2 states have call predecessors, (2), 2 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2023-11-19 05:24:34,388 INFO L276 IsEmpty]: Start isEmpty. Operand 41 states and 46 transitions. [2023-11-19 05:24:34,389 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 16 [2023-11-19 05:24:34,389 INFO L187 NwaCegarLoop]: Found error trace [2023-11-19 05:24:34,389 INFO L195 NwaCegarLoop]: trace histogram [2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-11-19 05:24:34,412 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_602ba9ca-a736-459a-9819-f7cae6315876/bin/utaipan-verify-t7M7D8N6sZ/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Forceful destruction successful, exit code 0 [2023-11-19 05:24:34,608 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 2 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_602ba9ca-a736-459a-9819-f7cae6315876/bin/utaipan-verify-t7M7D8N6sZ/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable9 [2023-11-19 05:24:34,609 INFO L420 AbstractCegarLoop]: === Iteration 11 === Targeting ULTIMATE.startErr5REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [alloc_and_zeroErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, alloc_and_zeroErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 20 more)] === [2023-11-19 05:24:34,609 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-19 05:24:34,609 INFO L85 PathProgramCache]: Analyzing trace with hash 1889403664, now seen corresponding path program 1 times [2023-11-19 05:24:34,609 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2023-11-19 05:24:34,609 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1802721480] [2023-11-19 05:24:34,610 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-19 05:24:34,610 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-19 05:24:34,645 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-19 05:24:35,022 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 1 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-11-19 05:24:35,023 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2023-11-19 05:24:35,023 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1802721480] [2023-11-19 05:24:35,023 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1802721480] provided 0 perfect and 1 imperfect interpolant sequences [2023-11-19 05:24:35,023 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1193322325] [2023-11-19 05:24:35,023 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-19 05:24:35,023 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-11-19 05:24:35,024 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_602ba9ca-a736-459a-9819-f7cae6315876/bin/utaipan-verify-t7M7D8N6sZ/z3 [2023-11-19 05:24:35,025 INFO L229 MonitoredProcess]: Starting monitored process 3 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_602ba9ca-a736-459a-9819-f7cae6315876/bin/utaipan-verify-t7M7D8N6sZ/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2023-11-19 05:24:35,044 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_602ba9ca-a736-459a-9819-f7cae6315876/bin/utaipan-verify-t7M7D8N6sZ/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Waiting until timeout for monitored process [2023-11-19 05:24:35,167 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-19 05:24:35,169 INFO L262 TraceCheckSpWp]: Trace formula consists of 166 conjuncts, 26 conjunts are in the unsatisfiable core [2023-11-19 05:24:35,174 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-11-19 05:24:35,187 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 8 treesize of output 1 [2023-11-19 05:24:35,386 WARN L876 $PredicateComparison]: unable to prove that (exists ((alloc_and_zero_~pi~0.base Int)) (and (= (select |c_old(#valid)| alloc_and_zero_~pi~0.base) 0) (= (store |c_old(#length)| alloc_and_zero_~pi~0.base (select |c_#length| alloc_and_zero_~pi~0.base)) |c_#length|))) is different from true [2023-11-19 05:24:35,410 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-11-19 05:24:35,411 INFO L378 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-19 05:24:35,424 INFO L349 Elim1Store]: treesize reduction 4, result has 50.0 percent of original size [2023-11-19 05:24:35,425 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 11 treesize of output 11 [2023-11-19 05:24:35,448 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 1 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 2 not checked. [2023-11-19 05:24:35,449 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2023-11-19 05:24:35,632 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1193322325] provided 0 perfect and 1 imperfect interpolant sequences [2023-11-19 05:24:35,632 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSifa [215334311] [2023-11-19 05:24:35,655 INFO L159 IcfgInterpreter]: Started Sifa with 13 locations of interest [2023-11-19 05:24:35,655 INFO L166 IcfgInterpreter]: Building call graph [2023-11-19 05:24:35,659 INFO L171 IcfgInterpreter]: Initial procedures are [ULTIMATE.start] [2023-11-19 05:24:35,665 INFO L176 IcfgInterpreter]: Starting interpretation [2023-11-19 05:24:35,665 INFO L197 IcfgInterpreter]: Interpreting procedure ULTIMATE.start with input of size 1 for LOIs [2023-11-19 05:24:37,711 INFO L197 IcfgInterpreter]: Interpreting procedure alloc_and_zero with input of size 209 for LOIs [2023-11-19 05:24:38,059 INFO L180 IcfgInterpreter]: Interpretation finished [2023-11-19 05:25:16,568 INFO L133 SifaRunner]: Sifa could not show that error location is unreachable, found '1057#(and (<= 1 |#StackHeapBarrier|) (<= (select |#length| |ULTIMATE.start_create_~now~0#1.base|) 15) (= |ULTIMATE.start_create_#in~data#1.offset| 0) (= 0 |ULTIMATE.start_main_~data~0#1.offset|) (or (and (exists ((|v_#valid_62| (Array Int Int))) (and (= (select |v_#valid_62| |ULTIMATE.start_create_#t~ret6#1.base|) 0) (= (store |v_#valid_62| |ULTIMATE.start_create_#t~ret6#1.base| 1) |#valid|))) (exists ((|v_old(#length)_AFTER_CALL_8| (Array Int Int)) (|v_#memory_int_41| (Array Int (Array Int Int))) (|v_#memory_$Pointer$.offset_48| (Array Int (Array Int Int))) (|v_old(#valid)_AFTER_CALL_8| (Array Int Int)) (|v_old(#memory_int)_AFTER_CALL_8| (Array Int (Array Int Int))) (|v_#memory_$Pointer$.base_48| (Array Int (Array Int Int)))) (and (= (store |v_#memory_int_41| |ULTIMATE.start_create_~now~0#1.base| (store (select |v_#memory_int_41| |ULTIMATE.start_create_~now~0#1.base|) 0 (select (select |v_old(#memory_int)_AFTER_CALL_8| |ULTIMATE.start_create_~now~0#1.base|) 0))) |v_old(#memory_int)_AFTER_CALL_8|) (or (and (exists ((|v_#valid_62| (Array Int Int))) (and (= (select |v_#valid_62| |ULTIMATE.start_create_~sll~0#1.base|) 0) (= (store |v_#valid_62| |ULTIMATE.start_create_~sll~0#1.base| 1) |v_old(#valid)_AFTER_CALL_8|))) (= 0 (select |ULTIMATE.start_main_old_#valid#1| |ULTIMATE.start_main_~data~0#1.base|)) (not (= |ULTIMATE.start_create_~sll~0#1.base| 0)) (exists ((|v_old(#memory_int)_AFTER_CALL_6| (Array Int (Array Int Int))) (|v_#memory_int_39| (Array Int (Array Int Int)))) (and (= |v_old(#memory_int)_AFTER_CALL_6| (store |v_#memory_int_39| |ULTIMATE.start_main_~data~0#1.base| (store (select |v_#memory_int_39| |ULTIMATE.start_main_~data~0#1.base|) 0 (select (select |v_old(#memory_int)_AFTER_CALL_6| |ULTIMATE.start_main_~data~0#1.base|) 0)))) (<= (select (select |v_old(#memory_int)_AFTER_CALL_6| |ULTIMATE.start_main_~data~0#1.base|) 0) 2147483647) (<= 0 (+ (select (select |v_old(#memory_int)_AFTER_CALL_6| |ULTIMATE.start_main_~data~0#1.base|) 0) 2147483648)))) (exists ((|v_#memory_$Pointer$.offset_47| (Array Int (Array Int Int)))) (= (store |v_#memory_$Pointer$.offset_47| |ULTIMATE.start_create_~sll~0#1.base| (store (select |v_#memory_$Pointer$.offset_47| |ULTIMATE.start_create_~sll~0#1.base|) 8 0)) |v_#memory_$Pointer$.offset_48|)) (= |ULTIMATE.start_create_#in~data#1.base| |ULTIMATE.start_create_~data#1.base|) (= |ULTIMATE.start_main_~data~0#1.base| |ULTIMATE.start_create_#in~data#1.base|) (exists ((|v_old(#memory_$Pointer$.base)_AFTER_CALL_6| (Array Int (Array Int Int))) (|v_#memory_$Pointer$.base_46| (Array Int (Array Int Int)))) (= |v_old(#memory_$Pointer$.base)_AFTER_CALL_6| (store |v_#memory_$Pointer$.base_46| |ULTIMATE.start_main_~data~0#1.base| (store (select |v_#memory_$Pointer$.base_46| |ULTIMATE.start_main_~data~0#1.base|) 0 (select (select |v_old(#memory_$Pointer$.base)_AFTER_CALL_6| |ULTIMATE.start_main_~data~0#1.base|) 0))))) (<= (+ |ULTIMATE.start_create_~sll~0#1.base| 1) |#StackHeapBarrier|) (exists ((|v_#memory_$Pointer$.offset_46| (Array Int (Array Int Int))) (|v_old(#memory_$Pointer$.offset)_AFTER_CALL_6| (Array Int (Array Int Int)))) (= |v_old(#memory_$Pointer$.offset)_AFTER_CALL_6| (store |v_#memory_$Pointer$.offset_46| |ULTIMATE.start_main_~data~0#1.base| (store (select |v_#memory_$Pointer$.offset_46| |ULTIMATE.start_main_~data~0#1.base|) 0 (select (select |v_old(#memory_$Pointer$.offset)_AFTER_CALL_6| |ULTIMATE.start_main_~data~0#1.base|) 0))))) (= (select |ULTIMATE.start_main_old_#valid#1| 0) 0) (exists ((|v_#length_52| (Array Int Int))) (= (store |v_#length_52| |ULTIMATE.start_create_~sll~0#1.base| 16) |v_old(#length)_AFTER_CALL_8|)) (<= (+ |ULTIMATE.start_main_~data~0#1.base| 1) |#StackHeapBarrier|) (not (= |ULTIMATE.start_main_~data~0#1.base| 0)) (exists ((|v_#memory_int_40| (Array Int (Array Int Int)))) (= |v_#memory_int_41| (store |v_#memory_int_40| |ULTIMATE.start_create_~sll~0#1.base| (store (select |v_#memory_int_40| |ULTIMATE.start_create_~sll~0#1.base|) 8 (select (select |v_#memory_int_41| |ULTIMATE.start_create_~sll~0#1.base|) 8))))) (exists ((|v_#memory_$Pointer$.base_47| (Array Int (Array Int Int)))) (= (store |v_#memory_$Pointer$.base_47| |ULTIMATE.start_create_~sll~0#1.base| (store (select |v_#memory_$Pointer$.base_47| |ULTIMATE.start_create_~sll~0#1.base|) 8 0)) |v_#memory_$Pointer$.base_48|))) (and (exists ((|v_#valid_62| (Array Int Int))) (and (= (select |v_#valid_62| |ULTIMATE.start_create_~sll~0#1.base|) 0) (= (store |v_#valid_62| |ULTIMATE.start_create_~sll~0#1.base| 1) |v_old(#valid)_AFTER_CALL_8|))) (= 0 (select |ULTIMATE.start_main_old_#valid#1| |ULTIMATE.start_main_~data~0#1.base|)) (exists ((|v_old(#memory_$Pointer$.base)_AFTER_CALL_5| (Array Int (Array Int Int))) (|v_#memory_$Pointer$.base_46| (Array Int (Array Int Int)))) (= |v_old(#memory_$Pointer$.base)_AFTER_CALL_5| (store |v_#memory_$Pointer$.base_46| |ULTIMATE.start_main_~data~0#1.base| (store (select |v_#memory_$Pointer$.base_46| |ULTIMATE.start_main_~data~0#1.base|) 0 (select (select |v_old(#memory_$Pointer$.base)_AFTER_CALL_5| |ULTIMATE.start_main_~data~0#1.base|) 0))))) (not (= |ULTIMATE.start_create_~sll~0#1.base| 0)) (exists ((|v_#memory_$Pointer$.offset_47| (Array Int (Array Int Int)))) (= (store |v_#memory_$Pointer$.offset_47| |ULTIMATE.start_create_~sll~0#1.base| (store (select |v_#memory_$Pointer$.offset_47| |ULTIMATE.start_create_~sll~0#1.base|) 8 0)) |v_#memory_$Pointer$.offset_48|)) (= |ULTIMATE.start_create_#in~data#1.base| |ULTIMATE.start_create_~data#1.base|) (= |ULTIMATE.start_main_~data~0#1.base| |ULTIMATE.start_create_#in~data#1.base|) (exists ((|v_old(#memory_int)_AFTER_CALL_5| (Array Int (Array Int Int))) (|v_#memory_int_39| (Array Int (Array Int Int)))) (and (= (store |v_#memory_int_39| |ULTIMATE.start_main_~data~0#1.base| (store (select |v_#memory_int_39| |ULTIMATE.start_main_~data~0#1.base|) 0 (select (select |v_old(#memory_int)_AFTER_CALL_5| |ULTIMATE.start_main_~data~0#1.base|) 0))) |v_old(#memory_int)_AFTER_CALL_5|) (<= (select (select |v_old(#memory_int)_AFTER_CALL_5| |ULTIMATE.start_main_~data~0#1.base|) 0) 2147483647) (<= 0 (+ (select (select |v_old(#memory_int)_AFTER_CALL_5| |ULTIMATE.start_main_~data~0#1.base|) 0) 2147483648)))) (exists ((|v_#memory_$Pointer$.offset_46| (Array Int (Array Int Int))) (|v_old(#memory_$Pointer$.offset)_AFTER_CALL_5| (Array Int (Array Int Int)))) (= |v_old(#memory_$Pointer$.offset)_AFTER_CALL_5| (store |v_#memory_$Pointer$.offset_46| |ULTIMATE.start_main_~data~0#1.base| (store (select |v_#memory_$Pointer$.offset_46| |ULTIMATE.start_main_~data~0#1.base|) 0 (select (select |v_old(#memory_$Pointer$.offset)_AFTER_CALL_5| |ULTIMATE.start_main_~data~0#1.base|) 0))))) (<= (+ |ULTIMATE.start_create_~sll~0#1.base| 1) |#StackHeapBarrier|) (= (select |ULTIMATE.start_main_old_#valid#1| 0) 0) (exists ((|v_#length_52| (Array Int Int))) (= (store |v_#length_52| |ULTIMATE.start_create_~sll~0#1.base| 16) |v_old(#length)_AFTER_CALL_8|)) (<= (+ |ULTIMATE.start_main_~data~0#1.base| 1) |#StackHeapBarrier|) (not (= |ULTIMATE.start_main_~data~0#1.base| 0)) (exists ((|v_#memory_int_40| (Array Int (Array Int Int)))) (= |v_#memory_int_41| (store |v_#memory_int_40| |ULTIMATE.start_create_~sll~0#1.base| (store (select |v_#memory_int_40| |ULTIMATE.start_create_~sll~0#1.base|) 8 (select (select |v_#memory_int_41| |ULTIMATE.start_create_~sll~0#1.base|) 8))))) (exists ((|v_#memory_$Pointer$.base_47| (Array Int (Array Int Int)))) (= (store |v_#memory_$Pointer$.base_47| |ULTIMATE.start_create_~sll~0#1.base| (store (select |v_#memory_$Pointer$.base_47| |ULTIMATE.start_create_~sll~0#1.base|) 8 0)) |v_#memory_$Pointer$.base_48|)))))) (exists ((|v_#memory_int_40| (Array Int (Array Int Int)))) (= |#memory_int| (store |v_#memory_int_40| |ULTIMATE.start_create_#t~ret6#1.base| (store (select |v_#memory_int_40| |ULTIMATE.start_create_#t~ret6#1.base|) 8 (select (select |#memory_int| |ULTIMATE.start_create_#t~ret6#1.base|) 8))))) (= |ULTIMATE.start_create_~sll~0#1.base| |ULTIMATE.start_create_~now~0#1.base|) (exists ((|v_#memory_$Pointer$.base_47| (Array Int (Array Int Int)))) (= (store |v_#memory_$Pointer$.base_47| |ULTIMATE.start_create_#t~ret6#1.base| (store (select |v_#memory_$Pointer$.base_47| |ULTIMATE.start_create_#t~ret6#1.base|) 8 0)) |#memory_$Pointer$.base|)) (not (= |ULTIMATE.start_create_#t~ret6#1.base| 0)) (exists ((|v_#length_52| (Array Int Int))) (= (store |v_#length_52| |ULTIMATE.start_create_#t~ret6#1.base| 16) |#length|)) (<= (+ |ULTIMATE.start_create_#t~ret6#1.base| 1) |#StackHeapBarrier|) (exists ((|v_#memory_$Pointer$.offset_47| (Array Int (Array Int Int)))) (= |#memory_$Pointer$.offset| (store |v_#memory_$Pointer$.offset_47| |ULTIMATE.start_create_#t~ret6#1.base| (store (select |v_#memory_$Pointer$.offset_47| |ULTIMATE.start_create_#t~ret6#1.base|) 8 0)))) (exists ((|v_ULTIMATE.start_create_#t~nondet5#1_12| Int)) (and (<= 0 (+ |v_ULTIMATE.start_create_#t~nondet5#1_12| 2147483648)) (not (= |v_ULTIMATE.start_create_#t~nondet5#1_12| 0)) (<= |v_ULTIMATE.start_create_#t~nondet5#1_12| 2147483647)))) (and (exists ((|v_#valid_62| (Array Int Int))) (and (= (select |v_#valid_62| |ULTIMATE.start_create_#t~ret6#1.base|) 0) (= (store |v_#valid_62| |ULTIMATE.start_create_#t~ret6#1.base| 1) |#valid|))) (exists ((|v_#memory_int_40| (Array Int (Array Int Int)))) (= |#memory_int| (store |v_#memory_int_40| |ULTIMATE.start_create_#t~ret6#1.base| (store (select |v_#memory_int_40| |ULTIMATE.start_create_#t~ret6#1.base|) 8 (select (select |#memory_int| |ULTIMATE.start_create_#t~ret6#1.base|) 8))))) (= |ULTIMATE.start_create_~sll~0#1.base| |ULTIMATE.start_create_~now~0#1.base|) (exists ((|v_#memory_$Pointer$.base_47| (Array Int (Array Int Int)))) (= (store |v_#memory_$Pointer$.base_47| |ULTIMATE.start_create_#t~ret6#1.base| (store (select |v_#memory_$Pointer$.base_47| |ULTIMATE.start_create_#t~ret6#1.base|) 8 0)) |#memory_$Pointer$.base|)) (not (= |ULTIMATE.start_create_#t~ret6#1.base| 0)) (exists ((|v_old(#length)_AFTER_CALL_7| (Array Int Int)) (|v_#memory_int_41| (Array Int (Array Int Int))) (|v_#memory_$Pointer$.offset_48| (Array Int (Array Int Int))) (|v_old(#memory_int)_AFTER_CALL_7| (Array Int (Array Int Int))) (|v_old(#valid)_AFTER_CALL_7| (Array Int Int)) (|v_#memory_$Pointer$.base_48| (Array Int (Array Int Int)))) (and (or (and (= 0 (select |ULTIMATE.start_main_old_#valid#1| |ULTIMATE.start_main_~data~0#1.base|)) (exists ((|v_#length_52| (Array Int Int))) (= (store |v_#length_52| |ULTIMATE.start_create_~sll~0#1.base| 16) |v_old(#length)_AFTER_CALL_7|)) (not (= |ULTIMATE.start_create_~sll~0#1.base| 0)) (exists ((|v_old(#memory_int)_AFTER_CALL_6| (Array Int (Array Int Int))) (|v_#memory_int_39| (Array Int (Array Int Int)))) (and (= |v_old(#memory_int)_AFTER_CALL_6| (store |v_#memory_int_39| |ULTIMATE.start_main_~data~0#1.base| (store (select |v_#memory_int_39| |ULTIMATE.start_main_~data~0#1.base|) 0 (select (select |v_old(#memory_int)_AFTER_CALL_6| |ULTIMATE.start_main_~data~0#1.base|) 0)))) (<= (select (select |v_old(#memory_int)_AFTER_CALL_6| |ULTIMATE.start_main_~data~0#1.base|) 0) 2147483647) (<= 0 (+ (select (select |v_old(#memory_int)_AFTER_CALL_6| |ULTIMATE.start_main_~data~0#1.base|) 0) 2147483648)))) (exists ((|v_#memory_$Pointer$.offset_47| (Array Int (Array Int Int)))) (= (store |v_#memory_$Pointer$.offset_47| |ULTIMATE.start_create_~sll~0#1.base| (store (select |v_#memory_$Pointer$.offset_47| |ULTIMATE.start_create_~sll~0#1.base|) 8 0)) |v_#memory_$Pointer$.offset_48|)) (= |ULTIMATE.start_create_#in~data#1.base| |ULTIMATE.start_create_~data#1.base|) (= |ULTIMATE.start_main_~data~0#1.base| |ULTIMATE.start_create_#in~data#1.base|) (exists ((|v_old(#memory_$Pointer$.base)_AFTER_CALL_6| (Array Int (Array Int Int))) (|v_#memory_$Pointer$.base_46| (Array Int (Array Int Int)))) (= |v_old(#memory_$Pointer$.base)_AFTER_CALL_6| (store |v_#memory_$Pointer$.base_46| |ULTIMATE.start_main_~data~0#1.base| (store (select |v_#memory_$Pointer$.base_46| |ULTIMATE.start_main_~data~0#1.base|) 0 (select (select |v_old(#memory_$Pointer$.base)_AFTER_CALL_6| |ULTIMATE.start_main_~data~0#1.base|) 0))))) (<= (+ |ULTIMATE.start_create_~sll~0#1.base| 1) |#StackHeapBarrier|) (exists ((|v_#valid_62| (Array Int Int))) (and (= (select |v_#valid_62| |ULTIMATE.start_create_~sll~0#1.base|) 0) (= (store |v_#valid_62| |ULTIMATE.start_create_~sll~0#1.base| 1) |v_old(#valid)_AFTER_CALL_7|))) (exists ((|v_#memory_$Pointer$.offset_46| (Array Int (Array Int Int))) (|v_old(#memory_$Pointer$.offset)_AFTER_CALL_6| (Array Int (Array Int Int)))) (= |v_old(#memory_$Pointer$.offset)_AFTER_CALL_6| (store |v_#memory_$Pointer$.offset_46| |ULTIMATE.start_main_~data~0#1.base| (store (select |v_#memory_$Pointer$.offset_46| |ULTIMATE.start_main_~data~0#1.base|) 0 (select (select |v_old(#memory_$Pointer$.offset)_AFTER_CALL_6| |ULTIMATE.start_main_~data~0#1.base|) 0))))) (= (select |ULTIMATE.start_main_old_#valid#1| 0) 0) (<= (+ |ULTIMATE.start_main_~data~0#1.base| 1) |#StackHeapBarrier|) (not (= |ULTIMATE.start_main_~data~0#1.base| 0)) (exists ((|v_#memory_int_40| (Array Int (Array Int Int)))) (= |v_#memory_int_41| (store |v_#memory_int_40| |ULTIMATE.start_create_~sll~0#1.base| (store (select |v_#memory_int_40| |ULTIMATE.start_create_~sll~0#1.base|) 8 (select (select |v_#memory_int_41| |ULTIMATE.start_create_~sll~0#1.base|) 8))))) (exists ((|v_#memory_$Pointer$.base_47| (Array Int (Array Int Int)))) (= (store |v_#memory_$Pointer$.base_47| |ULTIMATE.start_create_~sll~0#1.base| (store (select |v_#memory_$Pointer$.base_47| |ULTIMATE.start_create_~sll~0#1.base|) 8 0)) |v_#memory_$Pointer$.base_48|))) (and (= 0 (select |ULTIMATE.start_main_old_#valid#1| |ULTIMATE.start_main_~data~0#1.base|)) (exists ((|v_#length_52| (Array Int Int))) (= (store |v_#length_52| |ULTIMATE.start_create_~sll~0#1.base| 16) |v_old(#length)_AFTER_CALL_7|)) (exists ((|v_old(#memory_$Pointer$.base)_AFTER_CALL_5| (Array Int (Array Int Int))) (|v_#memory_$Pointer$.base_46| (Array Int (Array Int Int)))) (= |v_old(#memory_$Pointer$.base)_AFTER_CALL_5| (store |v_#memory_$Pointer$.base_46| |ULTIMATE.start_main_~data~0#1.base| (store (select |v_#memory_$Pointer$.base_46| |ULTIMATE.start_main_~data~0#1.base|) 0 (select (select |v_old(#memory_$Pointer$.base)_AFTER_CALL_5| |ULTIMATE.start_main_~data~0#1.base|) 0))))) (not (= |ULTIMATE.start_create_~sll~0#1.base| 0)) (exists ((|v_#memory_$Pointer$.offset_47| (Array Int (Array Int Int)))) (= (store |v_#memory_$Pointer$.offset_47| |ULTIMATE.start_create_~sll~0#1.base| (store (select |v_#memory_$Pointer$.offset_47| |ULTIMATE.start_create_~sll~0#1.base|) 8 0)) |v_#memory_$Pointer$.offset_48|)) (= |ULTIMATE.start_create_#in~data#1.base| |ULTIMATE.start_create_~data#1.base|) (= |ULTIMATE.start_main_~data~0#1.base| |ULTIMATE.start_create_#in~data#1.base|) (exists ((|v_old(#memory_int)_AFTER_CALL_5| (Array Int (Array Int Int))) (|v_#memory_int_39| (Array Int (Array Int Int)))) (and (= (store |v_#memory_int_39| |ULTIMATE.start_main_~data~0#1.base| (store (select |v_#memory_int_39| |ULTIMATE.start_main_~data~0#1.base|) 0 (select (select |v_old(#memory_int)_AFTER_CALL_5| |ULTIMATE.start_main_~data~0#1.base|) 0))) |v_old(#memory_int)_AFTER_CALL_5|) (<= (select (select |v_old(#memory_int)_AFTER_CALL_5| |ULTIMATE.start_main_~data~0#1.base|) 0) 2147483647) (<= 0 (+ (select (select |v_old(#memory_int)_AFTER_CALL_5| |ULTIMATE.start_main_~data~0#1.base|) 0) 2147483648)))) (exists ((|v_#memory_$Pointer$.offset_46| (Array Int (Array Int Int))) (|v_old(#memory_$Pointer$.offset)_AFTER_CALL_5| (Array Int (Array Int Int)))) (= |v_old(#memory_$Pointer$.offset)_AFTER_CALL_5| (store |v_#memory_$Pointer$.offset_46| |ULTIMATE.start_main_~data~0#1.base| (store (select |v_#memory_$Pointer$.offset_46| |ULTIMATE.start_main_~data~0#1.base|) 0 (select (select |v_old(#memory_$Pointer$.offset)_AFTER_CALL_5| |ULTIMATE.start_main_~data~0#1.base|) 0))))) (<= (+ |ULTIMATE.start_create_~sll~0#1.base| 1) |#StackHeapBarrier|) (exists ((|v_#valid_62| (Array Int Int))) (and (= (select |v_#valid_62| |ULTIMATE.start_create_~sll~0#1.base|) 0) (= (store |v_#valid_62| |ULTIMATE.start_create_~sll~0#1.base| 1) |v_old(#valid)_AFTER_CALL_7|))) (= (select |ULTIMATE.start_main_old_#valid#1| 0) 0) (<= (+ |ULTIMATE.start_main_~data~0#1.base| 1) |#StackHeapBarrier|) (not (= |ULTIMATE.start_main_~data~0#1.base| 0)) (exists ((|v_#memory_int_40| (Array Int (Array Int Int)))) (= |v_#memory_int_41| (store |v_#memory_int_40| |ULTIMATE.start_create_~sll~0#1.base| (store (select |v_#memory_int_40| |ULTIMATE.start_create_~sll~0#1.base|) 8 (select (select |v_#memory_int_41| |ULTIMATE.start_create_~sll~0#1.base|) 8))))) (exists ((|v_#memory_$Pointer$.base_47| (Array Int (Array Int Int)))) (= (store |v_#memory_$Pointer$.base_47| |ULTIMATE.start_create_~sll~0#1.base| (store (select |v_#memory_$Pointer$.base_47| |ULTIMATE.start_create_~sll~0#1.base|) 8 0)) |v_#memory_$Pointer$.base_48|)))) (= (store |v_#memory_int_41| |ULTIMATE.start_create_~now~0#1.base| (store (select |v_#memory_int_41| |ULTIMATE.start_create_~now~0#1.base|) 0 (select (select |v_old(#memory_int)_AFTER_CALL_7| |ULTIMATE.start_create_~now~0#1.base|) 0))) |v_old(#memory_int)_AFTER_CALL_7|))) (exists ((|v_#length_52| (Array Int Int))) (= (store |v_#length_52| |ULTIMATE.start_create_#t~ret6#1.base| 16) |#length|)) (<= (+ |ULTIMATE.start_create_#t~ret6#1.base| 1) |#StackHeapBarrier|) (exists ((|v_#memory_$Pointer$.offset_47| (Array Int (Array Int Int)))) (= |#memory_$Pointer$.offset| (store |v_#memory_$Pointer$.offset_47| |ULTIMATE.start_create_#t~ret6#1.base| (store (select |v_#memory_$Pointer$.offset_47| |ULTIMATE.start_create_#t~ret6#1.base|) 8 0)))) (exists ((|v_ULTIMATE.start_create_#t~nondet5#1_12| Int)) (and (<= 0 (+ |v_ULTIMATE.start_create_#t~nondet5#1_12| 2147483648)) (not (= |v_ULTIMATE.start_create_#t~nondet5#1_12| 0)) (<= |v_ULTIMATE.start_create_#t~nondet5#1_12| 2147483647))))) (= |ULTIMATE.start_create_~now~0#1.offset| 0) (= |ULTIMATE.start_create_#t~ret6#1.offset| 0) (= |ULTIMATE.start_create_~data#1.offset| 0) (= |ULTIMATE.start_create_~sll~0#1.offset| 0))' at error location [2023-11-19 05:25:16,569 WARN L311 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: ALGORITHM_FAILED [2023-11-19 05:25:16,569 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2023-11-19 05:25:16,569 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [8, 9] total 16 [2023-11-19 05:25:16,569 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [476930967] [2023-11-19 05:25:16,570 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2023-11-19 05:25:16,570 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 17 states [2023-11-19 05:25:16,570 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2023-11-19 05:25:16,571 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 17 interpolants. [2023-11-19 05:25:16,572 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=117, Invalid=749, Unknown=8, NotChecked=56, Total=930 [2023-11-19 05:25:16,572 INFO L87 Difference]: Start difference. First operand 41 states and 46 transitions. Second operand has 17 states, 13 states have (on average 1.5384615384615385) internal successors, (20), 12 states have internal predecessors, (20), 3 states have call successors, (3), 3 states have call predecessors, (3), 4 states have return successors, (4), 4 states have call predecessors, (4), 3 states have call successors, (4) [2023-11-19 05:25:17,418 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-11-19 05:25:17,418 INFO L93 Difference]: Finished difference Result 47 states and 51 transitions. [2023-11-19 05:25:17,419 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2023-11-19 05:25:17,419 INFO L78 Accepts]: Start accepts. Automaton has has 17 states, 13 states have (on average 1.5384615384615385) internal successors, (20), 12 states have internal predecessors, (20), 3 states have call successors, (3), 3 states have call predecessors, (3), 4 states have return successors, (4), 4 states have call predecessors, (4), 3 states have call successors, (4) Word has length 15 [2023-11-19 05:25:17,420 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-11-19 05:25:17,420 INFO L225 Difference]: With dead ends: 47 [2023-11-19 05:25:17,420 INFO L226 Difference]: Without dead ends: 47 [2023-11-19 05:25:17,421 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 43 GetRequests, 11 SyntacticMatches, 0 SemanticMatches, 32 ConstructedPredicates, 1 IntricatePredicates, 0 DeprecatedPredicates, 251 ImplicationChecksByTransitivity, 39.1s TimeCoverageRelationStatistics Valid=147, Invalid=905, Unknown=8, NotChecked=62, Total=1122 [2023-11-19 05:25:17,422 INFO L413 NwaCegarLoop]: 23 mSDtfsCounter, 14 mSDsluCounter, 161 mSDsCounter, 0 mSdLazyCounter, 227 mSolverCounterSat, 7 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 14 SdHoareTripleChecker+Valid, 184 SdHoareTripleChecker+Invalid, 283 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 7 IncrementalHoareTripleChecker+Valid, 227 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 49 IncrementalHoareTripleChecker+Unchecked, 0.5s IncrementalHoareTripleChecker+Time [2023-11-19 05:25:17,423 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [14 Valid, 184 Invalid, 283 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [7 Valid, 227 Invalid, 0 Unknown, 49 Unchecked, 0.5s Time] [2023-11-19 05:25:17,423 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 47 states. [2023-11-19 05:25:17,425 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 47 to 44. [2023-11-19 05:25:17,426 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 44 states, 28 states have (on average 1.5714285714285714) internal successors, (44), 39 states have internal predecessors, (44), 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-19 05:25:17,426 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 44 states to 44 states and 50 transitions. [2023-11-19 05:25:17,427 INFO L78 Accepts]: Start accepts. Automaton has 44 states and 50 transitions. Word has length 15 [2023-11-19 05:25:17,427 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-11-19 05:25:17,427 INFO L495 AbstractCegarLoop]: Abstraction has 44 states and 50 transitions. [2023-11-19 05:25:17,427 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 17 states, 13 states have (on average 1.5384615384615385) internal successors, (20), 12 states have internal predecessors, (20), 3 states have call successors, (3), 3 states have call predecessors, (3), 4 states have return successors, (4), 4 states have call predecessors, (4), 3 states have call successors, (4) [2023-11-19 05:25:17,428 INFO L276 IsEmpty]: Start isEmpty. Operand 44 states and 50 transitions. [2023-11-19 05:25:17,428 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 17 [2023-11-19 05:25:17,428 INFO L187 NwaCegarLoop]: Found error trace [2023-11-19 05:25:17,428 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-11-19 05:25:17,455 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_602ba9ca-a736-459a-9819-f7cae6315876/bin/utaipan-verify-t7M7D8N6sZ/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Ended with exit code 0 [2023-11-19 05:25:17,644 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 3 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_602ba9ca-a736-459a-9819-f7cae6315876/bin/utaipan-verify-t7M7D8N6sZ/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable10 [2023-11-19 05:25:17,645 INFO L420 AbstractCegarLoop]: === Iteration 12 === Targeting ULTIMATE.startErr15REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [alloc_and_zeroErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, alloc_and_zeroErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 20 more)] === [2023-11-19 05:25:17,645 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-19 05:25:17,645 INFO L85 PathProgramCache]: Analyzing trace with hash 1122297416, now seen corresponding path program 1 times [2023-11-19 05:25:17,646 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2023-11-19 05:25:17,646 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [660583178] [2023-11-19 05:25:17,646 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-19 05:25:17,646 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-19 05:25:17,665 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-19 05:25:18,223 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-19 05:25:18,223 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2023-11-19 05:25:18,223 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [660583178] [2023-11-19 05:25:18,224 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [660583178] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-19 05:25:18,224 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-19 05:25:18,224 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2023-11-19 05:25:18,224 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [949194150] [2023-11-19 05:25:18,230 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-19 05:25:18,231 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2023-11-19 05:25:18,231 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2023-11-19 05:25:18,231 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2023-11-19 05:25:18,231 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=73, Unknown=0, NotChecked=0, Total=90 [2023-11-19 05:25:18,232 INFO L87 Difference]: Start difference. First operand 44 states and 50 transitions. Second operand has 10 states, 7 states have (on average 2.0) internal successors, (14), 8 states have internal predecessors, (14), 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-19 05:25:18,879 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-11-19 05:25:18,879 INFO L93 Difference]: Finished difference Result 57 states and 63 transitions. [2023-11-19 05:25:18,880 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2023-11-19 05:25:18,880 INFO L78 Accepts]: Start accepts. Automaton has has 10 states, 7 states have (on average 2.0) internal successors, (14), 8 states have internal predecessors, (14), 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 16 [2023-11-19 05:25:18,881 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-11-19 05:25:18,881 INFO L225 Difference]: With dead ends: 57 [2023-11-19 05:25:18,882 INFO L226 Difference]: Without dead ends: 57 [2023-11-19 05:25:18,882 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 11 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=25, Invalid=107, Unknown=0, NotChecked=0, Total=132 [2023-11-19 05:25:18,883 INFO L413 NwaCegarLoop]: 16 mSDtfsCounter, 21 mSDsluCounter, 80 mSDsCounter, 0 mSdLazyCounter, 231 mSolverCounterSat, 7 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 21 SdHoareTripleChecker+Valid, 96 SdHoareTripleChecker+Invalid, 238 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 7 IncrementalHoareTripleChecker+Valid, 231 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.6s IncrementalHoareTripleChecker+Time [2023-11-19 05:25:18,883 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [21 Valid, 96 Invalid, 238 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [7 Valid, 231 Invalid, 0 Unknown, 0 Unchecked, 0.6s Time] [2023-11-19 05:25:18,884 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 57 states. [2023-11-19 05:25:18,887 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 57 to 49. [2023-11-19 05:25:18,887 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 49 states, 34 states have (on average 1.5) internal successors, (51), 44 states have internal predecessors, (51), 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-19 05:25:18,888 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 49 states to 49 states and 57 transitions. [2023-11-19 05:25:18,888 INFO L78 Accepts]: Start accepts. Automaton has 49 states and 57 transitions. Word has length 16 [2023-11-19 05:25:18,888 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-11-19 05:25:18,888 INFO L495 AbstractCegarLoop]: Abstraction has 49 states and 57 transitions. [2023-11-19 05:25:18,889 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 7 states have (on average 2.0) internal successors, (14), 8 states have internal predecessors, (14), 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-19 05:25:18,889 INFO L276 IsEmpty]: Start isEmpty. Operand 49 states and 57 transitions. [2023-11-19 05:25:18,889 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 17 [2023-11-19 05:25:18,889 INFO L187 NwaCegarLoop]: Found error trace [2023-11-19 05:25:18,890 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-11-19 05:25:18,890 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable11 [2023-11-19 05:25:18,890 INFO L420 AbstractCegarLoop]: === Iteration 13 === Targeting ULTIMATE.startErr16REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [alloc_and_zeroErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, alloc_and_zeroErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 20 more)] === [2023-11-19 05:25:18,890 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-19 05:25:18,891 INFO L85 PathProgramCache]: Analyzing trace with hash 1122297417, now seen corresponding path program 1 times [2023-11-19 05:25:18,891 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2023-11-19 05:25:18,891 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1089159162] [2023-11-19 05:25:18,891 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-19 05:25:18,891 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-19 05:25:18,906 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-19 05:25:19,261 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-19 05:25:19,262 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2023-11-19 05:25:19,262 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1089159162] [2023-11-19 05:25:19,262 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1089159162] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-19 05:25:19,263 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-19 05:25:19,263 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2023-11-19 05:25:19,263 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [933454131] [2023-11-19 05:25:19,263 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-19 05:25:19,264 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2023-11-19 05:25:19,264 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2023-11-19 05:25:19,264 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2023-11-19 05:25:19,264 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=43, Unknown=0, NotChecked=0, Total=56 [2023-11-19 05:25:19,265 INFO L87 Difference]: Start difference. First operand 49 states and 57 transitions. Second operand has 8 states, 6 states have (on average 2.3333333333333335) internal successors, (14), 7 states have internal predecessors, (14), 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-19 05:25:19,792 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-11-19 05:25:19,792 INFO L93 Difference]: Finished difference Result 64 states and 71 transitions. [2023-11-19 05:25:19,793 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2023-11-19 05:25:19,793 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 6 states have (on average 2.3333333333333335) internal successors, (14), 7 states have internal predecessors, (14), 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 16 [2023-11-19 05:25:19,793 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-11-19 05:25:19,794 INFO L225 Difference]: With dead ends: 64 [2023-11-19 05:25:19,794 INFO L226 Difference]: Without dead ends: 64 [2023-11-19 05:25:19,794 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=21, Invalid=69, Unknown=0, NotChecked=0, Total=90 [2023-11-19 05:25:19,795 INFO L413 NwaCegarLoop]: 20 mSDtfsCounter, 25 mSDsluCounter, 69 mSDsCounter, 0 mSdLazyCounter, 171 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 25 SdHoareTripleChecker+Valid, 89 SdHoareTripleChecker+Invalid, 172 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 171 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2023-11-19 05:25:19,795 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [25 Valid, 89 Invalid, 172 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 171 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time] [2023-11-19 05:25:19,796 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 64 states. [2023-11-19 05:25:19,798 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 64 to 50. [2023-11-19 05:25:19,798 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 50 states, 35 states have (on average 1.457142857142857) internal successors, (51), 45 states have internal predecessors, (51), 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-19 05:25:19,799 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 50 states to 50 states and 57 transitions. [2023-11-19 05:25:19,799 INFO L78 Accepts]: Start accepts. Automaton has 50 states and 57 transitions. Word has length 16 [2023-11-19 05:25:19,799 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-11-19 05:25:19,800 INFO L495 AbstractCegarLoop]: Abstraction has 50 states and 57 transitions. [2023-11-19 05:25:19,800 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 6 states have (on average 2.3333333333333335) internal successors, (14), 7 states have internal predecessors, (14), 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-19 05:25:19,800 INFO L276 IsEmpty]: Start isEmpty. Operand 50 states and 57 transitions. [2023-11-19 05:25:19,800 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 17 [2023-11-19 05:25:19,801 INFO L187 NwaCegarLoop]: Found error trace [2023-11-19 05:25:19,801 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-11-19 05:25:19,801 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable12 [2023-11-19 05:25:19,801 INFO L420 AbstractCegarLoop]: === Iteration 14 === Targeting ULTIMATE.startErr20ASSERT_VIOLATIONMEMORY_LEAK === [alloc_and_zeroErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, alloc_and_zeroErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 20 more)] === [2023-11-19 05:25:19,801 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-19 05:25:19,802 INFO L85 PathProgramCache]: Analyzing trace with hash 1122298484, now seen corresponding path program 1 times [2023-11-19 05:25:19,802 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2023-11-19 05:25:19,802 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [766175944] [2023-11-19 05:25:19,802 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-19 05:25:19,802 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-19 05:25:19,820 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-19 05:25:20,040 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-19 05:25:20,041 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2023-11-19 05:25:20,041 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [766175944] [2023-11-19 05:25:20,041 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [766175944] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-19 05:25:20,041 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-19 05:25:20,041 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2023-11-19 05:25:20,041 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2007055942] [2023-11-19 05:25:20,042 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-19 05:25:20,042 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2023-11-19 05:25:20,042 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2023-11-19 05:25:20,043 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2023-11-19 05:25:20,043 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=43, Unknown=0, NotChecked=0, Total=56 [2023-11-19 05:25:20,043 INFO L87 Difference]: Start difference. First operand 50 states and 57 transitions. Second operand has 8 states, 7 states have (on average 2.0) internal successors, (14), 7 states have internal predecessors, (14), 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-19 05:25:20,372 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-11-19 05:25:20,372 INFO L93 Difference]: Finished difference Result 59 states and 65 transitions. [2023-11-19 05:25:20,373 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2023-11-19 05:25:20,373 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 7 states have (on average 2.0) internal successors, (14), 7 states have internal predecessors, (14), 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 16 [2023-11-19 05:25:20,373 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-11-19 05:25:20,374 INFO L225 Difference]: With dead ends: 59 [2023-11-19 05:25:20,374 INFO L226 Difference]: Without dead ends: 59 [2023-11-19 05:25:20,374 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=21, Invalid=69, Unknown=0, NotChecked=0, Total=90 [2023-11-19 05:25:20,375 INFO L413 NwaCegarLoop]: 24 mSDtfsCounter, 38 mSDsluCounter, 119 mSDsCounter, 0 mSdLazyCounter, 102 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 39 SdHoareTripleChecker+Valid, 143 SdHoareTripleChecker+Invalid, 102 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 102 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2023-11-19 05:25:20,376 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [39 Valid, 143 Invalid, 102 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 102 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2023-11-19 05:25:20,376 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 59 states. [2023-11-19 05:25:20,378 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 59 to 51. [2023-11-19 05:25:20,379 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 51 states, 36 states have (on average 1.4166666666666667) internal successors, (51), 46 states have internal predecessors, (51), 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-19 05:25:20,379 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 51 states to 51 states and 57 transitions. [2023-11-19 05:25:20,380 INFO L78 Accepts]: Start accepts. Automaton has 51 states and 57 transitions. Word has length 16 [2023-11-19 05:25:20,380 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-11-19 05:25:20,380 INFO L495 AbstractCegarLoop]: Abstraction has 51 states and 57 transitions. [2023-11-19 05:25:20,380 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 7 states have (on average 2.0) internal successors, (14), 7 states have internal predecessors, (14), 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-19 05:25:20,380 INFO L276 IsEmpty]: Start isEmpty. Operand 51 states and 57 transitions. [2023-11-19 05:25:20,381 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 18 [2023-11-19 05:25:20,381 INFO L187 NwaCegarLoop]: Found error trace [2023-11-19 05:25:20,381 INFO L195 NwaCegarLoop]: trace histogram [2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-11-19 05:25:20,381 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable13 [2023-11-19 05:25:20,382 INFO L420 AbstractCegarLoop]: === Iteration 15 === Targeting ULTIMATE.startErr8REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [alloc_and_zeroErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, alloc_and_zeroErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 20 more)] === [2023-11-19 05:25:20,382 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-19 05:25:20,382 INFO L85 PathProgramCache]: Analyzing trace with hash -1054190228, now seen corresponding path program 1 times [2023-11-19 05:25:20,382 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2023-11-19 05:25:20,383 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2025265031] [2023-11-19 05:25:20,383 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-19 05:25:20,383 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-19 05:25:20,401 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-19 05:25:20,569 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 1 proven. 0 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2023-11-19 05:25:20,569 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2023-11-19 05:25:20,570 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2025265031] [2023-11-19 05:25:20,570 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2025265031] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-19 05:25:20,570 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-19 05:25:20,570 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2023-11-19 05:25:20,570 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [331526274] [2023-11-19 05:25:20,570 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-19 05:25:20,571 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2023-11-19 05:25:20,571 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2023-11-19 05:25:20,571 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2023-11-19 05:25:20,571 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2023-11-19 05:25:20,572 INFO L87 Difference]: Start difference. First operand 51 states and 57 transitions. Second operand has 6 states, 4 states have (on average 3.0) internal successors, (12), 5 states have internal predecessors, (12), 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-19 05:25:20,834 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-11-19 05:25:20,834 INFO L93 Difference]: Finished difference Result 50 states and 55 transitions. [2023-11-19 05:25:20,834 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2023-11-19 05:25:20,835 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 4 states have (on average 3.0) internal successors, (12), 5 states have internal predecessors, (12), 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 17 [2023-11-19 05:25:20,835 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-11-19 05:25:20,835 INFO L225 Difference]: With dead ends: 50 [2023-11-19 05:25:20,835 INFO L226 Difference]: Without dead ends: 50 [2023-11-19 05:25:20,836 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=13, Invalid=29, Unknown=0, NotChecked=0, Total=42 [2023-11-19 05:25:20,836 INFO L413 NwaCegarLoop]: 24 mSDtfsCounter, 6 mSDsluCounter, 60 mSDsCounter, 0 mSdLazyCounter, 91 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 6 SdHoareTripleChecker+Valid, 84 SdHoareTripleChecker+Invalid, 91 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 91 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2023-11-19 05:25:20,837 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [6 Valid, 84 Invalid, 91 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 91 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2023-11-19 05:25:20,837 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 50 states. [2023-11-19 05:25:20,839 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 50 to 50. [2023-11-19 05:25:20,839 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 50 states, 36 states have (on average 1.3611111111111112) internal successors, (49), 45 states have internal predecessors, (49), 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-19 05:25:20,839 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 50 states to 50 states and 55 transitions. [2023-11-19 05:25:20,839 INFO L78 Accepts]: Start accepts. Automaton has 50 states and 55 transitions. Word has length 17 [2023-11-19 05:25:20,840 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-11-19 05:25:20,840 INFO L495 AbstractCegarLoop]: Abstraction has 50 states and 55 transitions. [2023-11-19 05:25:20,840 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 4 states have (on average 3.0) internal successors, (12), 5 states have internal predecessors, (12), 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-19 05:25:20,840 INFO L276 IsEmpty]: Start isEmpty. Operand 50 states and 55 transitions. [2023-11-19 05:25:20,841 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 18 [2023-11-19 05:25:20,841 INFO L187 NwaCegarLoop]: Found error trace [2023-11-19 05:25:20,841 INFO L195 NwaCegarLoop]: trace histogram [2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-11-19 05:25:20,841 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable14 [2023-11-19 05:25:20,841 INFO L420 AbstractCegarLoop]: === Iteration 16 === Targeting ULTIMATE.startErr9REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [alloc_and_zeroErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, alloc_and_zeroErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 20 more)] === [2023-11-19 05:25:20,841 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-19 05:25:20,842 INFO L85 PathProgramCache]: Analyzing trace with hash -1054190227, now seen corresponding path program 1 times [2023-11-19 05:25:20,842 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2023-11-19 05:25:20,842 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [999447044] [2023-11-19 05:25:20,842 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-19 05:25:20,842 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-19 05:25:20,860 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-19 05:25:21,197 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 2 proven. 0 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2023-11-19 05:25:21,197 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2023-11-19 05:25:21,197 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [999447044] [2023-11-19 05:25:21,197 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [999447044] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-19 05:25:21,197 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-19 05:25:21,197 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2023-11-19 05:25:21,198 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1451000804] [2023-11-19 05:25:21,198 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-19 05:25:21,198 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2023-11-19 05:25:21,198 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2023-11-19 05:25:21,199 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2023-11-19 05:25:21,199 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2023-11-19 05:25:21,199 INFO L87 Difference]: Start difference. First operand 50 states and 55 transitions. Second operand has 7 states, 5 states have (on average 2.6) internal successors, (13), 6 states have internal predecessors, (13), 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-19 05:25:21,505 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-11-19 05:25:21,505 INFO L93 Difference]: Finished difference Result 49 states and 53 transitions. [2023-11-19 05:25:21,505 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2023-11-19 05:25:21,506 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 5 states have (on average 2.6) internal successors, (13), 6 states have internal predecessors, (13), 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 17 [2023-11-19 05:25:21,506 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-11-19 05:25:21,506 INFO L225 Difference]: With dead ends: 49 [2023-11-19 05:25:21,507 INFO L226 Difference]: Without dead ends: 49 [2023-11-19 05:25:21,507 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=19, Invalid=53, Unknown=0, NotChecked=0, Total=72 [2023-11-19 05:25:21,508 INFO L413 NwaCegarLoop]: 24 mSDtfsCounter, 5 mSDsluCounter, 87 mSDsCounter, 0 mSdLazyCounter, 95 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 5 SdHoareTripleChecker+Valid, 111 SdHoareTripleChecker+Invalid, 95 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 95 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2023-11-19 05:25:21,508 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [5 Valid, 111 Invalid, 95 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 95 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2023-11-19 05:25:21,509 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 49 states. [2023-11-19 05:25:21,510 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 49 to 49. [2023-11-19 05:25:21,511 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 49 states, 36 states have (on average 1.3055555555555556) internal successors, (47), 44 states have internal predecessors, (47), 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-19 05:25:21,511 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 49 states to 49 states and 53 transitions. [2023-11-19 05:25:21,512 INFO L78 Accepts]: Start accepts. Automaton has 49 states and 53 transitions. Word has length 17 [2023-11-19 05:25:21,512 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-11-19 05:25:21,512 INFO L495 AbstractCegarLoop]: Abstraction has 49 states and 53 transitions. [2023-11-19 05:25:21,512 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 5 states have (on average 2.6) internal successors, (13), 6 states have internal predecessors, (13), 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-19 05:25:21,513 INFO L276 IsEmpty]: Start isEmpty. Operand 49 states and 53 transitions. [2023-11-19 05:25:21,513 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 19 [2023-11-19 05:25:21,513 INFO L187 NwaCegarLoop]: Found error trace [2023-11-19 05:25:21,514 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-11-19 05:25:21,514 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable15 [2023-11-19 05:25:21,514 INFO L420 AbstractCegarLoop]: === Iteration 17 === Targeting ULTIMATE.startErr18ASSERT_VIOLATIONMEMORY_FREE === [alloc_and_zeroErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, alloc_and_zeroErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 20 more)] === [2023-11-19 05:25:21,514 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-19 05:25:21,515 INFO L85 PathProgramCache]: Analyzing trace with hash 491052707, now seen corresponding path program 1 times [2023-11-19 05:25:21,515 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2023-11-19 05:25:21,515 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1581879587] [2023-11-19 05:25:21,515 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-19 05:25:21,515 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-19 05:25:21,530 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-19 05:25:21,744 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-19 05:25:21,744 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2023-11-19 05:25:21,744 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1581879587] [2023-11-19 05:25:21,744 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1581879587] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-19 05:25:21,744 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-19 05:25:21,744 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2023-11-19 05:25:21,745 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [620091422] [2023-11-19 05:25:21,745 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-19 05:25:21,745 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2023-11-19 05:25:21,745 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2023-11-19 05:25:21,746 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2023-11-19 05:25:21,746 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=43, Unknown=0, NotChecked=0, Total=56 [2023-11-19 05:25:21,746 INFO L87 Difference]: Start difference. First operand 49 states and 53 transitions. Second operand has 8 states, 6 states have (on average 2.6666666666666665) internal successors, (16), 7 states have internal predecessors, (16), 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-19 05:25:22,075 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-11-19 05:25:22,076 INFO L93 Difference]: Finished difference Result 55 states and 59 transitions. [2023-11-19 05:25:22,076 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2023-11-19 05:25:22,076 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 6 states have (on average 2.6666666666666665) internal successors, (16), 7 states have internal predecessors, (16), 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 18 [2023-11-19 05:25:22,076 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-11-19 05:25:22,077 INFO L225 Difference]: With dead ends: 55 [2023-11-19 05:25:22,077 INFO L226 Difference]: Without dead ends: 55 [2023-11-19 05:25:22,077 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=21, Invalid=69, Unknown=0, NotChecked=0, Total=90 [2023-11-19 05:25:22,078 INFO L413 NwaCegarLoop]: 20 mSDtfsCounter, 30 mSDsluCounter, 83 mSDsCounter, 0 mSdLazyCounter, 129 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 31 SdHoareTripleChecker+Valid, 103 SdHoareTripleChecker+Invalid, 130 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 129 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2023-11-19 05:25:22,078 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [31 Valid, 103 Invalid, 130 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 129 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2023-11-19 05:25:22,079 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 55 states. [2023-11-19 05:25:22,080 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 55 to 52. [2023-11-19 05:25:22,080 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 52 states, 39 states have (on average 1.358974358974359) internal successors, (53), 47 states have internal predecessors, (53), 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-19 05:25:22,081 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 52 states to 52 states and 59 transitions. [2023-11-19 05:25:22,081 INFO L78 Accepts]: Start accepts. Automaton has 52 states and 59 transitions. Word has length 18 [2023-11-19 05:25:22,081 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-11-19 05:25:22,082 INFO L495 AbstractCegarLoop]: Abstraction has 52 states and 59 transitions. [2023-11-19 05:25:22,082 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 6 states have (on average 2.6666666666666665) internal successors, (16), 7 states have internal predecessors, (16), 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-19 05:25:22,082 INFO L276 IsEmpty]: Start isEmpty. Operand 52 states and 59 transitions. [2023-11-19 05:25:22,083 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 22 [2023-11-19 05:25:22,083 INFO L187 NwaCegarLoop]: Found error trace [2023-11-19 05:25:22,083 INFO L195 NwaCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-11-19 05:25:22,083 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable16 [2023-11-19 05:25:22,083 INFO L420 AbstractCegarLoop]: === Iteration 18 === Targeting ULTIMATE.startErr15REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [alloc_and_zeroErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, alloc_and_zeroErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 20 more)] === [2023-11-19 05:25:22,084 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-19 05:25:22,084 INFO L85 PathProgramCache]: Analyzing trace with hash 292687016, now seen corresponding path program 1 times [2023-11-19 05:25:22,084 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2023-11-19 05:25:22,084 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1628332560] [2023-11-19 05:25:22,084 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-19 05:25:22,085 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-19 05:25:22,101 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-19 05:25:22,956 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 1 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-11-19 05:25:22,956 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2023-11-19 05:25:22,956 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1628332560] [2023-11-19 05:25:22,956 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1628332560] provided 0 perfect and 1 imperfect interpolant sequences [2023-11-19 05:25:22,956 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1644892717] [2023-11-19 05:25:22,956 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-19 05:25:22,957 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-11-19 05:25:22,957 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_602ba9ca-a736-459a-9819-f7cae6315876/bin/utaipan-verify-t7M7D8N6sZ/z3 [2023-11-19 05:25:22,961 INFO L229 MonitoredProcess]: Starting monitored process 4 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_602ba9ca-a736-459a-9819-f7cae6315876/bin/utaipan-verify-t7M7D8N6sZ/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2023-11-19 05:25:22,971 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_602ba9ca-a736-459a-9819-f7cae6315876/bin/utaipan-verify-t7M7D8N6sZ/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Waiting until timeout for monitored process [2023-11-19 05:25:23,075 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-19 05:25:23,077 INFO L262 TraceCheckSpWp]: Trace formula consists of 164 conjuncts, 43 conjunts are in the unsatisfiable core [2023-11-19 05:25:23,080 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-11-19 05:25:23,095 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 7 [2023-11-19 05:25:23,113 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 7 [2023-11-19 05:25:23,409 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-11-19 05:25:23,410 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 23 treesize of output 11 [2023-11-19 05:25:23,427 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-11-19 05:25:23,428 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 23 treesize of output 11 [2023-11-19 05:25:23,761 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-11-19 05:25:23,761 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 17 treesize of output 15 [2023-11-19 05:25:23,780 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-11-19 05:25:23,781 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 17 treesize of output 15 [2023-11-19 05:25:23,911 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 1 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-11-19 05:25:23,911 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2023-11-19 05:25:25,065 INFO L378 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 39 treesize of output 37 [2023-11-19 05:25:25,074 INFO L378 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 37 treesize of output 35 [2023-11-19 05:25:25,103 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 111 treesize of output 107 [2023-11-19 05:25:25,122 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 130 treesize of output 126 [2023-11-19 05:25:25,181 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 1 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-11-19 05:25:25,181 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1644892717] provided 0 perfect and 2 imperfect interpolant sequences [2023-11-19 05:25:25,181 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSifa [1709888030] [2023-11-19 05:25:25,185 INFO L159 IcfgInterpreter]: Started Sifa with 20 locations of interest [2023-11-19 05:25:25,185 INFO L166 IcfgInterpreter]: Building call graph [2023-11-19 05:25:25,185 INFO L171 IcfgInterpreter]: Initial procedures are [ULTIMATE.start] [2023-11-19 05:25:25,185 INFO L176 IcfgInterpreter]: Starting interpretation [2023-11-19 05:25:25,186 INFO L197 IcfgInterpreter]: Interpreting procedure ULTIMATE.start with input of size 1 for LOIs