./Ultimate.py --spec ../../sv-benchmarks/c/properties/valid-memsafety.prp --file ../../sv-benchmarks/c/forester-heap/sll-sorted-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_2088ea77-1acf-4d0c-88ef-23be095c4621/bin/utaipan-verify-sOmjnqqW8E/data/config -Xmx15G -Xms4m -jar /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_2088ea77-1acf-4d0c-88ef-23be095c4621/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_2088ea77-1acf-4d0c-88ef-23be095c4621/bin/utaipan-verify-sOmjnqqW8E/data -tc /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_2088ea77-1acf-4d0c-88ef-23be095c4621/bin/utaipan-verify-sOmjnqqW8E/config/TaipanMemDerefMemtrack.xml -i ../../sv-benchmarks/c/forester-heap/sll-sorted-2.i -s /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_2088ea77-1acf-4d0c-88ef-23be095c4621/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_2088ea77-1acf-4d0c-88ef-23be095c4621/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 618946a6e113450d0f3efa55a455801e1c2225c3ba6f88e87a9e8ad02019b85f --- Real Ultimate output --- This is Ultimate 0.3.0-dev-826ab2b [2024-11-14 03:56:05,695 INFO L188 SettingsManager]: Resetting all preferences to default values... [2024-11-14 03:56:05,799 INFO L114 SettingsManager]: Loading settings from /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_2088ea77-1acf-4d0c-88ef-23be095c4621/bin/utaipan-verify-sOmjnqqW8E/config/svcomp-DerefFreeMemtrack-32bit-Taipan_Default.epf [2024-11-14 03:56:05,810 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2024-11-14 03:56:05,811 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2024-11-14 03:56:05,848 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2024-11-14 03:56:05,850 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2024-11-14 03:56:05,850 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2024-11-14 03:56:05,851 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2024-11-14 03:56:05,851 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2024-11-14 03:56:05,851 INFO L153 SettingsManager]: * User list type=DISABLED [2024-11-14 03:56:05,852 INFO L151 SettingsManager]: Preferences of Abstract Interpretation differ from their defaults: [2024-11-14 03:56:05,852 INFO L153 SettingsManager]: * Explicit value domain=true [2024-11-14 03:56:05,853 INFO L153 SettingsManager]: * Abstract domain for RCFG-of-the-future=PoormanAbstractDomain [2024-11-14 03:56:05,853 INFO L153 SettingsManager]: * Octagon Domain=false [2024-11-14 03:56:05,853 INFO L153 SettingsManager]: * Abstract domain=CompoundDomain [2024-11-14 03:56:05,853 INFO L153 SettingsManager]: * Check feasibility of abstract posts with an SMT solver=true [2024-11-14 03:56:05,853 INFO L153 SettingsManager]: * Use the RCFG-of-the-future interface=true [2024-11-14 03:56:05,853 INFO L153 SettingsManager]: * Interval Domain=false [2024-11-14 03:56:05,854 INFO L151 SettingsManager]: Preferences of Sifa differ from their defaults: [2024-11-14 03:56:05,854 INFO L153 SettingsManager]: * Call Summarizer=TopInputCallSummarizer [2024-11-14 03:56:05,855 INFO L153 SettingsManager]: * Simplification Technique=POLY_PAC [2024-11-14 03:56:05,855 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2024-11-14 03:56:05,855 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2024-11-14 03:56:05,855 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2024-11-14 03:56:05,855 INFO L153 SettingsManager]: * sizeof long=4 [2024-11-14 03:56:05,856 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2024-11-14 03:56:05,856 INFO L153 SettingsManager]: * sizeof POINTER=4 [2024-11-14 03:56:05,856 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2024-11-14 03:56:05,856 INFO L153 SettingsManager]: * Check for the main procedure if all allocated memory was freed=true [2024-11-14 03:56:05,857 INFO L153 SettingsManager]: * Bitprecise bitfields=true [2024-11-14 03:56:05,857 INFO L153 SettingsManager]: * SV-COMP memtrack compatibility mode=true [2024-11-14 03:56:05,857 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2024-11-14 03:56:05,857 INFO L153 SettingsManager]: * Adapt memory model on pointer casts if necessary=true [2024-11-14 03:56:05,857 INFO L153 SettingsManager]: * Allow undefined functions=false [2024-11-14 03:56:05,857 INFO L153 SettingsManager]: * Check unreachability of reach_error function=false [2024-11-14 03:56:05,857 INFO L153 SettingsManager]: * sizeof long double=12 [2024-11-14 03:56:05,857 INFO L153 SettingsManager]: * Use constant arrays=true [2024-11-14 03:56:05,858 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2024-11-14 03:56:05,858 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2024-11-14 03:56:05,859 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2024-11-14 03:56:05,859 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2024-11-14 03:56:05,859 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2024-11-14 03:56:05,859 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2024-11-14 03:56:05,859 INFO L153 SettingsManager]: * Trace refinement strategy=SIFA_TAIPAN [2024-11-14 03:56:05,859 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2024-11-14 03:56:05,859 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2024-11-14 03:56:05,860 INFO L153 SettingsManager]: * Trace refinement exception blacklist=NONE [2024-11-14 03:56:05,860 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2024-11-14 03:56:05,860 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_2088ea77-1acf-4d0c-88ef-23be095c4621/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 -> 618946a6e113450d0f3efa55a455801e1c2225c3ba6f88e87a9e8ad02019b85f [2024-11-14 03:56:06,240 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2024-11-14 03:56:06,253 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2024-11-14 03:56:06,256 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2024-11-14 03:56:06,258 INFO L270 PluginConnector]: Initializing CDTParser... [2024-11-14 03:56:06,258 INFO L274 PluginConnector]: CDTParser initialized [2024-11-14 03:56:06,261 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_2088ea77-1acf-4d0c-88ef-23be095c4621/bin/utaipan-verify-sOmjnqqW8E/../../sv-benchmarks/c/forester-heap/sll-sorted-2.i Unable to find full path for "g++" [2024-11-14 03:56:08,276 INFO L533 CDTParser]: Created temporary CDT project at NULL [2024-11-14 03:56:08,555 INFO L384 CDTParser]: Found 1 translation units. [2024-11-14 03:56:08,555 INFO L180 CDTParser]: Scanning /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_2088ea77-1acf-4d0c-88ef-23be095c4621/sv-benchmarks/c/forester-heap/sll-sorted-2.i [2024-11-14 03:56:08,567 INFO L427 CDTParser]: About to delete temporary CDT project at /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_2088ea77-1acf-4d0c-88ef-23be095c4621/bin/utaipan-verify-sOmjnqqW8E/data/9b53222d1/cffd93bb635c4be68f6f11efd383f543/FLAG958b86233 [2024-11-14 03:56:08,582 INFO L435 CDTParser]: Successfully deleted /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_2088ea77-1acf-4d0c-88ef-23be095c4621/bin/utaipan-verify-sOmjnqqW8E/data/9b53222d1/cffd93bb635c4be68f6f11efd383f543 [2024-11-14 03:56:08,584 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2024-11-14 03:56:08,586 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2024-11-14 03:56:08,587 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2024-11-14 03:56:08,587 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2024-11-14 03:56:08,592 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2024-11-14 03:56:08,593 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 14.11 03:56:08" (1/1) ... [2024-11-14 03:56:08,594 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@366783fd and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.11 03:56:08, skipping insertion in model container [2024-11-14 03:56:08,594 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 14.11 03:56:08" (1/1) ... [2024-11-14 03:56:08,630 INFO L175 MainTranslator]: Built tables and reachable declarations [2024-11-14 03:56:08,893 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-11-14 03:56:08,902 INFO L200 MainTranslator]: Completed pre-run [2024-11-14 03:56:08,955 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-11-14 03:56:08,994 INFO L204 MainTranslator]: Completed translation [2024-11-14 03:56:08,995 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.11 03:56:08 WrapperNode [2024-11-14 03:56:08,995 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2024-11-14 03:56:08,996 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2024-11-14 03:56:08,997 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2024-11-14 03:56:08,997 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2024-11-14 03:56:09,003 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.11 03:56:08" (1/1) ... [2024-11-14 03:56:09,023 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.11 03:56:08" (1/1) ... [2024-11-14 03:56:09,049 INFO L138 Inliner]: procedures = 119, calls = 47, calls flagged for inlining = 2, calls inlined = 2, statements flattened = 188 [2024-11-14 03:56:09,049 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2024-11-14 03:56:09,050 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2024-11-14 03:56:09,050 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2024-11-14 03:56:09,050 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2024-11-14 03:56:09,059 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.11 03:56:08" (1/1) ... [2024-11-14 03:56:09,059 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.11 03:56:08" (1/1) ... [2024-11-14 03:56:09,064 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.11 03:56:08" (1/1) ... [2024-11-14 03:56:09,064 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.11 03:56:08" (1/1) ... [2024-11-14 03:56:09,074 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.11 03:56:08" (1/1) ... [2024-11-14 03:56:09,079 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.11 03:56:08" (1/1) ... [2024-11-14 03:56:09,081 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.11 03:56:08" (1/1) ... [2024-11-14 03:56:09,082 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.11 03:56:08" (1/1) ... [2024-11-14 03:56:09,085 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2024-11-14 03:56:09,086 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2024-11-14 03:56:09,086 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2024-11-14 03:56:09,086 INFO L274 PluginConnector]: RCFGBuilder initialized [2024-11-14 03:56:09,094 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.11 03:56:08" (1/1) ... [2024-11-14 03:56:09,100 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2024-11-14 03:56:09,120 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_2088ea77-1acf-4d0c-88ef-23be095c4621/bin/utaipan-verify-sOmjnqqW8E/z3 [2024-11-14 03:56:09,135 INFO L229 MonitoredProcess]: Starting monitored process 1 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_2088ea77-1acf-4d0c-88ef-23be095c4621/bin/utaipan-verify-sOmjnqqW8E/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (exit command is (exit), workingDir is null) [2024-11-14 03:56:09,140 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_2088ea77-1acf-4d0c-88ef-23be095c4621/bin/utaipan-verify-sOmjnqqW8E/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (1)] Waiting until timeout for monitored process [2024-11-14 03:56:09,169 INFO L130 BoogieDeclarations]: Found specification of procedure reach_error [2024-11-14 03:56:09,169 INFO L138 BoogieDeclarations]: Found implementation of procedure reach_error [2024-11-14 03:56:09,169 INFO L130 BoogieDeclarations]: Found specification of procedure read~int [2024-11-14 03:56:09,169 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2024-11-14 03:56:09,169 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnHeap [2024-11-14 03:56:09,170 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2024-11-14 03:56:09,170 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$ [2024-11-14 03:56:09,170 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$ [2024-11-14 03:56:09,170 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2024-11-14 03:56:09,170 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2024-11-14 03:56:09,170 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2024-11-14 03:56:09,170 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2024-11-14 03:56:09,306 INFO L238 CfgBuilder]: Building ICFG [2024-11-14 03:56:09,308 INFO L264 CfgBuilder]: Building CFG for each procedure with an implementation [2024-11-14 03:56:10,006 INFO L? ?]: Removed 143 outVars from TransFormulas that were not future-live. [2024-11-14 03:56:10,006 INFO L287 CfgBuilder]: Performing block encoding [2024-11-14 03:56:10,134 INFO L311 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2024-11-14 03:56:10,134 INFO L316 CfgBuilder]: Removed 20 assume(true) statements. [2024-11-14 03:56:10,134 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 14.11 03:56:10 BoogieIcfgContainer [2024-11-14 03:56:10,134 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2024-11-14 03:56:10,143 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2024-11-14 03:56:10,143 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2024-11-14 03:56:10,148 INFO L274 PluginConnector]: TraceAbstraction initialized [2024-11-14 03:56:10,148 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 14.11 03:56:08" (1/3) ... [2024-11-14 03:56:10,149 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@226f2ca and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 14.11 03:56:10, skipping insertion in model container [2024-11-14 03:56:10,149 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.11 03:56:08" (2/3) ... [2024-11-14 03:56:10,149 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@226f2ca and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 14.11 03:56:10, skipping insertion in model container [2024-11-14 03:56:10,149 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 14.11 03:56:10" (3/3) ... [2024-11-14 03:56:10,152 INFO L112 eAbstractionObserver]: Analyzing ICFG sll-sorted-2.i [2024-11-14 03:56:10,170 INFO L217 ceAbstractionStarter]: Automizer settings: Hoare:None NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2024-11-14 03:56:10,174 INFO L154 ceAbstractionStarter]: Applying trace abstraction to ICFG sll-sorted-2.i that has 2 procedures, 149 locations, 1 initial locations, 13 loop locations, and 65 error locations. [2024-11-14 03:56:10,226 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2024-11-14 03:56:10,242 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;@12fb0197, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2024-11-14 03:56:10,242 INFO L334 AbstractCegarLoop]: Starting to check reachability of 65 error locations. [2024-11-14 03:56:10,247 INFO L276 IsEmpty]: Start isEmpty. Operand has 149 states, 75 states have (on average 2.3466666666666667) internal successors, (176), 140 states have internal predecessors, (176), 7 states have call successors, (7), 1 states have call predecessors, (7), 1 states have return successors, (7), 7 states have call predecessors, (7), 7 states have call successors, (7) [2024-11-14 03:56:10,256 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 3 [2024-11-14 03:56:10,256 INFO L207 NwaCegarLoop]: Found error trace [2024-11-14 03:56:10,256 INFO L215 NwaCegarLoop]: trace histogram [1, 1] [2024-11-14 03:56:10,257 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [reach_errorErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 62 more)] === [2024-11-14 03:56:10,263 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-14 03:56:10,264 INFO L85 PathProgramCache]: Analyzing trace with hash 12971, now seen corresponding path program 1 times [2024-11-14 03:56:10,273 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2024-11-14 03:56:10,274 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1813583282] [2024-11-14 03:56:10,274 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-14 03:56:10,275 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-14 03:56:10,380 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-14 03:56:10,494 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-14 03:56:10,494 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2024-11-14 03:56:10,494 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1813583282] [2024-11-14 03:56:10,495 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1813583282] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-14 03:56:10,495 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-14 03:56:10,500 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2024-11-14 03:56:10,503 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [988053450] [2024-11-14 03:56:10,504 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-14 03:56:10,511 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-14 03:56:10,511 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2024-11-14 03:56:10,540 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-14 03:56:10,541 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-14 03:56:10,544 INFO L87 Difference]: Start difference. First operand has 149 states, 75 states have (on average 2.3466666666666667) internal successors, (176), 140 states have internal predecessors, (176), 7 states have call successors, (7), 1 states have call predecessors, (7), 1 states have return successors, (7), 7 states have call predecessors, (7), 7 states have call successors, (7) Second operand has 3 states, 2 states have (on average 1.0) internal successors, (2), 2 states have internal predecessors, (2), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-14 03:56:10,777 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-14 03:56:10,778 INFO L93 Difference]: Finished difference Result 138 states and 153 transitions. [2024-11-14 03:56:10,779 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-14 03:56:10,781 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 2 states have (on average 1.0) internal successors, (2), 2 states have internal predecessors, (2), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 2 [2024-11-14 03:56:10,781 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-14 03:56:10,789 INFO L225 Difference]: With dead ends: 138 [2024-11-14 03:56:10,789 INFO L226 Difference]: Without dead ends: 137 [2024-11-14 03:56:10,791 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 1 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-14 03:56:10,796 INFO L432 NwaCegarLoop]: 86 mSDtfsCounter, 125 mSDsluCounter, 5 mSDsCounter, 0 mSdLazyCounter, 87 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 125 SdHoareTripleChecker+Valid, 91 SdHoareTripleChecker+Invalid, 90 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 87 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2024-11-14 03:56:10,797 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [125 Valid, 91 Invalid, 90 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 87 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2024-11-14 03:56:10,812 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 137 states. [2024-11-14 03:56:10,832 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 137 to 137. [2024-11-14 03:56:10,833 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 137 states, 67 states have (on average 2.1641791044776117) internal successors, (145), 135 states have internal predecessors, (145), 7 states have call successors, (7), 1 states have call predecessors, (7), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-14 03:56:10,837 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 137 states to 137 states and 152 transitions. [2024-11-14 03:56:10,838 INFO L78 Accepts]: Start accepts. Automaton has 137 states and 152 transitions. Word has length 2 [2024-11-14 03:56:10,839 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-14 03:56:10,839 INFO L471 AbstractCegarLoop]: Abstraction has 137 states and 152 transitions. [2024-11-14 03:56:10,839 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 2 states have (on average 1.0) internal successors, (2), 2 states have internal predecessors, (2), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-14 03:56:10,839 INFO L276 IsEmpty]: Start isEmpty. Operand 137 states and 152 transitions. [2024-11-14 03:56:10,839 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 3 [2024-11-14 03:56:10,839 INFO L207 NwaCegarLoop]: Found error trace [2024-11-14 03:56:10,839 INFO L215 NwaCegarLoop]: trace histogram [1, 1] [2024-11-14 03:56:10,840 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2024-11-14 03:56:10,840 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [reach_errorErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 62 more)] === [2024-11-14 03:56:10,841 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-14 03:56:10,841 INFO L85 PathProgramCache]: Analyzing trace with hash 12972, now seen corresponding path program 1 times [2024-11-14 03:56:10,841 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2024-11-14 03:56:10,841 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1342318269] [2024-11-14 03:56:10,841 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-14 03:56:10,841 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-14 03:56:10,856 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-14 03:56:10,967 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-14 03:56:10,967 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2024-11-14 03:56:10,967 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1342318269] [2024-11-14 03:56:10,968 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1342318269] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-14 03:56:10,968 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-14 03:56:10,968 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2024-11-14 03:56:10,968 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1664776152] [2024-11-14 03:56:10,968 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-14 03:56:10,969 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-14 03:56:10,969 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2024-11-14 03:56:10,970 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-14 03:56:10,970 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-14 03:56:10,971 INFO L87 Difference]: Start difference. First operand 137 states and 152 transitions. Second operand has 3 states, 2 states have (on average 1.0) internal successors, (2), 2 states have internal predecessors, (2), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-14 03:56:11,196 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-14 03:56:11,197 INFO L93 Difference]: Finished difference Result 176 states and 198 transitions. [2024-11-14 03:56:11,197 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-14 03:56:11,197 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 2 states have (on average 1.0) internal successors, (2), 2 states have internal predecessors, (2), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 2 [2024-11-14 03:56:11,197 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-14 03:56:11,198 INFO L225 Difference]: With dead ends: 176 [2024-11-14 03:56:11,199 INFO L226 Difference]: Without dead ends: 176 [2024-11-14 03:56:11,199 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 1 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-14 03:56:11,199 INFO L432 NwaCegarLoop]: 116 mSDtfsCounter, 45 mSDsluCounter, 75 mSDsCounter, 0 mSdLazyCounter, 106 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 45 SdHoareTripleChecker+Valid, 191 SdHoareTripleChecker+Invalid, 107 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 106 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2024-11-14 03:56:11,200 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [45 Valid, 191 Invalid, 107 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 106 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2024-11-14 03:56:11,201 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 176 states. [2024-11-14 03:56:11,214 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 176 to 135. [2024-11-14 03:56:11,215 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 135 states, 67 states have (on average 2.1343283582089554) internal successors, (143), 133 states have internal predecessors, (143), 7 states have call successors, (7), 1 states have call predecessors, (7), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-14 03:56:11,216 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 135 states to 135 states and 150 transitions. [2024-11-14 03:56:11,217 INFO L78 Accepts]: Start accepts. Automaton has 135 states and 150 transitions. Word has length 2 [2024-11-14 03:56:11,217 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-14 03:56:11,217 INFO L471 AbstractCegarLoop]: Abstraction has 135 states and 150 transitions. [2024-11-14 03:56:11,217 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 2 states have (on average 1.0) internal successors, (2), 2 states have internal predecessors, (2), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-14 03:56:11,219 INFO L276 IsEmpty]: Start isEmpty. Operand 135 states and 150 transitions. [2024-11-14 03:56:11,219 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 7 [2024-11-14 03:56:11,219 INFO L207 NwaCegarLoop]: Found error trace [2024-11-14 03:56:11,220 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1] [2024-11-14 03:56:11,220 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2024-11-14 03:56:11,220 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr4REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [reach_errorErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 62 more)] === [2024-11-14 03:56:11,220 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-14 03:56:11,220 INFO L85 PathProgramCache]: Analyzing trace with hash -895491930, now seen corresponding path program 1 times [2024-11-14 03:56:11,220 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2024-11-14 03:56:11,220 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1847581570] [2024-11-14 03:56:11,221 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-14 03:56:11,221 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-14 03:56:11,253 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-14 03:56:11,494 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-14 03:56:11,495 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2024-11-14 03:56:11,495 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1847581570] [2024-11-14 03:56:11,495 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1847581570] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-14 03:56:11,495 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-14 03:56:11,495 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-11-14 03:56:11,495 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [69030698] [2024-11-14 03:56:11,495 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-14 03:56:11,496 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-11-14 03:56:11,496 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2024-11-14 03:56:11,497 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-11-14 03:56:11,498 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-11-14 03:56:11,498 INFO L87 Difference]: Start difference. First operand 135 states and 150 transitions. Second operand has 4 states, 3 states have (on average 2.0) internal successors, (6), 4 states have internal predecessors, (6), 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-14 03:56:11,768 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-14 03:56:11,769 INFO L93 Difference]: Finished difference Result 133 states and 157 transitions. [2024-11-14 03:56:11,769 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-11-14 03:56:11,769 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 3 states have (on average 2.0) internal successors, (6), 4 states have internal predecessors, (6), 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 6 [2024-11-14 03:56:11,769 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-14 03:56:11,771 INFO L225 Difference]: With dead ends: 133 [2024-11-14 03:56:11,771 INFO L226 Difference]: Without dead ends: 133 [2024-11-14 03:56:11,772 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-14 03:56:11,775 INFO L432 NwaCegarLoop]: 56 mSDtfsCounter, 192 mSDsluCounter, 13 mSDsCounter, 0 mSdLazyCounter, 151 mSolverCounterSat, 37 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 192 SdHoareTripleChecker+Valid, 69 SdHoareTripleChecker+Invalid, 188 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 37 IncrementalHoareTripleChecker+Valid, 151 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2024-11-14 03:56:11,775 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [192 Valid, 69 Invalid, 188 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [37 Valid, 151 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2024-11-14 03:56:11,776 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 133 states. [2024-11-14 03:56:11,785 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 133 to 131. [2024-11-14 03:56:11,788 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 131 states, 80 states have (on average 1.875) internal successors, (150), 129 states have internal predecessors, (150), 7 states have call successors, (7), 1 states have call predecessors, (7), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-14 03:56:11,789 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 131 states to 131 states and 157 transitions. [2024-11-14 03:56:11,789 INFO L78 Accepts]: Start accepts. Automaton has 131 states and 157 transitions. Word has length 6 [2024-11-14 03:56:11,789 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-14 03:56:11,789 INFO L471 AbstractCegarLoop]: Abstraction has 131 states and 157 transitions. [2024-11-14 03:56:11,791 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 3 states have (on average 2.0) internal successors, (6), 4 states have internal predecessors, (6), 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-14 03:56:11,791 INFO L276 IsEmpty]: Start isEmpty. Operand 131 states and 157 transitions. [2024-11-14 03:56:11,791 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 7 [2024-11-14 03:56:11,791 INFO L207 NwaCegarLoop]: Found error trace [2024-11-14 03:56:11,792 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1] [2024-11-14 03:56:11,792 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2024-11-14 03:56:11,792 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr5REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [reach_errorErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 62 more)] === [2024-11-14 03:56:11,792 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-14 03:56:11,792 INFO L85 PathProgramCache]: Analyzing trace with hash -895491929, now seen corresponding path program 1 times [2024-11-14 03:56:11,792 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2024-11-14 03:56:11,793 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [786367754] [2024-11-14 03:56:11,793 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-14 03:56:11,793 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-14 03:56:11,819 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-14 03:56:12,105 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-14 03:56:12,105 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2024-11-14 03:56:12,105 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [786367754] [2024-11-14 03:56:12,105 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [786367754] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-14 03:56:12,105 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-14 03:56:12,105 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2024-11-14 03:56:12,106 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1783505227] [2024-11-14 03:56:12,106 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-14 03:56:12,106 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2024-11-14 03:56:12,106 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2024-11-14 03:56:12,107 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2024-11-14 03:56:12,107 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2024-11-14 03:56:12,107 INFO L87 Difference]: Start difference. First operand 131 states and 157 transitions. Second operand has 6 states, 5 states have (on average 1.2) internal successors, (6), 5 states have internal predecessors, (6), 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-14 03:56:12,536 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-14 03:56:12,537 INFO L93 Difference]: Finished difference Result 185 states and 220 transitions. [2024-11-14 03:56:12,537 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-11-14 03:56:12,537 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 5 states have (on average 1.2) internal successors, (6), 5 states have internal predecessors, (6), 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 6 [2024-11-14 03:56:12,538 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-14 03:56:12,539 INFO L225 Difference]: With dead ends: 185 [2024-11-14 03:56:12,539 INFO L226 Difference]: Without dead ends: 185 [2024-11-14 03:56:12,540 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=17, Invalid=25, Unknown=0, NotChecked=0, Total=42 [2024-11-14 03:56:12,542 INFO L432 NwaCegarLoop]: 52 mSDtfsCounter, 401 mSDsluCounter, 83 mSDsCounter, 0 mSdLazyCounter, 270 mSolverCounterSat, 37 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 401 SdHoareTripleChecker+Valid, 135 SdHoareTripleChecker+Invalid, 307 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 37 IncrementalHoareTripleChecker+Valid, 270 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2024-11-14 03:56:12,542 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [401 Valid, 135 Invalid, 307 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [37 Valid, 270 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time] [2024-11-14 03:56:12,543 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 185 states. [2024-11-14 03:56:12,556 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 185 to 171. [2024-11-14 03:56:12,560 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 171 states, 120 states have (on average 1.725) internal successors, (207), 169 states have internal predecessors, (207), 7 states have call successors, (7), 1 states have call predecessors, (7), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-14 03:56:12,562 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 171 states to 171 states and 214 transitions. [2024-11-14 03:56:12,562 INFO L78 Accepts]: Start accepts. Automaton has 171 states and 214 transitions. Word has length 6 [2024-11-14 03:56:12,566 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-14 03:56:12,566 INFO L471 AbstractCegarLoop]: Abstraction has 171 states and 214 transitions. [2024-11-14 03:56:12,566 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 5 states have (on average 1.2) internal successors, (6), 5 states have internal predecessors, (6), 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-14 03:56:12,567 INFO L276 IsEmpty]: Start isEmpty. Operand 171 states and 214 transitions. [2024-11-14 03:56:12,567 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 9 [2024-11-14 03:56:12,567 INFO L207 NwaCegarLoop]: Found error trace [2024-11-14 03:56:12,567 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1] [2024-11-14 03:56:12,567 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2024-11-14 03:56:12,567 INFO L396 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr8REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [reach_errorErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 62 more)] === [2024-11-14 03:56:12,568 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-14 03:56:12,568 INFO L85 PathProgramCache]: Analyzing trace with hash -1573928404, now seen corresponding path program 1 times [2024-11-14 03:56:12,568 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2024-11-14 03:56:12,568 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1704194736] [2024-11-14 03:56:12,568 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-14 03:56:12,568 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-14 03:56:12,595 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-14 03:56:12,740 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-14 03:56:12,740 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2024-11-14 03:56:12,741 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1704194736] [2024-11-14 03:56:12,741 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1704194736] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-14 03:56:12,741 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-14 03:56:12,741 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2024-11-14 03:56:12,741 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1383027967] [2024-11-14 03:56:12,741 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-14 03:56:12,742 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2024-11-14 03:56:12,742 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2024-11-14 03:56:12,742 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2024-11-14 03:56:12,742 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2024-11-14 03:56:12,743 INFO L87 Difference]: Start difference. First operand 171 states and 214 transitions. Second operand has 5 states, 4 states have (on average 2.0) 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-14 03:56:13,022 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-14 03:56:13,022 INFO L93 Difference]: Finished difference Result 174 states and 219 transitions. [2024-11-14 03:56:13,023 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2024-11-14 03:56:13,023 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 4 states have (on average 2.0) 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-14 03:56:13,023 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-14 03:56:13,024 INFO L225 Difference]: With dead ends: 174 [2024-11-14 03:56:13,025 INFO L226 Difference]: Without dead ends: 174 [2024-11-14 03:56:13,025 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=15, Invalid=27, Unknown=0, NotChecked=0, Total=42 [2024-11-14 03:56:13,027 INFO L432 NwaCegarLoop]: 79 mSDtfsCounter, 57 mSDsluCounter, 124 mSDsCounter, 0 mSdLazyCounter, 287 mSolverCounterSat, 8 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 57 SdHoareTripleChecker+Valid, 203 SdHoareTripleChecker+Invalid, 295 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 8 IncrementalHoareTripleChecker+Valid, 287 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2024-11-14 03:56:13,027 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [57 Valid, 203 Invalid, 295 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [8 Valid, 287 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2024-11-14 03:56:13,028 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 174 states. [2024-11-14 03:56:13,034 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 174 to 170. [2024-11-14 03:56:13,034 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 170 states, 120 states have (on average 1.7166666666666666) internal successors, (206), 168 states have internal predecessors, (206), 7 states have call successors, (7), 1 states have call predecessors, (7), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-14 03:56:13,037 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 170 states to 170 states and 213 transitions. [2024-11-14 03:56:13,038 INFO L78 Accepts]: Start accepts. Automaton has 170 states and 213 transitions. Word has length 8 [2024-11-14 03:56:13,038 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-14 03:56:13,038 INFO L471 AbstractCegarLoop]: Abstraction has 170 states and 213 transitions. [2024-11-14 03:56:13,038 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 4 states have (on average 2.0) 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-14 03:56:13,041 INFO L276 IsEmpty]: Start isEmpty. Operand 170 states and 213 transitions. [2024-11-14 03:56:13,041 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 9 [2024-11-14 03:56:13,042 INFO L207 NwaCegarLoop]: Found error trace [2024-11-14 03:56:13,042 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1] [2024-11-14 03:56:13,042 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2024-11-14 03:56:13,042 INFO L396 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr9REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [reach_errorErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 62 more)] === [2024-11-14 03:56:13,042 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-14 03:56:13,043 INFO L85 PathProgramCache]: Analyzing trace with hash -1573928403, now seen corresponding path program 1 times [2024-11-14 03:56:13,043 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2024-11-14 03:56:13,043 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [542223900] [2024-11-14 03:56:13,043 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-14 03:56:13,043 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-14 03:56:13,064 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-14 03:56:13,278 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-14 03:56:13,279 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2024-11-14 03:56:13,279 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [542223900] [2024-11-14 03:56:13,280 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [542223900] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-14 03:56:13,280 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-14 03:56:13,280 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2024-11-14 03:56:13,280 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1372373257] [2024-11-14 03:56:13,280 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-14 03:56:13,280 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2024-11-14 03:56:13,282 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2024-11-14 03:56:13,283 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2024-11-14 03:56:13,283 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2024-11-14 03:56:13,283 INFO L87 Difference]: Start difference. First operand 170 states and 213 transitions. Second operand has 5 states, 4 states have (on average 2.0) 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-14 03:56:13,520 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-14 03:56:13,520 INFO L93 Difference]: Finished difference Result 166 states and 209 transitions. [2024-11-14 03:56:13,520 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2024-11-14 03:56:13,524 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 4 states have (on average 2.0) 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-14 03:56:13,524 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-14 03:56:13,525 INFO L225 Difference]: With dead ends: 166 [2024-11-14 03:56:13,525 INFO L226 Difference]: Without dead ends: 166 [2024-11-14 03:56:13,525 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=15, Invalid=27, Unknown=0, NotChecked=0, Total=42 [2024-11-14 03:56:13,526 INFO L432 NwaCegarLoop]: 109 mSDtfsCounter, 8 mSDsluCounter, 184 mSDsCounter, 0 mSdLazyCounter, 224 mSolverCounterSat, 5 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 8 SdHoareTripleChecker+Valid, 293 SdHoareTripleChecker+Invalid, 229 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 5 IncrementalHoareTripleChecker+Valid, 224 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2024-11-14 03:56:13,526 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [8 Valid, 293 Invalid, 229 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [5 Valid, 224 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2024-11-14 03:56:13,527 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 166 states. [2024-11-14 03:56:13,532 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 166 to 161. [2024-11-14 03:56:13,532 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 161 states, 116 states have (on average 1.6896551724137931) internal successors, (196), 159 states have internal predecessors, (196), 7 states have call successors, (7), 1 states have call predecessors, (7), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-14 03:56:13,533 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 161 states to 161 states and 203 transitions. [2024-11-14 03:56:13,533 INFO L78 Accepts]: Start accepts. Automaton has 161 states and 203 transitions. Word has length 8 [2024-11-14 03:56:13,534 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-14 03:56:13,534 INFO L471 AbstractCegarLoop]: Abstraction has 161 states and 203 transitions. [2024-11-14 03:56:13,534 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 4 states have (on average 2.0) 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-14 03:56:13,534 INFO L276 IsEmpty]: Start isEmpty. Operand 161 states and 203 transitions. [2024-11-14 03:56:13,534 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 11 [2024-11-14 03:56:13,535 INFO L207 NwaCegarLoop]: Found error trace [2024-11-14 03:56:13,535 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-14 03:56:13,535 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2024-11-14 03:56:13,535 INFO L396 AbstractCegarLoop]: === Iteration 7 === Targeting reach_errorErr0ASSERT_VIOLATIONMEMORY_LEAK === [reach_errorErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 62 more)] === [2024-11-14 03:56:13,535 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-14 03:56:13,536 INFO L85 PathProgramCache]: Analyzing trace with hash -1085269682, now seen corresponding path program 1 times [2024-11-14 03:56:13,536 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2024-11-14 03:56:13,536 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1100145423] [2024-11-14 03:56:13,536 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-14 03:56:13,536 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-14 03:56:13,546 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-14 03:56:13,564 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-14 03:56:13,564 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2024-11-14 03:56:13,565 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1100145423] [2024-11-14 03:56:13,565 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1100145423] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-14 03:56:13,565 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-14 03:56:13,565 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-11-14 03:56:13,565 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [63061616] [2024-11-14 03:56:13,565 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-14 03:56:13,565 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-14 03:56:13,566 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2024-11-14 03:56:13,566 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-14 03:56:13,567 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-14 03:56:13,567 INFO L87 Difference]: Start difference. First operand 161 states and 203 transitions. Second operand has 3 states, 3 states have (on average 3.0) 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-14 03:56:13,635 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-14 03:56:13,635 INFO L93 Difference]: Finished difference Result 187 states and 233 transitions. [2024-11-14 03:56:13,635 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-14 03:56:13,635 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 3.0) 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-14 03:56:13,636 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-14 03:56:13,636 INFO L225 Difference]: With dead ends: 187 [2024-11-14 03:56:13,637 INFO L226 Difference]: Without dead ends: 187 [2024-11-14 03:56:13,637 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-14 03:56:13,638 INFO L432 NwaCegarLoop]: 125 mSDtfsCounter, 33 mSDsluCounter, 93 mSDsCounter, 0 mSdLazyCounter, 51 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 33 SdHoareTripleChecker+Valid, 218 SdHoareTripleChecker+Invalid, 53 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 51 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-11-14 03:56:13,639 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [33 Valid, 218 Invalid, 53 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 51 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-11-14 03:56:13,640 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 187 states. [2024-11-14 03:56:13,649 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 187 to 163. [2024-11-14 03:56:13,654 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 163 states, 118 states have (on average 1.6779661016949152) internal successors, (198), 161 states have internal predecessors, (198), 7 states have call successors, (7), 1 states have call predecessors, (7), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-14 03:56:13,655 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 163 states to 163 states and 205 transitions. [2024-11-14 03:56:13,655 INFO L78 Accepts]: Start accepts. Automaton has 163 states and 205 transitions. Word has length 10 [2024-11-14 03:56:13,655 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-14 03:56:13,656 INFO L471 AbstractCegarLoop]: Abstraction has 163 states and 205 transitions. [2024-11-14 03:56:13,656 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 3.0) 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-14 03:56:13,656 INFO L276 IsEmpty]: Start isEmpty. Operand 163 states and 205 transitions. [2024-11-14 03:56:13,656 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 18 [2024-11-14 03:56:13,656 INFO L207 NwaCegarLoop]: Found error trace [2024-11-14 03:56:13,656 INFO L215 NwaCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-14 03:56:13,656 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2024-11-14 03:56:13,656 INFO L396 AbstractCegarLoop]: === Iteration 8 === Targeting reach_errorErr0ASSERT_VIOLATIONMEMORY_LEAK === [reach_errorErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 62 more)] === [2024-11-14 03:56:13,657 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-14 03:56:13,657 INFO L85 PathProgramCache]: Analyzing trace with hash 245243181, now seen corresponding path program 1 times [2024-11-14 03:56:13,657 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2024-11-14 03:56:13,657 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [64179681] [2024-11-14 03:56:13,657 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-14 03:56:13,657 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-14 03:56:13,681 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-14 03:56:13,743 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2024-11-14 03:56:13,743 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2024-11-14 03:56:13,743 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [64179681] [2024-11-14 03:56:13,743 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [64179681] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-14 03:56:13,743 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-14 03:56:13,744 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-11-14 03:56:13,744 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [330130436] [2024-11-14 03:56:13,744 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-14 03:56:13,744 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-11-14 03:56:13,744 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2024-11-14 03:56:13,745 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-11-14 03:56:13,745 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-11-14 03:56:13,745 INFO L87 Difference]: Start difference. First operand 163 states and 205 transitions. Second operand has 4 states, 4 states have (on average 3.75) internal successors, (15), 3 states have internal predecessors, (15), 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-14 03:56:13,900 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-14 03:56:13,900 INFO L93 Difference]: Finished difference Result 180 states and 210 transitions. [2024-11-14 03:56:13,901 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-11-14 03:56:13,901 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 3.75) internal successors, (15), 3 states have internal predecessors, (15), 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-14 03:56:13,901 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-14 03:56:13,902 INFO L225 Difference]: With dead ends: 180 [2024-11-14 03:56:13,902 INFO L226 Difference]: Without dead ends: 180 [2024-11-14 03:56:13,902 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-14 03:56:13,903 INFO L432 NwaCegarLoop]: 88 mSDtfsCounter, 216 mSDsluCounter, 71 mSDsCounter, 0 mSdLazyCounter, 105 mSolverCounterSat, 6 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 216 SdHoareTripleChecker+Valid, 159 SdHoareTripleChecker+Invalid, 111 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 6 IncrementalHoareTripleChecker+Valid, 105 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-11-14 03:56:13,903 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [216 Valid, 159 Invalid, 111 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [6 Valid, 105 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-11-14 03:56:13,904 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 180 states. [2024-11-14 03:56:13,907 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 180 to 162. [2024-11-14 03:56:13,908 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 162 states, 118 states have (on average 1.652542372881356) internal successors, (195), 160 states have internal predecessors, (195), 6 states have call successors, (6), 1 states have call predecessors, (6), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-14 03:56:13,909 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 162 states to 162 states and 201 transitions. [2024-11-14 03:56:13,909 INFO L78 Accepts]: Start accepts. Automaton has 162 states and 201 transitions. Word has length 17 [2024-11-14 03:56:13,909 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-14 03:56:13,909 INFO L471 AbstractCegarLoop]: Abstraction has 162 states and 201 transitions. [2024-11-14 03:56:13,910 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 3.75) internal successors, (15), 3 states have internal predecessors, (15), 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-14 03:56:13,910 INFO L276 IsEmpty]: Start isEmpty. Operand 162 states and 201 transitions. [2024-11-14 03:56:13,910 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 21 [2024-11-14 03:56:13,910 INFO L207 NwaCegarLoop]: Found error trace [2024-11-14 03:56:13,910 INFO L215 NwaCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-14 03:56:13,910 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2024-11-14 03:56:13,911 INFO L396 AbstractCegarLoop]: === Iteration 9 === Targeting ULTIMATE.startErr19REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [reach_errorErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 62 more)] === [2024-11-14 03:56:13,911 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-14 03:56:13,911 INFO L85 PathProgramCache]: Analyzing trace with hash 67178542, now seen corresponding path program 1 times [2024-11-14 03:56:13,911 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2024-11-14 03:56:13,911 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1716491072] [2024-11-14 03:56:13,912 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-14 03:56:13,912 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-14 03:56:13,943 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-14 03:56:14,682 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-14 03:56:14,683 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2024-11-14 03:56:14,683 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1716491072] [2024-11-14 03:56:14,683 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1716491072] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-14 03:56:14,683 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1142505586] [2024-11-14 03:56:14,686 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-14 03:56:14,686 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-14 03:56:14,686 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_2088ea77-1acf-4d0c-88ef-23be095c4621/bin/utaipan-verify-sOmjnqqW8E/z3 [2024-11-14 03:56:14,689 INFO L229 MonitoredProcess]: Starting monitored process 2 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_2088ea77-1acf-4d0c-88ef-23be095c4621/bin/utaipan-verify-sOmjnqqW8E/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-11-14 03:56:14,691 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_2088ea77-1acf-4d0c-88ef-23be095c4621/bin/utaipan-verify-sOmjnqqW8E/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Waiting until timeout for monitored process [2024-11-14 03:56:14,804 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-14 03:56:14,811 INFO L255 TraceCheckSpWp]: Trace formula consists of 171 conjuncts, 36 conjuncts are in the unsatisfiable core [2024-11-14 03:56:14,822 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-14 03:56:14,869 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-14 03:56:14,999 INFO L349 Elim1Store]: treesize reduction 4, result has 50.0 percent of original size [2024-11-14 03:56:15,001 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-14 03:56:15,025 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 8 treesize of output 1 [2024-11-14 03:56:15,087 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 7 [2024-11-14 03:56:15,109 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 15 treesize of output 1 [2024-11-14 03:56:15,234 INFO L349 Elim1Store]: treesize reduction 13, result has 40.9 percent of original size [2024-11-14 03:56:15,234 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 1 new quantified variables, introduced 1 case distinctions, treesize of input 16 treesize of output 15 [2024-11-14 03:56:15,271 INFO L349 Elim1Store]: treesize reduction 17, result has 22.7 percent of original size [2024-11-14 03:56:15,271 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 1 new quantified variables, introduced 1 case distinctions, treesize of input 33 treesize of output 24 [2024-11-14 03:56:15,363 INFO L349 Elim1Store]: treesize reduction 19, result has 20.8 percent of original size [2024-11-14 03:56:15,364 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 50 treesize of output 45 [2024-11-14 03:56:15,372 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 24 treesize of output 11 [2024-11-14 03:56:15,616 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 25 treesize of output 13 [2024-11-14 03:56:15,622 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 7 treesize of output 3 [2024-11-14 03:56:15,651 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-14 03:56:15,651 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-11-14 03:56:16,334 WARN L851 $PredicateComparison]: unable to prove that (let ((.cse0 (select (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_~x~0#1.base|) |c_ULTIMATE.start_main_~x~0#1.offset|))) (and (forall ((v_ArrVal_204 (Array Int Int)) (|v_ULTIMATE.start_main_~x~0#1.offset_125| Int)) (or (< |v_ULTIMATE.start_main_~x~0#1.offset_125| 0) (< |c_ULTIMATE.start_main_~head~0#1.offset| |v_ULTIMATE.start_main_~x~0#1.offset_125|) (< 0 (+ (select (select (store |c_#memory_$Pointer$.offset| .cse0 v_ArrVal_204) |c_ULTIMATE.start_main_~head~0#1.base|) |v_ULTIMATE.start_main_~x~0#1.offset_125|) 5)))) (forall ((v_ArrVal_205 (Array Int Int)) (v_ArrVal_204 (Array Int Int)) (|v_ULTIMATE.start_main_~x~0#1.offset_125| Int)) (or (< |v_ULTIMATE.start_main_~x~0#1.offset_125| 0) (< |c_ULTIMATE.start_main_~head~0#1.offset| |v_ULTIMATE.start_main_~x~0#1.offset_125|) (< (+ (select (select (store |c_#memory_$Pointer$.offset| .cse0 v_ArrVal_204) |c_ULTIMATE.start_main_~head~0#1.base|) |v_ULTIMATE.start_main_~x~0#1.offset_125|) 7) (select |c_#length| (select (select (store |c_#memory_$Pointer$.base| .cse0 v_ArrVal_205) |c_ULTIMATE.start_main_~head~0#1.base|) |v_ULTIMATE.start_main_~x~0#1.offset_125|))))))) is different from false [2024-11-14 03:56:16,359 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-11-14 03:56:16,359 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 37 treesize of output 38 [2024-11-14 03:56:16,369 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-11-14 03:56:16,369 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 29 treesize of output 30 [2024-11-14 03:56:16,386 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-11-14 03:56:16,386 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 52 treesize of output 55 [2024-11-14 03:56:16,422 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-11-14 03:56:16,422 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 82 treesize of output 81 [2024-11-14 03:56:16,435 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 13 [2024-11-14 03:56:16,443 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 13 treesize of output 11 [2024-11-14 03:56:16,521 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-11-14 03:56:16,521 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 20 treesize of output 21 [2024-11-14 03:56:16,526 INFO L173 IndexEqualityManager]: detected equality via solver [2024-11-14 03:56:16,530 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-11-14 03:56:16,531 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-11-14 03:56:16,532 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 18 treesize of output 10 [2024-11-14 03:56:16,840 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-14 03:56:16,840 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1142505586] provided 0 perfect and 2 imperfect interpolant sequences [2024-11-14 03:56:16,840 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSifa [1667691575] [2024-11-14 03:56:16,867 INFO L159 IcfgInterpreter]: Started Sifa with 19 locations of interest [2024-11-14 03:56:16,868 INFO L166 IcfgInterpreter]: Building call graph [2024-11-14 03:56:16,872 INFO L171 IcfgInterpreter]: Initial procedures are [ULTIMATE.start] [2024-11-14 03:56:16,878 INFO L176 IcfgInterpreter]: Starting interpretation [2024-11-14 03:56:16,878 INFO L197 IcfgInterpreter]: Interpreting procedure ULTIMATE.start with input of size 1 for LOIs [2024-11-14 03:56:22,073 INFO L180 IcfgInterpreter]: Interpretation finished [2024-11-14 03:56:37,710 INFO L133 SifaRunner]: Sifa could not show that error location is unreachable, found '2911#(and (or (not (= (select (select |#memory_$Pointer$.base| |ULTIMATE.start_main_~x~0#1.base|) |ULTIMATE.start_main_~x~0#1.offset|) 0)) (not (= (select (select |#memory_$Pointer$.offset| |ULTIMATE.start_main_~x~0#1.base|) |ULTIMATE.start_main_~x~0#1.offset|) 0))) (<= (+ |ULTIMATE.start_main_~x~0#1.offset| 4) (select |#length| |ULTIMATE.start_main_~x~0#1.base|)) (= |ULTIMATE.start_main_~head~0#1.offset| |ULTIMATE.start_main_~x~0#1.offset|) (<= 0 |ULTIMATE.start_main_~x~0#1.offset|) (or (< (select |#length| (select (select |#memory_$Pointer$.base| |ULTIMATE.start_main_~x~0#1.base|) |ULTIMATE.start_main_~x~0#1.offset|)) (+ (select (select |#memory_$Pointer$.offset| |ULTIMATE.start_main_~x~0#1.base|) |ULTIMATE.start_main_~x~0#1.offset|) 8)) (< (+ (select (select |#memory_$Pointer$.offset| |ULTIMATE.start_main_~x~0#1.base|) |ULTIMATE.start_main_~x~0#1.offset|) 4) 0)) (= |ULTIMATE.start_main_~x~0#1.base| |ULTIMATE.start_main_~head~0#1.base|) (= (select |#valid| |ULTIMATE.start_main_~x~0#1.base|) 1) (exists ((|v_ULTIMATE.start_main_~x~0#1.offset_129| Int) (|v_ULTIMATE.start_main_~x~0#1.base_154| Int) (|v_#memory_int_74| (Array Int (Array Int Int))) (|v_#memory_$Pointer$.base_87| (Array Int (Array Int Int))) (|v_#memory_$Pointer$.offset_87| (Array Int (Array Int Int)))) (and (= |#memory_$Pointer$.offset| (store |v_#memory_$Pointer$.offset_87| |v_ULTIMATE.start_main_~x~0#1.base_154| (store (select |v_#memory_$Pointer$.offset_87| |v_ULTIMATE.start_main_~x~0#1.base_154|) (+ 4 |v_ULTIMATE.start_main_~x~0#1.offset_129|) (select (select |#memory_$Pointer$.offset| |v_ULTIMATE.start_main_~x~0#1.base_154|) (+ 4 |v_ULTIMATE.start_main_~x~0#1.offset_129|))))) (<= (+ 8 |v_ULTIMATE.start_main_~x~0#1.offset_129|) (select |#length| |v_ULTIMATE.start_main_~x~0#1.base_154|)) (= |#memory_int| (store |v_#memory_int_74| |v_ULTIMATE.start_main_~x~0#1.base_154| (store (select |v_#memory_int_74| |v_ULTIMATE.start_main_~x~0#1.base_154|) (+ 4 |v_ULTIMATE.start_main_~x~0#1.offset_129|) 1))) (<= 0 (+ 4 |v_ULTIMATE.start_main_~x~0#1.offset_129|)) (= (select |#valid| |v_ULTIMATE.start_main_~x~0#1.base_154|) 1) (= |#memory_$Pointer$.base| (store |v_#memory_$Pointer$.base_87| |v_ULTIMATE.start_main_~x~0#1.base_154| (store (select |v_#memory_$Pointer$.base_87| |v_ULTIMATE.start_main_~x~0#1.base_154|) (+ 4 |v_ULTIMATE.start_main_~x~0#1.offset_129|) (select (select |#memory_$Pointer$.base| |v_ULTIMATE.start_main_~x~0#1.base_154|) (+ 4 |v_ULTIMATE.start_main_~x~0#1.offset_129|))))))) (or (not (= |ULTIMATE.start_main_~x~0#1.base| 0)) (not (= |ULTIMATE.start_main_~x~0#1.offset| 0))))' at error location [2024-11-14 03:56:37,711 WARN L311 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: ALGORITHM_FAILED [2024-11-14 03:56:37,711 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2024-11-14 03:56:37,711 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [10, 9, 9] total 28 [2024-11-14 03:56:37,711 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [381076310] [2024-11-14 03:56:37,711 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2024-11-14 03:56:37,712 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 29 states [2024-11-14 03:56:37,712 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2024-11-14 03:56:37,713 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 29 interpolants. [2024-11-14 03:56:37,714 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=149, Invalid=1651, Unknown=10, NotChecked=82, Total=1892 [2024-11-14 03:56:37,714 INFO L87 Difference]: Start difference. First operand 162 states and 201 transitions. Second operand has 29 states, 28 states have (on average 2.142857142857143) internal successors, (60), 29 states have internal predecessors, (60), 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-14 03:56:50,870 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-14 03:56:50,870 INFO L93 Difference]: Finished difference Result 280 states and 349 transitions. [2024-11-14 03:56:50,871 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2024-11-14 03:56:50,871 INFO L78 Accepts]: Start accepts. Automaton has has 29 states, 28 states have (on average 2.142857142857143) internal successors, (60), 29 states have internal predecessors, (60), 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 20 [2024-11-14 03:56:50,871 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-14 03:56:50,873 INFO L225 Difference]: With dead ends: 280 [2024-11-14 03:56:50,873 INFO L226 Difference]: Without dead ends: 280 [2024-11-14 03:56:50,874 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 77 GetRequests, 26 SyntacticMatches, 1 SemanticMatches, 50 ConstructedPredicates, 1 IntricatePredicates, 0 DeprecatedPredicates, 587 ImplicationChecksByTransitivity, 24.2s TimeCoverageRelationStatistics Valid=262, Invalid=2275, Unknown=17, NotChecked=98, Total=2652 [2024-11-14 03:56:50,875 INFO L432 NwaCegarLoop]: 80 mSDtfsCounter, 915 mSDsluCounter, 727 mSDsCounter, 0 mSdLazyCounter, 1414 mSolverCounterSat, 74 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 5.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 915 SdHoareTripleChecker+Valid, 807 SdHoareTripleChecker+Invalid, 1797 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 74 IncrementalHoareTripleChecker+Valid, 1414 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 309 IncrementalHoareTripleChecker+Unchecked, 5.4s IncrementalHoareTripleChecker+Time [2024-11-14 03:56:50,875 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [915 Valid, 807 Invalid, 1797 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [74 Valid, 1414 Invalid, 0 Unknown, 309 Unchecked, 5.4s Time] [2024-11-14 03:56:50,876 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 280 states. [2024-11-14 03:56:50,881 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 280 to 179. [2024-11-14 03:56:50,882 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 179 states, 135 states have (on average 1.6) internal successors, (216), 177 states have internal predecessors, (216), 6 states have call successors, (6), 1 states have call predecessors, (6), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-14 03:56:50,883 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 179 states to 179 states and 222 transitions. [2024-11-14 03:56:50,883 INFO L78 Accepts]: Start accepts. Automaton has 179 states and 222 transitions. Word has length 20 [2024-11-14 03:56:50,883 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-14 03:56:50,884 INFO L471 AbstractCegarLoop]: Abstraction has 179 states and 222 transitions. [2024-11-14 03:56:50,884 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 29 states, 28 states have (on average 2.142857142857143) internal successors, (60), 29 states have internal predecessors, (60), 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-14 03:56:50,884 INFO L276 IsEmpty]: Start isEmpty. Operand 179 states and 222 transitions. [2024-11-14 03:56:50,884 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 21 [2024-11-14 03:56:50,884 INFO L207 NwaCegarLoop]: Found error trace [2024-11-14 03:56:50,885 INFO L215 NwaCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-14 03:56:50,906 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_2088ea77-1acf-4d0c-88ef-23be095c4621/bin/utaipan-verify-sOmjnqqW8E/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Ended with exit code 0 [2024-11-14 03:56:51,088 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8,2 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_2088ea77-1acf-4d0c-88ef-23be095c4621/bin/utaipan-verify-sOmjnqqW8E/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-14 03:56:51,089 INFO L396 AbstractCegarLoop]: === Iteration 10 === Targeting ULTIMATE.startErr18REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [reach_errorErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 62 more)] === [2024-11-14 03:56:51,089 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-14 03:56:51,089 INFO L85 PathProgramCache]: Analyzing trace with hash 67178541, now seen corresponding path program 1 times [2024-11-14 03:56:51,089 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2024-11-14 03:56:51,089 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1187478260] [2024-11-14 03:56:51,089 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-14 03:56:51,089 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-14 03:56:51,109 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-14 03:56:51,969 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-14 03:56:51,969 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2024-11-14 03:56:51,969 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1187478260] [2024-11-14 03:56:51,969 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1187478260] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-14 03:56:51,969 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1458204771] [2024-11-14 03:56:51,969 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-14 03:56:51,970 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-14 03:56:51,970 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_2088ea77-1acf-4d0c-88ef-23be095c4621/bin/utaipan-verify-sOmjnqqW8E/z3 [2024-11-14 03:56:51,972 INFO L229 MonitoredProcess]: Starting monitored process 3 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_2088ea77-1acf-4d0c-88ef-23be095c4621/bin/utaipan-verify-sOmjnqqW8E/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-11-14 03:56:51,974 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_2088ea77-1acf-4d0c-88ef-23be095c4621/bin/utaipan-verify-sOmjnqqW8E/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Waiting until timeout for monitored process [2024-11-14 03:56:52,076 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-14 03:56:52,083 INFO L255 TraceCheckSpWp]: Trace formula consists of 171 conjuncts, 27 conjuncts are in the unsatisfiable core [2024-11-14 03:56:52,086 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-14 03:56:52,110 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-14 03:56:52,458 INFO L349 Elim1Store]: treesize reduction 18, result has 35.7 percent of original size [2024-11-14 03:56:52,458 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 2 case distinctions, treesize of input 17 treesize of output 21 [2024-11-14 03:56:52,686 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 15 treesize of output 1 [2024-11-14 03:56:53,009 INFO L349 Elim1Store]: treesize reduction 17, result has 22.7 percent of original size [2024-11-14 03:56:53,009 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 1 new quantified variables, introduced 1 case distinctions, treesize of input 33 treesize of output 24 [2024-11-14 03:56:53,158 INFO L349 Elim1Store]: treesize reduction 19, result has 20.8 percent of original size [2024-11-14 03:56:53,158 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 34 treesize of output 33 [2024-11-14 03:56:53,788 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 25 treesize of output 13 [2024-11-14 03:56:53,912 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-14 03:56:53,913 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-11-14 03:56:54,878 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-11-14 03:56:54,879 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 20 treesize of output 21 [2024-11-14 03:56:54,918 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-11-14 03:56:54,918 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 34 treesize of output 37 [2024-11-14 03:56:54,929 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 9 [2024-11-14 03:56:56,998 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-14 03:56:56,999 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1458204771] provided 0 perfect and 2 imperfect interpolant sequences [2024-11-14 03:56:56,999 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSifa [520246970] [2024-11-14 03:56:57,002 INFO L159 IcfgInterpreter]: Started Sifa with 19 locations of interest [2024-11-14 03:56:57,002 INFO L166 IcfgInterpreter]: Building call graph [2024-11-14 03:56:57,005 INFO L171 IcfgInterpreter]: Initial procedures are [ULTIMATE.start] [2024-11-14 03:56:57,005 INFO L176 IcfgInterpreter]: Starting interpretation [2024-11-14 03:56:57,005 INFO L197 IcfgInterpreter]: Interpreting procedure ULTIMATE.start with input of size 1 for LOIs [2024-11-14 03:57:01,801 INFO L180 IcfgInterpreter]: Interpretation finished [2024-11-14 03:57:18,705 INFO L133 SifaRunner]: Sifa could not show that error location is unreachable, found '3542#(and (or (not (= (select (select |#memory_$Pointer$.base| |ULTIMATE.start_main_~x~0#1.base|) |ULTIMATE.start_main_~x~0#1.offset|) 0)) (not (= (select (select |#memory_$Pointer$.offset| |ULTIMATE.start_main_~x~0#1.base|) |ULTIMATE.start_main_~x~0#1.offset|) 0))) (<= (+ |ULTIMATE.start_main_~x~0#1.offset| 4) (select |#length| |ULTIMATE.start_main_~x~0#1.base|)) (not (= (select |#valid| (select (select |#memory_$Pointer$.base| |ULTIMATE.start_main_~x~0#1.base|) |ULTIMATE.start_main_~x~0#1.offset|)) 1)) (= |ULTIMATE.start_main_~head~0#1.offset| |ULTIMATE.start_main_~x~0#1.offset|) (<= 0 |ULTIMATE.start_main_~x~0#1.offset|) (= (select (select |#memory_$Pointer$.offset| |ULTIMATE.start_main_~x~0#1.base|) |ULTIMATE.start_main_~x~0#1.offset|) |ULTIMATE.start_main_#t~mem7#1.offset|) (= |ULTIMATE.start_main_~x~0#1.base| |ULTIMATE.start_main_~head~0#1.base|) (= (select |#valid| |ULTIMATE.start_main_~x~0#1.base|) 1) (exists ((|v_#memory_int_89| (Array Int (Array Int Int))) (|v_#memory_$Pointer$.base_105| (Array Int (Array Int Int))) (|v_ULTIMATE.start_main_~x~0#1.offset_136| Int) (|v_ULTIMATE.start_main_~x~0#1.base_162| Int) (|v_#memory_$Pointer$.offset_102| (Array Int (Array Int Int)))) (and (= |#memory_int| (store |v_#memory_int_89| |v_ULTIMATE.start_main_~x~0#1.base_162| (store (select |v_#memory_int_89| |v_ULTIMATE.start_main_~x~0#1.base_162|) (+ 4 |v_ULTIMATE.start_main_~x~0#1.offset_136|) 1))) (= (select |#valid| |v_ULTIMATE.start_main_~x~0#1.base_162|) 1) (<= (+ 8 |v_ULTIMATE.start_main_~x~0#1.offset_136|) (select |#length| |v_ULTIMATE.start_main_~x~0#1.base_162|)) (<= 0 (+ 4 |v_ULTIMATE.start_main_~x~0#1.offset_136|)) (= (store |v_#memory_$Pointer$.base_105| |v_ULTIMATE.start_main_~x~0#1.base_162| (store (select |v_#memory_$Pointer$.base_105| |v_ULTIMATE.start_main_~x~0#1.base_162|) (+ 4 |v_ULTIMATE.start_main_~x~0#1.offset_136|) (select (select |#memory_$Pointer$.base| |v_ULTIMATE.start_main_~x~0#1.base_162|) (+ 4 |v_ULTIMATE.start_main_~x~0#1.offset_136|)))) |#memory_$Pointer$.base|) (= |#memory_$Pointer$.offset| (store |v_#memory_$Pointer$.offset_102| |v_ULTIMATE.start_main_~x~0#1.base_162| (store (select |v_#memory_$Pointer$.offset_102| |v_ULTIMATE.start_main_~x~0#1.base_162|) (+ 4 |v_ULTIMATE.start_main_~x~0#1.offset_136|) (select (select |#memory_$Pointer$.offset| |v_ULTIMATE.start_main_~x~0#1.base_162|) (+ 4 |v_ULTIMATE.start_main_~x~0#1.offset_136|))))))) (or (not (= |ULTIMATE.start_main_~x~0#1.base| 0)) (not (= |ULTIMATE.start_main_~x~0#1.offset| 0))))' at error location [2024-11-14 03:57:18,705 WARN L311 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: ALGORITHM_FAILED [2024-11-14 03:57:18,705 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2024-11-14 03:57:18,705 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [10, 9, 9] total 26 [2024-11-14 03:57:18,705 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1399576001] [2024-11-14 03:57:18,705 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2024-11-14 03:57:18,706 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 27 states [2024-11-14 03:57:18,706 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2024-11-14 03:57:18,707 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 27 interpolants. [2024-11-14 03:57:18,708 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=162, Invalid=1549, Unknown=11, NotChecked=0, Total=1722 [2024-11-14 03:57:18,708 INFO L87 Difference]: Start difference. First operand 179 states and 222 transitions. Second operand has 27 states, 26 states have (on average 2.1923076923076925) internal successors, (57), 27 states have internal predecessors, (57), 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-14 03:57:30,482 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-14 03:57:30,482 INFO L93 Difference]: Finished difference Result 279 states and 346 transitions. [2024-11-14 03:57:30,483 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2024-11-14 03:57:30,483 INFO L78 Accepts]: Start accepts. Automaton has has 27 states, 26 states have (on average 2.1923076923076925) internal successors, (57), 27 states have internal predecessors, (57), 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 20 [2024-11-14 03:57:30,484 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-14 03:57:30,486 INFO L225 Difference]: With dead ends: 279 [2024-11-14 03:57:30,486 INFO L226 Difference]: Without dead ends: 279 [2024-11-14 03:57:30,487 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 74 GetRequests, 29 SyntacticMatches, 0 SemanticMatches, 45 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 634 ImplicationChecksByTransitivity, 24.8s TimeCoverageRelationStatistics Valid=232, Invalid=1917, Unknown=13, NotChecked=0, Total=2162 [2024-11-14 03:57:30,488 INFO L432 NwaCegarLoop]: 83 mSDtfsCounter, 460 mSDsluCounter, 853 mSDsCounter, 0 mSdLazyCounter, 1549 mSolverCounterSat, 41 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 6.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 460 SdHoareTripleChecker+Valid, 936 SdHoareTripleChecker+Invalid, 1590 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 41 IncrementalHoareTripleChecker+Valid, 1549 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 6.7s IncrementalHoareTripleChecker+Time [2024-11-14 03:57:30,488 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [460 Valid, 936 Invalid, 1590 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [41 Valid, 1549 Invalid, 0 Unknown, 0 Unchecked, 6.7s Time] [2024-11-14 03:57:30,489 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 279 states. [2024-11-14 03:57:30,494 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 279 to 189. [2024-11-14 03:57:30,495 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 189 states, 145 states have (on average 1.5862068965517242) internal successors, (230), 187 states have internal predecessors, (230), 6 states have call successors, (6), 1 states have call predecessors, (6), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-14 03:57:30,496 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 189 states to 189 states and 236 transitions. [2024-11-14 03:57:30,496 INFO L78 Accepts]: Start accepts. Automaton has 189 states and 236 transitions. Word has length 20 [2024-11-14 03:57:30,497 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-14 03:57:30,497 INFO L471 AbstractCegarLoop]: Abstraction has 189 states and 236 transitions. [2024-11-14 03:57:30,497 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 27 states, 26 states have (on average 2.1923076923076925) internal successors, (57), 27 states have internal predecessors, (57), 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-14 03:57:30,497 INFO L276 IsEmpty]: Start isEmpty. Operand 189 states and 236 transitions. [2024-11-14 03:57:30,498 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 24 [2024-11-14 03:57:30,498 INFO L207 NwaCegarLoop]: Found error trace [2024-11-14 03:57:30,498 INFO L215 NwaCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-14 03:57:30,521 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_2088ea77-1acf-4d0c-88ef-23be095c4621/bin/utaipan-verify-sOmjnqqW8E/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Forceful destruction successful, exit code 0 [2024-11-14 03:57:30,702 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9,3 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_2088ea77-1acf-4d0c-88ef-23be095c4621/bin/utaipan-verify-sOmjnqqW8E/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-14 03:57:30,702 INFO L396 AbstractCegarLoop]: === Iteration 11 === Targeting ULTIMATE.startErr30REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [reach_errorErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 62 more)] === [2024-11-14 03:57:30,703 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-14 03:57:30,703 INFO L85 PathProgramCache]: Analyzing trace with hash 139044446, now seen corresponding path program 1 times [2024-11-14 03:57:30,703 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2024-11-14 03:57:30,703 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [429959837] [2024-11-14 03:57:30,703 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-14 03:57:30,703 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-14 03:57:30,722 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-14 03:57:30,794 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2024-11-14 03:57:30,794 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2024-11-14 03:57:30,794 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [429959837] [2024-11-14 03:57:30,795 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [429959837] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-14 03:57:30,795 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-14 03:57:30,795 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-11-14 03:57:30,795 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [317581064] [2024-11-14 03:57:30,795 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-14 03:57:30,795 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-14 03:57:30,795 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2024-11-14 03:57:30,795 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-14 03:57:30,796 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-14 03:57:30,796 INFO L87 Difference]: Start difference. First operand 189 states and 236 transitions. Second operand has 3 states, 2 states have (on average 11.0) internal successors, (22), 3 states have internal predecessors, (22), 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-14 03:57:31,239 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-14 03:57:31,239 INFO L93 Difference]: Finished difference Result 186 states and 230 transitions. [2024-11-14 03:57:31,239 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-14 03:57:31,240 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 2 states have (on average 11.0) internal successors, (22), 3 states have internal predecessors, (22), 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 23 [2024-11-14 03:57:31,240 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-14 03:57:31,241 INFO L225 Difference]: With dead ends: 186 [2024-11-14 03:57:31,241 INFO L226 Difference]: Without dead ends: 186 [2024-11-14 03:57:31,241 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-14 03:57:31,241 INFO L432 NwaCegarLoop]: 94 mSDtfsCounter, 11 mSDsluCounter, 68 mSDsCounter, 0 mSdLazyCounter, 70 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 11 SdHoareTripleChecker+Valid, 162 SdHoareTripleChecker+Invalid, 72 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 70 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2024-11-14 03:57:31,242 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [11 Valid, 162 Invalid, 72 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 70 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time] [2024-11-14 03:57:31,242 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 186 states. [2024-11-14 03:57:31,246 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 186 to 186. [2024-11-14 03:57:31,247 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 186 states, 145 states have (on average 1.5448275862068965) internal successors, (224), 184 states have internal predecessors, (224), 6 states have call successors, (6), 1 states have call predecessors, (6), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-14 03:57:31,248 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 186 states to 186 states and 230 transitions. [2024-11-14 03:57:31,248 INFO L78 Accepts]: Start accepts. Automaton has 186 states and 230 transitions. Word has length 23 [2024-11-14 03:57:31,248 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-14 03:57:31,248 INFO L471 AbstractCegarLoop]: Abstraction has 186 states and 230 transitions. [2024-11-14 03:57:31,249 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 2 states have (on average 11.0) internal successors, (22), 3 states have internal predecessors, (22), 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-14 03:57:31,249 INFO L276 IsEmpty]: Start isEmpty. Operand 186 states and 230 transitions. [2024-11-14 03:57:31,249 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 24 [2024-11-14 03:57:31,249 INFO L207 NwaCegarLoop]: Found error trace [2024-11-14 03:57:31,250 INFO L215 NwaCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-14 03:57:31,250 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10 [2024-11-14 03:57:31,250 INFO L396 AbstractCegarLoop]: === Iteration 12 === Targeting ULTIMATE.startErr31REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [reach_errorErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 62 more)] === [2024-11-14 03:57:31,250 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-14 03:57:31,250 INFO L85 PathProgramCache]: Analyzing trace with hash 139044447, now seen corresponding path program 1 times [2024-11-14 03:57:31,251 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2024-11-14 03:57:31,251 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1487370760] [2024-11-14 03:57:31,251 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-14 03:57:31,251 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-14 03:57:31,270 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-14 03:57:31,412 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2024-11-14 03:57:31,412 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2024-11-14 03:57:31,412 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1487370760] [2024-11-14 03:57:31,412 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1487370760] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-14 03:57:31,413 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-14 03:57:31,413 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-11-14 03:57:31,413 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2067687619] [2024-11-14 03:57:31,413 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-14 03:57:31,413 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-14 03:57:31,413 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2024-11-14 03:57:31,414 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-14 03:57:31,414 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-14 03:57:31,414 INFO L87 Difference]: Start difference. First operand 186 states and 230 transitions. Second operand has 3 states, 2 states have (on average 11.0) internal successors, (22), 3 states have internal predecessors, (22), 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-14 03:57:31,915 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-14 03:57:31,915 INFO L93 Difference]: Finished difference Result 183 states and 224 transitions. [2024-11-14 03:57:31,915 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-14 03:57:31,916 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 2 states have (on average 11.0) internal successors, (22), 3 states have internal predecessors, (22), 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 23 [2024-11-14 03:57:31,916 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-14 03:57:31,917 INFO L225 Difference]: With dead ends: 183 [2024-11-14 03:57:31,917 INFO L226 Difference]: Without dead ends: 183 [2024-11-14 03:57:31,917 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-14 03:57:31,918 INFO L432 NwaCegarLoop]: 90 mSDtfsCounter, 11 mSDsluCounter, 62 mSDsCounter, 0 mSdLazyCounter, 74 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 11 SdHoareTripleChecker+Valid, 152 SdHoareTripleChecker+Invalid, 76 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 74 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.5s IncrementalHoareTripleChecker+Time [2024-11-14 03:57:31,918 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [11 Valid, 152 Invalid, 76 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 74 Invalid, 0 Unknown, 0 Unchecked, 0.5s Time] [2024-11-14 03:57:31,919 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 183 states. [2024-11-14 03:57:31,924 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 183 to 183. [2024-11-14 03:57:31,925 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 183 states, 145 states have (on average 1.5034482758620689) internal successors, (218), 181 states have internal predecessors, (218), 6 states have call successors, (6), 1 states have call predecessors, (6), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-14 03:57:31,926 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 183 states to 183 states and 224 transitions. [2024-11-14 03:57:31,926 INFO L78 Accepts]: Start accepts. Automaton has 183 states and 224 transitions. Word has length 23 [2024-11-14 03:57:31,926 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-14 03:57:31,927 INFO L471 AbstractCegarLoop]: Abstraction has 183 states and 224 transitions. [2024-11-14 03:57:31,927 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 2 states have (on average 11.0) internal successors, (22), 3 states have internal predecessors, (22), 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-14 03:57:31,928 INFO L276 IsEmpty]: Start isEmpty. Operand 183 states and 224 transitions. [2024-11-14 03:57:31,928 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 24 [2024-11-14 03:57:31,928 INFO L207 NwaCegarLoop]: Found error trace [2024-11-14 03:57:31,928 INFO L215 NwaCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-14 03:57:31,929 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable11 [2024-11-14 03:57:31,930 INFO L396 AbstractCegarLoop]: === Iteration 13 === Targeting ULTIMATE.startErr29REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [reach_errorErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 62 more)] === [2024-11-14 03:57:31,930 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-14 03:57:31,931 INFO L85 PathProgramCache]: Analyzing trace with hash 139052640, now seen corresponding path program 1 times [2024-11-14 03:57:31,931 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2024-11-14 03:57:31,931 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [366623223] [2024-11-14 03:57:31,931 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-14 03:57:31,931 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-14 03:57:31,951 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-14 03:57:32,218 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2024-11-14 03:57:32,219 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2024-11-14 03:57:32,219 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [366623223] [2024-11-14 03:57:32,219 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [366623223] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-14 03:57:32,219 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-14 03:57:32,219 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2024-11-14 03:57:32,220 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1940914868] [2024-11-14 03:57:32,220 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-14 03:57:32,220 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2024-11-14 03:57:32,220 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2024-11-14 03:57:32,221 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2024-11-14 03:57:32,221 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2024-11-14 03:57:32,221 INFO L87 Difference]: Start difference. First operand 183 states and 224 transitions. Second operand has 5 states, 5 states have (on average 4.4) internal successors, (22), 5 states have internal predecessors, (22), 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-14 03:57:33,151 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-14 03:57:33,151 INFO L93 Difference]: Finished difference Result 209 states and 259 transitions. [2024-11-14 03:57:33,152 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-11-14 03:57:33,152 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 4.4) internal successors, (22), 5 states have internal predecessors, (22), 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 23 [2024-11-14 03:57:33,152 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-14 03:57:33,153 INFO L225 Difference]: With dead ends: 209 [2024-11-14 03:57:33,153 INFO L226 Difference]: Without dead ends: 209 [2024-11-14 03:57:33,154 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=13, Invalid=17, Unknown=0, NotChecked=0, Total=30 [2024-11-14 03:57:33,154 INFO L432 NwaCegarLoop]: 92 mSDtfsCounter, 13 mSDsluCounter, 187 mSDsCounter, 0 mSdLazyCounter, 190 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.8s Time, 0 mProtectedPredicate, 0 mProtectedAction, 13 SdHoareTripleChecker+Valid, 279 SdHoareTripleChecker+Invalid, 193 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 190 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.9s IncrementalHoareTripleChecker+Time [2024-11-14 03:57:33,154 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [13 Valid, 279 Invalid, 193 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 190 Invalid, 0 Unknown, 0 Unchecked, 0.9s Time] [2024-11-14 03:57:33,155 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 209 states. [2024-11-14 03:57:33,158 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 209 to 190. [2024-11-14 03:57:33,159 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 190 states, 152 states have (on average 1.506578947368421) internal successors, (229), 188 states have internal predecessors, (229), 6 states have call successors, (6), 1 states have call predecessors, (6), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-14 03:57:33,160 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 190 states to 190 states and 235 transitions. [2024-11-14 03:57:33,160 INFO L78 Accepts]: Start accepts. Automaton has 190 states and 235 transitions. Word has length 23 [2024-11-14 03:57:33,160 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-14 03:57:33,160 INFO L471 AbstractCegarLoop]: Abstraction has 190 states and 235 transitions. [2024-11-14 03:57:33,160 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 4.4) internal successors, (22), 5 states have internal predecessors, (22), 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-14 03:57:33,160 INFO L276 IsEmpty]: Start isEmpty. Operand 190 states and 235 transitions. [2024-11-14 03:57:33,161 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 25 [2024-11-14 03:57:33,161 INFO L207 NwaCegarLoop]: Found error trace [2024-11-14 03:57:33,161 INFO L215 NwaCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-14 03:57:33,161 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable12 [2024-11-14 03:57:33,162 INFO L396 AbstractCegarLoop]: === Iteration 14 === Targeting reach_errorErr0ASSERT_VIOLATIONMEMORY_LEAK === [reach_errorErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 62 more)] === [2024-11-14 03:57:33,162 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-14 03:57:33,162 INFO L85 PathProgramCache]: Analyzing trace with hash -194147729, now seen corresponding path program 1 times [2024-11-14 03:57:33,162 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2024-11-14 03:57:33,162 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1646384561] [2024-11-14 03:57:33,162 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-14 03:57:33,162 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-14 03:57:33,182 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-14 03:57:33,227 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2024-11-14 03:57:33,227 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2024-11-14 03:57:33,227 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1646384561] [2024-11-14 03:57:33,227 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1646384561] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-14 03:57:33,227 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-14 03:57:33,227 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-11-14 03:57:33,227 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2066585578] [2024-11-14 03:57:33,227 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-14 03:57:33,228 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-14 03:57:33,228 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2024-11-14 03:57:33,228 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-14 03:57:33,228 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-14 03:57:33,228 INFO L87 Difference]: Start difference. First operand 190 states and 235 transitions. Second operand has 3 states, 3 states have (on average 7.333333333333333) internal successors, (22), 3 states have internal predecessors, (22), 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-14 03:57:33,462 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-14 03:57:33,462 INFO L93 Difference]: Finished difference Result 190 states and 232 transitions. [2024-11-14 03:57:33,463 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-14 03:57:33,463 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 7.333333333333333) internal successors, (22), 3 states have internal predecessors, (22), 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 24 [2024-11-14 03:57:33,463 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-14 03:57:33,464 INFO L225 Difference]: With dead ends: 190 [2024-11-14 03:57:33,464 INFO L226 Difference]: Without dead ends: 190 [2024-11-14 03:57:33,464 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-14 03:57:33,465 INFO L432 NwaCegarLoop]: 99 mSDtfsCounter, 0 mSDsluCounter, 96 mSDsCounter, 0 mSdLazyCounter, 42 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 195 SdHoareTripleChecker+Invalid, 42 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 42 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2024-11-14 03:57:33,465 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 195 Invalid, 42 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 42 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2024-11-14 03:57:33,466 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 190 states. [2024-11-14 03:57:33,469 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 190 to 189. [2024-11-14 03:57:33,470 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 189 states, 151 states have (on average 1.490066225165563) internal successors, (225), 187 states have internal predecessors, (225), 6 states have call successors, (6), 1 states have call predecessors, (6), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-14 03:57:33,471 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 189 states to 189 states and 231 transitions. [2024-11-14 03:57:33,471 INFO L78 Accepts]: Start accepts. Automaton has 189 states and 231 transitions. Word has length 24 [2024-11-14 03:57:33,471 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-14 03:57:33,471 INFO L471 AbstractCegarLoop]: Abstraction has 189 states and 231 transitions. [2024-11-14 03:57:33,473 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 7.333333333333333) internal successors, (22), 3 states have internal predecessors, (22), 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-14 03:57:33,473 INFO L276 IsEmpty]: Start isEmpty. Operand 189 states and 231 transitions. [2024-11-14 03:57:33,474 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2024-11-14 03:57:33,474 INFO L207 NwaCegarLoop]: Found error trace [2024-11-14 03:57:33,474 INFO L215 NwaCegarLoop]: trace histogram [2, 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-14 03:57:33,474 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable13 [2024-11-14 03:57:33,475 INFO L396 AbstractCegarLoop]: === Iteration 15 === Targeting ULTIMATE.startErr29REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [reach_errorErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 62 more)] === [2024-11-14 03:57:33,475 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-14 03:57:33,475 INFO L85 PathProgramCache]: Analyzing trace with hash -752730099, now seen corresponding path program 1 times [2024-11-14 03:57:33,475 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2024-11-14 03:57:33,475 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [407167816] [2024-11-14 03:57:33,475 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-14 03:57:33,476 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-14 03:57:33,510 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-14 03:57:33,790 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2024-11-14 03:57:33,790 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2024-11-14 03:57:33,790 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [407167816] [2024-11-14 03:57:33,790 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [407167816] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-14 03:57:33,790 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-14 03:57:33,791 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2024-11-14 03:57:33,791 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1420178755] [2024-11-14 03:57:33,791 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-14 03:57:33,791 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2024-11-14 03:57:33,791 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2024-11-14 03:57:33,792 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2024-11-14 03:57:33,792 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2024-11-14 03:57:33,792 INFO L87 Difference]: Start difference. First operand 189 states and 231 transitions. Second operand has 5 states, 4 states have (on average 6.0) internal successors, (24), 5 states have internal predecessors, (24), 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-14 03:57:35,112 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-14 03:57:35,112 INFO L93 Difference]: Finished difference Result 198 states and 240 transitions. [2024-11-14 03:57:35,112 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2024-11-14 03:57:35,112 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 4 states have (on average 6.0) internal successors, (24), 5 states have internal predecessors, (24), 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 25 [2024-11-14 03:57:35,112 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-14 03:57:35,113 INFO L225 Difference]: With dead ends: 198 [2024-11-14 03:57:35,114 INFO L226 Difference]: Without dead ends: 198 [2024-11-14 03:57:35,114 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=15, Invalid=27, Unknown=0, NotChecked=0, Total=42 [2024-11-14 03:57:35,114 INFO L432 NwaCegarLoop]: 95 mSDtfsCounter, 44 mSDsluCounter, 132 mSDsCounter, 0 mSdLazyCounter, 299 mSolverCounterSat, 14 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 44 SdHoareTripleChecker+Valid, 227 SdHoareTripleChecker+Invalid, 313 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 14 IncrementalHoareTripleChecker+Valid, 299 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.2s IncrementalHoareTripleChecker+Time [2024-11-14 03:57:35,115 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [44 Valid, 227 Invalid, 313 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [14 Valid, 299 Invalid, 0 Unknown, 0 Unchecked, 1.2s Time] [2024-11-14 03:57:35,115 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 198 states. [2024-11-14 03:57:35,119 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 198 to 190. [2024-11-14 03:57:35,120 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 190 states, 155 states have (on average 1.4645161290322581) internal successors, (227), 188 states have internal predecessors, (227), 6 states have call successors, (6), 1 states have call predecessors, (6), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-14 03:57:35,121 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 190 states to 190 states and 233 transitions. [2024-11-14 03:57:35,121 INFO L78 Accepts]: Start accepts. Automaton has 190 states and 233 transitions. Word has length 25 [2024-11-14 03:57:35,122 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-14 03:57:35,122 INFO L471 AbstractCegarLoop]: Abstraction has 190 states and 233 transitions. [2024-11-14 03:57:35,122 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 4 states have (on average 6.0) internal successors, (24), 5 states have internal predecessors, (24), 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-14 03:57:35,122 INFO L276 IsEmpty]: Start isEmpty. Operand 190 states and 233 transitions. [2024-11-14 03:57:35,123 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 27 [2024-11-14 03:57:35,123 INFO L207 NwaCegarLoop]: Found error trace [2024-11-14 03:57:35,123 INFO L215 NwaCegarLoop]: trace histogram [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] [2024-11-14 03:57:35,123 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable14 [2024-11-14 03:57:35,124 INFO L396 AbstractCegarLoop]: === Iteration 16 === Targeting reach_errorErr0ASSERT_VIOLATIONMEMORY_LEAK === [reach_errorErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 62 more)] === [2024-11-14 03:57:35,124 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-14 03:57:35,124 INFO L85 PathProgramCache]: Analyzing trace with hash -2069608862, now seen corresponding path program 1 times [2024-11-14 03:57:35,124 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2024-11-14 03:57:35,124 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2129073103] [2024-11-14 03:57:35,124 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-14 03:57:35,125 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-14 03:57:35,157 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-14 03:57:37,138 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-14 03:57:37,138 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2024-11-14 03:57:37,138 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2129073103] [2024-11-14 03:57:37,138 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2129073103] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-14 03:57:37,138 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [986546224] [2024-11-14 03:57:37,139 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-14 03:57:37,139 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-14 03:57:37,139 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_2088ea77-1acf-4d0c-88ef-23be095c4621/bin/utaipan-verify-sOmjnqqW8E/z3 [2024-11-14 03:57:37,141 INFO L229 MonitoredProcess]: Starting monitored process 4 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_2088ea77-1acf-4d0c-88ef-23be095c4621/bin/utaipan-verify-sOmjnqqW8E/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-11-14 03:57:37,142 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_2088ea77-1acf-4d0c-88ef-23be095c4621/bin/utaipan-verify-sOmjnqqW8E/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Waiting until timeout for monitored process [2024-11-14 03:57:37,249 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-14 03:57:37,251 INFO L255 TraceCheckSpWp]: Trace formula consists of 188 conjuncts, 29 conjuncts are in the unsatisfiable core [2024-11-14 03:57:37,253 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-14 03:57:37,263 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-14 03:57:37,305 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 7 [2024-11-14 03:57:37,570 INFO L349 Elim1Store]: treesize reduction 4, result has 50.0 percent of original size [2024-11-14 03:57:37,570 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-14 03:57:37,739 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-11-14 03:57:37,740 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 23 treesize of output 11 [2024-11-14 03:57:37,773 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 15 treesize of output 1 [2024-11-14 03:57:37,936 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 16 treesize of output 8 [2024-11-14 03:57:38,089 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 16 treesize of output 11 [2024-11-14 03:57:38,147 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 16 treesize of output 11 [2024-11-14 03:57:38,749 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-14 03:57:38,749 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-11-14 03:57:40,535 INFO L173 IndexEqualityManager]: detected equality via solver [2024-11-14 03:57:40,566 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-11-14 03:57:40,566 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 2 case distinctions, treesize of input 25 treesize of output 31 [2024-11-14 03:57:40,614 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-11-14 03:57:40,614 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 36 treesize of output 32 [2024-11-14 03:57:40,628 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-14 03:57:42,951 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-14 03:57:42,951 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [986546224] provided 0 perfect and 2 imperfect interpolant sequences [2024-11-14 03:57:42,951 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSifa [1137579397] [2024-11-14 03:57:42,953 INFO L159 IcfgInterpreter]: Started Sifa with 25 locations of interest [2024-11-14 03:57:42,953 INFO L166 IcfgInterpreter]: Building call graph [2024-11-14 03:57:42,954 INFO L171 IcfgInterpreter]: Initial procedures are [ULTIMATE.start] [2024-11-14 03:57:42,954 INFO L176 IcfgInterpreter]: Starting interpretation [2024-11-14 03:57:42,954 INFO L197 IcfgInterpreter]: Interpreting procedure ULTIMATE.start with input of size 1 for LOIs [2024-11-14 03:57:47,834 INFO L197 IcfgInterpreter]: Interpreting procedure reach_error with input of size 79 for LOIs [2024-11-14 03:57:47,860 INFO L180 IcfgInterpreter]: Interpretation finished [2024-11-14 03:58:26,496 INFO L133 SifaRunner]: Sifa could not show that error location is unreachable, found '6144#(and (exists ((|v_#memory_int_108| (Array Int (Array Int Int))) (|v_#memory_$Pointer$.offset_117| (Array Int (Array Int Int))) (|v_ULTIMATE.start_main_~x~0#1.offset_143| Int) (|v_ULTIMATE.start_main_~x~0#1.base_170| Int) (|v_#memory_$Pointer$.base_121| (Array Int (Array Int Int)))) (and (= (select |#valid| |v_ULTIMATE.start_main_~x~0#1.base_170|) 1) (= (store |v_#memory_$Pointer$.base_121| |v_ULTIMATE.start_main_~x~0#1.base_170| (store (select |v_#memory_$Pointer$.base_121| |v_ULTIMATE.start_main_~x~0#1.base_170|) (+ 4 |v_ULTIMATE.start_main_~x~0#1.offset_143|) (select (select |#memory_$Pointer$.base| |v_ULTIMATE.start_main_~x~0#1.base_170|) (+ 4 |v_ULTIMATE.start_main_~x~0#1.offset_143|)))) |#memory_$Pointer$.base|) (= |#memory_$Pointer$.offset| (store |v_#memory_$Pointer$.offset_117| |v_ULTIMATE.start_main_~x~0#1.base_170| (store (select |v_#memory_$Pointer$.offset_117| |v_ULTIMATE.start_main_~x~0#1.base_170|) (+ 4 |v_ULTIMATE.start_main_~x~0#1.offset_143|) (select (select |#memory_$Pointer$.offset| |v_ULTIMATE.start_main_~x~0#1.base_170|) (+ 4 |v_ULTIMATE.start_main_~x~0#1.offset_143|))))) (<= 0 (+ 4 |v_ULTIMATE.start_main_~x~0#1.offset_143|)) (<= (+ 8 |v_ULTIMATE.start_main_~x~0#1.offset_143|) (select |#length| |v_ULTIMATE.start_main_~x~0#1.base_170|)) (= |#memory_int| (store |v_#memory_int_108| |v_ULTIMATE.start_main_~x~0#1.base_170| (store (select |v_#memory_int_108| |v_ULTIMATE.start_main_~x~0#1.base_170|) (+ 4 |v_ULTIMATE.start_main_~x~0#1.offset_143|) 1))))) (exists ((|v_ULTIMATE.start_main_~head~0#1.base_BEFORE_CALL_1| Int) (|v_ULTIMATE.start_main_~head~0#1.offset_BEFORE_CALL_1| Int)) (and (<= 0 (+ (select (select |#memory_$Pointer$.offset| |v_ULTIMATE.start_main_~head~0#1.base_BEFORE_CALL_1|) |v_ULTIMATE.start_main_~head~0#1.offset_BEFORE_CALL_1|) 4)) (<= 0 |v_ULTIMATE.start_main_~head~0#1.offset_BEFORE_CALL_1|) (= (select |#valid| (select (select |#memory_$Pointer$.base| |v_ULTIMATE.start_main_~head~0#1.base_BEFORE_CALL_1|) |v_ULTIMATE.start_main_~head~0#1.offset_BEFORE_CALL_1|)) 1) (= 1 (select |#valid| |v_ULTIMATE.start_main_~head~0#1.base_BEFORE_CALL_1|)) (<= (+ 8 (select (select |#memory_$Pointer$.offset| |v_ULTIMATE.start_main_~head~0#1.base_BEFORE_CALL_1|) |v_ULTIMATE.start_main_~head~0#1.offset_BEFORE_CALL_1|)) (select |#length| (select (select |#memory_$Pointer$.base| |v_ULTIMATE.start_main_~head~0#1.base_BEFORE_CALL_1|) |v_ULTIMATE.start_main_~head~0#1.offset_BEFORE_CALL_1|))) (or (not (= (select (select |#memory_$Pointer$.offset| |v_ULTIMATE.start_main_~head~0#1.base_BEFORE_CALL_1|) |v_ULTIMATE.start_main_~head~0#1.offset_BEFORE_CALL_1|) 0)) (not (= (select (select |#memory_$Pointer$.base| |v_ULTIMATE.start_main_~head~0#1.base_BEFORE_CALL_1|) |v_ULTIMATE.start_main_~head~0#1.offset_BEFORE_CALL_1|) 0))) (not (= (select (select |#memory_int| |v_ULTIMATE.start_main_~head~0#1.base_BEFORE_CALL_1|) (+ |v_ULTIMATE.start_main_~head~0#1.offset_BEFORE_CALL_1| 4)) 0)) (= (select (select |#memory_int| (select (select |#memory_$Pointer$.base| |v_ULTIMATE.start_main_~head~0#1.base_BEFORE_CALL_1|) |v_ULTIMATE.start_main_~head~0#1.offset_BEFORE_CALL_1|)) (+ (select (select |#memory_$Pointer$.offset| |v_ULTIMATE.start_main_~head~0#1.base_BEFORE_CALL_1|) |v_ULTIMATE.start_main_~head~0#1.offset_BEFORE_CALL_1|) 4)) 0) (or (not (= |v_ULTIMATE.start_main_~head~0#1.base_BEFORE_CALL_1| 0)) (not (= |v_ULTIMATE.start_main_~head~0#1.offset_BEFORE_CALL_1| 0))) (<= (+ |v_ULTIMATE.start_main_~head~0#1.offset_BEFORE_CALL_1| 8) (select |#length| |v_ULTIMATE.start_main_~head~0#1.base_BEFORE_CALL_1|)))))' at error location [2024-11-14 03:58:26,496 WARN L311 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: ALGORITHM_FAILED [2024-11-14 03:58:26,496 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2024-11-14 03:58:26,496 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [13, 10, 10] total 29 [2024-11-14 03:58:26,496 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2078557334] [2024-11-14 03:58:26,496 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2024-11-14 03:58:26,497 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 30 states [2024-11-14 03:58:26,497 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2024-11-14 03:58:26,498 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 30 interpolants. [2024-11-14 03:58:26,498 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=171, Invalid=2159, Unknown=22, NotChecked=0, Total=2352 [2024-11-14 03:58:26,499 INFO L87 Difference]: Start difference. First operand 190 states and 233 transitions. Second operand has 30 states, 30 states have (on average 2.3333333333333335) internal successors, (70), 29 states have internal predecessors, (70), 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-14 03:59:21,871 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-14 03:59:21,871 INFO L93 Difference]: Finished difference Result 224 states and 267 transitions. [2024-11-14 03:59:21,872 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 33 states. [2024-11-14 03:59:21,872 INFO L78 Accepts]: Start accepts. Automaton has has 30 states, 30 states have (on average 2.3333333333333335) internal successors, (70), 29 states have internal predecessors, (70), 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-14 03:59:21,872 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-14 03:59:21,873 INFO L225 Difference]: With dead ends: 224 [2024-11-14 03:59:21,873 INFO L226 Difference]: Without dead ends: 224 [2024-11-14 03:59:21,875 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 119 GetRequests, 42 SyntacticMatches, 0 SemanticMatches, 77 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1510 ImplicationChecksByTransitivity, 91.9s TimeCoverageRelationStatistics Valid=697, Invalid=5421, Unknown=44, NotChecked=0, Total=6162 [2024-11-14 03:59:21,876 INFO L432 NwaCegarLoop]: 68 mSDtfsCounter, 544 mSDsluCounter, 892 mSDsCounter, 0 mSdLazyCounter, 1588 mSolverCounterSat, 88 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 7.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 544 SdHoareTripleChecker+Valid, 960 SdHoareTripleChecker+Invalid, 1676 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 88 IncrementalHoareTripleChecker+Valid, 1588 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 7.4s IncrementalHoareTripleChecker+Time [2024-11-14 03:59:21,876 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [544 Valid, 960 Invalid, 1676 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [88 Valid, 1588 Invalid, 0 Unknown, 0 Unchecked, 7.4s Time] [2024-11-14 03:59:21,877 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 224 states. [2024-11-14 03:59:21,881 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 224 to 185. [2024-11-14 03:59:21,881 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 185 states, 150 states have (on average 1.4533333333333334) internal successors, (218), 183 states have internal predecessors, (218), 6 states have call successors, (6), 1 states have call predecessors, (6), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-14 03:59:21,882 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 185 states to 185 states and 224 transitions. [2024-11-14 03:59:21,883 INFO L78 Accepts]: Start accepts. Automaton has 185 states and 224 transitions. Word has length 26 [2024-11-14 03:59:21,883 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-14 03:59:21,883 INFO L471 AbstractCegarLoop]: Abstraction has 185 states and 224 transitions. [2024-11-14 03:59:21,883 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 30 states, 30 states have (on average 2.3333333333333335) internal successors, (70), 29 states have internal predecessors, (70), 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-14 03:59:21,883 INFO L276 IsEmpty]: Start isEmpty. Operand 185 states and 224 transitions. [2024-11-14 03:59:21,884 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 28 [2024-11-14 03:59:21,884 INFO L207 NwaCegarLoop]: Found error trace [2024-11-14 03:59:21,884 INFO L215 NwaCegarLoop]: trace histogram [3, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-14 03:59:21,906 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_2088ea77-1acf-4d0c-88ef-23be095c4621/bin/utaipan-verify-sOmjnqqW8E/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Ended with exit code 0 [2024-11-14 03:59:22,085 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 4 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_2088ea77-1acf-4d0c-88ef-23be095c4621/bin/utaipan-verify-sOmjnqqW8E/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable15 [2024-11-14 03:59:22,085 INFO L396 AbstractCegarLoop]: === Iteration 17 === Targeting ULTIMATE.startErr19REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [reach_errorErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 62 more)] === [2024-11-14 03:59:22,085 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-14 03:59:22,085 INFO L85 PathProgramCache]: Analyzing trace with hash 1797196109, now seen corresponding path program 2 times [2024-11-14 03:59:22,085 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2024-11-14 03:59:22,085 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1818524581] [2024-11-14 03:59:22,086 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-14 03:59:22,086 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-14 03:59:22,123 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-14 03:59:24,658 INFO L134 CoverageAnalysis]: Checked inductivity of 11 backedges. 0 proven. 11 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-14 03:59:24,659 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2024-11-14 03:59:24,659 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1818524581] [2024-11-14 03:59:24,659 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1818524581] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-14 03:59:24,659 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1468712146] [2024-11-14 03:59:24,659 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2024-11-14 03:59:24,659 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-14 03:59:24,659 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_2088ea77-1acf-4d0c-88ef-23be095c4621/bin/utaipan-verify-sOmjnqqW8E/z3 [2024-11-14 03:59:24,662 INFO L229 MonitoredProcess]: Starting monitored process 5 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_2088ea77-1acf-4d0c-88ef-23be095c4621/bin/utaipan-verify-sOmjnqqW8E/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-11-14 03:59:24,664 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_2088ea77-1acf-4d0c-88ef-23be095c4621/bin/utaipan-verify-sOmjnqqW8E/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Waiting until timeout for monitored process [2024-11-14 03:59:24,851 INFO L227 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 3 check-sat command(s) [2024-11-14 03:59:24,851 INFO L228 tOrderPrioritization]: Conjunction of SSA is unsat [2024-11-14 03:59:24,853 INFO L255 TraceCheckSpWp]: Trace formula consists of 246 conjuncts, 61 conjuncts are in the unsatisfiable core [2024-11-14 03:59:24,858 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-14 03:59:24,869 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-14 03:59:25,421 INFO L349 Elim1Store]: treesize reduction 18, result has 35.7 percent of original size [2024-11-14 03:59:25,421 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 2 case distinctions, treesize of input 17 treesize of output 21 [2024-11-14 03:59:25,463 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 8 treesize of output 1 [2024-11-14 03:59:25,785 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 7 [2024-11-14 03:59:25,821 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 15 treesize of output 1 [2024-11-14 03:59:26,505 INFO L349 Elim1Store]: treesize reduction 13, result has 40.9 percent of original size [2024-11-14 03:59:26,505 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 1 new quantified variables, introduced 1 case distinctions, treesize of input 16 treesize of output 15 [2024-11-14 03:59:26,607 INFO L349 Elim1Store]: treesize reduction 17, result has 22.7 percent of original size [2024-11-14 03:59:26,607 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 1 new quantified variables, introduced 1 case distinctions, treesize of input 42 treesize of output 31 [2024-11-14 03:59:26,942 INFO L349 Elim1Store]: treesize reduction 17, result has 22.7 percent of original size [2024-11-14 03:59:26,943 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 1 new quantified variables, introduced 1 case distinctions, treesize of input 42 treesize of output 31 [2024-11-14 03:59:27,013 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-11-14 03:59:27,014 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 16 treesize of output 11 [2024-11-14 03:59:27,202 INFO L349 Elim1Store]: treesize reduction 8, result has 61.9 percent of original size [2024-11-14 03:59:27,202 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 3 select indices, 3 select index equivalence classes, 1 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 2 case distinctions, treesize of input 20 treesize of output 22 [2024-11-14 03:59:27,216 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 3 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 18 treesize of output 13 [2024-11-14 03:59:27,505 INFO L349 Elim1Store]: treesize reduction 17, result has 22.7 percent of original size [2024-11-14 03:59:27,505 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 1 new quantified variables, introduced 1 case distinctions, treesize of input 33 treesize of output 24 [2024-11-14 03:59:27,561 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-11-14 03:59:27,571 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 23 treesize of output 11 [2024-11-14 03:59:28,256 INFO L349 Elim1Store]: treesize reduction 21, result has 34.4 percent of original size [2024-11-14 03:59:28,257 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 1 new quantified variables, introduced 1 case distinctions, treesize of input 51 treesize of output 42 [2024-11-14 03:59:28,424 INFO L349 Elim1Store]: treesize reduction 48, result has 23.8 percent of original size [2024-11-14 03:59:28,425 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 2 case distinctions, treesize of input 33 treesize of output 31 [2024-11-14 03:59:29,144 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-11-14 03:59:29,158 INFO L349 Elim1Store]: treesize reduction 11, result has 8.3 percent of original size [2024-11-14 03:59:29,159 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 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 95 treesize of output 70 [2024-11-14 03:59:29,188 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-11-14 03:59:29,679 INFO L349 Elim1Store]: treesize reduction 124, result has 32.2 percent of original size [2024-11-14 03:59:29,679 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 4 select indices, 4 select index equivalence classes, 2 disjoint index pairs (out of 6 index pairs), introduced 4 new quantified variables, introduced 8 case distinctions, treesize of input 102 treesize of output 123 [2024-11-14 03:59:39,477 INFO L349 Elim1Store]: treesize reduction 4, result has 87.9 percent of original size [2024-11-14 03:59:39,477 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 3 select indices, 3 select index equivalence classes, 0 disjoint index pairs (out of 3 index pairs), introduced 4 new quantified variables, introduced 3 case distinctions, treesize of input 106 treesize of output 93 [2024-11-14 03:59:39,663 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-11-14 03:59:39,663 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 4 select indices, 4 select index equivalence classes, 2 disjoint index pairs (out of 6 index pairs), introduced 4 new quantified variables, introduced 4 case distinctions, treesize of input 58 treesize of output 82 [2024-11-14 03:59:40,423 INFO L134 CoverageAnalysis]: Checked inductivity of 11 backedges. 0 proven. 11 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-14 03:59:40,423 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-11-14 03:59:42,442 WARN L851 $PredicateComparison]: unable to prove that (let ((.cse1 (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_~x~0#1.base|)) (.cse3 (select |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_main_~x~0#1.base|)) (.cse2 (+ |c_ULTIMATE.start_main_~x~0#1.offset| 4))) (and (forall ((v_ArrVal_656 (Array Int Int))) (or (forall ((|v_ULTIMATE.start_main_~x~0#1.offset_147| Int) (v_ArrVal_655 Int)) (let ((.cse0 (select (select (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_~x~0#1.base| (store .cse1 .cse2 v_ArrVal_655)) |c_ULTIMATE.start_main_~head~0#1.base|) |v_ULTIMATE.start_main_~x~0#1.offset_147|))) (or (< (+ 7 (select (select (store |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_main_~x~0#1.base| v_ArrVal_656) |c_ULTIMATE.start_main_~head~0#1.base|) |v_ULTIMATE.start_main_~x~0#1.offset_147|)) (select |c_#length| .cse0)) (< |v_ULTIMATE.start_main_~x~0#1.offset_147| 0) (< |c_ULTIMATE.start_main_~head~0#1.offset| |v_ULTIMATE.start_main_~x~0#1.offset_147|) (= .cse0 0)))) (not (= v_ArrVal_656 (store .cse3 .cse2 (select v_ArrVal_656 .cse2)))))) (forall ((v_ArrVal_656 (Array Int Int))) (or (forall ((|v_ULTIMATE.start_main_~x~0#1.offset_147| Int)) (or (< |v_ULTIMATE.start_main_~x~0#1.offset_147| 0) (< |c_ULTIMATE.start_main_~head~0#1.offset| |v_ULTIMATE.start_main_~x~0#1.offset_147|) (< 0 (+ 5 (select (select (store |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_main_~x~0#1.base| v_ArrVal_656) |c_ULTIMATE.start_main_~head~0#1.base|) |v_ULTIMATE.start_main_~x~0#1.offset_147|))))) (not (= v_ArrVal_656 (store .cse3 .cse2 (select v_ArrVal_656 .cse2)))))) (forall ((v_ArrVal_656 (Array Int Int))) (or (forall ((|v_ULTIMATE.start_main_~x~0#1.offset_147| Int) (v_ArrVal_655 Int)) (let ((.cse4 (select (select (store |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_main_~x~0#1.base| v_ArrVal_656) |c_ULTIMATE.start_main_~head~0#1.base|) |v_ULTIMATE.start_main_~x~0#1.offset_147|))) (or (< (+ 7 .cse4) (select |c_#length| (select (select (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_~x~0#1.base| (store .cse1 .cse2 v_ArrVal_655)) |c_ULTIMATE.start_main_~head~0#1.base|) |v_ULTIMATE.start_main_~x~0#1.offset_147|))) (< |v_ULTIMATE.start_main_~x~0#1.offset_147| 0) (< |c_ULTIMATE.start_main_~head~0#1.offset| |v_ULTIMATE.start_main_~x~0#1.offset_147|) (= .cse4 0)))) (not (= v_ArrVal_656 (store .cse3 .cse2 (select v_ArrVal_656 .cse2)))))))) is different from false [2024-11-14 03:59:49,780 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-11-14 03:59:49,780 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 1 new quantified variables, introduced 1 case distinctions, treesize of input 87 treesize of output 84 [2024-11-14 03:59:49,932 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-11-14 03:59:49,932 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 1 new quantified variables, introduced 1 case distinctions, treesize of input 43 treesize of output 43 [2024-11-14 03:59:50,033 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-11-14 03:59:50,033 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 1 new quantified variables, introduced 1 case distinctions, treesize of input 71 treesize of output 71 [2024-11-14 03:59:50,175 WARN L851 $PredicateComparison]: unable to prove that (and (or (forall ((|v_ULTIMATE.start_main_#t~malloc3#1.base_30| Int)) (not (= (select |c_#valid| |v_ULTIMATE.start_main_#t~malloc3#1.base_30|) 0))) (forall ((v_ArrVal_656 (Array Int Int)) (|ULTIMATE.start_main_~x~0#1.offset| Int) (|v_ULTIMATE.start_main_~x~0#1.offset_148| Int) (v_arrayElimArr_7 (Array Int Int)) (v_subst_9 Int) (|v_ULTIMATE.start_main_~x~0#1.offset_147| Int)) (let ((.cse0 (store |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_main_~x~0#1.base| v_arrayElimArr_7)) (.cse2 (select v_arrayElimArr_7 |ULTIMATE.start_main_~x~0#1.offset|))) (or (not (= (let ((.cse1 (+ 4 |v_ULTIMATE.start_main_~x~0#1.offset_148|))) (store (store (select .cse0 v_subst_9) |v_ULTIMATE.start_main_~x~0#1.offset_148| 0) .cse1 (select v_ArrVal_656 .cse1))) v_ArrVal_656)) (< 0 .cse2) (< |v_ULTIMATE.start_main_~x~0#1.offset_147| 0) (< |c_ULTIMATE.start_main_~head~0#1.offset| |v_ULTIMATE.start_main_~x~0#1.offset_147|) (< 0 (+ (select (select (store .cse0 v_subst_9 v_ArrVal_656) |c_ULTIMATE.start_main_~head~0#1.base|) |v_ULTIMATE.start_main_~x~0#1.offset_147|) 5)) (< |v_ULTIMATE.start_main_~x~0#1.offset_148| 0) (< .cse2 |v_ULTIMATE.start_main_~x~0#1.offset_148|))))) (forall ((v_arrayElimArr_6 (Array Int Int)) (v_ArrVal_656 (Array Int Int)) (|ULTIMATE.start_main_~x~0#1.offset| Int) (|v_ULTIMATE.start_main_~x~0#1.offset_148| Int) (v_ArrVal_649 (Array Int Int)) (|v_ULTIMATE.start_main_#t~malloc3#1.base_30| Int) (v_ArrVal_647 Int) (v_subst_10 Int) (|v_ULTIMATE.start_main_~x~0#1.offset_147| Int) (v_ArrVal_655 Int)) (let ((.cse3 (store |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_main_~x~0#1.base| v_arrayElimArr_6))) (let ((.cse5 (select (select (store .cse3 v_subst_10 v_ArrVal_656) |c_ULTIMATE.start_main_~head~0#1.base|) |v_ULTIMATE.start_main_~x~0#1.offset_147|)) (.cse4 (+ 4 |v_ULTIMATE.start_main_~x~0#1.offset_148|)) (.cse6 (select v_arrayElimArr_6 |ULTIMATE.start_main_~x~0#1.offset|))) (or (< |v_ULTIMATE.start_main_~x~0#1.offset_147| 0) (< |c_ULTIMATE.start_main_~head~0#1.offset| |v_ULTIMATE.start_main_~x~0#1.offset_147|) (not (= (select |c_#valid| |v_ULTIMATE.start_main_#t~malloc3#1.base_30|) 0)) (< |v_ULTIMATE.start_main_~x~0#1.offset_148| 0) (not (= v_ArrVal_656 (store (store (select .cse3 v_subst_10) |v_ULTIMATE.start_main_~x~0#1.offset_148| 0) .cse4 (select v_ArrVal_656 .cse4)))) (= .cse5 0) (< .cse6 |v_ULTIMATE.start_main_~x~0#1.offset_148|) (< (+ 7 .cse5) (select (store |c_#length| |v_ULTIMATE.start_main_#t~malloc3#1.base_30| v_ArrVal_647) (select (select (let ((.cse7 (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_~x~0#1.base| v_ArrVal_649))) (store .cse7 v_subst_10 (store (store (select .cse7 v_subst_10) |v_ULTIMATE.start_main_~x~0#1.offset_148| 0) .cse4 v_ArrVal_655))) |c_ULTIMATE.start_main_~head~0#1.base|) |v_ULTIMATE.start_main_~x~0#1.offset_147|))) (< 0 .cse6))))) (forall ((v_ArrVal_656 (Array Int Int)) (|ULTIMATE.start_main_~x~0#1.offset| Int) (|v_ULTIMATE.start_main_~x~0#1.offset_148| Int) (v_arrayElimArr_8 (Array Int Int)) (v_ArrVal_649 (Array Int Int)) (|v_ULTIMATE.start_main_#t~malloc3#1.base_30| Int) (v_subst_11 Int) (v_ArrVal_647 Int) (|v_ULTIMATE.start_main_~x~0#1.offset_147| Int) (v_ArrVal_655 Int)) (let ((.cse9 (+ 4 |v_ULTIMATE.start_main_~x~0#1.offset_148|))) (let ((.cse8 (store |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_main_~x~0#1.base| v_arrayElimArr_8)) (.cse10 (select (select (let ((.cse12 (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_~x~0#1.base| v_ArrVal_649))) (store .cse12 v_subst_11 (store (store (select .cse12 v_subst_11) |v_ULTIMATE.start_main_~x~0#1.offset_148| 0) .cse9 v_ArrVal_655))) |c_ULTIMATE.start_main_~head~0#1.base|) |v_ULTIMATE.start_main_~x~0#1.offset_147|)) (.cse11 (select v_arrayElimArr_8 |ULTIMATE.start_main_~x~0#1.offset|))) (or (not (= v_ArrVal_656 (store (store (select .cse8 v_subst_11) |v_ULTIMATE.start_main_~x~0#1.offset_148| 0) .cse9 (select v_ArrVal_656 .cse9)))) (< |v_ULTIMATE.start_main_~x~0#1.offset_147| 0) (< (+ 7 (select (select (store .cse8 v_subst_11 v_ArrVal_656) |c_ULTIMATE.start_main_~head~0#1.base|) |v_ULTIMATE.start_main_~x~0#1.offset_147|)) (select (store |c_#length| |v_ULTIMATE.start_main_#t~malloc3#1.base_30| v_ArrVal_647) .cse10)) (< |c_ULTIMATE.start_main_~head~0#1.offset| |v_ULTIMATE.start_main_~x~0#1.offset_147|) (not (= (select |c_#valid| |v_ULTIMATE.start_main_#t~malloc3#1.base_30|) 0)) (< |v_ULTIMATE.start_main_~x~0#1.offset_148| 0) (= .cse10 0) (< 0 .cse11) (< .cse11 |v_ULTIMATE.start_main_~x~0#1.offset_148|)))))) is different from false [2024-11-14 03:59:51,267 WARN L851 $PredicateComparison]: unable to prove that (let ((.cse3 (select (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_~x~0#1.base|) |c_ULTIMATE.start_main_~x~0#1.offset|))) (and (or (forall ((|v_ULTIMATE.start_main_#t~malloc3#1.base_30| Int)) (not (= (select |c_#valid| |v_ULTIMATE.start_main_#t~malloc3#1.base_30|) 0))) (forall ((v_ArrVal_656 (Array Int Int)) (|v_ULTIMATE.start_main_~x~0#1.offset_148| Int) (v_subst_12 Int) (v_arrayElimArr_7 (Array Int Int)) (v_subst_9 Int) (|v_ULTIMATE.start_main_~x~0#1.offset_147| Int)) (let ((.cse0 (store |c_#memory_$Pointer$.offset| .cse3 v_arrayElimArr_7)) (.cse1 (select v_arrayElimArr_7 v_subst_12))) (or (< 0 (+ 5 (select (select (store .cse0 v_subst_9 v_ArrVal_656) |c_ULTIMATE.start_main_~head~0#1.base|) |v_ULTIMATE.start_main_~x~0#1.offset_147|))) (< 0 .cse1) (< |v_ULTIMATE.start_main_~x~0#1.offset_147| 0) (< |c_ULTIMATE.start_main_~head~0#1.offset| |v_ULTIMATE.start_main_~x~0#1.offset_147|) (< |v_ULTIMATE.start_main_~x~0#1.offset_148| 0) (not (= v_ArrVal_656 (let ((.cse2 (+ 4 |v_ULTIMATE.start_main_~x~0#1.offset_148|))) (store (store (select .cse0 v_subst_9) |v_ULTIMATE.start_main_~x~0#1.offset_148| 0) .cse2 (select v_ArrVal_656 .cse2))))) (< .cse1 |v_ULTIMATE.start_main_~x~0#1.offset_148|))))) (forall ((v_arrayElimArr_6 (Array Int Int)) (v_ArrVal_656 (Array Int Int)) (v_subst_13 Int) (|v_ULTIMATE.start_main_~x~0#1.offset_148| Int) (v_ArrVal_649 (Array Int Int)) (|v_ULTIMATE.start_main_#t~malloc3#1.base_30| Int) (v_ArrVal_647 Int) (v_subst_10 Int) (|v_ULTIMATE.start_main_~x~0#1.offset_147| Int) (v_ArrVal_655 Int)) (let ((.cse7 (store |c_#memory_$Pointer$.offset| .cse3 v_arrayElimArr_6))) (let ((.cse6 (+ 4 |v_ULTIMATE.start_main_~x~0#1.offset_148|)) (.cse4 (select (select (store .cse7 v_subst_10 v_ArrVal_656) |c_ULTIMATE.start_main_~head~0#1.base|) |v_ULTIMATE.start_main_~x~0#1.offset_147|)) (.cse8 (select v_arrayElimArr_6 v_subst_13))) (or (< |v_ULTIMATE.start_main_~x~0#1.offset_147| 0) (< |c_ULTIMATE.start_main_~head~0#1.offset| |v_ULTIMATE.start_main_~x~0#1.offset_147|) (< (+ 7 .cse4) (select (store |c_#length| |v_ULTIMATE.start_main_#t~malloc3#1.base_30| v_ArrVal_647) (select (select (let ((.cse5 (store |c_#memory_$Pointer$.base| .cse3 v_ArrVal_649))) (store .cse5 v_subst_10 (store (store (select .cse5 v_subst_10) |v_ULTIMATE.start_main_~x~0#1.offset_148| 0) .cse6 v_ArrVal_655))) |c_ULTIMATE.start_main_~head~0#1.base|) |v_ULTIMATE.start_main_~x~0#1.offset_147|))) (not (= (select |c_#valid| |v_ULTIMATE.start_main_#t~malloc3#1.base_30|) 0)) (< |v_ULTIMATE.start_main_~x~0#1.offset_148| 0) (not (= v_ArrVal_656 (store (store (select .cse7 v_subst_10) |v_ULTIMATE.start_main_~x~0#1.offset_148| 0) .cse6 (select v_ArrVal_656 .cse6)))) (= .cse4 0) (< .cse8 |v_ULTIMATE.start_main_~x~0#1.offset_148|) (< 0 .cse8))))) (forall ((v_ArrVal_656 (Array Int Int)) (v_subst_14 Int) (|v_ULTIMATE.start_main_~x~0#1.offset_148| Int) (v_arrayElimArr_8 (Array Int Int)) (v_ArrVal_649 (Array Int Int)) (|v_ULTIMATE.start_main_#t~malloc3#1.base_30| Int) (v_subst_11 Int) (v_ArrVal_647 Int) (|v_ULTIMATE.start_main_~x~0#1.offset_147| Int) (v_ArrVal_655 Int)) (let ((.cse12 (+ 4 |v_ULTIMATE.start_main_~x~0#1.offset_148|))) (let ((.cse9 (select v_arrayElimArr_8 v_subst_14)) (.cse11 (store |c_#memory_$Pointer$.offset| .cse3 v_arrayElimArr_8)) (.cse10 (select (select (let ((.cse13 (store |c_#memory_$Pointer$.base| .cse3 v_ArrVal_649))) (store .cse13 v_subst_11 (store (store (select .cse13 v_subst_11) |v_ULTIMATE.start_main_~x~0#1.offset_148| 0) .cse12 v_ArrVal_655))) |c_ULTIMATE.start_main_~head~0#1.base|) |v_ULTIMATE.start_main_~x~0#1.offset_147|))) (or (< .cse9 |v_ULTIMATE.start_main_~x~0#1.offset_148|) (< |v_ULTIMATE.start_main_~x~0#1.offset_147| 0) (< |c_ULTIMATE.start_main_~head~0#1.offset| |v_ULTIMATE.start_main_~x~0#1.offset_147|) (not (= (select |c_#valid| |v_ULTIMATE.start_main_#t~malloc3#1.base_30|) 0)) (< |v_ULTIMATE.start_main_~x~0#1.offset_148| 0) (< 0 .cse9) (= .cse10 0) (not (= v_ArrVal_656 (store (store (select .cse11 v_subst_11) |v_ULTIMATE.start_main_~x~0#1.offset_148| 0) .cse12 (select v_ArrVal_656 .cse12)))) (< (+ 7 (select (select (store .cse11 v_subst_11 v_ArrVal_656) |c_ULTIMATE.start_main_~head~0#1.base|) |v_ULTIMATE.start_main_~x~0#1.offset_147|)) (select (store |c_#length| |v_ULTIMATE.start_main_#t~malloc3#1.base_30| v_ArrVal_647) .cse10)))))))) is different from false [2024-11-14 03:59:51,356 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-11-14 03:59:51,356 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 67 treesize of output 60 [2024-11-14 03:59:51,552 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-11-14 03:59:51,552 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 3 select indices, 3 select index equivalence classes, 0 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 3 case distinctions, treesize of input 718 treesize of output 724 [2024-11-14 03:59:51,596 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-11-14 03:59:51,596 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 392 treesize of output 320 [2024-11-14 03:59:51,783 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-11-14 03:59:51,784 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 3 select indices, 3 select index equivalence classes, 0 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 3 case distinctions, treesize of input 1979 treesize of output 1963 [2024-11-14 03:59:51,854 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 346 treesize of output 338 [2024-11-14 03:59:52,292 INFO L349 Elim1Store]: treesize reduction 68, result has 45.6 percent of original size [2024-11-14 03:59:52,292 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 3 new quantified variables, introduced 5 case distinctions, treesize of input 363 treesize of output 397 [2024-11-14 03:59:52,482 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 6 treesize of output 4 [2024-11-14 03:59:52,785 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 6 treesize of output 4 [2024-11-14 03:59:53,034 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-11-14 03:59:53,034 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 1 case distinctions, treesize of input 16 treesize of output 6 [2024-11-14 03:59:53,320 INFO L349 Elim1Store]: treesize reduction 32, result has 52.9 percent of original size [2024-11-14 03:59:53,320 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 2 new quantified variables, introduced 3 case distinctions, treesize of input 41 treesize of output 62 [2024-11-14 03:59:53,566 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-11-14 03:59:53,566 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 3 select indices, 3 select index equivalence classes, 1 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 2 case distinctions, treesize of input 39 treesize of output 49 [2024-11-14 03:59:53,875 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-11-14 03:59:53,875 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 4 select indices, 4 select index equivalence classes, 1 disjoint index pairs (out of 6 index pairs), introduced 4 new quantified variables, introduced 5 case distinctions, treesize of input 67 treesize of output 99 [2024-11-14 03:59:54,537 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-11-14 03:59:54,538 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 4 select indices, 4 select index equivalence classes, 1 disjoint index pairs (out of 6 index pairs), introduced 4 new quantified variables, introduced 5 case distinctions, treesize of input 67 treesize of output 99 [2024-11-14 03:59:55,418 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-11-14 03:59:55,419 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 4 select indices, 4 select index equivalence classes, 1 disjoint index pairs (out of 6 index pairs), introduced 4 new quantified variables, introduced 5 case distinctions, treesize of input 67 treesize of output 99 [2024-11-14 03:59:56,590 INFO L349 Elim1Store]: treesize reduction 8, result has 82.2 percent of original size [2024-11-14 03:59:56,591 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 4 select indices, 4 select index equivalence classes, 1 disjoint index pairs (out of 6 index pairs), introduced 4 new quantified variables, introduced 5 case distinctions, treesize of input 67 treesize of output 91 [2024-11-14 03:59:57,267 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 6 treesize of output 4 [2024-11-14 03:59:57,501 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-11-14 03:59:57,502 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 335 treesize of output 333 [2024-11-14 04:00:03,767 INFO L349 Elim1Store]: treesize reduction 64, result has 48.8 percent of original size [2024-11-14 04:00:03,768 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 3 new quantified variables, introduced 5 case distinctions, treesize of input 1657 treesize of output 1671 [2024-11-14 04:00:08,400 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-11-14 04:00:08,400 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 3 select indices, 3 select index equivalence classes, 1 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 2 case distinctions, treesize of input 36 treesize of output 46 [2024-11-14 04:00:09,391 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-11-14 04:00:09,392 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 3 select indices, 3 select index equivalence classes, 1 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 2 case distinctions, treesize of input 36 treesize of output 46 [2024-11-14 04:00:10,582 INFO L349 Elim1Store]: treesize reduction 8, result has 82.2 percent of original size [2024-11-14 04:00:10,582 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 4 select indices, 4 select index equivalence classes, 1 disjoint index pairs (out of 6 index pairs), introduced 4 new quantified variables, introduced 5 case distinctions, treesize of input 53 treesize of output 79 [2024-11-14 04:00:11,717 INFO L349 Elim1Store]: treesize reduction 8, result has 82.2 percent of original size [2024-11-14 04:00:11,718 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 4 select indices, 4 select index equivalence classes, 1 disjoint index pairs (out of 6 index pairs), introduced 4 new quantified variables, introduced 5 case distinctions, treesize of input 53 treesize of output 79 [2024-11-14 04:00:49,292 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-11-14 04:00:49,294 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 11 select indices, 11 select index equivalence classes, 0 disjoint index pairs (out of 55 index pairs), introduced 11 new quantified variables, introduced 55 case distinctions, treesize of input 5638 treesize of output 5374 [2024-11-14 04:09:37,257 WARN L249 Executor]: External (MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_2088ea77-1acf-4d0c-88ef-23be095c4621/bin/utaipan-verify-sOmjnqqW8E/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (1) with exit command (exit)) stderr output: (error "out of memory") [2024-11-14 04:09:37,257 WARN L311 FreeRefinementEngine]: Interpolation failed due to KNOWN_DEPENDING: External (MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_2088ea77-1acf-4d0c-88ef-23be095c4621/bin/utaipan-verify-sOmjnqqW8E/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (1) with exit command (exit)) Received EOF on stdin. stderr output: (error "out of memory") [2024-11-14 04:09:37,257 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSifa [1936230772] [2024-11-14 04:09:37,257 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_2088ea77-1acf-4d0c-88ef-23be095c4621/bin/utaipan-verify-sOmjnqqW8E/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (1)] Ended with exit code 101 [2024-11-14 04:09:37,259 INFO L159 IcfgInterpreter]: Started Sifa with 19 locations of interest [2024-11-14 04:09:37,259 INFO L166 IcfgInterpreter]: Building call graph [2024-11-14 04:09:37,259 INFO L171 IcfgInterpreter]: Initial procedures are [ULTIMATE.start] [2024-11-14 04:09:37,259 INFO L176 IcfgInterpreter]: Starting interpretation [2024-11-14 04:09:37,259 INFO L197 IcfgInterpreter]: Interpreting procedure ULTIMATE.start with input of size 1 for LOIs [2024-11-14 04:09:37,265 FATAL L? ?]: Ignoring exception! de.uni_freiburg.informatik.ultimate.logic.SMTLIBException: External (MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_2088ea77-1acf-4d0c-88ef-23be095c4621/bin/utaipan-verify-sOmjnqqW8E/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (1) with exit command (exit)) Connection to SMT solver broken at de.uni_freiburg.informatik.ultimate.smtsolver.external.Executor.convertIOException(Executor.java:337) at de.uni_freiburg.informatik.ultimate.smtsolver.external.Executor.input(Executor.java:177) at de.uni_freiburg.informatik.ultimate.smtsolver.external.Scriptor.push(Scriptor.java:132) at de.uni_freiburg.informatik.ultimate.lib.smtlibutils.arrays.DiffWrapperScript.push(DiffWrapperScript.java:90) at de.uni_freiburg.informatik.ultimate.logic.WrapperScript.push(WrapperScript.java:148) at de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.scripttransfer.HistoryRecordingScript.push(HistoryRecordingScript.java:107) at de.uni_freiburg.informatik.ultimate.logic.Util.checkSat(Util.java:48) at de.uni_freiburg.informatik.ultimate.lib.smtlibutils.SmtUtils.checkSatTerm(SmtUtils.java:326) at de.uni_freiburg.informatik.ultimate.lib.sifa.SymbolicTools.isFalse(SymbolicTools.java:220) at de.uni_freiburg.informatik.ultimate.lib.sifa.domain.RelationCheckUtil.isEqBottom_SolverAlphaSolver(RelationCheckUtil.java:56) at de.uni_freiburg.informatik.ultimate.lib.sifa.domain.ExplicitValueDomain.isEqBottom(ExplicitValueDomain.java:73) at de.uni_freiburg.informatik.ultimate.lib.sifa.domain.CompoundDomain.isEqBottom(CompoundDomain.java:84) at de.uni_freiburg.informatik.ultimate.lib.sifa.domain.StatsWrapperDomain.isEqBottom(StatsWrapperDomain.java:69) at de.uni_freiburg.informatik.ultimate.lib.sifa.DagInterpreter.earlyExitAfterStep(DagInterpreter.java:139) at de.uni_freiburg.informatik.ultimate.lib.sifa.DagInterpreter.interpret(DagInterpreter.java:125) at de.uni_freiburg.informatik.ultimate.lib.sifa.IcfgInterpreter.interpretLoisInProcedure(IcfgInterpreter.java:136) at de.uni_freiburg.informatik.ultimate.lib.sifa.IcfgInterpreter.interpret(IcfgInterpreter.java:127) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.SifaRunner.(SifaRunner.java:102) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.IpTcStrategyModuleSifa.construct(IpTcStrategyModuleSifa.java:68) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.IpTcStrategyModuleBase.getOrConstruct(IpTcStrategyModuleBase.java:101) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.IpTcStrategyModuleBase.getInterpolantComputationStatus(IpTcStrategyModuleBase.java:77) at de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.tracehandling.AutomatonFreeRefinementEngine.tryExecuteInterpolantGenerator(AutomatonFreeRefinementEngine.java:267) at de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.tracehandling.AutomatonFreeRefinementEngine.generateProof(AutomatonFreeRefinementEngine.java:148) at de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.tracehandling.AutomatonFreeRefinementEngine.executeStrategy(AutomatonFreeRefinementEngine.java:137) at de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.tracehandling.AutomatonFreeRefinementEngine.(AutomatonFreeRefinementEngine.java:85) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.TraceAbstractionRefinementEngine.(TraceAbstractionRefinementEngine.java:82) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.BasicCegarLoop.isCounterexampleFeasible(BasicCegarLoop.java:302) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.AbstractCegarLoop.iterate(AbstractCegarLoop.java:407) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.AbstractCegarLoop.startCegar(AbstractCegarLoop.java:342) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.AbstractCegarLoop.runCegar(AbstractCegarLoop.java:324) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.executeCegarLoop(TraceAbstractionStarter.java:429) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.analyseProgram(TraceAbstractionStarter.java:315) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.analyseSequentialProgram(TraceAbstractionStarter.java:276) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.runCegarLoops(TraceAbstractionStarter.java:170) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.(TraceAbstractionStarter.java:143) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver.finish(TraceAbstractionObserver.java:124) at de.uni_freiburg.informatik.ultimate.core.coreplugin.PluginConnector.runObserver(PluginConnector.java:167) at de.uni_freiburg.informatik.ultimate.core.coreplugin.PluginConnector.runTool(PluginConnector.java:150) at de.uni_freiburg.informatik.ultimate.core.coreplugin.PluginConnector.run(PluginConnector.java:127) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.executePluginConnector(ToolchainWalker.java:233) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.processPlugin(ToolchainWalker.java:227) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.walkUnprotected(ToolchainWalker.java:144) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.walk(ToolchainWalker.java:106) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainManager$Toolchain.processToolchain(ToolchainManager.java:319) at de.uni_freiburg.informatik.ultimate.core.coreplugin.toolchain.DefaultToolchainJob.run(DefaultToolchainJob.java:145) at org.eclipse.core.internal.jobs.Worker.run(Worker.java:63) Caused by: java.io.IOException: Stream closed at java.base/java.lang.ProcessBuilder$NullOutputStream.write(ProcessBuilder.java:447) at java.base/java.io.OutputStream.write(OutputStream.java:167) at java.base/java.io.BufferedOutputStream.flushBuffer(BufferedOutputStream.java:125) at java.base/java.io.BufferedOutputStream.implFlush(BufferedOutputStream.java:252) at java.base/java.io.BufferedOutputStream.flush(BufferedOutputStream.java:246) at java.base/sun.nio.cs.StreamEncoder.implFlush(StreamEncoder.java:412) at java.base/sun.nio.cs.StreamEncoder.lockedFlush(StreamEncoder.java:214) at java.base/sun.nio.cs.StreamEncoder.flush(StreamEncoder.java:201) at java.base/java.io.OutputStreamWriter.flush(OutputStreamWriter.java:262) at java.base/java.io.BufferedWriter.implFlush(BufferedWriter.java:372) at java.base/java.io.BufferedWriter.flush(BufferedWriter.java:359) at de.uni_freiburg.informatik.ultimate.smtsolver.external.Executor.input(Executor.java:175) ... 44 more [2024-11-14 04:09:37,270 INFO L185 FreeRefinementEngine]: Found 0 perfect and 1 imperfect interpolant sequences. [2024-11-14 04:09:37,270 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [15] total 15 [2024-11-14 04:09:37,270 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [47744216] [2024-11-14 04:09:37,270 INFO L85 oduleStraightlineAll]: Using 1 imperfect interpolants to construct interpolant automaton [2024-11-14 04:09:37,273 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 16 states [2024-11-14 04:09:37,273 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2024-11-14 04:09:37,273 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 16 interpolants. [2024-11-14 04:09:37,273 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=163, Invalid=1326, Unknown=5, NotChecked=228, Total=1722 [2024-11-14 04:09:37,274 INFO L87 Difference]: Start difference. First operand 185 states and 224 transitions. Second operand has 16 states, 15 states have (on average 1.8) internal successors, (27), 16 states have internal predecessors, (27), 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-14 04:09:37,274 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 63 GetRequests, 22 SyntacticMatches, 1 SemanticMatches, 40 ConstructedPredicates, 3 IntricatePredicates, 0 DeprecatedPredicates, 397 ImplicationChecksByTransitivity, 12.6s TimeCoverageRelationStatistics Valid=163, Invalid=1326, Unknown=5, NotChecked=228, Total=1722 [2024-11-14 04:09:37,275 INFO L432 NwaCegarLoop]: 0 mSDtfsCounter, 0 mSDsluCounter, 0 mSDsCounter, 0 mSdLazyCounter, 0 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 0 SdHoareTripleChecker+Invalid, 1 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 0 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-11-14 04:09:37,275 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 0 Invalid, 1 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 0 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-11-14 04:09:37,298 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_2088ea77-1acf-4d0c-88ef-23be095c4621/bin/utaipan-verify-sOmjnqqW8E/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Ended with exit code 0 [2024-11-14 04:09:37,478 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable16,5 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_2088ea77-1acf-4d0c-88ef-23be095c4621/bin/utaipan-verify-sOmjnqqW8E/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-14 04:09:37,478 FATAL L? ?]: An unrecoverable error occured during an interaction with an SMT solver: de.uni_freiburg.informatik.ultimate.logic.SMTLIBException: External (MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_2088ea77-1acf-4d0c-88ef-23be095c4621/bin/utaipan-verify-sOmjnqqW8E/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (1) with exit command (exit)) Connection to SMT solver broken at de.uni_freiburg.informatik.ultimate.smtsolver.external.Executor.convertIOException(Executor.java:337) at de.uni_freiburg.informatik.ultimate.smtsolver.external.Executor.input(Executor.java:177) at de.uni_freiburg.informatik.ultimate.smtsolver.external.Scriptor.pop(Scriptor.java:139) at de.uni_freiburg.informatik.ultimate.lib.smtlibutils.arrays.DiffWrapperScript.pop(DiffWrapperScript.java:99) at de.uni_freiburg.informatik.ultimate.logic.WrapperScript.pop(WrapperScript.java:153) at de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.scripttransfer.HistoryRecordingScript.pop(HistoryRecordingScript.java:117) at de.uni_freiburg.informatik.ultimate.lib.smtlibutils.ManagedScript.pop(ManagedScript.java:138) at de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.hoaretriple.IncrementalHoareTripleChecker.unAssertCodeBlock(IncrementalHoareTripleChecker.java:436) at de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.hoaretriple.IncrementalHoareTripleChecker.clearAssertionStack(IncrementalHoareTripleChecker.java:278) at de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.hoaretriple.IncrementalHoareTripleChecker.releaseLock(IncrementalHoareTripleChecker.java:284) at de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.hoaretriple.ChainingHoareTripleChecker$ProtectedHtc.releaseLock(ChainingHoareTripleChecker.java:449) at java.base/java.util.ArrayList$ArrayListSpliterator.forEachRemaining(ArrayList.java:1708) at java.base/java.util.stream.ReferencePipeline$Head.forEach(ReferencePipeline.java:762) at de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.hoaretriple.ChainingHoareTripleChecker.releaseLock(ChainingHoareTripleChecker.java:98) at de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.hoaretriple.CachingHoareTripleChecker.releaseLock(CachingHoareTripleChecker.java:159) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.interpolantautomata.transitionappender.AbstractInterpolantAutomaton.switchToReadonlyMode(AbstractInterpolantAutomaton.java:140) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.NwaCegarLoop.computeAutomataDifference(NwaCegarLoop.java:385) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.NwaCegarLoop.refineAbstraction(NwaCegarLoop.java:345) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.AbstractCegarLoop.refineAbstractionInternal(AbstractCegarLoop.java:463) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.AbstractCegarLoop.iterate(AbstractCegarLoop.java:414) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.AbstractCegarLoop.startCegar(AbstractCegarLoop.java:342) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.AbstractCegarLoop.runCegar(AbstractCegarLoop.java:324) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.executeCegarLoop(TraceAbstractionStarter.java:429) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.analyseProgram(TraceAbstractionStarter.java:315) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.analyseSequentialProgram(TraceAbstractionStarter.java:276) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.runCegarLoops(TraceAbstractionStarter.java:170) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.(TraceAbstractionStarter.java:143) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver.finish(TraceAbstractionObserver.java:124) at de.uni_freiburg.informatik.ultimate.core.coreplugin.PluginConnector.runObserver(PluginConnector.java:167) at de.uni_freiburg.informatik.ultimate.core.coreplugin.PluginConnector.runTool(PluginConnector.java:150) at de.uni_freiburg.informatik.ultimate.core.coreplugin.PluginConnector.run(PluginConnector.java:127) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.executePluginConnector(ToolchainWalker.java:233) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.processPlugin(ToolchainWalker.java:227) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.walkUnprotected(ToolchainWalker.java:144) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.walk(ToolchainWalker.java:106) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainManager$Toolchain.processToolchain(ToolchainManager.java:319) at de.uni_freiburg.informatik.ultimate.core.coreplugin.toolchain.DefaultToolchainJob.run(DefaultToolchainJob.java:145) at org.eclipse.core.internal.jobs.Worker.run(Worker.java:63) Caused by: java.io.IOException: Stream closed at java.base/java.lang.ProcessBuilder$NullOutputStream.write(ProcessBuilder.java:447) at java.base/java.io.OutputStream.write(OutputStream.java:167) at java.base/java.io.BufferedOutputStream.flushBuffer(BufferedOutputStream.java:125) at java.base/java.io.BufferedOutputStream.implFlush(BufferedOutputStream.java:252) at java.base/java.io.BufferedOutputStream.flush(BufferedOutputStream.java:246) at java.base/sun.nio.cs.StreamEncoder.implFlush(StreamEncoder.java:412) at java.base/sun.nio.cs.StreamEncoder.lockedFlush(StreamEncoder.java:214) at java.base/sun.nio.cs.StreamEncoder.flush(StreamEncoder.java:201) at java.base/java.io.OutputStreamWriter.flush(OutputStreamWriter.java:262) at java.base/java.io.BufferedWriter.implFlush(BufferedWriter.java:372) at java.base/java.io.BufferedWriter.flush(BufferedWriter.java:359) at de.uni_freiburg.informatik.ultimate.smtsolver.external.Executor.input(Executor.java:175) ... 36 more [2024-11-14 04:09:37,480 INFO L158 Benchmark]: Toolchain (without parser) took 808894.92ms. Allocated memory was 117.4MB in the beginning and 503.3MB in the end (delta: 385.9MB). Free memory was 91.2MB in the beginning and 173.9MB in the end (delta: -82.7MB). Peak memory consumption was 300.9MB. Max. memory is 16.1GB. [2024-11-14 04:09:37,481 INFO L158 Benchmark]: CDTParser took 1.12ms. Allocated memory is still 117.4MB. Free memory is still 75.2MB. There was no memory consumed. Max. memory is 16.1GB. [2024-11-14 04:09:37,481 INFO L158 Benchmark]: CACSL2BoogieTranslator took 408.84ms. Allocated memory is still 117.4MB. Free memory was 90.9MB in the beginning and 73.3MB in the end (delta: 17.5MB). Peak memory consumption was 16.8MB. Max. memory is 16.1GB. [2024-11-14 04:09:37,481 INFO L158 Benchmark]: Boogie Procedure Inliner took 52.94ms. Allocated memory is still 117.4MB. Free memory was 73.3MB in the beginning and 71.4MB in the end (delta: 1.9MB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. [2024-11-14 04:09:37,485 INFO L158 Benchmark]: Boogie Preprocessor took 35.06ms. Allocated memory is still 117.4MB. Free memory was 71.4MB in the beginning and 68.9MB in the end (delta: 2.5MB). There was no memory consumed. Max. memory is 16.1GB. [2024-11-14 04:09:37,485 INFO L158 Benchmark]: RCFGBuilder took 1048.92ms. Allocated memory is still 117.4MB. Free memory was 68.6MB in the beginning and 86.4MB in the end (delta: -17.8MB). Peak memory consumption was 38.9MB. Max. memory is 16.1GB. [2024-11-14 04:09:37,486 INFO L158 Benchmark]: TraceAbstraction took 807336.40ms. Allocated memory was 117.4MB in the beginning and 503.3MB in the end (delta: 385.9MB). Free memory was 85.9MB in the beginning and 173.9MB in the end (delta: -88.0MB). Peak memory consumption was 295.5MB. Max. memory is 16.1GB. [2024-11-14 04:09:37,487 INFO L338 ainManager$Toolchain]: ####################### End [Toolchain 1] ####################### --- Results --- * Results from de.uni_freiburg.informatik.ultimate.core: - StatisticsResult: Toolchain Benchmarks Benchmark results are: * CDTParser took 1.12ms. Allocated memory is still 117.4MB. Free memory is still 75.2MB. There was no memory consumed. Max. memory is 16.1GB. * CACSL2BoogieTranslator took 408.84ms. Allocated memory is still 117.4MB. Free memory was 90.9MB in the beginning and 73.3MB in the end (delta: 17.5MB). Peak memory consumption was 16.8MB. Max. memory is 16.1GB. * Boogie Procedure Inliner took 52.94ms. Allocated memory is still 117.4MB. Free memory was 73.3MB in the beginning and 71.4MB in the end (delta: 1.9MB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. * Boogie Preprocessor took 35.06ms. Allocated memory is still 117.4MB. Free memory was 71.4MB in the beginning and 68.9MB in the end (delta: 2.5MB). There was no memory consumed. Max. memory is 16.1GB. * RCFGBuilder took 1048.92ms. Allocated memory is still 117.4MB. Free memory was 68.6MB in the beginning and 86.4MB in the end (delta: -17.8MB). Peak memory consumption was 38.9MB. Max. memory is 16.1GB. * TraceAbstraction took 807336.40ms. Allocated memory was 117.4MB in the beginning and 503.3MB in the end (delta: 385.9MB). Free memory was 85.9MB in the beginning and 173.9MB in the end (delta: -88.0MB). Peak memory consumption was 295.5MB. Max. memory is 16.1GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - ExceptionOrErrorResult: SMTLIBException: External (MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_2088ea77-1acf-4d0c-88ef-23be095c4621/bin/utaipan-verify-sOmjnqqW8E/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (1) with exit command (exit)) Connection to SMT solver broken de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: SMTLIBException: External (MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_2088ea77-1acf-4d0c-88ef-23be095c4621/bin/utaipan-verify-sOmjnqqW8E/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (1) with exit command (exit)) Connection to SMT solver broken: de.uni_freiburg.informatik.ultimate.smtsolver.external.Executor.convertIOException(Executor.java:337) RESULT: Ultimate could not prove your program: Toolchain returned no result. Received shutdown request... --- End real Ultimate output --- Execution finished normally Using bit-precise analysis Retrying with bit-precise analysis ### Bit-precise run ### Calling Ultimate with: /usr/bin/java -Dosgi.configuration.area=/tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_2088ea77-1acf-4d0c-88ef-23be095c4621/bin/utaipan-verify-sOmjnqqW8E/data/config -Xmx15G -Xms4m -jar /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_2088ea77-1acf-4d0c-88ef-23be095c4621/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_2088ea77-1acf-4d0c-88ef-23be095c4621/bin/utaipan-verify-sOmjnqqW8E/data -tc /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_2088ea77-1acf-4d0c-88ef-23be095c4621/bin/utaipan-verify-sOmjnqqW8E/config/TaipanMemDerefMemtrack.xml -i ../../sv-benchmarks/c/forester-heap/sll-sorted-2.i -s /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_2088ea77-1acf-4d0c-88ef-23be095c4621/bin/utaipan-verify-sOmjnqqW8E/config/svcomp-DerefFreeMemtrack-32bit-Taipan_Bitvector.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_2088ea77-1acf-4d0c-88ef-23be095c4621/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 618946a6e113450d0f3efa55a455801e1c2225c3ba6f88e87a9e8ad02019b85f --- Real Ultimate output --- This is Ultimate 0.3.0-dev-826ab2b [2024-11-14 04:09:40,003 INFO L188 SettingsManager]: Resetting all preferences to default values... [2024-11-14 04:09:40,099 INFO L114 SettingsManager]: Loading settings from /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_2088ea77-1acf-4d0c-88ef-23be095c4621/bin/utaipan-verify-sOmjnqqW8E/config/svcomp-DerefFreeMemtrack-32bit-Taipan_Bitvector.epf [2024-11-14 04:09:40,105 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2024-11-14 04:09:40,110 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2024-11-14 04:09:40,148 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2024-11-14 04:09:40,149 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2024-11-14 04:09:40,152 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2024-11-14 04:09:40,153 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2024-11-14 04:09:40,153 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2024-11-14 04:09:40,153 INFO L153 SettingsManager]: * User list type=DISABLED [2024-11-14 04:09:40,153 INFO L151 SettingsManager]: Preferences of Abstract Interpretation differ from their defaults: [2024-11-14 04:09:40,153 INFO L153 SettingsManager]: * Explicit value domain=true [2024-11-14 04:09:40,153 INFO L153 SettingsManager]: * Octagon Domain=false [2024-11-14 04:09:40,153 INFO L153 SettingsManager]: * Abstract domain=CompoundDomain [2024-11-14 04:09:40,153 INFO L153 SettingsManager]: * Interval Domain=false [2024-11-14 04:09:40,154 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2024-11-14 04:09:40,154 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2024-11-14 04:09:40,154 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2024-11-14 04:09:40,154 INFO L153 SettingsManager]: * sizeof long=4 [2024-11-14 04:09:40,154 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2024-11-14 04:09:40,154 INFO L153 SettingsManager]: * sizeof POINTER=4 [2024-11-14 04:09:40,154 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2024-11-14 04:09:40,154 INFO L153 SettingsManager]: * Check for the main procedure if all allocated memory was freed=true [2024-11-14 04:09:40,154 INFO L153 SettingsManager]: * Bitprecise bitfields=true [2024-11-14 04:09:40,155 INFO L153 SettingsManager]: * SV-COMP memtrack compatibility mode=true [2024-11-14 04:09:40,155 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2024-11-14 04:09:40,155 INFO L153 SettingsManager]: * Adapt memory model on pointer casts if necessary=true [2024-11-14 04:09:40,155 INFO L153 SettingsManager]: * Use bitvectors instead of ints=true [2024-11-14 04:09:40,155 INFO L153 SettingsManager]: * Allow undefined functions=false [2024-11-14 04:09:40,155 INFO L153 SettingsManager]: * Memory model=HoenickeLindenmann_4ByteResolution [2024-11-14 04:09:40,155 INFO L153 SettingsManager]: * Check unreachability of reach_error function=false [2024-11-14 04:09:40,155 INFO L153 SettingsManager]: * sizeof long double=12 [2024-11-14 04:09:40,155 INFO L153 SettingsManager]: * Use constant arrays=true [2024-11-14 04:09:40,155 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2024-11-14 04:09:40,156 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2024-11-14 04:09:40,156 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2024-11-14 04:09:40,156 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2024-11-14 04:09:40,156 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2024-11-14 04:09:40,156 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2024-11-14 04:09:40,158 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2024-11-14 04:09:40,159 INFO L153 SettingsManager]: * Trace refinement strategy=WALRUS [2024-11-14 04:09:40,159 INFO L153 SettingsManager]: * Command for external solver=cvc4 --incremental --print-success --lang smt [2024-11-14 04:09:40,159 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2024-11-14 04:09:40,159 INFO L153 SettingsManager]: * Trace refinement exception blacklist=NONE [2024-11-14 04:09:40,159 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode 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_2088ea77-1acf-4d0c-88ef-23be095c4621/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 -> 618946a6e113450d0f3efa55a455801e1c2225c3ba6f88e87a9e8ad02019b85f [2024-11-14 04:09:40,475 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2024-11-14 04:09:40,484 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2024-11-14 04:09:40,488 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2024-11-14 04:09:40,489 INFO L270 PluginConnector]: Initializing CDTParser... [2024-11-14 04:09:40,490 INFO L274 PluginConnector]: CDTParser initialized [2024-11-14 04:09:40,491 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_2088ea77-1acf-4d0c-88ef-23be095c4621/bin/utaipan-verify-sOmjnqqW8E/../../sv-benchmarks/c/forester-heap/sll-sorted-2.i Unable to find full path for "g++" [2024-11-14 04:09:42,558 INFO L533 CDTParser]: Created temporary CDT project at NULL [2024-11-14 04:09:42,872 INFO L384 CDTParser]: Found 1 translation units. [2024-11-14 04:09:42,876 INFO L180 CDTParser]: Scanning /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_2088ea77-1acf-4d0c-88ef-23be095c4621/sv-benchmarks/c/forester-heap/sll-sorted-2.i [2024-11-14 04:09:42,895 INFO L427 CDTParser]: About to delete temporary CDT project at /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_2088ea77-1acf-4d0c-88ef-23be095c4621/bin/utaipan-verify-sOmjnqqW8E/data/3b23a15f8/b640ab94d34a410186864e03a7502616/FLAGdd1bd1708 [2024-11-14 04:09:43,121 INFO L435 CDTParser]: Successfully deleted /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_2088ea77-1acf-4d0c-88ef-23be095c4621/bin/utaipan-verify-sOmjnqqW8E/data/3b23a15f8/b640ab94d34a410186864e03a7502616 [2024-11-14 04:09:43,124 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2024-11-14 04:09:43,128 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2024-11-14 04:09:43,130 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2024-11-14 04:09:43,131 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2024-11-14 04:09:43,143 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2024-11-14 04:09:43,144 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 14.11 04:09:43" (1/1) ... [2024-11-14 04:09:43,145 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@5126c070 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.11 04:09:43, skipping insertion in model container [2024-11-14 04:09:43,145 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 14.11 04:09:43" (1/1) ... [2024-11-14 04:09:43,197 INFO L175 MainTranslator]: Built tables and reachable declarations [2024-11-14 04:09:43,536 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-11-14 04:09:43,553 INFO L200 MainTranslator]: Completed pre-run [2024-11-14 04:09:43,616 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-11-14 04:09:43,657 INFO L204 MainTranslator]: Completed translation [2024-11-14 04:09:43,657 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.11 04:09:43 WrapperNode [2024-11-14 04:09:43,658 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2024-11-14 04:09:43,659 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2024-11-14 04:09:43,659 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2024-11-14 04:09:43,659 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2024-11-14 04:09:43,668 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.11 04:09:43" (1/1) ... [2024-11-14 04:09:43,693 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.11 04:09:43" (1/1) ... [2024-11-14 04:09:43,730 INFO L138 Inliner]: procedures = 122, calls = 47, calls flagged for inlining = 2, calls inlined = 2, statements flattened = 186 [2024-11-14 04:09:43,732 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2024-11-14 04:09:43,733 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2024-11-14 04:09:43,733 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2024-11-14 04:09:43,733 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2024-11-14 04:09:43,740 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.11 04:09:43" (1/1) ... [2024-11-14 04:09:43,741 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.11 04:09:43" (1/1) ... [2024-11-14 04:09:43,748 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.11 04:09:43" (1/1) ... [2024-11-14 04:09:43,748 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.11 04:09:43" (1/1) ... [2024-11-14 04:09:43,768 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.11 04:09:43" (1/1) ... [2024-11-14 04:09:43,777 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.11 04:09:43" (1/1) ... [2024-11-14 04:09:43,779 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.11 04:09:43" (1/1) ... [2024-11-14 04:09:43,783 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.11 04:09:43" (1/1) ... [2024-11-14 04:09:43,786 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2024-11-14 04:09:43,791 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2024-11-14 04:09:43,791 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2024-11-14 04:09:43,792 INFO L274 PluginConnector]: RCFGBuilder initialized [2024-11-14 04:09:43,793 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.11 04:09:43" (1/1) ... [2024-11-14 04:09:43,803 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2024-11-14 04:09:43,819 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_2088ea77-1acf-4d0c-88ef-23be095c4621/bin/utaipan-verify-sOmjnqqW8E/z3 [2024-11-14 04:09:43,832 INFO L229 MonitoredProcess]: Starting monitored process 1 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_2088ea77-1acf-4d0c-88ef-23be095c4621/bin/utaipan-verify-sOmjnqqW8E/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (exit command is (exit), workingDir is null) [2024-11-14 04:09:43,840 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_2088ea77-1acf-4d0c-88ef-23be095c4621/bin/utaipan-verify-sOmjnqqW8E/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (1)] Waiting until timeout for monitored process [2024-11-14 04:09:43,864 INFO L130 BoogieDeclarations]: Found specification of procedure reach_error [2024-11-14 04:09:43,865 INFO L138 BoogieDeclarations]: Found implementation of procedure reach_error [2024-11-14 04:09:43,865 INFO L130 BoogieDeclarations]: Found specification of procedure read~intINTTYPE4 [2024-11-14 04:09:43,865 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnHeap [2024-11-14 04:09:43,866 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2024-11-14 04:09:43,866 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$ [2024-11-14 04:09:43,866 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$ [2024-11-14 04:09:43,866 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2024-11-14 04:09:43,867 INFO L130 BoogieDeclarations]: Found specification of procedure write~intINTTYPE4 [2024-11-14 04:09:43,867 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE1 [2024-11-14 04:09:43,867 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2024-11-14 04:09:43,867 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2024-11-14 04:09:44,033 INFO L238 CfgBuilder]: Building ICFG [2024-11-14 04:09:44,035 INFO L264 CfgBuilder]: Building CFG for each procedure with an implementation [2024-11-14 04:09:44,972 INFO L? ?]: Removed 143 outVars from TransFormulas that were not future-live. [2024-11-14 04:09:44,973 INFO L287 CfgBuilder]: Performing block encoding [2024-11-14 04:09:44,992 INFO L311 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2024-11-14 04:09:44,992 INFO L316 CfgBuilder]: Removed 20 assume(true) statements. [2024-11-14 04:09:44,993 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 14.11 04:09:44 BoogieIcfgContainer [2024-11-14 04:09:44,993 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2024-11-14 04:09:44,997 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2024-11-14 04:09:44,998 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2024-11-14 04:09:45,002 INFO L274 PluginConnector]: TraceAbstraction initialized [2024-11-14 04:09:45,003 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 14.11 04:09:43" (1/3) ... [2024-11-14 04:09:45,003 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@faa8510 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 14.11 04:09:45, skipping insertion in model container [2024-11-14 04:09:45,003 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.11 04:09:43" (2/3) ... [2024-11-14 04:09:45,004 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@faa8510 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 14.11 04:09:45, skipping insertion in model container [2024-11-14 04:09:45,005 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 14.11 04:09:44" (3/3) ... [2024-11-14 04:09:45,006 INFO L112 eAbstractionObserver]: Analyzing ICFG sll-sorted-2.i [2024-11-14 04:09:45,022 INFO L217 ceAbstractionStarter]: Automizer settings: Hoare:None NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2024-11-14 04:09:45,025 INFO L154 ceAbstractionStarter]: Applying trace abstraction to ICFG sll-sorted-2.i that has 2 procedures, 171 locations, 1 initial locations, 13 loop locations, and 65 error locations. [2024-11-14 04:09:45,066 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2024-11-14 04:09:45,077 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;@3bfa3476, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2024-11-14 04:09:45,078 INFO L334 AbstractCegarLoop]: Starting to check reachability of 65 error locations. [2024-11-14 04:09:45,081 INFO L276 IsEmpty]: Start isEmpty. Operand has 171 states, 97 states have (on average 2.082474226804124) internal successors, (202), 162 states have internal predecessors, (202), 7 states have call successors, (7), 1 states have call predecessors, (7), 1 states have return successors, (7), 7 states have call predecessors, (7), 7 states have call successors, (7) [2024-11-14 04:09:45,086 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 4 [2024-11-14 04:09:45,087 INFO L207 NwaCegarLoop]: Found error trace [2024-11-14 04:09:45,087 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1] [2024-11-14 04:09:45,087 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [reach_errorErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 62 more)] === [2024-11-14 04:09:45,092 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-14 04:09:45,092 INFO L85 PathProgramCache]: Analyzing trace with hash 38794, now seen corresponding path program 1 times [2024-11-14 04:09:45,099 INFO L118 FreeRefinementEngine]: Executing refinement strategy WALRUS [2024-11-14 04:09:45,099 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [205570159] [2024-11-14 04:09:45,100 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-14 04:09:45,100 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-11-14 04:09:45,100 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_2088ea77-1acf-4d0c-88ef-23be095c4621/bin/utaipan-verify-sOmjnqqW8E/mathsat [2024-11-14 04:09:45,103 INFO L229 MonitoredProcess]: Starting monitored process 2 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_2088ea77-1acf-4d0c-88ef-23be095c4621/bin/utaipan-verify-sOmjnqqW8E/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2024-11-14 04:09:45,105 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_2088ea77-1acf-4d0c-88ef-23be095c4621/bin/utaipan-verify-sOmjnqqW8E/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (2)] Waiting until timeout for monitored process [2024-11-14 04:09:45,188 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-14 04:09:45,190 INFO L255 TraceCheckSpWp]: Trace formula consists of 21 conjuncts, 3 conjuncts are in the unsatisfiable core [2024-11-14 04:09:45,195 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-14 04:09:45,294 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 7 [2024-11-14 04:09:45,331 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-14 04:09:45,331 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-11-14 04:09:45,332 INFO L136 FreeRefinementEngine]: Strategy WALRUS found an infeasible trace [2024-11-14 04:09:45,332 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [205570159] [2024-11-14 04:09:45,332 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [205570159] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-14 04:09:45,332 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-14 04:09:45,333 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-11-14 04:09:45,336 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1079413040] [2024-11-14 04:09:45,337 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-14 04:09:45,341 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-14 04:09:45,342 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WALRUS [2024-11-14 04:09:45,368 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-14 04:09:45,368 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-14 04:09:45,372 INFO L87 Difference]: Start difference. First operand has 171 states, 97 states have (on average 2.082474226804124) internal successors, (202), 162 states have internal predecessors, (202), 7 states have call successors, (7), 1 states have call predecessors, (7), 1 states have return successors, (7), 7 states have call predecessors, (7), 7 states have call successors, (7) Second operand has 3 states, 2 states have (on average 1.5) 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-14 04:09:45,708 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-14 04:09:45,708 INFO L93 Difference]: Finished difference Result 160 states and 177 transitions. [2024-11-14 04:09:45,709 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-14 04:09:45,711 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 2 states have (on average 1.5) 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-14 04:09:45,711 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-14 04:09:45,718 INFO L225 Difference]: With dead ends: 160 [2024-11-14 04:09:45,718 INFO L226 Difference]: Without dead ends: 158 [2024-11-14 04:09:45,720 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-14 04:09:45,723 INFO L432 NwaCegarLoop]: 113 mSDtfsCounter, 145 mSDsluCounter, 9 mSDsCounter, 0 mSdLazyCounter, 84 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 145 SdHoareTripleChecker+Valid, 122 SdHoareTripleChecker+Invalid, 87 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 84 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2024-11-14 04:09:45,724 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [145 Valid, 122 Invalid, 87 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 84 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2024-11-14 04:09:45,738 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 158 states. [2024-11-14 04:09:45,759 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 158 to 158. [2024-11-14 04:09:45,760 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 158 states, 88 states have (on average 1.9090909090909092) internal successors, (168), 156 states have internal predecessors, (168), 7 states have call successors, (7), 1 states have call predecessors, (7), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-14 04:09:45,765 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 158 states to 158 states and 175 transitions. [2024-11-14 04:09:45,767 INFO L78 Accepts]: Start accepts. Automaton has 158 states and 175 transitions. Word has length 3 [2024-11-14 04:09:45,767 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-14 04:09:45,767 INFO L471 AbstractCegarLoop]: Abstraction has 158 states and 175 transitions. [2024-11-14 04:09:45,767 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 2 states have (on average 1.5) 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-14 04:09:45,768 INFO L276 IsEmpty]: Start isEmpty. Operand 158 states and 175 transitions. [2024-11-14 04:09:45,768 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 4 [2024-11-14 04:09:45,768 INFO L207 NwaCegarLoop]: Found error trace [2024-11-14 04:09:45,768 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1] [2024-11-14 04:09:45,771 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_2088ea77-1acf-4d0c-88ef-23be095c4621/bin/utaipan-verify-sOmjnqqW8E/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (2)] Ended with exit code 0 [2024-11-14 04:09:45,970 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 2 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_2088ea77-1acf-4d0c-88ef-23be095c4621/bin/utaipan-verify-sOmjnqqW8E/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-11-14 04:09:45,970 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [reach_errorErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 62 more)] === [2024-11-14 04:09:45,971 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-14 04:09:45,971 INFO L85 PathProgramCache]: Analyzing trace with hash 38795, now seen corresponding path program 1 times [2024-11-14 04:09:45,972 INFO L118 FreeRefinementEngine]: Executing refinement strategy WALRUS [2024-11-14 04:09:45,972 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1296922695] [2024-11-14 04:09:45,972 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-14 04:09:45,972 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-11-14 04:09:45,972 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_2088ea77-1acf-4d0c-88ef-23be095c4621/bin/utaipan-verify-sOmjnqqW8E/mathsat [2024-11-14 04:09:45,974 INFO L229 MonitoredProcess]: Starting monitored process 3 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_2088ea77-1acf-4d0c-88ef-23be095c4621/bin/utaipan-verify-sOmjnqqW8E/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2024-11-14 04:09:45,975 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_2088ea77-1acf-4d0c-88ef-23be095c4621/bin/utaipan-verify-sOmjnqqW8E/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (3)] Waiting until timeout for monitored process [2024-11-14 04:09:46,032 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-14 04:09:46,034 INFO L255 TraceCheckSpWp]: Trace formula consists of 21 conjuncts, 4 conjuncts are in the unsatisfiable core [2024-11-14 04:09:46,037 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-14 04:09:46,049 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-14 04:09:46,066 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-14 04:09:46,066 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-11-14 04:09:46,067 INFO L136 FreeRefinementEngine]: Strategy WALRUS found an infeasible trace [2024-11-14 04:09:46,067 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1296922695] [2024-11-14 04:09:46,067 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1296922695] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-14 04:09:46,067 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-14 04:09:46,068 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-11-14 04:09:46,068 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [478817853] [2024-11-14 04:09:46,068 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-14 04:09:46,069 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-14 04:09:46,069 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WALRUS [2024-11-14 04:09:46,069 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-14 04:09:46,069 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-14 04:09:46,069 INFO L87 Difference]: Start difference. First operand 158 states and 175 transitions. Second operand has 3 states, 2 states have (on average 1.5) 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-14 04:09:46,465 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-14 04:09:46,466 INFO L93 Difference]: Finished difference Result 156 states and 173 transitions. [2024-11-14 04:09:46,466 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-14 04:09:46,467 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 2 states have (on average 1.5) 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-14 04:09:46,467 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-14 04:09:46,468 INFO L225 Difference]: With dead ends: 156 [2024-11-14 04:09:46,468 INFO L226 Difference]: Without dead ends: 156 [2024-11-14 04:09:46,468 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-14 04:09:46,469 INFO L432 NwaCegarLoop]: 111 mSDtfsCounter, 145 mSDsluCounter, 7 mSDsCounter, 0 mSdLazyCounter, 80 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 145 SdHoareTripleChecker+Valid, 118 SdHoareTripleChecker+Invalid, 83 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 80 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2024-11-14 04:09:46,469 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [145 Valid, 118 Invalid, 83 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 80 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time] [2024-11-14 04:09:46,470 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 156 states. [2024-11-14 04:09:46,476 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 156 to 156. [2024-11-14 04:09:46,476 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 156 states, 88 states have (on average 1.8863636363636365) internal successors, (166), 154 states have internal predecessors, (166), 7 states have call successors, (7), 1 states have call predecessors, (7), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-14 04:09:46,478 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 156 states to 156 states and 173 transitions. [2024-11-14 04:09:46,478 INFO L78 Accepts]: Start accepts. Automaton has 156 states and 173 transitions. Word has length 3 [2024-11-14 04:09:46,478 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-14 04:09:46,479 INFO L471 AbstractCegarLoop]: Abstraction has 156 states and 173 transitions. [2024-11-14 04:09:46,479 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 2 states have (on average 1.5) 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-14 04:09:46,479 INFO L276 IsEmpty]: Start isEmpty. Operand 156 states and 173 transitions. [2024-11-14 04:09:46,479 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 9 [2024-11-14 04:09:46,479 INFO L207 NwaCegarLoop]: Found error trace [2024-11-14 04:09:46,479 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1] [2024-11-14 04:09:46,482 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_2088ea77-1acf-4d0c-88ef-23be095c4621/bin/utaipan-verify-sOmjnqqW8E/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (3)] Forceful destruction successful, exit code 0 [2024-11-14 04:09:46,680 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 3 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_2088ea77-1acf-4d0c-88ef-23be095c4621/bin/utaipan-verify-sOmjnqqW8E/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-11-14 04:09:46,680 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr4REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [reach_errorErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 62 more)] === [2024-11-14 04:09:46,681 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-14 04:09:46,681 INFO L85 PathProgramCache]: Analyzing trace with hash -1771463860, now seen corresponding path program 1 times [2024-11-14 04:09:46,681 INFO L118 FreeRefinementEngine]: Executing refinement strategy WALRUS [2024-11-14 04:09:46,681 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1190498911] [2024-11-14 04:09:46,681 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-14 04:09:46,681 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-11-14 04:09:46,682 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_2088ea77-1acf-4d0c-88ef-23be095c4621/bin/utaipan-verify-sOmjnqqW8E/mathsat [2024-11-14 04:09:46,688 INFO L229 MonitoredProcess]: Starting monitored process 4 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_2088ea77-1acf-4d0c-88ef-23be095c4621/bin/utaipan-verify-sOmjnqqW8E/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2024-11-14 04:09:46,689 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_2088ea77-1acf-4d0c-88ef-23be095c4621/bin/utaipan-verify-sOmjnqqW8E/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (4)] Waiting until timeout for monitored process [2024-11-14 04:09:46,765 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-14 04:09:46,767 INFO L255 TraceCheckSpWp]: Trace formula consists of 60 conjuncts, 6 conjuncts are in the unsatisfiable core [2024-11-14 04:09:46,769 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-14 04:09:46,781 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 7 [2024-11-14 04:09:46,867 INFO L349 Elim1Store]: treesize reduction 17, result has 29.2 percent of original size [2024-11-14 04:09:46,867 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 14 treesize of output 20 [2024-11-14 04:09:46,896 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-14 04:09:46,897 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-11-14 04:09:46,897 INFO L136 FreeRefinementEngine]: Strategy WALRUS found an infeasible trace [2024-11-14 04:09:46,900 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1190498911] [2024-11-14 04:09:46,900 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1190498911] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-14 04:09:46,900 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-14 04:09:46,900 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-11-14 04:09:46,901 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [836340526] [2024-11-14 04:09:46,901 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-14 04:09:46,901 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-11-14 04:09:46,901 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WALRUS [2024-11-14 04:09:46,902 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-11-14 04:09:46,902 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-11-14 04:09:46,902 INFO L87 Difference]: Start difference. First operand 156 states and 173 transitions. Second operand has 4 states, 3 states have (on average 2.6666666666666665) internal successors, (8), 4 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-14 04:09:47,463 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-14 04:09:47,463 INFO L93 Difference]: Finished difference Result 155 states and 181 transitions. [2024-11-14 04:09:47,463 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-11-14 04:09:47,463 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 3 states have (on average 2.6666666666666665) internal successors, (8), 4 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-14 04:09:47,464 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-14 04:09:47,464 INFO L225 Difference]: With dead ends: 155 [2024-11-14 04:09:47,465 INFO L226 Difference]: Without dead ends: 155 [2024-11-14 04:09:47,465 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 4 SyntacticMatches, 1 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2024-11-14 04:09:47,466 INFO L432 NwaCegarLoop]: 78 mSDtfsCounter, 226 mSDsluCounter, 16 mSDsCounter, 0 mSdLazyCounter, 162 mSolverCounterSat, 35 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 226 SdHoareTripleChecker+Valid, 94 SdHoareTripleChecker+Invalid, 197 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 35 IncrementalHoareTripleChecker+Valid, 162 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.5s IncrementalHoareTripleChecker+Time [2024-11-14 04:09:47,466 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [226 Valid, 94 Invalid, 197 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [35 Valid, 162 Invalid, 0 Unknown, 0 Unchecked, 0.5s Time] [2024-11-14 04:09:47,467 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 155 states. [2024-11-14 04:09:47,473 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 155 to 153. [2024-11-14 04:09:47,474 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 153 states, 102 states have (on average 1.7058823529411764) internal successors, (174), 151 states have internal predecessors, (174), 7 states have call successors, (7), 1 states have call predecessors, (7), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-14 04:09:47,475 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 153 states to 153 states and 181 transitions. [2024-11-14 04:09:47,475 INFO L78 Accepts]: Start accepts. Automaton has 153 states and 181 transitions. Word has length 8 [2024-11-14 04:09:47,476 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-14 04:09:47,476 INFO L471 AbstractCegarLoop]: Abstraction has 153 states and 181 transitions. [2024-11-14 04:09:47,476 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 3 states have (on average 2.6666666666666665) internal successors, (8), 4 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-14 04:09:47,476 INFO L276 IsEmpty]: Start isEmpty. Operand 153 states and 181 transitions. [2024-11-14 04:09:47,476 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 9 [2024-11-14 04:09:47,476 INFO L207 NwaCegarLoop]: Found error trace [2024-11-14 04:09:47,477 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1] [2024-11-14 04:09:47,480 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_2088ea77-1acf-4d0c-88ef-23be095c4621/bin/utaipan-verify-sOmjnqqW8E/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (4)] Forceful destruction successful, exit code 0 [2024-11-14 04:09:47,678 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 4 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_2088ea77-1acf-4d0c-88ef-23be095c4621/bin/utaipan-verify-sOmjnqqW8E/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-11-14 04:09:47,679 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr5REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [reach_errorErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 62 more)] === [2024-11-14 04:09:47,679 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-14 04:09:47,679 INFO L85 PathProgramCache]: Analyzing trace with hash -1771463859, now seen corresponding path program 1 times [2024-11-14 04:09:47,680 INFO L118 FreeRefinementEngine]: Executing refinement strategy WALRUS [2024-11-14 04:09:47,680 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [868514575] [2024-11-14 04:09:47,680 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-14 04:09:47,680 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-11-14 04:09:47,680 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_2088ea77-1acf-4d0c-88ef-23be095c4621/bin/utaipan-verify-sOmjnqqW8E/mathsat [2024-11-14 04:09:47,684 INFO L229 MonitoredProcess]: Starting monitored process 5 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_2088ea77-1acf-4d0c-88ef-23be095c4621/bin/utaipan-verify-sOmjnqqW8E/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2024-11-14 04:09:47,685 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_2088ea77-1acf-4d0c-88ef-23be095c4621/bin/utaipan-verify-sOmjnqqW8E/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (5)] Waiting until timeout for monitored process [2024-11-14 04:09:47,778 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-14 04:09:47,782 INFO L255 TraceCheckSpWp]: Trace formula consists of 60 conjuncts, 8 conjuncts are in the unsatisfiable core [2024-11-14 04:09:47,784 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-14 04:09:47,795 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-14 04:09:47,912 INFO L349 Elim1Store]: treesize reduction 15, result has 25.0 percent of original size [2024-11-14 04:09:47,913 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 12 treesize of output 14 [2024-11-14 04:09:47,934 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-14 04:09:47,934 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-11-14 04:09:47,934 INFO L136 FreeRefinementEngine]: Strategy WALRUS found an infeasible trace [2024-11-14 04:09:47,935 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [868514575] [2024-11-14 04:09:47,935 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [868514575] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-14 04:09:47,935 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-14 04:09:47,935 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-11-14 04:09:47,935 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1326162614] [2024-11-14 04:09:47,935 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-14 04:09:47,935 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-11-14 04:09:47,936 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WALRUS [2024-11-14 04:09:47,936 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-11-14 04:09:47,936 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-11-14 04:09:47,936 INFO L87 Difference]: Start difference. First operand 153 states and 181 transitions. Second operand has 4 states, 3 states have (on average 2.6666666666666665) internal successors, (8), 4 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-14 04:09:48,671 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-14 04:09:48,672 INFO L93 Difference]: Finished difference Result 216 states and 253 transitions. [2024-11-14 04:09:48,673 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-11-14 04:09:48,674 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 3 states have (on average 2.6666666666666665) internal successors, (8), 4 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-14 04:09:48,674 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-14 04:09:48,676 INFO L225 Difference]: With dead ends: 216 [2024-11-14 04:09:48,676 INFO L226 Difference]: Without dead ends: 216 [2024-11-14 04:09:48,676 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 4 SyntacticMatches, 1 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2024-11-14 04:09:48,677 INFO L432 NwaCegarLoop]: 85 mSDtfsCounter, 271 mSDsluCounter, 66 mSDsCounter, 0 mSdLazyCounter, 178 mSolverCounterSat, 30 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.6s Time, 0 mProtectedPredicate, 0 mProtectedAction, 271 SdHoareTripleChecker+Valid, 151 SdHoareTripleChecker+Invalid, 208 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 30 IncrementalHoareTripleChecker+Valid, 178 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.7s IncrementalHoareTripleChecker+Time [2024-11-14 04:09:48,677 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [271 Valid, 151 Invalid, 208 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [30 Valid, 178 Invalid, 0 Unknown, 0 Unchecked, 0.7s Time] [2024-11-14 04:09:48,678 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 216 states. [2024-11-14 04:09:48,693 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 216 to 202. [2024-11-14 04:09:48,693 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 202 states, 151 states have (on average 1.5894039735099337) internal successors, (240), 200 states have internal predecessors, (240), 7 states have call successors, (7), 1 states have call predecessors, (7), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-14 04:09:48,697 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 202 states to 202 states and 247 transitions. [2024-11-14 04:09:48,697 INFO L78 Accepts]: Start accepts. Automaton has 202 states and 247 transitions. Word has length 8 [2024-11-14 04:09:48,697 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-14 04:09:48,697 INFO L471 AbstractCegarLoop]: Abstraction has 202 states and 247 transitions. [2024-11-14 04:09:48,698 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 3 states have (on average 2.6666666666666665) internal successors, (8), 4 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-14 04:09:48,698 INFO L276 IsEmpty]: Start isEmpty. Operand 202 states and 247 transitions. [2024-11-14 04:09:48,698 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 13 [2024-11-14 04:09:48,698 INFO L207 NwaCegarLoop]: Found error trace [2024-11-14 04:09:48,698 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-14 04:09:48,701 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_2088ea77-1acf-4d0c-88ef-23be095c4621/bin/utaipan-verify-sOmjnqqW8E/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (5)] Forceful destruction successful, exit code 0 [2024-11-14 04:09:48,899 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 5 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_2088ea77-1acf-4d0c-88ef-23be095c4621/bin/utaipan-verify-sOmjnqqW8E/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-11-14 04:09:48,899 INFO L396 AbstractCegarLoop]: === Iteration 5 === Targeting reach_errorErr0ASSERT_VIOLATIONMEMORY_LEAK === [reach_errorErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 62 more)] === [2024-11-14 04:09:48,899 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-14 04:09:48,900 INFO L85 PathProgramCache]: Analyzing trace with hash -992997132, now seen corresponding path program 1 times [2024-11-14 04:09:48,900 INFO L118 FreeRefinementEngine]: Executing refinement strategy WALRUS [2024-11-14 04:09:48,900 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [539562019] [2024-11-14 04:09:48,900 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-14 04:09:48,900 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-11-14 04:09:48,900 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_2088ea77-1acf-4d0c-88ef-23be095c4621/bin/utaipan-verify-sOmjnqqW8E/mathsat [2024-11-14 04:09:48,902 INFO L229 MonitoredProcess]: Starting monitored process 6 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_2088ea77-1acf-4d0c-88ef-23be095c4621/bin/utaipan-verify-sOmjnqqW8E/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2024-11-14 04:09:48,903 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_2088ea77-1acf-4d0c-88ef-23be095c4621/bin/utaipan-verify-sOmjnqqW8E/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (6)] Waiting until timeout for monitored process [2024-11-14 04:09:48,966 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-14 04:09:48,968 INFO L255 TraceCheckSpWp]: Trace formula consists of 61 conjuncts, 2 conjuncts are in the unsatisfiable core [2024-11-14 04:09:48,969 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-14 04:09:48,987 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-14 04:09:48,987 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-11-14 04:09:48,987 INFO L136 FreeRefinementEngine]: Strategy WALRUS found an infeasible trace [2024-11-14 04:09:48,987 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [539562019] [2024-11-14 04:09:48,987 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [539562019] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-14 04:09:48,987 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-14 04:09:48,987 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-11-14 04:09:48,988 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1984533797] [2024-11-14 04:09:48,988 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-14 04:09:48,988 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-14 04:09:48,988 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WALRUS [2024-11-14 04:09:48,989 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-14 04:09:48,989 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-14 04:09:48,989 INFO L87 Difference]: Start difference. First operand 202 states and 247 transitions. Second operand has 3 states, 3 states have (on average 3.6666666666666665) internal successors, (11), 3 states have internal predecessors, (11), 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-14 04:09:49,023 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-14 04:09:49,023 INFO L93 Difference]: Finished difference Result 242 states and 290 transitions. [2024-11-14 04:09:49,023 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-14 04:09:49,024 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 3.6666666666666665) internal successors, (11), 3 states have internal predecessors, (11), 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 12 [2024-11-14 04:09:49,024 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-14 04:09:49,025 INFO L225 Difference]: With dead ends: 242 [2024-11-14 04:09:49,025 INFO L226 Difference]: Without dead ends: 242 [2024-11-14 04:09:49,025 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 11 GetRequests, 10 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-14 04:09:49,026 INFO L432 NwaCegarLoop]: 187 mSDtfsCounter, 50 mSDsluCounter, 133 mSDsCounter, 0 mSdLazyCounter, 14 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 50 SdHoareTripleChecker+Valid, 320 SdHoareTripleChecker+Invalid, 17 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 14 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-11-14 04:09:49,026 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [50 Valid, 320 Invalid, 17 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 14 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-11-14 04:09:49,030 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 242 states. [2024-11-14 04:09:49,040 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 242 to 212. [2024-11-14 04:09:49,041 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 212 states, 161 states have (on average 1.5776397515527951) internal successors, (254), 210 states have internal predecessors, (254), 7 states have call successors, (7), 1 states have call predecessors, (7), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-14 04:09:49,048 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 212 states to 212 states and 261 transitions. [2024-11-14 04:09:49,049 INFO L78 Accepts]: Start accepts. Automaton has 212 states and 261 transitions. Word has length 12 [2024-11-14 04:09:49,049 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-14 04:09:49,049 INFO L471 AbstractCegarLoop]: Abstraction has 212 states and 261 transitions. [2024-11-14 04:09:49,049 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 3.6666666666666665) internal successors, (11), 3 states have internal predecessors, (11), 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-14 04:09:49,049 INFO L276 IsEmpty]: Start isEmpty. Operand 212 states and 261 transitions. [2024-11-14 04:09:49,050 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 13 [2024-11-14 04:09:49,050 INFO L207 NwaCegarLoop]: Found error trace [2024-11-14 04:09:49,050 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-14 04:09:49,055 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_2088ea77-1acf-4d0c-88ef-23be095c4621/bin/utaipan-verify-sOmjnqqW8E/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (6)] Forceful destruction successful, exit code 0 [2024-11-14 04:09:49,250 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 6 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_2088ea77-1acf-4d0c-88ef-23be095c4621/bin/utaipan-verify-sOmjnqqW8E/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-11-14 04:09:49,251 INFO L396 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr8REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [reach_errorErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 62 more)] === [2024-11-14 04:09:49,251 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-14 04:09:49,251 INFO L85 PathProgramCache]: Analyzing trace with hash -967601714, now seen corresponding path program 1 times [2024-11-14 04:09:49,252 INFO L118 FreeRefinementEngine]: Executing refinement strategy WALRUS [2024-11-14 04:09:49,252 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [2107572669] [2024-11-14 04:09:49,252 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-14 04:09:49,252 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-11-14 04:09:49,252 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_2088ea77-1acf-4d0c-88ef-23be095c4621/bin/utaipan-verify-sOmjnqqW8E/mathsat [2024-11-14 04:09:49,254 INFO L229 MonitoredProcess]: Starting monitored process 7 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_2088ea77-1acf-4d0c-88ef-23be095c4621/bin/utaipan-verify-sOmjnqqW8E/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2024-11-14 04:09:49,257 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_2088ea77-1acf-4d0c-88ef-23be095c4621/bin/utaipan-verify-sOmjnqqW8E/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (7)] Waiting until timeout for monitored process [2024-11-14 04:09:49,333 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-14 04:09:49,338 INFO L255 TraceCheckSpWp]: Trace formula consists of 82 conjuncts, 8 conjuncts are in the unsatisfiable core [2024-11-14 04:09:49,340 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-14 04:09:49,349 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 7 [2024-11-14 04:09:49,372 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 15 treesize of output 1 [2024-11-14 04:09:49,409 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 19 treesize of output 11 [2024-11-14 04:09:49,432 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-14 04:09:49,432 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-11-14 04:09:49,432 INFO L136 FreeRefinementEngine]: Strategy WALRUS found an infeasible trace [2024-11-14 04:09:49,433 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [2107572669] [2024-11-14 04:09:49,433 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [2107572669] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-14 04:09:49,433 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-14 04:09:49,433 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2024-11-14 04:09:49,433 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1152642903] [2024-11-14 04:09:49,433 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-14 04:09:49,433 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2024-11-14 04:09:49,434 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WALRUS [2024-11-14 04:09:49,434 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2024-11-14 04:09:49,434 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2024-11-14 04:09:49,434 INFO L87 Difference]: Start difference. First operand 212 states and 261 transitions. Second operand has 6 states, 5 states have (on average 2.4) internal successors, (12), 6 states have internal predecessors, (12), 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-14 04:09:50,278 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-14 04:09:50,278 INFO L93 Difference]: Finished difference Result 215 states and 265 transitions. [2024-11-14 04:09:50,279 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2024-11-14 04:09:50,279 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 5 states have (on average 2.4) internal successors, (12), 6 states have internal predecessors, (12), 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 12 [2024-11-14 04:09:50,280 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-14 04:09:50,281 INFO L225 Difference]: With dead ends: 215 [2024-11-14 04:09:50,281 INFO L226 Difference]: Without dead ends: 215 [2024-11-14 04:09:50,281 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 13 GetRequests, 7 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=17, Invalid=39, Unknown=0, NotChecked=0, Total=56 [2024-11-14 04:09:50,282 INFO L432 NwaCegarLoop]: 112 mSDtfsCounter, 69 mSDsluCounter, 249 mSDsCounter, 0 mSdLazyCounter, 382 mSolverCounterSat, 8 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.7s Time, 0 mProtectedPredicate, 0 mProtectedAction, 69 SdHoareTripleChecker+Valid, 361 SdHoareTripleChecker+Invalid, 390 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 8 IncrementalHoareTripleChecker+Valid, 382 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.8s IncrementalHoareTripleChecker+Time [2024-11-14 04:09:50,282 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [69 Valid, 361 Invalid, 390 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [8 Valid, 382 Invalid, 0 Unknown, 0 Unchecked, 0.8s Time] [2024-11-14 04:09:50,283 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 215 states. [2024-11-14 04:09:50,287 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 215 to 211. [2024-11-14 04:09:50,288 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 211 states, 161 states have (on average 1.565217391304348) internal successors, (252), 209 states have internal predecessors, (252), 7 states have call successors, (7), 1 states have call predecessors, (7), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-14 04:09:50,289 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 211 states to 211 states and 259 transitions. [2024-11-14 04:09:50,289 INFO L78 Accepts]: Start accepts. Automaton has 211 states and 259 transitions. Word has length 12 [2024-11-14 04:09:50,290 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-14 04:09:50,290 INFO L471 AbstractCegarLoop]: Abstraction has 211 states and 259 transitions. [2024-11-14 04:09:50,290 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 5 states have (on average 2.4) internal successors, (12), 6 states have internal predecessors, (12), 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-14 04:09:50,290 INFO L276 IsEmpty]: Start isEmpty. Operand 211 states and 259 transitions. [2024-11-14 04:09:50,290 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 13 [2024-11-14 04:09:50,290 INFO L207 NwaCegarLoop]: Found error trace [2024-11-14 04:09:50,291 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-14 04:09:50,293 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_2088ea77-1acf-4d0c-88ef-23be095c4621/bin/utaipan-verify-sOmjnqqW8E/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (7)] Ended with exit code 0 [2024-11-14 04:09:50,491 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 7 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_2088ea77-1acf-4d0c-88ef-23be095c4621/bin/utaipan-verify-sOmjnqqW8E/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-11-14 04:09:50,492 INFO L396 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr9REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [reach_errorErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 62 more)] === [2024-11-14 04:09:50,492 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-14 04:09:50,492 INFO L85 PathProgramCache]: Analyzing trace with hash -967601713, now seen corresponding path program 1 times [2024-11-14 04:09:50,493 INFO L118 FreeRefinementEngine]: Executing refinement strategy WALRUS [2024-11-14 04:09:50,493 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [199541851] [2024-11-14 04:09:50,494 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-14 04:09:50,494 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-11-14 04:09:50,494 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_2088ea77-1acf-4d0c-88ef-23be095c4621/bin/utaipan-verify-sOmjnqqW8E/mathsat [2024-11-14 04:09:50,496 INFO L229 MonitoredProcess]: Starting monitored process 8 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_2088ea77-1acf-4d0c-88ef-23be095c4621/bin/utaipan-verify-sOmjnqqW8E/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2024-11-14 04:09:50,498 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_2088ea77-1acf-4d0c-88ef-23be095c4621/bin/utaipan-verify-sOmjnqqW8E/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (8)] Waiting until timeout for monitored process [2024-11-14 04:09:50,572 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-14 04:09:50,575 INFO L255 TraceCheckSpWp]: Trace formula consists of 82 conjuncts, 13 conjuncts are in the unsatisfiable core [2024-11-14 04:09:50,577 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-14 04:09:50,587 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-14 04:09:50,611 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 7 [2024-11-14 04:09:50,623 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 15 treesize of output 1 [2024-11-14 04:09:50,668 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 17 treesize of output 9 [2024-11-14 04:09:50,746 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-14 04:09:50,746 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-11-14 04:09:50,746 INFO L136 FreeRefinementEngine]: Strategy WALRUS found an infeasible trace [2024-11-14 04:09:50,746 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [199541851] [2024-11-14 04:09:50,746 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [199541851] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-14 04:09:50,746 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-14 04:09:50,746 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2024-11-14 04:09:50,746 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [881758569] [2024-11-14 04:09:50,746 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-14 04:09:50,747 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2024-11-14 04:09:50,747 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WALRUS [2024-11-14 04:09:50,747 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2024-11-14 04:09:50,747 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2024-11-14 04:09:50,747 INFO L87 Difference]: Start difference. First operand 211 states and 259 transitions. Second operand has 6 states, 5 states have (on average 2.4) internal successors, (12), 6 states have internal predecessors, (12), 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-14 04:09:51,762 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-14 04:09:51,763 INFO L93 Difference]: Finished difference Result 206 states and 251 transitions. [2024-11-14 04:09:51,763 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2024-11-14 04:09:51,764 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 5 states have (on average 2.4) internal successors, (12), 6 states have internal predecessors, (12), 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 12 [2024-11-14 04:09:51,764 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-14 04:09:51,765 INFO L225 Difference]: With dead ends: 206 [2024-11-14 04:09:51,765 INFO L226 Difference]: Without dead ends: 206 [2024-11-14 04:09:51,765 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 13 GetRequests, 7 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=17, Invalid=39, Unknown=0, NotChecked=0, Total=56 [2024-11-14 04:09:51,766 INFO L432 NwaCegarLoop]: 146 mSDtfsCounter, 12 mSDsluCounter, 320 mSDsCounter, 0 mSdLazyCounter, 287 mSolverCounterSat, 5 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.8s Time, 0 mProtectedPredicate, 0 mProtectedAction, 12 SdHoareTripleChecker+Valid, 466 SdHoareTripleChecker+Invalid, 292 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 5 IncrementalHoareTripleChecker+Valid, 287 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.9s IncrementalHoareTripleChecker+Time [2024-11-14 04:09:51,766 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [12 Valid, 466 Invalid, 292 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [5 Valid, 287 Invalid, 0 Unknown, 0 Unchecked, 0.9s Time] [2024-11-14 04:09:51,770 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 206 states. [2024-11-14 04:09:51,777 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 206 to 201. [2024-11-14 04:09:51,778 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 201 states, 156 states have (on average 1.5320512820512822) internal successors, (239), 199 states have internal predecessors, (239), 7 states have call successors, (7), 1 states have call predecessors, (7), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-14 04:09:51,779 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 201 states to 201 states and 246 transitions. [2024-11-14 04:09:51,779 INFO L78 Accepts]: Start accepts. Automaton has 201 states and 246 transitions. Word has length 12 [2024-11-14 04:09:51,780 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-14 04:09:51,780 INFO L471 AbstractCegarLoop]: Abstraction has 201 states and 246 transitions. [2024-11-14 04:09:51,780 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 5 states have (on average 2.4) internal successors, (12), 6 states have internal predecessors, (12), 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-14 04:09:51,780 INFO L276 IsEmpty]: Start isEmpty. Operand 201 states and 246 transitions. [2024-11-14 04:09:51,780 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 24 [2024-11-14 04:09:51,783 INFO L207 NwaCegarLoop]: Found error trace [2024-11-14 04:09:51,783 INFO L215 NwaCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-14 04:09:51,786 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_2088ea77-1acf-4d0c-88ef-23be095c4621/bin/utaipan-verify-sOmjnqqW8E/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (8)] Ended with exit code 0 [2024-11-14 04:09:51,984 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 8 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_2088ea77-1acf-4d0c-88ef-23be095c4621/bin/utaipan-verify-sOmjnqqW8E/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-11-14 04:09:51,985 INFO L396 AbstractCegarLoop]: === Iteration 8 === Targeting reach_errorErr0ASSERT_VIOLATIONMEMORY_LEAK === [reach_errorErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 62 more)] === [2024-11-14 04:09:51,988 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-14 04:09:51,988 INFO L85 PathProgramCache]: Analyzing trace with hash 192742159, now seen corresponding path program 1 times [2024-11-14 04:09:51,988 INFO L118 FreeRefinementEngine]: Executing refinement strategy WALRUS [2024-11-14 04:09:51,989 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1977732455] [2024-11-14 04:09:51,989 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-14 04:09:51,989 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-11-14 04:09:51,989 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_2088ea77-1acf-4d0c-88ef-23be095c4621/bin/utaipan-verify-sOmjnqqW8E/mathsat [2024-11-14 04:09:51,991 INFO L229 MonitoredProcess]: Starting monitored process 9 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_2088ea77-1acf-4d0c-88ef-23be095c4621/bin/utaipan-verify-sOmjnqqW8E/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2024-11-14 04:09:51,993 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_2088ea77-1acf-4d0c-88ef-23be095c4621/bin/utaipan-verify-sOmjnqqW8E/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (9)] Waiting until timeout for monitored process [2024-11-14 04:09:52,092 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-14 04:09:52,096 INFO L255 TraceCheckSpWp]: Trace formula consists of 123 conjuncts, 3 conjuncts are in the unsatisfiable core [2024-11-14 04:09:52,097 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-14 04:09:52,180 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2024-11-14 04:09:52,180 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-11-14 04:09:52,181 INFO L136 FreeRefinementEngine]: Strategy WALRUS found an infeasible trace [2024-11-14 04:09:52,181 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1977732455] [2024-11-14 04:09:52,181 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1977732455] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-14 04:09:52,181 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-14 04:09:52,181 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2024-11-14 04:09:52,181 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [45230759] [2024-11-14 04:09:52,181 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-14 04:09:52,182 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-11-14 04:09:52,182 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WALRUS [2024-11-14 04:09:52,182 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-11-14 04:09:52,182 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-11-14 04:09:52,182 INFO L87 Difference]: Start difference. First operand 201 states and 246 transitions. Second operand has 4 states, 4 states have (on average 5.25) internal successors, (21), 4 states have internal predecessors, (21), 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-14 04:09:52,542 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-14 04:09:52,542 INFO L93 Difference]: Finished difference Result 218 states and 252 transitions. [2024-11-14 04:09:52,543 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-11-14 04:09:52,543 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 5.25) internal successors, (21), 4 states have internal predecessors, (21), 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 23 [2024-11-14 04:09:52,543 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-14 04:09:52,544 INFO L225 Difference]: With dead ends: 218 [2024-11-14 04:09:52,544 INFO L226 Difference]: Without dead ends: 218 [2024-11-14 04:09:52,545 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 23 GetRequests, 20 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-14 04:09:52,545 INFO L432 NwaCegarLoop]: 115 mSDtfsCounter, 250 mSDsluCounter, 93 mSDsCounter, 0 mSdLazyCounter, 105 mSolverCounterSat, 6 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 250 SdHoareTripleChecker+Valid, 208 SdHoareTripleChecker+Invalid, 111 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 6 IncrementalHoareTripleChecker+Valid, 105 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2024-11-14 04:09:52,546 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [250 Valid, 208 Invalid, 111 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [6 Valid, 105 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2024-11-14 04:09:52,546 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 218 states. [2024-11-14 04:09:52,550 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 218 to 200. [2024-11-14 04:09:52,551 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 200 states, 156 states have (on average 1.5128205128205128) internal successors, (236), 198 states have internal predecessors, (236), 6 states have call successors, (6), 1 states have call predecessors, (6), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-14 04:09:52,552 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 200 states to 200 states and 242 transitions. [2024-11-14 04:09:52,552 INFO L78 Accepts]: Start accepts. Automaton has 200 states and 242 transitions. Word has length 23 [2024-11-14 04:09:52,552 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-14 04:09:52,552 INFO L471 AbstractCegarLoop]: Abstraction has 200 states and 242 transitions. [2024-11-14 04:09:52,552 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 5.25) internal successors, (21), 4 states have internal predecessors, (21), 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-14 04:09:52,552 INFO L276 IsEmpty]: Start isEmpty. Operand 200 states and 242 transitions. [2024-11-14 04:09:52,553 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 28 [2024-11-14 04:09:52,553 INFO L207 NwaCegarLoop]: Found error trace [2024-11-14 04:09:52,553 INFO L215 NwaCegarLoop]: trace histogram [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] [2024-11-14 04:09:52,557 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_2088ea77-1acf-4d0c-88ef-23be095c4621/bin/utaipan-verify-sOmjnqqW8E/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (9)] Forceful destruction successful, exit code 0 [2024-11-14 04:09:52,753 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 9 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_2088ea77-1acf-4d0c-88ef-23be095c4621/bin/utaipan-verify-sOmjnqqW8E/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-11-14 04:09:52,753 INFO L396 AbstractCegarLoop]: === Iteration 9 === Targeting ULTIMATE.startErr19REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [reach_errorErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 62 more)] === [2024-11-14 04:09:52,754 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-14 04:09:52,754 INFO L85 PathProgramCache]: Analyzing trace with hash 1904089401, now seen corresponding path program 1 times [2024-11-14 04:09:52,754 INFO L118 FreeRefinementEngine]: Executing refinement strategy WALRUS [2024-11-14 04:09:52,754 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1310260575] [2024-11-14 04:09:52,754 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-14 04:09:52,754 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-11-14 04:09:52,755 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_2088ea77-1acf-4d0c-88ef-23be095c4621/bin/utaipan-verify-sOmjnqqW8E/mathsat [2024-11-14 04:09:52,757 INFO L229 MonitoredProcess]: Starting monitored process 10 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_2088ea77-1acf-4d0c-88ef-23be095c4621/bin/utaipan-verify-sOmjnqqW8E/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2024-11-14 04:09:52,760 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_2088ea77-1acf-4d0c-88ef-23be095c4621/bin/utaipan-verify-sOmjnqqW8E/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (10)] Waiting until timeout for monitored process [2024-11-14 04:09:52,881 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-14 04:09:52,885 INFO L255 TraceCheckSpWp]: Trace formula consists of 134 conjuncts, 25 conjuncts are in the unsatisfiable core [2024-11-14 04:09:52,892 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-14 04:09:52,901 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 7 [2024-11-14 04:09:53,028 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-14 04:09:53,056 INFO L349 Elim1Store]: treesize reduction 6, result has 40.0 percent of original size [2024-11-14 04:09:53,056 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 13 treesize of output 13 [2024-11-14 04:09:53,138 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 7 [2024-11-14 04:09:53,162 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 15 treesize of output 1 [2024-11-14 04:09:53,406 INFO L349 Elim1Store]: treesize reduction 13, result has 40.9 percent of original size [2024-11-14 04:09:53,406 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 1 new quantified variables, introduced 1 case distinctions, treesize of input 16 treesize of output 15 [2024-11-14 04:09:53,445 INFO L349 Elim1Store]: treesize reduction 17, result has 22.7 percent of original size [2024-11-14 04:09:53,446 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 1 new quantified variables, introduced 1 case distinctions, treesize of input 33 treesize of output 24 [2024-11-14 04:09:53,602 INFO L349 Elim1Store]: treesize reduction 19, result has 20.8 percent of original size [2024-11-14 04:09:53,602 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 50 treesize of output 45 [2024-11-14 04:09:53,616 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 24 treesize of output 11 [2024-11-14 04:09:53,891 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 25 treesize of output 13 [2024-11-14 04:09:53,898 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 7 treesize of output 3 [2024-11-14 04:09:53,929 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-14 04:09:53,929 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-11-14 04:09:54,301 WARN L851 $PredicateComparison]: unable to prove that (and (forall ((v_ArrVal_183 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_184 (Array (_ BitVec 32) (_ BitVec 32)))) (bvule (bvadd (_ bv8 32) (select (select (store |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_main_~x~0#1.base| v_ArrVal_183) |c_ULTIMATE.start_main_~head~0#1.base|) |c_ULTIMATE.start_main_~head~0#1.offset|)) (select |c_#length| (select (select (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_~x~0#1.base| v_ArrVal_184) |c_ULTIMATE.start_main_~head~0#1.base|) |c_ULTIMATE.start_main_~head~0#1.offset|)))) (forall ((v_ArrVal_183 (Array (_ BitVec 32) (_ BitVec 32)))) (let ((.cse0 (select (select (store |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_main_~x~0#1.base| v_ArrVal_183) |c_ULTIMATE.start_main_~head~0#1.base|) |c_ULTIMATE.start_main_~head~0#1.offset|))) (bvule (bvadd (_ bv4 32) .cse0) (bvadd (_ bv8 32) .cse0))))) is different from false [2024-11-14 04:09:54,417 WARN L851 $PredicateComparison]: unable to prove that (and (forall ((v_ArrVal_183 (Array (_ BitVec 32) (_ BitVec 32)))) (let ((.cse0 (select (select (store |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_main_#t~mem4#1.base| v_ArrVal_183) |c_ULTIMATE.start_main_~head~0#1.base|) |c_ULTIMATE.start_main_~head~0#1.offset|))) (bvule (bvadd .cse0 (_ bv4 32)) (bvadd .cse0 (_ bv8 32))))) (forall ((v_ArrVal_183 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_184 (Array (_ BitVec 32) (_ BitVec 32)))) (bvule (bvadd (select (select (store |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_main_#t~mem4#1.base| v_ArrVal_183) |c_ULTIMATE.start_main_~head~0#1.base|) |c_ULTIMATE.start_main_~head~0#1.offset|) (_ bv8 32)) (select |c_#length| (select (select (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_#t~mem4#1.base| v_ArrVal_184) |c_ULTIMATE.start_main_~head~0#1.base|) |c_ULTIMATE.start_main_~head~0#1.offset|))))) is different from false [2024-11-14 04:09:54,454 WARN L851 $PredicateComparison]: unable to prove that (let ((.cse0 (select (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_~x~0#1.base|) |c_ULTIMATE.start_main_~x~0#1.offset|))) (and (forall ((v_ArrVal_183 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_184 (Array (_ BitVec 32) (_ BitVec 32)))) (bvule (bvadd (select (select (store |c_#memory_$Pointer$.offset| .cse0 v_ArrVal_183) |c_ULTIMATE.start_main_~head~0#1.base|) |c_ULTIMATE.start_main_~head~0#1.offset|) (_ bv8 32)) (select |c_#length| (select (select (store |c_#memory_$Pointer$.base| .cse0 v_ArrVal_184) |c_ULTIMATE.start_main_~head~0#1.base|) |c_ULTIMATE.start_main_~head~0#1.offset|)))) (forall ((v_ArrVal_183 (Array (_ BitVec 32) (_ BitVec 32)))) (let ((.cse1 (select (select (store |c_#memory_$Pointer$.offset| .cse0 v_ArrVal_183) |c_ULTIMATE.start_main_~head~0#1.base|) |c_ULTIMATE.start_main_~head~0#1.offset|))) (bvule (bvadd .cse1 (_ bv4 32)) (bvadd .cse1 (_ bv8 32))))))) is different from false [2024-11-14 04:09:54,499 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-11-14 04:09:54,499 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 37 treesize of output 38 [2024-11-14 04:09:54,510 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-11-14 04:09:54,510 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 29 treesize of output 30 [2024-11-14 04:09:54,538 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-11-14 04:09:54,538 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 52 treesize of output 55 [2024-11-14 04:09:54,577 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-11-14 04:09:54,577 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 82 treesize of output 81 [2024-11-14 04:09:54,588 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 9 [2024-11-14 04:09:54,592 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 7 [2024-11-14 04:09:54,731 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-11-14 04:09:54,732 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 37 treesize of output 30 [2024-11-14 04:09:54,767 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-11-14 04:09:54,767 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 44 treesize of output 43 [2024-11-14 04:09:54,817 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-14 04:09:55,095 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-14 04:09:55,095 INFO L136 FreeRefinementEngine]: Strategy WALRUS found an infeasible trace [2024-11-14 04:09:55,095 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1310260575] [2024-11-14 04:09:55,095 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1310260575] provided 0 perfect and 2 imperfect interpolant sequences [2024-11-14 04:09:55,096 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleCvc4 [568407760] [2024-11-14 04:09:55,096 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-14 04:09:55,096 INFO L173 SolverBuilder]: Constructing external solver with command: cvc4 --incremental --print-success --lang smt [2024-11-14 04:09:55,096 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_2088ea77-1acf-4d0c-88ef-23be095c4621/bin/utaipan-verify-sOmjnqqW8E/cvc4 [2024-11-14 04:09:55,100 INFO L229 MonitoredProcess]: Starting monitored process 11 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_2088ea77-1acf-4d0c-88ef-23be095c4621/bin/utaipan-verify-sOmjnqqW8E/cvc4 --incremental --print-success --lang smt (exit command is (exit), workingDir is null) [2024-11-14 04:09:55,101 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_2088ea77-1acf-4d0c-88ef-23be095c4621/bin/utaipan-verify-sOmjnqqW8E/cvc4 --incremental --print-success --lang smt (11)] Waiting until timeout for monitored process [2024-11-14 04:09:55,345 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-14 04:09:55,352 INFO L255 TraceCheckSpWp]: Trace formula consists of 134 conjuncts, 26 conjuncts are in the unsatisfiable core [2024-11-14 04:09:55,357 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-14 04:09:55,365 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 7 [2024-11-14 04:09:55,441 INFO L349 Elim1Store]: treesize reduction 6, result has 40.0 percent of original size [2024-11-14 04:09:55,442 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 13 treesize of output 13 [2024-11-14 04:09:55,456 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 6 treesize of output 5 [2024-11-14 04:09:55,494 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 7 [2024-11-14 04:09:55,504 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 15 treesize of output 1 [2024-11-14 04:09:55,637 INFO L349 Elim1Store]: treesize reduction 13, result has 40.9 percent of original size [2024-11-14 04:09:55,638 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 1 new quantified variables, introduced 1 case distinctions, treesize of input 16 treesize of output 15 [2024-11-14 04:09:55,671 INFO L349 Elim1Store]: treesize reduction 17, result has 22.7 percent of original size [2024-11-14 04:09:55,672 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 1 new quantified variables, introduced 1 case distinctions, treesize of input 33 treesize of output 24 [2024-11-14 04:09:55,812 INFO L349 Elim1Store]: treesize reduction 19, result has 20.8 percent of original size [2024-11-14 04:09:55,812 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 50 treesize of output 45 [2024-11-14 04:09:55,826 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 24 treesize of output 11 [2024-11-14 04:09:56,019 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 25 treesize of output 13 [2024-11-14 04:09:56,029 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 7 treesize of output 3 [2024-11-14 04:09:56,033 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-14 04:09:56,033 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-11-14 04:09:56,186 WARN L851 $PredicateComparison]: unable to prove that (and (forall ((v_ArrVal_226 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_227 (Array (_ BitVec 32) (_ BitVec 32)))) (bvule (bvadd (_ bv8 32) (select (select (store |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_main_~x~0#1.base| v_ArrVal_226) |c_ULTIMATE.start_main_~head~0#1.base|) |c_ULTIMATE.start_main_~head~0#1.offset|)) (select |c_#length| (select (select (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_~x~0#1.base| v_ArrVal_227) |c_ULTIMATE.start_main_~head~0#1.base|) |c_ULTIMATE.start_main_~head~0#1.offset|)))) (forall ((v_ArrVal_226 (Array (_ BitVec 32) (_ BitVec 32)))) (let ((.cse0 (select (select (store |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_main_~x~0#1.base| v_ArrVal_226) |c_ULTIMATE.start_main_~head~0#1.base|) |c_ULTIMATE.start_main_~head~0#1.offset|))) (bvule (bvadd (_ bv4 32) .cse0) (bvadd (_ bv8 32) .cse0))))) is different from false [2024-11-14 04:09:56,287 WARN L851 $PredicateComparison]: unable to prove that (and (forall ((v_ArrVal_226 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_227 (Array (_ BitVec 32) (_ BitVec 32)))) (bvule (bvadd (select (select (store |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_main_#t~mem4#1.base| v_ArrVal_226) |c_ULTIMATE.start_main_~head~0#1.base|) |c_ULTIMATE.start_main_~head~0#1.offset|) (_ bv8 32)) (select |c_#length| (select (select (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_#t~mem4#1.base| v_ArrVal_227) |c_ULTIMATE.start_main_~head~0#1.base|) |c_ULTIMATE.start_main_~head~0#1.offset|)))) (forall ((v_ArrVal_226 (Array (_ BitVec 32) (_ BitVec 32)))) (let ((.cse0 (select (select (store |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_main_#t~mem4#1.base| v_ArrVal_226) |c_ULTIMATE.start_main_~head~0#1.base|) |c_ULTIMATE.start_main_~head~0#1.offset|))) (bvule (bvadd .cse0 (_ bv4 32)) (bvadd .cse0 (_ bv8 32)))))) is different from false [2024-11-14 04:09:56,575 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-11-14 04:09:56,575 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 37 treesize of output 30 [2024-11-14 04:09:56,597 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-11-14 04:09:56,597 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 44 treesize of output 43 [2024-11-14 04:09:56,630 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-14 04:09:56,647 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-11-14 04:09:56,647 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 37 treesize of output 38 [2024-11-14 04:09:56,658 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-11-14 04:09:56,658 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 29 treesize of output 30 [2024-11-14 04:09:56,662 INFO L173 IndexEqualityManager]: detected equality via solver [2024-11-14 04:09:56,666 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 27 treesize of output 19 [2024-11-14 04:09:56,670 INFO L173 IndexEqualityManager]: detected equality via solver [2024-11-14 04:09:56,674 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 20 treesize of output 12 [2024-11-14 04:09:56,786 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-14 04:09:56,787 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleCvc4 [568407760] provided 0 perfect and 2 imperfect interpolant sequences [2024-11-14 04:09:56,787 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1679658713] [2024-11-14 04:09:56,787 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-14 04:09:56,787 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-14 04:09:56,787 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_2088ea77-1acf-4d0c-88ef-23be095c4621/bin/utaipan-verify-sOmjnqqW8E/z3 [2024-11-14 04:09:56,791 INFO L229 MonitoredProcess]: Starting monitored process 12 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_2088ea77-1acf-4d0c-88ef-23be095c4621/bin/utaipan-verify-sOmjnqqW8E/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-11-14 04:09:56,792 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_2088ea77-1acf-4d0c-88ef-23be095c4621/bin/utaipan-verify-sOmjnqqW8E/z3 -smt2 -in SMTLIB2_COMPLIANT=true (12)] Waiting until timeout for monitored process [2024-11-14 04:09:56,905 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-14 04:09:56,908 INFO L255 TraceCheckSpWp]: Trace formula consists of 134 conjuncts, 23 conjuncts are in the unsatisfiable core [2024-11-14 04:09:56,911 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-14 04:09:57,043 INFO L349 Elim1Store]: treesize reduction 6, result has 40.0 percent of original size [2024-11-14 04:09:57,044 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 12 treesize of output 12 [2024-11-14 04:09:57,060 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 6 treesize of output 5 [2024-11-14 04:09:57,161 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 7 [2024-11-14 04:09:57,171 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 15 treesize of output 1 [2024-11-14 04:09:57,424 INFO L349 Elim1Store]: treesize reduction 17, result has 22.7 percent of original size [2024-11-14 04:09:57,424 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 1 new quantified variables, introduced 1 case distinctions, treesize of input 33 treesize of output 24 [2024-11-14 04:09:57,440 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-11-14 04:09:57,441 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 16 treesize of output 11 [2024-11-14 04:09:57,531 INFO L349 Elim1Store]: treesize reduction 19, result has 20.8 percent of original size [2024-11-14 04:09:57,531 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 50 treesize of output 45 [2024-11-14 04:09:57,540 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 24 treesize of output 11 [2024-11-14 04:09:57,810 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 25 treesize of output 13 [2024-11-14 04:09:57,816 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 7 treesize of output 3 [2024-11-14 04:09:57,820 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-14 04:09:57,820 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-11-14 04:09:57,973 WARN L851 $PredicateComparison]: unable to prove that (and (forall ((v_ArrVal_268 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_269 (Array (_ BitVec 32) (_ BitVec 32)))) (bvule (bvadd (_ bv8 32) (select (select (store |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_main_~x~0#1.base| v_ArrVal_268) |c_ULTIMATE.start_main_~head~0#1.base|) |c_ULTIMATE.start_main_~head~0#1.offset|)) (select |c_#length| (select (select (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_~x~0#1.base| v_ArrVal_269) |c_ULTIMATE.start_main_~head~0#1.base|) |c_ULTIMATE.start_main_~head~0#1.offset|)))) (forall ((v_ArrVal_268 (Array (_ BitVec 32) (_ BitVec 32)))) (let ((.cse0 (select (select (store |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_main_~x~0#1.base| v_ArrVal_268) |c_ULTIMATE.start_main_~head~0#1.base|) |c_ULTIMATE.start_main_~head~0#1.offset|))) (bvule (bvadd (_ bv4 32) .cse0) (bvadd (_ bv8 32) .cse0))))) is different from false [2024-11-14 04:09:58,058 WARN L851 $PredicateComparison]: unable to prove that (and (forall ((v_ArrVal_268 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_269 (Array (_ BitVec 32) (_ BitVec 32)))) (bvule (bvadd (select (select (store |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_main_#t~mem4#1.base| v_ArrVal_268) |c_ULTIMATE.start_main_~head~0#1.base|) |c_ULTIMATE.start_main_~head~0#1.offset|) (_ bv8 32)) (select |c_#length| (select (select (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_#t~mem4#1.base| v_ArrVal_269) |c_ULTIMATE.start_main_~head~0#1.base|) |c_ULTIMATE.start_main_~head~0#1.offset|)))) (forall ((v_ArrVal_268 (Array (_ BitVec 32) (_ BitVec 32)))) (let ((.cse0 (select (select (store |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_main_#t~mem4#1.base| v_ArrVal_268) |c_ULTIMATE.start_main_~head~0#1.base|) |c_ULTIMATE.start_main_~head~0#1.offset|))) (bvule (bvadd .cse0 (_ bv4 32)) (bvadd .cse0 (_ bv8 32)))))) is different from false [2024-11-14 04:09:58,084 WARN L851 $PredicateComparison]: unable to prove that (let ((.cse0 (select (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_~x~0#1.base|) |c_ULTIMATE.start_main_~x~0#1.offset|))) (and (forall ((v_ArrVal_268 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_269 (Array (_ BitVec 32) (_ BitVec 32)))) (bvule (bvadd (_ bv8 32) (select (select (store |c_#memory_$Pointer$.offset| .cse0 v_ArrVal_268) |c_ULTIMATE.start_main_~head~0#1.base|) |c_ULTIMATE.start_main_~head~0#1.offset|)) (select |c_#length| (select (select (store |c_#memory_$Pointer$.base| .cse0 v_ArrVal_269) |c_ULTIMATE.start_main_~head~0#1.base|) |c_ULTIMATE.start_main_~head~0#1.offset|)))) (forall ((v_ArrVal_268 (Array (_ BitVec 32) (_ BitVec 32)))) (let ((.cse1 (select (select (store |c_#memory_$Pointer$.offset| .cse0 v_ArrVal_268) |c_ULTIMATE.start_main_~head~0#1.base|) |c_ULTIMATE.start_main_~head~0#1.offset|))) (bvule (bvadd (_ bv4 32) .cse1) (bvadd (_ bv8 32) .cse1)))))) is different from false [2024-11-14 04:09:58,116 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-11-14 04:09:58,117 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 37 treesize of output 30 [2024-11-14 04:09:58,138 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-11-14 04:09:58,138 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 44 treesize of output 43 [2024-11-14 04:09:58,144 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-14 04:09:58,183 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-11-14 04:09:58,184 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 37 treesize of output 38 [2024-11-14 04:09:58,198 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-11-14 04:09:58,199 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 29 treesize of output 30 [2024-11-14 04:09:58,203 INFO L173 IndexEqualityManager]: detected equality via solver [2024-11-14 04:09:58,207 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 27 treesize of output 19 [2024-11-14 04:09:58,212 INFO L173 IndexEqualityManager]: detected equality via solver [2024-11-14 04:09:58,215 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 20 treesize of output 12 [2024-11-14 04:09:58,330 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-14 04:09:58,330 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1679658713] provided 0 perfect and 2 imperfect interpolant sequences [2024-11-14 04:09:58,330 INFO L185 FreeRefinementEngine]: Found 0 perfect and 6 imperfect interpolant sequences. [2024-11-14 04:09:58,330 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [10, 10, 10, 10, 10, 10] total 32 [2024-11-14 04:09:58,330 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [797722939] [2024-11-14 04:09:58,330 INFO L85 oduleStraightlineAll]: Using 6 imperfect interpolants to construct interpolant automaton [2024-11-14 04:09:58,331 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 33 states [2024-11-14 04:09:58,331 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WALRUS [2024-11-14 04:09:58,331 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 33 interpolants. [2024-11-14 04:09:58,332 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=106, Invalid=510, Unknown=16, NotChecked=424, Total=1056 [2024-11-14 04:09:58,332 INFO L87 Difference]: Start difference. First operand 200 states and 242 transitions. Second operand has 33 states, 32 states have (on average 2.96875) internal successors, (95), 33 states have internal predecessors, (95), 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-14 04:10:03,177 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-14 04:10:03,177 INFO L93 Difference]: Finished difference Result 304 states and 352 transitions. [2024-11-14 04:10:03,179 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2024-11-14 04:10:03,179 INFO L78 Accepts]: Start accepts. Automaton has has 33 states, 32 states have (on average 2.96875) internal successors, (95), 33 states have internal predecessors, (95), 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 27 [2024-11-14 04:10:03,179 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-14 04:10:03,181 INFO L225 Difference]: With dead ends: 304 [2024-11-14 04:10:03,181 INFO L226 Difference]: Without dead ends: 304 [2024-11-14 04:10:03,182 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 164 GetRequests, 122 SyntacticMatches, 5 SemanticMatches, 37 ConstructedPredicates, 8 IntricatePredicates, 0 DeprecatedPredicates, 232 ImplicationChecksByTransitivity, 2.3s TimeCoverageRelationStatistics Valid=180, Invalid=766, Unknown=16, NotChecked=520, Total=1482 [2024-11-14 04:10:03,182 INFO L432 NwaCegarLoop]: 94 mSDtfsCounter, 603 mSDsluCounter, 929 mSDsCounter, 0 mSdLazyCounter, 1217 mSolverCounterSat, 29 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 3.6s Time, 0 mProtectedPredicate, 0 mProtectedAction, 603 SdHoareTripleChecker+Valid, 1023 SdHoareTripleChecker+Invalid, 3639 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 29 IncrementalHoareTripleChecker+Valid, 1217 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 2393 IncrementalHoareTripleChecker+Unchecked, 4.1s IncrementalHoareTripleChecker+Time [2024-11-14 04:10:03,183 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [603 Valid, 1023 Invalid, 3639 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [29 Valid, 1217 Invalid, 0 Unknown, 2393 Unchecked, 4.1s Time] [2024-11-14 04:10:03,183 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 304 states. [2024-11-14 04:10:03,188 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 304 to 222. [2024-11-14 04:10:03,188 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 222 states, 178 states have (on average 1.4775280898876404) internal successors, (263), 220 states have internal predecessors, (263), 6 states have call successors, (6), 1 states have call predecessors, (6), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-14 04:10:03,189 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 222 states to 222 states and 269 transitions. [2024-11-14 04:10:03,190 INFO L78 Accepts]: Start accepts. Automaton has 222 states and 269 transitions. Word has length 27 [2024-11-14 04:10:03,190 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-14 04:10:03,190 INFO L471 AbstractCegarLoop]: Abstraction has 222 states and 269 transitions. [2024-11-14 04:10:03,190 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 33 states, 32 states have (on average 2.96875) internal successors, (95), 33 states have internal predecessors, (95), 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-14 04:10:03,190 INFO L276 IsEmpty]: Start isEmpty. Operand 222 states and 269 transitions. [2024-11-14 04:10:03,191 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 28 [2024-11-14 04:10:03,191 INFO L207 NwaCegarLoop]: Found error trace [2024-11-14 04:10:03,191 INFO L215 NwaCegarLoop]: trace histogram [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] [2024-11-14 04:10:03,208 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_2088ea77-1acf-4d0c-88ef-23be095c4621/bin/utaipan-verify-sOmjnqqW8E/z3 -smt2 -in SMTLIB2_COMPLIANT=true (12)] Ended with exit code 0 [2024-11-14 04:10:03,398 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_2088ea77-1acf-4d0c-88ef-23be095c4621/bin/utaipan-verify-sOmjnqqW8E/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (10)] Ended with exit code 0 [2024-11-14 04:10:03,597 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_2088ea77-1acf-4d0c-88ef-23be095c4621/bin/utaipan-verify-sOmjnqqW8E/cvc4 --incremental --print-success --lang smt (11)] Ended with exit code 0 [2024-11-14 04:10:03,795 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 12 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_2088ea77-1acf-4d0c-88ef-23be095c4621/bin/utaipan-verify-sOmjnqqW8E/z3 -smt2 -in SMTLIB2_COMPLIANT=true,10 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_2088ea77-1acf-4d0c-88ef-23be095c4621/bin/utaipan-verify-sOmjnqqW8E/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3,11 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_2088ea77-1acf-4d0c-88ef-23be095c4621/bin/utaipan-verify-sOmjnqqW8E/cvc4 --incremental --print-success --lang smt [2024-11-14 04:10:03,796 INFO L396 AbstractCegarLoop]: === Iteration 10 === Targeting ULTIMATE.startErr18REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [reach_errorErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 62 more)] === [2024-11-14 04:10:03,796 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-14 04:10:03,796 INFO L85 PathProgramCache]: Analyzing trace with hash 1904089400, now seen corresponding path program 1 times [2024-11-14 04:10:03,797 INFO L118 FreeRefinementEngine]: Executing refinement strategy WALRUS [2024-11-14 04:10:03,797 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [251613967] [2024-11-14 04:10:03,797 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-14 04:10:03,797 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-11-14 04:10:03,797 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_2088ea77-1acf-4d0c-88ef-23be095c4621/bin/utaipan-verify-sOmjnqqW8E/mathsat [2024-11-14 04:10:03,799 INFO L229 MonitoredProcess]: Starting monitored process 13 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_2088ea77-1acf-4d0c-88ef-23be095c4621/bin/utaipan-verify-sOmjnqqW8E/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2024-11-14 04:10:03,801 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_2088ea77-1acf-4d0c-88ef-23be095c4621/bin/utaipan-verify-sOmjnqqW8E/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (13)] Waiting until timeout for monitored process [2024-11-14 04:10:03,951 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-14 04:10:03,960 INFO L255 TraceCheckSpWp]: Trace formula consists of 134 conjuncts, 19 conjuncts are in the unsatisfiable core [2024-11-14 04:10:03,963 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-14 04:10:03,993 INFO L349 Elim1Store]: treesize reduction 13, result has 45.8 percent of original size [2024-11-14 04:10:03,994 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 12 treesize of output 22 [2024-11-14 04:10:04,166 INFO L349 Elim1Store]: treesize reduction 54, result has 29.9 percent of original size [2024-11-14 04:10:04,167 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 5 case distinctions, treesize of input 28 treesize of output 45 [2024-11-14 04:10:04,286 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 15 treesize of output 1 [2024-11-14 04:10:04,598 INFO L349 Elim1Store]: treesize reduction 17, result has 22.7 percent of original size [2024-11-14 04:10:04,599 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 1 new quantified variables, introduced 1 case distinctions, treesize of input 51 treesize of output 40 [2024-11-14 04:10:04,759 INFO L349 Elim1Store]: treesize reduction 19, result has 20.8 percent of original size [2024-11-14 04:10:04,759 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 52 treesize of output 49 [2024-11-14 04:10:05,129 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 43 treesize of output 27 [2024-11-14 04:10:05,222 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-14 04:10:05,222 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-11-14 04:10:05,345 WARN L851 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_309 (Array (_ BitVec 32) (_ BitVec 32)))) (= (_ bv0 1) (bvadd (_ bv1 1) (select |c_#valid| (select (select (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_~x~0#1.base| v_ArrVal_309) |c_ULTIMATE.start_main_~head~0#1.base|) |c_ULTIMATE.start_main_~head~0#1.offset|))))) is different from false [2024-11-14 04:10:05,488 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-11-14 04:10:05,489 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 22 treesize of output 23 [2024-11-14 04:10:05,503 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-11-14 04:10:05,503 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 38 treesize of output 41 [2024-11-14 04:10:05,530 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 7 [2024-11-14 04:10:10,496 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-14 04:10:10,497 INFO L136 FreeRefinementEngine]: Strategy WALRUS found an infeasible trace [2024-11-14 04:10:10,497 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [251613967] [2024-11-14 04:10:10,498 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [251613967] provided 0 perfect and 2 imperfect interpolant sequences [2024-11-14 04:10:10,498 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleCvc4 [1189424689] [2024-11-14 04:10:10,498 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-14 04:10:10,498 INFO L173 SolverBuilder]: Constructing external solver with command: cvc4 --incremental --print-success --lang smt [2024-11-14 04:10:10,498 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_2088ea77-1acf-4d0c-88ef-23be095c4621/bin/utaipan-verify-sOmjnqqW8E/cvc4 [2024-11-14 04:10:10,501 INFO L229 MonitoredProcess]: Starting monitored process 14 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_2088ea77-1acf-4d0c-88ef-23be095c4621/bin/utaipan-verify-sOmjnqqW8E/cvc4 --incremental --print-success --lang smt (exit command is (exit), workingDir is null) [2024-11-14 04:10:10,503 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_2088ea77-1acf-4d0c-88ef-23be095c4621/bin/utaipan-verify-sOmjnqqW8E/cvc4 --incremental --print-success --lang smt (14)] Waiting until timeout for monitored process [2024-11-14 04:10:10,714 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-14 04:10:10,716 INFO L255 TraceCheckSpWp]: Trace formula consists of 134 conjuncts, 20 conjuncts are in the unsatisfiable core [2024-11-14 04:10:10,718 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-14 04:10:10,773 INFO L349 Elim1Store]: treesize reduction 17, result has 29.2 percent of original size [2024-11-14 04:10:10,774 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 14 treesize of output 20 [2024-11-14 04:10:10,978 INFO L349 Elim1Store]: treesize reduction 54, result has 29.9 percent of original size [2024-11-14 04:10:10,979 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 5 case distinctions, treesize of input 26 treesize of output 43 [2024-11-14 04:10:11,088 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 1 [2024-11-14 04:10:11,437 INFO L349 Elim1Store]: treesize reduction 17, result has 22.7 percent of original size [2024-11-14 04:10:11,437 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 1 new quantified variables, introduced 1 case distinctions, treesize of input 43 treesize of output 32 [2024-11-14 04:10:11,553 INFO L349 Elim1Store]: treesize reduction 19, result has 20.8 percent of original size [2024-11-14 04:10:11,554 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 44 treesize of output 41 [2024-11-14 04:10:11,923 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 35 treesize of output 19 [2024-11-14 04:10:12,022 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-14 04:10:12,023 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-11-14 04:10:12,061 WARN L851 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_349 (Array (_ BitVec 32) (_ BitVec 32)))) (= (_ bv0 1) (bvadd (_ bv1 1) (select |c_#valid| (select (select (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_~x~0#1.base| v_ArrVal_349) |c_ULTIMATE.start_main_~head~0#1.base|) |c_ULTIMATE.start_main_~head~0#1.offset|))))) is different from false [2024-11-14 04:10:12,093 WARN L851 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_349 (Array (_ BitVec 32) (_ BitVec 32)))) (= (_ bv0 1) (bvadd (_ bv1 1) (select |c_#valid| (select (select (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_#t~mem4#1.base| v_ArrVal_349) |c_ULTIMATE.start_main_~head~0#1.base|) |c_ULTIMATE.start_main_~head~0#1.offset|))))) is different from false [2024-11-14 04:10:12,101 WARN L851 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_349 (Array (_ BitVec 32) (_ BitVec 32)))) (= (_ bv0 1) (bvadd (_ bv1 1) (select |c_#valid| (select (select (store |c_#memory_$Pointer$.base| (select (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_~x~0#1.base|) |c_ULTIMATE.start_main_~x~0#1.offset|) v_ArrVal_349) |c_ULTIMATE.start_main_~head~0#1.base|) |c_ULTIMATE.start_main_~head~0#1.offset|))))) is different from false [2024-11-14 04:10:12,119 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-11-14 04:10:12,119 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 22 treesize of output 23 [2024-11-14 04:10:12,136 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-11-14 04:10:12,137 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 38 treesize of output 41 [2024-11-14 04:10:12,142 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 7 [2024-11-14 04:10:12,876 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-14 04:10:12,876 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleCvc4 [1189424689] provided 0 perfect and 2 imperfect interpolant sequences [2024-11-14 04:10:12,876 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1786556379] [2024-11-14 04:10:12,876 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-14 04:10:12,876 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-14 04:10:12,876 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_2088ea77-1acf-4d0c-88ef-23be095c4621/bin/utaipan-verify-sOmjnqqW8E/z3 [2024-11-14 04:10:12,878 INFO L229 MonitoredProcess]: Starting monitored process 15 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_2088ea77-1acf-4d0c-88ef-23be095c4621/bin/utaipan-verify-sOmjnqqW8E/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-11-14 04:10:12,882 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_2088ea77-1acf-4d0c-88ef-23be095c4621/bin/utaipan-verify-sOmjnqqW8E/z3 -smt2 -in SMTLIB2_COMPLIANT=true (15)] Waiting until timeout for monitored process [2024-11-14 04:10:12,991 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-14 04:10:12,994 INFO L255 TraceCheckSpWp]: Trace formula consists of 134 conjuncts, 18 conjuncts are in the unsatisfiable core [2024-11-14 04:10:12,998 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-14 04:10:13,004 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 7 [2024-11-14 04:10:19,155 INFO L349 Elim1Store]: treesize reduction 22, result has 35.3 percent of original size [2024-11-14 04:10:19,155 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 2 case distinctions, treesize of input 19 treesize of output 27 [2024-11-14 04:10:19,243 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 15 treesize of output 1 [2024-11-14 04:10:19,505 INFO L349 Elim1Store]: treesize reduction 17, result has 22.7 percent of original size [2024-11-14 04:10:19,505 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 1 new quantified variables, introduced 1 case distinctions, treesize of input 35 treesize of output 26 [2024-11-14 04:10:19,583 INFO L349 Elim1Store]: treesize reduction 19, result has 20.8 percent of original size [2024-11-14 04:10:19,584 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 36 treesize of output 35 [2024-11-14 04:10:19,825 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 27 treesize of output 15 [2024-11-14 04:10:19,861 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-14 04:10:19,861 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-11-14 04:10:19,895 WARN L851 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_389 (Array (_ BitVec 32) (_ BitVec 32)))) (= (_ bv0 1) (bvadd (_ bv1 1) (select |c_#valid| (select (select (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_~x~0#1.base| v_ArrVal_389) |c_ULTIMATE.start_main_~head~0#1.base|) |c_ULTIMATE.start_main_~head~0#1.offset|))))) is different from false [2024-11-14 04:10:19,985 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-11-14 04:10:19,986 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 22 treesize of output 23 [2024-11-14 04:10:20,000 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-11-14 04:10:20,000 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 38 treesize of output 41 [2024-11-14 04:10:20,005 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 7 [2024-11-14 04:10:26,630 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-14 04:10:26,630 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1786556379] provided 0 perfect and 2 imperfect interpolant sequences [2024-11-14 04:10:26,630 INFO L185 FreeRefinementEngine]: Found 0 perfect and 6 imperfect interpolant sequences. [2024-11-14 04:10:26,630 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [10, 10, 10, 10, 10, 10] total 42 [2024-11-14 04:10:26,630 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1425207017] [2024-11-14 04:10:26,630 INFO L85 oduleStraightlineAll]: Using 6 imperfect interpolants to construct interpolant automaton [2024-11-14 04:10:26,631 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 43 states [2024-11-14 04:10:26,631 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WALRUS [2024-11-14 04:10:26,631 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 43 interpolants. [2024-11-14 04:10:26,633 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=222, Invalid=1181, Unknown=23, NotChecked=380, Total=1806 [2024-11-14 04:10:26,633 INFO L87 Difference]: Start difference. First operand 222 states and 269 transitions. Second operand has 43 states, 42 states have (on average 2.880952380952381) internal successors, (121), 43 states have internal predecessors, (121), 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-14 04:10:30,884 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-14 04:10:30,885 INFO L93 Difference]: Finished difference Result 304 states and 351 transitions. [2024-11-14 04:10:30,885 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2024-11-14 04:10:30,885 INFO L78 Accepts]: Start accepts. Automaton has has 43 states, 42 states have (on average 2.880952380952381) internal successors, (121), 43 states have internal predecessors, (121), 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 27 [2024-11-14 04:10:30,885 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-14 04:10:30,886 INFO L225 Difference]: With dead ends: 304 [2024-11-14 04:10:30,887 INFO L226 Difference]: Without dead ends: 304 [2024-11-14 04:10:30,887 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 170 GetRequests, 110 SyntacticMatches, 9 SemanticMatches, 51 ConstructedPredicates, 5 IntricatePredicates, 0 DeprecatedPredicates, 705 ImplicationChecksByTransitivity, 20.0s TimeCoverageRelationStatistics Valid=399, Invalid=1854, Unknown=23, NotChecked=480, Total=2756 [2024-11-14 04:10:30,888 INFO L432 NwaCegarLoop]: 97 mSDtfsCounter, 1536 mSDsluCounter, 983 mSDsCounter, 0 mSdLazyCounter, 1056 mSolverCounterSat, 92 mSolverCounterUnsat, 4 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 3.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1536 SdHoareTripleChecker+Valid, 1080 SdHoareTripleChecker+Invalid, 2754 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 92 IncrementalHoareTripleChecker+Valid, 1056 IncrementalHoareTripleChecker+Invalid, 4 IncrementalHoareTripleChecker+Unknown, 1602 IncrementalHoareTripleChecker+Unchecked, 3.5s IncrementalHoareTripleChecker+Time [2024-11-14 04:10:30,888 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [1536 Valid, 1080 Invalid, 2754 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [92 Valid, 1056 Invalid, 4 Unknown, 1602 Unchecked, 3.5s Time] [2024-11-14 04:10:30,889 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 304 states. [2024-11-14 04:10:30,893 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 304 to 222. [2024-11-14 04:10:30,894 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 222 states, 178 states have (on average 1.4719101123595506) internal successors, (262), 220 states have internal predecessors, (262), 6 states have call successors, (6), 1 states have call predecessors, (6), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-14 04:10:30,895 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 222 states to 222 states and 268 transitions. [2024-11-14 04:10:30,895 INFO L78 Accepts]: Start accepts. Automaton has 222 states and 268 transitions. Word has length 27 [2024-11-14 04:10:30,895 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-14 04:10:30,895 INFO L471 AbstractCegarLoop]: Abstraction has 222 states and 268 transitions. [2024-11-14 04:10:30,895 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 43 states, 42 states have (on average 2.880952380952381) internal successors, (121), 43 states have internal predecessors, (121), 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-14 04:10:30,896 INFO L276 IsEmpty]: Start isEmpty. Operand 222 states and 268 transitions. [2024-11-14 04:10:30,896 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 32 [2024-11-14 04:10:30,896 INFO L207 NwaCegarLoop]: Found error trace [2024-11-14 04:10:30,896 INFO L215 NwaCegarLoop]: trace histogram [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] [2024-11-14 04:10:30,918 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_2088ea77-1acf-4d0c-88ef-23be095c4621/bin/utaipan-verify-sOmjnqqW8E/z3 -smt2 -in SMTLIB2_COMPLIANT=true (15)] Ended with exit code 0 [2024-11-14 04:10:31,102 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_2088ea77-1acf-4d0c-88ef-23be095c4621/bin/utaipan-verify-sOmjnqqW8E/cvc4 --incremental --print-success --lang smt (14)] Forceful destruction successful, exit code 0 [2024-11-14 04:10:31,303 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_2088ea77-1acf-4d0c-88ef-23be095c4621/bin/utaipan-verify-sOmjnqqW8E/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (13)] Ended with exit code 0 [2024-11-14 04:10:31,501 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 15 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_2088ea77-1acf-4d0c-88ef-23be095c4621/bin/utaipan-verify-sOmjnqqW8E/z3 -smt2 -in SMTLIB2_COMPLIANT=true,14 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_2088ea77-1acf-4d0c-88ef-23be095c4621/bin/utaipan-verify-sOmjnqqW8E/cvc4 --incremental --print-success --lang smt,13 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_2088ea77-1acf-4d0c-88ef-23be095c4621/bin/utaipan-verify-sOmjnqqW8E/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-11-14 04:10:31,501 INFO L396 AbstractCegarLoop]: === Iteration 11 === Targeting reach_errorErr0ASSERT_VIOLATIONMEMORY_LEAK === [reach_errorErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 62 more)] === [2024-11-14 04:10:31,502 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-14 04:10:31,502 INFO L85 PathProgramCache]: Analyzing trace with hash -623307270, now seen corresponding path program 1 times [2024-11-14 04:10:31,502 INFO L118 FreeRefinementEngine]: Executing refinement strategy WALRUS [2024-11-14 04:10:31,502 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [908756811] [2024-11-14 04:10:31,502 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-14 04:10:31,502 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-11-14 04:10:31,502 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_2088ea77-1acf-4d0c-88ef-23be095c4621/bin/utaipan-verify-sOmjnqqW8E/mathsat [2024-11-14 04:10:31,504 INFO L229 MonitoredProcess]: Starting monitored process 16 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_2088ea77-1acf-4d0c-88ef-23be095c4621/bin/utaipan-verify-sOmjnqqW8E/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2024-11-14 04:10:31,505 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_2088ea77-1acf-4d0c-88ef-23be095c4621/bin/utaipan-verify-sOmjnqqW8E/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (16)] Waiting until timeout for monitored process [2024-11-14 04:10:31,606 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-14 04:10:31,609 INFO L255 TraceCheckSpWp]: Trace formula consists of 139 conjuncts, 2 conjuncts are in the unsatisfiable core [2024-11-14 04:10:31,610 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-14 04:10:31,618 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2024-11-14 04:10:31,618 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-11-14 04:10:31,618 INFO L136 FreeRefinementEngine]: Strategy WALRUS found an infeasible trace [2024-11-14 04:10:31,618 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [908756811] [2024-11-14 04:10:31,618 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [908756811] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-14 04:10:31,618 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-14 04:10:31,618 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-11-14 04:10:31,619 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1192523482] [2024-11-14 04:10:31,619 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-14 04:10:31,619 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-14 04:10:31,619 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WALRUS [2024-11-14 04:10:31,619 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-14 04:10:31,619 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-14 04:10:31,620 INFO L87 Difference]: Start difference. First operand 222 states and 268 transitions. Second operand has 3 states, 3 states have (on average 9.666666666666666) internal successors, (29), 3 states have internal predecessors, (29), 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-14 04:10:31,634 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-14 04:10:31,634 INFO L93 Difference]: Finished difference Result 224 states and 270 transitions. [2024-11-14 04:10:31,634 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-14 04:10:31,634 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 9.666666666666666) internal successors, (29), 3 states have internal predecessors, (29), 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 31 [2024-11-14 04:10:31,635 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-14 04:10:31,635 INFO L225 Difference]: With dead ends: 224 [2024-11-14 04:10:31,635 INFO L226 Difference]: Without dead ends: 224 [2024-11-14 04:10:31,636 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 30 GetRequests, 29 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-14 04:10:31,636 INFO L432 NwaCegarLoop]: 147 mSDtfsCounter, 0 mSDsluCounter, 141 mSDsCounter, 0 mSdLazyCounter, 7 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 288 SdHoareTripleChecker+Invalid, 7 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 7 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-11-14 04:10:31,636 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 288 Invalid, 7 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 7 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-11-14 04:10:31,637 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 224 states. [2024-11-14 04:10:31,641 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 224 to 224. [2024-11-14 04:10:31,641 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 224 states, 180 states have (on average 1.4666666666666666) internal successors, (264), 222 states have internal predecessors, (264), 6 states have call successors, (6), 1 states have call predecessors, (6), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-14 04:10:31,642 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 224 states to 224 states and 270 transitions. [2024-11-14 04:10:31,643 INFO L78 Accepts]: Start accepts. Automaton has 224 states and 270 transitions. Word has length 31 [2024-11-14 04:10:31,643 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-14 04:10:31,643 INFO L471 AbstractCegarLoop]: Abstraction has 224 states and 270 transitions. [2024-11-14 04:10:31,643 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 9.666666666666666) internal successors, (29), 3 states have internal predecessors, (29), 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-14 04:10:31,643 INFO L276 IsEmpty]: Start isEmpty. Operand 224 states and 270 transitions. [2024-11-14 04:10:31,645 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 33 [2024-11-14 04:10:31,645 INFO L207 NwaCegarLoop]: Found error trace [2024-11-14 04:10:31,645 INFO L215 NwaCegarLoop]: trace histogram [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] [2024-11-14 04:10:31,648 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_2088ea77-1acf-4d0c-88ef-23be095c4621/bin/utaipan-verify-sOmjnqqW8E/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (16)] Ended with exit code 0 [2024-11-14 04:10:31,845 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 16 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_2088ea77-1acf-4d0c-88ef-23be095c4621/bin/utaipan-verify-sOmjnqqW8E/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-11-14 04:10:31,846 INFO L396 AbstractCegarLoop]: === Iteration 12 === Targeting ULTIMATE.startErr30REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [reach_errorErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 62 more)] === [2024-11-14 04:10:31,846 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-14 04:10:31,846 INFO L85 PathProgramCache]: Analyzing trace with hash 1167028371, now seen corresponding path program 1 times [2024-11-14 04:10:31,846 INFO L118 FreeRefinementEngine]: Executing refinement strategy WALRUS [2024-11-14 04:10:31,846 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [748950674] [2024-11-14 04:10:31,846 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-14 04:10:31,846 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-11-14 04:10:31,846 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_2088ea77-1acf-4d0c-88ef-23be095c4621/bin/utaipan-verify-sOmjnqqW8E/mathsat [2024-11-14 04:10:31,849 INFO L229 MonitoredProcess]: Starting monitored process 17 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_2088ea77-1acf-4d0c-88ef-23be095c4621/bin/utaipan-verify-sOmjnqqW8E/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2024-11-14 04:10:31,850 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_2088ea77-1acf-4d0c-88ef-23be095c4621/bin/utaipan-verify-sOmjnqqW8E/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (17)] Waiting until timeout for monitored process [2024-11-14 04:10:31,943 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-14 04:10:31,946 INFO L255 TraceCheckSpWp]: Trace formula consists of 146 conjuncts, 3 conjuncts are in the unsatisfiable core [2024-11-14 04:10:31,947 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-14 04:10:31,955 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 7 [2024-11-14 04:10:31,963 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2024-11-14 04:10:31,964 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-11-14 04:10:31,964 INFO L136 FreeRefinementEngine]: Strategy WALRUS found an infeasible trace [2024-11-14 04:10:31,964 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [748950674] [2024-11-14 04:10:31,964 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [748950674] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-14 04:10:31,964 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-14 04:10:31,964 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-11-14 04:10:31,964 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1163577000] [2024-11-14 04:10:31,964 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-14 04:10:31,964 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-14 04:10:31,964 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WALRUS [2024-11-14 04:10:31,965 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-14 04:10:31,965 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-14 04:10:31,965 INFO L87 Difference]: Start difference. First operand 224 states and 270 transitions. Second operand has 3 states, 2 states have (on average 15.5) internal successors, (31), 3 states have internal predecessors, (31), 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-14 04:10:32,190 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-14 04:10:32,190 INFO L93 Difference]: Finished difference Result 221 states and 264 transitions. [2024-11-14 04:10:32,190 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-14 04:10:32,190 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 2 states have (on average 15.5) internal successors, (31), 3 states have internal predecessors, (31), 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 32 [2024-11-14 04:10:32,191 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-14 04:10:32,191 INFO L225 Difference]: With dead ends: 221 [2024-11-14 04:10:32,191 INFO L226 Difference]: Without dead ends: 221 [2024-11-14 04:10:32,192 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 31 GetRequests, 30 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-14 04:10:32,192 INFO L432 NwaCegarLoop]: 135 mSDtfsCounter, 12 mSDsluCounter, 91 mSDsCounter, 0 mSdLazyCounter, 51 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 12 SdHoareTripleChecker+Valid, 226 SdHoareTripleChecker+Invalid, 53 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 51 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2024-11-14 04:10:32,192 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [12 Valid, 226 Invalid, 53 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 51 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2024-11-14 04:10:32,193 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 221 states. [2024-11-14 04:10:32,197 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 221 to 221. [2024-11-14 04:10:32,197 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 221 states, 180 states have (on average 1.4333333333333333) internal successors, (258), 219 states have internal predecessors, (258), 6 states have call successors, (6), 1 states have call predecessors, (6), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-14 04:10:32,199 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 221 states to 221 states and 264 transitions. [2024-11-14 04:10:32,199 INFO L78 Accepts]: Start accepts. Automaton has 221 states and 264 transitions. Word has length 32 [2024-11-14 04:10:32,199 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-14 04:10:32,199 INFO L471 AbstractCegarLoop]: Abstraction has 221 states and 264 transitions. [2024-11-14 04:10:32,199 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 2 states have (on average 15.5) internal successors, (31), 3 states have internal predecessors, (31), 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-14 04:10:32,200 INFO L276 IsEmpty]: Start isEmpty. Operand 221 states and 264 transitions. [2024-11-14 04:10:32,200 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 33 [2024-11-14 04:10:32,200 INFO L207 NwaCegarLoop]: Found error trace [2024-11-14 04:10:32,200 INFO L215 NwaCegarLoop]: trace histogram [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] [2024-11-14 04:10:32,204 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_2088ea77-1acf-4d0c-88ef-23be095c4621/bin/utaipan-verify-sOmjnqqW8E/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (17)] Ended with exit code 0 [2024-11-14 04:10:32,401 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 17 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_2088ea77-1acf-4d0c-88ef-23be095c4621/bin/utaipan-verify-sOmjnqqW8E/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-11-14 04:10:32,401 INFO L396 AbstractCegarLoop]: === Iteration 13 === Targeting ULTIMATE.startErr31REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [reach_errorErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 62 more)] === [2024-11-14 04:10:32,401 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-14 04:10:32,401 INFO L85 PathProgramCache]: Analyzing trace with hash 1167028372, now seen corresponding path program 1 times [2024-11-14 04:10:32,401 INFO L118 FreeRefinementEngine]: Executing refinement strategy WALRUS [2024-11-14 04:10:32,401 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1216380378] [2024-11-14 04:10:32,402 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-14 04:10:32,402 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-11-14 04:10:32,402 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_2088ea77-1acf-4d0c-88ef-23be095c4621/bin/utaipan-verify-sOmjnqqW8E/mathsat [2024-11-14 04:10:32,403 INFO L229 MonitoredProcess]: Starting monitored process 18 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_2088ea77-1acf-4d0c-88ef-23be095c4621/bin/utaipan-verify-sOmjnqqW8E/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2024-11-14 04:10:32,405 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_2088ea77-1acf-4d0c-88ef-23be095c4621/bin/utaipan-verify-sOmjnqqW8E/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (18)] Waiting until timeout for monitored process [2024-11-14 04:10:32,502 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-14 04:10:32,505 INFO L255 TraceCheckSpWp]: Trace formula consists of 146 conjuncts, 4 conjuncts are in the unsatisfiable core [2024-11-14 04:10:32,506 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-14 04:10:32,516 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-14 04:10:32,525 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2024-11-14 04:10:32,526 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-11-14 04:10:32,526 INFO L136 FreeRefinementEngine]: Strategy WALRUS found an infeasible trace [2024-11-14 04:10:32,526 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1216380378] [2024-11-14 04:10:32,526 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1216380378] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-14 04:10:32,526 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-14 04:10:32,526 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-11-14 04:10:32,526 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1781343984] [2024-11-14 04:10:32,526 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-14 04:10:32,526 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-14 04:10:32,526 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WALRUS [2024-11-14 04:10:32,527 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-14 04:10:32,527 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-14 04:10:32,527 INFO L87 Difference]: Start difference. First operand 221 states and 264 transitions. Second operand has 3 states, 2 states have (on average 15.5) internal successors, (31), 3 states have internal predecessors, (31), 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-14 04:10:32,793 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-14 04:10:32,794 INFO L93 Difference]: Finished difference Result 218 states and 258 transitions. [2024-11-14 04:10:32,794 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-14 04:10:32,794 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 2 states have (on average 15.5) internal successors, (31), 3 states have internal predecessors, (31), 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 32 [2024-11-14 04:10:32,794 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-14 04:10:32,795 INFO L225 Difference]: With dead ends: 218 [2024-11-14 04:10:32,795 INFO L226 Difference]: Without dead ends: 218 [2024-11-14 04:10:32,795 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 31 GetRequests, 30 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-14 04:10:32,796 INFO L432 NwaCegarLoop]: 131 mSDtfsCounter, 12 mSDsluCounter, 85 mSDsCounter, 0 mSdLazyCounter, 55 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 12 SdHoareTripleChecker+Valid, 216 SdHoareTripleChecker+Invalid, 57 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 55 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2024-11-14 04:10:32,796 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [12 Valid, 216 Invalid, 57 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 55 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2024-11-14 04:10:32,797 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 218 states. [2024-11-14 04:10:32,800 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 218 to 218. [2024-11-14 04:10:32,801 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 218 states, 180 states have (on average 1.4) internal successors, (252), 216 states have internal predecessors, (252), 6 states have call successors, (6), 1 states have call predecessors, (6), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-14 04:10:32,802 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 218 states to 218 states and 258 transitions. [2024-11-14 04:10:32,802 INFO L78 Accepts]: Start accepts. Automaton has 218 states and 258 transitions. Word has length 32 [2024-11-14 04:10:32,802 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-14 04:10:32,802 INFO L471 AbstractCegarLoop]: Abstraction has 218 states and 258 transitions. [2024-11-14 04:10:32,802 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 2 states have (on average 15.5) internal successors, (31), 3 states have internal predecessors, (31), 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-14 04:10:32,803 INFO L276 IsEmpty]: Start isEmpty. Operand 218 states and 258 transitions. [2024-11-14 04:10:32,804 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 34 [2024-11-14 04:10:32,804 INFO L207 NwaCegarLoop]: Found error trace [2024-11-14 04:10:32,804 INFO L215 NwaCegarLoop]: trace histogram [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-14 04:10:32,808 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_2088ea77-1acf-4d0c-88ef-23be095c4621/bin/utaipan-verify-sOmjnqqW8E/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (18)] Forceful destruction successful, exit code 0 [2024-11-14 04:10:33,005 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 18 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_2088ea77-1acf-4d0c-88ef-23be095c4621/bin/utaipan-verify-sOmjnqqW8E/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-11-14 04:10:33,005 INFO L396 AbstractCegarLoop]: === Iteration 14 === Targeting ULTIMATE.startErr29REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [reach_errorErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 62 more)] === [2024-11-14 04:10:33,005 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-14 04:10:33,005 INFO L85 PathProgramCache]: Analyzing trace with hash 1818173130, now seen corresponding path program 1 times [2024-11-14 04:10:33,006 INFO L118 FreeRefinementEngine]: Executing refinement strategy WALRUS [2024-11-14 04:10:33,006 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [5528138] [2024-11-14 04:10:33,006 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-14 04:10:33,006 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-11-14 04:10:33,006 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_2088ea77-1acf-4d0c-88ef-23be095c4621/bin/utaipan-verify-sOmjnqqW8E/mathsat [2024-11-14 04:10:33,008 INFO L229 MonitoredProcess]: Starting monitored process 19 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_2088ea77-1acf-4d0c-88ef-23be095c4621/bin/utaipan-verify-sOmjnqqW8E/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2024-11-14 04:10:33,011 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_2088ea77-1acf-4d0c-88ef-23be095c4621/bin/utaipan-verify-sOmjnqqW8E/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (19)] Waiting until timeout for monitored process [2024-11-14 04:10:33,125 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-14 04:10:33,128 INFO L255 TraceCheckSpWp]: Trace formula consists of 146 conjuncts, 8 conjuncts are in the unsatisfiable core [2024-11-14 04:10:33,128 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-14 04:10:33,284 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2024-11-14 04:10:33,284 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-11-14 04:10:33,284 INFO L136 FreeRefinementEngine]: Strategy WALRUS found an infeasible trace [2024-11-14 04:10:33,284 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [5528138] [2024-11-14 04:10:33,284 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [5528138] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-14 04:10:33,284 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-14 04:10:33,284 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2024-11-14 04:10:33,285 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2033815714] [2024-11-14 04:10:33,285 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-14 04:10:33,285 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2024-11-14 04:10:33,285 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WALRUS [2024-11-14 04:10:33,285 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2024-11-14 04:10:33,285 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2024-11-14 04:10:33,285 INFO L87 Difference]: Start difference. First operand 218 states and 258 transitions. Second operand has 7 states, 7 states have (on average 4.571428571428571) internal successors, (32), 7 states have internal predecessors, (32), 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-14 04:10:34,097 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-14 04:10:34,097 INFO L93 Difference]: Finished difference Result 232 states and 273 transitions. [2024-11-14 04:10:34,097 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2024-11-14 04:10:34,098 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 4.571428571428571) internal successors, (32), 7 states have internal predecessors, (32), 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 33 [2024-11-14 04:10:34,098 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-14 04:10:34,099 INFO L225 Difference]: With dead ends: 232 [2024-11-14 04:10:34,099 INFO L226 Difference]: Without dead ends: 232 [2024-11-14 04:10:34,099 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 35 GetRequests, 27 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=23, Invalid=67, Unknown=0, NotChecked=0, Total=90 [2024-11-14 04:10:34,099 INFO L432 NwaCegarLoop]: 133 mSDtfsCounter, 14 mSDsluCounter, 451 mSDsCounter, 0 mSdLazyCounter, 276 mSolverCounterSat, 5 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.7s Time, 0 mProtectedPredicate, 0 mProtectedAction, 14 SdHoareTripleChecker+Valid, 584 SdHoareTripleChecker+Invalid, 281 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 5 IncrementalHoareTripleChecker+Valid, 276 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.8s IncrementalHoareTripleChecker+Time [2024-11-14 04:10:34,100 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [14 Valid, 584 Invalid, 281 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [5 Valid, 276 Invalid, 0 Unknown, 0 Unchecked, 0.8s Time] [2024-11-14 04:10:34,100 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 232 states. [2024-11-14 04:10:34,104 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 232 to 226. [2024-11-14 04:10:34,104 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 226 states, 188 states have (on average 1.3882978723404256) internal successors, (261), 224 states have internal predecessors, (261), 6 states have call successors, (6), 1 states have call predecessors, (6), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-14 04:10:34,105 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 226 states to 226 states and 267 transitions. [2024-11-14 04:10:34,105 INFO L78 Accepts]: Start accepts. Automaton has 226 states and 267 transitions. Word has length 33 [2024-11-14 04:10:34,106 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-14 04:10:34,106 INFO L471 AbstractCegarLoop]: Abstraction has 226 states and 267 transitions. [2024-11-14 04:10:34,106 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 4.571428571428571) internal successors, (32), 7 states have internal predecessors, (32), 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-14 04:10:34,106 INFO L276 IsEmpty]: Start isEmpty. Operand 226 states and 267 transitions. [2024-11-14 04:10:34,107 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 35 [2024-11-14 04:10:34,107 INFO L207 NwaCegarLoop]: Found error trace [2024-11-14 04:10:34,107 INFO L215 NwaCegarLoop]: trace histogram [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-14 04:10:34,110 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_2088ea77-1acf-4d0c-88ef-23be095c4621/bin/utaipan-verify-sOmjnqqW8E/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (19)] Ended with exit code 0 [2024-11-14 04:10:34,307 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 19 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_2088ea77-1acf-4d0c-88ef-23be095c4621/bin/utaipan-verify-sOmjnqqW8E/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-11-14 04:10:34,308 INFO L396 AbstractCegarLoop]: === Iteration 15 === Targeting reach_errorErr0ASSERT_VIOLATIONMEMORY_LEAK === [reach_errorErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 62 more)] === [2024-11-14 04:10:34,308 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-14 04:10:34,308 INFO L85 PathProgramCache]: Analyzing trace with hash -1742283929, now seen corresponding path program 1 times [2024-11-14 04:10:34,309 INFO L118 FreeRefinementEngine]: Executing refinement strategy WALRUS [2024-11-14 04:10:34,309 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [88349291] [2024-11-14 04:10:34,309 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-14 04:10:34,309 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-11-14 04:10:34,309 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_2088ea77-1acf-4d0c-88ef-23be095c4621/bin/utaipan-verify-sOmjnqqW8E/mathsat [2024-11-14 04:10:34,310 INFO L229 MonitoredProcess]: Starting monitored process 20 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_2088ea77-1acf-4d0c-88ef-23be095c4621/bin/utaipan-verify-sOmjnqqW8E/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2024-11-14 04:10:34,312 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_2088ea77-1acf-4d0c-88ef-23be095c4621/bin/utaipan-verify-sOmjnqqW8E/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (20)] Waiting until timeout for monitored process [2024-11-14 04:10:34,431 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-14 04:10:34,436 INFO L255 TraceCheckSpWp]: Trace formula consists of 151 conjuncts, 29 conjuncts are in the unsatisfiable core [2024-11-14 04:10:34,438 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-14 04:10:34,444 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 7 [2024-11-14 04:10:34,543 INFO L349 Elim1Store]: treesize reduction 6, result has 40.0 percent of original size [2024-11-14 04:10:34,543 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 13 treesize of output 13 [2024-11-14 04:10:34,589 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 7 [2024-11-14 04:10:34,610 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 15 treesize of output 1 [2024-11-14 04:10:34,803 INFO L349 Elim1Store]: treesize reduction 17, result has 22.7 percent of original size [2024-11-14 04:10:34,803 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 1 new quantified variables, introduced 1 case distinctions, treesize of input 24 treesize of output 17 [2024-11-14 04:10:34,823 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-11-14 04:10:34,824 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 16 treesize of output 11 [2024-11-14 04:10:34,935 INFO L349 Elim1Store]: treesize reduction 19, result has 20.8 percent of original size [2024-11-14 04:10:34,935 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 60 treesize of output 53 [2024-11-14 04:10:34,942 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 11 [2024-11-14 04:10:34,956 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 24 treesize of output 11 [2024-11-14 04:10:35,215 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 27 treesize of output 15 [2024-11-14 04:10:35,221 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 7 treesize of output 3 [2024-11-14 04:10:35,317 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-14 04:10:35,317 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-11-14 04:10:35,528 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 46 treesize of output 26 [2024-11-14 04:10:35,539 WARN L851 $PredicateComparison]: unable to prove that (and (forall ((v_ArrVal_572 (Array (_ BitVec 32) (_ BitVec 32)))) (= (select (select (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_~x~0#1.base| v_ArrVal_572) |c_ULTIMATE.start_main_~head~0#1.base|) |c_ULTIMATE.start_main_~head~0#1.offset|) |c_ULTIMATE.start_main_~x~0#1.base|)) (forall ((v_ArrVal_574 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_ULTIMATE.start_main_~x~0#1.offset| (select (select (store |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_main_~x~0#1.base| v_ArrVal_574) |c_ULTIMATE.start_main_~head~0#1.base|) |c_ULTIMATE.start_main_~head~0#1.offset|)))) is different from false [2024-11-14 04:10:35,684 WARN L851 $PredicateComparison]: unable to prove that (let ((.cse0 (select (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_~x~0#1.base|) |c_ULTIMATE.start_main_~x~0#1.offset|))) (and (forall ((v_ArrVal_572 (Array (_ BitVec 32) (_ BitVec 32)))) (= .cse0 (select (select (store |c_#memory_$Pointer$.base| .cse0 v_ArrVal_572) |c_ULTIMATE.start_main_~head~0#1.base|) |c_ULTIMATE.start_main_~head~0#1.offset|))) (forall ((v_ArrVal_574 (Array (_ BitVec 32) (_ BitVec 32)))) (= (select (select |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_main_~x~0#1.base|) |c_ULTIMATE.start_main_~x~0#1.offset|) (select (select (store |c_#memory_$Pointer$.offset| .cse0 v_ArrVal_574) |c_ULTIMATE.start_main_~head~0#1.base|) |c_ULTIMATE.start_main_~head~0#1.offset|))))) is different from false [2024-11-14 04:10:35,704 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-11-14 04:10:35,704 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 18 treesize of output 19 [2024-11-14 04:10:35,718 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-11-14 04:10:35,719 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 30 treesize of output 33 [2024-11-14 04:10:35,732 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 5 treesize of output 3 [2024-11-14 04:10:35,740 INFO L349 Elim1Store]: treesize reduction 7, result has 12.5 percent of original size [2024-11-14 04:10:35,741 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 18 treesize of output 1 [2024-11-14 04:10:35,946 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-14 04:10:35,946 INFO L136 FreeRefinementEngine]: Strategy WALRUS found an infeasible trace [2024-11-14 04:10:35,946 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [88349291] [2024-11-14 04:10:35,946 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [88349291] provided 0 perfect and 2 imperfect interpolant sequences [2024-11-14 04:10:35,946 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleCvc4 [560025038] [2024-11-14 04:10:35,946 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-14 04:10:35,946 INFO L173 SolverBuilder]: Constructing external solver with command: cvc4 --incremental --print-success --lang smt [2024-11-14 04:10:35,946 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_2088ea77-1acf-4d0c-88ef-23be095c4621/bin/utaipan-verify-sOmjnqqW8E/cvc4 [2024-11-14 04:10:35,948 INFO L229 MonitoredProcess]: Starting monitored process 21 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_2088ea77-1acf-4d0c-88ef-23be095c4621/bin/utaipan-verify-sOmjnqqW8E/cvc4 --incremental --print-success --lang smt (exit command is (exit), workingDir is null) [2024-11-14 04:10:35,952 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_2088ea77-1acf-4d0c-88ef-23be095c4621/bin/utaipan-verify-sOmjnqqW8E/cvc4 --incremental --print-success --lang smt (21)] Waiting until timeout for monitored process [2024-11-14 04:10:36,176 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-14 04:10:36,179 INFO L255 TraceCheckSpWp]: Trace formula consists of 151 conjuncts, 22 conjuncts are in the unsatisfiable core [2024-11-14 04:10:36,181 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-14 04:10:36,186 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 7 [2024-11-14 04:10:36,200 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 7 [2024-11-14 04:10:36,373 INFO L349 Elim1Store]: treesize reduction 6, result has 40.0 percent of original size [2024-11-14 04:10:36,373 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 13 treesize of output 13 [2024-11-14 04:10:36,459 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 23 treesize of output 11 [2024-11-14 04:10:36,472 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 15 treesize of output 1 [2024-11-14 04:10:36,569 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 16 treesize of output 8 [2024-11-14 04:10:36,710 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 16 treesize of output 11 [2024-11-14 04:10:36,751 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 16 treesize of output 11 [2024-11-14 04:10:36,982 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-14 04:10:36,982 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-11-14 04:10:37,161 WARN L851 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_616 (Array (_ BitVec 32) (_ BitVec 32)))) (= (_ bv0 32) (select (select (store |c_#memory_int| |c_ULTIMATE.start_main_~x~0#1.base| v_ArrVal_616) |c_ULTIMATE.start_main_~head~0#1.base|) (bvadd |c_ULTIMATE.start_main_~head~0#1.offset| (_ bv4 32))))) is different from false [2024-11-14 04:10:37,428 WARN L851 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_616 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_613 (Array (_ BitVec 32) (_ BitVec 32)))) (or (not (= v_ArrVal_613 (store (select |c_#memory_int| |c_ULTIMATE.start_main_~x~0#1.base|) |c_ULTIMATE.start_main_~x~0#1.offset| (select v_ArrVal_613 |c_ULTIMATE.start_main_~x~0#1.offset|)))) (= (select (select (store (store |c_#memory_int| |c_ULTIMATE.start_main_~x~0#1.base| v_ArrVal_613) |c_ULTIMATE.start_main_#t~malloc3#1.base| v_ArrVal_616) |c_ULTIMATE.start_main_~head~0#1.base|) (bvadd |c_ULTIMATE.start_main_~head~0#1.offset| (_ bv4 32))) (_ bv0 32)))) is different from false [2024-11-14 04:10:37,455 WARN L851 $PredicateComparison]: unable to prove that (forall ((|v_ULTIMATE.start_main_#t~malloc3#1.base_37| (_ BitVec 32))) (or (forall ((v_ArrVal_616 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_613 (Array (_ BitVec 32) (_ BitVec 32)))) (or (not (= v_ArrVal_613 (store (select |c_#memory_int| |c_ULTIMATE.start_main_~x~0#1.base|) |c_ULTIMATE.start_main_~x~0#1.offset| (select v_ArrVal_613 |c_ULTIMATE.start_main_~x~0#1.offset|)))) (= (_ bv0 32) (select (select (store (store |c_#memory_int| |c_ULTIMATE.start_main_~x~0#1.base| v_ArrVal_613) |v_ULTIMATE.start_main_#t~malloc3#1.base_37| v_ArrVal_616) |c_ULTIMATE.start_main_~head~0#1.base|) (bvadd |c_ULTIMATE.start_main_~head~0#1.offset| (_ bv4 32)))))) (not (= (_ bv0 1) (select |c_#valid| |v_ULTIMATE.start_main_#t~malloc3#1.base_37|))))) is different from false [2024-11-14 04:10:37,497 WARN L851 $PredicateComparison]: unable to prove that (forall ((|v_ULTIMATE.start_main_#t~malloc3#1.base_37| (_ BitVec 32)) (v_ArrVal_616 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_613 (Array (_ BitVec 32) (_ BitVec 32)))) (or (not (= v_ArrVal_613 (store (select |c_#memory_int| |c_ULTIMATE.start_main_~head~0#1.base|) |c_ULTIMATE.start_main_~head~0#1.offset| (select v_ArrVal_613 |c_ULTIMATE.start_main_~head~0#1.offset|)))) (= (_ bv0 32) (select (select (store (store |c_#memory_int| |c_ULTIMATE.start_main_~head~0#1.base| v_ArrVal_613) |v_ULTIMATE.start_main_#t~malloc3#1.base_37| v_ArrVal_616) |c_ULTIMATE.start_main_~head~0#1.base|) (bvadd |c_ULTIMATE.start_main_~head~0#1.offset| (_ bv4 32)))) (not (= (_ bv0 1) (select |c_#valid| |v_ULTIMATE.start_main_#t~malloc3#1.base_37|))))) is different from false [2024-11-14 04:10:37,507 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 38 [2024-11-14 04:10:37,522 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 7 treesize of output 3 [2024-11-14 04:10:37,527 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 2 not checked. [2024-11-14 04:10:37,528 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleCvc4 [560025038] provided 0 perfect and 2 imperfect interpolant sequences [2024-11-14 04:10:37,528 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [753192862] [2024-11-14 04:10:37,528 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-14 04:10:37,528 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-14 04:10:37,528 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_2088ea77-1acf-4d0c-88ef-23be095c4621/bin/utaipan-verify-sOmjnqqW8E/z3 [2024-11-14 04:10:37,532 INFO L229 MonitoredProcess]: Starting monitored process 22 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_2088ea77-1acf-4d0c-88ef-23be095c4621/bin/utaipan-verify-sOmjnqqW8E/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-11-14 04:10:37,533 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_2088ea77-1acf-4d0c-88ef-23be095c4621/bin/utaipan-verify-sOmjnqqW8E/z3 -smt2 -in SMTLIB2_COMPLIANT=true (22)] Waiting until timeout for monitored process [2024-11-14 04:10:37,646 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-14 04:10:37,648 INFO L255 TraceCheckSpWp]: Trace formula consists of 151 conjuncts, 27 conjuncts are in the unsatisfiable core [2024-11-14 04:10:37,651 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-14 04:10:37,796 INFO L349 Elim1Store]: treesize reduction 6, result has 40.0 percent of original size [2024-11-14 04:10:37,796 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 12 treesize of output 12 [2024-11-14 04:10:37,896 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 7 [2024-11-14 04:10:37,908 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 15 treesize of output 1