./Ultimate.py --spec ../../sv-benchmarks/c/properties/valid-memsafety.prp --file ../../sv-benchmarks/c/memsafety-ext2/complex_data_creation_test02-2.i --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for memory safety (deref-memtrack) Using default analysis Version 826ab2ba Calling Ultimate with: /usr/bin/java -Dosgi.configuration.area=/tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_2bb9ae36-a0c5-4c2e-87da-07b477e49f29/bin/utaipan-verify-sOmjnqqW8E/data/config -Xmx15G -Xms4m -jar /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_2bb9ae36-a0c5-4c2e-87da-07b477e49f29/bin/utaipan-verify-sOmjnqqW8E/plugins/org.eclipse.equinox.launcher_1.6.800.v20240513-1750.jar -data @noDefault -ultimatedata /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_2bb9ae36-a0c5-4c2e-87da-07b477e49f29/bin/utaipan-verify-sOmjnqqW8E/data -tc /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_2bb9ae36-a0c5-4c2e-87da-07b477e49f29/bin/utaipan-verify-sOmjnqqW8E/config/TaipanMemDerefMemtrack.xml -i ../../sv-benchmarks/c/memsafety-ext2/complex_data_creation_test02-2.i -s /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_2bb9ae36-a0c5-4c2e-87da-07b477e49f29/bin/utaipan-verify-sOmjnqqW8E/config/svcomp-DerefFreeMemtrack-32bit-Taipan_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_2bb9ae36-a0c5-4c2e-87da-07b477e49f29/bin/utaipan-verify-sOmjnqqW8E --witnessprinter.witness.filename witness --witnessprinter.write.witness.besides.input.file false --witnessprinter.graph.data.specification CHECK( init(main()), LTL(G valid-free) ) CHECK( init(main()), LTL(G valid-deref) ) CHECK( init(main()), LTL(G valid-memtrack) ) --witnessprinter.graph.data.producer Taipan --witnessprinter.graph.data.architecture 32bit --witnessprinter.graph.data.programhash cb1edb9fb334d503cba549895692ff1d9d77f795ecc0798895274120b4ed179d --- Real Ultimate output --- This is Ultimate 0.3.0-dev-826ab2b [2024-11-13 23:28:04,203 INFO L188 SettingsManager]: Resetting all preferences to default values... [2024-11-13 23:28:04,315 INFO L114 SettingsManager]: Loading settings from /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_2bb9ae36-a0c5-4c2e-87da-07b477e49f29/bin/utaipan-verify-sOmjnqqW8E/config/svcomp-DerefFreeMemtrack-32bit-Taipan_Default.epf [2024-11-13 23:28:04,323 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2024-11-13 23:28:04,324 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2024-11-13 23:28:04,367 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2024-11-13 23:28:04,368 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2024-11-13 23:28:04,368 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2024-11-13 23:28:04,368 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2024-11-13 23:28:04,371 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2024-11-13 23:28:04,372 INFO L153 SettingsManager]: * User list type=DISABLED [2024-11-13 23:28:04,372 INFO L151 SettingsManager]: Preferences of Abstract Interpretation differ from their defaults: [2024-11-13 23:28:04,372 INFO L153 SettingsManager]: * Explicit value domain=true [2024-11-13 23:28:04,372 INFO L153 SettingsManager]: * Abstract domain for RCFG-of-the-future=PoormanAbstractDomain [2024-11-13 23:28:04,373 INFO L153 SettingsManager]: * Octagon Domain=false [2024-11-13 23:28:04,373 INFO L153 SettingsManager]: * Abstract domain=CompoundDomain [2024-11-13 23:28:04,373 INFO L153 SettingsManager]: * Check feasibility of abstract posts with an SMT solver=true [2024-11-13 23:28:04,373 INFO L153 SettingsManager]: * Use the RCFG-of-the-future interface=true [2024-11-13 23:28:04,373 INFO L153 SettingsManager]: * Interval Domain=false [2024-11-13 23:28:04,374 INFO L151 SettingsManager]: Preferences of Sifa differ from their defaults: [2024-11-13 23:28:04,374 INFO L153 SettingsManager]: * Call Summarizer=TopInputCallSummarizer [2024-11-13 23:28:04,374 INFO L153 SettingsManager]: * Simplification Technique=POLY_PAC [2024-11-13 23:28:04,374 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2024-11-13 23:28:04,374 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2024-11-13 23:28:04,374 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2024-11-13 23:28:04,375 INFO L153 SettingsManager]: * sizeof long=4 [2024-11-13 23:28:04,375 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2024-11-13 23:28:04,375 INFO L153 SettingsManager]: * sizeof POINTER=4 [2024-11-13 23:28:04,375 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2024-11-13 23:28:04,375 INFO L153 SettingsManager]: * Check for the main procedure if all allocated memory was freed=true [2024-11-13 23:28:04,375 INFO L153 SettingsManager]: * Bitprecise bitfields=true [2024-11-13 23:28:04,375 INFO L153 SettingsManager]: * SV-COMP memtrack compatibility mode=true [2024-11-13 23:28:04,375 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2024-11-13 23:28:04,375 INFO L153 SettingsManager]: * Adapt memory model on pointer casts if necessary=true [2024-11-13 23:28:04,376 INFO L153 SettingsManager]: * Allow undefined functions=false [2024-11-13 23:28:04,376 INFO L153 SettingsManager]: * Check unreachability of reach_error function=false [2024-11-13 23:28:04,376 INFO L153 SettingsManager]: * sizeof long double=12 [2024-11-13 23:28:04,376 INFO L153 SettingsManager]: * Use constant arrays=true [2024-11-13 23:28:04,376 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2024-11-13 23:28:04,376 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2024-11-13 23:28:04,376 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2024-11-13 23:28:04,376 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2024-11-13 23:28:04,376 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2024-11-13 23:28:04,376 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2024-11-13 23:28:04,377 INFO L153 SettingsManager]: * Trace refinement strategy=SIFA_TAIPAN [2024-11-13 23:28:04,377 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2024-11-13 23:28:04,377 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2024-11-13 23:28:04,377 INFO L153 SettingsManager]: * Trace refinement exception blacklist=NONE [2024-11-13 23:28:04,377 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2024-11-13 23:28:04,377 INFO L153 SettingsManager]: * Abstract interpretation Mode=USE_PREDICATES 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_2bb9ae36-a0c5-4c2e-87da-07b477e49f29/bin/utaipan-verify-sOmjnqqW8E Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Witness filename -> witness Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Write witness besides input file -> false Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data specification -> CHECK( init(main()), LTL(G valid-free) ) CHECK( init(main()), LTL(G valid-deref) ) CHECK( init(main()), LTL(G valid-memtrack) ) Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data producer -> Taipan Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data architecture -> 32bit Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data programhash -> cb1edb9fb334d503cba549895692ff1d9d77f795ecc0798895274120b4ed179d [2024-11-13 23:28:04,755 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2024-11-13 23:28:04,764 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2024-11-13 23:28:04,767 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2024-11-13 23:28:04,768 INFO L270 PluginConnector]: Initializing CDTParser... [2024-11-13 23:28:04,769 INFO L274 PluginConnector]: CDTParser initialized [2024-11-13 23:28:04,770 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_2bb9ae36-a0c5-4c2e-87da-07b477e49f29/bin/utaipan-verify-sOmjnqqW8E/../../sv-benchmarks/c/memsafety-ext2/complex_data_creation_test02-2.i Unable to find full path for "g++" [2024-11-13 23:28:06,822 INFO L533 CDTParser]: Created temporary CDT project at NULL [2024-11-13 23:28:07,241 INFO L384 CDTParser]: Found 1 translation units. [2024-11-13 23:28:07,242 INFO L180 CDTParser]: Scanning /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_2bb9ae36-a0c5-4c2e-87da-07b477e49f29/sv-benchmarks/c/memsafety-ext2/complex_data_creation_test02-2.i [2024-11-13 23:28:07,254 INFO L427 CDTParser]: About to delete temporary CDT project at /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_2bb9ae36-a0c5-4c2e-87da-07b477e49f29/bin/utaipan-verify-sOmjnqqW8E/data/5a40428e6/6b6a1e67a76546b59de5323d3575e5d3/FLAG405a01d1c [2024-11-13 23:28:07,402 INFO L435 CDTParser]: Successfully deleted /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_2bb9ae36-a0c5-4c2e-87da-07b477e49f29/bin/utaipan-verify-sOmjnqqW8E/data/5a40428e6/6b6a1e67a76546b59de5323d3575e5d3 [2024-11-13 23:28:07,405 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2024-11-13 23:28:07,407 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2024-11-13 23:28:07,408 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2024-11-13 23:28:07,409 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2024-11-13 23:28:07,414 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2024-11-13 23:28:07,415 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 13.11 11:28:07" (1/1) ... [2024-11-13 23:28:07,416 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@55dd74b9 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.11 11:28:07, skipping insertion in model container [2024-11-13 23:28:07,416 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 13.11 11:28:07" (1/1) ... [2024-11-13 23:28:07,443 INFO L175 MainTranslator]: Built tables and reachable declarations [2024-11-13 23:28:07,774 WARN L1072 CHandler]: saw a pointer cast to a type that we could not get a type size for, not adapting memory model [2024-11-13 23:28:07,809 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-11-13 23:28:07,821 INFO L200 MainTranslator]: Completed pre-run [2024-11-13 23:28:07,903 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-11-13 23:28:07,935 INFO L204 MainTranslator]: Completed translation [2024-11-13 23:28:07,936 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.11 11:28:07 WrapperNode [2024-11-13 23:28:07,936 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2024-11-13 23:28:07,937 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2024-11-13 23:28:07,937 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2024-11-13 23:28:07,937 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2024-11-13 23:28:07,942 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.11 11:28:07" (1/1) ... [2024-11-13 23:28:07,954 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.11 11:28:07" (1/1) ... [2024-11-13 23:28:07,986 INFO L138 Inliner]: procedures = 126, calls = 62, calls flagged for inlining = 4, calls inlined = 4, statements flattened = 102 [2024-11-13 23:28:07,987 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2024-11-13 23:28:07,987 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2024-11-13 23:28:07,987 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2024-11-13 23:28:07,987 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2024-11-13 23:28:07,996 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.11 11:28:07" (1/1) ... [2024-11-13 23:28:07,996 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.11 11:28:07" (1/1) ... [2024-11-13 23:28:08,000 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.11 11:28:07" (1/1) ... [2024-11-13 23:28:08,000 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.11 11:28:07" (1/1) ... [2024-11-13 23:28:08,011 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.11 11:28:07" (1/1) ... [2024-11-13 23:28:08,019 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.11 11:28:07" (1/1) ... [2024-11-13 23:28:08,021 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.11 11:28:07" (1/1) ... [2024-11-13 23:28:08,022 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.11 11:28:07" (1/1) ... [2024-11-13 23:28:08,025 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2024-11-13 23:28:08,026 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2024-11-13 23:28:08,027 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2024-11-13 23:28:08,027 INFO L274 PluginConnector]: RCFGBuilder initialized [2024-11-13 23:28:08,028 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.11 11:28:07" (1/1) ... [2024-11-13 23:28:08,034 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2024-11-13 23:28:08,046 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_2bb9ae36-a0c5-4c2e-87da-07b477e49f29/bin/utaipan-verify-sOmjnqqW8E/z3 [2024-11-13 23:28:08,062 INFO L229 MonitoredProcess]: Starting monitored process 1 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_2bb9ae36-a0c5-4c2e-87da-07b477e49f29/bin/utaipan-verify-sOmjnqqW8E/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (exit command is (exit), workingDir is null) [2024-11-13 23:28:08,064 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_2bb9ae36-a0c5-4c2e-87da-07b477e49f29/bin/utaipan-verify-sOmjnqqW8E/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (1)] Waiting until timeout for monitored process [2024-11-13 23:28:08,087 INFO L130 BoogieDeclarations]: Found specification of procedure read~int [2024-11-13 23:28:08,087 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2024-11-13 23:28:08,088 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnHeap [2024-11-13 23:28:08,088 INFO L130 BoogieDeclarations]: Found specification of procedure create_data [2024-11-13 23:28:08,088 INFO L138 BoogieDeclarations]: Found implementation of procedure create_data [2024-11-13 23:28:08,088 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2024-11-13 23:28:08,088 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2024-11-13 23:28:08,088 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$ [2024-11-13 23:28:08,088 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$ [2024-11-13 23:28:08,088 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2024-11-13 23:28:08,088 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~$Pointer$ [2024-11-13 23:28:08,088 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2024-11-13 23:28:08,088 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2024-11-13 23:28:08,088 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2024-11-13 23:28:08,204 INFO L238 CfgBuilder]: Building ICFG [2024-11-13 23:28:08,206 INFO L264 CfgBuilder]: Building CFG for each procedure with an implementation [2024-11-13 23:28:08,972 INFO L? ?]: Removed 203 outVars from TransFormulas that were not future-live. [2024-11-13 23:28:08,972 INFO L287 CfgBuilder]: Performing block encoding [2024-11-13 23:28:09,074 INFO L311 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2024-11-13 23:28:09,075 INFO L316 CfgBuilder]: Removed 5 assume(true) statements. [2024-11-13 23:28:09,075 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 13.11 11:28:09 BoogieIcfgContainer [2024-11-13 23:28:09,075 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2024-11-13 23:28:09,077 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2024-11-13 23:28:09,077 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2024-11-13 23:28:09,084 INFO L274 PluginConnector]: TraceAbstraction initialized [2024-11-13 23:28:09,085 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 13.11 11:28:07" (1/3) ... [2024-11-13 23:28:09,086 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@69ba0387 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 13.11 11:28:09, skipping insertion in model container [2024-11-13 23:28:09,086 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.11 11:28:07" (2/3) ... [2024-11-13 23:28:09,087 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@69ba0387 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 13.11 11:28:09, skipping insertion in model container [2024-11-13 23:28:09,087 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 13.11 11:28:09" (3/3) ... [2024-11-13 23:28:09,088 INFO L112 eAbstractionObserver]: Analyzing ICFG complex_data_creation_test02-2.i [2024-11-13 23:28:09,110 INFO L217 ceAbstractionStarter]: Automizer settings: Hoare:None NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2024-11-13 23:28:09,114 INFO L154 ceAbstractionStarter]: Applying trace abstraction to ICFG complex_data_creation_test02-2.i that has 2 procedures, 168 locations, 1 initial locations, 5 loop locations, and 92 error locations. [2024-11-13 23:28:09,171 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2024-11-13 23:28:09,189 INFO L333 AbstractCegarLoop]: Settings: SEPARATE_VIOLATION_CHECK=true, mInterprocedural=true, mMaxIterations=1000000, mWatchIteration=1000000, mArtifact=RCFG, mInterpolation=FPandBP, mInterpolantAutomaton=STRAIGHT_LINE, mDumpAutomata=false, mAutomataFormat=ATS_NUMERATE, mDumpPath=., mDeterminiation=PREDICATE_ABSTRACTION, mMinimize=MINIMIZE_SEVPA, mAutomataTypeConcurrency=FINITE_AUTOMATA, mHoareTripleChecks=INCREMENTAL, mHoareAnnotationPositions=None, mDumpOnlyReuseAutomata=false, mLimitTraceHistogram=0, mErrorLocTimeLimit=0, mLimitPathProgramCount=0, mCollectInterpolantStatistics=true, mHeuristicEmptinessCheck=false, mHeuristicEmptinessCheckAStarHeuristic=ZERO, mHeuristicEmptinessCheckAStarHeuristicRandomSeed=1337, mHeuristicEmptinessCheckSmtFeatureScoringMethod=DAGSIZE, mSMTFeatureExtraction=false, mSMTFeatureExtractionDumpPath=., mOverrideInterpolantAutomaton=false, mMcrInterpolantMethod=WP, mPorIndependenceSettings=[Lde.uni_freiburg.informatik.ultimate.lib.tracecheckerutils.partialorder.independence.IndependenceSettings;@50c1cd6, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2024-11-13 23:28:09,189 INFO L334 AbstractCegarLoop]: Starting to check reachability of 92 error locations. [2024-11-13 23:28:09,195 INFO L276 IsEmpty]: Start isEmpty. Operand has 168 states, 72 states have (on average 2.486111111111111) internal successors, (179), 164 states have internal predecessors, (179), 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) [2024-11-13 23:28:09,203 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 4 [2024-11-13 23:28:09,203 INFO L207 NwaCegarLoop]: Found error trace [2024-11-13 23:28:09,204 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1] [2024-11-13 23:28:09,204 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr26REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [create_dataErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, create_dataErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, create_dataErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 89 more)] === [2024-11-13 23:28:09,210 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-13 23:28:09,211 INFO L85 PathProgramCache]: Analyzing trace with hash 325873, now seen corresponding path program 1 times [2024-11-13 23:28:09,219 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2024-11-13 23:28:09,220 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [60217566] [2024-11-13 23:28:09,221 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-13 23:28:09,221 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-13 23:28:09,339 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 23:28:09,389 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-13 23:28:09,390 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2024-11-13 23:28:09,390 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [60217566] [2024-11-13 23:28:09,391 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [60217566] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-13 23:28:09,391 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-13 23:28:09,391 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-11-13 23:28:09,395 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1689157400] [2024-11-13 23:28:09,396 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-13 23:28:09,400 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2024-11-13 23:28:09,400 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2024-11-13 23:28:09,427 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2024-11-13 23:28:09,428 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2024-11-13 23:28:09,432 INFO L87 Difference]: Start difference. First operand has 168 states, 72 states have (on average 2.486111111111111) internal successors, (179), 164 states have internal predecessors, (179), 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 2 states, 2 states have (on average 1.5) internal successors, (3), 2 states have internal predecessors, (3), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-13 23:28:09,554 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-13 23:28:09,554 INFO L93 Difference]: Finished difference Result 168 states and 179 transitions. [2024-11-13 23:28:09,557 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2024-11-13 23:28:09,558 INFO L78 Accepts]: Start accepts. Automaton has has 2 states, 2 states have (on average 1.5) internal successors, (3), 2 states have internal predecessors, (3), 0 states have call successors, (0), 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 3 [2024-11-13 23:28:09,558 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-13 23:28:09,569 INFO L225 Difference]: With dead ends: 168 [2024-11-13 23:28:09,569 INFO L226 Difference]: Without dead ends: 167 [2024-11-13 23:28:09,571 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 0 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2024-11-13 23:28:09,576 INFO L432 NwaCegarLoop]: 153 mSDtfsCounter, 0 mSDsluCounter, 0 mSDsCounter, 0 mSdLazyCounter, 26 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 153 SdHoareTripleChecker+Invalid, 26 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 26 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-11-13 23:28:09,577 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 153 Invalid, 26 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 26 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-11-13 23:28:09,588 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 167 states. [2024-11-13 23:28:09,608 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 167 to 167. [2024-11-13 23:28:09,610 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 167 states, 72 states have (on average 2.4166666666666665) internal successors, (174), 163 states have internal predecessors, (174), 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) [2024-11-13 23:28:09,620 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 167 states to 167 states and 178 transitions. [2024-11-13 23:28:09,622 INFO L78 Accepts]: Start accepts. Automaton has 167 states and 178 transitions. Word has length 3 [2024-11-13 23:28:09,622 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-13 23:28:09,623 INFO L471 AbstractCegarLoop]: Abstraction has 167 states and 178 transitions. [2024-11-13 23:28:09,623 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 2 states, 2 states have (on average 1.5) internal successors, (3), 2 states have internal predecessors, (3), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-13 23:28:09,623 INFO L276 IsEmpty]: Start isEmpty. Operand 167 states and 178 transitions. [2024-11-13 23:28:09,623 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 4 [2024-11-13 23:28:09,624 INFO L207 NwaCegarLoop]: Found error trace [2024-11-13 23:28:09,624 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1] [2024-11-13 23:28:09,625 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2024-11-13 23:28:09,626 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [create_dataErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, create_dataErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, create_dataErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 89 more)] === [2024-11-13 23:28:09,626 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-13 23:28:09,626 INFO L85 PathProgramCache]: Analyzing trace with hash 323502, now seen corresponding path program 1 times [2024-11-13 23:28:09,626 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2024-11-13 23:28:09,626 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1571605716] [2024-11-13 23:28:09,626 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-13 23:28:09,627 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-13 23:28:09,658 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 23:28:09,845 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-13 23:28:09,845 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2024-11-13 23:28:09,845 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1571605716] [2024-11-13 23:28:09,845 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1571605716] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-13 23:28:09,845 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-13 23:28:09,846 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-11-13 23:28:09,846 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1962988331] [2024-11-13 23:28:09,846 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-13 23:28:09,847 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-11-13 23:28:09,848 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2024-11-13 23:28:09,848 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-11-13 23:28:09,848 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-11-13 23:28:09,849 INFO L87 Difference]: Start difference. First operand 167 states and 178 transitions. Second operand has 4 states, 3 states have (on average 1.0) internal successors, (3), 3 states have internal predecessors, (3), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-13 23:28:10,258 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-13 23:28:10,258 INFO L93 Difference]: Finished difference Result 161 states and 172 transitions. [2024-11-13 23:28:10,261 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-11-13 23:28:10,261 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 3 states have (on average 1.0) internal successors, (3), 3 states have internal predecessors, (3), 0 states have call successors, (0), 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 3 [2024-11-13 23:28:10,261 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-13 23:28:10,262 INFO L225 Difference]: With dead ends: 161 [2024-11-13 23:28:10,262 INFO L226 Difference]: Without dead ends: 161 [2024-11-13 23:28:10,262 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2024-11-13 23:28:10,263 INFO L432 NwaCegarLoop]: 116 mSDtfsCounter, 67 mSDsluCounter, 110 mSDsCounter, 0 mSdLazyCounter, 217 mSolverCounterSat, 9 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 67 SdHoareTripleChecker+Valid, 226 SdHoareTripleChecker+Invalid, 226 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 9 IncrementalHoareTripleChecker+Valid, 217 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2024-11-13 23:28:10,263 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [67 Valid, 226 Invalid, 226 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [9 Valid, 217 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time] [2024-11-13 23:28:10,264 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 161 states. [2024-11-13 23:28:10,276 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 161 to 161. [2024-11-13 23:28:10,278 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 161 states, 72 states have (on average 2.3333333333333335) internal successors, (168), 157 states have internal predecessors, (168), 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) [2024-11-13 23:28:10,281 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 161 states to 161 states and 172 transitions. [2024-11-13 23:28:10,281 INFO L78 Accepts]: Start accepts. Automaton has 161 states and 172 transitions. Word has length 3 [2024-11-13 23:28:10,283 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-13 23:28:10,283 INFO L471 AbstractCegarLoop]: Abstraction has 161 states and 172 transitions. [2024-11-13 23:28:10,283 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 3 states have (on average 1.0) internal successors, (3), 3 states have internal predecessors, (3), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-13 23:28:10,283 INFO L276 IsEmpty]: Start isEmpty. Operand 161 states and 172 transitions. [2024-11-13 23:28:10,283 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 4 [2024-11-13 23:28:10,283 INFO L207 NwaCegarLoop]: Found error trace [2024-11-13 23:28:10,283 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1] [2024-11-13 23:28:10,283 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2024-11-13 23:28:10,284 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [create_dataErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, create_dataErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, create_dataErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 89 more)] === [2024-11-13 23:28:10,284 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-13 23:28:10,284 INFO L85 PathProgramCache]: Analyzing trace with hash 323503, now seen corresponding path program 1 times [2024-11-13 23:28:10,284 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2024-11-13 23:28:10,284 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1844836281] [2024-11-13 23:28:10,284 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-13 23:28:10,284 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-13 23:28:10,309 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 23:28:10,533 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-13 23:28:10,534 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2024-11-13 23:28:10,534 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1844836281] [2024-11-13 23:28:10,534 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1844836281] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-13 23:28:10,534 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-13 23:28:10,534 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-11-13 23:28:10,534 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [931007113] [2024-11-13 23:28:10,534 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-13 23:28:10,535 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-11-13 23:28:10,535 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2024-11-13 23:28:10,535 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-11-13 23:28:10,535 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-11-13 23:28:10,535 INFO L87 Difference]: Start difference. First operand 161 states and 172 transitions. Second operand has 4 states, 3 states have (on average 1.0) internal successors, (3), 3 states have internal predecessors, (3), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-13 23:28:10,937 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-13 23:28:10,937 INFO L93 Difference]: Finished difference Result 176 states and 190 transitions. [2024-11-13 23:28:10,938 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-11-13 23:28:10,938 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 3 states have (on average 1.0) internal successors, (3), 3 states have internal predecessors, (3), 0 states have call successors, (0), 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 3 [2024-11-13 23:28:10,938 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-13 23:28:10,941 INFO L225 Difference]: With dead ends: 176 [2024-11-13 23:28:10,942 INFO L226 Difference]: Without dead ends: 176 [2024-11-13 23:28:10,943 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2024-11-13 23:28:10,944 INFO L432 NwaCegarLoop]: 137 mSDtfsCounter, 26 mSDsluCounter, 117 mSDsCounter, 0 mSdLazyCounter, 264 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 26 SdHoareTripleChecker+Valid, 254 SdHoareTripleChecker+Invalid, 266 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 264 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2024-11-13 23:28:10,944 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [26 Valid, 254 Invalid, 266 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 264 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time] [2024-11-13 23:28:10,945 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 176 states. [2024-11-13 23:28:10,960 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 176 to 165. [2024-11-13 23:28:10,961 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 165 states, 76 states have (on average 2.289473684210526) internal successors, (174), 161 states have internal predecessors, (174), 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) [2024-11-13 23:28:10,966 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 165 states to 165 states and 178 transitions. [2024-11-13 23:28:10,967 INFO L78 Accepts]: Start accepts. Automaton has 165 states and 178 transitions. Word has length 3 [2024-11-13 23:28:10,967 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-13 23:28:10,967 INFO L471 AbstractCegarLoop]: Abstraction has 165 states and 178 transitions. [2024-11-13 23:28:10,967 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 3 states have (on average 1.0) internal successors, (3), 3 states have internal predecessors, (3), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-13 23:28:10,967 INFO L276 IsEmpty]: Start isEmpty. Operand 165 states and 178 transitions. [2024-11-13 23:28:10,967 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 5 [2024-11-13 23:28:10,967 INFO L207 NwaCegarLoop]: Found error trace [2024-11-13 23:28:10,967 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1] [2024-11-13 23:28:10,967 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2024-11-13 23:28:10,968 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [create_dataErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, create_dataErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, create_dataErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 89 more)] === [2024-11-13 23:28:11,003 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-13 23:28:11,003 INFO L85 PathProgramCache]: Analyzing trace with hash 10028675, now seen corresponding path program 1 times [2024-11-13 23:28:11,003 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2024-11-13 23:28:11,003 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1217047587] [2024-11-13 23:28:11,003 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-13 23:28:11,004 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-13 23:28:11,026 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 23:28:11,078 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-13 23:28:11,078 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2024-11-13 23:28:11,078 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1217047587] [2024-11-13 23:28:11,078 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1217047587] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-13 23:28:11,078 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-13 23:28:11,079 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-11-13 23:28:11,079 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [88425988] [2024-11-13 23:28:11,079 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-13 23:28:11,079 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-13 23:28:11,079 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2024-11-13 23:28:11,080 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-13 23:28:11,080 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-13 23:28:11,080 INFO L87 Difference]: Start difference. First operand 165 states and 178 transitions. Second operand has 3 states, 2 states have (on average 2.0) internal successors, (4), 3 states have internal predecessors, (4), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-13 23:28:11,298 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-13 23:28:11,298 INFO L93 Difference]: Finished difference Result 163 states and 175 transitions. [2024-11-13 23:28:11,299 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-13 23:28:11,299 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), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 4 [2024-11-13 23:28:11,299 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-13 23:28:11,300 INFO L225 Difference]: With dead ends: 163 [2024-11-13 23:28:11,300 INFO L226 Difference]: Without dead ends: 163 [2024-11-13 23:28:11,300 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-13 23:28:11,301 INFO L432 NwaCegarLoop]: 137 mSDtfsCounter, 12 mSDsluCounter, 68 mSDsCounter, 0 mSdLazyCounter, 119 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 12 SdHoareTripleChecker+Valid, 205 SdHoareTripleChecker+Invalid, 122 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 119 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2024-11-13 23:28:11,301 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [12 Valid, 205 Invalid, 122 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 119 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2024-11-13 23:28:11,306 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 163 states. [2024-11-13 23:28:11,312 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 163 to 163. [2024-11-13 23:28:11,312 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 163 states, 76 states have (on average 2.25) internal successors, (171), 159 states have internal predecessors, (171), 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) [2024-11-13 23:28:11,313 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 163 states to 163 states and 175 transitions. [2024-11-13 23:28:11,315 INFO L78 Accepts]: Start accepts. Automaton has 163 states and 175 transitions. Word has length 4 [2024-11-13 23:28:11,315 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-13 23:28:11,315 INFO L471 AbstractCegarLoop]: Abstraction has 163 states and 175 transitions. [2024-11-13 23:28:11,315 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 2 states have (on average 2.0) internal successors, (4), 3 states have internal predecessors, (4), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-13 23:28:11,315 INFO L276 IsEmpty]: Start isEmpty. Operand 163 states and 175 transitions. [2024-11-13 23:28:11,315 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 5 [2024-11-13 23:28:11,315 INFO L207 NwaCegarLoop]: Found error trace [2024-11-13 23:28:11,316 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1] [2024-11-13 23:28:11,316 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2024-11-13 23:28:11,316 INFO L396 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr3REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [create_dataErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, create_dataErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, create_dataErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 89 more)] === [2024-11-13 23:28:11,316 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-13 23:28:11,316 INFO L85 PathProgramCache]: Analyzing trace with hash 10028676, now seen corresponding path program 1 times [2024-11-13 23:28:11,316 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2024-11-13 23:28:11,316 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [183274230] [2024-11-13 23:28:11,317 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-13 23:28:11,317 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-13 23:28:11,335 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 23:28:11,431 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-13 23:28:11,432 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2024-11-13 23:28:11,432 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [183274230] [2024-11-13 23:28:11,432 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [183274230] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-13 23:28:11,432 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-13 23:28:11,432 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-11-13 23:28:11,432 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [357235574] [2024-11-13 23:28:11,432 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-13 23:28:11,432 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-13 23:28:11,432 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2024-11-13 23:28:11,433 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-13 23:28:11,433 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-13 23:28:11,433 INFO L87 Difference]: Start difference. First operand 163 states and 175 transitions. Second operand has 3 states, 2 states have (on average 2.0) internal successors, (4), 3 states have internal predecessors, (4), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-13 23:28:11,682 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-13 23:28:11,682 INFO L93 Difference]: Finished difference Result 161 states and 172 transitions. [2024-11-13 23:28:11,683 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-13 23:28:11,683 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), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 4 [2024-11-13 23:28:11,683 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-13 23:28:11,684 INFO L225 Difference]: With dead ends: 161 [2024-11-13 23:28:11,684 INFO L226 Difference]: Without dead ends: 161 [2024-11-13 23:28:11,685 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-13 23:28:11,686 INFO L432 NwaCegarLoop]: 136 mSDtfsCounter, 10 mSDsluCounter, 72 mSDsCounter, 0 mSdLazyCounter, 116 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 10 SdHoareTripleChecker+Valid, 208 SdHoareTripleChecker+Invalid, 117 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 116 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2024-11-13 23:28:11,686 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [10 Valid, 208 Invalid, 117 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 116 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2024-11-13 23:28:11,687 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 161 states. [2024-11-13 23:28:11,692 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 161 to 161. [2024-11-13 23:28:11,693 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 161 states, 76 states have (on average 2.210526315789474) internal successors, (168), 157 states have internal predecessors, (168), 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) [2024-11-13 23:28:11,694 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 161 states to 161 states and 172 transitions. [2024-11-13 23:28:11,695 INFO L78 Accepts]: Start accepts. Automaton has 161 states and 172 transitions. Word has length 4 [2024-11-13 23:28:11,695 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-13 23:28:11,695 INFO L471 AbstractCegarLoop]: Abstraction has 161 states and 172 transitions. [2024-11-13 23:28:11,695 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 2 states have (on average 2.0) internal successors, (4), 3 states have internal predecessors, (4), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-13 23:28:11,695 INFO L276 IsEmpty]: Start isEmpty. Operand 161 states and 172 transitions. [2024-11-13 23:28:11,696 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 9 [2024-11-13 23:28:11,696 INFO L207 NwaCegarLoop]: Found error trace [2024-11-13 23:28:11,696 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1] [2024-11-13 23:28:11,696 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2024-11-13 23:28:11,696 INFO L396 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr10REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [create_dataErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, create_dataErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, create_dataErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 89 more)] === [2024-11-13 23:28:11,697 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-13 23:28:11,697 INFO L85 PathProgramCache]: Analyzing trace with hash 1894775059, now seen corresponding path program 1 times [2024-11-13 23:28:11,697 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2024-11-13 23:28:11,697 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [306169616] [2024-11-13 23:28:11,698 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-13 23:28:11,698 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-13 23:28:11,717 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 23:28:12,036 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-13 23:28:12,036 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2024-11-13 23:28:12,036 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [306169616] [2024-11-13 23:28:12,036 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [306169616] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-13 23:28:12,037 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-13 23:28:12,040 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2024-11-13 23:28:12,040 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [517013457] [2024-11-13 23:28:12,040 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-13 23:28:12,040 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2024-11-13 23:28:12,040 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2024-11-13 23:28:12,041 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2024-11-13 23:28:12,041 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2024-11-13 23:28:12,041 INFO L87 Difference]: Start difference. First operand 161 states and 172 transitions. Second operand has 6 states, 6 states have (on average 1.3333333333333333) internal successors, (8), 5 states have internal predecessors, (8), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-13 23:28:12,496 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-13 23:28:12,497 INFO L93 Difference]: Finished difference Result 163 states and 175 transitions. [2024-11-13 23:28:12,498 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2024-11-13 23:28:12,498 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 1.3333333333333333) internal successors, (8), 5 states have internal predecessors, (8), 0 states have call successors, (0), 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 8 [2024-11-13 23:28:12,499 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-13 23:28:12,499 INFO L225 Difference]: With dead ends: 163 [2024-11-13 23:28:12,500 INFO L226 Difference]: Without dead ends: 163 [2024-11-13 23:28:12,500 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=20, Invalid=36, Unknown=0, NotChecked=0, Total=56 [2024-11-13 23:28:12,501 INFO L432 NwaCegarLoop]: 139 mSDtfsCounter, 3 mSDsluCounter, 439 mSDsCounter, 0 mSdLazyCounter, 261 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 3 SdHoareTripleChecker+Valid, 578 SdHoareTripleChecker+Invalid, 263 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 261 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2024-11-13 23:28:12,501 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [3 Valid, 578 Invalid, 263 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 261 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time] [2024-11-13 23:28:12,504 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 163 states. [2024-11-13 23:28:12,513 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 163 to 162. [2024-11-13 23:28:12,514 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 162 states, 77 states have (on average 2.1948051948051948) internal successors, (169), 158 states have internal predecessors, (169), 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) [2024-11-13 23:28:12,515 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 162 states to 162 states and 173 transitions. [2024-11-13 23:28:12,515 INFO L78 Accepts]: Start accepts. Automaton has 162 states and 173 transitions. Word has length 8 [2024-11-13 23:28:12,515 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-13 23:28:12,515 INFO L471 AbstractCegarLoop]: Abstraction has 162 states and 173 transitions. [2024-11-13 23:28:12,515 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 1.3333333333333333) internal successors, (8), 5 states have internal predecessors, (8), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-13 23:28:12,515 INFO L276 IsEmpty]: Start isEmpty. Operand 162 states and 173 transitions. [2024-11-13 23:28:12,519 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 11 [2024-11-13 23:28:12,519 INFO L207 NwaCegarLoop]: Found error trace [2024-11-13 23:28:12,519 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-13 23:28:12,519 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2024-11-13 23:28:12,519 INFO L396 AbstractCegarLoop]: === Iteration 7 === Targeting create_dataErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [create_dataErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, create_dataErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, create_dataErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 89 more)] === [2024-11-13 23:28:12,520 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-13 23:28:12,520 INFO L85 PathProgramCache]: Analyzing trace with hash -190438411, now seen corresponding path program 1 times [2024-11-13 23:28:12,520 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2024-11-13 23:28:12,520 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1076331408] [2024-11-13 23:28:12,520 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-13 23:28:12,520 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-13 23:28:12,548 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 23:28:12,661 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-13 23:28:12,662 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2024-11-13 23:28:12,662 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1076331408] [2024-11-13 23:28:12,662 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1076331408] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-13 23:28:12,662 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-13 23:28:12,662 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2024-11-13 23:28:12,662 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2133671205] [2024-11-13 23:28:12,662 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-13 23:28:12,662 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-11-13 23:28:12,662 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2024-11-13 23:28:12,663 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-11-13 23:28:12,663 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-11-13 23:28:12,663 INFO L87 Difference]: Start difference. First operand 162 states and 173 transitions. Second operand has 4 states, 4 states have (on average 2.25) internal successors, (9), 3 states have internal predecessors, (9), 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) [2024-11-13 23:28:12,812 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-13 23:28:12,813 INFO L93 Difference]: Finished difference Result 231 states and 246 transitions. [2024-11-13 23:28:12,813 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-11-13 23:28:12,813 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 2.25) internal successors, (9), 3 states have internal predecessors, (9), 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 10 [2024-11-13 23:28:12,813 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-13 23:28:12,814 INFO L225 Difference]: With dead ends: 231 [2024-11-13 23:28:12,815 INFO L226 Difference]: Without dead ends: 231 [2024-11-13 23:28:12,815 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2024-11-13 23:28:12,815 INFO L432 NwaCegarLoop]: 139 mSDtfsCounter, 73 mSDsluCounter, 275 mSDsCounter, 0 mSdLazyCounter, 88 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 73 SdHoareTripleChecker+Valid, 414 SdHoareTripleChecker+Invalid, 91 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 88 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-11-13 23:28:12,816 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [73 Valid, 414 Invalid, 91 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 88 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-11-13 23:28:12,817 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 231 states. [2024-11-13 23:28:12,827 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 231 to 195. [2024-11-13 23:28:12,827 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 195 states, 109 states have (on average 2.220183486238532) internal successors, (242), 190 states have internal predecessors, (242), 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) [2024-11-13 23:28:12,831 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 195 states to 195 states and 246 transitions. [2024-11-13 23:28:12,831 INFO L78 Accepts]: Start accepts. Automaton has 195 states and 246 transitions. Word has length 10 [2024-11-13 23:28:12,831 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-13 23:28:12,831 INFO L471 AbstractCegarLoop]: Abstraction has 195 states and 246 transitions. [2024-11-13 23:28:12,831 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 2.25) internal successors, (9), 3 states have internal predecessors, (9), 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) [2024-11-13 23:28:12,832 INFO L276 IsEmpty]: Start isEmpty. Operand 195 states and 246 transitions. [2024-11-13 23:28:12,832 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 12 [2024-11-13 23:28:12,832 INFO L207 NwaCegarLoop]: Found error trace [2024-11-13 23:28:12,832 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-13 23:28:12,832 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2024-11-13 23:28:12,832 INFO L396 AbstractCegarLoop]: === Iteration 8 === Targeting create_dataErr4REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [create_dataErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, create_dataErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, create_dataErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 89 more)] === [2024-11-13 23:28:12,833 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-13 23:28:12,833 INFO L85 PathProgramCache]: Analyzing trace with hash -1608617256, now seen corresponding path program 1 times [2024-11-13 23:28:12,833 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2024-11-13 23:28:12,833 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1076171833] [2024-11-13 23:28:12,833 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-13 23:28:12,833 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-13 23:28:12,856 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 23:28:12,953 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-13 23:28:12,953 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2024-11-13 23:28:12,953 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1076171833] [2024-11-13 23:28:12,953 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1076171833] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-13 23:28:12,953 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-13 23:28:12,953 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-11-13 23:28:12,953 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1312088832] [2024-11-13 23:28:12,953 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-13 23:28:12,954 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-13 23:28:12,954 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2024-11-13 23:28:12,954 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-13 23:28:12,954 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-13 23:28:12,954 INFO L87 Difference]: Start difference. First operand 195 states and 246 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), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-13 23:28:13,147 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-13 23:28:13,147 INFO L93 Difference]: Finished difference Result 182 states and 220 transitions. [2024-11-13 23:28:13,147 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-13 23:28:13,148 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), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 11 [2024-11-13 23:28:13,148 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-13 23:28:13,149 INFO L225 Difference]: With dead ends: 182 [2024-11-13 23:28:13,149 INFO L226 Difference]: Without dead ends: 182 [2024-11-13 23:28:13,149 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-13 23:28:13,150 INFO L432 NwaCegarLoop]: 105 mSDtfsCounter, 33 mSDsluCounter, 52 mSDsCounter, 0 mSdLazyCounter, 117 mSolverCounterSat, 14 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 33 SdHoareTripleChecker+Valid, 157 SdHoareTripleChecker+Invalid, 131 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 14 IncrementalHoareTripleChecker+Valid, 117 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2024-11-13 23:28:13,151 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [33 Valid, 157 Invalid, 131 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [14 Valid, 117 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2024-11-13 23:28:13,152 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 182 states. [2024-11-13 23:28:13,156 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 182 to 182. [2024-11-13 23:28:13,157 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 182 states, 109 states have (on average 1.981651376146789) internal successors, (216), 177 states have internal predecessors, (216), 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) [2024-11-13 23:28:13,158 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 182 states to 182 states and 220 transitions. [2024-11-13 23:28:13,158 INFO L78 Accepts]: Start accepts. Automaton has 182 states and 220 transitions. Word has length 11 [2024-11-13 23:28:13,159 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-13 23:28:13,159 INFO L471 AbstractCegarLoop]: Abstraction has 182 states and 220 transitions. [2024-11-13 23:28:13,159 INFO L472 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), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-13 23:28:13,159 INFO L276 IsEmpty]: Start isEmpty. Operand 182 states and 220 transitions. [2024-11-13 23:28:13,159 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 12 [2024-11-13 23:28:13,160 INFO L207 NwaCegarLoop]: Found error trace [2024-11-13 23:28:13,160 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-13 23:28:13,160 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2024-11-13 23:28:13,160 INFO L396 AbstractCegarLoop]: === Iteration 9 === Targeting create_dataErr5REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [create_dataErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, create_dataErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, create_dataErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 89 more)] === [2024-11-13 23:28:13,161 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-13 23:28:13,161 INFO L85 PathProgramCache]: Analyzing trace with hash -1608617255, now seen corresponding path program 1 times [2024-11-13 23:28:13,161 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2024-11-13 23:28:13,161 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1649541446] [2024-11-13 23:28:13,161 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-13 23:28:13,161 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-13 23:28:13,179 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 23:28:13,351 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-13 23:28:13,353 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2024-11-13 23:28:13,353 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1649541446] [2024-11-13 23:28:13,353 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1649541446] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-13 23:28:13,353 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-13 23:28:13,353 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-11-13 23:28:13,354 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [330208286] [2024-11-13 23:28:13,354 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-13 23:28:13,354 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-13 23:28:13,354 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2024-11-13 23:28:13,354 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-13 23:28:13,355 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-13 23:28:13,355 INFO L87 Difference]: Start difference. First operand 182 states and 220 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), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-13 23:28:13,563 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-13 23:28:13,564 INFO L93 Difference]: Finished difference Result 195 states and 230 transitions. [2024-11-13 23:28:13,564 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-13 23:28:13,564 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), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 11 [2024-11-13 23:28:13,564 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-13 23:28:13,566 INFO L225 Difference]: With dead ends: 195 [2024-11-13 23:28:13,566 INFO L226 Difference]: Without dead ends: 195 [2024-11-13 23:28:13,566 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-13 23:28:13,568 INFO L432 NwaCegarLoop]: 109 mSDtfsCounter, 33 mSDsluCounter, 57 mSDsCounter, 0 mSdLazyCounter, 103 mSolverCounterSat, 13 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 33 SdHoareTripleChecker+Valid, 166 SdHoareTripleChecker+Invalid, 116 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 13 IncrementalHoareTripleChecker+Valid, 103 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2024-11-13 23:28:13,568 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [33 Valid, 166 Invalid, 116 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [13 Valid, 103 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2024-11-13 23:28:13,570 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 195 states. [2024-11-13 23:28:13,576 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 195 to 189. [2024-11-13 23:28:13,576 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 189 states, 125 states have (on average 1.792) internal successors, (224), 184 states have internal predecessors, (224), 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) [2024-11-13 23:28:13,580 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 189 states to 189 states and 228 transitions. [2024-11-13 23:28:13,580 INFO L78 Accepts]: Start accepts. Automaton has 189 states and 228 transitions. Word has length 11 [2024-11-13 23:28:13,580 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-13 23:28:13,580 INFO L471 AbstractCegarLoop]: Abstraction has 189 states and 228 transitions. [2024-11-13 23:28:13,581 INFO L472 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), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-13 23:28:13,581 INFO L276 IsEmpty]: Start isEmpty. Operand 189 states and 228 transitions. [2024-11-13 23:28:13,581 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 15 [2024-11-13 23:28:13,581 INFO L207 NwaCegarLoop]: Found error trace [2024-11-13 23:28:13,581 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-13 23:28:13,581 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2024-11-13 23:28:13,582 INFO L396 AbstractCegarLoop]: === Iteration 10 === Targeting create_dataErr8REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [create_dataErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, create_dataErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, create_dataErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 89 more)] === [2024-11-13 23:28:13,583 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-13 23:28:13,583 INFO L85 PathProgramCache]: Analyzing trace with hash 936317797, now seen corresponding path program 1 times [2024-11-13 23:28:13,583 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2024-11-13 23:28:13,583 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1499428351] [2024-11-13 23:28:13,583 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-13 23:28:13,583 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-13 23:28:13,610 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 23:28:13,789 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-13 23:28:13,789 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2024-11-13 23:28:13,789 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1499428351] [2024-11-13 23:28:13,790 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1499428351] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-13 23:28:13,790 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-13 23:28:13,790 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2024-11-13 23:28:13,790 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1137871602] [2024-11-13 23:28:13,790 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-13 23:28:13,790 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2024-11-13 23:28:13,790 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2024-11-13 23:28:13,790 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2024-11-13 23:28:13,791 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2024-11-13 23:28:13,791 INFO L87 Difference]: Start difference. First operand 189 states and 228 transitions. Second operand has 5 states, 4 states have (on average 3.25) internal successors, (13), 5 states have internal predecessors, (13), 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) [2024-11-13 23:28:14,106 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-13 23:28:14,106 INFO L93 Difference]: Finished difference Result 230 states and 282 transitions. [2024-11-13 23:28:14,107 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-11-13 23:28:14,107 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 4 states have (on average 3.25) internal successors, (13), 5 states have internal predecessors, (13), 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 14 [2024-11-13 23:28:14,107 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-13 23:28:14,109 INFO L225 Difference]: With dead ends: 230 [2024-11-13 23:28:14,109 INFO L226 Difference]: Without dead ends: 230 [2024-11-13 23:28:14,109 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2024-11-13 23:28:14,110 INFO L432 NwaCegarLoop]: 114 mSDtfsCounter, 18 mSDsluCounter, 204 mSDsCounter, 0 mSdLazyCounter, 264 mSolverCounterSat, 5 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 18 SdHoareTripleChecker+Valid, 318 SdHoareTripleChecker+Invalid, 269 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 5 IncrementalHoareTripleChecker+Valid, 264 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2024-11-13 23:28:14,115 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [18 Valid, 318 Invalid, 269 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [5 Valid, 264 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2024-11-13 23:28:14,116 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 230 states. [2024-11-13 23:28:14,123 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 230 to 195. [2024-11-13 23:28:14,124 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 195 states, 131 states have (on average 1.786259541984733) internal successors, (234), 190 states have internal predecessors, (234), 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) [2024-11-13 23:28:14,126 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 195 states to 195 states and 238 transitions. [2024-11-13 23:28:14,126 INFO L78 Accepts]: Start accepts. Automaton has 195 states and 238 transitions. Word has length 14 [2024-11-13 23:28:14,126 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-13 23:28:14,126 INFO L471 AbstractCegarLoop]: Abstraction has 195 states and 238 transitions. [2024-11-13 23:28:14,126 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 4 states have (on average 3.25) internal successors, (13), 5 states have internal predecessors, (13), 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) [2024-11-13 23:28:14,126 INFO L276 IsEmpty]: Start isEmpty. Operand 195 states and 238 transitions. [2024-11-13 23:28:14,127 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 15 [2024-11-13 23:28:14,127 INFO L207 NwaCegarLoop]: Found error trace [2024-11-13 23:28:14,127 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-13 23:28:14,127 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9 [2024-11-13 23:28:14,127 INFO L396 AbstractCegarLoop]: === Iteration 11 === Targeting create_dataErr9REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [create_dataErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, create_dataErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, create_dataErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 89 more)] === [2024-11-13 23:28:14,129 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-13 23:28:14,129 INFO L85 PathProgramCache]: Analyzing trace with hash 936317798, now seen corresponding path program 1 times [2024-11-13 23:28:14,129 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2024-11-13 23:28:14,129 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [140795654] [2024-11-13 23:28:14,129 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-13 23:28:14,129 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-13 23:28:14,155 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 23:28:14,457 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-13 23:28:14,457 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2024-11-13 23:28:14,458 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [140795654] [2024-11-13 23:28:14,458 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [140795654] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-13 23:28:14,458 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-13 23:28:14,458 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2024-11-13 23:28:14,458 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1764973461] [2024-11-13 23:28:14,458 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-13 23:28:14,458 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2024-11-13 23:28:14,458 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2024-11-13 23:28:14,459 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2024-11-13 23:28:14,459 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2024-11-13 23:28:14,459 INFO L87 Difference]: Start difference. First operand 195 states and 238 transitions. Second operand has 5 states, 4 states have (on average 3.25) internal successors, (13), 5 states have internal predecessors, (13), 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) [2024-11-13 23:28:14,790 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-13 23:28:14,790 INFO L93 Difference]: Finished difference Result 195 states and 234 transitions. [2024-11-13 23:28:14,790 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-11-13 23:28:14,791 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 4 states have (on average 3.25) internal successors, (13), 5 states have internal predecessors, (13), 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 14 [2024-11-13 23:28:14,791 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-13 23:28:14,792 INFO L225 Difference]: With dead ends: 195 [2024-11-13 23:28:14,792 INFO L226 Difference]: Without dead ends: 195 [2024-11-13 23:28:14,792 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2024-11-13 23:28:14,793 INFO L432 NwaCegarLoop]: 120 mSDtfsCounter, 1 mSDsluCounter, 199 mSDsCounter, 0 mSdLazyCounter, 263 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1 SdHoareTripleChecker+Valid, 319 SdHoareTripleChecker+Invalid, 264 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 263 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2024-11-13 23:28:14,793 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [1 Valid, 319 Invalid, 264 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 263 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2024-11-13 23:28:14,794 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 195 states. [2024-11-13 23:28:14,805 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 195 to 195. [2024-11-13 23:28:14,806 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 195 states, 131 states have (on average 1.7557251908396947) internal successors, (230), 190 states have internal predecessors, (230), 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) [2024-11-13 23:28:14,807 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 195 states to 195 states and 234 transitions. [2024-11-13 23:28:14,807 INFO L78 Accepts]: Start accepts. Automaton has 195 states and 234 transitions. Word has length 14 [2024-11-13 23:28:14,807 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-13 23:28:14,807 INFO L471 AbstractCegarLoop]: Abstraction has 195 states and 234 transitions. [2024-11-13 23:28:14,808 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 4 states have (on average 3.25) internal successors, (13), 5 states have internal predecessors, (13), 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) [2024-11-13 23:28:14,808 INFO L276 IsEmpty]: Start isEmpty. Operand 195 states and 234 transitions. [2024-11-13 23:28:14,808 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 18 [2024-11-13 23:28:14,808 INFO L207 NwaCegarLoop]: Found error trace [2024-11-13 23:28:14,808 INFO L215 NwaCegarLoop]: trace histogram [2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-13 23:28:14,808 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10 [2024-11-13 23:28:14,808 INFO L396 AbstractCegarLoop]: === Iteration 12 === Targeting create_dataErr8REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [create_dataErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, create_dataErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, create_dataErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 89 more)] === [2024-11-13 23:28:14,809 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-13 23:28:14,809 INFO L85 PathProgramCache]: Analyzing trace with hash -1961611642, now seen corresponding path program 1 times [2024-11-13 23:28:14,809 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2024-11-13 23:28:14,809 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [709230569] [2024-11-13 23:28:14,809 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-13 23:28:14,809 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-13 23:28:14,835 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 23:28:15,165 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-13 23:28:15,165 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2024-11-13 23:28:15,165 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [709230569] [2024-11-13 23:28:15,165 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [709230569] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-13 23:28:15,165 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [385819408] [2024-11-13 23:28:15,165 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-13 23:28:15,166 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-13 23:28:15,166 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_2bb9ae36-a0c5-4c2e-87da-07b477e49f29/bin/utaipan-verify-sOmjnqqW8E/z3 [2024-11-13 23:28:15,168 INFO L229 MonitoredProcess]: Starting monitored process 2 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_2bb9ae36-a0c5-4c2e-87da-07b477e49f29/bin/utaipan-verify-sOmjnqqW8E/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-11-13 23:28:15,171 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_2bb9ae36-a0c5-4c2e-87da-07b477e49f29/bin/utaipan-verify-sOmjnqqW8E/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Waiting until timeout for monitored process [2024-11-13 23:28:15,311 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 23:28:15,314 INFO L255 TraceCheckSpWp]: Trace formula consists of 192 conjuncts, 15 conjuncts are in the unsatisfiable core [2024-11-13 23:28:15,320 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-13 23:28:15,405 INFO L349 Elim1Store]: treesize reduction 15, result has 25.0 percent of original size [2024-11-13 23:28:15,407 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 19 treesize of output 18 [2024-11-13 23:28:15,463 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 19 treesize of output 1 [2024-11-13 23:28:15,576 INFO L349 Elim1Store]: treesize reduction 21, result has 19.2 percent of original size [2024-11-13 23:28:15,576 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 42 treesize of output 41 [2024-11-13 23:28:15,615 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 31 treesize of output 13 [2024-11-13 23:28:15,675 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2024-11-13 23:28:15,676 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-11-13 23:28:15,696 WARN L851 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_162 (Array Int Int))) (= (select |c_#valid| (select (select (store |c_#memory_$Pointer$.base| |c_create_data_#t~mem8.base| v_ArrVal_162) c_create_data_~data~0.base) (+ c_create_data_~data~0.offset 4))) 1)) is different from false [2024-11-13 23:28:15,710 WARN L851 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_162 (Array Int Int))) (= (select |c_#valid| (let ((.cse0 (+ c_create_data_~data~0.offset 4))) (select (select (store |c_#memory_$Pointer$.base| (select (select |c_#memory_$Pointer$.base| c_create_data_~data~0.base) .cse0) v_ArrVal_162) c_create_data_~data~0.base) .cse0))) 1)) is different from false [2024-11-13 23:28:15,734 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-11-13 23:28:15,734 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 1 new quantified variables, introduced 1 case distinctions, treesize of input 24 treesize of output 25 [2024-11-13 23:28:15,740 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 40 treesize of output 28 [2024-11-13 23:28:15,753 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 9 treesize of output 5 [2024-11-13 23:28:15,800 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 3 not checked. [2024-11-13 23:28:15,800 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [385819408] provided 0 perfect and 2 imperfect interpolant sequences [2024-11-13 23:28:15,800 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSifa [2059951579] [2024-11-13 23:28:15,823 INFO L159 IcfgInterpreter]: Started Sifa with 15 locations of interest [2024-11-13 23:28:15,823 INFO L166 IcfgInterpreter]: Building call graph [2024-11-13 23:28:15,828 INFO L171 IcfgInterpreter]: Initial procedures are [ULTIMATE.start] [2024-11-13 23:28:15,833 INFO L176 IcfgInterpreter]: Starting interpretation [2024-11-13 23:28:15,833 INFO L197 IcfgInterpreter]: Interpreting procedure ULTIMATE.start with input of size 1 for LOIs [2024-11-13 23:28:16,164 INFO L197 IcfgInterpreter]: Interpreting procedure create_data with input of size 101 for LOIs [2024-11-13 23:28:17,814 INFO L180 IcfgInterpreter]: Interpretation finished [2024-11-13 23:28:20,559 INFO L133 SifaRunner]: Sifa could not show that error location is unreachable, found '4297#(and (= create_data_~data~0.offset 0) (<= 1 |#StackHeapBarrier|) (= create_data_~prevData.base 0) (= |create_data_#in~prevData.offset| 0) (= |create_data_#in~prevData.base| 0) (<= 0 create_data_~counter~0) (<= 0 (+ |create_data_#t~nondet9| 2147483648)) (<= |create_data_#t~nondet9| 2147483647) (exists ((|v_create_data_#t~mem8.base_19| Int)) (not (= 1 (select |#valid| |v_create_data_#t~mem8.base_19|)))) (= create_data_~prevData.offset 0))' at error location [2024-11-13 23:28:20,559 WARN L311 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: ALGORITHM_FAILED [2024-11-13 23:28:20,559 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2024-11-13 23:28:20,559 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [6, 5, 6] total 13 [2024-11-13 23:28:20,559 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [486553542] [2024-11-13 23:28:20,559 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2024-11-13 23:28:20,560 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 14 states [2024-11-13 23:28:20,560 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2024-11-13 23:28:20,560 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 14 interpolants. [2024-11-13 23:28:20,561 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=74, Invalid=484, Unknown=2, NotChecked=90, Total=650 [2024-11-13 23:28:20,561 INFO L87 Difference]: Start difference. First operand 195 states and 234 transitions. Second operand has 14 states, 13 states have (on average 2.1538461538461537) internal successors, (28), 14 states have internal predecessors, (28), 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) [2024-11-13 23:28:20,974 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-13 23:28:20,974 INFO L93 Difference]: Finished difference Result 198 states and 234 transitions. [2024-11-13 23:28:20,975 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-11-13 23:28:20,975 INFO L78 Accepts]: Start accepts. Automaton has has 14 states, 13 states have (on average 2.1538461538461537) internal successors, (28), 14 states have internal predecessors, (28), 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 17 [2024-11-13 23:28:20,975 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-13 23:28:20,976 INFO L225 Difference]: With dead ends: 198 [2024-11-13 23:28:20,976 INFO L226 Difference]: Without dead ends: 198 [2024-11-13 23:28:20,977 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 57 GetRequests, 30 SyntacticMatches, 3 SemanticMatches, 24 ConstructedPredicates, 2 IntricatePredicates, 0 DeprecatedPredicates, 141 ImplicationChecksByTransitivity, 2.9s TimeCoverageRelationStatistics Valid=74, Invalid=484, Unknown=2, NotChecked=90, Total=650 [2024-11-13 23:28:20,977 INFO L432 NwaCegarLoop]: 113 mSDtfsCounter, 52 mSDsluCounter, 502 mSDsCounter, 0 mSdLazyCounter, 347 mSolverCounterSat, 14 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 52 SdHoareTripleChecker+Valid, 615 SdHoareTripleChecker+Invalid, 550 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 14 IncrementalHoareTripleChecker+Valid, 347 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 189 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2024-11-13 23:28:20,977 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [52 Valid, 615 Invalid, 550 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [14 Valid, 347 Invalid, 0 Unknown, 189 Unchecked, 0.4s Time] [2024-11-13 23:28:20,978 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 198 states. [2024-11-13 23:28:20,983 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 198 to 194. [2024-11-13 23:28:20,983 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 194 states, 131 states have (on average 1.7404580152671756) internal successors, (228), 189 states have internal predecessors, (228), 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) [2024-11-13 23:28:20,984 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 194 states to 194 states and 232 transitions. [2024-11-13 23:28:20,984 INFO L78 Accepts]: Start accepts. Automaton has 194 states and 232 transitions. Word has length 17 [2024-11-13 23:28:20,985 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-13 23:28:20,985 INFO L471 AbstractCegarLoop]: Abstraction has 194 states and 232 transitions. [2024-11-13 23:28:20,985 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 14 states, 13 states have (on average 2.1538461538461537) internal successors, (28), 14 states have internal predecessors, (28), 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) [2024-11-13 23:28:20,985 INFO L276 IsEmpty]: Start isEmpty. Operand 194 states and 232 transitions. [2024-11-13 23:28:20,985 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 18 [2024-11-13 23:28:20,986 INFO L207 NwaCegarLoop]: Found error trace [2024-11-13 23:28:20,986 INFO L215 NwaCegarLoop]: trace histogram [2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-13 23:28:21,007 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_2bb9ae36-a0c5-4c2e-87da-07b477e49f29/bin/utaipan-verify-sOmjnqqW8E/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Ended with exit code 0 [2024-11-13 23:28:21,190 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable11,2 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_2bb9ae36-a0c5-4c2e-87da-07b477e49f29/bin/utaipan-verify-sOmjnqqW8E/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-13 23:28:21,190 INFO L396 AbstractCegarLoop]: === Iteration 13 === Targeting create_dataErr9REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [create_dataErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, create_dataErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, create_dataErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 89 more)] === [2024-11-13 23:28:21,190 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-13 23:28:21,190 INFO L85 PathProgramCache]: Analyzing trace with hash -1961611641, now seen corresponding path program 1 times [2024-11-13 23:28:21,191 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2024-11-13 23:28:21,191 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [908902521] [2024-11-13 23:28:21,191 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-13 23:28:21,191 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-13 23:28:21,222 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 23:28:21,661 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-13 23:28:21,661 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2024-11-13 23:28:21,661 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [908902521] [2024-11-13 23:28:21,661 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [908902521] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-13 23:28:21,661 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1756113414] [2024-11-13 23:28:21,662 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-13 23:28:21,662 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-13 23:28:21,663 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_2bb9ae36-a0c5-4c2e-87da-07b477e49f29/bin/utaipan-verify-sOmjnqqW8E/z3 [2024-11-13 23:28:21,665 INFO L229 MonitoredProcess]: Starting monitored process 3 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_2bb9ae36-a0c5-4c2e-87da-07b477e49f29/bin/utaipan-verify-sOmjnqqW8E/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-11-13 23:28:21,667 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_2bb9ae36-a0c5-4c2e-87da-07b477e49f29/bin/utaipan-verify-sOmjnqqW8E/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Waiting until timeout for monitored process [2024-11-13 23:28:21,777 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 23:28:21,779 INFO L255 TraceCheckSpWp]: Trace formula consists of 192 conjuncts, 25 conjuncts are in the unsatisfiable core [2024-11-13 23:28:21,781 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-13 23:28:21,794 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 [2024-11-13 23:28:21,800 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 13 treesize of output 1 [2024-11-13 23:28:21,808 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 10 treesize of output 8 [2024-11-13 23:28:21,837 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 19 treesize of output 1 [2024-11-13 23:28:21,844 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 13 treesize of output 9 [2024-11-13 23:28:21,954 INFO L349 Elim1Store]: treesize reduction 21, result has 19.2 percent of original size [2024-11-13 23:28:21,954 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 62 treesize of output 57 [2024-11-13 23:28:21,966 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 30 treesize of output 13 [2024-11-13 23:28:22,030 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 31 treesize of output 13 [2024-11-13 23:28:22,039 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 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 9 treesize of output 3 [2024-11-13 23:28:22,061 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-13 23:28:22,061 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-11-13 23:28:22,168 WARN L851 $PredicateComparison]: unable to prove that (let ((.cse0 (+ c_create_data_~data~0.offset 4)) (.cse1 (* c_create_data_~counter~0 4))) (and (forall ((v_ArrVal_221 (Array Int Int)) (v_ArrVal_220 (Array Int Int))) (<= (+ (select (select (store |c_#memory_$Pointer$.offset| |c_create_data_#t~mem8.base| v_ArrVal_221) c_create_data_~data~0.base) .cse0) .cse1 8) (select |c_#length| (select (select (store |c_#memory_$Pointer$.base| |c_create_data_#t~mem8.base| v_ArrVal_220) c_create_data_~data~0.base) .cse0)))) (forall ((v_ArrVal_221 (Array Int Int))) (<= 0 (+ (select (select (store |c_#memory_$Pointer$.offset| |c_create_data_#t~mem8.base| v_ArrVal_221) c_create_data_~data~0.base) .cse0) .cse1 4))))) is different from false [2024-11-13 23:28:22,189 WARN L851 $PredicateComparison]: unable to prove that (let ((.cse2 (+ c_create_data_~data~0.offset 4))) (let ((.cse0 (* c_create_data_~counter~0 4)) (.cse1 (select (select |c_#memory_$Pointer$.base| c_create_data_~data~0.base) .cse2))) (and (forall ((v_ArrVal_221 (Array Int Int)) (v_ArrVal_220 (Array Int Int))) (<= (+ .cse0 8 (select (select (store |c_#memory_$Pointer$.offset| .cse1 v_ArrVal_221) c_create_data_~data~0.base) .cse2)) (select |c_#length| (select (select (store |c_#memory_$Pointer$.base| .cse1 v_ArrVal_220) c_create_data_~data~0.base) .cse2)))) (forall ((v_ArrVal_221 (Array Int Int))) (<= 0 (+ .cse0 4 (select (select (store |c_#memory_$Pointer$.offset| .cse1 v_ArrVal_221) c_create_data_~data~0.base) .cse2))))))) is different from false [2024-11-13 23:28:22,219 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-11-13 23:28:22,219 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 1 new quantified variables, introduced 1 case distinctions, treesize of input 45 treesize of output 46 [2024-11-13 23:28:22,228 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-11-13 23:28:22,228 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 1 new quantified variables, introduced 1 case distinctions, treesize of input 35 treesize of output 36 [2024-11-13 23:28:22,233 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 62 treesize of output 50 [2024-11-13 23:28:22,239 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 96 treesize of output 78 [2024-11-13 23:28:22,248 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 15 treesize of output 11 [2024-11-13 23:28:22,252 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 11 treesize of output 7 [2024-11-13 23:28:22,266 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-11-13 23:28:22,266 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 24 treesize of output 25 [2024-11-13 23:28:22,272 INFO L173 IndexEqualityManager]: detected equality via solver [2024-11-13 23:28:22,274 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 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 22 treesize of output 10 [2024-11-13 23:28:22,311 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 3 not checked. [2024-11-13 23:28:22,311 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1756113414] provided 0 perfect and 2 imperfect interpolant sequences [2024-11-13 23:28:22,311 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSifa [1586397186] [2024-11-13 23:28:22,313 INFO L159 IcfgInterpreter]: Started Sifa with 15 locations of interest [2024-11-13 23:28:22,313 INFO L166 IcfgInterpreter]: Building call graph [2024-11-13 23:28:22,314 INFO L171 IcfgInterpreter]: Initial procedures are [ULTIMATE.start] [2024-11-13 23:28:22,314 INFO L176 IcfgInterpreter]: Starting interpretation [2024-11-13 23:28:22,314 INFO L197 IcfgInterpreter]: Interpreting procedure ULTIMATE.start with input of size 1 for LOIs [2024-11-13 23:28:22,434 INFO L197 IcfgInterpreter]: Interpreting procedure create_data with input of size 101 for LOIs [2024-11-13 23:28:23,456 INFO L180 IcfgInterpreter]: Interpretation finished [2024-11-13 23:28:25,953 INFO L133 SifaRunner]: Sifa could not show that error location is unreachable, found '4816#(exists ((|v_create_data_#t~mem8.base_27| Int) (v_create_data_~counter~0_28 Int) (|v_create_data_#t~mem8.offset_23| Int)) (and (<= 0 v_create_data_~counter~0_28) (= create_data_~data~0.offset 0) (<= 1 |#StackHeapBarrier|) (= create_data_~prevData.base 0) (= |create_data_#in~prevData.offset| 0) (= |create_data_#in~prevData.base| 0) (or (< (+ (* v_create_data_~counter~0_28 4) |v_create_data_#t~mem8.offset_23|) 0) (< (select |#length| |v_create_data_#t~mem8.base_27|) (+ 4 (* v_create_data_~counter~0_28 4) |v_create_data_#t~mem8.offset_23|))) (<= 0 (+ |create_data_#t~nondet9| 2147483648)) (<= |create_data_#t~nondet9| 2147483647) (= create_data_~prevData.offset 0)))' at error location [2024-11-13 23:28:25,953 WARN L311 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: ALGORITHM_FAILED [2024-11-13 23:28:25,953 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2024-11-13 23:28:25,953 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [6, 6, 6] total 16 [2024-11-13 23:28:25,953 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1415399457] [2024-11-13 23:28:25,953 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2024-11-13 23:28:25,953 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 17 states [2024-11-13 23:28:25,954 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2024-11-13 23:28:25,954 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 17 interpolants. [2024-11-13 23:28:25,955 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=82, Invalid=626, Unknown=2, NotChecked=102, Total=812 [2024-11-13 23:28:25,955 INFO L87 Difference]: Start difference. First operand 194 states and 232 transitions. Second operand has 17 states, 16 states have (on average 2.0) internal successors, (32), 17 states have internal predecessors, (32), 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) [2024-11-13 23:28:26,808 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-13 23:28:26,809 INFO L93 Difference]: Finished difference Result 200 states and 238 transitions. [2024-11-13 23:28:26,809 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2024-11-13 23:28:26,809 INFO L78 Accepts]: Start accepts. Automaton has has 17 states, 16 states have (on average 2.0) internal successors, (32), 17 states have internal predecessors, (32), 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 17 [2024-11-13 23:28:26,810 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-13 23:28:26,811 INFO L225 Difference]: With dead ends: 200 [2024-11-13 23:28:26,811 INFO L226 Difference]: Without dead ends: 200 [2024-11-13 23:28:26,812 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 59 GetRequests, 27 SyntacticMatches, 2 SemanticMatches, 30 ConstructedPredicates, 2 IntricatePredicates, 0 DeprecatedPredicates, 170 ImplicationChecksByTransitivity, 2.9s TimeCoverageRelationStatistics Valid=104, Invalid=772, Unknown=2, NotChecked=114, Total=992 [2024-11-13 23:28:26,812 INFO L432 NwaCegarLoop]: 119 mSDtfsCounter, 3 mSDsluCounter, 716 mSDsCounter, 0 mSdLazyCounter, 758 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.6s Time, 0 mProtectedPredicate, 0 mProtectedAction, 3 SdHoareTripleChecker+Valid, 835 SdHoareTripleChecker+Invalid, 928 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 758 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 169 IncrementalHoareTripleChecker+Unchecked, 0.7s IncrementalHoareTripleChecker+Time [2024-11-13 23:28:26,812 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [3 Valid, 835 Invalid, 928 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 758 Invalid, 0 Unknown, 169 Unchecked, 0.7s Time] [2024-11-13 23:28:26,813 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 200 states. [2024-11-13 23:28:26,819 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 200 to 200. [2024-11-13 23:28:26,819 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 200 states, 137 states have (on average 1.7080291970802919) internal successors, (234), 195 states have internal predecessors, (234), 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) [2024-11-13 23:28:26,820 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 200 states to 200 states and 238 transitions. [2024-11-13 23:28:26,820 INFO L78 Accepts]: Start accepts. Automaton has 200 states and 238 transitions. Word has length 17 [2024-11-13 23:28:26,820 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-13 23:28:26,824 INFO L471 AbstractCegarLoop]: Abstraction has 200 states and 238 transitions. [2024-11-13 23:28:26,824 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 17 states, 16 states have (on average 2.0) internal successors, (32), 17 states have internal predecessors, (32), 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) [2024-11-13 23:28:26,824 INFO L276 IsEmpty]: Start isEmpty. Operand 200 states and 238 transitions. [2024-11-13 23:28:26,825 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 21 [2024-11-13 23:28:26,825 INFO L207 NwaCegarLoop]: Found error trace [2024-11-13 23:28:26,825 INFO L215 NwaCegarLoop]: trace histogram [3, 3, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-13 23:28:26,847 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_2bb9ae36-a0c5-4c2e-87da-07b477e49f29/bin/utaipan-verify-sOmjnqqW8E/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Ended with exit code 0 [2024-11-13 23:28:27,029 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 3 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_2bb9ae36-a0c5-4c2e-87da-07b477e49f29/bin/utaipan-verify-sOmjnqqW8E/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable12 [2024-11-13 23:28:27,029 INFO L396 AbstractCegarLoop]: === Iteration 14 === Targeting create_dataErr9REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [create_dataErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, create_dataErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, create_dataErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 89 more)] === [2024-11-13 23:28:27,029 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-13 23:28:27,029 INFO L85 PathProgramCache]: Analyzing trace with hash -1039911994, now seen corresponding path program 2 times [2024-11-13 23:28:27,029 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2024-11-13 23:28:27,029 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [9864684] [2024-11-13 23:28:27,030 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-13 23:28:27,030 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-13 23:28:27,055 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 23:28:27,557 INFO L134 CoverageAnalysis]: Checked inductivity of 9 backedges. 0 proven. 9 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-13 23:28:27,558 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2024-11-13 23:28:27,558 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [9864684] [2024-11-13 23:28:27,558 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [9864684] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-13 23:28:27,558 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1578882714] [2024-11-13 23:28:27,558 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2024-11-13 23:28:27,558 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-13 23:28:27,559 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_2bb9ae36-a0c5-4c2e-87da-07b477e49f29/bin/utaipan-verify-sOmjnqqW8E/z3 [2024-11-13 23:28:27,561 INFO L229 MonitoredProcess]: Starting monitored process 4 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_2bb9ae36-a0c5-4c2e-87da-07b477e49f29/bin/utaipan-verify-sOmjnqqW8E/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-11-13 23:28:27,562 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_2bb9ae36-a0c5-4c2e-87da-07b477e49f29/bin/utaipan-verify-sOmjnqqW8E/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Waiting until timeout for monitored process [2024-11-13 23:28:27,686 INFO L227 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 3 check-sat command(s) [2024-11-13 23:28:27,686 INFO L228 tOrderPrioritization]: Conjunction of SSA is unsat [2024-11-13 23:28:27,688 INFO L255 TraceCheckSpWp]: Trace formula consists of 221 conjuncts, 30 conjuncts are in the unsatisfiable core [2024-11-13 23:28:27,691 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-13 23:28:27,706 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 10 treesize of output 8 [2024-11-13 23:28:27,713 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 13 treesize of output 1 [2024-11-13 23:28:27,743 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 19 treesize of output 1 [2024-11-13 23:28:27,754 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 19 treesize of output 1 [2024-11-13 23:28:27,851 INFO L349 Elim1Store]: treesize reduction 21, result has 19.2 percent of original size [2024-11-13 23:28:27,852 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 62 treesize of output 57 [2024-11-13 23:28:27,861 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 30 treesize of output 13 [2024-11-13 23:28:27,977 INFO L349 Elim1Store]: treesize reduction 21, result has 19.2 percent of original size [2024-11-13 23:28:27,978 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 62 treesize of output 57 [2024-11-13 23:28:27,986 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 43 treesize of output 24 [2024-11-13 23:28:28,054 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 31 treesize of output 13 [2024-11-13 23:28:28,059 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 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 32 treesize of output 14 [2024-11-13 23:28:28,093 INFO L134 CoverageAnalysis]: Checked inductivity of 9 backedges. 0 proven. 9 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-13 23:28:28,093 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-11-13 23:28:28,388 WARN L851 $PredicateComparison]: unable to prove that (let ((.cse2 (+ c_create_data_~data~0.offset 4))) (and (forall ((v_create_data_~counter~0_32 Int)) (or (forall ((v_ArrVal_292 (Array Int Int))) (let ((.cse0 (* v_create_data_~counter~0_32 4)) (.cse1 (store |c_#memory_$Pointer$.offset| |c_create_data_#t~mem8.base| v_ArrVal_292))) (or (forall ((v_ArrVal_291 (Array Int Int)) (v_ArrVal_294 (Array Int Int))) (<= 0 (+ .cse0 4 (select (select (store .cse1 (select (select (store |c_#memory_$Pointer$.base| |c_create_data_#t~mem8.base| v_ArrVal_291) c_create_data_~data~0.base) .cse2) v_ArrVal_294) c_create_data_~data~0.base) .cse2)))) (< (+ .cse0 (select (select .cse1 c_create_data_~data~0.base) .cse2)) 0)))) (< (+ c_create_data_~counter~0 1) v_create_data_~counter~0_32))) (forall ((v_ArrVal_292 (Array Int Int)) (v_ArrVal_291 (Array Int Int)) (v_ArrVal_294 (Array Int Int)) (v_ArrVal_293 (Array Int Int))) (let ((.cse3 (* c_create_data_~counter~0 4)) (.cse4 (store |c_#memory_$Pointer$.offset| |c_create_data_#t~mem8.base| v_ArrVal_292))) (or (< (+ .cse3 (select (select .cse4 c_create_data_~data~0.base) .cse2) 4) 0) (let ((.cse6 (store |c_#memory_$Pointer$.base| |c_create_data_#t~mem8.base| v_ArrVal_291))) (let ((.cse5 (select (select .cse6 c_create_data_~data~0.base) .cse2))) (< (+ .cse3 11 (select (select (store .cse4 .cse5 v_ArrVal_294) c_create_data_~data~0.base) .cse2)) (select |c_#length| (select (select (store .cse6 .cse5 v_ArrVal_293) c_create_data_~data~0.base) .cse2)))))))))) is different from false [2024-11-13 23:28:28,432 WARN L851 $PredicateComparison]: unable to prove that (let ((.cse1 (+ c_create_data_~data~0.offset 4))) (let ((.cse3 (select (select |c_#memory_$Pointer$.base| c_create_data_~data~0.base) .cse1))) (and (forall ((v_create_data_~counter~0_32 Int)) (or (< (+ c_create_data_~counter~0 1) v_create_data_~counter~0_32) (forall ((v_ArrVal_292 (Array Int Int))) (let ((.cse2 (* v_create_data_~counter~0_32 4)) (.cse0 (store |c_#memory_$Pointer$.offset| .cse3 v_ArrVal_292))) (or (< (+ (select (select .cse0 c_create_data_~data~0.base) .cse1) .cse2) 0) (forall ((v_ArrVal_291 (Array Int Int)) (v_ArrVal_294 (Array Int Int))) (<= 0 (+ .cse2 (select (select (store .cse0 (select (select (store |c_#memory_$Pointer$.base| .cse3 v_ArrVal_291) c_create_data_~data~0.base) .cse1) v_ArrVal_294) c_create_data_~data~0.base) .cse1) 4)))))))) (forall ((v_ArrVal_292 (Array Int Int)) (v_ArrVal_291 (Array Int Int)) (v_ArrVal_294 (Array Int Int)) (v_ArrVal_293 (Array Int Int))) (let ((.cse5 (store |c_#memory_$Pointer$.offset| .cse3 v_ArrVal_292)) (.cse4 (* c_create_data_~counter~0 4))) (or (let ((.cse7 (store |c_#memory_$Pointer$.base| .cse3 v_ArrVal_291))) (let ((.cse6 (select (select .cse7 c_create_data_~data~0.base) .cse1))) (< (+ .cse4 (select (select (store .cse5 .cse6 v_ArrVal_294) c_create_data_~data~0.base) .cse1) 11) (select |c_#length| (select (select (store .cse7 .cse6 v_ArrVal_293) c_create_data_~data~0.base) .cse1))))) (< (+ (select (select .cse5 c_create_data_~data~0.base) .cse1) .cse4 4) 0))))))) is different from false [2024-11-13 23:28:28,500 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-11-13 23:28:28,500 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 1 new quantified variables, introduced 1 case distinctions, treesize of input 202 treesize of output 173 [2024-11-13 23:28:28,511 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-11-13 23:28:28,511 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 1 new quantified variables, introduced 1 case distinctions, treesize of input 162 treesize of output 133 [2024-11-13 23:28:28,520 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 902 treesize of output 782 [2024-11-13 23:28:28,544 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 1138 treesize of output 1060 [2024-11-13 23:28:28,586 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 271 treesize of output 259 [2024-11-13 23:28:28,593 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 259 treesize of output 231 [2024-11-13 23:28:28,600 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 231 treesize of output 223 [2024-11-13 23:28:28,605 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 223 treesize of output 215 [2024-11-13 23:28:28,613 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 215 treesize of output 207 [2024-11-13 23:28:28,621 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 207 treesize of output 199 [2024-11-13 23:28:28,629 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 199 treesize of output 195 [2024-11-13 23:28:28,717 INFO L134 CoverageAnalysis]: Checked inductivity of 9 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 6 not checked. [2024-11-13 23:28:28,718 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1578882714] provided 0 perfect and 2 imperfect interpolant sequences [2024-11-13 23:28:28,718 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSifa [579339031] [2024-11-13 23:28:28,720 INFO L159 IcfgInterpreter]: Started Sifa with 15 locations of interest [2024-11-13 23:28:28,720 INFO L166 IcfgInterpreter]: Building call graph [2024-11-13 23:28:28,720 INFO L171 IcfgInterpreter]: Initial procedures are [ULTIMATE.start] [2024-11-13 23:28:28,720 INFO L176 IcfgInterpreter]: Starting interpretation [2024-11-13 23:28:28,720 INFO L197 IcfgInterpreter]: Interpreting procedure ULTIMATE.start with input of size 1 for LOIs [2024-11-13 23:28:28,815 INFO L197 IcfgInterpreter]: Interpreting procedure create_data with input of size 101 for LOIs [2024-11-13 23:28:29,729 INFO L180 IcfgInterpreter]: Interpretation finished [2024-11-13 23:28:46,796 INFO L133 SifaRunner]: Sifa could not show that error location is unreachable, found '5372#(and (= create_data_~data~0.offset 0) (= create_data_~prevData.base 0) (= |create_data_#in~prevData.offset| 0) (exists ((v_create_data_~counter~0_38 Int) (|v_create_data_#t~mem8.base_37| Int) (|v_create_data_#t~mem8.offset_32| Int)) (and (<= 1 |#StackHeapBarrier|) (or (< (select |#length| |v_create_data_#t~mem8.base_37|) (+ (* v_create_data_~counter~0_38 4) 4 |v_create_data_#t~mem8.offset_32|)) (< (+ (* v_create_data_~counter~0_38 4) |v_create_data_#t~mem8.offset_32|) 0)) (<= 0 v_create_data_~counter~0_38) (<= 0 (+ |create_data_#t~nondet9| 2147483648)) (<= |create_data_#t~nondet9| 2147483647))) (= |create_data_#in~prevData.base| 0) (= create_data_~prevData.offset 0))' at error location [2024-11-13 23:28:46,797 WARN L311 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: ALGORITHM_FAILED [2024-11-13 23:28:46,797 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2024-11-13 23:28:46,797 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [8, 8, 8] total 22 [2024-11-13 23:28:46,797 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1636700632] [2024-11-13 23:28:46,798 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2024-11-13 23:28:46,798 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 23 states [2024-11-13 23:28:46,798 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2024-11-13 23:28:46,798 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 23 interpolants. [2024-11-13 23:28:46,799 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=111, Invalid=945, Unknown=8, NotChecked=126, Total=1190 [2024-11-13 23:28:46,799 INFO L87 Difference]: Start difference. First operand 200 states and 238 transitions. Second operand has 23 states, 22 states have (on average 1.8636363636363635) internal successors, (41), 23 states have internal predecessors, (41), 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) [2024-11-13 23:28:48,014 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-13 23:28:48,014 INFO L93 Difference]: Finished difference Result 212 states and 252 transitions. [2024-11-13 23:28:48,015 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2024-11-13 23:28:48,015 INFO L78 Accepts]: Start accepts. Automaton has has 23 states, 22 states have (on average 1.8636363636363635) internal successors, (41), 23 states have internal predecessors, (41), 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 20 [2024-11-13 23:28:48,015 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-13 23:28:48,016 INFO L225 Difference]: With dead ends: 212 [2024-11-13 23:28:48,016 INFO L226 Difference]: Without dead ends: 212 [2024-11-13 23:28:48,017 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 72 GetRequests, 32 SyntacticMatches, 2 SemanticMatches, 38 ConstructedPredicates, 2 IntricatePredicates, 0 DeprecatedPredicates, 336 ImplicationChecksByTransitivity, 17.8s TimeCoverageRelationStatistics Valid=159, Invalid=1247, Unknown=8, NotChecked=146, Total=1560 [2024-11-13 23:28:48,017 INFO L432 NwaCegarLoop]: 119 mSDtfsCounter, 6 mSDsluCounter, 913 mSDsCounter, 0 mSdLazyCounter, 1031 mSolverCounterSat, 1 mSolverCounterUnsat, 19 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.8s Time, 0 mProtectedPredicate, 0 mProtectedAction, 6 SdHoareTripleChecker+Valid, 1032 SdHoareTripleChecker+Invalid, 1234 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 1031 IncrementalHoareTripleChecker+Invalid, 19 IncrementalHoareTripleChecker+Unknown, 183 IncrementalHoareTripleChecker+Unchecked, 1.0s IncrementalHoareTripleChecker+Time [2024-11-13 23:28:48,018 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [6 Valid, 1032 Invalid, 1234 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 1031 Invalid, 19 Unknown, 183 Unchecked, 1.0s Time] [2024-11-13 23:28:48,018 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 212 states. [2024-11-13 23:28:48,022 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 212 to 212. [2024-11-13 23:28:48,023 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 212 states, 149 states have (on average 1.6644295302013423) internal successors, (248), 207 states have internal predecessors, (248), 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) [2024-11-13 23:28:48,024 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 212 states to 212 states and 252 transitions. [2024-11-13 23:28:48,024 INFO L78 Accepts]: Start accepts. Automaton has 212 states and 252 transitions. Word has length 20 [2024-11-13 23:28:48,026 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-13 23:28:48,026 INFO L471 AbstractCegarLoop]: Abstraction has 212 states and 252 transitions. [2024-11-13 23:28:48,026 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 23 states, 22 states have (on average 1.8636363636363635) internal successors, (41), 23 states have internal predecessors, (41), 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) [2024-11-13 23:28:48,026 INFO L276 IsEmpty]: Start isEmpty. Operand 212 states and 252 transitions. [2024-11-13 23:28:48,028 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 27 [2024-11-13 23:28:48,028 INFO L207 NwaCegarLoop]: Found error trace [2024-11-13 23:28:48,028 INFO L215 NwaCegarLoop]: trace histogram [5, 5, 4, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-13 23:28:48,048 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_2bb9ae36-a0c5-4c2e-87da-07b477e49f29/bin/utaipan-verify-sOmjnqqW8E/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Ended with exit code 0 [2024-11-13 23:28:48,232 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 4 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_2bb9ae36-a0c5-4c2e-87da-07b477e49f29/bin/utaipan-verify-sOmjnqqW8E/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable13 [2024-11-13 23:28:48,232 INFO L396 AbstractCegarLoop]: === Iteration 15 === Targeting create_dataErr9REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [create_dataErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, create_dataErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, create_dataErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 89 more)] === [2024-11-13 23:28:48,232 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-13 23:28:48,232 INFO L85 PathProgramCache]: Analyzing trace with hash -1372091354, now seen corresponding path program 3 times [2024-11-13 23:28:48,232 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2024-11-13 23:28:48,232 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [966747777] [2024-11-13 23:28:48,232 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-13 23:28:48,233 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-13 23:28:48,263 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 23:28:48,376 INFO L134 CoverageAnalysis]: Checked inductivity of 30 backedges. 20 proven. 10 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-13 23:28:48,377 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2024-11-13 23:28:48,377 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [966747777] [2024-11-13 23:28:48,377 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [966747777] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-13 23:28:48,377 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1951374446] [2024-11-13 23:28:48,377 INFO L93 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST [2024-11-13 23:28:48,377 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-13 23:28:48,377 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_2bb9ae36-a0c5-4c2e-87da-07b477e49f29/bin/utaipan-verify-sOmjnqqW8E/z3 [2024-11-13 23:28:48,379 INFO L229 MonitoredProcess]: Starting monitored process 5 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_2bb9ae36-a0c5-4c2e-87da-07b477e49f29/bin/utaipan-verify-sOmjnqqW8E/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-11-13 23:28:48,381 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_2bb9ae36-a0c5-4c2e-87da-07b477e49f29/bin/utaipan-verify-sOmjnqqW8E/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Waiting until timeout for monitored process [2024-11-13 23:28:48,499 INFO L227 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2024-11-13 23:28:48,500 INFO L228 tOrderPrioritization]: Conjunction of SSA is unsat [2024-11-13 23:28:48,501 INFO L255 TraceCheckSpWp]: Trace formula consists of 174 conjuncts, 5 conjuncts are in the unsatisfiable core [2024-11-13 23:28:48,502 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-13 23:28:48,528 INFO L134 CoverageAnalysis]: Checked inductivity of 30 backedges. 28 proven. 0 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2024-11-13 23:28:48,528 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-11-13 23:28:48,528 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1951374446] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-13 23:28:48,528 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2024-11-13 23:28:48,528 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [7] total 8 [2024-11-13 23:28:48,528 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1019376630] [2024-11-13 23:28:48,528 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-13 23:28:48,529 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2024-11-13 23:28:48,529 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2024-11-13 23:28:48,529 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2024-11-13 23:28:48,529 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=24, Invalid=32, Unknown=0, NotChecked=0, Total=56 [2024-11-13 23:28:48,529 INFO L87 Difference]: Start difference. First operand 212 states and 252 transitions. Second operand has 6 states, 6 states have (on average 4.0) internal successors, (24), 6 states have internal predecessors, (24), 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) [2024-11-13 23:28:48,641 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-13 23:28:48,641 INFO L93 Difference]: Finished difference Result 201 states and 236 transitions. [2024-11-13 23:28:48,641 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2024-11-13 23:28:48,642 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 4.0) internal successors, (24), 6 states have internal predecessors, (24), 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 26 [2024-11-13 23:28:48,642 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-13 23:28:48,643 INFO L225 Difference]: With dead ends: 201 [2024-11-13 23:28:48,643 INFO L226 Difference]: Without dead ends: 201 [2024-11-13 23:28:48,644 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 32 GetRequests, 26 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=24, Invalid=32, Unknown=0, NotChecked=0, Total=56 [2024-11-13 23:28:48,645 INFO L432 NwaCegarLoop]: 118 mSDtfsCounter, 0 mSDsluCounter, 354 mSDsCounter, 0 mSdLazyCounter, 113 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 472 SdHoareTripleChecker+Invalid, 113 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 113 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-11-13 23:28:48,645 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 472 Invalid, 113 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 113 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-11-13 23:28:48,646 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 201 states. [2024-11-13 23:28:48,650 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 201 to 201. [2024-11-13 23:28:48,657 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 201 states, 139 states have (on average 1.669064748201439) internal successors, (232), 196 states have internal predecessors, (232), 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) [2024-11-13 23:28:48,658 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 201 states to 201 states and 236 transitions. [2024-11-13 23:28:48,658 INFO L78 Accepts]: Start accepts. Automaton has 201 states and 236 transitions. Word has length 26 [2024-11-13 23:28:48,658 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-13 23:28:48,658 INFO L471 AbstractCegarLoop]: Abstraction has 201 states and 236 transitions. [2024-11-13 23:28:48,658 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 4.0) internal successors, (24), 6 states have internal predecessors, (24), 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) [2024-11-13 23:28:48,659 INFO L276 IsEmpty]: Start isEmpty. Operand 201 states and 236 transitions. [2024-11-13 23:28:48,659 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 33 [2024-11-13 23:28:48,659 INFO L207 NwaCegarLoop]: Found error trace [2024-11-13 23:28:48,659 INFO L215 NwaCegarLoop]: trace histogram [3, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-13 23:28:48,680 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_2bb9ae36-a0c5-4c2e-87da-07b477e49f29/bin/utaipan-verify-sOmjnqqW8E/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Ended with exit code 0 [2024-11-13 23:28:48,859 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 5 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_2bb9ae36-a0c5-4c2e-87da-07b477e49f29/bin/utaipan-verify-sOmjnqqW8E/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable14 [2024-11-13 23:28:48,860 INFO L396 AbstractCegarLoop]: === Iteration 16 === Targeting create_dataErr24REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [create_dataErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, create_dataErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, create_dataErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 89 more)] === [2024-11-13 23:28:48,860 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-13 23:28:48,860 INFO L85 PathProgramCache]: Analyzing trace with hash 859411861, now seen corresponding path program 1 times [2024-11-13 23:28:48,860 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2024-11-13 23:28:48,860 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1514787312] [2024-11-13 23:28:48,860 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-13 23:28:48,860 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-13 23:28:48,888 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 23:28:48,943 INFO L134 CoverageAnalysis]: Checked inductivity of 12 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 12 trivial. 0 not checked. [2024-11-13 23:28:48,943 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2024-11-13 23:28:48,943 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1514787312] [2024-11-13 23:28:48,943 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1514787312] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-13 23:28:48,943 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-13 23:28:48,943 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-11-13 23:28:48,943 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1414642031] [2024-11-13 23:28:48,943 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-13 23:28:48,944 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-13 23:28:48,944 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2024-11-13 23:28:48,944 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-13 23:28:48,944 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-13 23:28:48,944 INFO L87 Difference]: Start difference. First operand 201 states and 236 transitions. Second operand has 3 states, 2 states have (on average 12.5) internal successors, (25), 3 states have internal predecessors, (25), 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) [2024-11-13 23:28:49,091 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-13 23:28:49,092 INFO L93 Difference]: Finished difference Result 197 states and 224 transitions. [2024-11-13 23:28:49,092 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-13 23:28:49,093 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 2 states have (on average 12.5) internal successors, (25), 3 states have internal predecessors, (25), 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 32 [2024-11-13 23:28:49,093 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-13 23:28:49,094 INFO L225 Difference]: With dead ends: 197 [2024-11-13 23:28:49,094 INFO L226 Difference]: Without dead ends: 197 [2024-11-13 23:28:49,094 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-13 23:28:49,095 INFO L432 NwaCegarLoop]: 105 mSDtfsCounter, 11 mSDsluCounter, 62 mSDsCounter, 0 mSdLazyCounter, 101 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 11 SdHoareTripleChecker+Valid, 167 SdHoareTripleChecker+Invalid, 104 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 101 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-11-13 23:28:49,095 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [11 Valid, 167 Invalid, 104 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 101 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-11-13 23:28:49,096 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 197 states. [2024-11-13 23:28:49,100 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 197 to 197. [2024-11-13 23:28:49,101 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 197 states, 139 states have (on average 1.5827338129496402) internal successors, (220), 192 states have internal predecessors, (220), 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) [2024-11-13 23:28:49,102 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 197 states to 197 states and 224 transitions. [2024-11-13 23:28:49,102 INFO L78 Accepts]: Start accepts. Automaton has 197 states and 224 transitions. Word has length 32 [2024-11-13 23:28:49,103 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-13 23:28:49,103 INFO L471 AbstractCegarLoop]: Abstraction has 197 states and 224 transitions. [2024-11-13 23:28:49,103 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 2 states have (on average 12.5) internal successors, (25), 3 states have internal predecessors, (25), 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) [2024-11-13 23:28:49,103 INFO L276 IsEmpty]: Start isEmpty. Operand 197 states and 224 transitions. [2024-11-13 23:28:49,104 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 33 [2024-11-13 23:28:49,104 INFO L207 NwaCegarLoop]: Found error trace [2024-11-13 23:28:49,104 INFO L215 NwaCegarLoop]: trace histogram [3, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-13 23:28:49,104 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable15 [2024-11-13 23:28:49,104 INFO L396 AbstractCegarLoop]: === Iteration 17 === Targeting create_dataErr25REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [create_dataErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, create_dataErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, create_dataErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 89 more)] === [2024-11-13 23:28:49,105 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-13 23:28:49,105 INFO L85 PathProgramCache]: Analyzing trace with hash 859411862, now seen corresponding path program 1 times [2024-11-13 23:28:49,105 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2024-11-13 23:28:49,105 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [558340022] [2024-11-13 23:28:49,105 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-13 23:28:49,105 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-13 23:28:49,132 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 23:28:49,225 INFO L134 CoverageAnalysis]: Checked inductivity of 12 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 12 trivial. 0 not checked. [2024-11-13 23:28:49,225 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2024-11-13 23:28:49,225 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [558340022] [2024-11-13 23:28:49,225 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [558340022] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-13 23:28:49,225 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-13 23:28:49,225 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-11-13 23:28:49,226 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [135498472] [2024-11-13 23:28:49,226 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-13 23:28:49,226 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-13 23:28:49,226 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2024-11-13 23:28:49,226 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-13 23:28:49,227 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-13 23:28:49,227 INFO L87 Difference]: Start difference. First operand 197 states and 224 transitions. Second operand has 3 states, 2 states have (on average 12.5) internal successors, (25), 3 states have internal predecessors, (25), 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) [2024-11-13 23:28:49,381 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-13 23:28:49,381 INFO L93 Difference]: Finished difference Result 193 states and 212 transitions. [2024-11-13 23:28:49,382 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-13 23:28:49,382 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 2 states have (on average 12.5) internal successors, (25), 3 states have internal predecessors, (25), 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 32 [2024-11-13 23:28:49,382 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-13 23:28:49,383 INFO L225 Difference]: With dead ends: 193 [2024-11-13 23:28:49,384 INFO L226 Difference]: Without dead ends: 193 [2024-11-13 23:28:49,384 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-13 23:28:49,384 INFO L432 NwaCegarLoop]: 101 mSDtfsCounter, 11 mSDsluCounter, 63 mSDsCounter, 0 mSdLazyCounter, 96 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 11 SdHoareTripleChecker+Valid, 164 SdHoareTripleChecker+Invalid, 99 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 96 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-11-13 23:28:49,385 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [11 Valid, 164 Invalid, 99 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 96 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-11-13 23:28:49,385 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 193 states. [2024-11-13 23:28:49,389 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 193 to 193. [2024-11-13 23:28:49,390 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 193 states, 139 states have (on average 1.4964028776978417) internal successors, (208), 188 states have internal predecessors, (208), 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) [2024-11-13 23:28:49,391 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 193 states to 193 states and 212 transitions. [2024-11-13 23:28:49,391 INFO L78 Accepts]: Start accepts. Automaton has 193 states and 212 transitions. Word has length 32 [2024-11-13 23:28:49,392 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-13 23:28:49,392 INFO L471 AbstractCegarLoop]: Abstraction has 193 states and 212 transitions. [2024-11-13 23:28:49,392 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 2 states have (on average 12.5) internal successors, (25), 3 states have internal predecessors, (25), 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) [2024-11-13 23:28:49,392 INFO L276 IsEmpty]: Start isEmpty. Operand 193 states and 212 transitions. [2024-11-13 23:28:49,393 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 36 [2024-11-13 23:28:49,393 INFO L207 NwaCegarLoop]: Found error trace [2024-11-13 23:28:49,393 INFO L215 NwaCegarLoop]: trace histogram [3, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-13 23:28:49,394 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable16 [2024-11-13 23:28:49,394 INFO L396 AbstractCegarLoop]: === Iteration 18 === Targeting ULTIMATE.startErr6REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [create_dataErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, create_dataErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, create_dataErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 89 more)] === [2024-11-13 23:28:49,394 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-13 23:28:49,394 INFO L85 PathProgramCache]: Analyzing trace with hash 437822326, now seen corresponding path program 1 times [2024-11-13 23:28:49,395 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2024-11-13 23:28:49,395 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1825629350] [2024-11-13 23:28:49,395 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-13 23:28:49,395 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-13 23:28:49,429 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 23:28:49,891 INFO L134 CoverageAnalysis]: Checked inductivity of 12 backedges. 0 proven. 7 refuted. 0 times theorem prover too weak. 5 trivial. 0 not checked. [2024-11-13 23:28:49,891 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2024-11-13 23:28:49,892 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1825629350] [2024-11-13 23:28:49,892 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1825629350] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-13 23:28:49,892 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1217371098] [2024-11-13 23:28:49,892 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-13 23:28:49,892 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-13 23:28:49,892 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_2bb9ae36-a0c5-4c2e-87da-07b477e49f29/bin/utaipan-verify-sOmjnqqW8E/z3 [2024-11-13 23:28:49,894 INFO L229 MonitoredProcess]: Starting monitored process 6 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_2bb9ae36-a0c5-4c2e-87da-07b477e49f29/bin/utaipan-verify-sOmjnqqW8E/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-11-13 23:28:49,899 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_2bb9ae36-a0c5-4c2e-87da-07b477e49f29/bin/utaipan-verify-sOmjnqqW8E/z3 -smt2 -in SMTLIB2_COMPLIANT=true (6)] Waiting until timeout for monitored process [2024-11-13 23:28:50,049 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 23:28:50,050 INFO L255 TraceCheckSpWp]: Trace formula consists of 310 conjuncts, 11 conjuncts are in the unsatisfiable core [2024-11-13 23:28:50,054 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-13 23:28:50,061 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 6 treesize of output 5 [2024-11-13 23:28:50,091 WARN L873 $PredicateComparison]: unable to prove that (or (exists ((create_data_~data~0.base Int) (|create_data_#t~malloc7.base| Int)) (and (= (select |c_old(#valid)| create_data_~data~0.base) 0) (= |c_#valid| (store (store |c_old(#valid)| create_data_~data~0.base (select |c_#valid| create_data_~data~0.base)) |create_data_#t~malloc7.base| 1)) (not (= create_data_~data~0.base |create_data_#t~malloc7.base|)))) (exists ((create_data_~data~0.base Int)) (and (= |c_#valid| (store |c_old(#valid)| create_data_~data~0.base 1)) (= (select |c_old(#valid)| create_data_~data~0.base) 0)))) is different from true [2024-11-13 23:28:50,530 INFO L349 Elim1Store]: treesize reduction 104, result has 34.2 percent of original size [2024-11-13 23:28:50,530 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 2 stores, 3 select indices, 3 select index equivalence classes, 0 disjoint index pairs (out of 3 index pairs), introduced 5 new quantified variables, introduced 9 case distinctions, treesize of input 40 treesize of output 104 [2024-11-13 23:28:50,849 INFO L173 IndexEqualityManager]: detected equality via solver [2024-11-13 23:28:50,873 INFO L349 Elim1Store]: treesize reduction 49, result has 9.3 percent of original size [2024-11-13 23:28:50,874 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 3 select indices, 3 select index equivalence classes, 1 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 3 case distinctions, treesize of input 27 treesize of output 15 [2024-11-13 23:28:50,896 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-11-13 23:28:50,909 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-11-13 23:28:50,911 INFO L173 IndexEqualityManager]: detected equality via solver [2024-11-13 23:28:50,919 INFO L349 Elim1Store]: treesize reduction 62, result has 1.6 percent of original size [2024-11-13 23:28:50,919 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 3 select indices, 3 select index equivalence classes, 4 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 5 case distinctions, treesize of input 32 treesize of output 1 [2024-11-13 23:28:50,945 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-11-13 23:28:50,950 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-11-13 23:28:50,951 INFO L173 IndexEqualityManager]: detected equality via solver [2024-11-13 23:28:50,954 INFO L349 Elim1Store]: treesize reduction 9, result has 10.0 percent of original size [2024-11-13 23:28:50,955 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 3 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 2 case distinctions, treesize of input 22 treesize of output 12 [2024-11-13 23:28:50,971 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-11-13 23:28:50,974 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-11-13 23:28:50,977 INFO L173 IndexEqualityManager]: detected equality via solver [2024-11-13 23:28:50,992 INFO L349 Elim1Store]: treesize reduction 93, result has 1.1 percent of original size [2024-11-13 23:28:50,992 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 3 select indices, 3 select index equivalence classes, 3 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 6 case distinctions, treesize of input 30 treesize of output 1 [2024-11-13 23:28:51,149 INFO L134 CoverageAnalysis]: Checked inductivity of 12 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 12 trivial. 0 not checked. [2024-11-13 23:28:51,151 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-11-13 23:28:51,151 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1217371098] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-13 23:28:51,151 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2024-11-13 23:28:51,151 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [8] total 9 [2024-11-13 23:28:51,152 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2002198313] [2024-11-13 23:28:51,152 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-13 23:28:51,152 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2024-11-13 23:28:51,152 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2024-11-13 23:28:51,153 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2024-11-13 23:28:51,153 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=20, Invalid=55, Unknown=1, NotChecked=14, Total=90 [2024-11-13 23:28:51,153 INFO L87 Difference]: Start difference. First operand 193 states and 212 transitions. Second operand has 5 states, 4 states have (on average 6.75) internal successors, (27), 5 states have internal predecessors, (27), 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) [2024-11-13 23:28:51,358 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-13 23:28:51,359 INFO L93 Difference]: Finished difference Result 221 states and 250 transitions. [2024-11-13 23:28:51,359 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-11-13 23:28:51,359 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 4 states have (on average 6.75) internal successors, (27), 5 states have internal predecessors, (27), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 35 [2024-11-13 23:28:51,360 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-13 23:28:51,361 INFO L225 Difference]: With dead ends: 221 [2024-11-13 23:28:51,361 INFO L226 Difference]: Without dead ends: 221 [2024-11-13 23:28:51,361 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 43 GetRequests, 34 SyntacticMatches, 1 SemanticMatches, 8 ConstructedPredicates, 1 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=20, Invalid=55, Unknown=1, NotChecked=14, Total=90 [2024-11-13 23:28:51,362 INFO L432 NwaCegarLoop]: 100 mSDtfsCounter, 20 mSDsluCounter, 108 mSDsCounter, 0 mSdLazyCounter, 157 mSolverCounterSat, 5 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 20 SdHoareTripleChecker+Valid, 208 SdHoareTripleChecker+Invalid, 358 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 5 IncrementalHoareTripleChecker+Valid, 157 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 196 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2024-11-13 23:28:51,362 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [20 Valid, 208 Invalid, 358 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [5 Valid, 157 Invalid, 0 Unknown, 196 Unchecked, 0.2s Time] [2024-11-13 23:28:51,363 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 221 states. [2024-11-13 23:28:51,367 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 221 to 209. [2024-11-13 23:28:51,368 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 209 states, 153 states have (on average 1.4901960784313726) internal successors, (228), 202 states have internal predecessors, (228), 2 states have call successors, (2), 2 states have call predecessors, (2), 4 states have return successors, (4), 4 states have call predecessors, (4), 2 states have call successors, (4) [2024-11-13 23:28:51,369 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 209 states to 209 states and 234 transitions. [2024-11-13 23:28:51,369 INFO L78 Accepts]: Start accepts. Automaton has 209 states and 234 transitions. Word has length 35 [2024-11-13 23:28:51,369 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-13 23:28:51,370 INFO L471 AbstractCegarLoop]: Abstraction has 209 states and 234 transitions. [2024-11-13 23:28:51,370 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 4 states have (on average 6.75) internal successors, (27), 5 states have internal predecessors, (27), 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) [2024-11-13 23:28:51,370 INFO L276 IsEmpty]: Start isEmpty. Operand 209 states and 234 transitions. [2024-11-13 23:28:51,370 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 36 [2024-11-13 23:28:51,371 INFO L207 NwaCegarLoop]: Found error trace [2024-11-13 23:28:51,371 INFO L215 NwaCegarLoop]: trace histogram [3, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-13 23:28:51,394 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_2bb9ae36-a0c5-4c2e-87da-07b477e49f29/bin/utaipan-verify-sOmjnqqW8E/z3 -smt2 -in SMTLIB2_COMPLIANT=true (6)] Ended with exit code 0 [2024-11-13 23:28:51,575 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 6 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_2bb9ae36-a0c5-4c2e-87da-07b477e49f29/bin/utaipan-verify-sOmjnqqW8E/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable17 [2024-11-13 23:28:51,575 INFO L396 AbstractCegarLoop]: === Iteration 19 === Targeting ULTIMATE.startErr7REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [create_dataErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, create_dataErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, create_dataErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 89 more)] === [2024-11-13 23:28:51,575 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-13 23:28:51,575 INFO L85 PathProgramCache]: Analyzing trace with hash 437822327, now seen corresponding path program 1 times [2024-11-13 23:28:51,575 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2024-11-13 23:28:51,575 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1350962240] [2024-11-13 23:28:51,575 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-13 23:28:51,576 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-13 23:28:51,617 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 23:28:52,149 INFO L134 CoverageAnalysis]: Checked inductivity of 12 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 12 trivial. 0 not checked. [2024-11-13 23:28:52,149 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2024-11-13 23:28:52,149 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1350962240] [2024-11-13 23:28:52,149 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1350962240] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-13 23:28:52,149 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-13 23:28:52,149 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2024-11-13 23:28:52,150 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [100304009] [2024-11-13 23:28:52,150 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-13 23:28:52,150 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2024-11-13 23:28:52,150 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2024-11-13 23:28:52,150 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2024-11-13 23:28:52,151 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=22, Invalid=50, Unknown=0, NotChecked=0, Total=72 [2024-11-13 23:28:52,151 INFO L87 Difference]: Start difference. First operand 209 states and 234 transitions. Second operand has 9 states, 8 states have (on average 3.375) internal successors, (27), 8 states have internal predecessors, (27), 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) [2024-11-13 23:28:52,541 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-13 23:28:52,541 INFO L93 Difference]: Finished difference Result 220 states and 245 transitions. [2024-11-13 23:28:52,542 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2024-11-13 23:28:52,542 INFO L78 Accepts]: Start accepts. Automaton has has 9 states, 8 states have (on average 3.375) internal successors, (27), 8 states have internal predecessors, (27), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 35 [2024-11-13 23:28:52,542 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-13 23:28:52,543 INFO L225 Difference]: With dead ends: 220 [2024-11-13 23:28:52,543 INFO L226 Difference]: Without dead ends: 220 [2024-11-13 23:28:52,544 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 8 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=22, Invalid=50, Unknown=0, NotChecked=0, Total=72 [2024-11-13 23:28:52,544 INFO L432 NwaCegarLoop]: 89 mSDtfsCounter, 54 mSDsluCounter, 121 mSDsCounter, 0 mSdLazyCounter, 219 mSolverCounterSat, 12 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 54 SdHoareTripleChecker+Valid, 210 SdHoareTripleChecker+Invalid, 231 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 12 IncrementalHoareTripleChecker+Valid, 219 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2024-11-13 23:28:52,544 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [54 Valid, 210 Invalid, 231 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [12 Valid, 219 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time] [2024-11-13 23:28:52,545 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 220 states. [2024-11-13 23:28:52,549 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 220 to 217. [2024-11-13 23:28:52,549 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 217 states, 159 states have (on average 1.471698113207547) internal successors, (234), 208 states have internal predecessors, (234), 2 states have call successors, (2), 2 states have call predecessors, (2), 6 states have return successors, (6), 6 states have call predecessors, (6), 2 states have call successors, (6) [2024-11-13 23:28:52,551 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 217 states to 217 states and 242 transitions. [2024-11-13 23:28:52,551 INFO L78 Accepts]: Start accepts. Automaton has 217 states and 242 transitions. Word has length 35 [2024-11-13 23:28:52,551 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-13 23:28:52,551 INFO L471 AbstractCegarLoop]: Abstraction has 217 states and 242 transitions. [2024-11-13 23:28:52,551 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 8 states have (on average 3.375) internal successors, (27), 8 states have internal predecessors, (27), 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) [2024-11-13 23:28:52,551 INFO L276 IsEmpty]: Start isEmpty. Operand 217 states and 242 transitions. [2024-11-13 23:28:52,552 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 37 [2024-11-13 23:28:52,552 INFO L207 NwaCegarLoop]: Found error trace [2024-11-13 23:28:52,552 INFO L215 NwaCegarLoop]: trace histogram [3, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-13 23:28:52,552 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable18 [2024-11-13 23:28:52,552 INFO L396 AbstractCegarLoop]: === Iteration 20 === Targeting ULTIMATE.startErr6REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [create_dataErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, create_dataErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, create_dataErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 89 more)] === [2024-11-13 23:28:52,553 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-13 23:28:52,553 INFO L85 PathProgramCache]: Analyzing trace with hash -564473703, now seen corresponding path program 1 times [2024-11-13 23:28:52,553 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2024-11-13 23:28:52,553 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1389369357] [2024-11-13 23:28:52,553 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-13 23:28:52,553 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-13 23:28:52,575 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 23:28:52,739 INFO L134 CoverageAnalysis]: Checked inductivity of 12 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 12 trivial. 0 not checked. [2024-11-13 23:28:52,740 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2024-11-13 23:28:52,740 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1389369357] [2024-11-13 23:28:52,740 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1389369357] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-13 23:28:52,740 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-13 23:28:52,740 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2024-11-13 23:28:52,740 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [164528383] [2024-11-13 23:28:52,740 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-13 23:28:52,741 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2024-11-13 23:28:52,741 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2024-11-13 23:28:52,741 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2024-11-13 23:28:52,742 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2024-11-13 23:28:52,742 INFO L87 Difference]: Start difference. First operand 217 states and 242 transitions. Second operand has 5 states, 5 states have (on average 5.6) internal successors, (28), 5 states have internal predecessors, (28), 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) [2024-11-13 23:28:52,876 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-13 23:28:52,876 INFO L93 Difference]: Finished difference Result 248 states and 280 transitions. [2024-11-13 23:28:52,877 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-11-13 23:28:52,877 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 5.6) internal successors, (28), 5 states have internal predecessors, (28), 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 36 [2024-11-13 23:28:52,877 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-13 23:28:52,878 INFO L225 Difference]: With dead ends: 248 [2024-11-13 23:28:52,878 INFO L226 Difference]: Without dead ends: 248 [2024-11-13 23:28:52,878 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2024-11-13 23:28:52,879 INFO L432 NwaCegarLoop]: 107 mSDtfsCounter, 11 mSDsluCounter, 108 mSDsCounter, 0 mSdLazyCounter, 99 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 11 SdHoareTripleChecker+Valid, 215 SdHoareTripleChecker+Invalid, 102 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 99 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-11-13 23:28:52,879 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [11 Valid, 215 Invalid, 102 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 99 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-11-13 23:28:52,880 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 248 states. [2024-11-13 23:28:52,884 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 248 to 225. [2024-11-13 23:28:52,884 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 225 states, 167 states have (on average 1.4550898203592815) internal successors, (243), 216 states have internal predecessors, (243), 2 states have call successors, (2), 2 states have call predecessors, (2), 6 states have return successors, (6), 6 states have call predecessors, (6), 2 states have call successors, (6) [2024-11-13 23:28:52,885 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 225 states to 225 states and 251 transitions. [2024-11-13 23:28:52,886 INFO L78 Accepts]: Start accepts. Automaton has 225 states and 251 transitions. Word has length 36 [2024-11-13 23:28:52,886 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-13 23:28:52,886 INFO L471 AbstractCegarLoop]: Abstraction has 225 states and 251 transitions. [2024-11-13 23:28:52,886 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 5.6) internal successors, (28), 5 states have internal predecessors, (28), 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) [2024-11-13 23:28:52,886 INFO L276 IsEmpty]: Start isEmpty. Operand 225 states and 251 transitions. [2024-11-13 23:28:52,887 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 37 [2024-11-13 23:28:52,887 INFO L207 NwaCegarLoop]: Found error trace [2024-11-13 23:28:52,887 INFO L215 NwaCegarLoop]: trace histogram [3, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-13 23:28:52,887 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable19 [2024-11-13 23:28:52,887 INFO L396 AbstractCegarLoop]: === Iteration 21 === Targeting ULTIMATE.startErr14REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [create_dataErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, create_dataErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, create_dataErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 89 more)] === [2024-11-13 23:28:52,887 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-13 23:28:52,888 INFO L85 PathProgramCache]: Analyzing trace with hash 687594731, now seen corresponding path program 1 times [2024-11-13 23:28:52,888 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2024-11-13 23:28:52,888 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [89024538] [2024-11-13 23:28:52,888 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-13 23:28:52,888 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-13 23:28:52,917 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 23:28:53,253 INFO L134 CoverageAnalysis]: Checked inductivity of 12 backedges. 0 proven. 7 refuted. 0 times theorem prover too weak. 5 trivial. 0 not checked. [2024-11-13 23:28:53,253 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2024-11-13 23:28:53,253 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [89024538] [2024-11-13 23:28:53,253 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [89024538] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-13 23:28:53,253 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [315554856] [2024-11-13 23:28:53,253 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-13 23:28:53,254 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-13 23:28:53,254 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_2bb9ae36-a0c5-4c2e-87da-07b477e49f29/bin/utaipan-verify-sOmjnqqW8E/z3 [2024-11-13 23:28:53,256 INFO L229 MonitoredProcess]: Starting monitored process 7 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_2bb9ae36-a0c5-4c2e-87da-07b477e49f29/bin/utaipan-verify-sOmjnqqW8E/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-11-13 23:28:53,258 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_2bb9ae36-a0c5-4c2e-87da-07b477e49f29/bin/utaipan-verify-sOmjnqqW8E/z3 -smt2 -in SMTLIB2_COMPLIANT=true (7)] Waiting until timeout for monitored process [2024-11-13 23:28:53,423 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 23:28:53,425 INFO L255 TraceCheckSpWp]: Trace formula consists of 326 conjuncts, 10 conjuncts are in the unsatisfiable core [2024-11-13 23:28:53,427 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-13 23:28:53,465 WARN L873 $PredicateComparison]: unable to prove that (or (exists ((create_data_~data~0.base Int) (|create_data_#t~malloc7.base| Int)) (and (= (select |c_old(#valid)| create_data_~data~0.base) 0) (= |c_#valid| (store (store |c_old(#valid)| create_data_~data~0.base (select |c_#valid| create_data_~data~0.base)) |create_data_#t~malloc7.base| 1)) (not (= create_data_~data~0.base |create_data_#t~malloc7.base|)))) (exists ((create_data_~data~0.base Int)) (and (= |c_#valid| (store |c_old(#valid)| create_data_~data~0.base 1)) (= (select |c_old(#valid)| create_data_~data~0.base) 0)))) is different from true [2024-11-13 23:28:53,881 INFO L349 Elim1Store]: treesize reduction 104, result has 34.2 percent of original size [2024-11-13 23:28:53,881 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 2 stores, 3 select indices, 3 select index equivalence classes, 0 disjoint index pairs (out of 3 index pairs), introduced 5 new quantified variables, introduced 9 case distinctions, treesize of input 40 treesize of output 104 [2024-11-13 23:28:54,192 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-11-13 23:28:54,194 INFO L173 IndexEqualityManager]: detected equality via solver [2024-11-13 23:28:54,197 INFO L173 IndexEqualityManager]: detected equality via solver [2024-11-13 23:28:54,207 INFO L349 Elim1Store]: treesize reduction 15, result has 25.0 percent of original size [2024-11-13 23:28:54,207 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 3 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 20 treesize of output 12 [2024-11-13 23:28:54,405 INFO L349 Elim1Store]: treesize reduction 260, result has 26.3 percent of original size [2024-11-13 23:28:54,405 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 2 stores, 4 select indices, 4 select index equivalence classes, 1 disjoint index pairs (out of 6 index pairs), introduced 6 new quantified variables, introduced 14 case distinctions, treesize of input 58 treesize of output 165 [2024-11-13 23:28:55,009 INFO L173 IndexEqualityManager]: detected equality via solver [2024-11-13 23:28:55,010 INFO L173 IndexEqualityManager]: detected equality via solver [2024-11-13 23:28:55,018 INFO L349 Elim1Store]: treesize reduction 75, result has 1.3 percent of original size [2024-11-13 23:28:55,019 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 4 select indices, 4 select index equivalence classes, 3 disjoint index pairs (out of 6 index pairs), introduced 4 new quantified variables, introduced 6 case distinctions, treesize of input 46 treesize of output 17 [2024-11-13 23:28:55,400 INFO L173 IndexEqualityManager]: detected equality via solver [2024-11-13 23:28:55,409 INFO L349 Elim1Store]: treesize reduction 15, result has 25.0 percent of original size [2024-11-13 23:28:55,409 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 2 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 22 treesize of output 12 [2024-11-13 23:28:55,927 INFO L134 CoverageAnalysis]: Checked inductivity of 12 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 12 trivial. 0 not checked. [2024-11-13 23:28:55,928 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-11-13 23:28:55,928 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [315554856] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-13 23:28:55,928 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2024-11-13 23:28:55,928 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [8] total 9 [2024-11-13 23:28:55,928 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1373984216] [2024-11-13 23:28:55,928 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-13 23:28:55,929 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2024-11-13 23:28:55,929 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2024-11-13 23:28:55,930 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2024-11-13 23:28:55,930 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=20, Invalid=55, Unknown=1, NotChecked=14, Total=90 [2024-11-13 23:28:55,930 INFO L87 Difference]: Start difference. First operand 225 states and 251 transitions. Second operand has 5 states, 4 states have (on average 7.0) internal successors, (28), 5 states have internal predecessors, (28), 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) [2024-11-13 23:28:56,107 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-13 23:28:56,107 INFO L93 Difference]: Finished difference Result 236 states and 266 transitions. [2024-11-13 23:28:56,108 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-11-13 23:28:56,108 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 4 states have (on average 7.0) internal successors, (28), 5 states have internal predecessors, (28), 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 36 [2024-11-13 23:28:56,108 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-13 23:28:56,109 INFO L225 Difference]: With dead ends: 236 [2024-11-13 23:28:56,109 INFO L226 Difference]: Without dead ends: 236 [2024-11-13 23:28:56,109 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 44 GetRequests, 35 SyntacticMatches, 1 SemanticMatches, 8 ConstructedPredicates, 1 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=20, Invalid=55, Unknown=1, NotChecked=14, Total=90 [2024-11-13 23:28:56,110 INFO L432 NwaCegarLoop]: 102 mSDtfsCounter, 15 mSDsluCounter, 110 mSDsCounter, 0 mSdLazyCounter, 160 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 15 SdHoareTripleChecker+Valid, 212 SdHoareTripleChecker+Invalid, 358 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 160 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 196 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2024-11-13 23:28:56,110 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [15 Valid, 212 Invalid, 358 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 160 Invalid, 0 Unknown, 196 Unchecked, 0.2s Time] [2024-11-13 23:28:56,111 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 236 states. [2024-11-13 23:28:56,116 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 236 to 226. [2024-11-13 23:28:56,117 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 226 states, 168 states have (on average 1.4583333333333333) internal successors, (245), 217 states have internal predecessors, (245), 2 states have call successors, (2), 2 states have call predecessors, (2), 6 states have return successors, (6), 6 states have call predecessors, (6), 2 states have call successors, (6) [2024-11-13 23:28:56,119 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 226 states to 226 states and 253 transitions. [2024-11-13 23:28:56,119 INFO L78 Accepts]: Start accepts. Automaton has 226 states and 253 transitions. Word has length 36 [2024-11-13 23:28:56,119 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-13 23:28:56,119 INFO L471 AbstractCegarLoop]: Abstraction has 226 states and 253 transitions. [2024-11-13 23:28:56,119 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 4 states have (on average 7.0) internal successors, (28), 5 states have internal predecessors, (28), 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) [2024-11-13 23:28:56,120 INFO L276 IsEmpty]: Start isEmpty. Operand 226 states and 253 transitions. [2024-11-13 23:28:56,121 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 37 [2024-11-13 23:28:56,121 INFO L207 NwaCegarLoop]: Found error trace [2024-11-13 23:28:56,121 INFO L215 NwaCegarLoop]: trace histogram [3, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-13 23:28:56,141 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_2bb9ae36-a0c5-4c2e-87da-07b477e49f29/bin/utaipan-verify-sOmjnqqW8E/z3 -smt2 -in SMTLIB2_COMPLIANT=true (7)] Ended with exit code 0 [2024-11-13 23:28:56,321 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable20,7 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_2bb9ae36-a0c5-4c2e-87da-07b477e49f29/bin/utaipan-verify-sOmjnqqW8E/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-13 23:28:56,321 INFO L396 AbstractCegarLoop]: === Iteration 22 === Targeting ULTIMATE.startErr15REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [create_dataErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, create_dataErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, create_dataErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 89 more)] === [2024-11-13 23:28:56,322 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-13 23:28:56,322 INFO L85 PathProgramCache]: Analyzing trace with hash 687594732, now seen corresponding path program 1 times [2024-11-13 23:28:56,322 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2024-11-13 23:28:56,322 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1717538842] [2024-11-13 23:28:56,322 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-13 23:28:56,322 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-13 23:28:56,360 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 23:28:56,887 INFO L134 CoverageAnalysis]: Checked inductivity of 12 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 12 trivial. 0 not checked. [2024-11-13 23:28:56,888 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2024-11-13 23:28:56,888 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1717538842] [2024-11-13 23:28:56,888 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1717538842] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-13 23:28:56,888 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-13 23:28:56,888 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2024-11-13 23:28:56,888 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [556359737] [2024-11-13 23:28:56,888 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-13 23:28:56,889 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2024-11-13 23:28:56,889 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2024-11-13 23:28:56,889 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2024-11-13 23:28:56,890 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=23, Invalid=67, Unknown=0, NotChecked=0, Total=90 [2024-11-13 23:28:56,890 INFO L87 Difference]: Start difference. First operand 226 states and 253 transitions. Second operand has 10 states, 9 states have (on average 3.111111111111111) internal successors, (28), 9 states have internal predecessors, (28), 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) [2024-11-13 23:28:57,589 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-13 23:28:57,589 INFO L93 Difference]: Finished difference Result 229 states and 254 transitions. [2024-11-13 23:28:57,593 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2024-11-13 23:28:57,593 INFO L78 Accepts]: Start accepts. Automaton has has 10 states, 9 states have (on average 3.111111111111111) internal successors, (28), 9 states have internal predecessors, (28), 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 36 [2024-11-13 23:28:57,593 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-13 23:28:57,594 INFO L225 Difference]: With dead ends: 229 [2024-11-13 23:28:57,595 INFO L226 Difference]: Without dead ends: 229 [2024-11-13 23:28:57,595 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 12 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 8 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=41, Invalid=115, Unknown=0, NotChecked=0, Total=156 [2024-11-13 23:28:57,596 INFO L432 NwaCegarLoop]: 67 mSDtfsCounter, 126 mSDsluCounter, 221 mSDsCounter, 0 mSdLazyCounter, 434 mSolverCounterSat, 15 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 126 SdHoareTripleChecker+Valid, 288 SdHoareTripleChecker+Invalid, 449 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 15 IncrementalHoareTripleChecker+Valid, 434 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.6s IncrementalHoareTripleChecker+Time [2024-11-13 23:28:57,597 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [126 Valid, 288 Invalid, 449 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [15 Valid, 434 Invalid, 0 Unknown, 0 Unchecked, 0.6s Time] [2024-11-13 23:28:57,597 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 229 states. [2024-11-13 23:28:57,602 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 229 to 226. [2024-11-13 23:28:57,604 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 226 states, 169 states have (on average 1.4497041420118344) internal successors, (245), 217 states have internal predecessors, (245), 2 states have call successors, (2), 2 states have call predecessors, (2), 6 states have return successors, (6), 6 states have call predecessors, (6), 2 states have call successors, (6) [2024-11-13 23:28:57,605 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 226 states to 226 states and 253 transitions. [2024-11-13 23:28:57,605 INFO L78 Accepts]: Start accepts. Automaton has 226 states and 253 transitions. Word has length 36 [2024-11-13 23:28:57,605 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-13 23:28:57,605 INFO L471 AbstractCegarLoop]: Abstraction has 226 states and 253 transitions. [2024-11-13 23:28:57,606 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 9 states have (on average 3.111111111111111) internal successors, (28), 9 states have internal predecessors, (28), 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) [2024-11-13 23:28:57,606 INFO L276 IsEmpty]: Start isEmpty. Operand 226 states and 253 transitions. [2024-11-13 23:28:57,606 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 37 [2024-11-13 23:28:57,606 INFO L207 NwaCegarLoop]: Found error trace [2024-11-13 23:28:57,607 INFO L215 NwaCegarLoop]: trace histogram [3, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-13 23:28:57,607 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable21 [2024-11-13 23:28:57,607 INFO L396 AbstractCegarLoop]: === Iteration 23 === Targeting ULTIMATE.startErr6REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [create_dataErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, create_dataErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, create_dataErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 89 more)] === [2024-11-13 23:28:57,608 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-13 23:28:57,608 INFO L85 PathProgramCache]: Analyzing trace with hash 248013098, now seen corresponding path program 1 times [2024-11-13 23:28:57,609 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2024-11-13 23:28:57,609 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [825516906] [2024-11-13 23:28:57,609 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-13 23:28:57,609 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-13 23:28:57,630 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 23:28:57,681 INFO L134 CoverageAnalysis]: Checked inductivity of 12 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 12 trivial. 0 not checked. [2024-11-13 23:28:57,681 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2024-11-13 23:28:57,682 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [825516906] [2024-11-13 23:28:57,682 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [825516906] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-13 23:28:57,682 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-13 23:28:57,682 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2024-11-13 23:28:57,682 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [177677084] [2024-11-13 23:28:57,682 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-13 23:28:57,682 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-11-13 23:28:57,683 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2024-11-13 23:28:57,683 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-11-13 23:28:57,683 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-11-13 23:28:57,683 INFO L87 Difference]: Start difference. First operand 226 states and 253 transitions. Second operand has 4 states, 4 states have (on average 7.0) internal successors, (28), 4 states have internal predecessors, (28), 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) [2024-11-13 23:28:57,774 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-13 23:28:57,774 INFO L93 Difference]: Finished difference Result 232 states and 257 transitions. [2024-11-13 23:28:57,774 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-11-13 23:28:57,775 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 7.0) internal successors, (28), 4 states have internal predecessors, (28), 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 36 [2024-11-13 23:28:57,775 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-13 23:28:57,776 INFO L225 Difference]: With dead ends: 232 [2024-11-13 23:28:57,776 INFO L226 Difference]: Without dead ends: 232 [2024-11-13 23:28:57,776 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-11-13 23:28:57,777 INFO L432 NwaCegarLoop]: 107 mSDtfsCounter, 1 mSDsluCounter, 208 mSDsCounter, 0 mSdLazyCounter, 88 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1 SdHoareTripleChecker+Valid, 315 SdHoareTripleChecker+Invalid, 90 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 88 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-11-13 23:28:57,777 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [1 Valid, 315 Invalid, 90 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 88 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-11-13 23:28:57,777 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 232 states. [2024-11-13 23:28:57,781 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 232 to 232. [2024-11-13 23:28:57,782 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 232 states, 175 states have (on average 1.4228571428571428) internal successors, (249), 223 states have internal predecessors, (249), 2 states have call successors, (2), 2 states have call predecessors, (2), 6 states have return successors, (6), 6 states have call predecessors, (6), 2 states have call successors, (6) [2024-11-13 23:28:57,783 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 232 states to 232 states and 257 transitions. [2024-11-13 23:28:57,783 INFO L78 Accepts]: Start accepts. Automaton has 232 states and 257 transitions. Word has length 36 [2024-11-13 23:28:57,783 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-13 23:28:57,783 INFO L471 AbstractCegarLoop]: Abstraction has 232 states and 257 transitions. [2024-11-13 23:28:57,784 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 7.0) internal successors, (28), 4 states have internal predecessors, (28), 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) [2024-11-13 23:28:57,784 INFO L276 IsEmpty]: Start isEmpty. Operand 232 states and 257 transitions. [2024-11-13 23:28:57,784 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 38 [2024-11-13 23:28:57,784 INFO L207 NwaCegarLoop]: Found error trace [2024-11-13 23:28:57,784 INFO L215 NwaCegarLoop]: trace histogram [3, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-13 23:28:57,784 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable22 [2024-11-13 23:28:57,785 INFO L396 AbstractCegarLoop]: === Iteration 24 === Targeting ULTIMATE.startErr6REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [create_dataErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, create_dataErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, create_dataErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 89 more)] === [2024-11-13 23:28:57,785 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-13 23:28:57,785 INFO L85 PathProgramCache]: Analyzing trace with hash -758392729, now seen corresponding path program 1 times [2024-11-13 23:28:57,785 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2024-11-13 23:28:57,785 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [633125026] [2024-11-13 23:28:57,786 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-13 23:28:57,786 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-13 23:28:57,812 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 23:28:58,171 INFO L134 CoverageAnalysis]: Checked inductivity of 12 backedges. 0 proven. 7 refuted. 0 times theorem prover too weak. 5 trivial. 0 not checked. [2024-11-13 23:28:58,171 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2024-11-13 23:28:58,171 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [633125026] [2024-11-13 23:28:58,171 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [633125026] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-13 23:28:58,171 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [825263233] [2024-11-13 23:28:58,171 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-13 23:28:58,171 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-13 23:28:58,172 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_2bb9ae36-a0c5-4c2e-87da-07b477e49f29/bin/utaipan-verify-sOmjnqqW8E/z3 [2024-11-13 23:28:58,174 INFO L229 MonitoredProcess]: Starting monitored process 8 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_2bb9ae36-a0c5-4c2e-87da-07b477e49f29/bin/utaipan-verify-sOmjnqqW8E/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-11-13 23:28:58,176 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_2bb9ae36-a0c5-4c2e-87da-07b477e49f29/bin/utaipan-verify-sOmjnqqW8E/z3 -smt2 -in SMTLIB2_COMPLIANT=true (8)] Waiting until timeout for monitored process [2024-11-13 23:28:58,350 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 23:28:58,352 INFO L255 TraceCheckSpWp]: Trace formula consists of 320 conjuncts, 11 conjuncts are in the unsatisfiable core [2024-11-13 23:28:58,355 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-13 23:28:58,360 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 6 treesize of output 5 [2024-11-13 23:28:58,393 WARN L873 $PredicateComparison]: unable to prove that (or (exists ((create_data_~data~0.base Int) (|create_data_#t~malloc7.base| Int)) (and (= (select |c_old(#valid)| create_data_~data~0.base) 0) (= |c_#valid| (store (store |c_old(#valid)| create_data_~data~0.base (select |c_#valid| create_data_~data~0.base)) |create_data_#t~malloc7.base| 1)) (not (= create_data_~data~0.base |create_data_#t~malloc7.base|)))) (exists ((create_data_~data~0.base Int)) (and (= |c_#valid| (store |c_old(#valid)| create_data_~data~0.base 1)) (= (select |c_old(#valid)| create_data_~data~0.base) 0)))) is different from true [2024-11-13 23:28:58,860 INFO L349 Elim1Store]: treesize reduction 104, result has 34.2 percent of original size [2024-11-13 23:28:58,861 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 2 stores, 3 select indices, 3 select index equivalence classes, 0 disjoint index pairs (out of 3 index pairs), introduced 5 new quantified variables, introduced 9 case distinctions, treesize of input 40 treesize of output 104 [2024-11-13 23:28:59,253 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 12 treesize of output 9 [2024-11-13 23:28:59,296 INFO L349 Elim1Store]: treesize reduction 43, result has 28.3 percent of original size [2024-11-13 23:28:59,296 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 3 select indices, 3 select index equivalence classes, 1 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 7 case distinctions, treesize of input 34 treesize of output 33 [2024-11-13 23:28:59,319 INFO L349 Elim1Store]: treesize reduction 15, result has 21.1 percent of original size [2024-11-13 23:28:59,319 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 3 case distinctions, treesize of input 22 treesize of output 16 [2024-11-13 23:28:59,335 INFO L349 Elim1Store]: treesize reduction 18, result has 5.3 percent of original size [2024-11-13 23:28:59,335 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 3 case distinctions, treesize of input 24 treesize of output 14 [2024-11-13 23:28:59,358 INFO L349 Elim1Store]: treesize reduction 18, result has 5.3 percent of original size [2024-11-13 23:28:59,359 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 3 case distinctions, treesize of input 24 treesize of output 14 [2024-11-13 23:28:59,374 INFO L134 CoverageAnalysis]: Checked inductivity of 12 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 12 trivial. 0 not checked. [2024-11-13 23:28:59,374 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-11-13 23:28:59,374 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [825263233] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-13 23:28:59,374 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2024-11-13 23:28:59,375 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [8] total 9 [2024-11-13 23:28:59,375 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [500610099] [2024-11-13 23:28:59,375 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-13 23:28:59,375 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2024-11-13 23:28:59,375 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2024-11-13 23:28:59,375 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2024-11-13 23:28:59,376 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=20, Invalid=55, Unknown=1, NotChecked=14, Total=90 [2024-11-13 23:28:59,376 INFO L87 Difference]: Start difference. First operand 232 states and 257 transitions. Second operand has 5 states, 4 states have (on average 7.25) internal successors, (29), 5 states have internal predecessors, (29), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2024-11-13 23:28:59,568 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-13 23:28:59,569 INFO L93 Difference]: Finished difference Result 251 states and 280 transitions. [2024-11-13 23:28:59,569 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-11-13 23:28:59,569 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 4 states have (on average 7.25) internal successors, (29), 5 states have internal predecessors, (29), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 37 [2024-11-13 23:28:59,569 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-13 23:28:59,570 INFO L225 Difference]: With dead ends: 251 [2024-11-13 23:28:59,571 INFO L226 Difference]: Without dead ends: 251 [2024-11-13 23:28:59,571 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 45 GetRequests, 36 SyntacticMatches, 1 SemanticMatches, 8 ConstructedPredicates, 1 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=20, Invalid=55, Unknown=1, NotChecked=14, Total=90 [2024-11-13 23:28:59,571 INFO L432 NwaCegarLoop]: 107 mSDtfsCounter, 18 mSDsluCounter, 109 mSDsCounter, 0 mSdLazyCounter, 155 mSolverCounterSat, 4 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 18 SdHoareTripleChecker+Valid, 216 SdHoareTripleChecker+Invalid, 355 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 4 IncrementalHoareTripleChecker+Valid, 155 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 196 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2024-11-13 23:28:59,571 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [18 Valid, 216 Invalid, 355 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [4 Valid, 155 Invalid, 0 Unknown, 196 Unchecked, 0.2s Time] [2024-11-13 23:28:59,572 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 251 states. [2024-11-13 23:28:59,578 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 251 to 242. [2024-11-13 23:28:59,578 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 242 states, 184 states have (on average 1.4130434782608696) internal successors, (260), 232 states have internal predecessors, (260), 2 states have call successors, (2), 2 states have call predecessors, (2), 7 states have return successors, (7), 7 states have call predecessors, (7), 2 states have call successors, (7) [2024-11-13 23:28:59,580 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 242 states to 242 states and 269 transitions. [2024-11-13 23:28:59,580 INFO L78 Accepts]: Start accepts. Automaton has 242 states and 269 transitions. Word has length 37 [2024-11-13 23:28:59,580 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-13 23:28:59,580 INFO L471 AbstractCegarLoop]: Abstraction has 242 states and 269 transitions. [2024-11-13 23:28:59,581 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 4 states have (on average 7.25) internal successors, (29), 5 states have internal predecessors, (29), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2024-11-13 23:28:59,581 INFO L276 IsEmpty]: Start isEmpty. Operand 242 states and 269 transitions. [2024-11-13 23:28:59,581 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 38 [2024-11-13 23:28:59,581 INFO L207 NwaCegarLoop]: Found error trace [2024-11-13 23:28:59,581 INFO L215 NwaCegarLoop]: trace histogram [3, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-13 23:28:59,603 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_2bb9ae36-a0c5-4c2e-87da-07b477e49f29/bin/utaipan-verify-sOmjnqqW8E/z3 -smt2 -in SMTLIB2_COMPLIANT=true (8)] Ended with exit code 0 [2024-11-13 23:28:59,786 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 8 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_2bb9ae36-a0c5-4c2e-87da-07b477e49f29/bin/utaipan-verify-sOmjnqqW8E/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable23 [2024-11-13 23:28:59,786 INFO L396 AbstractCegarLoop]: === Iteration 25 === Targeting ULTIMATE.startErr16REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [create_dataErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, create_dataErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, create_dataErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 89 more)] === [2024-11-13 23:28:59,787 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-13 23:28:59,787 INFO L85 PathProgramCache]: Analyzing trace with hash -159395642, now seen corresponding path program 1 times [2024-11-13 23:28:59,787 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2024-11-13 23:28:59,787 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [694641472] [2024-11-13 23:28:59,787 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-13 23:28:59,787 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-13 23:28:59,844 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 23:28:59,937 INFO L134 CoverageAnalysis]: Checked inductivity of 12 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 12 trivial. 0 not checked. [2024-11-13 23:28:59,937 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2024-11-13 23:28:59,937 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [694641472] [2024-11-13 23:28:59,937 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [694641472] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-13 23:28:59,937 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-13 23:28:59,937 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-11-13 23:28:59,938 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1060413604] [2024-11-13 23:28:59,938 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-13 23:28:59,938 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-11-13 23:28:59,938 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2024-11-13 23:28:59,938 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-11-13 23:28:59,939 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-11-13 23:28:59,939 INFO L87 Difference]: Start difference. First operand 242 states and 269 transitions. Second operand has 4 states, 3 states have (on average 9.666666666666666) internal successors, (29), 4 states have internal predecessors, (29), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2024-11-13 23:29:00,133 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-13 23:29:00,134 INFO L93 Difference]: Finished difference Result 241 states and 268 transitions. [2024-11-13 23:29:00,134 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-11-13 23:29:00,134 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 3 states have (on average 9.666666666666666) internal successors, (29), 4 states have internal predecessors, (29), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 37 [2024-11-13 23:29:00,135 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-13 23:29:00,135 INFO L225 Difference]: With dead ends: 241 [2024-11-13 23:29:00,136 INFO L226 Difference]: Without dead ends: 241 [2024-11-13 23:29:00,136 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2024-11-13 23:29:00,136 INFO L432 NwaCegarLoop]: 77 mSDtfsCounter, 60 mSDsluCounter, 92 mSDsCounter, 0 mSdLazyCounter, 160 mSolverCounterSat, 5 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 60 SdHoareTripleChecker+Valid, 169 SdHoareTripleChecker+Invalid, 165 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 5 IncrementalHoareTripleChecker+Valid, 160 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2024-11-13 23:29:00,137 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [60 Valid, 169 Invalid, 165 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [5 Valid, 160 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2024-11-13 23:29:00,137 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 241 states. [2024-11-13 23:29:00,142 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 241 to 241. [2024-11-13 23:29:00,143 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 241 states, 184 states have (on average 1.4076086956521738) internal successors, (259), 231 states have internal predecessors, (259), 2 states have call successors, (2), 2 states have call predecessors, (2), 7 states have return successors, (7), 7 states have call predecessors, (7), 2 states have call successors, (7) [2024-11-13 23:29:00,144 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 241 states to 241 states and 268 transitions. [2024-11-13 23:29:00,144 INFO L78 Accepts]: Start accepts. Automaton has 241 states and 268 transitions. Word has length 37 [2024-11-13 23:29:00,145 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-13 23:29:00,145 INFO L471 AbstractCegarLoop]: Abstraction has 241 states and 268 transitions. [2024-11-13 23:29:00,145 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 3 states have (on average 9.666666666666666) internal successors, (29), 4 states have internal predecessors, (29), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2024-11-13 23:29:00,146 INFO L276 IsEmpty]: Start isEmpty. Operand 241 states and 268 transitions. [2024-11-13 23:29:00,146 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 38 [2024-11-13 23:29:00,146 INFO L207 NwaCegarLoop]: Found error trace [2024-11-13 23:29:00,146 INFO L215 NwaCegarLoop]: trace histogram [3, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-13 23:29:00,146 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable24 [2024-11-13 23:29:00,147 INFO L396 AbstractCegarLoop]: === Iteration 26 === Targeting ULTIMATE.startErr17REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [create_dataErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, create_dataErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, create_dataErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 89 more)] === [2024-11-13 23:29:00,147 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-13 23:29:00,147 INFO L85 PathProgramCache]: Analyzing trace with hash -159395641, now seen corresponding path program 1 times [2024-11-13 23:29:00,147 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2024-11-13 23:29:00,147 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2141359878] [2024-11-13 23:29:00,147 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-13 23:29:00,147 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-13 23:29:00,175 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 23:29:00,341 INFO L134 CoverageAnalysis]: Checked inductivity of 12 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 12 trivial. 0 not checked. [2024-11-13 23:29:00,341 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2024-11-13 23:29:00,341 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2141359878] [2024-11-13 23:29:00,341 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2141359878] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-13 23:29:00,341 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-13 23:29:00,341 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2024-11-13 23:29:00,342 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1064612631] [2024-11-13 23:29:00,342 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-13 23:29:00,342 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2024-11-13 23:29:00,342 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2024-11-13 23:29:00,343 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2024-11-13 23:29:00,343 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=17, Unknown=0, NotChecked=0, Total=30 [2024-11-13 23:29:00,343 INFO L87 Difference]: Start difference. First operand 241 states and 268 transitions. Second operand has 6 states, 5 states have (on average 5.8) internal successors, (29), 6 states have internal predecessors, (29), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2024-11-13 23:29:00,518 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-13 23:29:00,519 INFO L93 Difference]: Finished difference Result 233 states and 260 transitions. [2024-11-13 23:29:00,519 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2024-11-13 23:29:00,519 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 5 states have (on average 5.8) internal successors, (29), 6 states have internal predecessors, (29), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 37 [2024-11-13 23:29:00,519 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-13 23:29:00,520 INFO L225 Difference]: With dead ends: 233 [2024-11-13 23:29:00,521 INFO L226 Difference]: Without dead ends: 233 [2024-11-13 23:29:00,521 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=19, Invalid=23, Unknown=0, NotChecked=0, Total=42 [2024-11-13 23:29:00,523 INFO L432 NwaCegarLoop]: 76 mSDtfsCounter, 134 mSDsluCounter, 98 mSDsCounter, 0 mSdLazyCounter, 128 mSolverCounterSat, 12 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 134 SdHoareTripleChecker+Valid, 174 SdHoareTripleChecker+Invalid, 140 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 12 IncrementalHoareTripleChecker+Valid, 128 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2024-11-13 23:29:00,523 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [134 Valid, 174 Invalid, 140 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [12 Valid, 128 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2024-11-13 23:29:00,524 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 233 states. [2024-11-13 23:29:00,529 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 233 to 233. [2024-11-13 23:29:00,530 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 233 states, 184 states have (on average 1.3641304347826086) internal successors, (251), 223 states have internal predecessors, (251), 2 states have call successors, (2), 2 states have call predecessors, (2), 7 states have return successors, (7), 7 states have call predecessors, (7), 2 states have call successors, (7) [2024-11-13 23:29:00,532 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 233 states to 233 states and 260 transitions. [2024-11-13 23:29:00,532 INFO L78 Accepts]: Start accepts. Automaton has 233 states and 260 transitions. Word has length 37 [2024-11-13 23:29:00,532 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-13 23:29:00,532 INFO L471 AbstractCegarLoop]: Abstraction has 233 states and 260 transitions. [2024-11-13 23:29:00,532 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 5 states have (on average 5.8) internal successors, (29), 6 states have internal predecessors, (29), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2024-11-13 23:29:00,532 INFO L276 IsEmpty]: Start isEmpty. Operand 233 states and 260 transitions. [2024-11-13 23:29:00,533 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 39 [2024-11-13 23:29:00,533 INFO L207 NwaCegarLoop]: Found error trace [2024-11-13 23:29:00,533 INFO L215 NwaCegarLoop]: trace histogram [3, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-13 23:29:00,533 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable25 [2024-11-13 23:29:00,533 INFO L396 AbstractCegarLoop]: === Iteration 27 === Targeting ULTIMATE.startErr14REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [create_dataErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, create_dataErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, create_dataErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 89 more)] === [2024-11-13 23:29:00,534 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-13 23:29:00,534 INFO L85 PathProgramCache]: Analyzing trace with hash -2035333606, now seen corresponding path program 1 times [2024-11-13 23:29:00,534 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2024-11-13 23:29:00,534 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [114305893] [2024-11-13 23:29:00,534 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-13 23:29:00,534 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-13 23:29:00,577 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 23:29:00,943 INFO L134 CoverageAnalysis]: Checked inductivity of 12 backedges. 0 proven. 7 refuted. 0 times theorem prover too weak. 5 trivial. 0 not checked. [2024-11-13 23:29:00,943 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2024-11-13 23:29:00,944 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [114305893] [2024-11-13 23:29:00,944 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [114305893] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-13 23:29:00,944 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1033696579] [2024-11-13 23:29:00,944 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-13 23:29:00,944 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-13 23:29:00,944 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_2bb9ae36-a0c5-4c2e-87da-07b477e49f29/bin/utaipan-verify-sOmjnqqW8E/z3 [2024-11-13 23:29:00,947 INFO L229 MonitoredProcess]: Starting monitored process 9 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_2bb9ae36-a0c5-4c2e-87da-07b477e49f29/bin/utaipan-verify-sOmjnqqW8E/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-11-13 23:29:00,950 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_2bb9ae36-a0c5-4c2e-87da-07b477e49f29/bin/utaipan-verify-sOmjnqqW8E/z3 -smt2 -in SMTLIB2_COMPLIANT=true (9)] Waiting until timeout for monitored process [2024-11-13 23:29:01,131 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 23:29:01,133 INFO L255 TraceCheckSpWp]: Trace formula consists of 336 conjuncts, 10 conjuncts are in the unsatisfiable core [2024-11-13 23:29:01,136 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-13 23:29:01,168 WARN L873 $PredicateComparison]: unable to prove that (or (exists ((create_data_~data~0.base Int) (|create_data_#t~malloc7.base| Int)) (and (= (select |c_old(#valid)| create_data_~data~0.base) 0) (= |c_#valid| (store (store |c_old(#valid)| create_data_~data~0.base (select |c_#valid| create_data_~data~0.base)) |create_data_#t~malloc7.base| 1)) (not (= create_data_~data~0.base |create_data_#t~malloc7.base|)))) (exists ((create_data_~data~0.base Int)) (and (= |c_#valid| (store |c_old(#valid)| create_data_~data~0.base 1)) (= (select |c_old(#valid)| create_data_~data~0.base) 0)))) is different from true [2024-11-13 23:29:01,593 INFO L349 Elim1Store]: treesize reduction 104, result has 34.2 percent of original size [2024-11-13 23:29:01,594 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 2 stores, 3 select indices, 3 select index equivalence classes, 0 disjoint index pairs (out of 3 index pairs), introduced 5 new quantified variables, introduced 9 case distinctions, treesize of input 40 treesize of output 104 [2024-11-13 23:29:01,999 INFO L349 Elim1Store]: treesize reduction 15, result has 21.1 percent of original size [2024-11-13 23:29:01,999 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 3 case distinctions, treesize of input 22 treesize of output 16 [2024-11-13 23:29:02,015 INFO L349 Elim1Store]: treesize reduction 18, result has 5.3 percent of original size [2024-11-13 23:29:02,015 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 3 case distinctions, treesize of input 24 treesize of output 14 [2024-11-13 23:29:02,039 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 12 treesize of output 9 [2024-11-13 23:29:02,193 INFO L349 Elim1Store]: treesize reduction 182, result has 30.5 percent of original size [2024-11-13 23:29:02,193 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 2 stores, 4 select indices, 4 select index equivalence classes, 0 disjoint index pairs (out of 6 index pairs), introduced 6 new quantified variables, introduced 15 case distinctions, treesize of input 63 treesize of output 146 [2024-11-13 23:29:02,598 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-11-13 23:29:02,604 INFO L173 IndexEqualityManager]: detected equality via solver [2024-11-13 23:29:02,626 INFO L349 Elim1Store]: treesize reduction 29, result has 31.0 percent of original size [2024-11-13 23:29:02,627 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 3 select indices, 3 select index equivalence classes, 2 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 4 case distinctions, treesize of input 34 treesize of output 24 [2024-11-13 23:29:02,648 INFO L173 IndexEqualityManager]: detected equality via solver [2024-11-13 23:29:02,649 INFO L173 IndexEqualityManager]: detected equality via solver [2024-11-13 23:29:02,650 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-11-13 23:29:02,651 INFO L173 IndexEqualityManager]: detected equality via solver [2024-11-13 23:29:02,652 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 3 select indices, 3 select index equivalence classes, 3 disjoint index pairs (out of 3 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 36 treesize of output 14 [2024-11-13 23:29:02,795 INFO L134 CoverageAnalysis]: Checked inductivity of 12 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 12 trivial. 0 not checked. [2024-11-13 23:29:02,796 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-11-13 23:29:02,796 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1033696579] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-13 23:29:02,796 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2024-11-13 23:29:02,796 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [8] total 9 [2024-11-13 23:29:02,796 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1597943176] [2024-11-13 23:29:02,796 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-13 23:29:02,796 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2024-11-13 23:29:02,796 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2024-11-13 23:29:02,797 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2024-11-13 23:29:02,797 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=20, Invalid=55, Unknown=1, NotChecked=14, Total=90 [2024-11-13 23:29:02,797 INFO L87 Difference]: Start difference. First operand 233 states and 260 transitions. Second operand has 5 states, 4 states have (on average 7.5) internal successors, (30), 5 states have internal predecessors, (30), 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) [2024-11-13 23:29:02,980 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-13 23:29:02,981 INFO L93 Difference]: Finished difference Result 244 states and 273 transitions. [2024-11-13 23:29:02,981 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-11-13 23:29:02,981 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 4 states have (on average 7.5) internal successors, (30), 5 states have internal predecessors, (30), 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 38 [2024-11-13 23:29:02,982 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-13 23:29:02,982 INFO L225 Difference]: With dead ends: 244 [2024-11-13 23:29:02,983 INFO L226 Difference]: Without dead ends: 244 [2024-11-13 23:29:02,983 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 46 GetRequests, 37 SyntacticMatches, 1 SemanticMatches, 8 ConstructedPredicates, 1 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=20, Invalid=55, Unknown=1, NotChecked=14, Total=90 [2024-11-13 23:29:02,983 INFO L432 NwaCegarLoop]: 100 mSDtfsCounter, 15 mSDsluCounter, 96 mSDsCounter, 0 mSdLazyCounter, 157 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 15 SdHoareTripleChecker+Valid, 196 SdHoareTripleChecker+Invalid, 347 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 157 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 188 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2024-11-13 23:29:02,984 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [15 Valid, 196 Invalid, 347 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 157 Invalid, 0 Unknown, 188 Unchecked, 0.2s Time] [2024-11-13 23:29:02,984 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 244 states. [2024-11-13 23:29:02,988 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 244 to 225. [2024-11-13 23:29:02,989 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 225 states, 177 states have (on average 1.3728813559322033) internal successors, (243), 216 states have internal predecessors, (243), 2 states have call successors, (2), 2 states have call predecessors, (2), 6 states have return successors, (6), 6 states have call predecessors, (6), 2 states have call successors, (6) [2024-11-13 23:29:02,990 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 225 states to 225 states and 251 transitions. [2024-11-13 23:29:02,990 INFO L78 Accepts]: Start accepts. Automaton has 225 states and 251 transitions. Word has length 38 [2024-11-13 23:29:02,990 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-13 23:29:02,990 INFO L471 AbstractCegarLoop]: Abstraction has 225 states and 251 transitions. [2024-11-13 23:29:02,990 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 4 states have (on average 7.5) internal successors, (30), 5 states have internal predecessors, (30), 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) [2024-11-13 23:29:02,991 INFO L276 IsEmpty]: Start isEmpty. Operand 225 states and 251 transitions. [2024-11-13 23:29:02,991 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 39 [2024-11-13 23:29:02,991 INFO L207 NwaCegarLoop]: Found error trace [2024-11-13 23:29:02,991 INFO L215 NwaCegarLoop]: trace histogram [3, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-13 23:29:03,012 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_2bb9ae36-a0c5-4c2e-87da-07b477e49f29/bin/utaipan-verify-sOmjnqqW8E/z3 -smt2 -in SMTLIB2_COMPLIANT=true (9)] Ended with exit code 0 [2024-11-13 23:29:03,191 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 9 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_2bb9ae36-a0c5-4c2e-87da-07b477e49f29/bin/utaipan-verify-sOmjnqqW8E/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable26 [2024-11-13 23:29:03,192 INFO L396 AbstractCegarLoop]: === Iteration 28 === Targeting ULTIMATE.startErr18REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [create_dataErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, create_dataErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, create_dataErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 89 more)] === [2024-11-13 23:29:03,192 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-13 23:29:03,192 INFO L85 PathProgramCache]: Analyzing trace with hash -646297456, now seen corresponding path program 1 times [2024-11-13 23:29:03,192 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2024-11-13 23:29:03,192 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [814494891] [2024-11-13 23:29:03,192 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-13 23:29:03,192 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-13 23:29:03,221 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 23:29:03,397 INFO L134 CoverageAnalysis]: Checked inductivity of 12 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 12 trivial. 0 not checked. [2024-11-13 23:29:03,397 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2024-11-13 23:29:03,397 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [814494891] [2024-11-13 23:29:03,397 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [814494891] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-13 23:29:03,398 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-13 23:29:03,398 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2024-11-13 23:29:03,398 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [257859607] [2024-11-13 23:29:03,398 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-13 23:29:03,398 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2024-11-13 23:29:03,398 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2024-11-13 23:29:03,399 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2024-11-13 23:29:03,399 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2024-11-13 23:29:03,400 INFO L87 Difference]: Start difference. First operand 225 states and 251 transitions. Second operand has 6 states, 5 states have (on average 6.0) internal successors, (30), 6 states have internal predecessors, (30), 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) [2024-11-13 23:29:03,668 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-13 23:29:03,668 INFO L93 Difference]: Finished difference Result 244 states and 271 transitions. [2024-11-13 23:29:03,668 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2024-11-13 23:29:03,668 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 5 states have (on average 6.0) internal successors, (30), 6 states have internal predecessors, (30), 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 38 [2024-11-13 23:29:03,668 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-13 23:29:03,669 INFO L225 Difference]: With dead ends: 244 [2024-11-13 23:29:03,669 INFO L226 Difference]: Without dead ends: 244 [2024-11-13 23:29:03,669 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=19, Invalid=37, Unknown=0, NotChecked=0, Total=56 [2024-11-13 23:29:03,670 INFO L432 NwaCegarLoop]: 77 mSDtfsCounter, 54 mSDsluCounter, 162 mSDsCounter, 0 mSdLazyCounter, 239 mSolverCounterSat, 4 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 54 SdHoareTripleChecker+Valid, 239 SdHoareTripleChecker+Invalid, 243 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 4 IncrementalHoareTripleChecker+Valid, 239 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2024-11-13 23:29:03,670 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [54 Valid, 239 Invalid, 243 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [4 Valid, 239 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2024-11-13 23:29:03,671 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 244 states. [2024-11-13 23:29:03,676 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 244 to 224. [2024-11-13 23:29:03,676 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 224 states, 177 states have (on average 1.3672316384180792) internal successors, (242), 215 states have internal predecessors, (242), 2 states have call successors, (2), 2 states have call predecessors, (2), 6 states have return successors, (6), 6 states have call predecessors, (6), 2 states have call successors, (6) [2024-11-13 23:29:03,677 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 224 states to 224 states and 250 transitions. [2024-11-13 23:29:03,678 INFO L78 Accepts]: Start accepts. Automaton has 224 states and 250 transitions. Word has length 38 [2024-11-13 23:29:03,678 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-13 23:29:03,678 INFO L471 AbstractCegarLoop]: Abstraction has 224 states and 250 transitions. [2024-11-13 23:29:03,678 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 5 states have (on average 6.0) internal successors, (30), 6 states have internal predecessors, (30), 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) [2024-11-13 23:29:03,678 INFO L276 IsEmpty]: Start isEmpty. Operand 224 states and 250 transitions. [2024-11-13 23:29:03,678 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 39 [2024-11-13 23:29:03,679 INFO L207 NwaCegarLoop]: Found error trace [2024-11-13 23:29:03,679 INFO L215 NwaCegarLoop]: trace histogram [3, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-13 23:29:03,679 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable27 [2024-11-13 23:29:03,679 INFO L396 AbstractCegarLoop]: === Iteration 29 === Targeting ULTIMATE.startErr19REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [create_dataErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, create_dataErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, create_dataErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 89 more)] === [2024-11-13 23:29:03,679 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-13 23:29:03,679 INFO L85 PathProgramCache]: Analyzing trace with hash -646297455, now seen corresponding path program 1 times [2024-11-13 23:29:03,680 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2024-11-13 23:29:03,680 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1294561947] [2024-11-13 23:29:03,680 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-13 23:29:03,680 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-13 23:29:03,706 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 23:29:03,990 INFO L134 CoverageAnalysis]: Checked inductivity of 12 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 12 trivial. 0 not checked. [2024-11-13 23:29:03,990 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2024-11-13 23:29:03,992 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1294561947] [2024-11-13 23:29:03,992 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1294561947] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-13 23:29:03,992 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-13 23:29:03,992 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2024-11-13 23:29:03,992 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1495636532] [2024-11-13 23:29:03,992 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-13 23:29:03,992 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2024-11-13 23:29:03,993 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2024-11-13 23:29:03,993 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2024-11-13 23:29:03,993 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2024-11-13 23:29:03,994 INFO L87 Difference]: Start difference. First operand 224 states and 250 transitions. Second operand has 6 states, 5 states have (on average 6.0) internal successors, (30), 6 states have internal predecessors, (30), 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) [2024-11-13 23:29:04,278 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-13 23:29:04,278 INFO L93 Difference]: Finished difference Result 257 states and 286 transitions. [2024-11-13 23:29:04,279 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2024-11-13 23:29:04,279 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 5 states have (on average 6.0) internal successors, (30), 6 states have internal predecessors, (30), 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 38 [2024-11-13 23:29:04,279 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-13 23:29:04,280 INFO L225 Difference]: With dead ends: 257 [2024-11-13 23:29:04,280 INFO L226 Difference]: Without dead ends: 257 [2024-11-13 23:29:04,281 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=19, Invalid=37, Unknown=0, NotChecked=0, Total=56 [2024-11-13 23:29:04,281 INFO L432 NwaCegarLoop]: 74 mSDtfsCounter, 65 mSDsluCounter, 168 mSDsCounter, 0 mSdLazyCounter, 233 mSolverCounterSat, 4 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 65 SdHoareTripleChecker+Valid, 242 SdHoareTripleChecker+Invalid, 237 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 4 IncrementalHoareTripleChecker+Valid, 233 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2024-11-13 23:29:04,282 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [65 Valid, 242 Invalid, 237 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [4 Valid, 233 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2024-11-13 23:29:04,283 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 257 states. [2024-11-13 23:29:04,287 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 257 to 223. [2024-11-13 23:29:04,288 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 223 states, 177 states have (on average 1.3615819209039548) internal successors, (241), 214 states have internal predecessors, (241), 2 states have call successors, (2), 2 states have call predecessors, (2), 6 states have return successors, (6), 6 states have call predecessors, (6), 2 states have call successors, (6) [2024-11-13 23:29:04,289 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 223 states to 223 states and 249 transitions. [2024-11-13 23:29:04,289 INFO L78 Accepts]: Start accepts. Automaton has 223 states and 249 transitions. Word has length 38 [2024-11-13 23:29:04,289 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-13 23:29:04,289 INFO L471 AbstractCegarLoop]: Abstraction has 223 states and 249 transitions. [2024-11-13 23:29:04,289 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 5 states have (on average 6.0) internal successors, (30), 6 states have internal predecessors, (30), 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) [2024-11-13 23:29:04,289 INFO L276 IsEmpty]: Start isEmpty. Operand 223 states and 249 transitions. [2024-11-13 23:29:04,289 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 42 [2024-11-13 23:29:04,290 INFO L207 NwaCegarLoop]: Found error trace [2024-11-13 23:29:04,290 INFO L215 NwaCegarLoop]: trace histogram [3, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-13 23:29:04,290 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable28 [2024-11-13 23:29:04,290 INFO L396 AbstractCegarLoop]: === Iteration 30 === Targeting ULTIMATE.startErr23REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [create_dataErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, create_dataErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, create_dataErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 89 more)] === [2024-11-13 23:29:04,290 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-13 23:29:04,290 INFO L85 PathProgramCache]: Analyzing trace with hash 494576345, now seen corresponding path program 1 times [2024-11-13 23:29:04,290 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2024-11-13 23:29:04,290 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2130502445] [2024-11-13 23:29:04,291 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-13 23:29:04,291 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-13 23:29:04,331 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 23:29:04,977 INFO L134 CoverageAnalysis]: Checked inductivity of 12 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 12 trivial. 0 not checked. [2024-11-13 23:29:04,977 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2024-11-13 23:29:04,977 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2130502445] [2024-11-13 23:29:04,978 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2130502445] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-13 23:29:04,978 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-13 23:29:04,978 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2024-11-13 23:29:04,978 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1766895216] [2024-11-13 23:29:04,978 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-13 23:29:04,978 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 11 states [2024-11-13 23:29:04,978 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2024-11-13 23:29:04,979 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2024-11-13 23:29:04,979 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=25, Invalid=85, Unknown=0, NotChecked=0, Total=110 [2024-11-13 23:29:04,979 INFO L87 Difference]: Start difference. First operand 223 states and 249 transitions. Second operand has 11 states, 10 states have (on average 3.3) internal successors, (33), 11 states have internal predecessors, (33), 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) [2024-11-13 23:29:05,561 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-13 23:29:05,561 INFO L93 Difference]: Finished difference Result 271 states and 302 transitions. [2024-11-13 23:29:05,562 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2024-11-13 23:29:05,562 INFO L78 Accepts]: Start accepts. Automaton has has 11 states, 10 states have (on average 3.3) internal successors, (33), 11 states have internal predecessors, (33), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 41 [2024-11-13 23:29:05,562 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-13 23:29:05,563 INFO L225 Difference]: With dead ends: 271 [2024-11-13 23:29:05,563 INFO L226 Difference]: Without dead ends: 271 [2024-11-13 23:29:05,564 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 15 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 16 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=34, Invalid=122, Unknown=0, NotChecked=0, Total=156 [2024-11-13 23:29:05,564 INFO L432 NwaCegarLoop]: 64 mSDtfsCounter, 89 mSDsluCounter, 250 mSDsCounter, 0 mSdLazyCounter, 469 mSolverCounterSat, 9 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 89 SdHoareTripleChecker+Valid, 314 SdHoareTripleChecker+Invalid, 478 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 9 IncrementalHoareTripleChecker+Valid, 469 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.5s IncrementalHoareTripleChecker+Time [2024-11-13 23:29:05,564 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [89 Valid, 314 Invalid, 478 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [9 Valid, 469 Invalid, 0 Unknown, 0 Unchecked, 0.5s Time] [2024-11-13 23:29:05,565 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 271 states. [2024-11-13 23:29:05,570 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 271 to 228. [2024-11-13 23:29:05,571 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 228 states, 182 states have (on average 1.3626373626373627) internal successors, (248), 219 states have internal predecessors, (248), 2 states have call successors, (2), 2 states have call predecessors, (2), 6 states have return successors, (6), 6 states have call predecessors, (6), 2 states have call successors, (6) [2024-11-13 23:29:05,572 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 228 states to 228 states and 256 transitions. [2024-11-13 23:29:05,573 INFO L78 Accepts]: Start accepts. Automaton has 228 states and 256 transitions. Word has length 41 [2024-11-13 23:29:05,573 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-13 23:29:05,573 INFO L471 AbstractCegarLoop]: Abstraction has 228 states and 256 transitions. [2024-11-13 23:29:05,573 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 11 states, 10 states have (on average 3.3) internal successors, (33), 11 states have internal predecessors, (33), 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) [2024-11-13 23:29:05,574 INFO L276 IsEmpty]: Start isEmpty. Operand 228 states and 256 transitions. [2024-11-13 23:29:05,574 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 42 [2024-11-13 23:29:05,574 INFO L207 NwaCegarLoop]: Found error trace [2024-11-13 23:29:05,574 INFO L215 NwaCegarLoop]: trace histogram [3, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-13 23:29:05,574 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable29 [2024-11-13 23:29:05,574 INFO L396 AbstractCegarLoop]: === Iteration 31 === Targeting ULTIMATE.startErr22REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [create_dataErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, create_dataErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, create_dataErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 89 more)] === [2024-11-13 23:29:05,575 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-13 23:29:05,575 INFO L85 PathProgramCache]: Analyzing trace with hash 494576344, now seen corresponding path program 1 times [2024-11-13 23:29:05,575 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2024-11-13 23:29:05,575 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [42312477] [2024-11-13 23:29:05,575 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-13 23:29:05,575 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-13 23:29:05,601 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 23:29:05,674 INFO L134 CoverageAnalysis]: Checked inductivity of 12 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 12 trivial. 0 not checked. [2024-11-13 23:29:05,674 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2024-11-13 23:29:05,674 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [42312477] [2024-11-13 23:29:05,674 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [42312477] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-13 23:29:05,674 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-13 23:29:05,674 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2024-11-13 23:29:05,674 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1061499992] [2024-11-13 23:29:05,674 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-13 23:29:05,675 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2024-11-13 23:29:05,675 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2024-11-13 23:29:05,675 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2024-11-13 23:29:05,675 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2024-11-13 23:29:05,675 INFO L87 Difference]: Start difference. First operand 228 states and 256 transitions. Second operand has 5 states, 4 states have (on average 8.25) internal successors, (33), 5 states have internal predecessors, (33), 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) [2024-11-13 23:29:05,919 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-13 23:29:05,919 INFO L93 Difference]: Finished difference Result 247 states and 275 transitions. [2024-11-13 23:29:05,920 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-11-13 23:29:05,920 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 4 states have (on average 8.25) internal successors, (33), 5 states have internal predecessors, (33), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 41 [2024-11-13 23:29:05,920 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-13 23:29:05,921 INFO L225 Difference]: With dead ends: 247 [2024-11-13 23:29:05,921 INFO L226 Difference]: Without dead ends: 247 [2024-11-13 23:29:05,921 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2024-11-13 23:29:05,922 INFO L432 NwaCegarLoop]: 84 mSDtfsCounter, 30 mSDsluCounter, 173 mSDsCounter, 0 mSdLazyCounter, 231 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 30 SdHoareTripleChecker+Valid, 257 SdHoareTripleChecker+Invalid, 232 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 231 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2024-11-13 23:29:05,922 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [30 Valid, 257 Invalid, 232 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 231 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2024-11-13 23:29:05,923 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 247 states. [2024-11-13 23:29:05,927 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 247 to 227. [2024-11-13 23:29:05,927 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 227 states, 182 states have (on average 1.3516483516483517) internal successors, (246), 218 states have internal predecessors, (246), 2 states have call successors, (2), 2 states have call predecessors, (2), 6 states have return successors, (6), 6 states have call predecessors, (6), 2 states have call successors, (6) [2024-11-13 23:29:05,928 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 227 states to 227 states and 254 transitions. [2024-11-13 23:29:05,929 INFO L78 Accepts]: Start accepts. Automaton has 227 states and 254 transitions. Word has length 41 [2024-11-13 23:29:05,929 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-13 23:29:05,929 INFO L471 AbstractCegarLoop]: Abstraction has 227 states and 254 transitions. [2024-11-13 23:29:05,929 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 4 states have (on average 8.25) internal successors, (33), 5 states have internal predecessors, (33), 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) [2024-11-13 23:29:05,929 INFO L276 IsEmpty]: Start isEmpty. Operand 227 states and 254 transitions. [2024-11-13 23:29:05,930 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 43 [2024-11-13 23:29:05,930 INFO L207 NwaCegarLoop]: Found error trace [2024-11-13 23:29:05,930 INFO L215 NwaCegarLoop]: trace histogram [3, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-13 23:29:05,930 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable30 [2024-11-13 23:29:05,930 INFO L396 AbstractCegarLoop]: === Iteration 32 === Targeting ULTIMATE.startErr24REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [create_dataErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, create_dataErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, create_dataErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 89 more)] === [2024-11-13 23:29:05,931 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-13 23:29:05,931 INFO L85 PathProgramCache]: Analyzing trace with hash -1848002357, now seen corresponding path program 1 times [2024-11-13 23:29:05,931 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2024-11-13 23:29:05,931 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [577833405] [2024-11-13 23:29:05,931 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-13 23:29:05,931 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-13 23:29:05,960 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 23:29:06,569 INFO L134 CoverageAnalysis]: Checked inductivity of 12 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 12 trivial. 0 not checked. [2024-11-13 23:29:06,569 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2024-11-13 23:29:06,570 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [577833405] [2024-11-13 23:29:06,570 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [577833405] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-13 23:29:06,570 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-13 23:29:06,570 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2024-11-13 23:29:06,570 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [675402436] [2024-11-13 23:29:06,570 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-13 23:29:06,570 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 11 states [2024-11-13 23:29:06,570 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2024-11-13 23:29:06,571 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2024-11-13 23:29:06,572 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=21, Invalid=89, Unknown=0, NotChecked=0, Total=110 [2024-11-13 23:29:06,572 INFO L87 Difference]: Start difference. First operand 227 states and 254 transitions. Second operand has 11 states, 10 states have (on average 3.4) internal successors, (34), 10 states have internal predecessors, (34), 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) [2024-11-13 23:29:07,236 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-13 23:29:07,236 INFO L93 Difference]: Finished difference Result 268 states and 302 transitions. [2024-11-13 23:29:07,236 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2024-11-13 23:29:07,237 INFO L78 Accepts]: Start accepts. Automaton has has 11 states, 10 states have (on average 3.4) internal successors, (34), 10 states have internal predecessors, (34), 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 42 [2024-11-13 23:29:07,237 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-13 23:29:07,238 INFO L225 Difference]: With dead ends: 268 [2024-11-13 23:29:07,238 INFO L226 Difference]: Without dead ends: 268 [2024-11-13 23:29:07,238 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 18 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 16 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 27 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=60, Invalid=246, Unknown=0, NotChecked=0, Total=306 [2024-11-13 23:29:07,239 INFO L432 NwaCegarLoop]: 60 mSDtfsCounter, 150 mSDsluCounter, 337 mSDsCounter, 0 mSdLazyCounter, 636 mSolverCounterSat, 7 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 150 SdHoareTripleChecker+Valid, 397 SdHoareTripleChecker+Invalid, 643 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 7 IncrementalHoareTripleChecker+Valid, 636 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.5s IncrementalHoareTripleChecker+Time [2024-11-13 23:29:07,239 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [150 Valid, 397 Invalid, 643 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [7 Valid, 636 Invalid, 0 Unknown, 0 Unchecked, 0.5s Time] [2024-11-13 23:29:07,242 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 268 states. [2024-11-13 23:29:07,246 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 268 to 241. [2024-11-13 23:29:07,247 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 241 states, 196 states have (on average 1.3622448979591837) internal successors, (267), 232 states have internal predecessors, (267), 2 states have call successors, (2), 2 states have call predecessors, (2), 6 states have return successors, (6), 6 states have call predecessors, (6), 2 states have call successors, (6) [2024-11-13 23:29:07,248 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 241 states to 241 states and 275 transitions. [2024-11-13 23:29:07,248 INFO L78 Accepts]: Start accepts. Automaton has 241 states and 275 transitions. Word has length 42 [2024-11-13 23:29:07,248 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-13 23:29:07,248 INFO L471 AbstractCegarLoop]: Abstraction has 241 states and 275 transitions. [2024-11-13 23:29:07,248 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 11 states, 10 states have (on average 3.4) internal successors, (34), 10 states have internal predecessors, (34), 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) [2024-11-13 23:29:07,249 INFO L276 IsEmpty]: Start isEmpty. Operand 241 states and 275 transitions. [2024-11-13 23:29:07,249 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 43 [2024-11-13 23:29:07,249 INFO L207 NwaCegarLoop]: Found error trace [2024-11-13 23:29:07,249 INFO L215 NwaCegarLoop]: trace histogram [3, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-13 23:29:07,249 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable31 [2024-11-13 23:29:07,249 INFO L396 AbstractCegarLoop]: === Iteration 33 === Targeting ULTIMATE.startErr25REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [create_dataErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, create_dataErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, create_dataErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 89 more)] === [2024-11-13 23:29:07,249 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-13 23:29:07,250 INFO L85 PathProgramCache]: Analyzing trace with hash -1848002356, now seen corresponding path program 1 times [2024-11-13 23:29:07,250 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2024-11-13 23:29:07,250 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1989743542] [2024-11-13 23:29:07,250 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-13 23:29:07,250 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-13 23:29:07,281 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 23:29:07,950 INFO L134 CoverageAnalysis]: Checked inductivity of 12 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 12 trivial. 0 not checked. [2024-11-13 23:29:07,950 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2024-11-13 23:29:07,950 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1989743542] [2024-11-13 23:29:07,951 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1989743542] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-13 23:29:07,951 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-13 23:29:07,951 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [12] imperfect sequences [] total 12 [2024-11-13 23:29:07,951 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [240416934] [2024-11-13 23:29:07,951 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-13 23:29:07,951 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 13 states [2024-11-13 23:29:07,951 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2024-11-13 23:29:07,952 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2024-11-13 23:29:07,952 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=27, Invalid=129, Unknown=0, NotChecked=0, Total=156 [2024-11-13 23:29:07,952 INFO L87 Difference]: Start difference. First operand 241 states and 275 transitions. Second operand has 13 states, 12 states have (on average 2.8333333333333335) internal successors, (34), 12 states have internal predecessors, (34), 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) [2024-11-13 23:29:08,547 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-13 23:29:08,547 INFO L93 Difference]: Finished difference Result 279 states and 317 transitions. [2024-11-13 23:29:08,548 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2024-11-13 23:29:08,548 INFO L78 Accepts]: Start accepts. Automaton has has 13 states, 12 states have (on average 2.8333333333333335) internal successors, (34), 12 states have internal predecessors, (34), 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 42 [2024-11-13 23:29:08,548 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-13 23:29:08,549 INFO L225 Difference]: With dead ends: 279 [2024-11-13 23:29:08,549 INFO L226 Difference]: Without dead ends: 279 [2024-11-13 23:29:08,549 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 17 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 16 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 38 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=53, Invalid=253, Unknown=0, NotChecked=0, Total=306 [2024-11-13 23:29:08,550 INFO L432 NwaCegarLoop]: 56 mSDtfsCounter, 164 mSDsluCounter, 354 mSDsCounter, 0 mSdLazyCounter, 685 mSolverCounterSat, 11 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 164 SdHoareTripleChecker+Valid, 410 SdHoareTripleChecker+Invalid, 696 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 11 IncrementalHoareTripleChecker+Valid, 685 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.5s IncrementalHoareTripleChecker+Time [2024-11-13 23:29:08,550 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [164 Valid, 410 Invalid, 696 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [11 Valid, 685 Invalid, 0 Unknown, 0 Unchecked, 0.5s Time] [2024-11-13 23:29:08,551 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 279 states. [2024-11-13 23:29:08,555 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 279 to 242. [2024-11-13 23:29:08,555 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 242 states, 197 states have (on average 1.3604060913705585) internal successors, (268), 233 states have internal predecessors, (268), 2 states have call successors, (2), 2 states have call predecessors, (2), 6 states have return successors, (6), 6 states have call predecessors, (6), 2 states have call successors, (6) [2024-11-13 23:29:08,557 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 242 states to 242 states and 276 transitions. [2024-11-13 23:29:08,557 INFO L78 Accepts]: Start accepts. Automaton has 242 states and 276 transitions. Word has length 42 [2024-11-13 23:29:08,557 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-13 23:29:08,557 INFO L471 AbstractCegarLoop]: Abstraction has 242 states and 276 transitions. [2024-11-13 23:29:08,557 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 13 states, 12 states have (on average 2.8333333333333335) internal successors, (34), 12 states have internal predecessors, (34), 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) [2024-11-13 23:29:08,558 INFO L276 IsEmpty]: Start isEmpty. Operand 242 states and 276 transitions. [2024-11-13 23:29:08,558 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 44 [2024-11-13 23:29:08,558 INFO L207 NwaCegarLoop]: Found error trace [2024-11-13 23:29:08,558 INFO L215 NwaCegarLoop]: trace histogram [3, 3, 3, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-13 23:29:08,558 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable32 [2024-11-13 23:29:08,558 INFO L396 AbstractCegarLoop]: === Iteration 34 === Targeting create_dataErr27REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [create_dataErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, create_dataErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, create_dataErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 89 more)] === [2024-11-13 23:29:08,559 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-13 23:29:08,559 INFO L85 PathProgramCache]: Analyzing trace with hash -1774294400, now seen corresponding path program 1 times [2024-11-13 23:29:08,559 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2024-11-13 23:29:08,559 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [247062352] [2024-11-13 23:29:08,559 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-13 23:29:08,559 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-13 23:29:08,605 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 23:29:08,827 INFO L134 CoverageAnalysis]: Checked inductivity of 16 backedges. 2 proven. 2 refuted. 0 times theorem prover too weak. 12 trivial. 0 not checked. [2024-11-13 23:29:08,827 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2024-11-13 23:29:08,827 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [247062352] [2024-11-13 23:29:08,827 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [247062352] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-13 23:29:08,827 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [370429370] [2024-11-13 23:29:08,827 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-13 23:29:08,828 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-13 23:29:08,828 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_2bb9ae36-a0c5-4c2e-87da-07b477e49f29/bin/utaipan-verify-sOmjnqqW8E/z3 [2024-11-13 23:29:08,830 INFO L229 MonitoredProcess]: Starting monitored process 10 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_2bb9ae36-a0c5-4c2e-87da-07b477e49f29/bin/utaipan-verify-sOmjnqqW8E/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-11-13 23:29:08,833 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_2bb9ae36-a0c5-4c2e-87da-07b477e49f29/bin/utaipan-verify-sOmjnqqW8E/z3 -smt2 -in SMTLIB2_COMPLIANT=true (10)] Waiting until timeout for monitored process [2024-11-13 23:29:09,129 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 23:29:09,131 INFO L255 TraceCheckSpWp]: Trace formula consists of 465 conjuncts, 15 conjuncts are in the unsatisfiable core [2024-11-13 23:29:09,133 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-13 23:29:09,144 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 6 treesize of output 5 [2024-11-13 23:29:09,148 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 [2024-11-13 23:29:09,240 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-11-13 23:29:09,241 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 [2024-11-13 23:29:09,251 INFO L349 Elim1Store]: treesize reduction 4, result has 50.0 percent of original size [2024-11-13 23:29:09,252 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 [2024-11-13 23:29:09,269 INFO L134 CoverageAnalysis]: Checked inductivity of 16 backedges. 2 proven. 2 refuted. 0 times theorem prover too weak. 12 trivial. 0 not checked. [2024-11-13 23:29:09,269 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-11-13 23:29:09,488 INFO L134 CoverageAnalysis]: Checked inductivity of 16 backedges. 2 proven. 2 refuted. 0 times theorem prover too weak. 12 trivial. 0 not checked. [2024-11-13 23:29:09,489 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [370429370] provided 0 perfect and 2 imperfect interpolant sequences [2024-11-13 23:29:09,489 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSifa [31540059] [2024-11-13 23:29:09,491 INFO L159 IcfgInterpreter]: Started Sifa with 33 locations of interest [2024-11-13 23:29:09,491 INFO L166 IcfgInterpreter]: Building call graph [2024-11-13 23:29:09,492 INFO L171 IcfgInterpreter]: Initial procedures are [ULTIMATE.start] [2024-11-13 23:29:09,492 INFO L176 IcfgInterpreter]: Starting interpretation [2024-11-13 23:29:09,492 INFO L197 IcfgInterpreter]: Interpreting procedure ULTIMATE.start with input of size 1 for LOIs [2024-11-13 23:29:09,596 INFO L197 IcfgInterpreter]: Interpreting procedure create_data with input of size 105 for LOIs [2024-11-13 23:29:16,619 INFO L180 IcfgInterpreter]: Interpretation finished [2024-11-13 23:30:29,346 WARN L286 SmtUtils]: Spent 9.10s on a formula simplification. DAG size of input: 243 DAG size of output: 234 (called from [L 388] de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.predicates.PredicateUnifier.getOrConstructPredicate) [2024-11-13 23:30:59,763 WARN L286 SmtUtils]: Spent 11.91s on a formula simplification. DAG size of input: 256 DAG size of output: 247 (called from [L 388] de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.predicates.PredicateUnifier.getOrConstructPredicate) [2024-11-13 23:31:29,508 WARN L286 SmtUtils]: Spent 15.29s on a formula simplification. DAG size of input: 265 DAG size of output: 253 (called from [L 388] de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.predicates.PredicateUnifier.getOrConstructPredicate) [2024-11-13 23:31:29,815 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSifa [31540059] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-13 23:31:29,815 INFO L185 FreeRefinementEngine]: Found 1 perfect and 3 imperfect interpolant sequences. [2024-11-13 23:31:29,815 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [26] imperfect sequences [5, 4, 4] total 37 [2024-11-13 23:31:29,816 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [386859055] [2024-11-13 23:31:29,816 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-13 23:31:29,816 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 28 states [2024-11-13 23:31:29,816 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2024-11-13 23:31:29,817 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 28 interpolants. [2024-11-13 23:31:29,817 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=209, Invalid=1168, Unknown=29, NotChecked=0, Total=1406 [2024-11-13 23:31:29,817 INFO L87 Difference]: Start difference. First operand 242 states and 276 transitions. Second operand has 28 states, 27 states have (on average 1.2222222222222223) internal successors, (33), 26 states have internal predecessors, (33), 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) [2024-11-13 23:31:32,532 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.65s for a HTC check with result INVALID. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2024-11-13 23:31:52,562 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2024-11-13 23:32:11,547 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2024-11-13 23:32:15,291 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.01s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2024-11-13 23:32:46,701 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2024-11-13 23:32:50,134 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.01s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2024-11-13 23:32:52,347 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.01s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2024-11-13 23:33:13,204 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.01s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2024-11-13 23:33:18,407 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.01s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2024-11-13 23:33:21,200 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.01s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2024-11-13 23:33:23,753 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.01s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2024-11-13 23:34:29,702 WARN L286 SmtUtils]: Spent 27.76s on a formula simplification. DAG size of input: 260 DAG size of output: 250 (called from [L 388] de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.predicates.PredicateUnifier.getOrConstructPredicate) [2024-11-13 23:34:32,395 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.02s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2024-11-13 23:34:33,849 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.45s for a HTC check with result INVALID. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2024-11-13 23:34:35,092 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.24s for a HTC check with result INVALID. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2024-11-13 23:34:36,762 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.67s for a HTC check with result INVALID. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2024-11-13 23:34:38,776 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.01s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2024-11-13 23:34:40,909 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.13s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2024-11-13 23:34:41,973 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.06s for a HTC check with result INVALID. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2024-11-13 23:34:43,987 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.01s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2024-11-13 23:34:46,967 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.01s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2024-11-13 23:34:49,415 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.45s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2024-11-13 23:34:51,387 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.18s for a HTC check with result INVALID. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2024-11-13 23:34:53,406 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.02s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2024-11-13 23:34:55,288 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.88s for a HTC check with result INVALID. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2024-11-13 23:34:58,279 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.01s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2024-11-13 23:34:59,397 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.12s for a HTC check with result INVALID. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2024-11-13 23:35:03,926 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.01s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2024-11-13 23:35:06,724 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.02s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2024-11-13 23:35:08,934 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.21s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2024-11-13 23:35:11,642 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.02s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2024-11-13 23:35:14,491 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.01s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2024-11-13 23:35:19,117 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.01s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2024-11-13 23:35:20,417 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.30s for a HTC check with result INVALID. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2024-11-13 23:35:27,283 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.23s for a HTC check with result INVALID. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2024-11-13 23:35:28,557 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.27s for a HTC check with result INVALID. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2024-11-13 23:35:29,999 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.44s for a HTC check with result INVALID. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2024-11-13 23:35:31,011 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.01s for a HTC check with result INVALID. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2024-11-13 23:35:32,248 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.24s for a HTC check with result INVALID. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2024-11-13 23:35:33,305 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.06s for a HTC check with result INVALID. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2024-11-13 23:35:34,450 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.14s for a HTC check with result INVALID. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2024-11-13 23:35:35,473 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.02s for a HTC check with result INVALID. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2024-11-13 23:35:37,486 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.01s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2024-11-13 23:35:43,499 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.01s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2024-11-13 23:35:44,820 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.32s for a HTC check with result INVALID. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2024-11-13 23:35:46,831 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.01s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2024-11-13 23:35:49,031 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.20s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2024-11-13 23:35:50,651 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.62s for a HTC check with result INVALID. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2024-11-13 23:35:52,956 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.01s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2024-11-13 23:35:55,161 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.20s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2024-11-13 23:35:56,751 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.59s for a HTC check with result INVALID. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2024-11-13 23:35:58,949 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.01s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2024-11-13 23:36:01,183 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.23s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2024-11-13 23:36:03,194 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.01s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2024-11-13 23:36:05,368 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.17s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2024-11-13 23:36:07,761 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.21s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2024-11-13 23:36:09,770 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.01s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2024-11-13 23:36:11,542 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.77s for a HTC check with result VALID. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2024-11-13 23:36:13,549 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.01s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2024-11-13 23:36:15,804 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.25s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2024-11-13 23:36:17,838 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.03s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2024-11-13 23:37:21,018 WARN L286 SmtUtils]: Spent 21.65s on a formula simplification. DAG size of input: 241 DAG size of output: 235 (called from [L 388] de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.predicates.PredicateUnifier.getOrConstructPredicate) [2024-11-13 23:37:23,472 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.01s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2024-11-13 23:37:24,507 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.04s for a HTC check with result INVALID. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2024-11-13 23:37:27,008 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.77s for a HTC check with result INVALID. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2024-11-13 23:37:29,022 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.01s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2024-11-13 23:37:30,363 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.34s for a HTC check with result INVALID. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2024-11-13 23:37:33,244 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.01s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2024-11-13 23:37:35,464 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.22s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2024-11-13 23:37:37,478 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.01s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2024-11-13 23:37:39,888 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.41s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2024-11-13 23:37:43,307 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.01s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2024-11-13 23:37:45,060 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.75s for a HTC check with result INVALID. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2024-11-13 23:37:50,095 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-13 23:37:50,095 INFO L93 Difference]: Finished difference Result 313 states and 358 transitions. [2024-11-13 23:37:50,095 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 34 states. [2024-11-13 23:37:50,096 INFO L78 Accepts]: Start accepts. Automaton has has 28 states, 27 states have (on average 1.2222222222222223) internal successors, (33), 26 states have internal predecessors, (33), 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 43 [2024-11-13 23:37:50,096 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-13 23:37:50,097 INFO L225 Difference]: With dead ends: 313 [2024-11-13 23:37:50,097 INFO L226 Difference]: Without dead ends: 313 [2024-11-13 23:37:50,098 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 141 GetRequests, 94 SyntacticMatches, 3 SemanticMatches, 44 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 578 ImplicationChecksByTransitivity, 336.9s TimeCoverageRelationStatistics Valid=318, Invalid=1665, Unknown=87, NotChecked=0, Total=2070 [2024-11-13 23:37:50,099 INFO L432 NwaCegarLoop]: 75 mSDtfsCounter, 33 mSDsluCounter, 527 mSDsCounter, 0 mSdLazyCounter, 1313 mSolverCounterSat, 11 mSolverCounterUnsat, 49 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 168.9s Time, 0 mProtectedPredicate, 0 mProtectedAction, 33 SdHoareTripleChecker+Valid, 602 SdHoareTripleChecker+Invalid, 1373 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 11 IncrementalHoareTripleChecker+Valid, 1313 IncrementalHoareTripleChecker+Invalid, 49 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 176.6s IncrementalHoareTripleChecker+Time [2024-11-13 23:37:50,099 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [33 Valid, 602 Invalid, 1373 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [11 Valid, 1313 Invalid, 49 Unknown, 0 Unchecked, 176.6s Time] [2024-11-13 23:37:50,100 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 313 states. [2024-11-13 23:37:50,107 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 313 to 298. [2024-11-13 23:37:50,107 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 298 states, 252 states have (on average 1.3134920634920635) internal successors, (331), 288 states have internal predecessors, (331), 3 states have call successors, (3), 3 states have call predecessors, (3), 6 states have return successors, (9), 6 states have call predecessors, (9), 3 states have call successors, (9) [2024-11-13 23:37:50,109 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 298 states to 298 states and 343 transitions. [2024-11-13 23:37:50,110 INFO L78 Accepts]: Start accepts. Automaton has 298 states and 343 transitions. Word has length 43 [2024-11-13 23:37:50,110 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-13 23:37:50,110 INFO L471 AbstractCegarLoop]: Abstraction has 298 states and 343 transitions. [2024-11-13 23:37:50,110 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 28 states, 27 states have (on average 1.2222222222222223) internal successors, (33), 26 states have internal predecessors, (33), 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) [2024-11-13 23:37:50,110 INFO L276 IsEmpty]: Start isEmpty. Operand 298 states and 343 transitions. [2024-11-13 23:37:50,111 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 45 [2024-11-13 23:37:50,111 INFO L207 NwaCegarLoop]: Found error trace [2024-11-13 23:37:50,111 INFO L215 NwaCegarLoop]: trace histogram [3, 3, 3, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-13 23:37:50,138 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_2bb9ae36-a0c5-4c2e-87da-07b477e49f29/bin/utaipan-verify-sOmjnqqW8E/z3 -smt2 -in SMTLIB2_COMPLIANT=true (10)] Forceful destruction successful, exit code 0 [2024-11-13 23:37:50,312 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable33,10 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_2bb9ae36-a0c5-4c2e-87da-07b477e49f29/bin/utaipan-verify-sOmjnqqW8E/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-13 23:37:50,312 INFO L396 AbstractCegarLoop]: === Iteration 35 === Targeting ULTIMATE.startErr6REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [create_dataErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, create_dataErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, create_dataErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 89 more)] === [2024-11-13 23:37:50,313 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-13 23:37:50,313 INFO L85 PathProgramCache]: Analyzing trace with hash 1251524741, now seen corresponding path program 1 times [2024-11-13 23:37:50,313 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2024-11-13 23:37:50,313 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1910763004] [2024-11-13 23:37:50,313 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-13 23:37:50,314 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-13 23:37:50,342 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 23:37:51,440 INFO L134 CoverageAnalysis]: Checked inductivity of 17 backedges. 0 proven. 7 refuted. 0 times theorem prover too weak. 10 trivial. 0 not checked. [2024-11-13 23:37:51,441 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2024-11-13 23:37:51,441 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1910763004] [2024-11-13 23:37:51,441 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1910763004] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-13 23:37:51,441 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1557334297] [2024-11-13 23:37:51,441 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-13 23:37:51,441 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-13 23:37:51,441 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_2bb9ae36-a0c5-4c2e-87da-07b477e49f29/bin/utaipan-verify-sOmjnqqW8E/z3 [2024-11-13 23:37:51,443 INFO L229 MonitoredProcess]: Starting monitored process 11 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_2bb9ae36-a0c5-4c2e-87da-07b477e49f29/bin/utaipan-verify-sOmjnqqW8E/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-11-13 23:37:51,444 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_2bb9ae36-a0c5-4c2e-87da-07b477e49f29/bin/utaipan-verify-sOmjnqqW8E/z3 -smt2 -in SMTLIB2_COMPLIANT=true (11)] Waiting until timeout for monitored process [2024-11-13 23:37:51,683 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 23:37:51,685 INFO L255 TraceCheckSpWp]: Trace formula consists of 355 conjuncts, 17 conjuncts are in the unsatisfiable core [2024-11-13 23:37:51,688 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-13 23:37:51,704 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 6 treesize of output 5 [2024-11-13 23:37:52,032 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 19 treesize of output 1 [2024-11-13 23:37:52,263 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 38 treesize of output 20 [2024-11-13 23:37:52,319 WARN L873 $PredicateComparison]: unable to prove that (exists ((v_arrayElimCell_94 Int) (create_data_~data~0.base Int)) (let ((.cse0 (store |c_old(#valid)| create_data_~data~0.base 1))) (and (= (select .cse0 v_arrayElimCell_94) 0) (= (select |c_old(#valid)| create_data_~data~0.base) 0) (= |c_#valid| (store .cse0 v_arrayElimCell_94 (select |c_#valid| v_arrayElimCell_94)))))) is different from true [2024-11-13 23:37:53,941 INFO L349 Elim1Store]: treesize reduction 64, result has 22.9 percent of original size [2024-11-13 23:37:53,941 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 3 select indices, 3 select index equivalence classes, 0 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 6 case distinctions, treesize of input 31 treesize of output 32 [2024-11-13 23:37:54,095 INFO L134 CoverageAnalysis]: Checked inductivity of 17 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 12 trivial. 5 not checked. [2024-11-13 23:37:54,095 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-11-13 23:37:54,569 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1557334297] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-13 23:37:54,569 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSifa [1762166995] [2024-11-13 23:37:54,572 INFO L159 IcfgInterpreter]: Started Sifa with 33 locations of interest [2024-11-13 23:37:54,572 INFO L166 IcfgInterpreter]: Building call graph [2024-11-13 23:37:54,573 INFO L171 IcfgInterpreter]: Initial procedures are [ULTIMATE.start] [2024-11-13 23:37:54,573 INFO L176 IcfgInterpreter]: Starting interpretation [2024-11-13 23:37:54,575 INFO L197 IcfgInterpreter]: Interpreting procedure ULTIMATE.start with input of size 1 for LOIs [2024-11-13 23:37:55,632 INFO L197 IcfgInterpreter]: Interpreting procedure create_data with input of size 103 for LOIs [2024-11-13 23:37:56,949 INFO L180 IcfgInterpreter]: Interpretation finished [2024-11-13 23:38:12,039 INFO L133 SifaRunner]: Sifa could not show that error location is unreachable, found '16343#(and (<= 1 |#StackHeapBarrier|) (= |ULTIMATE.start_main_~#list~0#1.offset| 0) (= |ULTIMATE.start_append_~pointerToList#1.offset| 0) (exists ((|v_ULTIMATE.start_append_~node~0#1.base_27| Int)) (and (or (and (exists ((|v_#memory_int_184| (Array Int (Array Int Int)))) (= |#memory_int| (store |v_#memory_int_184| |ULTIMATE.start_append_#t~ret27#1.base| (store (store (select |v_#memory_int_184| |ULTIMATE.start_append_#t~ret27#1.base|) 8 0) 12 (select (select |#memory_int| |ULTIMATE.start_append_#t~ret27#1.base|) 12))))) (exists ((|v_#memory_$Pointer$.base_205| (Array Int (Array Int Int))) (|v_#memory_$Pointer$.base_204| (Array Int (Array Int Int)))) (and (= |v_#memory_$Pointer$.base_205| (store |v_#memory_$Pointer$.base_204| |ULTIMATE.start_append_#t~ret27#1.base| (store (select |v_#memory_$Pointer$.base_204| |ULTIMATE.start_append_#t~ret27#1.base|) 8 (select (select |v_#memory_$Pointer$.base_205| |ULTIMATE.start_append_#t~ret27#1.base|) 8)))) (= |#memory_$Pointer$.base| (store |v_#memory_$Pointer$.base_205| |ULTIMATE.start_append_#t~ret27#1.base| (store (select |v_#memory_$Pointer$.base_205| |ULTIMATE.start_append_#t~ret27#1.base|) 12 0))))) (exists ((|v_#length_171| (Array Int Int))) (and (= 33 (select |v_#length_171| 2)) (= (select |v_#length_171| 1) 2))) (exists ((|v_#memory_$Pointer$.offset_192| (Array Int (Array Int Int)))) (= (select (select |v_#memory_$Pointer$.offset_192| |ULTIMATE.start_main_~#list~0#1.base|) 0) 0)) (= (select |#valid| |ULTIMATE.start_append_#t~ret27#1.base|) 1) (= (select |ULTIMATE.start_main_old_#valid#1| 1) 1) (= (select |ULTIMATE.start_main_old_#valid#1| 2) 1) (exists ((|v_#memory_int_176| (Array Int (Array Int Int))) (|v_old(#memory_int)_AFTER_CALL_10| (Array Int (Array Int Int)))) (and (= |v_old(#memory_int)_AFTER_CALL_10| (store |v_#memory_int_176| |v_ULTIMATE.start_append_~node~0#1.base_27| (store (select |v_#memory_int_176| |v_ULTIMATE.start_append_~node~0#1.base_27|) 4 (select (select |v_old(#memory_int)_AFTER_CALL_10| |v_ULTIMATE.start_append_~node~0#1.base_27|) 4)))) (= (select (select |v_#memory_int_176| 1) 1) 0) (= 48 (select (select |v_#memory_int_176| 1) 0)))) (exists ((v_create_data_~userInput~0_15 Int) (|v_create_data_#t~short16_20| Bool)) (and (<= v_create_data_~userInput~0_15 2147483647) (<= 0 (+ v_create_data_~userInput~0_15 2147483648)) (or (< 199 v_create_data_~userInput~0_15) (not |v_create_data_#t~short16_20|) (< (+ v_create_data_~userInput~0_15 199) 0)))) (<= (+ |#StackHeapBarrier| 1) |ULTIMATE.start_main_~#list~0#1.base|) (not (= |v_ULTIMATE.start_append_~node~0#1.base_27| 0)) (= (select |ULTIMATE.start_main_old_#valid#1| 0) 0) (exists ((|v_#memory_$Pointer$.base_196| (Array Int (Array Int Int)))) (= (select (select |v_#memory_$Pointer$.base_196| |ULTIMATE.start_main_~#list~0#1.base|) 0) 0)) (= (select |ULTIMATE.start_main_old_#valid#1| |v_ULTIMATE.start_append_~node~0#1.base_27|) 0) (<= 16 (select |#length| |ULTIMATE.start_append_#t~ret27#1.base|)) (= (select |ULTIMATE.start_main_old_#valid#1| |ULTIMATE.start_main_~#list~0#1.base|) 0) (<= (+ |v_ULTIMATE.start_append_~node~0#1.base_27| 1) |#StackHeapBarrier|) (exists ((|v_#memory_$Pointer$.offset_200| (Array Int (Array Int Int))) (|v_#memory_$Pointer$.offset_201| (Array Int (Array Int Int)))) (and (= |v_#memory_$Pointer$.offset_201| (store |v_#memory_$Pointer$.offset_200| |ULTIMATE.start_append_#t~ret27#1.base| (store (select |v_#memory_$Pointer$.offset_200| |ULTIMATE.start_append_#t~ret27#1.base|) 8 (select (select |v_#memory_$Pointer$.offset_201| |ULTIMATE.start_append_#t~ret27#1.base|) 8)))) (= |#memory_$Pointer$.offset| (store |v_#memory_$Pointer$.offset_201| |ULTIMATE.start_append_#t~ret27#1.base| (store (select |v_#memory_$Pointer$.offset_201| |ULTIMATE.start_append_#t~ret27#1.base|) 12 0))))) (= |ULTIMATE.start_main_~#list~0#1.base| |ULTIMATE.start_append_~pointerToList#1.base|)) (and (exists ((|v_#memory_int_184| (Array Int (Array Int Int)))) (= |#memory_int| (store |v_#memory_int_184| |ULTIMATE.start_append_#t~ret27#1.base| (store (store (select |v_#memory_int_184| |ULTIMATE.start_append_#t~ret27#1.base|) 8 0) 12 (select (select |#memory_int| |ULTIMATE.start_append_#t~ret27#1.base|) 12))))) (exists ((|v_#memory_int_176| (Array Int (Array Int Int))) (|v_old(#memory_int)_AFTER_CALL_11| (Array Int (Array Int Int)))) (and (= |v_old(#memory_int)_AFTER_CALL_11| (store |v_#memory_int_176| |v_ULTIMATE.start_append_~node~0#1.base_27| (store (select |v_#memory_int_176| |v_ULTIMATE.start_append_~node~0#1.base_27|) 4 (select (select |v_old(#memory_int)_AFTER_CALL_11| |v_ULTIMATE.start_append_~node~0#1.base_27|) 4)))) (= (select (select |v_#memory_int_176| 1) 1) 0) (= 48 (select (select |v_#memory_int_176| 1) 0)))) (exists ((|v_#memory_$Pointer$.base_205| (Array Int (Array Int Int))) (|v_#memory_$Pointer$.base_204| (Array Int (Array Int Int)))) (and (= |v_#memory_$Pointer$.base_205| (store |v_#memory_$Pointer$.base_204| |ULTIMATE.start_append_#t~ret27#1.base| (store (select |v_#memory_$Pointer$.base_204| |ULTIMATE.start_append_#t~ret27#1.base|) 8 (select (select |v_#memory_$Pointer$.base_205| |ULTIMATE.start_append_#t~ret27#1.base|) 8)))) (= |#memory_$Pointer$.base| (store |v_#memory_$Pointer$.base_205| |ULTIMATE.start_append_#t~ret27#1.base| (store (select |v_#memory_$Pointer$.base_205| |ULTIMATE.start_append_#t~ret27#1.base|) 12 0))))) (exists ((|v_#length_171| (Array Int Int))) (and (= 33 (select |v_#length_171| 2)) (= (select |v_#length_171| 1) 2))) (exists ((|v_#memory_$Pointer$.offset_192| (Array Int (Array Int Int)))) (= (select (select |v_#memory_$Pointer$.offset_192| |ULTIMATE.start_main_~#list~0#1.base|) 0) 0)) (= (select |#valid| |ULTIMATE.start_append_#t~ret27#1.base|) 1) (= (select |ULTIMATE.start_main_old_#valid#1| 1) 1) (= (select |ULTIMATE.start_main_old_#valid#1| 2) 1) (exists ((v_create_data_~userInput~0_15 Int) (|v_create_data_#t~short16_20| Bool)) (and (<= v_create_data_~userInput~0_15 2147483647) (<= 0 (+ v_create_data_~userInput~0_15 2147483648)) (or (< 199 v_create_data_~userInput~0_15) (not |v_create_data_#t~short16_20|) (< (+ v_create_data_~userInput~0_15 199) 0)))) (<= (+ |#StackHeapBarrier| 1) |ULTIMATE.start_main_~#list~0#1.base|) (not (= |v_ULTIMATE.start_append_~node~0#1.base_27| 0)) (= (select |ULTIMATE.start_main_old_#valid#1| 0) 0) (exists ((|v_#memory_$Pointer$.base_196| (Array Int (Array Int Int)))) (= (select (select |v_#memory_$Pointer$.base_196| |ULTIMATE.start_main_~#list~0#1.base|) 0) 0)) (= (select |ULTIMATE.start_main_old_#valid#1| |v_ULTIMATE.start_append_~node~0#1.base_27|) 0) (<= 16 (select |#length| |ULTIMATE.start_append_#t~ret27#1.base|)) (= (select |ULTIMATE.start_main_old_#valid#1| |ULTIMATE.start_main_~#list~0#1.base|) 0) (<= (+ |v_ULTIMATE.start_append_~node~0#1.base_27| 1) |#StackHeapBarrier|) (exists ((|v_#memory_$Pointer$.offset_200| (Array Int (Array Int Int))) (|v_#memory_$Pointer$.offset_201| (Array Int (Array Int Int)))) (and (= |v_#memory_$Pointer$.offset_201| (store |v_#memory_$Pointer$.offset_200| |ULTIMATE.start_append_#t~ret27#1.base| (store (select |v_#memory_$Pointer$.offset_200| |ULTIMATE.start_append_#t~ret27#1.base|) 8 (select (select |v_#memory_$Pointer$.offset_201| |ULTIMATE.start_append_#t~ret27#1.base|) 8)))) (= |#memory_$Pointer$.offset| (store |v_#memory_$Pointer$.offset_201| |ULTIMATE.start_append_#t~ret27#1.base| (store (select |v_#memory_$Pointer$.offset_201| |ULTIMATE.start_append_#t~ret27#1.base|) 12 0))))) (= |ULTIMATE.start_main_~#list~0#1.base| |ULTIMATE.start_append_~pointerToList#1.base|))) (not (= (select |#valid| |v_ULTIMATE.start_append_~node~0#1.base_27|) 1)))) (= |ULTIMATE.start_append_#t~ret27#1.offset| 0) (= |ULTIMATE.start_append_~node~0#1.offset| 0))' at error location [2024-11-13 23:38:12,039 WARN L311 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: ALGORITHM_FAILED [2024-11-13 23:38:12,039 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2024-11-13 23:38:12,039 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [8, 7] total 12 [2024-11-13 23:38:12,039 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [887079877] [2024-11-13 23:38:12,039 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2024-11-13 23:38:12,040 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 13 states [2024-11-13 23:38:12,040 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2024-11-13 23:38:12,040 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2024-11-13 23:38:12,041 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=113, Invalid=946, Unknown=1, NotChecked=62, Total=1122 [2024-11-13 23:38:12,041 INFO L87 Difference]: Start difference. First operand 298 states and 343 transitions. Second operand has 13 states, 12 states have (on average 5.416666666666667) internal successors, (65), 12 states have internal predecessors, (65), 1 states have call successors, (1), 1 states have call predecessors, (1), 2 states have return successors, (2), 2 states have call predecessors, (2), 1 states have call successors, (2) [2024-11-13 23:38:15,849 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-13 23:38:15,849 INFO L93 Difference]: Finished difference Result 299 states and 341 transitions. [2024-11-13 23:38:15,850 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2024-11-13 23:38:15,850 INFO L78 Accepts]: Start accepts. Automaton has has 13 states, 12 states have (on average 5.416666666666667) internal successors, (65), 12 states have internal predecessors, (65), 1 states have call successors, (1), 1 states have call predecessors, (1), 2 states have return successors, (2), 2 states have call predecessors, (2), 1 states have call successors, (2) Word has length 44 [2024-11-13 23:38:15,850 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-13 23:38:15,851 INFO L225 Difference]: With dead ends: 299 [2024-11-13 23:38:15,851 INFO L226 Difference]: Without dead ends: 299 [2024-11-13 23:38:15,852 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 104 GetRequests, 61 SyntacticMatches, 5 SemanticMatches, 38 ConstructedPredicates, 1 IntricatePredicates, 0 DeprecatedPredicates, 448 ImplicationChecksByTransitivity, 17.4s TimeCoverageRelationStatistics Valid=158, Invalid=1327, Unknown=1, NotChecked=74, Total=1560 [2024-11-13 23:38:15,853 INFO L432 NwaCegarLoop]: 84 mSDtfsCounter, 57 mSDsluCounter, 278 mSDsCounter, 0 mSdLazyCounter, 478 mSolverCounterSat, 17 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 2.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 57 SdHoareTripleChecker+Valid, 362 SdHoareTripleChecker+Invalid, 610 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 17 IncrementalHoareTripleChecker+Valid, 478 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 115 IncrementalHoareTripleChecker+Unchecked, 2.6s IncrementalHoareTripleChecker+Time [2024-11-13 23:38:15,853 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [57 Valid, 362 Invalid, 610 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [17 Valid, 478 Invalid, 0 Unknown, 115 Unchecked, 2.6s Time] [2024-11-13 23:38:15,854 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 299 states. [2024-11-13 23:38:15,863 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 299 to 298. [2024-11-13 23:38:15,864 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 298 states, 252 states have (on average 1.3055555555555556) internal successors, (329), 288 states have internal predecessors, (329), 3 states have call successors, (3), 3 states have call predecessors, (3), 6 states have return successors, (9), 6 states have call predecessors, (9), 3 states have call successors, (9) [2024-11-13 23:38:15,865 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 298 states to 298 states and 341 transitions. [2024-11-13 23:38:15,865 INFO L78 Accepts]: Start accepts. Automaton has 298 states and 341 transitions. Word has length 44 [2024-11-13 23:38:15,865 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-13 23:38:15,866 INFO L471 AbstractCegarLoop]: Abstraction has 298 states and 341 transitions. [2024-11-13 23:38:15,866 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 13 states, 12 states have (on average 5.416666666666667) internal successors, (65), 12 states have internal predecessors, (65), 1 states have call successors, (1), 1 states have call predecessors, (1), 2 states have return successors, (2), 2 states have call predecessors, (2), 1 states have call successors, (2) [2024-11-13 23:38:15,866 INFO L276 IsEmpty]: Start isEmpty. Operand 298 states and 341 transitions. [2024-11-13 23:38:15,867 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 46 [2024-11-13 23:38:15,868 INFO L207 NwaCegarLoop]: Found error trace [2024-11-13 23:38:15,868 INFO L215 NwaCegarLoop]: trace histogram [3, 3, 3, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-13 23:38:15,891 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_2bb9ae36-a0c5-4c2e-87da-07b477e49f29/bin/utaipan-verify-sOmjnqqW8E/z3 -smt2 -in SMTLIB2_COMPLIANT=true (11)] Forceful destruction successful, exit code 0 [2024-11-13 23:38:16,069 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable34,11 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_2bb9ae36-a0c5-4c2e-87da-07b477e49f29/bin/utaipan-verify-sOmjnqqW8E/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-13 23:38:16,070 INFO L396 AbstractCegarLoop]: === Iteration 36 === Targeting ULTIMATE.startErr14REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [create_dataErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, create_dataErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, create_dataErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 89 more)] === [2024-11-13 23:38:16,070 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-13 23:38:16,070 INFO L85 PathProgramCache]: Analyzing trace with hash 142565820, now seen corresponding path program 1 times [2024-11-13 23:38:16,070 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2024-11-13 23:38:16,070 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2013500854] [2024-11-13 23:38:16,070 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-13 23:38:16,070 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-13 23:38:16,101 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 23:38:16,940 INFO L134 CoverageAnalysis]: Checked inductivity of 17 backedges. 0 proven. 7 refuted. 0 times theorem prover too weak. 10 trivial. 0 not checked. [2024-11-13 23:38:16,940 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2024-11-13 23:38:16,940 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2013500854] [2024-11-13 23:38:16,940 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2013500854] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-13 23:38:16,940 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [415506407] [2024-11-13 23:38:16,941 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-13 23:38:16,941 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-13 23:38:16,941 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_2bb9ae36-a0c5-4c2e-87da-07b477e49f29/bin/utaipan-verify-sOmjnqqW8E/z3 [2024-11-13 23:38:16,943 INFO L229 MonitoredProcess]: Starting monitored process 12 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_2bb9ae36-a0c5-4c2e-87da-07b477e49f29/bin/utaipan-verify-sOmjnqqW8E/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-11-13 23:38:16,944 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_2bb9ae36-a0c5-4c2e-87da-07b477e49f29/bin/utaipan-verify-sOmjnqqW8E/z3 -smt2 -in SMTLIB2_COMPLIANT=true (12)] Waiting until timeout for monitored process [2024-11-13 23:38:17,179 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 23:38:17,195 INFO L255 TraceCheckSpWp]: Trace formula consists of 371 conjuncts, 10 conjuncts are in the unsatisfiable core [2024-11-13 23:38:17,200 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-13 23:38:17,403 WARN L873 $PredicateComparison]: unable to prove that (or (exists ((create_data_~data~0.base Int) (|create_data_#t~malloc7.base| Int)) (and (= (select |c_old(#valid)| create_data_~data~0.base) 0) (= |c_#valid| (store (store |c_old(#valid)| create_data_~data~0.base (select |c_#valid| create_data_~data~0.base)) |create_data_#t~malloc7.base| 1)) (not (= create_data_~data~0.base |create_data_#t~malloc7.base|)))) (exists ((create_data_~data~0.base Int)) (and (= |c_#valid| (store |c_old(#valid)| create_data_~data~0.base 1)) (= (select |c_old(#valid)| create_data_~data~0.base) 0)))) is different from true [2024-11-13 23:38:20,089 INFO L349 Elim1Store]: treesize reduction 104, result has 34.2 percent of original size [2024-11-13 23:38:20,089 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 2 stores, 3 select indices, 3 select index equivalence classes, 0 disjoint index pairs (out of 3 index pairs), introduced 5 new quantified variables, introduced 9 case distinctions, treesize of input 40 treesize of output 104 [2024-11-13 23:38:21,494 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 12 treesize of output 9 [2024-11-13 23:38:21,750 INFO L349 Elim1Store]: treesize reduction 43, result has 28.3 percent of original size [2024-11-13 23:38:21,750 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 3 select indices, 3 select index equivalence classes, 1 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 7 case distinctions, treesize of input 34 treesize of output 33 [2024-11-13 23:38:21,820 INFO L349 Elim1Store]: treesize reduction 18, result has 5.3 percent of original size [2024-11-13 23:38:21,820 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 3 case distinctions, treesize of input 24 treesize of output 14 [2024-11-13 23:38:22,157 INFO L349 Elim1Store]: treesize reduction 15, result has 21.1 percent of original size [2024-11-13 23:38:22,157 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 3 case distinctions, treesize of input 22 treesize of output 16 [2024-11-13 23:38:22,251 INFO L134 CoverageAnalysis]: Checked inductivity of 17 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 17 trivial. 0 not checked. [2024-11-13 23:38:22,251 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-11-13 23:38:22,251 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [415506407] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-13 23:38:22,251 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2024-11-13 23:38:22,251 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [8] total 9 [2024-11-13 23:38:22,252 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1017150985] [2024-11-13 23:38:22,252 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-13 23:38:22,252 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2024-11-13 23:38:22,252 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2024-11-13 23:38:22,252 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2024-11-13 23:38:22,252 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=20, Invalid=55, Unknown=1, NotChecked=14, Total=90 [2024-11-13 23:38:22,253 INFO L87 Difference]: Start difference. First operand 298 states and 341 transitions. Second operand has 5 states, 4 states have (on average 8.75) internal successors, (35), 5 states have internal predecessors, (35), 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) [2024-11-13 23:38:23,006 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-13 23:38:23,006 INFO L93 Difference]: Finished difference Result 298 states and 340 transitions. [2024-11-13 23:38:23,007 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-11-13 23:38:23,008 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 4 states have (on average 8.75) internal successors, (35), 5 states have internal predecessors, (35), 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 45 [2024-11-13 23:38:23,008 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-13 23:38:23,009 INFO L225 Difference]: With dead ends: 298 [2024-11-13 23:38:23,009 INFO L226 Difference]: Without dead ends: 298 [2024-11-13 23:38:23,009 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 53 GetRequests, 44 SyntacticMatches, 1 SemanticMatches, 8 ConstructedPredicates, 1 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=20, Invalid=55, Unknown=1, NotChecked=14, Total=90 [2024-11-13 23:38:23,010 INFO L432 NwaCegarLoop]: 89 mSDtfsCounter, 15 mSDsluCounter, 78 mSDsCounter, 0 mSdLazyCounter, 132 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.7s Time, 0 mProtectedPredicate, 0 mProtectedAction, 15 SdHoareTripleChecker+Valid, 167 SdHoareTripleChecker+Invalid, 311 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 132 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 177 IncrementalHoareTripleChecker+Unchecked, 0.7s IncrementalHoareTripleChecker+Time [2024-11-13 23:38:23,010 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [15 Valid, 167 Invalid, 311 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 132 Invalid, 0 Unknown, 177 Unchecked, 0.7s Time] [2024-11-13 23:38:23,011 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 298 states. [2024-11-13 23:38:23,019 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 298 to 275. [2024-11-13 23:38:23,020 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 275 states, 230 states have (on average 1.3130434782608695) internal successors, (302), 266 states have internal predecessors, (302), 3 states have call successors, (3), 3 states have call predecessors, (3), 5 states have return successors, (7), 5 states have call predecessors, (7), 3 states have call successors, (7) [2024-11-13 23:38:23,021 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 275 states to 275 states and 312 transitions. [2024-11-13 23:38:23,021 INFO L78 Accepts]: Start accepts. Automaton has 275 states and 312 transitions. Word has length 45 [2024-11-13 23:38:23,021 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-13 23:38:23,022 INFO L471 AbstractCegarLoop]: Abstraction has 275 states and 312 transitions. [2024-11-13 23:38:23,022 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 4 states have (on average 8.75) internal successors, (35), 5 states have internal predecessors, (35), 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) [2024-11-13 23:38:23,022 INFO L276 IsEmpty]: Start isEmpty. Operand 275 states and 312 transitions. [2024-11-13 23:38:23,024 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 46 [2024-11-13 23:38:23,024 INFO L207 NwaCegarLoop]: Found error trace [2024-11-13 23:38:23,024 INFO L215 NwaCegarLoop]: trace histogram [3, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-13 23:38:23,050 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_2bb9ae36-a0c5-4c2e-87da-07b477e49f29/bin/utaipan-verify-sOmjnqqW8E/z3 -smt2 -in SMTLIB2_COMPLIANT=true (12)] Ended with exit code 0 [2024-11-13 23:38:23,224 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 12 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_2bb9ae36-a0c5-4c2e-87da-07b477e49f29/bin/utaipan-verify-sOmjnqqW8E/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable35 [2024-11-13 23:38:23,225 INFO L396 AbstractCegarLoop]: === Iteration 37 === Targeting ULTIMATE.startErr30REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [create_dataErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, create_dataErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, create_dataErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 89 more)] === [2024-11-13 23:38:23,226 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-13 23:38:23,226 INFO L85 PathProgramCache]: Analyzing trace with hash 243048554, now seen corresponding path program 1 times [2024-11-13 23:38:23,226 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2024-11-13 23:38:23,226 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [115365461] [2024-11-13 23:38:23,226 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-13 23:38:23,227 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-13 23:38:23,262 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 23:38:23,510 INFO L134 CoverageAnalysis]: Checked inductivity of 12 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 12 trivial. 0 not checked. [2024-11-13 23:38:23,510 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2024-11-13 23:38:23,510 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [115365461] [2024-11-13 23:38:23,512 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [115365461] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-13 23:38:23,512 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-13 23:38:23,512 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2024-11-13 23:38:23,512 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1028340540] [2024-11-13 23:38:23,515 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-13 23:38:23,515 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2024-11-13 23:38:23,515 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2024-11-13 23:38:23,516 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2024-11-13 23:38:23,516 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2024-11-13 23:38:23,516 INFO L87 Difference]: Start difference. First operand 275 states and 312 transitions. Second operand has 5 states, 4 states have (on average 9.25) internal successors, (37), 5 states have internal predecessors, (37), 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) [2024-11-13 23:38:25,315 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-13 23:38:25,315 INFO L93 Difference]: Finished difference Result 294 states and 332 transitions. [2024-11-13 23:38:25,315 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-11-13 23:38:25,315 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 4 states have (on average 9.25) internal successors, (37), 5 states have internal predecessors, (37), 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 45 [2024-11-13 23:38:25,315 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-13 23:38:25,317 INFO L225 Difference]: With dead ends: 294 [2024-11-13 23:38:25,317 INFO L226 Difference]: Without dead ends: 294 [2024-11-13 23:38:25,317 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2024-11-13 23:38:25,317 INFO L432 NwaCegarLoop]: 85 mSDtfsCounter, 25 mSDsluCounter, 174 mSDsCounter, 0 mSdLazyCounter, 230 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.7s Time, 0 mProtectedPredicate, 0 mProtectedAction, 25 SdHoareTripleChecker+Valid, 259 SdHoareTripleChecker+Invalid, 231 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 230 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.7s IncrementalHoareTripleChecker+Time [2024-11-13 23:38:25,318 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [25 Valid, 259 Invalid, 231 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 230 Invalid, 0 Unknown, 0 Unchecked, 1.7s Time] [2024-11-13 23:38:25,318 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 294 states. [2024-11-13 23:38:25,324 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 294 to 279. [2024-11-13 23:38:25,324 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 279 states, 234 states have (on average 1.3162393162393162) internal successors, (308), 270 states have internal predecessors, (308), 3 states have call successors, (3), 3 states have call predecessors, (3), 5 states have return successors, (7), 5 states have call predecessors, (7), 3 states have call successors, (7) [2024-11-13 23:38:25,326 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 279 states to 279 states and 318 transitions. [2024-11-13 23:38:25,326 INFO L78 Accepts]: Start accepts. Automaton has 279 states and 318 transitions. Word has length 45 [2024-11-13 23:38:25,326 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-13 23:38:25,327 INFO L471 AbstractCegarLoop]: Abstraction has 279 states and 318 transitions. [2024-11-13 23:38:25,327 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 4 states have (on average 9.25) internal successors, (37), 5 states have internal predecessors, (37), 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) [2024-11-13 23:38:25,327 INFO L276 IsEmpty]: Start isEmpty. Operand 279 states and 318 transitions. [2024-11-13 23:38:25,328 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 46 [2024-11-13 23:38:25,328 INFO L207 NwaCegarLoop]: Found error trace [2024-11-13 23:38:25,328 INFO L215 NwaCegarLoop]: trace histogram [3, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-13 23:38:25,328 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable36 [2024-11-13 23:38:25,328 INFO L396 AbstractCegarLoop]: === Iteration 38 === Targeting ULTIMATE.startErr31REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [create_dataErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, create_dataErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, create_dataErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 89 more)] === [2024-11-13 23:38:25,329 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-13 23:38:25,329 INFO L85 PathProgramCache]: Analyzing trace with hash 243048555, now seen corresponding path program 1 times [2024-11-13 23:38:25,329 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2024-11-13 23:38:25,329 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2073359371] [2024-11-13 23:38:25,329 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-13 23:38:25,329 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-13 23:38:25,365 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 23:38:27,501 INFO L134 CoverageAnalysis]: Checked inductivity of 12 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 12 trivial. 0 not checked. [2024-11-13 23:38:27,501 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2024-11-13 23:38:27,501 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2073359371] [2024-11-13 23:38:27,501 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2073359371] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-13 23:38:27,501 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-13 23:38:27,501 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [13] imperfect sequences [] total 13 [2024-11-13 23:38:27,501 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [996180202] [2024-11-13 23:38:27,501 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-13 23:38:27,502 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 13 states [2024-11-13 23:38:27,502 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2024-11-13 23:38:27,502 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2024-11-13 23:38:27,503 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=26, Invalid=130, Unknown=0, NotChecked=0, Total=156 [2024-11-13 23:38:27,503 INFO L87 Difference]: Start difference. First operand 279 states and 318 transitions. Second operand has 13 states, 13 states have (on average 2.8461538461538463) internal successors, (37), 12 states have internal predecessors, (37), 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) [2024-11-13 23:38:32,169 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-13 23:38:32,169 INFO L93 Difference]: Finished difference Result 347 states and 403 transitions. [2024-11-13 23:38:32,169 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 17 states. [2024-11-13 23:38:32,169 INFO L78 Accepts]: Start accepts. Automaton has has 13 states, 13 states have (on average 2.8461538461538463) internal successors, (37), 12 states have internal predecessors, (37), 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 45 [2024-11-13 23:38:32,170 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-13 23:38:32,171 INFO L225 Difference]: With dead ends: 347 [2024-11-13 23:38:32,171 INFO L226 Difference]: Without dead ends: 347 [2024-11-13 23:38:32,171 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 25 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 23 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 79 ImplicationChecksByTransitivity, 2.6s TimeCoverageRelationStatistics Valid=112, Invalid=488, Unknown=0, NotChecked=0, Total=600 [2024-11-13 23:38:32,172 INFO L432 NwaCegarLoop]: 72 mSDtfsCounter, 261 mSDsluCounter, 556 mSDsCounter, 0 mSdLazyCounter, 573 mSolverCounterSat, 21 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 3.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 261 SdHoareTripleChecker+Valid, 628 SdHoareTripleChecker+Invalid, 594 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 21 IncrementalHoareTripleChecker+Valid, 573 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 3.2s IncrementalHoareTripleChecker+Time [2024-11-13 23:38:32,172 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [261 Valid, 628 Invalid, 594 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [21 Valid, 573 Invalid, 0 Unknown, 0 Unchecked, 3.2s Time] [2024-11-13 23:38:32,172 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 347 states. [2024-11-13 23:38:32,179 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 347 to 283. [2024-11-13 23:38:32,179 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 283 states, 238 states have (on average 1.315126050420168) internal successors, (313), 274 states have internal predecessors, (313), 3 states have call successors, (3), 3 states have call predecessors, (3), 5 states have return successors, (7), 5 states have call predecessors, (7), 3 states have call successors, (7) [2024-11-13 23:38:32,181 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 283 states to 283 states and 323 transitions. [2024-11-13 23:38:32,181 INFO L78 Accepts]: Start accepts. Automaton has 283 states and 323 transitions. Word has length 45 [2024-11-13 23:38:32,181 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-13 23:38:32,181 INFO L471 AbstractCegarLoop]: Abstraction has 283 states and 323 transitions. [2024-11-13 23:38:32,182 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 13 states, 13 states have (on average 2.8461538461538463) internal successors, (37), 12 states have internal predecessors, (37), 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) [2024-11-13 23:38:32,182 INFO L276 IsEmpty]: Start isEmpty. Operand 283 states and 323 transitions. [2024-11-13 23:38:32,182 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 46 [2024-11-13 23:38:32,182 INFO L207 NwaCegarLoop]: Found error trace [2024-11-13 23:38:32,182 INFO L215 NwaCegarLoop]: trace histogram [3, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-13 23:38:32,183 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable37 [2024-11-13 23:38:32,183 INFO L396 AbstractCegarLoop]: === Iteration 39 === Targeting ULTIMATE.startErr51ASSERT_VIOLATIONMEMORY_LEAK === [create_dataErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, create_dataErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, create_dataErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 89 more)] === [2024-11-13 23:38:32,183 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-13 23:38:32,183 INFO L85 PathProgramCache]: Analyzing trace with hash 243048134, now seen corresponding path program 1 times [2024-11-13 23:38:32,183 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2024-11-13 23:38:32,184 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [139649896] [2024-11-13 23:38:32,184 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-13 23:38:32,184 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-13 23:38:32,227 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 23:38:32,606 INFO L134 CoverageAnalysis]: Checked inductivity of 12 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 12 trivial. 0 not checked. [2024-11-13 23:38:32,606 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2024-11-13 23:38:32,606 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [139649896] [2024-11-13 23:38:32,606 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [139649896] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-13 23:38:32,606 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-13 23:38:32,607 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2024-11-13 23:38:32,607 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [673374599] [2024-11-13 23:38:32,607 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-13 23:38:32,607 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2024-11-13 23:38:32,607 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2024-11-13 23:38:32,608 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2024-11-13 23:38:32,608 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2024-11-13 23:38:32,608 INFO L87 Difference]: Start difference. First operand 283 states and 323 transitions. Second operand has 5 states, 5 states have (on average 7.4) internal successors, (37), 5 states have internal predecessors, (37), 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) [2024-11-13 23:38:33,761 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-13 23:38:33,761 INFO L93 Difference]: Finished difference Result 311 states and 350 transitions. [2024-11-13 23:38:33,761 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2024-11-13 23:38:33,761 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 7.4) internal successors, (37), 5 states have internal predecessors, (37), 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 45 [2024-11-13 23:38:33,762 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-13 23:38:33,762 INFO L225 Difference]: With dead ends: 311 [2024-11-13 23:38:33,763 INFO L226 Difference]: Without dead ends: 309 [2024-11-13 23:38:33,763 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=15, Invalid=27, Unknown=0, NotChecked=0, Total=42 [2024-11-13 23:38:33,763 INFO L432 NwaCegarLoop]: 78 mSDtfsCounter, 47 mSDsluCounter, 206 mSDsCounter, 0 mSdLazyCounter, 187 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 48 SdHoareTripleChecker+Valid, 284 SdHoareTripleChecker+Invalid, 187 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 187 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.0s IncrementalHoareTripleChecker+Time [2024-11-13 23:38:33,763 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [48 Valid, 284 Invalid, 187 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 187 Invalid, 0 Unknown, 0 Unchecked, 1.0s Time] [2024-11-13 23:38:33,764 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 309 states. [2024-11-13 23:38:33,770 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 309 to 281. [2024-11-13 23:38:33,770 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 281 states, 236 states have (on average 1.3093220338983051) internal successors, (309), 272 states have internal predecessors, (309), 3 states have call successors, (3), 3 states have call predecessors, (3), 5 states have return successors, (7), 5 states have call predecessors, (7), 3 states have call successors, (7) [2024-11-13 23:38:33,772 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 281 states to 281 states and 319 transitions. [2024-11-13 23:38:33,772 INFO L78 Accepts]: Start accepts. Automaton has 281 states and 319 transitions. Word has length 45 [2024-11-13 23:38:33,772 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-13 23:38:33,772 INFO L471 AbstractCegarLoop]: Abstraction has 281 states and 319 transitions. [2024-11-13 23:38:33,773 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 7.4) internal successors, (37), 5 states have internal predecessors, (37), 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) [2024-11-13 23:38:33,773 INFO L276 IsEmpty]: Start isEmpty. Operand 281 states and 319 transitions. [2024-11-13 23:38:33,773 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 46 [2024-11-13 23:38:33,774 INFO L207 NwaCegarLoop]: Found error trace [2024-11-13 23:38:33,774 INFO L215 NwaCegarLoop]: trace histogram [3, 3, 3, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-13 23:38:33,774 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable38 [2024-11-13 23:38:33,774 INFO L396 AbstractCegarLoop]: === Iteration 40 === Targeting ULTIMATE.startErr6REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [create_dataErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, create_dataErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, create_dataErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 89 more)] === [2024-11-13 23:38:33,775 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-13 23:38:33,775 INFO L85 PathProgramCache]: Analyzing trace with hash 4147807, now seen corresponding path program 1 times [2024-11-13 23:38:33,775 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2024-11-13 23:38:33,775 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1656559706] [2024-11-13 23:38:33,775 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-13 23:38:33,775 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-13 23:38:33,823 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 23:38:36,019 INFO L134 CoverageAnalysis]: Checked inductivity of 14 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 12 trivial. 0 not checked. [2024-11-13 23:38:36,019 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2024-11-13 23:38:36,019 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1656559706] [2024-11-13 23:38:36,019 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1656559706] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-13 23:38:36,019 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1867038691] [2024-11-13 23:38:36,019 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-13 23:38:36,019 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-13 23:38:36,019 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_2bb9ae36-a0c5-4c2e-87da-07b477e49f29/bin/utaipan-verify-sOmjnqqW8E/z3 [2024-11-13 23:38:36,022 INFO L229 MonitoredProcess]: Starting monitored process 13 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_2bb9ae36-a0c5-4c2e-87da-07b477e49f29/bin/utaipan-verify-sOmjnqqW8E/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-11-13 23:38:36,024 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_2bb9ae36-a0c5-4c2e-87da-07b477e49f29/bin/utaipan-verify-sOmjnqqW8E/z3 -smt2 -in SMTLIB2_COMPLIANT=true (13)] Waiting until timeout for monitored process [2024-11-13 23:38:36,331 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 23:38:36,333 INFO L255 TraceCheckSpWp]: Trace formula consists of 447 conjuncts, 14 conjuncts are in the unsatisfiable core [2024-11-13 23:38:36,335 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-13 23:38:36,350 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 6 treesize of output 5 [2024-11-13 23:38:39,451 INFO L349 Elim1Store]: treesize reduction 181, result has 16.6 percent of original size [2024-11-13 23:38:39,451 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 3 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 4 new quantified variables, introduced 7 case distinctions, treesize of input 59 treesize of output 165