./Ultimate.py --spec ../../sv-benchmarks/c/properties/valid-memsafety.prp --file ../../sv-benchmarks/c/weaver/bench-exp2x3.wvr.c --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for memory safety (deref-memtrack) Using default analysis Version 0e0057cc Calling Ultimate with: /usr/lib/jvm/java-1.11.0-openjdk-amd64/bin/java -Dosgi.configuration.area=/tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_9284ea18-4b33-4bf4-84e1-1ddf9a674761/bin/utaipan-verify-nQ1chXbOIh/data/config -Xmx15G -Xms4m -jar /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_9284ea18-4b33-4bf4-84e1-1ddf9a674761/bin/utaipan-verify-nQ1chXbOIh/plugins/org.eclipse.equinox.launcher_1.5.800.v20200727-1323.jar -data @noDefault -ultimatedata /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_9284ea18-4b33-4bf4-84e1-1ddf9a674761/bin/utaipan-verify-nQ1chXbOIh/data -tc /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_9284ea18-4b33-4bf4-84e1-1ddf9a674761/bin/utaipan-verify-nQ1chXbOIh/config/TaipanMemDerefMemtrack.xml -i ../../sv-benchmarks/c/weaver/bench-exp2x3.wvr.c -s /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_9284ea18-4b33-4bf4-84e1-1ddf9a674761/bin/utaipan-verify-nQ1chXbOIh/config/svcomp-DerefFreeMemtrack-32bit-Taipan_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_9284ea18-4b33-4bf4-84e1-1ddf9a674761/bin/utaipan-verify-nQ1chXbOIh --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 f25d9c7e70f7f3d19e85c7cfc6427443102f5451f704dd6a19dd9a78d021a612 --- Real Ultimate output --- This is Ultimate 0.2.4-dev-0e0057c [2023-12-02 13:56:40,480 INFO L188 SettingsManager]: Resetting all preferences to default values... [2023-12-02 13:56:40,546 INFO L114 SettingsManager]: Loading settings from /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_9284ea18-4b33-4bf4-84e1-1ddf9a674761/bin/utaipan-verify-nQ1chXbOIh/config/svcomp-DerefFreeMemtrack-32bit-Taipan_Default.epf [2023-12-02 13:56:40,550 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2023-12-02 13:56:40,551 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2023-12-02 13:56:40,582 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2023-12-02 13:56:40,583 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2023-12-02 13:56:40,584 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2023-12-02 13:56:40,585 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2023-12-02 13:56:40,585 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2023-12-02 13:56:40,586 INFO L153 SettingsManager]: * User list type=DISABLED [2023-12-02 13:56:40,586 INFO L151 SettingsManager]: Preferences of Abstract Interpretation differ from their defaults: [2023-12-02 13:56:40,587 INFO L153 SettingsManager]: * Explicit value domain=true [2023-12-02 13:56:40,587 INFO L153 SettingsManager]: * Abstract domain for RCFG-of-the-future=PoormanAbstractDomain [2023-12-02 13:56:40,588 INFO L153 SettingsManager]: * Octagon Domain=false [2023-12-02 13:56:40,588 INFO L153 SettingsManager]: * Abstract domain=CompoundDomain [2023-12-02 13:56:40,589 INFO L153 SettingsManager]: * Check feasibility of abstract posts with an SMT solver=true [2023-12-02 13:56:40,590 INFO L153 SettingsManager]: * Use the RCFG-of-the-future interface=true [2023-12-02 13:56:40,590 INFO L153 SettingsManager]: * Interval Domain=false [2023-12-02 13:56:40,591 INFO L151 SettingsManager]: Preferences of Sifa differ from their defaults: [2023-12-02 13:56:40,592 INFO L153 SettingsManager]: * Call Summarizer=TopInputCallSummarizer [2023-12-02 13:56:40,592 INFO L153 SettingsManager]: * Simplification Technique=POLY_PAC [2023-12-02 13:56:40,593 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2023-12-02 13:56:40,593 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2023-12-02 13:56:40,594 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2023-12-02 13:56:40,602 INFO L153 SettingsManager]: * sizeof long=4 [2023-12-02 13:56:40,603 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2023-12-02 13:56:40,603 INFO L153 SettingsManager]: * sizeof POINTER=4 [2023-12-02 13:56:40,603 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2023-12-02 13:56:40,604 INFO L153 SettingsManager]: * Check for the main procedure if all allocated memory was freed=true [2023-12-02 13:56:40,604 INFO L153 SettingsManager]: * Bitprecise bitfields=true [2023-12-02 13:56:40,605 INFO L153 SettingsManager]: * SV-COMP memtrack compatibility mode=true [2023-12-02 13:56:40,605 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2023-12-02 13:56:40,605 INFO L153 SettingsManager]: * Adapt memory model on pointer casts if necessary=true [2023-12-02 13:56:40,606 INFO L153 SettingsManager]: * Check unreachability of reach_error function=false [2023-12-02 13:56:40,606 INFO L153 SettingsManager]: * sizeof long double=12 [2023-12-02 13:56:40,607 INFO L153 SettingsManager]: * Use constant arrays=true [2023-12-02 13:56:40,607 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2023-12-02 13:56:40,607 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2023-12-02 13:56:40,608 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2023-12-02 13:56:40,608 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2023-12-02 13:56:40,608 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2023-12-02 13:56:40,609 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2023-12-02 13:56:40,609 INFO L153 SettingsManager]: * Trace refinement strategy=SIFA_TAIPAN [2023-12-02 13:56:40,609 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2023-12-02 13:56:40,609 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2023-12-02 13:56:40,609 INFO L153 SettingsManager]: * Trace refinement exception blacklist=NONE [2023-12-02 13:56:40,610 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2023-12-02 13:56:40,610 INFO L153 SettingsManager]: * Abstract interpretation Mode=USE_PREDICATES WARNING: An illegal reflective access operation has occurred WARNING: Illegal reflective access by com.sun.xml.bind.v2.runtime.reflect.opt.Injector$1 (file:/tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_9284ea18-4b33-4bf4-84e1-1ddf9a674761/bin/utaipan-verify-nQ1chXbOIh/plugins/com.sun.xml.bind_2.2.0.v201505121915.jar) to method java.lang.ClassLoader.defineClass(java.lang.String,byte[],int,int) WARNING: Please consider reporting this to the maintainers of com.sun.xml.bind.v2.runtime.reflect.opt.Injector$1 WARNING: Use --illegal-access=warn to enable warnings of further illegal reflective access operations WARNING: All illegal access operations will be denied in a future release Applying setting for plugin de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator: Entry function -> main Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Witness directory -> /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_9284ea18-4b33-4bf4-84e1-1ddf9a674761/bin/utaipan-verify-nQ1chXbOIh 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 -> f25d9c7e70f7f3d19e85c7cfc6427443102f5451f704dd6a19dd9a78d021a612 [2023-12-02 13:56:40,836 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2023-12-02 13:56:40,857 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2023-12-02 13:56:40,860 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2023-12-02 13:56:40,861 INFO L270 PluginConnector]: Initializing CDTParser... [2023-12-02 13:56:40,862 INFO L274 PluginConnector]: CDTParser initialized [2023-12-02 13:56:40,863 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_9284ea18-4b33-4bf4-84e1-1ddf9a674761/bin/utaipan-verify-nQ1chXbOIh/../../sv-benchmarks/c/weaver/bench-exp2x3.wvr.c [2023-12-02 13:56:43,703 INFO L533 CDTParser]: Created temporary CDT project at NULL [2023-12-02 13:56:43,871 INFO L384 CDTParser]: Found 1 translation units. [2023-12-02 13:56:43,872 INFO L180 CDTParser]: Scanning /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_9284ea18-4b33-4bf4-84e1-1ddf9a674761/sv-benchmarks/c/weaver/bench-exp2x3.wvr.c [2023-12-02 13:56:43,880 INFO L427 CDTParser]: About to delete temporary CDT project at /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_9284ea18-4b33-4bf4-84e1-1ddf9a674761/bin/utaipan-verify-nQ1chXbOIh/data/be41dfb80/0ab28d420fec4715a548819135654bc8/FLAG1923fd90f [2023-12-02 13:56:43,896 INFO L435 CDTParser]: Successfully deleted /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_9284ea18-4b33-4bf4-84e1-1ddf9a674761/bin/utaipan-verify-nQ1chXbOIh/data/be41dfb80/0ab28d420fec4715a548819135654bc8 [2023-12-02 13:56:43,899 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2023-12-02 13:56:43,900 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2023-12-02 13:56:43,902 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2023-12-02 13:56:43,902 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2023-12-02 13:56:43,907 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2023-12-02 13:56:43,908 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 02.12 01:56:43" (1/1) ... [2023-12-02 13:56:43,909 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@3268f41a and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.12 01:56:43, skipping insertion in model container [2023-12-02 13:56:43,909 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 02.12 01:56:43" (1/1) ... [2023-12-02 13:56:43,935 INFO L177 MainTranslator]: Built tables and reachable declarations [2023-12-02 13:56:44,097 INFO L209 PostProcessor]: Analyzing one entry point: main [2023-12-02 13:56:44,108 INFO L202 MainTranslator]: Completed pre-run [2023-12-02 13:56:44,132 INFO L209 PostProcessor]: Analyzing one entry point: main [2023-12-02 13:56:44,148 INFO L206 MainTranslator]: Completed translation [2023-12-02 13:56:44,148 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.12 01:56:44 WrapperNode [2023-12-02 13:56:44,149 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2023-12-02 13:56:44,150 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2023-12-02 13:56:44,150 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2023-12-02 13:56:44,150 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2023-12-02 13:56:44,157 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.12 01:56:44" (1/1) ... [2023-12-02 13:56:44,165 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.12 01:56:44" (1/1) ... [2023-12-02 13:56:44,189 INFO L138 Inliner]: procedures = 20, calls = 33, calls flagged for inlining = 5, calls inlined = 5, statements flattened = 97 [2023-12-02 13:56:44,189 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2023-12-02 13:56:44,190 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2023-12-02 13:56:44,190 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2023-12-02 13:56:44,190 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2023-12-02 13:56:44,200 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.12 01:56:44" (1/1) ... [2023-12-02 13:56:44,200 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.12 01:56:44" (1/1) ... [2023-12-02 13:56:44,204 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.12 01:56:44" (1/1) ... [2023-12-02 13:56:44,204 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.12 01:56:44" (1/1) ... [2023-12-02 13:56:44,210 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.12 01:56:44" (1/1) ... [2023-12-02 13:56:44,214 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.12 01:56:44" (1/1) ... [2023-12-02 13:56:44,216 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.12 01:56:44" (1/1) ... [2023-12-02 13:56:44,217 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.12 01:56:44" (1/1) ... [2023-12-02 13:56:44,220 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2023-12-02 13:56:44,221 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2023-12-02 13:56:44,222 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2023-12-02 13:56:44,222 INFO L274 PluginConnector]: RCFGBuilder initialized [2023-12-02 13:56:44,223 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.12 01:56:44" (1/1) ... [2023-12-02 13:56:44,229 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2023-12-02 13:56:44,241 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_9284ea18-4b33-4bf4-84e1-1ddf9a674761/bin/utaipan-verify-nQ1chXbOIh/z3 [2023-12-02 13:56:44,259 INFO L229 MonitoredProcess]: Starting monitored process 1 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_9284ea18-4b33-4bf4-84e1-1ddf9a674761/bin/utaipan-verify-nQ1chXbOIh/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (exit command is (exit), workingDir is null) [2023-12-02 13:56:44,262 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_9284ea18-4b33-4bf4-84e1-1ddf9a674761/bin/utaipan-verify-nQ1chXbOIh/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (1)] Waiting until timeout for monitored process [2023-12-02 13:56:44,290 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2023-12-02 13:56:44,290 INFO L130 BoogieDeclarations]: Found specification of procedure thread1 [2023-12-02 13:56:44,291 INFO L138 BoogieDeclarations]: Found implementation of procedure thread1 [2023-12-02 13:56:44,291 INFO L130 BoogieDeclarations]: Found specification of procedure thread2 [2023-12-02 13:56:44,291 INFO L138 BoogieDeclarations]: Found implementation of procedure thread2 [2023-12-02 13:56:44,291 INFO L130 BoogieDeclarations]: Found specification of procedure thread3 [2023-12-02 13:56:44,291 INFO L138 BoogieDeclarations]: Found implementation of procedure thread3 [2023-12-02 13:56:44,291 INFO L130 BoogieDeclarations]: Found specification of procedure thread4 [2023-12-02 13:56:44,292 INFO L138 BoogieDeclarations]: Found implementation of procedure thread4 [2023-12-02 13:56:44,292 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2023-12-02 13:56:44,292 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2023-12-02 13:56:44,292 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2023-12-02 13:56:44,292 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2023-12-02 13:56:44,292 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2023-12-02 13:56:44,293 INFO L130 BoogieDeclarations]: Found specification of procedure read~int [2023-12-02 13:56:44,293 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2023-12-02 13:56:44,294 WARN L213 CfgBuilder]: User set CodeBlockSize to LoopFreeBlock but program contains fork statements. Overwriting the user preferences and setting CodeBlockSize to OneNontrivialStatement [2023-12-02 13:56:44,398 INFO L241 CfgBuilder]: Building ICFG [2023-12-02 13:56:44,401 INFO L267 CfgBuilder]: Building CFG for each procedure with an implementation [2023-12-02 13:56:44,681 INFO L282 CfgBuilder]: Performing block encoding [2023-12-02 13:56:44,864 INFO L304 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2023-12-02 13:56:44,865 INFO L309 CfgBuilder]: Removed 4 assume(true) statements. [2023-12-02 13:56:44,865 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 02.12 01:56:44 BoogieIcfgContainer [2023-12-02 13:56:44,866 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2023-12-02 13:56:44,869 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2023-12-02 13:56:44,869 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2023-12-02 13:56:44,872 INFO L274 PluginConnector]: TraceAbstraction initialized [2023-12-02 13:56:44,873 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 02.12 01:56:43" (1/3) ... [2023-12-02 13:56:44,873 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@2cd683a4 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 02.12 01:56:44, skipping insertion in model container [2023-12-02 13:56:44,874 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.12 01:56:44" (2/3) ... [2023-12-02 13:56:44,874 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@2cd683a4 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 02.12 01:56:44, skipping insertion in model container [2023-12-02 13:56:44,874 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 02.12 01:56:44" (3/3) ... [2023-12-02 13:56:44,876 INFO L112 eAbstractionObserver]: Analyzing ICFG bench-exp2x3.wvr.c [2023-12-02 13:56:44,896 INFO L203 ceAbstractionStarter]: Automizer settings: Hoare:false NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2023-12-02 13:56:44,897 INFO L162 ceAbstractionStarter]: Applying trace abstraction to program that has 18 error locations. [2023-12-02 13:56:44,897 INFO L514 ceAbstractionStarter]: Constructing petrified ICFG for 1 thread instances. [2023-12-02 13:56:44,986 INFO L144 ThreadInstanceAdder]: Constructed 4 joinOtherThreadTransitions. [2023-12-02 13:56:45,011 INFO L113 iNet2FiniteAutomaton]: Start petriNet2FiniteAutomaton. Operand has 70 places, 61 transitions, 150 flow [2023-12-02 13:56:45,121 INFO L135 iNet2FiniteAutomaton]: Finished petriNet2FiniteAutomaton. Result has 805 states, 787 states have (on average 4.27445997458704) internal successors, (3364), 804 states have internal predecessors, (3364), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-12-02 13:56:45,137 INFO L356 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2023-12-02 13:56:45,143 INFO L357 AbstractCegarLoop]: Settings: SEPARATE_VIOLATION_CHECK=true, mInterprocedural=true, mMaxIterations=1000000, mWatchIteration=1000000, mArtifact=RCFG, mInterpolation=FPandBP, mInterpolantAutomaton=STRAIGHT_LINE, mDumpAutomata=false, mAutomataFormat=ATS_NUMERATE, mDumpPath=., mDeterminiation=PREDICATE_ABSTRACTION, mMinimize=MINIMIZE_SEVPA, mHoare=false, mAutomataTypeConcurrency=FINITE_AUTOMATA, mHoareTripleChecks=INCREMENTAL, mHoareAnnotationPositions=All, mDumpOnlyReuseAutomata=false, mLimitTraceHistogram=0, mErrorLocTimeLimit=0, mLimitPathProgramCount=0, mCollectInterpolantStatistics=true, mHeuristicEmptinessCheck=false, mHeuristicEmptinessCheckAStarHeuristic=ZERO, mHeuristicEmptinessCheckAStarHeuristicRandomSeed=1337, mHeuristicEmptinessCheckSmtFeatureScoringMethod=DAGSIZE, mSMTFeatureExtraction=false, mSMTFeatureExtractionDumpPath=., mOverrideInterpolantAutomaton=false, mMcrInterpolantMethod=WP, mPorIndependenceSettings=[Lde.uni_freiburg.informatik.ultimate.lib.tracecheckerutils.partialorder.independence.IndependenceSettings;@74a6921a, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2023-12-02 13:56:45,143 INFO L358 AbstractCegarLoop]: Starting to check reachability of 22 error locations. [2023-12-02 13:56:45,148 INFO L276 IsEmpty]: Start isEmpty. Operand has 805 states, 787 states have (on average 4.27445997458704) internal successors, (3364), 804 states have internal predecessors, (3364), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-12-02 13:56:45,153 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 3 [2023-12-02 13:56:45,153 INFO L187 NwaCegarLoop]: Found error trace [2023-12-02 13:56:45,154 INFO L195 NwaCegarLoop]: trace histogram [1, 1] [2023-12-02 13:56:45,154 INFO L420 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 19 more)] === [2023-12-02 13:56:45,160 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-12-02 13:56:45,160 INFO L85 PathProgramCache]: Analyzing trace with hash 11063, now seen corresponding path program 1 times [2023-12-02 13:56:45,169 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2023-12-02 13:56:45,170 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [431590105] [2023-12-02 13:56:45,170 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-02 13:56:45,170 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-12-02 13:56:45,283 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-02 13:56:45,547 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-12-02 13:56:45,548 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2023-12-02 13:56:45,548 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [431590105] [2023-12-02 13:56:45,549 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [431590105] provided 1 perfect and 0 imperfect interpolant sequences [2023-12-02 13:56:45,549 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-12-02 13:56:45,549 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2023-12-02 13:56:45,551 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1007983936] [2023-12-02 13:56:45,552 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-12-02 13:56:45,555 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2023-12-02 13:56:45,556 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2023-12-02 13:56:45,584 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2023-12-02 13:56:45,585 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2023-12-02 13:56:45,589 INFO L87 Difference]: Start difference. First operand has 805 states, 787 states have (on average 4.27445997458704) internal successors, (3364), 804 states have internal predecessors, (3364), 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) Second operand has 3 states, 2 states have (on average 1.0) internal successors, (2), 2 states have internal predecessors, (2), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-12-02 13:56:45,713 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-12-02 13:56:45,713 INFO L93 Difference]: Finished difference Result 721 states and 2956 transitions. [2023-12-02 13:56:45,714 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2023-12-02 13:56:45,716 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 2 states have (on average 1.0) internal successors, (2), 2 states have internal predecessors, (2), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 2 [2023-12-02 13:56:45,716 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-12-02 13:56:45,742 INFO L225 Difference]: With dead ends: 721 [2023-12-02 13:56:45,743 INFO L226 Difference]: Without dead ends: 721 [2023-12-02 13:56:45,744 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 1 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2023-12-02 13:56:45,749 INFO L413 NwaCegarLoop]: 14 mSDtfsCounter, 51 mSDsluCounter, 0 mSDsCounter, 0 mSdLazyCounter, 38 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 51 SdHoareTripleChecker+Valid, 14 SdHoareTripleChecker+Invalid, 39 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 38 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2023-12-02 13:56:45,750 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [51 Valid, 14 Invalid, 39 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 38 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2023-12-02 13:56:45,771 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 721 states. [2023-12-02 13:56:45,843 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 721 to 721. [2023-12-02 13:56:45,848 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 721 states, 706 states have (on average 4.186968838526912) internal successors, (2956), 720 states have internal predecessors, (2956), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-12-02 13:56:45,855 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 721 states to 721 states and 2956 transitions. [2023-12-02 13:56:45,857 INFO L78 Accepts]: Start accepts. Automaton has 721 states and 2956 transitions. Word has length 2 [2023-12-02 13:56:45,857 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-12-02 13:56:45,857 INFO L495 AbstractCegarLoop]: Abstraction has 721 states and 2956 transitions. [2023-12-02 13:56:45,857 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 2 states have (on average 1.0) internal successors, (2), 2 states have internal predecessors, (2), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-12-02 13:56:45,857 INFO L276 IsEmpty]: Start isEmpty. Operand 721 states and 2956 transitions. [2023-12-02 13:56:45,858 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 3 [2023-12-02 13:56:45,858 INFO L187 NwaCegarLoop]: Found error trace [2023-12-02 13:56:45,858 INFO L195 NwaCegarLoop]: trace histogram [1, 1] [2023-12-02 13:56:45,858 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2023-12-02 13:56:45,859 INFO L420 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 19 more)] === [2023-12-02 13:56:45,859 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-12-02 13:56:45,860 INFO L85 PathProgramCache]: Analyzing trace with hash 11064, now seen corresponding path program 1 times [2023-12-02 13:56:45,860 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2023-12-02 13:56:45,860 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1186256875] [2023-12-02 13:56:45,860 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-02 13:56:45,861 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-12-02 13:56:45,885 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-02 13:56:46,043 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-12-02 13:56:46,044 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2023-12-02 13:56:46,044 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1186256875] [2023-12-02 13:56:46,044 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1186256875] provided 1 perfect and 0 imperfect interpolant sequences [2023-12-02 13:56:46,044 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-12-02 13:56:46,045 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2023-12-02 13:56:46,045 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [605114526] [2023-12-02 13:56:46,045 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-12-02 13:56:46,046 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2023-12-02 13:56:46,046 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2023-12-02 13:56:46,047 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2023-12-02 13:56:46,047 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2023-12-02 13:56:46,047 INFO L87 Difference]: Start difference. First operand 721 states and 2956 transitions. Second operand has 3 states, 2 states have (on average 1.0) internal successors, (2), 2 states have internal predecessors, (2), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-12-02 13:56:46,122 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-12-02 13:56:46,122 INFO L93 Difference]: Finished difference Result 639 states and 2550 transitions. [2023-12-02 13:56:46,123 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2023-12-02 13:56:46,123 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 2 states have (on average 1.0) internal successors, (2), 2 states have internal predecessors, (2), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 2 [2023-12-02 13:56:46,123 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-12-02 13:56:46,131 INFO L225 Difference]: With dead ends: 639 [2023-12-02 13:56:46,132 INFO L226 Difference]: Without dead ends: 639 [2023-12-02 13:56:46,132 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 1 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2023-12-02 13:56:46,134 INFO L413 NwaCegarLoop]: 14 mSDtfsCounter, 49 mSDsluCounter, 0 mSDsCounter, 0 mSdLazyCounter, 36 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 49 SdHoareTripleChecker+Valid, 14 SdHoareTripleChecker+Invalid, 37 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 36 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2023-12-02 13:56:46,135 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [49 Valid, 14 Invalid, 37 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 36 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2023-12-02 13:56:46,138 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 639 states. [2023-12-02 13:56:46,171 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 639 to 639. [2023-12-02 13:56:46,173 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 639 states, 626 states have (on average 4.073482428115016) internal successors, (2550), 638 states have internal predecessors, (2550), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-12-02 13:56:46,176 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 639 states to 639 states and 2550 transitions. [2023-12-02 13:56:46,177 INFO L78 Accepts]: Start accepts. Automaton has 639 states and 2550 transitions. Word has length 2 [2023-12-02 13:56:46,177 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-12-02 13:56:46,177 INFO L495 AbstractCegarLoop]: Abstraction has 639 states and 2550 transitions. [2023-12-02 13:56:46,177 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 2 states have (on average 1.0) internal successors, (2), 2 states have internal predecessors, (2), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-12-02 13:56:46,178 INFO L276 IsEmpty]: Start isEmpty. Operand 639 states and 2550 transitions. [2023-12-02 13:56:46,178 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 6 [2023-12-02 13:56:46,178 INFO L187 NwaCegarLoop]: Found error trace [2023-12-02 13:56:46,178 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1] [2023-12-02 13:56:46,178 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2023-12-02 13:56:46,179 INFO L420 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 19 more)] === [2023-12-02 13:56:46,179 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-12-02 13:56:46,179 INFO L85 PathProgramCache]: Analyzing trace with hash 329901915, now seen corresponding path program 1 times [2023-12-02 13:56:46,180 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2023-12-02 13:56:46,180 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [886491863] [2023-12-02 13:56:46,180 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-02 13:56:46,180 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-12-02 13:56:46,196 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-02 13:56:46,259 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-12-02 13:56:46,260 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2023-12-02 13:56:46,260 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [886491863] [2023-12-02 13:56:46,260 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [886491863] provided 1 perfect and 0 imperfect interpolant sequences [2023-12-02 13:56:46,260 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-12-02 13:56:46,260 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2023-12-02 13:56:46,261 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1725448799] [2023-12-02 13:56:46,261 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-12-02 13:56:46,261 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2023-12-02 13:56:46,262 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2023-12-02 13:56:46,262 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2023-12-02 13:56:46,262 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2023-12-02 13:56:46,263 INFO L87 Difference]: Start difference. First operand 639 states and 2550 transitions. Second operand has 3 states, 2 states have (on average 2.5) internal successors, (5), 2 states have internal predecessors, (5), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-12-02 13:56:46,330 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-12-02 13:56:46,330 INFO L93 Difference]: Finished difference Result 609 states and 2436 transitions. [2023-12-02 13:56:46,331 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2023-12-02 13:56:46,331 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 2 states have (on average 2.5) internal successors, (5), 2 states have internal predecessors, (5), 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 5 [2023-12-02 13:56:46,331 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-12-02 13:56:46,338 INFO L225 Difference]: With dead ends: 609 [2023-12-02 13:56:46,338 INFO L226 Difference]: Without dead ends: 609 [2023-12-02 13:56:46,339 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 1 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2023-12-02 13:56:46,340 INFO L413 NwaCegarLoop]: 12 mSDtfsCounter, 44 mSDsluCounter, 0 mSDsCounter, 0 mSdLazyCounter, 36 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 44 SdHoareTripleChecker+Valid, 12 SdHoareTripleChecker+Invalid, 37 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 36 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2023-12-02 13:56:46,341 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [44 Valid, 12 Invalid, 37 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 36 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2023-12-02 13:56:46,344 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 609 states. [2023-12-02 13:56:46,359 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 609 to 609. [2023-12-02 13:56:46,361 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 609 states, 598 states have (on average 4.073578595317726) internal successors, (2436), 608 states have internal predecessors, (2436), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-12-02 13:56:46,364 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 609 states to 609 states and 2436 transitions. [2023-12-02 13:56:46,364 INFO L78 Accepts]: Start accepts. Automaton has 609 states and 2436 transitions. Word has length 5 [2023-12-02 13:56:46,364 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-12-02 13:56:46,365 INFO L495 AbstractCegarLoop]: Abstraction has 609 states and 2436 transitions. [2023-12-02 13:56:46,365 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 2 states have (on average 2.5) internal successors, (5), 2 states have internal predecessors, (5), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-12-02 13:56:46,365 INFO L276 IsEmpty]: Start isEmpty. Operand 609 states and 2436 transitions. [2023-12-02 13:56:46,365 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 6 [2023-12-02 13:56:46,365 INFO L187 NwaCegarLoop]: Found error trace [2023-12-02 13:56:46,365 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1] [2023-12-02 13:56:46,366 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2023-12-02 13:56:46,366 INFO L420 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr3REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 19 more)] === [2023-12-02 13:56:46,366 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-12-02 13:56:46,366 INFO L85 PathProgramCache]: Analyzing trace with hash 329901916, now seen corresponding path program 1 times [2023-12-02 13:56:46,367 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2023-12-02 13:56:46,367 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1272628958] [2023-12-02 13:56:46,367 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-02 13:56:46,367 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-12-02 13:56:46,381 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-02 13:56:46,476 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-12-02 13:56:46,476 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2023-12-02 13:56:46,477 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1272628958] [2023-12-02 13:56:46,477 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1272628958] provided 1 perfect and 0 imperfect interpolant sequences [2023-12-02 13:56:46,477 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-12-02 13:56:46,477 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2023-12-02 13:56:46,477 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [397097420] [2023-12-02 13:56:46,477 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-12-02 13:56:46,478 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2023-12-02 13:56:46,478 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2023-12-02 13:56:46,478 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2023-12-02 13:56:46,478 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2023-12-02 13:56:46,479 INFO L87 Difference]: Start difference. First operand 609 states and 2436 transitions. Second operand has 3 states, 2 states have (on average 2.5) internal successors, (5), 2 states have internal predecessors, (5), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-12-02 13:56:46,544 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-12-02 13:56:46,544 INFO L93 Difference]: Finished difference Result 579 states and 2322 transitions. [2023-12-02 13:56:46,549 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2023-12-02 13:56:46,549 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 2 states have (on average 2.5) internal successors, (5), 2 states have internal predecessors, (5), 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 5 [2023-12-02 13:56:46,549 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-12-02 13:56:46,555 INFO L225 Difference]: With dead ends: 579 [2023-12-02 13:56:46,556 INFO L226 Difference]: Without dead ends: 579 [2023-12-02 13:56:46,556 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 1 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2023-12-02 13:56:46,557 INFO L413 NwaCegarLoop]: 12 mSDtfsCounter, 42 mSDsluCounter, 0 mSDsCounter, 0 mSdLazyCounter, 34 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 42 SdHoareTripleChecker+Valid, 12 SdHoareTripleChecker+Invalid, 35 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 34 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2023-12-02 13:56:46,558 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [42 Valid, 12 Invalid, 35 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 34 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2023-12-02 13:56:46,561 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 579 states. [2023-12-02 13:56:46,576 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 579 to 579. [2023-12-02 13:56:46,578 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 579 states, 570 states have (on average 4.073684210526316) internal successors, (2322), 578 states have internal predecessors, (2322), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-12-02 13:56:46,581 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 579 states to 579 states and 2322 transitions. [2023-12-02 13:56:46,582 INFO L78 Accepts]: Start accepts. Automaton has 579 states and 2322 transitions. Word has length 5 [2023-12-02 13:56:46,582 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-12-02 13:56:46,582 INFO L495 AbstractCegarLoop]: Abstraction has 579 states and 2322 transitions. [2023-12-02 13:56:46,583 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 2 states have (on average 2.5) internal successors, (5), 2 states have internal predecessors, (5), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-12-02 13:56:46,583 INFO L276 IsEmpty]: Start isEmpty. Operand 579 states and 2322 transitions. [2023-12-02 13:56:46,583 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 9 [2023-12-02 13:56:46,583 INFO L187 NwaCegarLoop]: Found error trace [2023-12-02 13:56:46,584 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1] [2023-12-02 13:56:46,584 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2023-12-02 13:56:46,584 INFO L420 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr4REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 19 more)] === [2023-12-02 13:56:46,585 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-12-02 13:56:46,585 INFO L85 PathProgramCache]: Analyzing trace with hash 1223105491, now seen corresponding path program 1 times [2023-12-02 13:56:46,585 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2023-12-02 13:56:46,585 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [662215649] [2023-12-02 13:56:46,585 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-02 13:56:46,586 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-12-02 13:56:46,602 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-02 13:56:46,663 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-12-02 13:56:46,663 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2023-12-02 13:56:46,663 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [662215649] [2023-12-02 13:56:46,664 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [662215649] provided 1 perfect and 0 imperfect interpolant sequences [2023-12-02 13:56:46,664 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-12-02 13:56:46,664 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2023-12-02 13:56:46,664 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [352009682] [2023-12-02 13:56:46,664 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-12-02 13:56:46,665 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2023-12-02 13:56:46,665 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2023-12-02 13:56:46,665 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2023-12-02 13:56:46,666 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2023-12-02 13:56:46,666 INFO L87 Difference]: Start difference. First operand 579 states and 2322 transitions. Second operand has 3 states, 2 states have (on average 4.0) internal successors, (8), 2 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) [2023-12-02 13:56:46,736 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-12-02 13:56:46,736 INFO L93 Difference]: Finished difference Result 561 states and 2268 transitions. [2023-12-02 13:56:46,736 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2023-12-02 13:56:46,737 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 2 states have (on average 4.0) internal successors, (8), 2 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 [2023-12-02 13:56:46,737 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-12-02 13:56:46,744 INFO L225 Difference]: With dead ends: 561 [2023-12-02 13:56:46,744 INFO L226 Difference]: Without dead ends: 561 [2023-12-02 13:56:46,745 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 1 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2023-12-02 13:56:46,746 INFO L413 NwaCegarLoop]: 10 mSDtfsCounter, 37 mSDsluCounter, 0 mSDsCounter, 0 mSdLazyCounter, 34 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 37 SdHoareTripleChecker+Valid, 10 SdHoareTripleChecker+Invalid, 35 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 34 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2023-12-02 13:56:46,747 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [37 Valid, 10 Invalid, 35 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 34 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2023-12-02 13:56:46,749 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 561 states. [2023-12-02 13:56:46,770 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 561 to 561. [2023-12-02 13:56:46,773 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 561 states, 554 states have (on average 4.093862815884476) internal successors, (2268), 560 states have internal predecessors, (2268), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-12-02 13:56:46,789 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 561 states to 561 states and 2268 transitions. [2023-12-02 13:56:46,790 INFO L78 Accepts]: Start accepts. Automaton has 561 states and 2268 transitions. Word has length 8 [2023-12-02 13:56:46,791 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-12-02 13:56:46,791 INFO L495 AbstractCegarLoop]: Abstraction has 561 states and 2268 transitions. [2023-12-02 13:56:46,791 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 2 states have (on average 4.0) internal successors, (8), 2 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) [2023-12-02 13:56:46,791 INFO L276 IsEmpty]: Start isEmpty. Operand 561 states and 2268 transitions. [2023-12-02 13:56:46,792 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 9 [2023-12-02 13:56:46,792 INFO L187 NwaCegarLoop]: Found error trace [2023-12-02 13:56:46,792 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1] [2023-12-02 13:56:46,792 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2023-12-02 13:56:46,792 INFO L420 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr5REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 19 more)] === [2023-12-02 13:56:46,793 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-12-02 13:56:46,793 INFO L85 PathProgramCache]: Analyzing trace with hash 1223105492, now seen corresponding path program 1 times [2023-12-02 13:56:46,793 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2023-12-02 13:56:46,793 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [607028614] [2023-12-02 13:56:46,793 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-02 13:56:46,794 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-12-02 13:56:46,810 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-02 13:56:46,903 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-12-02 13:56:46,903 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2023-12-02 13:56:46,904 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [607028614] [2023-12-02 13:56:46,904 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [607028614] provided 1 perfect and 0 imperfect interpolant sequences [2023-12-02 13:56:46,904 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-12-02 13:56:46,904 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2023-12-02 13:56:46,904 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1155878688] [2023-12-02 13:56:46,904 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-12-02 13:56:46,905 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2023-12-02 13:56:46,905 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2023-12-02 13:56:46,905 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2023-12-02 13:56:46,906 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2023-12-02 13:56:46,906 INFO L87 Difference]: Start difference. First operand 561 states and 2268 transitions. Second operand has 3 states, 2 states have (on average 4.0) internal successors, (8), 2 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) [2023-12-02 13:56:46,969 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-12-02 13:56:46,969 INFO L93 Difference]: Finished difference Result 543 states and 2214 transitions. [2023-12-02 13:56:46,970 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2023-12-02 13:56:46,970 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 2 states have (on average 4.0) internal successors, (8), 2 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 [2023-12-02 13:56:46,970 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-12-02 13:56:46,977 INFO L225 Difference]: With dead ends: 543 [2023-12-02 13:56:46,977 INFO L226 Difference]: Without dead ends: 543 [2023-12-02 13:56:46,977 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 1 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2023-12-02 13:56:46,978 INFO L413 NwaCegarLoop]: 10 mSDtfsCounter, 35 mSDsluCounter, 0 mSDsCounter, 0 mSdLazyCounter, 32 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 35 SdHoareTripleChecker+Valid, 10 SdHoareTripleChecker+Invalid, 33 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 32 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2023-12-02 13:56:46,979 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [35 Valid, 10 Invalid, 33 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 32 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2023-12-02 13:56:46,981 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 543 states. [2023-12-02 13:56:47,001 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 543 to 543. [2023-12-02 13:56:47,003 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 543 states, 538 states have (on average 4.115241635687732) internal successors, (2214), 542 states have internal predecessors, (2214), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-12-02 13:56:47,008 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 543 states to 543 states and 2214 transitions. [2023-12-02 13:56:47,008 INFO L78 Accepts]: Start accepts. Automaton has 543 states and 2214 transitions. Word has length 8 [2023-12-02 13:56:47,008 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-12-02 13:56:47,008 INFO L495 AbstractCegarLoop]: Abstraction has 543 states and 2214 transitions. [2023-12-02 13:56:47,008 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 2 states have (on average 4.0) internal successors, (8), 2 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) [2023-12-02 13:56:47,009 INFO L276 IsEmpty]: Start isEmpty. Operand 543 states and 2214 transitions. [2023-12-02 13:56:47,009 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 12 [2023-12-02 13:56:47,010 INFO L187 NwaCegarLoop]: Found error trace [2023-12-02 13:56:47,010 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-12-02 13:56:47,010 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2023-12-02 13:56:47,010 INFO L420 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr6REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 19 more)] === [2023-12-02 13:56:47,010 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-12-02 13:56:47,011 INFO L85 PathProgramCache]: Analyzing trace with hash -966530096, now seen corresponding path program 1 times [2023-12-02 13:56:47,011 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2023-12-02 13:56:47,011 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1125731091] [2023-12-02 13:56:47,011 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-02 13:56:47,011 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-12-02 13:56:47,025 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-02 13:56:47,062 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-12-02 13:56:47,062 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2023-12-02 13:56:47,063 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1125731091] [2023-12-02 13:56:47,063 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1125731091] provided 1 perfect and 0 imperfect interpolant sequences [2023-12-02 13:56:47,063 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-12-02 13:56:47,063 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2023-12-02 13:56:47,063 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [788824234] [2023-12-02 13:56:47,063 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-12-02 13:56:47,064 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2023-12-02 13:56:47,064 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2023-12-02 13:56:47,064 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2023-12-02 13:56:47,064 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2023-12-02 13:56:47,065 INFO L87 Difference]: Start difference. First operand 543 states and 2214 transitions. Second operand has 3 states, 2 states have (on average 5.5) internal successors, (11), 2 states have internal predecessors, (11), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-12-02 13:56:47,121 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-12-02 13:56:47,121 INFO L93 Difference]: Finished difference Result 513 states and 2100 transitions. [2023-12-02 13:56:47,122 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2023-12-02 13:56:47,122 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 2 states have (on average 5.5) internal successors, (11), 2 states have internal predecessors, (11), 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 11 [2023-12-02 13:56:47,122 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-12-02 13:56:47,128 INFO L225 Difference]: With dead ends: 513 [2023-12-02 13:56:47,129 INFO L226 Difference]: Without dead ends: 513 [2023-12-02 13:56:47,129 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 1 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2023-12-02 13:56:47,130 INFO L413 NwaCegarLoop]: 8 mSDtfsCounter, 30 mSDsluCounter, 0 mSDsCounter, 0 mSdLazyCounter, 32 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 30 SdHoareTripleChecker+Valid, 8 SdHoareTripleChecker+Invalid, 33 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 32 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2023-12-02 13:56:47,130 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [30 Valid, 8 Invalid, 33 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 32 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2023-12-02 13:56:47,133 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 513 states. [2023-12-02 13:56:47,152 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 513 to 513. [2023-12-02 13:56:47,154 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 513 states, 510 states have (on average 4.117647058823529) internal successors, (2100), 512 states have internal predecessors, (2100), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-12-02 13:56:47,158 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 513 states to 513 states and 2100 transitions. [2023-12-02 13:56:47,158 INFO L78 Accepts]: Start accepts. Automaton has 513 states and 2100 transitions. Word has length 11 [2023-12-02 13:56:47,159 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-12-02 13:56:47,159 INFO L495 AbstractCegarLoop]: Abstraction has 513 states and 2100 transitions. [2023-12-02 13:56:47,159 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 2 states have (on average 5.5) internal successors, (11), 2 states have internal predecessors, (11), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-12-02 13:56:47,159 INFO L276 IsEmpty]: Start isEmpty. Operand 513 states and 2100 transitions. [2023-12-02 13:56:47,160 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 12 [2023-12-02 13:56:47,160 INFO L187 NwaCegarLoop]: Found error trace [2023-12-02 13:56:47,160 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-12-02 13:56:47,161 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2023-12-02 13:56:47,161 INFO L420 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr7REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 19 more)] === [2023-12-02 13:56:47,161 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-12-02 13:56:47,161 INFO L85 PathProgramCache]: Analyzing trace with hash -966530095, now seen corresponding path program 1 times [2023-12-02 13:56:47,161 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2023-12-02 13:56:47,162 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [23689910] [2023-12-02 13:56:47,162 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-02 13:56:47,162 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-12-02 13:56:47,178 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-02 13:56:47,247 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-12-02 13:56:47,247 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2023-12-02 13:56:47,247 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [23689910] [2023-12-02 13:56:47,247 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [23689910] provided 1 perfect and 0 imperfect interpolant sequences [2023-12-02 13:56:47,247 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-12-02 13:56:47,248 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2023-12-02 13:56:47,248 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [931068174] [2023-12-02 13:56:47,248 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-12-02 13:56:47,248 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2023-12-02 13:56:47,248 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2023-12-02 13:56:47,249 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2023-12-02 13:56:47,249 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2023-12-02 13:56:47,249 INFO L87 Difference]: Start difference. First operand 513 states and 2100 transitions. Second operand has 3 states, 2 states have (on average 5.5) internal successors, (11), 2 states have internal predecessors, (11), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-12-02 13:56:47,304 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-12-02 13:56:47,304 INFO L93 Difference]: Finished difference Result 483 states and 1986 transitions. [2023-12-02 13:56:47,304 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2023-12-02 13:56:47,304 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 2 states have (on average 5.5) internal successors, (11), 2 states have internal predecessors, (11), 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 11 [2023-12-02 13:56:47,305 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-12-02 13:56:47,311 INFO L225 Difference]: With dead ends: 483 [2023-12-02 13:56:47,311 INFO L226 Difference]: Without dead ends: 483 [2023-12-02 13:56:47,311 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 1 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2023-12-02 13:56:47,312 INFO L413 NwaCegarLoop]: 8 mSDtfsCounter, 28 mSDsluCounter, 0 mSDsCounter, 0 mSdLazyCounter, 30 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 28 SdHoareTripleChecker+Valid, 8 SdHoareTripleChecker+Invalid, 31 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 30 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2023-12-02 13:56:47,312 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [28 Valid, 8 Invalid, 31 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 30 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2023-12-02 13:56:47,314 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 483 states. [2023-12-02 13:56:47,330 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 483 to 483. [2023-12-02 13:56:47,332 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 483 states, 482 states have (on average 4.1203319502074685) internal successors, (1986), 482 states have internal predecessors, (1986), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-12-02 13:56:47,336 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 483 states to 483 states and 1986 transitions. [2023-12-02 13:56:47,336 INFO L78 Accepts]: Start accepts. Automaton has 483 states and 1986 transitions. Word has length 11 [2023-12-02 13:56:47,336 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-12-02 13:56:47,336 INFO L495 AbstractCegarLoop]: Abstraction has 483 states and 1986 transitions. [2023-12-02 13:56:47,336 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 2 states have (on average 5.5) internal successors, (11), 2 states have internal predecessors, (11), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-12-02 13:56:47,337 INFO L276 IsEmpty]: Start isEmpty. Operand 483 states and 1986 transitions. [2023-12-02 13:56:47,341 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 35 [2023-12-02 13:56:47,341 INFO L187 NwaCegarLoop]: Found error trace [2023-12-02 13:56:47,342 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-12-02 13:56:47,342 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2023-12-02 13:56:47,342 INFO L420 AbstractCegarLoop]: === Iteration 9 === Targeting ULTIMATE.startErr16ASSERT_VIOLATIONMEMORY_LEAK === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 19 more)] === [2023-12-02 13:56:47,342 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-12-02 13:56:47,343 INFO L85 PathProgramCache]: Analyzing trace with hash -151320943, now seen corresponding path program 1 times [2023-12-02 13:56:47,343 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2023-12-02 13:56:47,343 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1478671495] [2023-12-02 13:56:47,343 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-02 13:56:47,343 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-12-02 13:56:47,368 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-02 13:56:47,544 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-12-02 13:56:47,544 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2023-12-02 13:56:47,544 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1478671495] [2023-12-02 13:56:47,545 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1478671495] provided 1 perfect and 0 imperfect interpolant sequences [2023-12-02 13:56:47,545 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-12-02 13:56:47,545 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2023-12-02 13:56:47,545 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [41754046] [2023-12-02 13:56:47,545 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-12-02 13:56:47,546 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2023-12-02 13:56:47,546 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2023-12-02 13:56:47,546 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2023-12-02 13:56:47,546 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2023-12-02 13:56:47,547 INFO L87 Difference]: Start difference. First operand 483 states and 1986 transitions. Second operand has 3 states, 3 states have (on average 11.333333333333334) internal successors, (34), 2 states have internal predecessors, (34), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-12-02 13:56:47,645 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-12-02 13:56:47,646 INFO L93 Difference]: Finished difference Result 949 states and 3926 transitions. [2023-12-02 13:56:47,646 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2023-12-02 13:56:47,646 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 11.333333333333334) internal successors, (34), 2 states have internal predecessors, (34), 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 34 [2023-12-02 13:56:47,647 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-12-02 13:56:47,657 INFO L225 Difference]: With dead ends: 949 [2023-12-02 13:56:47,657 INFO L226 Difference]: Without dead ends: 936 [2023-12-02 13:56:47,657 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2023-12-02 13:56:47,658 INFO L413 NwaCegarLoop]: 16 mSDtfsCounter, 0 mSDsluCounter, 15 mSDsCounter, 0 mSdLazyCounter, 42 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 31 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.1s IncrementalHoareTripleChecker+Time [2023-12-02 13:56:47,658 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 31 Invalid, 42 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 42 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2023-12-02 13:56:47,661 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 936 states. [2023-12-02 13:56:47,693 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 936 to 936. [2023-12-02 13:56:47,697 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 936 states, 935 states have (on average 4.154010695187166) internal successors, (3884), 935 states have internal predecessors, (3884), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-12-02 13:56:47,704 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 936 states to 936 states and 3884 transitions. [2023-12-02 13:56:47,704 INFO L78 Accepts]: Start accepts. Automaton has 936 states and 3884 transitions. Word has length 34 [2023-12-02 13:56:47,704 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-12-02 13:56:47,705 INFO L495 AbstractCegarLoop]: Abstraction has 936 states and 3884 transitions. [2023-12-02 13:56:47,705 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 11.333333333333334) internal successors, (34), 2 states have internal predecessors, (34), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-12-02 13:56:47,705 INFO L276 IsEmpty]: Start isEmpty. Operand 936 states and 3884 transitions. [2023-12-02 13:56:47,709 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 36 [2023-12-02 13:56:47,709 INFO L187 NwaCegarLoop]: Found error trace [2023-12-02 13:56:47,709 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-12-02 13:56:47,710 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2023-12-02 13:56:47,710 INFO L420 AbstractCegarLoop]: === Iteration 10 === Targeting ULTIMATE.startErr16ASSERT_VIOLATIONMEMORY_LEAK === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 19 more)] === [2023-12-02 13:56:47,710 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-12-02 13:56:47,710 INFO L85 PathProgramCache]: Analyzing trace with hash 1591237667, now seen corresponding path program 1 times [2023-12-02 13:56:47,711 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2023-12-02 13:56:47,711 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2073138389] [2023-12-02 13:56:47,711 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-02 13:56:47,711 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-12-02 13:56:47,740 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-02 13:56:47,856 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-12-02 13:56:47,856 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2023-12-02 13:56:47,856 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2073138389] [2023-12-02 13:56:47,856 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2073138389] provided 0 perfect and 1 imperfect interpolant sequences [2023-12-02 13:56:47,856 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1272381060] [2023-12-02 13:56:47,856 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-02 13:56:47,857 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-12-02 13:56:47,857 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_9284ea18-4b33-4bf4-84e1-1ddf9a674761/bin/utaipan-verify-nQ1chXbOIh/z3 [2023-12-02 13:56:47,860 INFO L229 MonitoredProcess]: Starting monitored process 2 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_9284ea18-4b33-4bf4-84e1-1ddf9a674761/bin/utaipan-verify-nQ1chXbOIh/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2023-12-02 13:56:47,865 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_9284ea18-4b33-4bf4-84e1-1ddf9a674761/bin/utaipan-verify-nQ1chXbOIh/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Waiting until timeout for monitored process [2023-12-02 13:56:47,996 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-02 13:56:47,999 INFO L262 TraceCheckSpWp]: Trace formula consists of 250 conjuncts, 3 conjunts are in the unsatisfiable core [2023-12-02 13:56:48,006 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-12-02 13:56:48,261 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-12-02 13:56:48,261 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2023-12-02 13:56:48,436 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-12-02 13:56:48,436 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1272381060] provided 0 perfect and 2 imperfect interpolant sequences [2023-12-02 13:56:48,437 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSifa [1940015048] [2023-12-02 13:56:48,446 FATAL L? ?]: Ignoring exception! java.lang.UnsupportedOperationException: Cannot create path program transition for IcfgForkThreadOtherTransition at de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder.cfg.PathProgram$PathProgramConstructor.createPathProgramTransition(PathProgram.java:295) at de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder.cfg.PathProgram$PathProgramConstructor.createPathProgramTransition(PathProgram.java:270) at java.base/java.util.stream.ForEachOps$ForEachOp$OfRef.accept(ForEachOps.java:183) at java.base/java.util.stream.ReferencePipeline$2$1.accept(ReferencePipeline.java:177) at java.base/java.util.HashMap$KeySpliterator.forEachRemaining(HashMap.java:1621) at java.base/java.util.stream.AbstractPipeline.copyInto(AbstractPipeline.java:484) at java.base/java.util.stream.AbstractPipeline.wrapAndCopyInto(AbstractPipeline.java:474) at java.base/java.util.stream.ForEachOps$ForEachOp.evaluateSequential(ForEachOps.java:150) at java.base/java.util.stream.ForEachOps$ForEachOp$OfRef.evaluateSequential(ForEachOps.java:173) at java.base/java.util.stream.AbstractPipeline.evaluate(AbstractPipeline.java:234) at java.base/java.util.stream.ReferencePipeline.forEach(ReferencePipeline.java:497) at de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder.cfg.PathProgram$PathProgramConstructor.(PathProgram.java:235) at de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder.cfg.PathProgram.constructPathProgram(PathProgram.java:112) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.SifaRunner.(SifaRunner.java:91) 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:337) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.AbstractCegarLoop.iterate(AbstractCegarLoop.java:431) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.AbstractCegarLoop.startCegar(AbstractCegarLoop.java:366) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.AbstractCegarLoop.runCegar(AbstractCegarLoop.java:348) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.executeCegarLoop(TraceAbstractionStarter.java:415) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.analyseProgram(TraceAbstractionStarter.java:302) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.analyseConcurrentProgram(TraceAbstractionStarter.java:225) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.runCegarLoops(TraceAbstractionStarter.java:173) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.(TraceAbstractionStarter.java:154) 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) [2023-12-02 13:56:48,450 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2023-12-02 13:56:48,450 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [3, 3, 3] total 5 [2023-12-02 13:56:48,450 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [558581505] [2023-12-02 13:56:48,450 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2023-12-02 13:56:48,451 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2023-12-02 13:56:48,451 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2023-12-02 13:56:48,452 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2023-12-02 13:56:48,452 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2023-12-02 13:56:48,453 INFO L87 Difference]: Start difference. First operand 936 states and 3884 transitions. Second operand has 6 states, 6 states have (on average 9.833333333333334) internal successors, (59), 5 states have internal predecessors, (59), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-12-02 13:56:48,749 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-12-02 13:56:48,749 INFO L93 Difference]: Finished difference Result 1533 states and 6250 transitions. [2023-12-02 13:56:48,752 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2023-12-02 13:56:48,752 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 9.833333333333334) internal successors, (59), 5 states have internal predecessors, (59), 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 35 [2023-12-02 13:56:48,752 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-12-02 13:56:48,774 INFO L225 Difference]: With dead ends: 1533 [2023-12-02 13:56:48,774 INFO L226 Difference]: Without dead ends: 1533 [2023-12-02 13:56:48,775 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 72 GetRequests, 65 SyntacticMatches, 2 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=16, Invalid=26, Unknown=0, NotChecked=0, Total=42 [2023-12-02 13:56:48,776 INFO L413 NwaCegarLoop]: 38 mSDtfsCounter, 75 mSDsluCounter, 76 mSDsCounter, 0 mSdLazyCounter, 168 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 75 SdHoareTripleChecker+Valid, 114 SdHoareTripleChecker+Invalid, 169 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 168 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2023-12-02 13:56:48,776 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [75 Valid, 114 Invalid, 169 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 168 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2023-12-02 13:56:48,781 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1533 states. [2023-12-02 13:56:48,838 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1533 to 1173. [2023-12-02 13:56:48,843 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1173 states, 1172 states have (on average 4.302047781569966) internal successors, (5042), 1172 states have internal predecessors, (5042), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-12-02 13:56:48,852 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1173 states to 1173 states and 5042 transitions. [2023-12-02 13:56:48,852 INFO L78 Accepts]: Start accepts. Automaton has 1173 states and 5042 transitions. Word has length 35 [2023-12-02 13:56:48,852 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-12-02 13:56:48,852 INFO L495 AbstractCegarLoop]: Abstraction has 1173 states and 5042 transitions. [2023-12-02 13:56:48,852 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 9.833333333333334) internal successors, (59), 5 states have internal predecessors, (59), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-12-02 13:56:48,853 INFO L276 IsEmpty]: Start isEmpty. Operand 1173 states and 5042 transitions. [2023-12-02 13:56:48,858 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 36 [2023-12-02 13:56:48,858 INFO L187 NwaCegarLoop]: Found error trace [2023-12-02 13:56:48,858 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-12-02 13:56:48,865 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_9284ea18-4b33-4bf4-84e1-1ddf9a674761/bin/utaipan-verify-nQ1chXbOIh/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Forceful destruction successful, exit code 0 [2023-12-02 13:56:49,060 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 2 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_9284ea18-4b33-4bf4-84e1-1ddf9a674761/bin/utaipan-verify-nQ1chXbOIh/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable9 [2023-12-02 13:56:49,061 INFO L420 AbstractCegarLoop]: === Iteration 11 === Targeting ULTIMATE.startErr16ASSERT_VIOLATIONMEMORY_LEAK === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 19 more)] === [2023-12-02 13:56:49,061 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-12-02 13:56:49,061 INFO L85 PathProgramCache]: Analyzing trace with hash -1188687138, now seen corresponding path program 1 times [2023-12-02 13:56:49,061 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2023-12-02 13:56:49,062 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [43926041] [2023-12-02 13:56:49,062 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-02 13:56:49,062 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-12-02 13:56:49,090 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-02 13:56:49,191 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 1 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-12-02 13:56:49,191 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2023-12-02 13:56:49,192 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [43926041] [2023-12-02 13:56:49,192 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [43926041] provided 1 perfect and 0 imperfect interpolant sequences [2023-12-02 13:56:49,192 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-12-02 13:56:49,192 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2023-12-02 13:56:49,192 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [767603621] [2023-12-02 13:56:49,192 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-12-02 13:56:49,192 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2023-12-02 13:56:49,193 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2023-12-02 13:56:49,193 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2023-12-02 13:56:49,193 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2023-12-02 13:56:49,193 INFO L87 Difference]: Start difference. First operand 1173 states and 5042 transitions. Second operand has 4 states, 4 states have (on average 8.75) internal successors, (35), 3 states have internal predecessors, (35), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-12-02 13:56:49,357 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-12-02 13:56:49,357 INFO L93 Difference]: Finished difference Result 1389 states and 5683 transitions. [2023-12-02 13:56:49,357 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2023-12-02 13:56:49,358 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 8.75) internal successors, (35), 3 states have internal predecessors, (35), 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 35 [2023-12-02 13:56:49,358 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-12-02 13:56:49,373 INFO L225 Difference]: With dead ends: 1389 [2023-12-02 13:56:49,374 INFO L226 Difference]: Without dead ends: 1377 [2023-12-02 13:56:49,374 INFO L412 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 [2023-12-02 13:56:49,375 INFO L413 NwaCegarLoop]: 24 mSDtfsCounter, 83 mSDsluCounter, 34 mSDsCounter, 0 mSdLazyCounter, 85 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 83 SdHoareTripleChecker+Valid, 58 SdHoareTripleChecker+Invalid, 87 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 85 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2023-12-02 13:56:49,375 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [83 Valid, 58 Invalid, 87 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 85 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2023-12-02 13:56:49,379 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1377 states. [2023-12-02 13:56:49,422 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1377 to 1227. [2023-12-02 13:56:49,427 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1227 states, 1226 states have (on average 4.2039151712887435) internal successors, (5154), 1226 states have internal predecessors, (5154), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-12-02 13:56:49,437 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1227 states to 1227 states and 5154 transitions. [2023-12-02 13:56:49,437 INFO L78 Accepts]: Start accepts. Automaton has 1227 states and 5154 transitions. Word has length 35 [2023-12-02 13:56:49,437 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-12-02 13:56:49,437 INFO L495 AbstractCegarLoop]: Abstraction has 1227 states and 5154 transitions. [2023-12-02 13:56:49,437 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 8.75) internal successors, (35), 3 states have internal predecessors, (35), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-12-02 13:56:49,437 INFO L276 IsEmpty]: Start isEmpty. Operand 1227 states and 5154 transitions. [2023-12-02 13:56:49,443 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 36 [2023-12-02 13:56:49,443 INFO L187 NwaCegarLoop]: Found error trace [2023-12-02 13:56:49,443 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-12-02 13:56:49,443 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10 [2023-12-02 13:56:49,443 INFO L420 AbstractCegarLoop]: === Iteration 12 === Targeting ULTIMATE.startErr16ASSERT_VIOLATIONMEMORY_LEAK === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 19 more)] === [2023-12-02 13:56:49,444 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-12-02 13:56:49,444 INFO L85 PathProgramCache]: Analyzing trace with hash -891800602, now seen corresponding path program 1 times [2023-12-02 13:56:49,444 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2023-12-02 13:56:49,444 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1834168933] [2023-12-02 13:56:49,444 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-02 13:56:49,444 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-12-02 13:56:49,470 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-02 13:56:49,597 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-12-02 13:56:49,597 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2023-12-02 13:56:49,597 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1834168933] [2023-12-02 13:56:49,597 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1834168933] provided 0 perfect and 1 imperfect interpolant sequences [2023-12-02 13:56:49,597 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [969232911] [2023-12-02 13:56:49,598 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-02 13:56:49,598 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-12-02 13:56:49,598 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_9284ea18-4b33-4bf4-84e1-1ddf9a674761/bin/utaipan-verify-nQ1chXbOIh/z3 [2023-12-02 13:56:49,599 INFO L229 MonitoredProcess]: Starting monitored process 3 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_9284ea18-4b33-4bf4-84e1-1ddf9a674761/bin/utaipan-verify-nQ1chXbOIh/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2023-12-02 13:56:49,602 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_9284ea18-4b33-4bf4-84e1-1ddf9a674761/bin/utaipan-verify-nQ1chXbOIh/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Waiting until timeout for monitored process [2023-12-02 13:56:49,720 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-02 13:56:49,721 INFO L262 TraceCheckSpWp]: Trace formula consists of 250 conjuncts, 3 conjunts are in the unsatisfiable core [2023-12-02 13:56:49,724 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-12-02 13:56:49,939 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-12-02 13:56:49,939 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2023-12-02 13:56:50,067 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-12-02 13:56:50,068 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [969232911] provided 0 perfect and 2 imperfect interpolant sequences [2023-12-02 13:56:50,068 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSifa [1040513561] [2023-12-02 13:56:50,069 FATAL L? ?]: Ignoring exception! java.lang.UnsupportedOperationException: Cannot create path program transition for IcfgForkThreadOtherTransition at de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder.cfg.PathProgram$PathProgramConstructor.createPathProgramTransition(PathProgram.java:295) at de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder.cfg.PathProgram$PathProgramConstructor.createPathProgramTransition(PathProgram.java:270) at java.base/java.util.stream.ForEachOps$ForEachOp$OfRef.accept(ForEachOps.java:183) at java.base/java.util.stream.ReferencePipeline$2$1.accept(ReferencePipeline.java:177) at java.base/java.util.HashMap$KeySpliterator.forEachRemaining(HashMap.java:1621) at java.base/java.util.stream.AbstractPipeline.copyInto(AbstractPipeline.java:484) at java.base/java.util.stream.AbstractPipeline.wrapAndCopyInto(AbstractPipeline.java:474) at java.base/java.util.stream.ForEachOps$ForEachOp.evaluateSequential(ForEachOps.java:150) at java.base/java.util.stream.ForEachOps$ForEachOp$OfRef.evaluateSequential(ForEachOps.java:173) at java.base/java.util.stream.AbstractPipeline.evaluate(AbstractPipeline.java:234) at java.base/java.util.stream.ReferencePipeline.forEach(ReferencePipeline.java:497) at de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder.cfg.PathProgram$PathProgramConstructor.(PathProgram.java:235) at de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder.cfg.PathProgram.constructPathProgram(PathProgram.java:112) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.SifaRunner.(SifaRunner.java:91) 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:337) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.AbstractCegarLoop.iterate(AbstractCegarLoop.java:431) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.AbstractCegarLoop.startCegar(AbstractCegarLoop.java:366) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.AbstractCegarLoop.runCegar(AbstractCegarLoop.java:348) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.executeCegarLoop(TraceAbstractionStarter.java:415) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.analyseProgram(TraceAbstractionStarter.java:302) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.analyseConcurrentProgram(TraceAbstractionStarter.java:225) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.runCegarLoops(TraceAbstractionStarter.java:173) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.(TraceAbstractionStarter.java:154) 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) [2023-12-02 13:56:50,071 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2023-12-02 13:56:50,071 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [3, 3, 3] total 5 [2023-12-02 13:56:50,071 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [576560521] [2023-12-02 13:56:50,072 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2023-12-02 13:56:50,072 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2023-12-02 13:56:50,072 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2023-12-02 13:56:50,073 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2023-12-02 13:56:50,073 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2023-12-02 13:56:50,073 INFO L87 Difference]: Start difference. First operand 1227 states and 5154 transitions. Second operand has 6 states, 6 states have (on average 10.666666666666666) internal successors, (64), 5 states have internal predecessors, (64), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-12-02 13:56:50,268 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-12-02 13:56:50,268 INFO L93 Difference]: Finished difference Result 1944 states and 8112 transitions. [2023-12-02 13:56:50,269 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2023-12-02 13:56:50,269 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 10.666666666666666) internal successors, (64), 5 states have internal predecessors, (64), 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 35 [2023-12-02 13:56:50,269 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-12-02 13:56:50,292 INFO L225 Difference]: With dead ends: 1944 [2023-12-02 13:56:50,292 INFO L226 Difference]: Without dead ends: 1944 [2023-12-02 13:56:50,292 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 72 GetRequests, 65 SyntacticMatches, 2 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=16, Invalid=26, Unknown=0, NotChecked=0, Total=42 [2023-12-02 13:56:50,293 INFO L413 NwaCegarLoop]: 38 mSDtfsCounter, 62 mSDsluCounter, 62 mSDsCounter, 0 mSdLazyCounter, 130 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 62 SdHoareTripleChecker+Valid, 100 SdHoareTripleChecker+Invalid, 131 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 130 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2023-12-02 13:56:50,293 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [62 Valid, 100 Invalid, 131 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 130 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2023-12-02 13:56:50,299 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1944 states. [2023-12-02 13:56:50,357 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1944 to 1533. [2023-12-02 13:56:50,363 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1533 states, 1532 states have (on average 4.404046997389034) internal successors, (6747), 1532 states have internal predecessors, (6747), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-12-02 13:56:50,376 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1533 states to 1533 states and 6747 transitions. [2023-12-02 13:56:50,376 INFO L78 Accepts]: Start accepts. Automaton has 1533 states and 6747 transitions. Word has length 35 [2023-12-02 13:56:50,377 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-12-02 13:56:50,377 INFO L495 AbstractCegarLoop]: Abstraction has 1533 states and 6747 transitions. [2023-12-02 13:56:50,377 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 10.666666666666666) internal successors, (64), 5 states have internal predecessors, (64), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-12-02 13:56:50,377 INFO L276 IsEmpty]: Start isEmpty. Operand 1533 states and 6747 transitions. [2023-12-02 13:56:50,384 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 36 [2023-12-02 13:56:50,384 INFO L187 NwaCegarLoop]: Found error trace [2023-12-02 13:56:50,384 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-12-02 13:56:50,393 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_9284ea18-4b33-4bf4-84e1-1ddf9a674761/bin/utaipan-verify-nQ1chXbOIh/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Ended with exit code 0 [2023-12-02 13:56:50,585 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable11,3 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_9284ea18-4b33-4bf4-84e1-1ddf9a674761/bin/utaipan-verify-nQ1chXbOIh/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-12-02 13:56:50,586 INFO L420 AbstractCegarLoop]: === Iteration 13 === Targeting ULTIMATE.startErr16ASSERT_VIOLATIONMEMORY_LEAK === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 19 more)] === [2023-12-02 13:56:50,586 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-12-02 13:56:50,586 INFO L85 PathProgramCache]: Analyzing trace with hash 129104059, now seen corresponding path program 1 times [2023-12-02 13:56:50,586 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2023-12-02 13:56:50,586 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [116219701] [2023-12-02 13:56:50,586 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-02 13:56:50,587 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-12-02 13:56:50,612 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-02 13:56:50,719 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 1 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-12-02 13:56:50,719 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2023-12-02 13:56:50,719 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [116219701] [2023-12-02 13:56:50,719 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [116219701] provided 1 perfect and 0 imperfect interpolant sequences [2023-12-02 13:56:50,719 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-12-02 13:56:50,719 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2023-12-02 13:56:50,720 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1418096027] [2023-12-02 13:56:50,720 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-12-02 13:56:50,720 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2023-12-02 13:56:50,720 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2023-12-02 13:56:50,721 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2023-12-02 13:56:50,721 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2023-12-02 13:56:50,721 INFO L87 Difference]: Start difference. First operand 1533 states and 6747 transitions. Second operand has 4 states, 4 states have (on average 8.75) internal successors, (35), 3 states have internal predecessors, (35), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-12-02 13:56:50,905 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-12-02 13:56:50,905 INFO L93 Difference]: Finished difference Result 1797 states and 7529 transitions. [2023-12-02 13:56:50,906 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2023-12-02 13:56:50,906 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 8.75) internal successors, (35), 3 states have internal predecessors, (35), 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 35 [2023-12-02 13:56:50,906 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-12-02 13:56:50,924 INFO L225 Difference]: With dead ends: 1797 [2023-12-02 13:56:50,924 INFO L226 Difference]: Without dead ends: 1755 [2023-12-02 13:56:50,924 INFO L412 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 [2023-12-02 13:56:50,925 INFO L413 NwaCegarLoop]: 27 mSDtfsCounter, 52 mSDsluCounter, 35 mSDsCounter, 0 mSdLazyCounter, 81 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 52 SdHoareTripleChecker+Valid, 62 SdHoareTripleChecker+Invalid, 83 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 81 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2023-12-02 13:56:50,925 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [52 Valid, 62 Invalid, 83 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 81 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2023-12-02 13:56:50,930 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1755 states. [2023-12-02 13:56:50,967 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1755 to 1578. [2023-12-02 13:56:50,972 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1578 states, 1577 states have (on average 4.325301204819277) internal successors, (6821), 1577 states have internal predecessors, (6821), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-12-02 13:56:50,981 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1578 states to 1578 states and 6821 transitions. [2023-12-02 13:56:50,981 INFO L78 Accepts]: Start accepts. Automaton has 1578 states and 6821 transitions. Word has length 35 [2023-12-02 13:56:50,982 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-12-02 13:56:50,982 INFO L495 AbstractCegarLoop]: Abstraction has 1578 states and 6821 transitions. [2023-12-02 13:56:50,982 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 8.75) internal successors, (35), 3 states have internal predecessors, (35), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-12-02 13:56:50,983 INFO L276 IsEmpty]: Start isEmpty. Operand 1578 states and 6821 transitions. [2023-12-02 13:56:50,989 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 36 [2023-12-02 13:56:50,989 INFO L187 NwaCegarLoop]: Found error trace [2023-12-02 13:56:50,990 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-12-02 13:56:50,990 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable12 [2023-12-02 13:56:50,990 INFO L420 AbstractCegarLoop]: === Iteration 14 === Targeting ULTIMATE.startErr16ASSERT_VIOLATIONMEMORY_LEAK === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 19 more)] === [2023-12-02 13:56:50,990 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-12-02 13:56:50,990 INFO L85 PathProgramCache]: Analyzing trace with hash 1062356621, now seen corresponding path program 2 times [2023-12-02 13:56:50,991 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2023-12-02 13:56:50,991 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1600953160] [2023-12-02 13:56:50,991 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-02 13:56:50,991 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-12-02 13:56:51,009 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-02 13:56:51,082 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-12-02 13:56:51,082 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2023-12-02 13:56:51,082 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1600953160] [2023-12-02 13:56:51,082 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1600953160] provided 0 perfect and 1 imperfect interpolant sequences [2023-12-02 13:56:51,082 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1111596158] [2023-12-02 13:56:51,082 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2023-12-02 13:56:51,082 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-12-02 13:56:51,083 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_9284ea18-4b33-4bf4-84e1-1ddf9a674761/bin/utaipan-verify-nQ1chXbOIh/z3 [2023-12-02 13:56:51,083 INFO L229 MonitoredProcess]: Starting monitored process 4 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_9284ea18-4b33-4bf4-84e1-1ddf9a674761/bin/utaipan-verify-nQ1chXbOIh/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2023-12-02 13:56:51,097 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_9284ea18-4b33-4bf4-84e1-1ddf9a674761/bin/utaipan-verify-nQ1chXbOIh/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Waiting until timeout for monitored process [2023-12-02 13:56:51,210 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 2 check-sat command(s) [2023-12-02 13:56:51,210 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2023-12-02 13:56:51,211 INFO L262 TraceCheckSpWp]: Trace formula consists of 250 conjuncts, 3 conjunts are in the unsatisfiable core [2023-12-02 13:56:51,213 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-12-02 13:56:51,413 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-12-02 13:56:51,413 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2023-12-02 13:56:51,541 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-12-02 13:56:51,541 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1111596158] provided 0 perfect and 2 imperfect interpolant sequences [2023-12-02 13:56:51,542 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSifa [123045583] [2023-12-02 13:56:51,543 FATAL L? ?]: Ignoring exception! java.lang.UnsupportedOperationException: Cannot create path program transition for IcfgForkThreadOtherTransition at de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder.cfg.PathProgram$PathProgramConstructor.createPathProgramTransition(PathProgram.java:295) at de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder.cfg.PathProgram$PathProgramConstructor.createPathProgramTransition(PathProgram.java:270) at java.base/java.util.stream.ForEachOps$ForEachOp$OfRef.accept(ForEachOps.java:183) at java.base/java.util.stream.ReferencePipeline$2$1.accept(ReferencePipeline.java:177) at java.base/java.util.HashMap$KeySpliterator.forEachRemaining(HashMap.java:1621) at java.base/java.util.stream.AbstractPipeline.copyInto(AbstractPipeline.java:484) at java.base/java.util.stream.AbstractPipeline.wrapAndCopyInto(AbstractPipeline.java:474) at java.base/java.util.stream.ForEachOps$ForEachOp.evaluateSequential(ForEachOps.java:150) at java.base/java.util.stream.ForEachOps$ForEachOp$OfRef.evaluateSequential(ForEachOps.java:173) at java.base/java.util.stream.AbstractPipeline.evaluate(AbstractPipeline.java:234) at java.base/java.util.stream.ReferencePipeline.forEach(ReferencePipeline.java:497) at de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder.cfg.PathProgram$PathProgramConstructor.(PathProgram.java:235) at de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder.cfg.PathProgram.constructPathProgram(PathProgram.java:112) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.SifaRunner.(SifaRunner.java:91) 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:337) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.AbstractCegarLoop.iterate(AbstractCegarLoop.java:431) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.AbstractCegarLoop.startCegar(AbstractCegarLoop.java:366) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.AbstractCegarLoop.runCegar(AbstractCegarLoop.java:348) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.executeCegarLoop(TraceAbstractionStarter.java:415) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.analyseProgram(TraceAbstractionStarter.java:302) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.analyseConcurrentProgram(TraceAbstractionStarter.java:225) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.runCegarLoops(TraceAbstractionStarter.java:173) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.(TraceAbstractionStarter.java:154) 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) [2023-12-02 13:56:51,543 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2023-12-02 13:56:51,543 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [3, 3, 3] total 5 [2023-12-02 13:56:51,543 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1871920748] [2023-12-02 13:56:51,544 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2023-12-02 13:56:51,544 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2023-12-02 13:56:51,544 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2023-12-02 13:56:51,545 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2023-12-02 13:56:51,545 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2023-12-02 13:56:51,546 INFO L87 Difference]: Start difference. First operand 1578 states and 6821 transitions. Second operand has 6 states, 6 states have (on average 10.666666666666666) internal successors, (64), 5 states have internal predecessors, (64), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-12-02 13:56:51,783 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-12-02 13:56:51,783 INFO L93 Difference]: Finished difference Result 1896 states and 8016 transitions. [2023-12-02 13:56:51,784 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2023-12-02 13:56:51,784 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 10.666666666666666) internal successors, (64), 5 states have internal predecessors, (64), 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 35 [2023-12-02 13:56:51,784 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-12-02 13:56:51,810 INFO L225 Difference]: With dead ends: 1896 [2023-12-02 13:56:51,810 INFO L226 Difference]: Without dead ends: 1896 [2023-12-02 13:56:51,811 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 72 GetRequests, 65 SyntacticMatches, 2 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=16, Invalid=26, Unknown=0, NotChecked=0, Total=42 [2023-12-02 13:56:51,812 INFO L413 NwaCegarLoop]: 37 mSDtfsCounter, 37 mSDsluCounter, 79 mSDsCounter, 0 mSdLazyCounter, 152 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 37 SdHoareTripleChecker+Valid, 116 SdHoareTripleChecker+Invalid, 153 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 152 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2023-12-02 13:56:51,812 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [37 Valid, 116 Invalid, 153 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 152 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2023-12-02 13:56:51,818 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1896 states. [2023-12-02 13:56:51,859 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1896 to 1740. [2023-12-02 13:56:51,863 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1740 states, 1739 states have (on average 4.351926394479586) internal successors, (7568), 1739 states have internal predecessors, (7568), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-12-02 13:56:51,882 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1740 states to 1740 states and 7568 transitions. [2023-12-02 13:56:51,882 INFO L78 Accepts]: Start accepts. Automaton has 1740 states and 7568 transitions. Word has length 35 [2023-12-02 13:56:51,883 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-12-02 13:56:51,883 INFO L495 AbstractCegarLoop]: Abstraction has 1740 states and 7568 transitions. [2023-12-02 13:56:51,883 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 10.666666666666666) internal successors, (64), 5 states have internal predecessors, (64), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-12-02 13:56:51,883 INFO L276 IsEmpty]: Start isEmpty. Operand 1740 states and 7568 transitions. [2023-12-02 13:56:51,889 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 36 [2023-12-02 13:56:51,889 INFO L187 NwaCegarLoop]: Found error trace [2023-12-02 13:56:51,890 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-12-02 13:56:51,895 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_9284ea18-4b33-4bf4-84e1-1ddf9a674761/bin/utaipan-verify-nQ1chXbOIh/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Forceful destruction successful, exit code 0 [2023-12-02 13:56:52,090 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable13,4 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_9284ea18-4b33-4bf4-84e1-1ddf9a674761/bin/utaipan-verify-nQ1chXbOIh/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-12-02 13:56:52,091 INFO L420 AbstractCegarLoop]: === Iteration 15 === Targeting ULTIMATE.startErr16ASSERT_VIOLATIONMEMORY_LEAK === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 19 more)] === [2023-12-02 13:56:52,091 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-12-02 13:56:52,091 INFO L85 PathProgramCache]: Analyzing trace with hash -1554444468, now seen corresponding path program 2 times [2023-12-02 13:56:52,091 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2023-12-02 13:56:52,091 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [653495445] [2023-12-02 13:56:52,092 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-02 13:56:52,092 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-12-02 13:56:52,117 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-02 13:56:52,221 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 1 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-12-02 13:56:52,222 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2023-12-02 13:56:52,222 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [653495445] [2023-12-02 13:56:52,222 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [653495445] provided 1 perfect and 0 imperfect interpolant sequences [2023-12-02 13:56:52,222 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-12-02 13:56:52,222 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2023-12-02 13:56:52,222 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1724135909] [2023-12-02 13:56:52,222 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-12-02 13:56:52,223 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2023-12-02 13:56:52,223 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2023-12-02 13:56:52,223 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2023-12-02 13:56:52,223 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2023-12-02 13:56:52,224 INFO L87 Difference]: Start difference. First operand 1740 states and 7568 transitions. Second operand has 4 states, 4 states have (on average 8.75) internal successors, (35), 3 states have internal predecessors, (35), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-12-02 13:56:52,383 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-12-02 13:56:52,383 INFO L93 Difference]: Finished difference Result 1896 states and 7926 transitions. [2023-12-02 13:56:52,384 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2023-12-02 13:56:52,384 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 8.75) internal successors, (35), 3 states have internal predecessors, (35), 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 35 [2023-12-02 13:56:52,384 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-12-02 13:56:52,398 INFO L225 Difference]: With dead ends: 1896 [2023-12-02 13:56:52,398 INFO L226 Difference]: Without dead ends: 1839 [2023-12-02 13:56:52,399 INFO L412 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 [2023-12-02 13:56:52,399 INFO L413 NwaCegarLoop]: 26 mSDtfsCounter, 58 mSDsluCounter, 38 mSDsCounter, 0 mSdLazyCounter, 79 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 58 SdHoareTripleChecker+Valid, 64 SdHoareTripleChecker+Invalid, 81 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 79 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2023-12-02 13:56:52,400 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [58 Valid, 64 Invalid, 81 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 79 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2023-12-02 13:56:52,406 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1839 states. [2023-12-02 13:56:52,467 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1839 to 1788. [2023-12-02 13:56:52,472 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1788 states, 1787 states have (on average 4.269725797425854) internal successors, (7630), 1787 states have internal predecessors, (7630), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-12-02 13:56:52,484 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1788 states to 1788 states and 7630 transitions. [2023-12-02 13:56:52,484 INFO L78 Accepts]: Start accepts. Automaton has 1788 states and 7630 transitions. Word has length 35 [2023-12-02 13:56:52,485 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-12-02 13:56:52,485 INFO L495 AbstractCegarLoop]: Abstraction has 1788 states and 7630 transitions. [2023-12-02 13:56:52,485 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 8.75) internal successors, (35), 3 states have internal predecessors, (35), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-12-02 13:56:52,485 INFO L276 IsEmpty]: Start isEmpty. Operand 1788 states and 7630 transitions. [2023-12-02 13:56:52,493 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 36 [2023-12-02 13:56:52,493 INFO L187 NwaCegarLoop]: Found error trace [2023-12-02 13:56:52,494 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-12-02 13:56:52,494 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable14 [2023-12-02 13:56:52,494 INFO L420 AbstractCegarLoop]: === Iteration 16 === Targeting ULTIMATE.startErr16ASSERT_VIOLATIONMEMORY_LEAK === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 19 more)] === [2023-12-02 13:56:52,494 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-12-02 13:56:52,495 INFO L85 PathProgramCache]: Analyzing trace with hash -12371776, now seen corresponding path program 2 times [2023-12-02 13:56:52,495 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2023-12-02 13:56:52,495 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2095915767] [2023-12-02 13:56:52,495 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-02 13:56:52,495 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-12-02 13:56:52,522 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-02 13:56:52,619 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 1 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-12-02 13:56:52,619 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2023-12-02 13:56:52,620 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2095915767] [2023-12-02 13:56:52,620 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2095915767] provided 1 perfect and 0 imperfect interpolant sequences [2023-12-02 13:56:52,620 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-12-02 13:56:52,620 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2023-12-02 13:56:52,620 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [725307536] [2023-12-02 13:56:52,620 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-12-02 13:56:52,621 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2023-12-02 13:56:52,621 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2023-12-02 13:56:52,621 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2023-12-02 13:56:52,621 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2023-12-02 13:56:52,622 INFO L87 Difference]: Start difference. First operand 1788 states and 7630 transitions. Second operand has 4 states, 4 states have (on average 8.75) internal successors, (35), 3 states have internal predecessors, (35), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-12-02 13:56:52,837 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-12-02 13:56:52,837 INFO L93 Difference]: Finished difference Result 2157 states and 9021 transitions. [2023-12-02 13:56:52,837 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2023-12-02 13:56:52,838 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 8.75) internal successors, (35), 3 states have internal predecessors, (35), 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 35 [2023-12-02 13:56:52,838 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-12-02 13:56:52,853 INFO L225 Difference]: With dead ends: 2157 [2023-12-02 13:56:52,853 INFO L226 Difference]: Without dead ends: 2157 [2023-12-02 13:56:52,854 INFO L412 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 [2023-12-02 13:56:52,854 INFO L413 NwaCegarLoop]: 29 mSDtfsCounter, 42 mSDsluCounter, 37 mSDsCounter, 0 mSdLazyCounter, 104 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 42 SdHoareTripleChecker+Valid, 66 SdHoareTripleChecker+Invalid, 105 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 104 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2023-12-02 13:56:52,855 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [42 Valid, 66 Invalid, 105 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 104 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2023-12-02 13:56:52,862 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2157 states. [2023-12-02 13:56:52,934 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2157 to 1950. [2023-12-02 13:56:52,939 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1950 states, 1949 states have (on average 4.305797845048743) internal successors, (8392), 1949 states have internal predecessors, (8392), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-12-02 13:56:52,951 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1950 states to 1950 states and 8392 transitions. [2023-12-02 13:56:52,951 INFO L78 Accepts]: Start accepts. Automaton has 1950 states and 8392 transitions. Word has length 35 [2023-12-02 13:56:52,951 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-12-02 13:56:52,951 INFO L495 AbstractCegarLoop]: Abstraction has 1950 states and 8392 transitions. [2023-12-02 13:56:52,952 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 8.75) internal successors, (35), 3 states have internal predecessors, (35), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-12-02 13:56:52,952 INFO L276 IsEmpty]: Start isEmpty. Operand 1950 states and 8392 transitions. [2023-12-02 13:56:52,960 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 36 [2023-12-02 13:56:52,961 INFO L187 NwaCegarLoop]: Found error trace [2023-12-02 13:56:52,961 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-12-02 13:56:52,961 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable15 [2023-12-02 13:56:52,961 INFO L420 AbstractCegarLoop]: === Iteration 17 === Targeting ULTIMATE.startErr16ASSERT_VIOLATIONMEMORY_LEAK === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 19 more)] === [2023-12-02 13:56:52,962 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-12-02 13:56:52,962 INFO L85 PathProgramCache]: Analyzing trace with hash 488306045, now seen corresponding path program 2 times [2023-12-02 13:56:52,962 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2023-12-02 13:56:52,962 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2130836603] [2023-12-02 13:56:52,962 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-02 13:56:52,962 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-12-02 13:56:52,987 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-02 13:56:53,085 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 1 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-12-02 13:56:53,085 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2023-12-02 13:56:53,085 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2130836603] [2023-12-02 13:56:53,085 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2130836603] provided 1 perfect and 0 imperfect interpolant sequences [2023-12-02 13:56:53,086 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-12-02 13:56:53,086 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2023-12-02 13:56:53,086 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1822773407] [2023-12-02 13:56:53,086 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-12-02 13:56:53,087 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2023-12-02 13:56:53,087 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2023-12-02 13:56:53,087 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2023-12-02 13:56:53,087 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2023-12-02 13:56:53,088 INFO L87 Difference]: Start difference. First operand 1950 states and 8392 transitions. Second operand has 4 states, 4 states have (on average 8.75) internal successors, (35), 3 states have internal predecessors, (35), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-12-02 13:56:53,261 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-12-02 13:56:53,261 INFO L93 Difference]: Finished difference Result 2157 states and 8940 transitions. [2023-12-02 13:56:53,262 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2023-12-02 13:56:53,262 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 8.75) internal successors, (35), 3 states have internal predecessors, (35), 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 35 [2023-12-02 13:56:53,262 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-12-02 13:56:53,275 INFO L225 Difference]: With dead ends: 2157 [2023-12-02 13:56:53,275 INFO L226 Difference]: Without dead ends: 2121 [2023-12-02 13:56:53,275 INFO L412 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 [2023-12-02 13:56:53,276 INFO L413 NwaCegarLoop]: 25 mSDtfsCounter, 78 mSDsluCounter, 31 mSDsCounter, 0 mSdLazyCounter, 87 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 78 SdHoareTripleChecker+Valid, 56 SdHoareTripleChecker+Invalid, 89 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 87 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2023-12-02 13:56:53,276 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [78 Valid, 56 Invalid, 89 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 87 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2023-12-02 13:56:53,283 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2121 states. [2023-12-02 13:56:53,346 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2121 to 1992. [2023-12-02 13:56:53,351 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1992 states, 1991 states have (on average 4.246609743847313) internal successors, (8455), 1991 states have internal predecessors, (8455), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-12-02 13:56:53,362 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1992 states to 1992 states and 8455 transitions. [2023-12-02 13:56:53,362 INFO L78 Accepts]: Start accepts. Automaton has 1992 states and 8455 transitions. Word has length 35 [2023-12-02 13:56:53,362 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-12-02 13:56:53,362 INFO L495 AbstractCegarLoop]: Abstraction has 1992 states and 8455 transitions. [2023-12-02 13:56:53,363 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 8.75) internal successors, (35), 3 states have internal predecessors, (35), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-12-02 13:56:53,363 INFO L276 IsEmpty]: Start isEmpty. Operand 1992 states and 8455 transitions. [2023-12-02 13:56:53,371 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 37 [2023-12-02 13:56:53,371 INFO L187 NwaCegarLoop]: Found error trace [2023-12-02 13:56:53,371 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-12-02 13:56:53,371 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable16 [2023-12-02 13:56:53,372 INFO L420 AbstractCegarLoop]: === Iteration 18 === Targeting ULTIMATE.startErr16ASSERT_VIOLATIONMEMORY_LEAK === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 19 more)] === [2023-12-02 13:56:53,372 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-12-02 13:56:53,372 INFO L85 PathProgramCache]: Analyzing trace with hash 1291022220, now seen corresponding path program 1 times [2023-12-02 13:56:53,373 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2023-12-02 13:56:53,373 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1321062753] [2023-12-02 13:56:53,373 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-02 13:56:53,373 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-12-02 13:56:53,475 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-02 13:56:54,287 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-12-02 13:56:54,287 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2023-12-02 13:56:54,287 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1321062753] [2023-12-02 13:56:54,287 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1321062753] provided 0 perfect and 1 imperfect interpolant sequences [2023-12-02 13:56:54,288 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [720334838] [2023-12-02 13:56:54,288 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-02 13:56:54,288 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-12-02 13:56:54,288 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_9284ea18-4b33-4bf4-84e1-1ddf9a674761/bin/utaipan-verify-nQ1chXbOIh/z3 [2023-12-02 13:56:54,289 INFO L229 MonitoredProcess]: Starting monitored process 5 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_9284ea18-4b33-4bf4-84e1-1ddf9a674761/bin/utaipan-verify-nQ1chXbOIh/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2023-12-02 13:56:54,292 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_9284ea18-4b33-4bf4-84e1-1ddf9a674761/bin/utaipan-verify-nQ1chXbOIh/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Waiting until timeout for monitored process [2023-12-02 13:56:54,608 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-02 13:56:54,610 INFO L262 TraceCheckSpWp]: Trace formula consists of 253 conjuncts, 9 conjunts are in the unsatisfiable core [2023-12-02 13:56:54,614 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-12-02 13:58:00,869 WARN L293 SmtUtils]: Spent 8.69s on a formula simplification that was a NOOP. DAG size: 33 (called from [L 391] de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.predicates.PredicateUnifier.getOrConstructPredicate) [2023-12-02 13:58:55,859 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 1 refuted. 1 times theorem prover too weak. 0 trivial. 0 not checked. [2023-12-02 13:58:55,859 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2023-12-02 13:59:23,768 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-12-02 13:59:23,769 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [720334838] provided 0 perfect and 2 imperfect interpolant sequences [2023-12-02 13:59:23,769 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSifa [1130200896] [2023-12-02 13:59:23,769 FATAL L? ?]: Ignoring exception! java.lang.UnsupportedOperationException: Cannot create path program transition for IcfgForkThreadOtherTransition at de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder.cfg.PathProgram$PathProgramConstructor.createPathProgramTransition(PathProgram.java:295) at de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder.cfg.PathProgram$PathProgramConstructor.createPathProgramTransition(PathProgram.java:270) at java.base/java.util.stream.ForEachOps$ForEachOp$OfRef.accept(ForEachOps.java:183) at java.base/java.util.stream.ReferencePipeline$2$1.accept(ReferencePipeline.java:177) at java.base/java.util.HashMap$KeySpliterator.forEachRemaining(HashMap.java:1621) at java.base/java.util.stream.AbstractPipeline.copyInto(AbstractPipeline.java:484) at java.base/java.util.stream.AbstractPipeline.wrapAndCopyInto(AbstractPipeline.java:474) at java.base/java.util.stream.ForEachOps$ForEachOp.evaluateSequential(ForEachOps.java:150) at java.base/java.util.stream.ForEachOps$ForEachOp$OfRef.evaluateSequential(ForEachOps.java:173) at java.base/java.util.stream.AbstractPipeline.evaluate(AbstractPipeline.java:234) at java.base/java.util.stream.ReferencePipeline.forEach(ReferencePipeline.java:497) at de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder.cfg.PathProgram$PathProgramConstructor.(PathProgram.java:235) at de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder.cfg.PathProgram.constructPathProgram(PathProgram.java:112) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.SifaRunner.(SifaRunner.java:91) 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:337) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.AbstractCegarLoop.iterate(AbstractCegarLoop.java:431) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.AbstractCegarLoop.startCegar(AbstractCegarLoop.java:366) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.AbstractCegarLoop.runCegar(AbstractCegarLoop.java:348) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.executeCegarLoop(TraceAbstractionStarter.java:415) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.analyseProgram(TraceAbstractionStarter.java:302) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.analyseConcurrentProgram(TraceAbstractionStarter.java:225) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.runCegarLoops(TraceAbstractionStarter.java:173) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.(TraceAbstractionStarter.java:154) 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) [2023-12-02 13:59:23,770 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2023-12-02 13:59:23,770 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [6, 7, 6] total 16 [2023-12-02 13:59:23,770 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1278582351] [2023-12-02 13:59:23,770 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2023-12-02 13:59:23,770 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 17 states [2023-12-02 13:59:23,771 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2023-12-02 13:59:23,771 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 17 interpolants. [2023-12-02 13:59:23,771 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=56, Invalid=185, Unknown=31, NotChecked=0, Total=272 [2023-12-02 13:59:23,771 INFO L87 Difference]: Start difference. First operand 1992 states and 8455 transitions. Second operand has 17 states, 17 states have (on average 5.647058823529412) internal successors, (96), 16 states have internal predecessors, (96), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-12-02 13:59:24,860 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.00s for a HTC check with result VALID. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [] [2023-12-02 14:00:02,013 WARN L293 SmtUtils]: Spent 26.22s on a formula simplification. DAG size of input: 85 DAG size of output: 76 (called from [L 391] de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.predicates.PredicateUnifier.getOrConstructPredicate) [2023-12-02 14:00:04,924 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [] [2023-12-02 14:00:07,348 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [] [2023-12-02 14:00:10,296 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.01s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [] [2023-12-02 14:00:13,016 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [] [2023-12-02 14:00:15,020 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [] [2023-12-02 14:00:16,424 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.40s for a HTC check with result INVALID. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [] [2023-12-02 14:00:18,431 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.01s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [] [2023-12-02 14:00:20,500 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [] [2023-12-02 14:00:22,505 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [] [2023-12-02 14:00:24,511 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.01s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [] [2023-12-02 14:00:26,523 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.01s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [] [2023-12-02 14:00:28,538 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.01s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [] [2023-12-02 14:00:30,970 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [] [2023-12-02 14:00:42,957 WARN L293 SmtUtils]: Spent 7.81s on a formula simplification. DAG size of input: 73 DAG size of output: 46 (called from [L 391] de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.predicates.PredicateUnifier.getOrConstructPredicate) [2023-12-02 14:00:44,749 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.47s for a HTC check with result INVALID. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2023-12-02 14:00:47,073 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [] [2023-12-02 14:00:48,563 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.47s for a HTC check with result INVALID. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [] [2023-12-02 14:00:50,230 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.36s for a HTC check with result INVALID. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [] [2023-12-02 14:00:54,970 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [] [2023-12-02 14:00:56,417 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.45s for a HTC check with result INVALID. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [] [2023-12-02 14:00:58,458 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.50s for a HTC check with result INVALID. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [] [2023-12-02 14:01:00,462 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [] [2023-12-02 14:01:02,468 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.01s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [] [2023-12-02 14:01:04,488 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.02s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [] [2023-12-02 14:01:06,508 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.02s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [] [2023-12-02 14:01:08,518 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.01s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [] [2023-12-02 14:01:10,527 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.01s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [] [2023-12-02 14:01:12,535 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.01s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [] [2023-12-02 14:01:14,451 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.92s for a HTC check with result INVALID. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [] [2023-12-02 14:01:16,466 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.01s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [] [2023-12-02 14:01:18,482 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.02s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [] [2023-12-02 14:01:20,944 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.01s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [] [2023-12-02 14:01:22,952 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.01s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [] [2023-12-02 14:01:24,960 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.01s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [] [2023-12-02 14:01:26,963 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [] [2023-12-02 14:01:28,974 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.01s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [] [2023-12-02 14:01:30,987 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.01s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [] [2023-12-02 14:01:32,992 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [] [2023-12-02 14:01:35,002 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.01s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [] [2023-12-02 14:01:37,020 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.02s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [] [2023-12-02 14:01:39,027 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.01s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [] [2023-12-02 14:01:40,312 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.27s for a HTC check with result INVALID. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [] [2023-12-02 14:01:42,322 WARN L854 $PredicateComparison]: unable to prove that (let ((.cse0 (* (div c_~x2~0 4294967296) 4294967296))) (let ((.cse2 (+ (* 4294967296 (div c_~x1~0 4294967296)) c_~x2~0)) (.cse1 (+ c_~x1~0 .cse0)) (.cse3 (mod c_~n~0 4294967296)) (.cse5 (mod (* 4294967295 (div (* (- 1) c_~x1~0) 2)) 4294967296)) (.cse4 (mod c_~x3~0 4294967296))) (and (or (< (+ 2 (* 4294967296 (div c_~n~0 4294967296)) c_~x2~0) (+ c_~n~0 .cse0)) (= .cse1 .cse2)) (= (mod c_~x2~0 2) 0) (<= .cse3 (mod c_~x1~0 4294967296)) (= .cse4 (mod c_~x4~0 4294967296)) (= (+ (* 4294967296 (div c_~x3~0 4294967296)) c_~x4~0) (+ c_~x3~0 (* (div c_~x4~0 4294967296) 4294967296))) (<= .cse2 .cse1) (= (mod c_~x1~0 2) 0) (<= (+ .cse5 1) .cse3) (= (mod (* (div (* (- 1) c_~x2~0) 2) 4294967295) 4294967296) .cse5) (<= 1 .cse4)))) is different from false [2023-12-02 14:01:44,618 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [] [2023-12-02 14:01:46,623 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [] [2023-12-02 14:01:55,597 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.64s for a HTC check with result INVALID. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [] [2023-12-02 14:01:57,614 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [] [2023-12-02 14:02:00,230 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [] [2023-12-02 14:02:02,258 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [] [2023-12-02 14:02:04,358 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.49s for a HTC check with result INVALID. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [] [2023-12-02 14:02:09,581 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.01s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [] [2023-12-02 14:02:11,738 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [] [2023-12-02 14:02:13,742 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [] [2023-12-02 14:02:15,747 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [] [2023-12-02 14:02:18,194 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.01s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [] [2023-12-02 14:02:20,200 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.01s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [] [2023-12-02 14:02:22,205 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [] [2023-12-02 14:02:25,849 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.01s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [] [2023-12-02 14:02:29,222 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.99s for a HTC check with result INVALID. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [] [2023-12-02 14:02:31,227 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [] [2023-12-02 14:02:33,240 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.01s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [] [2023-12-02 14:02:35,113 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.86s for a HTC check with result INVALID. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [] [2023-12-02 14:02:37,045 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.58s for a HTC check with result INVALID. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [] [2023-12-02 14:02:39,879 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [] [2023-12-02 14:02:41,287 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.34s for a HTC check with result INVALID. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [] [2023-12-02 14:02:45,167 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.99s for a HTC check with result INVALID. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [] [2023-12-02 14:02:47,238 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [] [2023-12-02 14:02:48,463 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.22s for a HTC check with result INVALID. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [] [2023-12-02 14:02:49,755 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.29s for a HTC check with result INVALID. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [] [2023-12-02 14:02:56,643 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.83s for a HTC check with result INVALID. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [] [2023-12-02 14:02:58,141 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.31s for a HTC check with result INVALID. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [] [2023-12-02 14:02:59,220 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.08s for a HTC check with result INVALID. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [] [2023-12-02 14:03:02,381 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [] [2023-12-02 14:03:03,994 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.06s for a HTC check with result INVALID. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [] [2023-12-02 14:03:05,945 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.94s for a HTC check with result INVALID. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [] [2023-12-02 14:03:07,231 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.08s for a HTC check with result INVALID. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [] [2023-12-02 14:03:09,404 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [] [2023-12-02 14:03:12,978 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-12-02 14:03:12,978 INFO L93 Difference]: Finished difference Result 3158 states and 12877 transitions. [2023-12-02 14:03:12,979 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2023-12-02 14:03:12,979 INFO L78 Accepts]: Start accepts. Automaton has has 17 states, 17 states have (on average 5.647058823529412) internal successors, (96), 16 states have internal predecessors, (96), 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 36 [2023-12-02 14:03:12,979 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-12-02 14:03:12,990 INFO L225 Difference]: With dead ends: 3158 [2023-12-02 14:03:12,990 INFO L226 Difference]: Without dead ends: 3042 [2023-12-02 14:03:12,990 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 84 GetRequests, 60 SyntacticMatches, 2 SemanticMatches, 22 ConstructedPredicates, 1 IntricatePredicates, 0 DeprecatedPredicates, 101 ImplicationChecksByTransitivity, 139.4s TimeCoverageRelationStatistics Valid=114, Invalid=359, Unknown=37, NotChecked=42, Total=552 [2023-12-02 14:03:12,991 INFO L413 NwaCegarLoop]: 49 mSDtfsCounter, 278 mSDsluCounter, 388 mSDsCounter, 0 mSdLazyCounter, 648 mSolverCounterSat, 13 mSolverCounterUnsat, 52 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 168.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 278 SdHoareTripleChecker+Valid, 437 SdHoareTripleChecker+Invalid, 985 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 13 IncrementalHoareTripleChecker+Valid, 648 IncrementalHoareTripleChecker+Invalid, 52 IncrementalHoareTripleChecker+Unknown, 272 IncrementalHoareTripleChecker+Unchecked, 168.8s IncrementalHoareTripleChecker+Time [2023-12-02 14:03:12,991 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [278 Valid, 437 Invalid, 985 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [13 Valid, 648 Invalid, 52 Unknown, 272 Unchecked, 168.8s Time] [2023-12-02 14:03:12,996 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3042 states. [2023-12-02 14:03:13,061 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3042 to 2325. [2023-12-02 14:03:13,064 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 2325 states, 2324 states have (on average 4.293459552495697) internal successors, (9978), 2324 states have internal predecessors, (9978), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-12-02 14:03:13,072 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2325 states to 2325 states and 9978 transitions. [2023-12-02 14:03:13,072 INFO L78 Accepts]: Start accepts. Automaton has 2325 states and 9978 transitions. Word has length 36 [2023-12-02 14:03:13,072 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-12-02 14:03:13,072 INFO L495 AbstractCegarLoop]: Abstraction has 2325 states and 9978 transitions. [2023-12-02 14:03:13,072 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 17 states, 17 states have (on average 5.647058823529412) internal successors, (96), 16 states have internal predecessors, (96), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-12-02 14:03:13,072 INFO L276 IsEmpty]: Start isEmpty. Operand 2325 states and 9978 transitions. [2023-12-02 14:03:13,078 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 37 [2023-12-02 14:03:13,078 INFO L187 NwaCegarLoop]: Found error trace [2023-12-02 14:03:13,078 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-12-02 14:03:13,083 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_9284ea18-4b33-4bf4-84e1-1ddf9a674761/bin/utaipan-verify-nQ1chXbOIh/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Ended with exit code 0 [2023-12-02 14:03:13,279 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 5 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_9284ea18-4b33-4bf4-84e1-1ddf9a674761/bin/utaipan-verify-nQ1chXbOIh/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable17 [2023-12-02 14:03:13,279 INFO L420 AbstractCegarLoop]: === Iteration 19 === Targeting ULTIMATE.startErr16ASSERT_VIOLATIONMEMORY_LEAK === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 19 more)] === [2023-12-02 14:03:13,280 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-12-02 14:03:13,280 INFO L85 PathProgramCache]: Analyzing trace with hash 344777868, now seen corresponding path program 2 times [2023-12-02 14:03:13,280 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2023-12-02 14:03:13,280 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [332247533] [2023-12-02 14:03:13,280 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-02 14:03:13,280 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-12-02 14:03:13,329 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-02 14:03:13,923 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-12-02 14:03:13,923 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2023-12-02 14:03:13,923 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [332247533] [2023-12-02 14:03:13,923 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [332247533] provided 0 perfect and 1 imperfect interpolant sequences [2023-12-02 14:03:13,924 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [746750926] [2023-12-02 14:03:13,924 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2023-12-02 14:03:13,924 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-12-02 14:03:13,924 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_9284ea18-4b33-4bf4-84e1-1ddf9a674761/bin/utaipan-verify-nQ1chXbOIh/z3 [2023-12-02 14:03:13,925 INFO L229 MonitoredProcess]: Starting monitored process 6 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_9284ea18-4b33-4bf4-84e1-1ddf9a674761/bin/utaipan-verify-nQ1chXbOIh/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2023-12-02 14:03:13,927 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_9284ea18-4b33-4bf4-84e1-1ddf9a674761/bin/utaipan-verify-nQ1chXbOIh/z3 -smt2 -in SMTLIB2_COMPLIANT=true (6)] Waiting until timeout for monitored process [2023-12-02 14:03:16,531 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 2 check-sat command(s) [2023-12-02 14:03:16,531 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2023-12-02 14:03:16,534 INFO L262 TraceCheckSpWp]: Trace formula consists of 253 conjuncts, 10 conjunts are in the unsatisfiable core [2023-12-02 14:03:16,536 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-12-02 14:03:45,322 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-12-02 14:03:45,322 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2023-12-02 14:03:51,158 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-12-02 14:03:51,158 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [746750926] provided 0 perfect and 2 imperfect interpolant sequences [2023-12-02 14:03:51,158 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSifa [2142601768] [2023-12-02 14:03:51,160 FATAL L? ?]: Ignoring exception! java.lang.UnsupportedOperationException: Cannot create path program transition for IcfgForkThreadOtherTransition at de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder.cfg.PathProgram$PathProgramConstructor.createPathProgramTransition(PathProgram.java:295) at de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder.cfg.PathProgram$PathProgramConstructor.createPathProgramTransition(PathProgram.java:270) at java.base/java.util.stream.ForEachOps$ForEachOp$OfRef.accept(ForEachOps.java:183) at java.base/java.util.stream.ReferencePipeline$2$1.accept(ReferencePipeline.java:177) at java.base/java.util.HashMap$KeySpliterator.forEachRemaining(HashMap.java:1621) at java.base/java.util.stream.AbstractPipeline.copyInto(AbstractPipeline.java:484) at java.base/java.util.stream.AbstractPipeline.wrapAndCopyInto(AbstractPipeline.java:474) at java.base/java.util.stream.ForEachOps$ForEachOp.evaluateSequential(ForEachOps.java:150) at java.base/java.util.stream.ForEachOps$ForEachOp$OfRef.evaluateSequential(ForEachOps.java:173) at java.base/java.util.stream.AbstractPipeline.evaluate(AbstractPipeline.java:234) at java.base/java.util.stream.ReferencePipeline.forEach(ReferencePipeline.java:497) at de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder.cfg.PathProgram$PathProgramConstructor.(PathProgram.java:235) at de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder.cfg.PathProgram.constructPathProgram(PathProgram.java:112) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.SifaRunner.(SifaRunner.java:91) 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:337) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.AbstractCegarLoop.iterate(AbstractCegarLoop.java:431) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.AbstractCegarLoop.startCegar(AbstractCegarLoop.java:366) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.AbstractCegarLoop.runCegar(AbstractCegarLoop.java:348) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.executeCegarLoop(TraceAbstractionStarter.java:415) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.analyseProgram(TraceAbstractionStarter.java:302) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.analyseConcurrentProgram(TraceAbstractionStarter.java:225) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.runCegarLoops(TraceAbstractionStarter.java:173) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.(TraceAbstractionStarter.java:154) 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) [2023-12-02 14:03:51,160 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2023-12-02 14:03:51,160 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [6, 7, 7] total 17 [2023-12-02 14:03:51,160 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2145199961] [2023-12-02 14:03:51,160 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2023-12-02 14:03:51,161 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 18 states [2023-12-02 14:03:51,161 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2023-12-02 14:03:51,162 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 18 interpolants. [2023-12-02 14:03:51,162 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=90, Invalid=213, Unknown=3, NotChecked=0, Total=306 [2023-12-02 14:03:51,162 INFO L87 Difference]: Start difference. First operand 2325 states and 9978 transitions. Second operand has 18 states, 18 states have (on average 5.444444444444445) internal successors, (98), 17 states have internal predecessors, (98), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-12-02 14:04:16,289 WARN L293 SmtUtils]: Spent 20.56s on a formula simplification. DAG size of input: 74 DAG size of output: 66 (called from [L 391] de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.predicates.PredicateUnifier.getOrConstructPredicate) [2023-12-02 14:04:19,020 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.01s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [] [2023-12-02 14:04:21,027 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.01s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [] [2023-12-02 14:04:22,312 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.19s for a HTC check with result INVALID. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [] [2023-12-02 14:04:24,259 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.95s for a HTC check with result INVALID. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [] [2023-12-02 14:04:37,159 WARN L293 SmtUtils]: Spent 6.23s on a formula simplification. DAG size of input: 57 DAG size of output: 50 (called from [L 391] de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.predicates.PredicateUnifier.getOrConstructPredicate) [2023-12-02 14:04:41,899 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [] [2023-12-02 14:04:44,458 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [] [2023-12-02 14:04:46,462 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [] [2023-12-02 14:04:48,481 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [] [2023-12-02 14:04:50,632 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.01s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [] [2023-12-02 14:04:52,669 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.04s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [] [2023-12-02 14:04:54,676 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.01s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [] [2023-12-02 14:04:57,211 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [] [2023-12-02 14:04:59,858 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.90s for a HTC check with result INVALID. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [] [2023-12-02 14:05:01,846 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.97s for a HTC check with result INVALID. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [] [2023-12-02 14:05:04,086 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [] [2023-12-02 14:05:06,391 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [] [2023-12-02 14:05:08,716 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [] [2023-12-02 14:05:15,529 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.68s for a HTC check with result INVALID. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [] [2023-12-02 14:05:18,224 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [] [2023-12-02 14:05:20,830 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.21s for a HTC check with result VALID. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [] [2023-12-02 14:05:24,849 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.88s for a HTC check with result VALID. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [] [2023-12-02 14:05:26,978 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [] [2023-12-02 14:05:28,502 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-12-02 14:05:28,503 INFO L93 Difference]: Finished difference Result 4523 states and 18025 transitions. [2023-12-02 14:05:28,503 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 18 states. [2023-12-02 14:05:28,503 INFO L78 Accepts]: Start accepts. Automaton has has 18 states, 18 states have (on average 5.444444444444445) internal successors, (98), 17 states have internal predecessors, (98), 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 36 [2023-12-02 14:05:28,503 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-12-02 14:05:28,525 INFO L225 Difference]: With dead ends: 4523 [2023-12-02 14:05:28,525 INFO L226 Difference]: Without dead ends: 4300 [2023-12-02 14:05:28,525 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 85 GetRequests, 59 SyntacticMatches, 1 SemanticMatches, 25 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 207 ImplicationChecksByTransitivity, 77.2s TimeCoverageRelationStatistics Valid=190, Invalid=504, Unknown=8, NotChecked=0, Total=702 [2023-12-02 14:05:28,526 INFO L413 NwaCegarLoop]: 64 mSDtfsCounter, 420 mSDsluCounter, 370 mSDsCounter, 0 mSdLazyCounter, 610 mSolverCounterSat, 34 mSolverCounterUnsat, 15 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 51.7s Time, 0 mProtectedPredicate, 0 mProtectedAction, 420 SdHoareTripleChecker+Valid, 434 SdHoareTripleChecker+Invalid, 659 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 34 IncrementalHoareTripleChecker+Valid, 610 IncrementalHoareTripleChecker+Invalid, 15 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 52.1s IncrementalHoareTripleChecker+Time [2023-12-02 14:05:28,526 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [420 Valid, 434 Invalid, 659 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [34 Valid, 610 Invalid, 15 Unknown, 0 Unchecked, 52.1s Time] [2023-12-02 14:05:28,535 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 4300 states. [2023-12-02 14:05:28,609 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 4300 to 2313. [2023-12-02 14:05:28,613 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 2313 states, 2312 states have (on average 4.250865051903114) internal successors, (9828), 2312 states have internal predecessors, (9828), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-12-02 14:05:28,622 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2313 states to 2313 states and 9828 transitions. [2023-12-02 14:05:28,622 INFO L78 Accepts]: Start accepts. Automaton has 2313 states and 9828 transitions. Word has length 36 [2023-12-02 14:05:28,623 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-12-02 14:05:28,623 INFO L495 AbstractCegarLoop]: Abstraction has 2313 states and 9828 transitions. [2023-12-02 14:05:28,623 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 18 states, 18 states have (on average 5.444444444444445) internal successors, (98), 17 states have internal predecessors, (98), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-12-02 14:05:28,623 INFO L276 IsEmpty]: Start isEmpty. Operand 2313 states and 9828 transitions. [2023-12-02 14:05:28,629 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 37 [2023-12-02 14:05:28,629 INFO L187 NwaCegarLoop]: Found error trace [2023-12-02 14:05:28,629 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-12-02 14:05:28,635 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_9284ea18-4b33-4bf4-84e1-1ddf9a674761/bin/utaipan-verify-nQ1chXbOIh/z3 -smt2 -in SMTLIB2_COMPLIANT=true (6)] Ended with exit code 0 [2023-12-02 14:05:28,830 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable18,6 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_9284ea18-4b33-4bf4-84e1-1ddf9a674761/bin/utaipan-verify-nQ1chXbOIh/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-12-02 14:05:28,830 INFO L420 AbstractCegarLoop]: === Iteration 20 === Targeting ULTIMATE.startErr16ASSERT_VIOLATIONMEMORY_LEAK === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 19 more)] === [2023-12-02 14:05:28,830 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-12-02 14:05:28,831 INFO L85 PathProgramCache]: Analyzing trace with hash -1350928890, now seen corresponding path program 1 times [2023-12-02 14:05:28,831 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2023-12-02 14:05:28,831 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1656851991] [2023-12-02 14:05:28,831 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-02 14:05:28,831 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-12-02 14:05:28,875 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-02 14:05:29,453 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-12-02 14:05:29,453 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2023-12-02 14:05:29,453 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1656851991] [2023-12-02 14:05:29,453 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1656851991] provided 0 perfect and 1 imperfect interpolant sequences [2023-12-02 14:05:29,453 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [2133420733] [2023-12-02 14:05:29,453 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-02 14:05:29,454 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-12-02 14:05:29,454 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_9284ea18-4b33-4bf4-84e1-1ddf9a674761/bin/utaipan-verify-nQ1chXbOIh/z3 [2023-12-02 14:05:29,455 INFO L229 MonitoredProcess]: Starting monitored process 7 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_9284ea18-4b33-4bf4-84e1-1ddf9a674761/bin/utaipan-verify-nQ1chXbOIh/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2023-12-02 14:05:29,457 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_9284ea18-4b33-4bf4-84e1-1ddf9a674761/bin/utaipan-verify-nQ1chXbOIh/z3 -smt2 -in SMTLIB2_COMPLIANT=true (7)] Waiting until timeout for monitored process [2023-12-02 14:05:31,310 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-02 14:05:31,313 INFO L262 TraceCheckSpWp]: Trace formula consists of 253 conjuncts, 9 conjunts are in the unsatisfiable core [2023-12-02 14:05:31,315 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-12-02 14:06:17,873 WARN L293 SmtUtils]: Spent 5.30s on a formula simplification that was a NOOP. DAG size: 33 (called from [L 391] de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.predicates.PredicateUnifier.getOrConstructPredicate) [2023-12-02 14:06:43,580 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 1 refuted. 1 times theorem prover too weak. 0 trivial. 0 not checked. [2023-12-02 14:06:43,580 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2023-12-02 14:07:07,006 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-12-02 14:07:07,006 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [2133420733] provided 0 perfect and 2 imperfect interpolant sequences [2023-12-02 14:07:07,006 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSifa [1697613471] [2023-12-02 14:07:07,007 FATAL L? ?]: Ignoring exception! java.lang.UnsupportedOperationException: Cannot create path program transition for IcfgForkThreadOtherTransition at de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder.cfg.PathProgram$PathProgramConstructor.createPathProgramTransition(PathProgram.java:295) at de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder.cfg.PathProgram$PathProgramConstructor.createPathProgramTransition(PathProgram.java:270) at java.base/java.util.stream.ForEachOps$ForEachOp$OfRef.accept(ForEachOps.java:183) at java.base/java.util.stream.ReferencePipeline$2$1.accept(ReferencePipeline.java:177) at java.base/java.util.HashMap$KeySpliterator.forEachRemaining(HashMap.java:1621) at java.base/java.util.stream.AbstractPipeline.copyInto(AbstractPipeline.java:484) at java.base/java.util.stream.AbstractPipeline.wrapAndCopyInto(AbstractPipeline.java:474) at java.base/java.util.stream.ForEachOps$ForEachOp.evaluateSequential(ForEachOps.java:150) at java.base/java.util.stream.ForEachOps$ForEachOp$OfRef.evaluateSequential(ForEachOps.java:173) at java.base/java.util.stream.AbstractPipeline.evaluate(AbstractPipeline.java:234) at java.base/java.util.stream.ReferencePipeline.forEach(ReferencePipeline.java:497) at de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder.cfg.PathProgram$PathProgramConstructor.(PathProgram.java:235) at de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder.cfg.PathProgram.constructPathProgram(PathProgram.java:112) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.SifaRunner.(SifaRunner.java:91) 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:337) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.AbstractCegarLoop.iterate(AbstractCegarLoop.java:431) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.AbstractCegarLoop.startCegar(AbstractCegarLoop.java:366) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.AbstractCegarLoop.runCegar(AbstractCegarLoop.java:348) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.executeCegarLoop(TraceAbstractionStarter.java:415) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.analyseProgram(TraceAbstractionStarter.java:302) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.analyseConcurrentProgram(TraceAbstractionStarter.java:225) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.runCegarLoops(TraceAbstractionStarter.java:173) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.(TraceAbstractionStarter.java:154) 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) [2023-12-02 14:07:07,007 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2023-12-02 14:07:07,007 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [6, 6, 6] total 15 [2023-12-02 14:07:07,008 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [313117046] [2023-12-02 14:07:07,008 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2023-12-02 14:07:07,008 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 16 states [2023-12-02 14:07:07,008 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2023-12-02 14:07:07,009 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 16 interpolants. [2023-12-02 14:07:07,009 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=50, Invalid=166, Unknown=24, NotChecked=0, Total=240 [2023-12-02 14:07:07,009 INFO L87 Difference]: Start difference. First operand 2313 states and 9828 transitions. Second operand has 16 states, 16 states have (on average 6.3125) internal successors, (101), 15 states have internal predecessors, (101), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-12-02 14:07:11,409 WARN L854 $PredicateComparison]: unable to prove that (let ((.cse10 (* (- 1) c_~x4~0))) (let ((.cse3 (div c_~x3~0 2147483648)) (.cse1 (* 2 (mod c_~x3~0 2147483648))) (.cse0 (mod c_~x1~0 4294967296)) (.cse5 (= (+ c_~x1~0 (* (div c_~x2~0 4294967296) 4294967296)) (+ (* 4294967296 (div c_~x1~0 4294967296)) c_~x2~0))) (.cse7 (mod (* (div .cse10 2) 4294967295) 4294967296)) (.cse2 (mod c_~n~0 4294967296)) (.cse8 (mod c_~x3~0 4294967296)) (.cse4 (* c_~x3~0 2)) (.cse9 (* 4294967296 (div c_~n~0 4294967296)))) (and (= .cse0 (mod c_~x2~0 4294967296)) (or (< .cse1 .cse2) (and (= (+ (* 4294967296 .cse3) c_~x4~0) (+ .cse4 (* (div c_~x4~0 4294967296) 4294967296))) .cse5)) (let ((.cse6 (+ (mod c_~x4~0 4294967296) 1))) (or (< (* (mod c_~x4~0 2147483648) 2) .cse6) (and (= (+ (* (div c_~x4~0 2147483648) 2147483648) c_~x3~0) (+ (* 2147483648 .cse3) c_~x4~0)) .cse5) (< .cse1 .cse6))) (= .cse7 .cse8) (<= 1 .cse0) .cse5 (<= (+ .cse7 1) .cse2) (<= (+ .cse4 2 .cse9) (+ c_~n~0 (* (div (+ .cse4 .cse10) 4294967296) 4294967296) c_~x4~0)) (<= 1 .cse8) (= (mod c_~x4~0 2) 0) (<= (+ .cse4 .cse9) (+ (* 4294967296 (div (+ (- 1) c_~x3~0 (* (div (+ (- 1) c_~x3~0 .cse10 c_~n~0) 2147483648) 2147483648)) 4294967296)) c_~x4~0))))) is different from false [2023-12-02 14:07:30,176 WARN L293 SmtUtils]: Spent 6.56s on a formula simplification. DAG size of input: 54 DAG size of output: 47 (called from [L 391] de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.predicates.PredicateUnifier.getOrConstructPredicate) [2023-12-02 14:07:46,073 WARN L293 SmtUtils]: Spent 7.71s on a formula simplification. DAG size of input: 58 DAG size of output: 51 (called from [L 391] de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.predicates.PredicateUnifier.getOrConstructPredicate) [2023-12-02 14:07:50,292 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.01s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2023-12-02 14:07:52,304 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2023-12-02 14:07:54,046 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.74s for a HTC check with result INVALID. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [] [2023-12-02 14:07:56,049 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [] [2023-12-02 14:07:58,054 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.01s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [] [2023-12-02 14:07:59,935 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.27s for a HTC check with result INVALID. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [] [2023-12-02 14:08:01,339 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.40s for a HTC check with result INVALID. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [] [2023-12-02 14:08:03,363 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [] [2023-12-02 14:08:05,368 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [] [2023-12-02 14:08:07,413 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [] [2023-12-02 14:08:21,653 WARN L293 SmtUtils]: Spent 9.90s on a formula simplification. DAG size of input: 69 DAG size of output: 48 (called from [L 391] de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.predicates.PredicateUnifier.getOrConstructPredicate) [2023-12-02 14:08:23,657 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [] [2023-12-02 14:08:25,664 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [] [2023-12-02 14:08:27,673 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.01s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [] [2023-12-02 14:08:29,692 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [] [2023-12-02 14:08:31,697 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [] [2023-12-02 14:08:33,846 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [] [2023-12-02 14:08:36,210 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [] [2023-12-02 14:08:38,217 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.01s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [] [2023-12-02 14:08:40,224 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.01s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [] [2023-12-02 14:08:41,332 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.11s for a HTC check with result INVALID. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [] [2023-12-02 14:08:43,346 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.01s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [] [2023-12-02 14:08:45,623 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [] [2023-12-02 14:08:48,228 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.02s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [] [2023-12-02 14:08:50,512 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [] [2023-12-02 14:08:52,521 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [] [2023-12-02 14:08:53,771 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.21s for a HTC check with result INVALID. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [] [2023-12-02 14:08:55,780 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [] [2023-12-02 14:08:57,787 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.01s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [] [2023-12-02 14:09:02,536 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [] [2023-12-02 14:09:04,597 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [] [2023-12-02 14:09:06,625 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.01s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [] [2023-12-02 14:09:09,161 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [] [2023-12-02 14:09:11,793 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [] [2023-12-02 14:09:14,310 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.01s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [] [2023-12-02 14:09:16,345 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.03s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [] [2023-12-02 14:09:18,359 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.01s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [] [2023-12-02 14:09:20,418 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [] [2023-12-02 14:09:22,422 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [] [2023-12-02 14:09:24,441 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.02s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [] [2023-12-02 14:09:26,477 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.04s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2023-12-02 14:09:28,042 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.56s for a HTC check with result INVALID. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [] [2023-12-02 14:09:30,045 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [] [2023-12-02 14:09:32,060 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [] [2023-12-02 14:09:34,066 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.01s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [] [2023-12-02 14:09:36,074 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.01s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [] [2023-12-02 14:09:38,087 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.01s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [] [2023-12-02 14:09:40,092 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [] [2023-12-02 14:09:42,098 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.01s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [] [2023-12-02 14:09:44,103 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [] [2023-12-02 14:09:46,112 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.01s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [] [2023-12-02 14:09:48,122 WARN L854 $PredicateComparison]: unable to prove that (let ((.cse3 (* 4294967296 (div c_~x3~0 4294967296)))) (let ((.cse0 (mod c_~x1~0 4294967296)) (.cse1 (mod c_~n~0 4294967296)) (.cse2 (mod (* (div (* (- 1) c_~x4~0) 2) 4294967295) 4294967296)) (.cse5 (+ c_~x3~0 (* (div c_~x4~0 4294967296) 4294967296))) (.cse4 (+ .cse3 c_~x4~0))) (and (= .cse0 (mod c_~x2~0 4294967296)) (<= .cse1 (mod c_~x4~0 4294967296)) (<= 1 .cse0) (= (+ c_~x1~0 (* (div c_~x2~0 4294967296) 4294967296)) (+ (* 4294967296 (div c_~x1~0 4294967296)) c_~x2~0)) (<= (+ .cse2 1) .cse1) (or (< (+ c_~x3~0 2 (* 4294967296 (div c_~n~0 4294967296))) (+ .cse3 c_~n~0)) (= .cse4 .cse5)) (= (mod (* 4294967295 (div (* (- 1) c_~x3~0) 2)) 4294967296) .cse2) (= (mod c_~x4~0 2) 0) (<= .cse5 .cse4) (= (mod c_~x3~0 2) 0)))) is different from false [2023-12-02 14:09:50,649 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [] [2023-12-02 14:09:53,486 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.52s for a HTC check with result INVALID. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [] [2023-12-02 14:09:55,522 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [] [2023-12-02 14:09:57,786 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [] [2023-12-02 14:10:00,299 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [] [2023-12-02 14:10:02,309 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [] [2023-12-02 14:10:04,317 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.01s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [] [2023-12-02 14:10:06,325 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [] [2023-12-02 14:10:08,330 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.01s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [] [2023-12-02 14:10:10,340 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.01s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [] [2023-12-02 14:10:12,349 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.01s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [] [2023-12-02 14:10:22,025 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [] [2023-12-02 14:10:26,891 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [] [2023-12-02 14:10:29,540 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [] [2023-12-02 14:10:38,277 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [] [2023-12-02 14:10:40,307 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [] [2023-12-02 14:10:42,315 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.01s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [] [2023-12-02 14:10:45,495 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [] [2023-12-02 14:10:47,656 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2023-12-02 14:10:49,672 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2023-12-02 14:10:51,679 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.01s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [] [2023-12-02 14:10:53,763 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2023-12-02 14:10:55,835 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [] [2023-12-02 14:10:57,118 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.26s for a HTC check with result INVALID. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [] [2023-12-02 14:10:59,618 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [] [2023-12-02 14:11:02,245 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [] [2023-12-02 14:11:03,685 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.29s for a HTC check with result INVALID. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [] [2023-12-02 14:11:05,691 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [] [2023-12-02 14:11:07,806 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [] [2023-12-02 14:11:09,824 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.02s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [] [2023-12-02 14:11:11,886 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2023-12-02 14:11:13,900 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2023-12-02 14:11:15,918 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.02s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [] [2023-12-02 14:11:17,928 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.01s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2023-12-02 14:11:18,243 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-12-02 14:11:18,243 INFO L93 Difference]: Finished difference Result 3810 states and 15711 transitions. [2023-12-02 14:11:18,244 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 18 states. [2023-12-02 14:11:18,244 INFO L78 Accepts]: Start accepts. Automaton has has 16 states, 16 states have (on average 6.3125) internal successors, (101), 15 states have internal predecessors, (101), 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 36 [2023-12-02 14:11:18,244 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-12-02 14:11:18,258 INFO L225 Difference]: With dead ends: 3810 [2023-12-02 14:11:18,258 INFO L226 Difference]: Without dead ends: 3748 [2023-12-02 14:11:18,259 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 89 GetRequests, 63 SyntacticMatches, 2 SemanticMatches, 24 ConstructedPredicates, 2 IntricatePredicates, 0 DeprecatedPredicates, 97 ImplicationChecksByTransitivity, 134.4s TimeCoverageRelationStatistics Valid=126, Invalid=392, Unknown=42, NotChecked=90, Total=650 [2023-12-02 14:11:18,259 INFO L413 NwaCegarLoop]: 60 mSDtfsCounter, 198 mSDsluCounter, 480 mSDsCounter, 0 mSdLazyCounter, 686 mSolverCounterSat, 14 mSolverCounterUnsat, 75 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 177.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 198 SdHoareTripleChecker+Valid, 540 SdHoareTripleChecker+Invalid, 1261 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 14 IncrementalHoareTripleChecker+Valid, 686 IncrementalHoareTripleChecker+Invalid, 75 IncrementalHoareTripleChecker+Unknown, 486 IncrementalHoareTripleChecker+Unchecked, 178.1s IncrementalHoareTripleChecker+Time [2023-12-02 14:11:18,260 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [198 Valid, 540 Invalid, 1261 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [14 Valid, 686 Invalid, 75 Unknown, 486 Unchecked, 178.1s Time] [2023-12-02 14:11:18,267 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3748 states. [2023-12-02 14:11:18,345 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3748 to 2971. [2023-12-02 14:11:18,351 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 2971 states, 2970 states have (on average 4.287878787878788) internal successors, (12735), 2970 states have internal predecessors, (12735), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-12-02 14:11:18,367 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2971 states to 2971 states and 12735 transitions. [2023-12-02 14:11:18,367 INFO L78 Accepts]: Start accepts. Automaton has 2971 states and 12735 transitions. Word has length 36 [2023-12-02 14:11:18,367 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-12-02 14:11:18,367 INFO L495 AbstractCegarLoop]: Abstraction has 2971 states and 12735 transitions. [2023-12-02 14:11:18,367 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 16 states, 16 states have (on average 6.3125) internal successors, (101), 15 states have internal predecessors, (101), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-12-02 14:11:18,368 INFO L276 IsEmpty]: Start isEmpty. Operand 2971 states and 12735 transitions. [2023-12-02 14:11:18,379 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 37 [2023-12-02 14:11:18,379 INFO L187 NwaCegarLoop]: Found error trace [2023-12-02 14:11:18,379 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-12-02 14:11:18,385 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_9284ea18-4b33-4bf4-84e1-1ddf9a674761/bin/utaipan-verify-nQ1chXbOIh/z3 -smt2 -in SMTLIB2_COMPLIANT=true (7)] Ended with exit code 0 [2023-12-02 14:11:18,579 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable19,7 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_9284ea18-4b33-4bf4-84e1-1ddf9a674761/bin/utaipan-verify-nQ1chXbOIh/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-12-02 14:11:18,580 INFO L420 AbstractCegarLoop]: === Iteration 21 === Targeting ULTIMATE.startErr16ASSERT_VIOLATIONMEMORY_LEAK === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 19 more)] === [2023-12-02 14:11:18,580 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-12-02 14:11:18,580 INFO L85 PathProgramCache]: Analyzing trace with hash 1902194408, now seen corresponding path program 2 times [2023-12-02 14:11:18,580 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2023-12-02 14:11:18,581 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [305328667] [2023-12-02 14:11:18,581 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-02 14:11:18,581 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-12-02 14:11:18,624 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-02 14:11:19,134 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-12-02 14:11:19,135 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2023-12-02 14:11:19,135 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [305328667] [2023-12-02 14:11:19,135 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [305328667] provided 0 perfect and 1 imperfect interpolant sequences [2023-12-02 14:11:19,135 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [908387623] [2023-12-02 14:11:19,135 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2023-12-02 14:11:19,135 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-12-02 14:11:19,135 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_9284ea18-4b33-4bf4-84e1-1ddf9a674761/bin/utaipan-verify-nQ1chXbOIh/z3 [2023-12-02 14:11:19,136 INFO L229 MonitoredProcess]: Starting monitored process 8 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_9284ea18-4b33-4bf4-84e1-1ddf9a674761/bin/utaipan-verify-nQ1chXbOIh/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2023-12-02 14:11:19,137 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_9284ea18-4b33-4bf4-84e1-1ddf9a674761/bin/utaipan-verify-nQ1chXbOIh/z3 -smt2 -in SMTLIB2_COMPLIANT=true (8)] Waiting until timeout for monitored process [2023-12-02 14:11:19,556 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 2 check-sat command(s) [2023-12-02 14:11:19,556 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2023-12-02 14:11:19,557 INFO L262 TraceCheckSpWp]: Trace formula consists of 253 conjuncts, 9 conjunts are in the unsatisfiable core [2023-12-02 14:11:19,560 INFO L285 TraceCheckSpWp]: Computing forward predicates...