./Ultimate.py --spec ../../sv-benchmarks/c/properties/no-overflow.prp --file ../../sv-benchmarks/c/goblint-regression/06-symbeq_02-funloop_norace.i --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for overflows Using default analysis Version 0e0057cc Calling Ultimate with: /usr/lib/jvm/java-11-openjdk-amd64/bin/java -Dosgi.configuration.area=/tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_72ec9ce2-d26b-43c5-a264-de0e9bf99c34/bin/utaipan-verify-nQ1chXbOIh/data/config -Xmx15G -Xms4m -jar /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_72ec9ce2-d26b-43c5-a264-de0e9bf99c34/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_72ec9ce2-d26b-43c5-a264-de0e9bf99c34/bin/utaipan-verify-nQ1chXbOIh/data -tc /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_72ec9ce2-d26b-43c5-a264-de0e9bf99c34/bin/utaipan-verify-nQ1chXbOIh/config/TaipanReach.xml -i ../../sv-benchmarks/c/goblint-regression/06-symbeq_02-funloop_norace.i -s /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_72ec9ce2-d26b-43c5-a264-de0e9bf99c34/bin/utaipan-verify-nQ1chXbOIh/config/svcomp-Overflow-32bit-Taipan_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_72ec9ce2-d26b-43c5-a264-de0e9bf99c34/bin/utaipan-verify-nQ1chXbOIh --witnessprinter.witness.filename witness --witnessprinter.write.witness.besides.input.file false --witnessprinter.graph.data.specification CHECK( init(main()), LTL(G ! overflow) ) --witnessprinter.graph.data.producer Taipan --witnessprinter.graph.data.architecture 32bit --witnessprinter.graph.data.programhash ebedbc62bd44b0c214a81c07c6f99e850a5d96675b77716f8547d1b39e8b2cf8 --- Real Ultimate output --- This is Ultimate 0.2.4-dev-0e0057c [2023-12-02 08:22:23,838 INFO L188 SettingsManager]: Resetting all preferences to default values... [2023-12-02 08:22:23,899 INFO L114 SettingsManager]: Loading settings from /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_72ec9ce2-d26b-43c5-a264-de0e9bf99c34/bin/utaipan-verify-nQ1chXbOIh/config/svcomp-Overflow-32bit-Taipan_Default.epf [2023-12-02 08:22:23,905 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2023-12-02 08:22:23,906 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2023-12-02 08:22:23,930 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2023-12-02 08:22:23,931 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2023-12-02 08:22:23,931 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2023-12-02 08:22:23,932 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2023-12-02 08:22:23,932 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2023-12-02 08:22:23,933 INFO L153 SettingsManager]: * User list type=DISABLED [2023-12-02 08:22:23,933 INFO L151 SettingsManager]: Preferences of Abstract Interpretation differ from their defaults: [2023-12-02 08:22:23,934 INFO L153 SettingsManager]: * Explicit value domain=true [2023-12-02 08:22:23,934 INFO L153 SettingsManager]: * Abstract domain for RCFG-of-the-future=PoormanAbstractDomain [2023-12-02 08:22:23,935 INFO L153 SettingsManager]: * Octagon Domain=false [2023-12-02 08:22:23,935 INFO L153 SettingsManager]: * Abstract domain=CompoundDomain [2023-12-02 08:22:23,936 INFO L153 SettingsManager]: * Check feasibility of abstract posts with an SMT solver=true [2023-12-02 08:22:23,936 INFO L153 SettingsManager]: * Use the RCFG-of-the-future interface=true [2023-12-02 08:22:23,937 INFO L153 SettingsManager]: * Interval Domain=false [2023-12-02 08:22:23,937 INFO L151 SettingsManager]: Preferences of Sifa differ from their defaults: [2023-12-02 08:22:23,938 INFO L153 SettingsManager]: * Call Summarizer=TopInputCallSummarizer [2023-12-02 08:22:23,939 INFO L153 SettingsManager]: * Simplification Technique=POLY_PAC [2023-12-02 08:22:23,939 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2023-12-02 08:22:23,940 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2023-12-02 08:22:23,940 INFO L153 SettingsManager]: * sizeof long=4 [2023-12-02 08:22:23,941 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2023-12-02 08:22:23,941 INFO L153 SettingsManager]: * sizeof POINTER=4 [2023-12-02 08:22:23,941 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2023-12-02 08:22:23,942 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2023-12-02 08:22:23,942 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2023-12-02 08:22:23,943 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2023-12-02 08:22:23,943 INFO L153 SettingsManager]: * Check absence of signed integer overflows=true [2023-12-02 08:22:23,943 INFO L153 SettingsManager]: * Check unreachability of reach_error function=false [2023-12-02 08:22:23,943 INFO L153 SettingsManager]: * sizeof long double=12 [2023-12-02 08:22:23,944 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2023-12-02 08:22:23,944 INFO L153 SettingsManager]: * Use constant arrays=true [2023-12-02 08:22:23,944 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2023-12-02 08:22:23,944 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2023-12-02 08:22:23,944 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2023-12-02 08:22:23,945 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2023-12-02 08:22:23,945 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2023-12-02 08:22:23,945 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2023-12-02 08:22:23,945 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2023-12-02 08:22:23,945 INFO L153 SettingsManager]: * Trace refinement strategy=SIFA_TAIPAN [2023-12-02 08:22:23,946 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2023-12-02 08:22:23,946 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2023-12-02 08:22:23,946 INFO L153 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2023-12-02 08:22:23,946 INFO L153 SettingsManager]: * Trace refinement exception blacklist=NONE [2023-12-02 08:22:23,946 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2023-12-02 08:22:23,946 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_72ec9ce2-d26b-43c5-a264-de0e9bf99c34/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_72ec9ce2-d26b-43c5-a264-de0e9bf99c34/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 ! overflow) ) 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 -> ebedbc62bd44b0c214a81c07c6f99e850a5d96675b77716f8547d1b39e8b2cf8 [2023-12-02 08:22:24,138 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2023-12-02 08:22:24,159 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2023-12-02 08:22:24,162 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2023-12-02 08:22:24,163 INFO L270 PluginConnector]: Initializing CDTParser... [2023-12-02 08:22:24,163 INFO L274 PluginConnector]: CDTParser initialized [2023-12-02 08:22:24,165 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_72ec9ce2-d26b-43c5-a264-de0e9bf99c34/bin/utaipan-verify-nQ1chXbOIh/../../sv-benchmarks/c/goblint-regression/06-symbeq_02-funloop_norace.i [2023-12-02 08:22:26,917 INFO L533 CDTParser]: Created temporary CDT project at NULL [2023-12-02 08:22:27,126 INFO L384 CDTParser]: Found 1 translation units. [2023-12-02 08:22:27,126 INFO L180 CDTParser]: Scanning /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_72ec9ce2-d26b-43c5-a264-de0e9bf99c34/sv-benchmarks/c/goblint-regression/06-symbeq_02-funloop_norace.i [2023-12-02 08:22:27,143 INFO L427 CDTParser]: About to delete temporary CDT project at /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_72ec9ce2-d26b-43c5-a264-de0e9bf99c34/bin/utaipan-verify-nQ1chXbOIh/data/abc59d71f/554e824da0cf4151849eb9b03eb0691c/FLAG4da140e40 [2023-12-02 08:22:27,157 INFO L435 CDTParser]: Successfully deleted /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_72ec9ce2-d26b-43c5-a264-de0e9bf99c34/bin/utaipan-verify-nQ1chXbOIh/data/abc59d71f/554e824da0cf4151849eb9b03eb0691c [2023-12-02 08:22:27,160 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2023-12-02 08:22:27,161 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2023-12-02 08:22:27,163 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2023-12-02 08:22:27,163 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2023-12-02 08:22:27,168 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2023-12-02 08:22:27,169 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 02.12 08:22:27" (1/1) ... [2023-12-02 08:22:27,170 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@4144677f and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.12 08:22:27, skipping insertion in model container [2023-12-02 08:22:27,170 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 02.12 08:22:27" (1/1) ... [2023-12-02 08:22:27,219 INFO L177 MainTranslator]: Built tables and reachable declarations [2023-12-02 08:22:27,594 INFO L209 PostProcessor]: Analyzing one entry point: main [2023-12-02 08:22:27,613 INFO L202 MainTranslator]: Completed pre-run [2023-12-02 08:22:27,653 INFO L209 PostProcessor]: Analyzing one entry point: main [2023-12-02 08:22:27,733 INFO L206 MainTranslator]: Completed translation [2023-12-02 08:22:27,733 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.12 08:22:27 WrapperNode [2023-12-02 08:22:27,733 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2023-12-02 08:22:27,735 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2023-12-02 08:22:27,735 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2023-12-02 08:22:27,735 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2023-12-02 08:22:27,742 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.12 08:22:27" (1/1) ... [2023-12-02 08:22:27,758 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.12 08:22:27" (1/1) ... [2023-12-02 08:22:27,781 INFO L138 Inliner]: procedures = 263, calls = 14, calls flagged for inlining = 4, calls inlined = 4, statements flattened = 87 [2023-12-02 08:22:27,781 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2023-12-02 08:22:27,782 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2023-12-02 08:22:27,782 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2023-12-02 08:22:27,782 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2023-12-02 08:22:27,792 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.12 08:22:27" (1/1) ... [2023-12-02 08:22:27,792 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.12 08:22:27" (1/1) ... [2023-12-02 08:22:27,796 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.12 08:22:27" (1/1) ... [2023-12-02 08:22:27,796 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.12 08:22:27" (1/1) ... [2023-12-02 08:22:27,804 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.12 08:22:27" (1/1) ... [2023-12-02 08:22:27,807 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.12 08:22:27" (1/1) ... [2023-12-02 08:22:27,810 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.12 08:22:27" (1/1) ... [2023-12-02 08:22:27,811 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.12 08:22:27" (1/1) ... [2023-12-02 08:22:27,814 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2023-12-02 08:22:27,815 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2023-12-02 08:22:27,815 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2023-12-02 08:22:27,815 INFO L274 PluginConnector]: RCFGBuilder initialized [2023-12-02 08:22:27,816 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.12 08:22:27" (1/1) ... [2023-12-02 08:22:27,822 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2023-12-02 08:22:27,834 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_72ec9ce2-d26b-43c5-a264-de0e9bf99c34/bin/utaipan-verify-nQ1chXbOIh/z3 [2023-12-02 08:22:27,846 INFO L229 MonitoredProcess]: Starting monitored process 1 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_72ec9ce2-d26b-43c5-a264-de0e9bf99c34/bin/utaipan-verify-nQ1chXbOIh/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (exit command is (exit), workingDir is null) [2023-12-02 08:22:27,848 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_72ec9ce2-d26b-43c5-a264-de0e9bf99c34/bin/utaipan-verify-nQ1chXbOIh/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (1)] Waiting until timeout for monitored process [2023-12-02 08:22:27,876 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2023-12-02 08:22:27,876 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2023-12-02 08:22:27,876 INFO L130 BoogieDeclarations]: Found specification of procedure #PthreadsMutexUnlock [2023-12-02 08:22:27,876 INFO L130 BoogieDeclarations]: Found specification of procedure read~int [2023-12-02 08:22:27,876 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2023-12-02 08:22:27,877 INFO L130 BoogieDeclarations]: Found specification of procedure #PthreadsMutexLock [2023-12-02 08:22:27,877 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2023-12-02 08:22:27,877 INFO L130 BoogieDeclarations]: Found specification of procedure t_fun [2023-12-02 08:22:27,877 INFO L138 BoogieDeclarations]: Found implementation of procedure t_fun [2023-12-02 08:22:27,877 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2023-12-02 08:22:27,877 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2023-12-02 08:22:27,879 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 08:22:27,989 INFO L241 CfgBuilder]: Building ICFG [2023-12-02 08:22:27,991 INFO L267 CfgBuilder]: Building CFG for each procedure with an implementation [2023-12-02 08:22:28,152 INFO L282 CfgBuilder]: Performing block encoding [2023-12-02 08:22:28,237 INFO L304 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2023-12-02 08:22:28,237 INFO L309 CfgBuilder]: Removed 3 assume(true) statements. [2023-12-02 08:22:28,238 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 02.12 08:22:28 BoogieIcfgContainer [2023-12-02 08:22:28,238 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2023-12-02 08:22:28,240 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2023-12-02 08:22:28,240 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2023-12-02 08:22:28,243 INFO L274 PluginConnector]: TraceAbstraction initialized [2023-12-02 08:22:28,243 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 02.12 08:22:27" (1/3) ... [2023-12-02 08:22:28,244 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@124c7f92 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 02.12 08:22:28, skipping insertion in model container [2023-12-02 08:22:28,244 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.12 08:22:27" (2/3) ... [2023-12-02 08:22:28,245 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@124c7f92 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 02.12 08:22:28, skipping insertion in model container [2023-12-02 08:22:28,245 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 02.12 08:22:28" (3/3) ... [2023-12-02 08:22:28,246 INFO L112 eAbstractionObserver]: Analyzing ICFG 06-symbeq_02-funloop_norace.i [2023-12-02 08:22:28,253 WARN L145 ceAbstractionStarter]: Switching off computation of Hoare annotation because input is a concurrent program [2023-12-02 08:22:28,261 INFO L203 ceAbstractionStarter]: Automizer settings: Hoare:false NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2023-12-02 08:22:28,261 INFO L162 ceAbstractionStarter]: Applying trace abstraction to program that has 10 error locations. [2023-12-02 08:22:28,261 INFO L514 ceAbstractionStarter]: Constructing petrified ICFG for 1 thread instances. [2023-12-02 08:22:28,297 INFO L144 ThreadInstanceAdder]: Constructed 0 joinOtherThreadTransitions. [2023-12-02 08:22:28,320 INFO L113 iNet2FiniteAutomaton]: Start petriNet2FiniteAutomaton. Operand has 40 places, 39 transitions, 82 flow [2023-12-02 08:22:28,348 INFO L135 iNet2FiniteAutomaton]: Finished petriNet2FiniteAutomaton. Result has 231 states, 205 states have (on average 2.2243902439024392) internal successors, (456), 230 states have internal predecessors, (456), 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 08:22:28,361 INFO L356 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2023-12-02 08:22:28,366 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=true, mAutomataTypeConcurrency=FINITE_AUTOMATA, mHoareTripleChecks=INCREMENTAL, mHoareAnnotationPositions=LoopHeads, 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;@4a337a10, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2023-12-02 08:22:28,367 INFO L358 AbstractCegarLoop]: Starting to check reachability of 15 error locations. [2023-12-02 08:22:28,370 INFO L276 IsEmpty]: Start isEmpty. Operand has 231 states, 205 states have (on average 2.2243902439024392) internal successors, (456), 230 states have internal predecessors, (456), 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 08:22:28,376 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 4 [2023-12-02 08:22:28,376 INFO L187 NwaCegarLoop]: Found error trace [2023-12-02 08:22:28,377 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1] [2023-12-02 08:22:28,377 INFO L420 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 12 more)] === [2023-12-02 08:22:28,382 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-12-02 08:22:28,382 INFO L85 PathProgramCache]: Analyzing trace with hash 255141, now seen corresponding path program 1 times [2023-12-02 08:22:28,392 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2023-12-02 08:22:28,393 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [553739093] [2023-12-02 08:22:28,393 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-02 08:22:28,393 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-12-02 08:22:28,496 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-02 08:22:28,617 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 08:22:28,617 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2023-12-02 08:22:28,618 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [553739093] [2023-12-02 08:22:28,618 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [553739093] provided 1 perfect and 0 imperfect interpolant sequences [2023-12-02 08:22:28,619 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-12-02 08:22:28,619 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2023-12-02 08:22:28,620 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1710285032] [2023-12-02 08:22:28,621 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-12-02 08:22:28,624 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2023-12-02 08:22:28,625 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2023-12-02 08:22:28,646 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2023-12-02 08:22:28,647 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2023-12-02 08:22:28,649 INFO L87 Difference]: Start difference. First operand has 231 states, 205 states have (on average 2.2243902439024392) internal successors, (456), 230 states have internal predecessors, (456), 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 4 states, 3 states have (on average 1.0) internal successors, (3), 3 states have internal predecessors, (3), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-12-02 08:22:28,756 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-12-02 08:22:28,756 INFO L93 Difference]: Finished difference Result 234 states and 459 transitions. [2023-12-02 08:22:28,757 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2023-12-02 08:22:28,758 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 3 states have (on average 1.0) internal successors, (3), 3 states have internal predecessors, (3), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 3 [2023-12-02 08:22:28,759 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-12-02 08:22:28,779 INFO L225 Difference]: With dead ends: 234 [2023-12-02 08:22:28,779 INFO L226 Difference]: Without dead ends: 234 [2023-12-02 08:22:28,780 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2023-12-02 08:22:28,784 INFO L413 NwaCegarLoop]: 14 mSDtfsCounter, 3 mSDsluCounter, 27 mSDsCounter, 0 mSdLazyCounter, 72 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 3 SdHoareTripleChecker+Valid, 41 SdHoareTripleChecker+Invalid, 74 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 72 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2023-12-02 08:22:28,785 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [3 Valid, 41 Invalid, 74 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 72 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2023-12-02 08:22:28,803 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 234 states. [2023-12-02 08:22:28,832 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 234 to 234. [2023-12-02 08:22:28,834 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 234 states, 208 states have (on average 2.206730769230769) internal successors, (459), 233 states have internal predecessors, (459), 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 08:22:28,838 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 234 states to 234 states and 459 transitions. [2023-12-02 08:22:28,839 INFO L78 Accepts]: Start accepts. Automaton has 234 states and 459 transitions. Word has length 3 [2023-12-02 08:22:28,839 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-12-02 08:22:28,839 INFO L495 AbstractCegarLoop]: Abstraction has 234 states and 459 transitions. [2023-12-02 08:22:28,840 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 3 states have (on average 1.0) internal successors, (3), 3 states have internal predecessors, (3), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-12-02 08:22:28,840 INFO L276 IsEmpty]: Start isEmpty. Operand 234 states and 459 transitions. [2023-12-02 08:22:28,840 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 7 [2023-12-02 08:22:28,840 INFO L187 NwaCegarLoop]: Found error trace [2023-12-02 08:22:28,840 INFO L195 NwaCegarLoop]: trace histogram [2, 1, 1, 1, 1] [2023-12-02 08:22:28,841 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2023-12-02 08:22:28,841 INFO L420 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 12 more)] === [2023-12-02 08:22:28,842 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-12-02 08:22:28,842 INFO L85 PathProgramCache]: Analyzing trace with hash -988778725, now seen corresponding path program 1 times [2023-12-02 08:22:28,842 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2023-12-02 08:22:28,842 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1245746352] [2023-12-02 08:22:28,842 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-02 08:22:28,843 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-12-02 08:22:28,862 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-02 08:22:28,952 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 08:22:28,952 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2023-12-02 08:22:28,952 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1245746352] [2023-12-02 08:22:28,952 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1245746352] provided 0 perfect and 1 imperfect interpolant sequences [2023-12-02 08:22:28,953 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [144680957] [2023-12-02 08:22:28,953 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-02 08:22:28,953 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-12-02 08:22:28,953 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_72ec9ce2-d26b-43c5-a264-de0e9bf99c34/bin/utaipan-verify-nQ1chXbOIh/z3 [2023-12-02 08:22:28,956 INFO L229 MonitoredProcess]: Starting monitored process 2 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_72ec9ce2-d26b-43c5-a264-de0e9bf99c34/bin/utaipan-verify-nQ1chXbOIh/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2023-12-02 08:22:28,966 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_72ec9ce2-d26b-43c5-a264-de0e9bf99c34/bin/utaipan-verify-nQ1chXbOIh/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Waiting until timeout for monitored process [2023-12-02 08:22:29,040 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-02 08:22:29,041 INFO L262 TraceCheckSpWp]: Trace formula consists of 36 conjuncts, 5 conjunts are in the unsatisfiable core [2023-12-02 08:22:29,045 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-12-02 08:22:29,094 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 2 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-12-02 08:22:29,094 INFO L323 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2023-12-02 08:22:29,095 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [144680957] provided 1 perfect and 0 imperfect interpolant sequences [2023-12-02 08:22:29,095 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2023-12-02 08:22:29,095 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [4] total 6 [2023-12-02 08:22:29,096 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [666949056] [2023-12-02 08:22:29,096 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-12-02 08:22:29,096 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2023-12-02 08:22:29,096 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2023-12-02 08:22:29,097 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2023-12-02 08:22:29,097 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=39, Unknown=0, NotChecked=0, Total=56 [2023-12-02 08:22:29,097 INFO L87 Difference]: Start difference. First operand 234 states and 459 transitions. Second operand has 6 states, 5 states have (on average 1.2) internal successors, (6), 5 states have internal predecessors, (6), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-12-02 08:22:29,191 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-12-02 08:22:29,192 INFO L93 Difference]: Finished difference Result 233 states and 458 transitions. [2023-12-02 08:22:29,192 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2023-12-02 08:22:29,192 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 5 states have (on average 1.2) internal successors, (6), 5 states have internal predecessors, (6), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 6 [2023-12-02 08:22:29,193 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-12-02 08:22:29,195 INFO L225 Difference]: With dead ends: 233 [2023-12-02 08:22:29,195 INFO L226 Difference]: Without dead ends: 233 [2023-12-02 08:22:29,196 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 11 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=28, Invalid=62, Unknown=0, NotChecked=0, Total=90 [2023-12-02 08:22:29,197 INFO L413 NwaCegarLoop]: 12 mSDtfsCounter, 8 mSDsluCounter, 36 mSDsCounter, 0 mSdLazyCounter, 99 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 8 SdHoareTripleChecker+Valid, 48 SdHoareTripleChecker+Invalid, 99 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 99 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2023-12-02 08:22:29,198 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [8 Valid, 48 Invalid, 99 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 99 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2023-12-02 08:22:29,199 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 233 states. [2023-12-02 08:22:29,213 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 233 to 233. [2023-12-02 08:22:29,214 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 233 states, 208 states have (on average 2.201923076923077) internal successors, (458), 232 states have internal predecessors, (458), 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 08:22:29,216 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 233 states to 233 states and 458 transitions. [2023-12-02 08:22:29,216 INFO L78 Accepts]: Start accepts. Automaton has 233 states and 458 transitions. Word has length 6 [2023-12-02 08:22:29,216 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-12-02 08:22:29,216 INFO L495 AbstractCegarLoop]: Abstraction has 233 states and 458 transitions. [2023-12-02 08:22:29,216 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 5 states have (on average 1.2) internal successors, (6), 5 states have internal predecessors, (6), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-12-02 08:22:29,216 INFO L276 IsEmpty]: Start isEmpty. Operand 233 states and 458 transitions. [2023-12-02 08:22:29,217 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 8 [2023-12-02 08:22:29,217 INFO L187 NwaCegarLoop]: Found error trace [2023-12-02 08:22:29,217 INFO L195 NwaCegarLoop]: trace histogram [2, 2, 1, 1, 1] [2023-12-02 08:22:29,225 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_72ec9ce2-d26b-43c5-a264-de0e9bf99c34/bin/utaipan-verify-nQ1chXbOIh/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Forceful destruction successful, exit code 0 [2023-12-02 08:22:29,420 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1,2 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_72ec9ce2-d26b-43c5-a264-de0e9bf99c34/bin/utaipan-verify-nQ1chXbOIh/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-12-02 08:22:29,421 INFO L420 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 12 more)] === [2023-12-02 08:22:29,421 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-12-02 08:22:29,421 INFO L85 PathProgramCache]: Analyzing trace with hash -587369151, now seen corresponding path program 1 times [2023-12-02 08:22:29,421 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2023-12-02 08:22:29,421 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1398811490] [2023-12-02 08:22:29,421 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-02 08:22:29,422 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-12-02 08:22:29,434 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-02 08:22:29,467 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 2 proven. 0 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2023-12-02 08:22:29,468 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2023-12-02 08:22:29,468 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1398811490] [2023-12-02 08:22:29,468 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1398811490] provided 1 perfect and 0 imperfect interpolant sequences [2023-12-02 08:22:29,468 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-12-02 08:22:29,468 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2023-12-02 08:22:29,469 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1048447275] [2023-12-02 08:22:29,469 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-12-02 08:22:29,469 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2023-12-02 08:22:29,469 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2023-12-02 08:22:29,470 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2023-12-02 08:22:29,470 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2023-12-02 08:22:29,470 INFO L87 Difference]: Start difference. First operand 233 states and 458 transitions. Second operand has 3 states, 2 states have (on average 3.5) internal successors, (7), 3 states have internal predecessors, (7), 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 08:22:29,512 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-12-02 08:22:29,512 INFO L93 Difference]: Finished difference Result 232 states and 457 transitions. [2023-12-02 08:22:29,513 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2023-12-02 08:22:29,513 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 2 states have (on average 3.5) internal successors, (7), 3 states have internal predecessors, (7), 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 7 [2023-12-02 08:22:29,513 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-12-02 08:22:29,515 INFO L225 Difference]: With dead ends: 232 [2023-12-02 08:22:29,516 INFO L226 Difference]: Without dead ends: 232 [2023-12-02 08:22:29,516 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 08:22:29,517 INFO L413 NwaCegarLoop]: 12 mSDtfsCounter, 0 mSDsluCounter, 12 mSDsCounter, 0 mSdLazyCounter, 46 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 24 SdHoareTripleChecker+Invalid, 46 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 46 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2023-12-02 08:22:29,518 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 24 Invalid, 46 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 46 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2023-12-02 08:22:29,519 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 232 states. [2023-12-02 08:22:29,531 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 232 to 230. [2023-12-02 08:22:29,532 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 230 states, 206 states have (on average 2.20873786407767) internal successors, (455), 229 states have internal predecessors, (455), 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 08:22:29,533 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 230 states to 230 states and 455 transitions. [2023-12-02 08:22:29,533 INFO L78 Accepts]: Start accepts. Automaton has 230 states and 455 transitions. Word has length 7 [2023-12-02 08:22:29,533 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-12-02 08:22:29,534 INFO L495 AbstractCegarLoop]: Abstraction has 230 states and 455 transitions. [2023-12-02 08:22:29,534 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 2 states have (on average 3.5) internal successors, (7), 3 states have internal predecessors, (7), 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 08:22:29,534 INFO L276 IsEmpty]: Start isEmpty. Operand 230 states and 455 transitions. [2023-12-02 08:22:29,534 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 12 [2023-12-02 08:22:29,534 INFO L187 NwaCegarLoop]: Found error trace [2023-12-02 08:22:29,535 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-12-02 08:22:29,535 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2023-12-02 08:22:29,535 INFO L420 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 12 more)] === [2023-12-02 08:22:29,535 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-12-02 08:22:29,536 INFO L85 PathProgramCache]: Analyzing trace with hash -328619715, now seen corresponding path program 1 times [2023-12-02 08:22:29,536 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2023-12-02 08:22:29,536 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1863318657] [2023-12-02 08:22:29,536 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-02 08:22:29,536 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-12-02 08:22:29,550 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-02 08:22:29,612 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 08:22:29,612 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2023-12-02 08:22:29,613 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1863318657] [2023-12-02 08:22:29,613 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1863318657] provided 0 perfect and 1 imperfect interpolant sequences [2023-12-02 08:22:29,613 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1990631063] [2023-12-02 08:22:29,613 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-02 08:22:29,613 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-12-02 08:22:29,613 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_72ec9ce2-d26b-43c5-a264-de0e9bf99c34/bin/utaipan-verify-nQ1chXbOIh/z3 [2023-12-02 08:22:29,614 INFO L229 MonitoredProcess]: Starting monitored process 3 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_72ec9ce2-d26b-43c5-a264-de0e9bf99c34/bin/utaipan-verify-nQ1chXbOIh/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2023-12-02 08:22:29,620 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_72ec9ce2-d26b-43c5-a264-de0e9bf99c34/bin/utaipan-verify-nQ1chXbOIh/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Waiting until timeout for monitored process [2023-12-02 08:22:29,693 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-02 08:22:29,694 INFO L262 TraceCheckSpWp]: Trace formula consists of 81 conjuncts, 4 conjunts are in the unsatisfiable core [2023-12-02 08:22:29,696 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-12-02 08:22:29,720 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 08:22:29,721 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2023-12-02 08:22:29,752 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 08:22:29,752 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1990631063] provided 0 perfect and 2 imperfect interpolant sequences [2023-12-02 08:22:29,753 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSifa [1976148024] [2023-12-02 08:22:29,759 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 08:22:29,761 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2023-12-02 08:22:29,761 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [4, 4, 4] total 9 [2023-12-02 08:22:29,761 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [765365766] [2023-12-02 08:22:29,762 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2023-12-02 08:22:29,762 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2023-12-02 08:22:29,762 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2023-12-02 08:22:29,763 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2023-12-02 08:22:29,763 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=30, Invalid=60, Unknown=0, NotChecked=0, Total=90 [2023-12-02 08:22:29,763 INFO L87 Difference]: Start difference. First operand 230 states and 455 transitions. Second operand has 10 states, 10 states have (on average 2.0) internal successors, (20), 9 states have internal predecessors, (20), 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 08:22:29,861 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-12-02 08:22:29,861 INFO L93 Difference]: Finished difference Result 236 states and 461 transitions. [2023-12-02 08:22:29,862 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2023-12-02 08:22:29,862 INFO L78 Accepts]: Start accepts. Automaton has has 10 states, 10 states have (on average 2.0) internal successors, (20), 9 states have internal predecessors, (20), 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 08:22:29,862 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-12-02 08:22:29,864 INFO L225 Difference]: With dead ends: 236 [2023-12-02 08:22:29,864 INFO L226 Difference]: Without dead ends: 236 [2023-12-02 08:22:29,865 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 26 GetRequests, 16 SyntacticMatches, 0 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 15 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=47, Invalid=85, Unknown=0, NotChecked=0, Total=132 [2023-12-02 08:22:29,866 INFO L413 NwaCegarLoop]: 12 mSDtfsCounter, 10 mSDsluCounter, 50 mSDsCounter, 0 mSdLazyCounter, 120 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 10 SdHoareTripleChecker+Valid, 62 SdHoareTripleChecker+Invalid, 121 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 120 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2023-12-02 08:22:29,866 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [10 Valid, 62 Invalid, 121 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 120 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2023-12-02 08:22:29,868 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 236 states. [2023-12-02 08:22:29,900 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 236 to 236. [2023-12-02 08:22:29,901 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 236 states, 212 states have (on average 2.1745283018867925) internal successors, (461), 235 states have internal predecessors, (461), 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 08:22:29,902 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 236 states to 236 states and 461 transitions. [2023-12-02 08:22:29,902 INFO L78 Accepts]: Start accepts. Automaton has 236 states and 461 transitions. Word has length 11 [2023-12-02 08:22:29,902 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-12-02 08:22:29,903 INFO L495 AbstractCegarLoop]: Abstraction has 236 states and 461 transitions. [2023-12-02 08:22:29,903 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 10 states have (on average 2.0) internal successors, (20), 9 states have internal predecessors, (20), 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 08:22:29,903 INFO L276 IsEmpty]: Start isEmpty. Operand 236 states and 461 transitions. [2023-12-02 08:22:29,903 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 18 [2023-12-02 08:22:29,904 INFO L187 NwaCegarLoop]: Found error trace [2023-12-02 08:22:29,904 INFO L195 NwaCegarLoop]: trace histogram [3, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1] [2023-12-02 08:22:29,909 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_72ec9ce2-d26b-43c5-a264-de0e9bf99c34/bin/utaipan-verify-nQ1chXbOIh/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Ended with exit code 0 [2023-12-02 08:22:30,108 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3,3 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_72ec9ce2-d26b-43c5-a264-de0e9bf99c34/bin/utaipan-verify-nQ1chXbOIh/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-12-02 08:22:30,109 INFO L420 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 12 more)] === [2023-12-02 08:22:30,109 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-12-02 08:22:30,109 INFO L85 PathProgramCache]: Analyzing trace with hash 1263717757, now seen corresponding path program 2 times [2023-12-02 08:22:30,109 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2023-12-02 08:22:30,109 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1066815706] [2023-12-02 08:22:30,109 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-02 08:22:30,110 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-12-02 08:22:30,128 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-02 08:22:30,250 INFO L134 CoverageAnalysis]: Checked inductivity of 12 backedges. 0 proven. 12 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-12-02 08:22:30,250 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2023-12-02 08:22:30,250 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1066815706] [2023-12-02 08:22:30,250 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1066815706] provided 0 perfect and 1 imperfect interpolant sequences [2023-12-02 08:22:30,250 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [617347354] [2023-12-02 08:22:30,250 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2023-12-02 08:22:30,251 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-12-02 08:22:30,251 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_72ec9ce2-d26b-43c5-a264-de0e9bf99c34/bin/utaipan-verify-nQ1chXbOIh/z3 [2023-12-02 08:22:30,252 INFO L229 MonitoredProcess]: Starting monitored process 4 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_72ec9ce2-d26b-43c5-a264-de0e9bf99c34/bin/utaipan-verify-nQ1chXbOIh/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2023-12-02 08:22:30,264 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_72ec9ce2-d26b-43c5-a264-de0e9bf99c34/bin/utaipan-verify-nQ1chXbOIh/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Waiting until timeout for monitored process [2023-12-02 08:22:30,334 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 1 check-sat command(s) [2023-12-02 08:22:30,335 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2023-12-02 08:22:30,336 INFO L262 TraceCheckSpWp]: Trace formula consists of 70 conjuncts, 14 conjunts are in the unsatisfiable core [2023-12-02 08:22:30,338 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-12-02 08:22:30,369 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 7 treesize of output 6 [2023-12-02 08:22:30,469 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-12-02 08:22:30,471 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 10 [2023-12-02 08:22:30,521 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 14 treesize of output 10 [2023-12-02 08:22:30,537 INFO L134 CoverageAnalysis]: Checked inductivity of 12 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 12 trivial. 0 not checked. [2023-12-02 08:22:30,538 INFO L323 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2023-12-02 08:22:30,538 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [617347354] provided 1 perfect and 0 imperfect interpolant sequences [2023-12-02 08:22:30,538 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2023-12-02 08:22:30,538 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [8] total 12 [2023-12-02 08:22:30,539 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [406619968] [2023-12-02 08:22:30,539 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-12-02 08:22:30,539 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2023-12-02 08:22:30,539 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2023-12-02 08:22:30,540 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2023-12-02 08:22:30,540 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=33, Invalid=123, Unknown=0, NotChecked=0, Total=156 [2023-12-02 08:22:30,540 INFO L87 Difference]: Start difference. First operand 236 states and 461 transitions. Second operand has 6 states, 5 states have (on average 2.2) internal successors, (11), 5 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 08:22:30,729 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-12-02 08:22:30,729 INFO L93 Difference]: Finished difference Result 334 states and 671 transitions. [2023-12-02 08:22:30,730 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2023-12-02 08:22:30,730 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 5 states have (on average 2.2) internal successors, (11), 5 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 17 [2023-12-02 08:22:30,731 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-12-02 08:22:30,733 INFO L225 Difference]: With dead ends: 334 [2023-12-02 08:22:30,733 INFO L226 Difference]: Without dead ends: 334 [2023-12-02 08:22:30,733 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 26 GetRequests, 13 SyntacticMatches, 0 SemanticMatches, 13 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 28 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=45, Invalid=165, Unknown=0, NotChecked=0, Total=210 [2023-12-02 08:22:30,734 INFO L413 NwaCegarLoop]: 20 mSDtfsCounter, 55 mSDsluCounter, 62 mSDsCounter, 0 mSdLazyCounter, 166 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 55 SdHoareTripleChecker+Valid, 82 SdHoareTripleChecker+Invalid, 168 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 166 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2023-12-02 08:22:30,734 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [55 Valid, 82 Invalid, 168 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 166 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2023-12-02 08:22:30,736 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 334 states. [2023-12-02 08:22:30,741 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 334 to 286. [2023-12-02 08:22:30,742 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 286 states, 262 states have (on average 2.1717557251908395) internal successors, (569), 285 states have internal predecessors, (569), 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 08:22:30,743 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 286 states to 286 states and 569 transitions. [2023-12-02 08:22:30,744 INFO L78 Accepts]: Start accepts. Automaton has 286 states and 569 transitions. Word has length 17 [2023-12-02 08:22:30,744 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-12-02 08:22:30,744 INFO L495 AbstractCegarLoop]: Abstraction has 286 states and 569 transitions. [2023-12-02 08:22:30,744 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 5 states have (on average 2.2) internal successors, (11), 5 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 08:22:30,744 INFO L276 IsEmpty]: Start isEmpty. Operand 286 states and 569 transitions. [2023-12-02 08:22:30,745 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 18 [2023-12-02 08:22:30,745 INFO L187 NwaCegarLoop]: Found error trace [2023-12-02 08:22:30,745 INFO L195 NwaCegarLoop]: trace histogram [3, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1] [2023-12-02 08:22:30,750 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_72ec9ce2-d26b-43c5-a264-de0e9bf99c34/bin/utaipan-verify-nQ1chXbOIh/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Forceful destruction successful, exit code 0 [2023-12-02 08:22:30,945 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4,4 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_72ec9ce2-d26b-43c5-a264-de0e9bf99c34/bin/utaipan-verify-nQ1chXbOIh/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-12-02 08:22:30,946 INFO L420 AbstractCegarLoop]: === Iteration 6 === Targeting t_funErr0ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 12 more)] === [2023-12-02 08:22:30,946 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-12-02 08:22:30,946 INFO L85 PathProgramCache]: Analyzing trace with hash 1282062173, now seen corresponding path program 1 times [2023-12-02 08:22:30,947 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2023-12-02 08:22:30,947 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [186929728] [2023-12-02 08:22:30,947 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-02 08:22:30,947 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-12-02 08:22:30,962 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-02 08:22:31,071 INFO L134 CoverageAnalysis]: Checked inductivity of 12 backedges. 0 proven. 12 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-12-02 08:22:31,072 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2023-12-02 08:22:31,072 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [186929728] [2023-12-02 08:22:31,072 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [186929728] provided 0 perfect and 1 imperfect interpolant sequences [2023-12-02 08:22:31,072 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [2139745030] [2023-12-02 08:22:31,072 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-02 08:22:31,072 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-12-02 08:22:31,073 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_72ec9ce2-d26b-43c5-a264-de0e9bf99c34/bin/utaipan-verify-nQ1chXbOIh/z3 [2023-12-02 08:22:31,073 INFO L229 MonitoredProcess]: Starting monitored process 5 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_72ec9ce2-d26b-43c5-a264-de0e9bf99c34/bin/utaipan-verify-nQ1chXbOIh/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2023-12-02 08:22:31,076 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_72ec9ce2-d26b-43c5-a264-de0e9bf99c34/bin/utaipan-verify-nQ1chXbOIh/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Waiting until timeout for monitored process [2023-12-02 08:22:31,153 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-02 08:22:31,154 INFO L262 TraceCheckSpWp]: Trace formula consists of 107 conjuncts, 8 conjunts are in the unsatisfiable core [2023-12-02 08:22:31,156 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-12-02 08:22:31,199 INFO L134 CoverageAnalysis]: Checked inductivity of 12 backedges. 0 proven. 12 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-12-02 08:22:31,199 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2023-12-02 08:22:31,291 INFO L134 CoverageAnalysis]: Checked inductivity of 12 backedges. 0 proven. 12 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-12-02 08:22:31,292 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [2139745030] provided 0 perfect and 2 imperfect interpolant sequences [2023-12-02 08:22:31,292 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSifa [1774931362] [2023-12-02 08:22:31,293 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 08:22:31,293 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2023-12-02 08:22:31,293 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [8, 8, 8] total 17 [2023-12-02 08:22:31,294 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2057647925] [2023-12-02 08:22:31,294 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2023-12-02 08:22:31,294 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 18 states [2023-12-02 08:22:31,294 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2023-12-02 08:22:31,295 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 18 interpolants. [2023-12-02 08:22:31,295 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=90, Invalid=216, Unknown=0, NotChecked=0, Total=306 [2023-12-02 08:22:31,295 INFO L87 Difference]: Start difference. First operand 286 states and 569 transitions. Second operand has 18 states, 18 states have (on average 1.7777777777777777) internal successors, (32), 17 states have internal predecessors, (32), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-12-02 08:22:31,478 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-12-02 08:22:31,478 INFO L93 Difference]: Finished difference Result 298 states and 581 transitions. [2023-12-02 08:22:31,479 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2023-12-02 08:22:31,479 INFO L78 Accepts]: Start accepts. Automaton has has 18 states, 18 states have (on average 1.7777777777777777) internal successors, (32), 17 states have internal predecessors, (32), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 17 [2023-12-02 08:22:31,479 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-12-02 08:22:31,481 INFO L225 Difference]: With dead ends: 298 [2023-12-02 08:22:31,482 INFO L226 Difference]: Without dead ends: 298 [2023-12-02 08:22:31,482 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 46 GetRequests, 24 SyntacticMatches, 0 SemanticMatches, 22 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 107 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=171, Invalid=381, Unknown=0, NotChecked=0, Total=552 [2023-12-02 08:22:31,483 INFO L413 NwaCegarLoop]: 12 mSDtfsCounter, 24 mSDsluCounter, 85 mSDsCounter, 0 mSdLazyCounter, 203 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 24 SdHoareTripleChecker+Valid, 97 SdHoareTripleChecker+Invalid, 204 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 203 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2023-12-02 08:22:31,483 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [24 Valid, 97 Invalid, 204 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 203 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2023-12-02 08:22:31,485 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 298 states. [2023-12-02 08:22:31,492 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 298 to 298. [2023-12-02 08:22:31,493 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 298 states, 274 states have (on average 2.1204379562043796) internal successors, (581), 297 states have internal predecessors, (581), 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 08:22:31,494 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 298 states to 298 states and 581 transitions. [2023-12-02 08:22:31,494 INFO L78 Accepts]: Start accepts. Automaton has 298 states and 581 transitions. Word has length 17 [2023-12-02 08:22:31,494 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-12-02 08:22:31,494 INFO L495 AbstractCegarLoop]: Abstraction has 298 states and 581 transitions. [2023-12-02 08:22:31,494 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 18 states, 18 states have (on average 1.7777777777777777) internal successors, (32), 17 states have internal predecessors, (32), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-12-02 08:22:31,495 INFO L276 IsEmpty]: Start isEmpty. Operand 298 states and 581 transitions. [2023-12-02 08:22:31,495 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 30 [2023-12-02 08:22:31,496 INFO L187 NwaCegarLoop]: Found error trace [2023-12-02 08:22:31,496 INFO L195 NwaCegarLoop]: trace histogram [7, 7, 7, 1, 1, 1, 1, 1, 1, 1, 1] [2023-12-02 08:22:31,500 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_72ec9ce2-d26b-43c5-a264-de0e9bf99c34/bin/utaipan-verify-nQ1chXbOIh/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Ended with exit code 0 [2023-12-02 08:22:31,700 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5,5 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_72ec9ce2-d26b-43c5-a264-de0e9bf99c34/bin/utaipan-verify-nQ1chXbOIh/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-12-02 08:22:31,701 INFO L420 AbstractCegarLoop]: === Iteration 7 === Targeting t_funErr0ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 12 more)] === [2023-12-02 08:22:31,701 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-12-02 08:22:31,701 INFO L85 PathProgramCache]: Analyzing trace with hash 160198621, now seen corresponding path program 2 times [2023-12-02 08:22:31,701 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2023-12-02 08:22:31,701 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [275005163] [2023-12-02 08:22:31,701 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-02 08:22:31,701 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-12-02 08:22:31,723 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-02 08:22:31,977 INFO L134 CoverageAnalysis]: Checked inductivity of 70 backedges. 0 proven. 70 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-12-02 08:22:31,977 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2023-12-02 08:22:31,977 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [275005163] [2023-12-02 08:22:31,977 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [275005163] provided 0 perfect and 1 imperfect interpolant sequences [2023-12-02 08:22:31,977 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [415454643] [2023-12-02 08:22:31,977 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2023-12-02 08:22:31,978 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-12-02 08:22:31,978 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_72ec9ce2-d26b-43c5-a264-de0e9bf99c34/bin/utaipan-verify-nQ1chXbOIh/z3 [2023-12-02 08:22:31,979 INFO L229 MonitoredProcess]: Starting monitored process 6 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_72ec9ce2-d26b-43c5-a264-de0e9bf99c34/bin/utaipan-verify-nQ1chXbOIh/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2023-12-02 08:22:31,981 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_72ec9ce2-d26b-43c5-a264-de0e9bf99c34/bin/utaipan-verify-nQ1chXbOIh/z3 -smt2 -in SMTLIB2_COMPLIANT=true (6)] Waiting until timeout for monitored process [2023-12-02 08:22:32,055 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 1 check-sat command(s) [2023-12-02 08:22:32,055 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2023-12-02 08:22:32,056 INFO L262 TraceCheckSpWp]: Trace formula consists of 74 conjuncts, 14 conjunts are in the unsatisfiable core [2023-12-02 08:22:32,058 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-12-02 08:22:32,087 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 7 treesize of output 6 [2023-12-02 08:22:32,249 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-12-02 08:22:32,250 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 10 [2023-12-02 08:22:32,303 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 14 treesize of output 10 [2023-12-02 08:22:32,320 INFO L134 CoverageAnalysis]: Checked inductivity of 70 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 70 trivial. 0 not checked. [2023-12-02 08:22:32,320 INFO L323 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2023-12-02 08:22:32,320 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [415454643] provided 1 perfect and 0 imperfect interpolant sequences [2023-12-02 08:22:32,320 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2023-12-02 08:22:32,321 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [16] total 20 [2023-12-02 08:22:32,321 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1136212204] [2023-12-02 08:22:32,321 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-12-02 08:22:32,321 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2023-12-02 08:22:32,322 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2023-12-02 08:22:32,322 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2023-12-02 08:22:32,322 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=89, Invalid=331, Unknown=0, NotChecked=0, Total=420 [2023-12-02 08:22:32,323 INFO L87 Difference]: Start difference. First operand 298 states and 581 transitions. Second operand has 6 states, 5 states have (on average 2.2) internal successors, (11), 5 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 08:22:32,489 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-12-02 08:22:32,490 INFO L93 Difference]: Finished difference Result 352 states and 695 transitions. [2023-12-02 08:22:32,490 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2023-12-02 08:22:32,490 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 5 states have (on average 2.2) internal successors, (11), 5 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 29 [2023-12-02 08:22:32,491 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-12-02 08:22:32,493 INFO L225 Difference]: With dead ends: 352 [2023-12-02 08:22:32,494 INFO L226 Difference]: Without dead ends: 352 [2023-12-02 08:22:32,494 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 46 GetRequests, 25 SyntacticMatches, 0 SemanticMatches, 21 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 96 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=101, Invalid=405, Unknown=0, NotChecked=0, Total=506 [2023-12-02 08:22:32,495 INFO L413 NwaCegarLoop]: 19 mSDtfsCounter, 64 mSDsluCounter, 49 mSDsCounter, 0 mSdLazyCounter, 136 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 64 SdHoareTripleChecker+Valid, 68 SdHoareTripleChecker+Invalid, 138 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 136 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2023-12-02 08:22:32,495 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [64 Valid, 68 Invalid, 138 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 136 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2023-12-02 08:22:32,497 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 352 states. [2023-12-02 08:22:32,505 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 352 to 324. [2023-12-02 08:22:32,506 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 324 states, 300 states have (on average 2.1033333333333335) internal successors, (631), 323 states have internal predecessors, (631), 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 08:22:32,508 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 324 states to 324 states and 631 transitions. [2023-12-02 08:22:32,508 INFO L78 Accepts]: Start accepts. Automaton has 324 states and 631 transitions. Word has length 29 [2023-12-02 08:22:32,508 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-12-02 08:22:32,509 INFO L495 AbstractCegarLoop]: Abstraction has 324 states and 631 transitions. [2023-12-02 08:22:32,509 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 5 states have (on average 2.2) internal successors, (11), 5 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 08:22:32,509 INFO L276 IsEmpty]: Start isEmpty. Operand 324 states and 631 transitions. [2023-12-02 08:22:32,510 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 31 [2023-12-02 08:22:32,510 INFO L187 NwaCegarLoop]: Found error trace [2023-12-02 08:22:32,510 INFO L195 NwaCegarLoop]: trace histogram [7, 7, 7, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-12-02 08:22:32,515 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_72ec9ce2-d26b-43c5-a264-de0e9bf99c34/bin/utaipan-verify-nQ1chXbOIh/z3 -smt2 -in SMTLIB2_COMPLIANT=true (6)] Ended with exit code 0 [2023-12-02 08:22:32,712 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6,6 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_72ec9ce2-d26b-43c5-a264-de0e9bf99c34/bin/utaipan-verify-nQ1chXbOIh/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-12-02 08:22:32,712 INFO L420 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr3ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 12 more)] === [2023-12-02 08:22:32,712 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-12-02 08:22:32,712 INFO L85 PathProgramCache]: Analyzing trace with hash 102513297, now seen corresponding path program 1 times [2023-12-02 08:22:32,712 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2023-12-02 08:22:32,713 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1740563091] [2023-12-02 08:22:32,713 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-02 08:22:32,713 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-12-02 08:22:32,730 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-02 08:22:32,932 INFO L134 CoverageAnalysis]: Checked inductivity of 70 backedges. 0 proven. 70 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-12-02 08:22:32,932 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2023-12-02 08:22:32,932 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1740563091] [2023-12-02 08:22:32,932 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1740563091] provided 0 perfect and 1 imperfect interpolant sequences [2023-12-02 08:22:32,932 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [2139532123] [2023-12-02 08:22:32,933 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-02 08:22:32,933 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-12-02 08:22:32,933 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_72ec9ce2-d26b-43c5-a264-de0e9bf99c34/bin/utaipan-verify-nQ1chXbOIh/z3 [2023-12-02 08:22:32,934 INFO L229 MonitoredProcess]: Starting monitored process 7 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_72ec9ce2-d26b-43c5-a264-de0e9bf99c34/bin/utaipan-verify-nQ1chXbOIh/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2023-12-02 08:22:32,936 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_72ec9ce2-d26b-43c5-a264-de0e9bf99c34/bin/utaipan-verify-nQ1chXbOIh/z3 -smt2 -in SMTLIB2_COMPLIANT=true (7)] Waiting until timeout for monitored process [2023-12-02 08:22:33,017 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-02 08:22:33,018 INFO L262 TraceCheckSpWp]: Trace formula consists of 148 conjuncts, 16 conjunts are in the unsatisfiable core [2023-12-02 08:22:33,020 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-12-02 08:22:33,082 INFO L134 CoverageAnalysis]: Checked inductivity of 70 backedges. 0 proven. 70 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-12-02 08:22:33,082 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2023-12-02 08:22:33,288 INFO L134 CoverageAnalysis]: Checked inductivity of 70 backedges. 0 proven. 70 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-12-02 08:22:33,288 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [2139532123] provided 0 perfect and 2 imperfect interpolant sequences [2023-12-02 08:22:33,289 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSifa [2031579436] [2023-12-02 08:22:33,289 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 08:22:33,290 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2023-12-02 08:22:33,290 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [16, 16, 16] total 22 [2023-12-02 08:22:33,290 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [600584876] [2023-12-02 08:22:33,290 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2023-12-02 08:22:33,290 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 23 states [2023-12-02 08:22:33,291 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2023-12-02 08:22:33,291 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 23 interpolants. [2023-12-02 08:22:33,292 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=143, Invalid=363, Unknown=0, NotChecked=0, Total=506 [2023-12-02 08:22:33,292 INFO L87 Difference]: Start difference. First operand 324 states and 631 transitions. Second operand has 23 states, 23 states have (on average 1.826086956521739) internal successors, (42), 22 states have internal predecessors, (42), 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 08:22:33,506 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-12-02 08:22:33,506 INFO L93 Difference]: Finished difference Result 333 states and 640 transitions. [2023-12-02 08:22:33,506 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 21 states. [2023-12-02 08:22:33,507 INFO L78 Accepts]: Start accepts. Automaton has has 23 states, 23 states have (on average 1.826086956521739) internal successors, (42), 22 states have internal predecessors, (42), 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 30 [2023-12-02 08:22:33,507 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-12-02 08:22:33,509 INFO L225 Difference]: With dead ends: 333 [2023-12-02 08:22:33,509 INFO L226 Difference]: Without dead ends: 333 [2023-12-02 08:22:33,510 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 83 GetRequests, 42 SyntacticMatches, 11 SemanticMatches, 30 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 360 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=298, Invalid=694, Unknown=0, NotChecked=0, Total=992 [2023-12-02 08:22:33,511 INFO L413 NwaCegarLoop]: 12 mSDtfsCounter, 56 mSDsluCounter, 73 mSDsCounter, 0 mSdLazyCounter, 200 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 56 SdHoareTripleChecker+Valid, 85 SdHoareTripleChecker+Invalid, 201 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 200 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2023-12-02 08:22:33,511 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [56 Valid, 85 Invalid, 201 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 200 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2023-12-02 08:22:33,512 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 333 states. [2023-12-02 08:22:33,520 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 333 to 333. [2023-12-02 08:22:33,521 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 333 states, 309 states have (on average 2.071197411003236) internal successors, (640), 332 states have internal predecessors, (640), 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 08:22:33,523 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 333 states to 333 states and 640 transitions. [2023-12-02 08:22:33,523 INFO L78 Accepts]: Start accepts. Automaton has 333 states and 640 transitions. Word has length 30 [2023-12-02 08:22:33,523 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-12-02 08:22:33,523 INFO L495 AbstractCegarLoop]: Abstraction has 333 states and 640 transitions. [2023-12-02 08:22:33,523 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 23 states, 23 states have (on average 1.826086956521739) internal successors, (42), 22 states have internal predecessors, (42), 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 08:22:33,524 INFO L276 IsEmpty]: Start isEmpty. Operand 333 states and 640 transitions. [2023-12-02 08:22:33,525 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 40 [2023-12-02 08:22:33,525 INFO L187 NwaCegarLoop]: Found error trace [2023-12-02 08:22:33,525 INFO L195 NwaCegarLoop]: trace histogram [10, 10, 10, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-12-02 08:22:33,530 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_72ec9ce2-d26b-43c5-a264-de0e9bf99c34/bin/utaipan-verify-nQ1chXbOIh/z3 -smt2 -in SMTLIB2_COMPLIANT=true (7)] Ended with exit code 0 [2023-12-02 08:22:33,726 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7,7 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_72ec9ce2-d26b-43c5-a264-de0e9bf99c34/bin/utaipan-verify-nQ1chXbOIh/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-12-02 08:22:33,727 INFO L420 AbstractCegarLoop]: === Iteration 9 === Targeting ULTIMATE.startErr3ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 12 more)] === [2023-12-02 08:22:33,727 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-12-02 08:22:33,727 INFO L85 PathProgramCache]: Analyzing trace with hash 134171291, now seen corresponding path program 2 times [2023-12-02 08:22:33,727 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2023-12-02 08:22:33,727 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1091136934] [2023-12-02 08:22:33,727 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-02 08:22:33,728 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-12-02 08:22:33,756 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-02 08:22:33,982 INFO L134 CoverageAnalysis]: Checked inductivity of 145 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 145 trivial. 0 not checked. [2023-12-02 08:22:33,982 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2023-12-02 08:22:33,982 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1091136934] [2023-12-02 08:22:33,982 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1091136934] provided 1 perfect and 0 imperfect interpolant sequences [2023-12-02 08:22:33,982 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-12-02 08:22:33,982 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2023-12-02 08:22:33,983 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [697602207] [2023-12-02 08:22:33,983 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-12-02 08:22:33,983 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2023-12-02 08:22:33,983 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2023-12-02 08:22:33,984 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2023-12-02 08:22:33,984 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2023-12-02 08:22:33,984 INFO L87 Difference]: Start difference. First operand 333 states and 640 transitions. Second operand has 6 states, 5 states have (on average 2.4) internal successors, (12), 5 states have internal predecessors, (12), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-12-02 08:22:34,117 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-12-02 08:22:34,117 INFO L93 Difference]: Finished difference Result 353 states and 674 transitions. [2023-12-02 08:22:34,117 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2023-12-02 08:22:34,117 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 5 states have (on average 2.4) internal successors, (12), 5 states have internal predecessors, (12), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 39 [2023-12-02 08:22:34,118 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-12-02 08:22:34,120 INFO L225 Difference]: With dead ends: 353 [2023-12-02 08:22:34,120 INFO L226 Difference]: Without dead ends: 353 [2023-12-02 08:22:34,121 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=22, Invalid=34, Unknown=0, NotChecked=0, Total=56 [2023-12-02 08:22:34,121 INFO L413 NwaCegarLoop]: 20 mSDtfsCounter, 45 mSDsluCounter, 64 mSDsCounter, 0 mSdLazyCounter, 160 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 45 SdHoareTripleChecker+Valid, 84 SdHoareTripleChecker+Invalid, 161 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 160 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2023-12-02 08:22:34,122 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [45 Valid, 84 Invalid, 161 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 160 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2023-12-02 08:22:34,123 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 353 states. [2023-12-02 08:22:34,129 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 353 to 344. [2023-12-02 08:22:34,130 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 344 states, 320 states have (on average 2.065625) internal successors, (661), 343 states have internal predecessors, (661), 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 08:22:34,131 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 344 states to 344 states and 661 transitions. [2023-12-02 08:22:34,131 INFO L78 Accepts]: Start accepts. Automaton has 344 states and 661 transitions. Word has length 39 [2023-12-02 08:22:34,131 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-12-02 08:22:34,131 INFO L495 AbstractCegarLoop]: Abstraction has 344 states and 661 transitions. [2023-12-02 08:22:34,132 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 5 states have (on average 2.4) internal successors, (12), 5 states have internal predecessors, (12), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-12-02 08:22:34,132 INFO L276 IsEmpty]: Start isEmpty. Operand 344 states and 661 transitions. [2023-12-02 08:22:34,133 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 40 [2023-12-02 08:22:34,133 INFO L187 NwaCegarLoop]: Found error trace [2023-12-02 08:22:34,133 INFO L195 NwaCegarLoop]: trace histogram [10, 10, 10, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-12-02 08:22:34,133 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2023-12-02 08:22:34,133 INFO L420 AbstractCegarLoop]: === Iteration 10 === Targeting t_funErr1ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 12 more)] === [2023-12-02 08:22:34,134 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-12-02 08:22:34,134 INFO L85 PathProgramCache]: Analyzing trace with hash 702848226, now seen corresponding path program 1 times [2023-12-02 08:22:34,134 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2023-12-02 08:22:34,134 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [488986745] [2023-12-02 08:22:34,134 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-02 08:22:34,135 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-12-02 08:22:34,155 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-02 08:22:34,357 INFO L134 CoverageAnalysis]: Checked inductivity of 145 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 145 trivial. 0 not checked. [2023-12-02 08:22:34,358 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2023-12-02 08:22:34,358 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [488986745] [2023-12-02 08:22:34,358 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [488986745] provided 1 perfect and 0 imperfect interpolant sequences [2023-12-02 08:22:34,358 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-12-02 08:22:34,358 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2023-12-02 08:22:34,358 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2106318647] [2023-12-02 08:22:34,358 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-12-02 08:22:34,359 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2023-12-02 08:22:34,359 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2023-12-02 08:22:34,359 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2023-12-02 08:22:34,359 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2023-12-02 08:22:34,360 INFO L87 Difference]: Start difference. First operand 344 states and 661 transitions. Second operand has 6 states, 5 states have (on average 2.4) internal successors, (12), 5 states have internal predecessors, (12), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-12-02 08:22:34,475 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-12-02 08:22:34,475 INFO L93 Difference]: Finished difference Result 360 states and 688 transitions. [2023-12-02 08:22:34,475 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2023-12-02 08:22:34,476 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 5 states have (on average 2.4) internal successors, (12), 5 states have internal predecessors, (12), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 39 [2023-12-02 08:22:34,476 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-12-02 08:22:34,478 INFO L225 Difference]: With dead ends: 360 [2023-12-02 08:22:34,478 INFO L226 Difference]: Without dead ends: 360 [2023-12-02 08:22:34,478 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=22, Invalid=34, Unknown=0, NotChecked=0, Total=56 [2023-12-02 08:22:34,479 INFO L413 NwaCegarLoop]: 19 mSDtfsCounter, 53 mSDsluCounter, 48 mSDsCounter, 0 mSdLazyCounter, 132 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 53 SdHoareTripleChecker+Valid, 67 SdHoareTripleChecker+Invalid, 133 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 132 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2023-12-02 08:22:34,479 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [53 Valid, 67 Invalid, 133 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 132 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2023-12-02 08:22:34,481 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 360 states. [2023-12-02 08:22:34,487 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 360 to 356. [2023-12-02 08:22:34,487 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 356 states, 332 states have (on average 2.0602409638554215) internal successors, (684), 355 states have internal predecessors, (684), 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 08:22:34,489 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 356 states to 356 states and 684 transitions. [2023-12-02 08:22:34,489 INFO L78 Accepts]: Start accepts. Automaton has 356 states and 684 transitions. Word has length 39 [2023-12-02 08:22:34,489 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-12-02 08:22:34,489 INFO L495 AbstractCegarLoop]: Abstraction has 356 states and 684 transitions. [2023-12-02 08:22:34,489 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 5 states have (on average 2.4) internal successors, (12), 5 states have internal predecessors, (12), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-12-02 08:22:34,489 INFO L276 IsEmpty]: Start isEmpty. Operand 356 states and 684 transitions. [2023-12-02 08:22:34,490 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 43 [2023-12-02 08:22:34,490 INFO L187 NwaCegarLoop]: Found error trace [2023-12-02 08:22:34,490 INFO L195 NwaCegarLoop]: trace histogram [10, 10, 10, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-12-02 08:22:34,491 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9 [2023-12-02 08:22:34,491 INFO L420 AbstractCegarLoop]: === Iteration 11 === Targeting ULTIMATE.startErr4ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 12 more)] === [2023-12-02 08:22:34,491 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-12-02 08:22:34,491 INFO L85 PathProgramCache]: Analyzing trace with hash -1517377358, now seen corresponding path program 1 times [2023-12-02 08:22:34,492 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2023-12-02 08:22:34,492 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [983337715] [2023-12-02 08:22:34,492 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-02 08:22:34,492 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-12-02 08:22:34,511 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-02 08:22:34,564 INFO L134 CoverageAnalysis]: Checked inductivity of 145 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 145 trivial. 0 not checked. [2023-12-02 08:22:34,565 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2023-12-02 08:22:34,565 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [983337715] [2023-12-02 08:22:34,565 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [983337715] provided 1 perfect and 0 imperfect interpolant sequences [2023-12-02 08:22:34,565 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-12-02 08:22:34,565 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2023-12-02 08:22:34,565 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [604669165] [2023-12-02 08:22:34,565 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-12-02 08:22:34,565 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2023-12-02 08:22:34,566 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2023-12-02 08:22:34,566 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2023-12-02 08:22:34,566 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2023-12-02 08:22:34,566 INFO L87 Difference]: Start difference. First operand 356 states and 684 transitions. Second operand has 4 states, 3 states have (on average 5.0) internal successors, (15), 4 states have internal predecessors, (15), 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 08:22:34,643 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-12-02 08:22:34,644 INFO L93 Difference]: Finished difference Result 518 states and 1006 transitions. [2023-12-02 08:22:34,644 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2023-12-02 08:22:34,644 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 3 states have (on average 5.0) internal successors, (15), 4 states have internal predecessors, (15), 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 42 [2023-12-02 08:22:34,644 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-12-02 08:22:34,648 INFO L225 Difference]: With dead ends: 518 [2023-12-02 08:22:34,648 INFO L226 Difference]: Without dead ends: 518 [2023-12-02 08:22:34,648 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 08:22:34,649 INFO L413 NwaCegarLoop]: 22 mSDtfsCounter, 35 mSDsluCounter, 27 mSDsCounter, 0 mSdLazyCounter, 99 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 35 SdHoareTripleChecker+Valid, 49 SdHoareTripleChecker+Invalid, 101 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 99 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2023-12-02 08:22:34,649 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [35 Valid, 49 Invalid, 101 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 99 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2023-12-02 08:22:34,651 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 518 states. [2023-12-02 08:22:34,659 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 518 to 490. [2023-12-02 08:22:34,660 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 490 states, 466 states have (on average 2.0987124463519313) internal successors, (978), 489 states have internal predecessors, (978), 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 08:22:34,661 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 490 states to 490 states and 978 transitions. [2023-12-02 08:22:34,661 INFO L78 Accepts]: Start accepts. Automaton has 490 states and 978 transitions. Word has length 42 [2023-12-02 08:22:34,661 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-12-02 08:22:34,662 INFO L495 AbstractCegarLoop]: Abstraction has 490 states and 978 transitions. [2023-12-02 08:22:34,662 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 3 states have (on average 5.0) internal successors, (15), 4 states have internal predecessors, (15), 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 08:22:34,662 INFO L276 IsEmpty]: Start isEmpty. Operand 490 states and 978 transitions. [2023-12-02 08:22:34,662 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 43 [2023-12-02 08:22:34,662 INFO L187 NwaCegarLoop]: Found error trace [2023-12-02 08:22:34,663 INFO L195 NwaCegarLoop]: trace histogram [10, 10, 10, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-12-02 08:22:34,663 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10 [2023-12-02 08:22:34,663 INFO L420 AbstractCegarLoop]: === Iteration 12 === Targeting t_funErr2ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 12 more)] === [2023-12-02 08:22:34,663 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-12-02 08:22:34,663 INFO L85 PathProgramCache]: Analyzing trace with hash 586208854, now seen corresponding path program 1 times [2023-12-02 08:22:34,663 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2023-12-02 08:22:34,663 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1163759200] [2023-12-02 08:22:34,664 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-02 08:22:34,664 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-12-02 08:22:34,682 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-02 08:22:34,729 INFO L134 CoverageAnalysis]: Checked inductivity of 145 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 145 trivial. 0 not checked. [2023-12-02 08:22:34,729 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2023-12-02 08:22:34,730 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1163759200] [2023-12-02 08:22:34,730 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1163759200] provided 1 perfect and 0 imperfect interpolant sequences [2023-12-02 08:22:34,730 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-12-02 08:22:34,730 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2023-12-02 08:22:34,730 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1230003064] [2023-12-02 08:22:34,730 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-12-02 08:22:34,730 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2023-12-02 08:22:34,730 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2023-12-02 08:22:34,731 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2023-12-02 08:22:34,731 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2023-12-02 08:22:34,731 INFO L87 Difference]: Start difference. First operand 490 states and 978 transitions. Second operand has 4 states, 3 states have (on average 5.0) internal successors, (15), 4 states have internal predecessors, (15), 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 08:22:34,829 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-12-02 08:22:34,829 INFO L93 Difference]: Finished difference Result 716 states and 1436 transitions. [2023-12-02 08:22:34,829 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2023-12-02 08:22:34,829 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 3 states have (on average 5.0) internal successors, (15), 4 states have internal predecessors, (15), 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 42 [2023-12-02 08:22:34,830 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-12-02 08:22:34,834 INFO L225 Difference]: With dead ends: 716 [2023-12-02 08:22:34,834 INFO L226 Difference]: Without dead ends: 716 [2023-12-02 08:22:34,834 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 08:22:34,835 INFO L413 NwaCegarLoop]: 22 mSDtfsCounter, 35 mSDsluCounter, 27 mSDsCounter, 0 mSdLazyCounter, 99 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 35 SdHoareTripleChecker+Valid, 49 SdHoareTripleChecker+Invalid, 101 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 99 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2023-12-02 08:22:34,835 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [35 Valid, 49 Invalid, 101 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 99 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2023-12-02 08:22:34,837 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 716 states. [2023-12-02 08:22:34,851 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 716 to 680. [2023-12-02 08:22:34,853 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 680 states, 656 states have (on average 2.1341463414634148) internal successors, (1400), 679 states have internal predecessors, (1400), 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 08:22:34,855 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 680 states to 680 states and 1400 transitions. [2023-12-02 08:22:34,856 INFO L78 Accepts]: Start accepts. Automaton has 680 states and 1400 transitions. Word has length 42 [2023-12-02 08:22:34,856 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-12-02 08:22:34,856 INFO L495 AbstractCegarLoop]: Abstraction has 680 states and 1400 transitions. [2023-12-02 08:22:34,856 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 3 states have (on average 5.0) internal successors, (15), 4 states have internal predecessors, (15), 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 08:22:34,857 INFO L276 IsEmpty]: Start isEmpty. Operand 680 states and 1400 transitions. [2023-12-02 08:22:34,857 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 45 [2023-12-02 08:22:34,857 INFO L187 NwaCegarLoop]: Found error trace [2023-12-02 08:22:34,858 INFO L195 NwaCegarLoop]: trace histogram [10, 10, 10, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-12-02 08:22:34,858 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable11 [2023-12-02 08:22:34,858 INFO L420 AbstractCegarLoop]: === Iteration 13 === Targeting t_funErr0ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 12 more)] === [2023-12-02 08:22:34,858 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-12-02 08:22:34,858 INFO L85 PathProgramCache]: Analyzing trace with hash 2110499894, now seen corresponding path program 1 times [2023-12-02 08:22:34,858 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2023-12-02 08:22:34,859 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [851414895] [2023-12-02 08:22:34,859 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-02 08:22:34,859 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-12-02 08:22:34,884 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-02 08:22:35,241 INFO L134 CoverageAnalysis]: Checked inductivity of 145 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 145 trivial. 0 not checked. [2023-12-02 08:22:35,241 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2023-12-02 08:22:35,241 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [851414895] [2023-12-02 08:22:35,241 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [851414895] provided 1 perfect and 0 imperfect interpolant sequences [2023-12-02 08:22:35,241 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-12-02 08:22:35,241 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2023-12-02 08:22:35,241 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1650704761] [2023-12-02 08:22:35,241 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-12-02 08:22:35,242 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2023-12-02 08:22:35,242 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2023-12-02 08:22:35,242 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2023-12-02 08:22:35,242 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=23, Invalid=49, Unknown=0, NotChecked=0, Total=72 [2023-12-02 08:22:35,243 INFO L87 Difference]: Start difference. First operand 680 states and 1400 transitions. Second operand has 9 states, 8 states have (on average 2.125) internal successors, (17), 8 states have internal predecessors, (17), 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 08:22:35,680 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-12-02 08:22:35,680 INFO L93 Difference]: Finished difference Result 984 states and 2032 transitions. [2023-12-02 08:22:35,680 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 16 states. [2023-12-02 08:22:35,681 INFO L78 Accepts]: Start accepts. Automaton has has 9 states, 8 states have (on average 2.125) internal successors, (17), 8 states have internal predecessors, (17), 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 44 [2023-12-02 08:22:35,681 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-12-02 08:22:35,687 INFO L225 Difference]: With dead ends: 984 [2023-12-02 08:22:35,687 INFO L226 Difference]: Without dead ends: 984 [2023-12-02 08:22:35,687 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 17 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 17 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 51 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=119, Invalid=223, Unknown=0, NotChecked=0, Total=342 [2023-12-02 08:22:35,688 INFO L413 NwaCegarLoop]: 18 mSDtfsCounter, 130 mSDsluCounter, 81 mSDsCounter, 0 mSdLazyCounter, 294 mSolverCounterSat, 8 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 130 SdHoareTripleChecker+Valid, 99 SdHoareTripleChecker+Invalid, 302 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 8 IncrementalHoareTripleChecker+Valid, 294 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2023-12-02 08:22:35,688 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [130 Valid, 99 Invalid, 302 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [8 Valid, 294 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2023-12-02 08:22:35,690 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 984 states. [2023-12-02 08:22:35,705 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 984 to 790. [2023-12-02 08:22:35,707 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 790 states, 766 states have (on average 2.1148825065274153) internal successors, (1620), 789 states have internal predecessors, (1620), 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 08:22:35,709 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 790 states to 790 states and 1620 transitions. [2023-12-02 08:22:35,710 INFO L78 Accepts]: Start accepts. Automaton has 790 states and 1620 transitions. Word has length 44 [2023-12-02 08:22:35,710 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-12-02 08:22:35,710 INFO L495 AbstractCegarLoop]: Abstraction has 790 states and 1620 transitions. [2023-12-02 08:22:35,710 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 8 states have (on average 2.125) internal successors, (17), 8 states have internal predecessors, (17), 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 08:22:35,710 INFO L276 IsEmpty]: Start isEmpty. Operand 790 states and 1620 transitions. [2023-12-02 08:22:35,710 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 45 [2023-12-02 08:22:35,710 INFO L187 NwaCegarLoop]: Found error trace [2023-12-02 08:22:35,711 INFO L195 NwaCegarLoop]: trace histogram [10, 10, 10, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-12-02 08:22:35,711 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable12 [2023-12-02 08:22:35,711 INFO L420 AbstractCegarLoop]: === Iteration 14 === Targeting ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 12 more)] === [2023-12-02 08:22:35,711 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-12-02 08:22:35,711 INFO L85 PathProgramCache]: Analyzing trace with hash 1252757559, now seen corresponding path program 1 times [2023-12-02 08:22:35,711 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2023-12-02 08:22:35,711 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [936345105] [2023-12-02 08:22:35,711 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-02 08:22:35,712 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-12-02 08:22:35,734 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-02 08:22:36,064 INFO L134 CoverageAnalysis]: Checked inductivity of 145 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 145 trivial. 0 not checked. [2023-12-02 08:22:36,064 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2023-12-02 08:22:36,064 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [936345105] [2023-12-02 08:22:36,065 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [936345105] provided 1 perfect and 0 imperfect interpolant sequences [2023-12-02 08:22:36,065 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-12-02 08:22:36,065 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2023-12-02 08:22:36,065 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [39699221] [2023-12-02 08:22:36,065 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-12-02 08:22:36,065 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2023-12-02 08:22:36,065 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2023-12-02 08:22:36,066 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2023-12-02 08:22:36,066 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=18, Invalid=54, Unknown=0, NotChecked=0, Total=72 [2023-12-02 08:22:36,066 INFO L87 Difference]: Start difference. First operand 790 states and 1620 transitions. Second operand has 9 states, 8 states have (on average 2.125) internal successors, (17), 8 states have internal predecessors, (17), 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 08:22:36,434 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-12-02 08:22:36,434 INFO L93 Difference]: Finished difference Result 949 states and 1952 transitions. [2023-12-02 08:22:36,434 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2023-12-02 08:22:36,434 INFO L78 Accepts]: Start accepts. Automaton has has 9 states, 8 states have (on average 2.125) internal successors, (17), 8 states have internal predecessors, (17), 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 44 [2023-12-02 08:22:36,434 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-12-02 08:22:36,441 INFO L225 Difference]: With dead ends: 949 [2023-12-02 08:22:36,441 INFO L226 Difference]: Without dead ends: 949 [2023-12-02 08:22:36,441 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 16 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 16 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 40 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=99, Invalid=207, Unknown=0, NotChecked=0, Total=306 [2023-12-02 08:22:36,442 INFO L413 NwaCegarLoop]: 20 mSDtfsCounter, 105 mSDsluCounter, 119 mSDsCounter, 0 mSdLazyCounter, 325 mSolverCounterSat, 7 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 105 SdHoareTripleChecker+Valid, 139 SdHoareTripleChecker+Invalid, 332 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 7 IncrementalHoareTripleChecker+Valid, 325 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2023-12-02 08:22:36,442 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [105 Valid, 139 Invalid, 332 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [7 Valid, 325 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2023-12-02 08:22:36,444 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 949 states. [2023-12-02 08:22:36,459 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 949 to 842. [2023-12-02 08:22:36,460 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 842 states, 818 states have (on average 2.10880195599022) internal successors, (1725), 841 states have internal predecessors, (1725), 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 08:22:36,463 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 842 states to 842 states and 1725 transitions. [2023-12-02 08:22:36,464 INFO L78 Accepts]: Start accepts. Automaton has 842 states and 1725 transitions. Word has length 44 [2023-12-02 08:22:36,464 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-12-02 08:22:36,464 INFO L495 AbstractCegarLoop]: Abstraction has 842 states and 1725 transitions. [2023-12-02 08:22:36,464 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 8 states have (on average 2.125) internal successors, (17), 8 states have internal predecessors, (17), 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 08:22:36,464 INFO L276 IsEmpty]: Start isEmpty. Operand 842 states and 1725 transitions. [2023-12-02 08:22:36,464 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 45 [2023-12-02 08:22:36,464 INFO L187 NwaCegarLoop]: Found error trace [2023-12-02 08:22:36,465 INFO L195 NwaCegarLoop]: trace histogram [10, 10, 10, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-12-02 08:22:36,465 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable13 [2023-12-02 08:22:36,465 INFO L420 AbstractCegarLoop]: === Iteration 15 === Targeting ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 12 more)] === [2023-12-02 08:22:36,465 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-12-02 08:22:36,465 INFO L85 PathProgramCache]: Analyzing trace with hash 693194645, now seen corresponding path program 2 times [2023-12-02 08:22:36,465 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2023-12-02 08:22:36,465 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1551109532] [2023-12-02 08:22:36,465 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-02 08:22:36,466 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-12-02 08:22:36,484 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-02 08:22:36,779 INFO L134 CoverageAnalysis]: Checked inductivity of 145 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 145 trivial. 0 not checked. [2023-12-02 08:22:36,779 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2023-12-02 08:22:36,779 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1551109532] [2023-12-02 08:22:36,779 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1551109532] provided 1 perfect and 0 imperfect interpolant sequences [2023-12-02 08:22:36,779 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-12-02 08:22:36,779 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2023-12-02 08:22:36,779 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1341544096] [2023-12-02 08:22:36,780 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-12-02 08:22:36,780 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2023-12-02 08:22:36,780 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2023-12-02 08:22:36,780 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2023-12-02 08:22:36,780 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=19, Invalid=53, Unknown=0, NotChecked=0, Total=72 [2023-12-02 08:22:36,781 INFO L87 Difference]: Start difference. First operand 842 states and 1725 transitions. Second operand has 9 states, 8 states have (on average 2.125) internal successors, (17), 8 states have internal predecessors, (17), 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 08:22:37,219 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-12-02 08:22:37,220 INFO L93 Difference]: Finished difference Result 980 states and 2012 transitions. [2023-12-02 08:22:37,220 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 16 states. [2023-12-02 08:22:37,220 INFO L78 Accepts]: Start accepts. Automaton has has 9 states, 8 states have (on average 2.125) internal successors, (17), 8 states have internal predecessors, (17), 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 44 [2023-12-02 08:22:37,220 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-12-02 08:22:37,225 INFO L225 Difference]: With dead ends: 980 [2023-12-02 08:22:37,225 INFO L226 Difference]: Without dead ends: 980 [2023-12-02 08:22:37,226 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 18 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 18 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 40 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=127, Invalid=253, Unknown=0, NotChecked=0, Total=380 [2023-12-02 08:22:37,226 INFO L413 NwaCegarLoop]: 19 mSDtfsCounter, 86 mSDsluCounter, 100 mSDsCounter, 0 mSdLazyCounter, 367 mSolverCounterSat, 8 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 86 SdHoareTripleChecker+Valid, 119 SdHoareTripleChecker+Invalid, 375 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 8 IncrementalHoareTripleChecker+Valid, 367 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2023-12-02 08:22:37,227 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [86 Valid, 119 Invalid, 375 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [8 Valid, 367 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2023-12-02 08:22:37,229 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 980 states. [2023-12-02 08:22:37,245 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 980 to 834. [2023-12-02 08:22:37,247 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 834 states, 810 states have (on average 2.1098765432098765) internal successors, (1709), 833 states have internal predecessors, (1709), 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 08:22:37,250 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 834 states to 834 states and 1709 transitions. [2023-12-02 08:22:37,250 INFO L78 Accepts]: Start accepts. Automaton has 834 states and 1709 transitions. Word has length 44 [2023-12-02 08:22:37,250 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-12-02 08:22:37,250 INFO L495 AbstractCegarLoop]: Abstraction has 834 states and 1709 transitions. [2023-12-02 08:22:37,250 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 8 states have (on average 2.125) internal successors, (17), 8 states have internal predecessors, (17), 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 08:22:37,250 INFO L276 IsEmpty]: Start isEmpty. Operand 834 states and 1709 transitions. [2023-12-02 08:22:37,251 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 45 [2023-12-02 08:22:37,251 INFO L187 NwaCegarLoop]: Found error trace [2023-12-02 08:22:37,251 INFO L195 NwaCegarLoop]: trace histogram [10, 10, 10, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-12-02 08:22:37,251 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable14 [2023-12-02 08:22:37,251 INFO L420 AbstractCegarLoop]: === Iteration 16 === Targeting ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 12 more)] === [2023-12-02 08:22:37,252 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-12-02 08:22:37,252 INFO L85 PathProgramCache]: Analyzing trace with hash 722687735, now seen corresponding path program 3 times [2023-12-02 08:22:37,252 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2023-12-02 08:22:37,252 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1003944366] [2023-12-02 08:22:37,252 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-02 08:22:37,252 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-12-02 08:22:37,271 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-02 08:22:37,562 INFO L134 CoverageAnalysis]: Checked inductivity of 145 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 145 trivial. 0 not checked. [2023-12-02 08:22:37,562 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2023-12-02 08:22:37,562 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1003944366] [2023-12-02 08:22:37,562 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1003944366] provided 1 perfect and 0 imperfect interpolant sequences [2023-12-02 08:22:37,562 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-12-02 08:22:37,562 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2023-12-02 08:22:37,562 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1428991175] [2023-12-02 08:22:37,562 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-12-02 08:22:37,563 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2023-12-02 08:22:37,563 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2023-12-02 08:22:37,563 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2023-12-02 08:22:37,563 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=23, Invalid=49, Unknown=0, NotChecked=0, Total=72 [2023-12-02 08:22:37,563 INFO L87 Difference]: Start difference. First operand 834 states and 1709 transitions. Second operand has 9 states, 8 states have (on average 2.125) internal successors, (17), 8 states have internal predecessors, (17), 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 08:22:37,942 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-12-02 08:22:37,942 INFO L93 Difference]: Finished difference Result 1046 states and 2154 transitions. [2023-12-02 08:22:37,942 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 16 states. [2023-12-02 08:22:37,942 INFO L78 Accepts]: Start accepts. Automaton has has 9 states, 8 states have (on average 2.125) internal successors, (17), 8 states have internal predecessors, (17), 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 44 [2023-12-02 08:22:37,942 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-12-02 08:22:37,948 INFO L225 Difference]: With dead ends: 1046 [2023-12-02 08:22:37,948 INFO L226 Difference]: Without dead ends: 1046 [2023-12-02 08:22:37,948 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 17 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 17 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 49 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=119, Invalid=223, Unknown=0, NotChecked=0, Total=342 [2023-12-02 08:22:37,948 INFO L413 NwaCegarLoop]: 18 mSDtfsCounter, 128 mSDsluCounter, 68 mSDsCounter, 0 mSdLazyCounter, 248 mSolverCounterSat, 8 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 128 SdHoareTripleChecker+Valid, 86 SdHoareTripleChecker+Invalid, 256 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 8 IncrementalHoareTripleChecker+Valid, 248 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2023-12-02 08:22:37,949 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [128 Valid, 86 Invalid, 256 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [8 Valid, 248 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2023-12-02 08:22:37,951 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1046 states. [2023-12-02 08:22:37,965 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1046 to 846. [2023-12-02 08:22:37,967 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 846 states, 822 states have (on average 2.102189781021898) internal successors, (1728), 845 states have internal predecessors, (1728), 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 08:22:37,969 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 846 states to 846 states and 1728 transitions. [2023-12-02 08:22:37,969 INFO L78 Accepts]: Start accepts. Automaton has 846 states and 1728 transitions. Word has length 44 [2023-12-02 08:22:37,970 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-12-02 08:22:37,970 INFO L495 AbstractCegarLoop]: Abstraction has 846 states and 1728 transitions. [2023-12-02 08:22:37,970 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 8 states have (on average 2.125) internal successors, (17), 8 states have internal predecessors, (17), 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 08:22:37,970 INFO L276 IsEmpty]: Start isEmpty. Operand 846 states and 1728 transitions. [2023-12-02 08:22:37,970 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 46 [2023-12-02 08:22:37,970 INFO L187 NwaCegarLoop]: Found error trace [2023-12-02 08:22:37,971 INFO L195 NwaCegarLoop]: trace histogram [10, 10, 10, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-12-02 08:22:37,971 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable15 [2023-12-02 08:22:37,971 INFO L420 AbstractCegarLoop]: === Iteration 17 === Targeting t_funErr1ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 12 more)] === [2023-12-02 08:22:37,971 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-12-02 08:22:37,971 INFO L85 PathProgramCache]: Analyzing trace with hash 1000987551, now seen corresponding path program 1 times [2023-12-02 08:22:37,971 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2023-12-02 08:22:37,971 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1675631185] [2023-12-02 08:22:37,971 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-02 08:22:37,972 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-12-02 08:22:37,989 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-02 08:22:38,295 INFO L134 CoverageAnalysis]: Checked inductivity of 145 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 145 trivial. 0 not checked. [2023-12-02 08:22:38,296 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2023-12-02 08:22:38,296 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1675631185] [2023-12-02 08:22:38,296 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1675631185] provided 1 perfect and 0 imperfect interpolant sequences [2023-12-02 08:22:38,296 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-12-02 08:22:38,296 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2023-12-02 08:22:38,296 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [538584251] [2023-12-02 08:22:38,296 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-12-02 08:22:38,297 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2023-12-02 08:22:38,297 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2023-12-02 08:22:38,297 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2023-12-02 08:22:38,298 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=23, Invalid=49, Unknown=0, NotChecked=0, Total=72 [2023-12-02 08:22:38,298 INFO L87 Difference]: Start difference. First operand 846 states and 1728 transitions. Second operand has 9 states, 8 states have (on average 2.25) internal successors, (18), 8 states have internal predecessors, (18), 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 08:22:38,696 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-12-02 08:22:38,696 INFO L93 Difference]: Finished difference Result 865 states and 1760 transitions. [2023-12-02 08:22:38,696 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2023-12-02 08:22:38,697 INFO L78 Accepts]: Start accepts. Automaton has has 9 states, 8 states have (on average 2.25) internal successors, (18), 8 states have internal predecessors, (18), 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 45 [2023-12-02 08:22:38,697 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-12-02 08:22:38,702 INFO L225 Difference]: With dead ends: 865 [2023-12-02 08:22:38,702 INFO L226 Difference]: Without dead ends: 865 [2023-12-02 08:22:38,702 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 17 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 17 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 51 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=119, Invalid=223, Unknown=0, NotChecked=0, Total=342 [2023-12-02 08:22:38,703 INFO L413 NwaCegarLoop]: 19 mSDtfsCounter, 86 mSDsluCounter, 107 mSDsCounter, 0 mSdLazyCounter, 327 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 86 SdHoareTripleChecker+Valid, 126 SdHoareTripleChecker+Invalid, 330 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 327 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2023-12-02 08:22:38,703 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [86 Valid, 126 Invalid, 330 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 327 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2023-12-02 08:22:38,704 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 865 states. [2023-12-02 08:22:38,716 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 865 to 809. [2023-12-02 08:22:38,717 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 809 states, 785 states have (on average 2.1019108280254777) internal successors, (1650), 808 states have internal predecessors, (1650), 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 08:22:38,720 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 809 states to 809 states and 1650 transitions. [2023-12-02 08:22:38,720 INFO L78 Accepts]: Start accepts. Automaton has 809 states and 1650 transitions. Word has length 45 [2023-12-02 08:22:38,720 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-12-02 08:22:38,720 INFO L495 AbstractCegarLoop]: Abstraction has 809 states and 1650 transitions. [2023-12-02 08:22:38,720 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 8 states have (on average 2.25) internal successors, (18), 8 states have internal predecessors, (18), 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 08:22:38,720 INFO L276 IsEmpty]: Start isEmpty. Operand 809 states and 1650 transitions. [2023-12-02 08:22:38,721 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 46 [2023-12-02 08:22:38,721 INFO L187 NwaCegarLoop]: Found error trace [2023-12-02 08:22:38,721 INFO L195 NwaCegarLoop]: trace histogram [10, 10, 10, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-12-02 08:22:38,721 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable16 [2023-12-02 08:22:38,721 INFO L420 AbstractCegarLoop]: === Iteration 18 === Targeting ULTIMATE.startErr3ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 12 more)] === [2023-12-02 08:22:38,722 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-12-02 08:22:38,722 INFO L85 PathProgramCache]: Analyzing trace with hash 180778903, now seen corresponding path program 1 times [2023-12-02 08:22:38,722 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2023-12-02 08:22:38,722 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1014735701] [2023-12-02 08:22:38,722 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-02 08:22:38,722 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-12-02 08:22:38,742 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-02 08:22:39,032 INFO L134 CoverageAnalysis]: Checked inductivity of 145 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 145 trivial. 0 not checked. [2023-12-02 08:22:39,032 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2023-12-02 08:22:39,032 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1014735701] [2023-12-02 08:22:39,032 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1014735701] provided 1 perfect and 0 imperfect interpolant sequences [2023-12-02 08:22:39,032 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-12-02 08:22:39,033 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2023-12-02 08:22:39,033 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [236914191] [2023-12-02 08:22:39,033 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-12-02 08:22:39,033 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2023-12-02 08:22:39,033 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2023-12-02 08:22:39,034 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2023-12-02 08:22:39,034 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=19, Invalid=53, Unknown=0, NotChecked=0, Total=72 [2023-12-02 08:22:39,034 INFO L87 Difference]: Start difference. First operand 809 states and 1650 transitions. Second operand has 9 states, 8 states have (on average 2.25) internal successors, (18), 8 states have internal predecessors, (18), 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 08:22:39,352 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-12-02 08:22:39,352 INFO L93 Difference]: Finished difference Result 919 states and 1870 transitions. [2023-12-02 08:22:39,352 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2023-12-02 08:22:39,352 INFO L78 Accepts]: Start accepts. Automaton has has 9 states, 8 states have (on average 2.25) internal successors, (18), 8 states have internal predecessors, (18), 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 45 [2023-12-02 08:22:39,353 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-12-02 08:22:39,357 INFO L225 Difference]: With dead ends: 919 [2023-12-02 08:22:39,357 INFO L226 Difference]: Without dead ends: 919 [2023-12-02 08:22:39,357 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 14 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 14 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 22 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=83, Invalid=157, Unknown=0, NotChecked=0, Total=240 [2023-12-02 08:22:39,358 INFO L413 NwaCegarLoop]: 19 mSDtfsCounter, 82 mSDsluCounter, 106 mSDsCounter, 0 mSdLazyCounter, 307 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 82 SdHoareTripleChecker+Valid, 125 SdHoareTripleChecker+Invalid, 309 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 307 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2023-12-02 08:22:39,358 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [82 Valid, 125 Invalid, 309 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 307 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2023-12-02 08:22:39,360 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 919 states. [2023-12-02 08:22:39,372 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 919 to 839. [2023-12-02 08:22:39,373 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 839 states, 815 states have (on average 2.098159509202454) internal successors, (1710), 838 states have internal predecessors, (1710), 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 08:22:39,377 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 839 states to 839 states and 1710 transitions. [2023-12-02 08:22:39,377 INFO L78 Accepts]: Start accepts. Automaton has 839 states and 1710 transitions. Word has length 45 [2023-12-02 08:22:39,377 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-12-02 08:22:39,377 INFO L495 AbstractCegarLoop]: Abstraction has 839 states and 1710 transitions. [2023-12-02 08:22:39,377 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 8 states have (on average 2.25) internal successors, (18), 8 states have internal predecessors, (18), 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 08:22:39,377 INFO L276 IsEmpty]: Start isEmpty. Operand 839 states and 1710 transitions. [2023-12-02 08:22:39,378 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 46 [2023-12-02 08:22:39,378 INFO L187 NwaCegarLoop]: Found error trace [2023-12-02 08:22:39,378 INFO L195 NwaCegarLoop]: trace histogram [10, 10, 10, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-12-02 08:22:39,378 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable17 [2023-12-02 08:22:39,378 INFO L420 AbstractCegarLoop]: === Iteration 19 === Targeting ULTIMATE.startErr3ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 12 more)] === [2023-12-02 08:22:39,378 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-12-02 08:22:39,378 INFO L85 PathProgramCache]: Analyzing trace with hash 14197753, now seen corresponding path program 2 times [2023-12-02 08:22:39,378 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2023-12-02 08:22:39,379 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1900314856] [2023-12-02 08:22:39,379 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-02 08:22:39,379 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-12-02 08:22:39,397 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-02 08:22:39,715 INFO L134 CoverageAnalysis]: Checked inductivity of 145 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 145 trivial. 0 not checked. [2023-12-02 08:22:39,716 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2023-12-02 08:22:39,716 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1900314856] [2023-12-02 08:22:39,716 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1900314856] provided 1 perfect and 0 imperfect interpolant sequences [2023-12-02 08:22:39,716 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-12-02 08:22:39,716 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2023-12-02 08:22:39,716 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [369708498] [2023-12-02 08:22:39,716 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-12-02 08:22:39,717 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2023-12-02 08:22:39,717 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2023-12-02 08:22:39,717 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2023-12-02 08:22:39,717 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=19, Invalid=53, Unknown=0, NotChecked=0, Total=72 [2023-12-02 08:22:39,717 INFO L87 Difference]: Start difference. First operand 839 states and 1710 transitions. Second operand has 9 states, 8 states have (on average 2.25) internal successors, (18), 8 states have internal predecessors, (18), 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 08:22:40,143 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-12-02 08:22:40,143 INFO L93 Difference]: Finished difference Result 925 states and 1880 transitions. [2023-12-02 08:22:40,143 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 16 states. [2023-12-02 08:22:40,144 INFO L78 Accepts]: Start accepts. Automaton has has 9 states, 8 states have (on average 2.25) internal successors, (18), 8 states have internal predecessors, (18), 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 45 [2023-12-02 08:22:40,144 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-12-02 08:22:40,150 INFO L225 Difference]: With dead ends: 925 [2023-12-02 08:22:40,150 INFO L226 Difference]: Without dead ends: 925 [2023-12-02 08:22:40,150 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 18 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 18 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 40 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=127, Invalid=253, Unknown=0, NotChecked=0, Total=380 [2023-12-02 08:22:40,151 INFO L413 NwaCegarLoop]: 18 mSDtfsCounter, 76 mSDsluCounter, 96 mSDsCounter, 0 mSdLazyCounter, 372 mSolverCounterSat, 4 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 76 SdHoareTripleChecker+Valid, 114 SdHoareTripleChecker+Invalid, 376 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 4 IncrementalHoareTripleChecker+Valid, 372 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2023-12-02 08:22:40,151 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [76 Valid, 114 Invalid, 376 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [4 Valid, 372 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2023-12-02 08:22:40,153 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 925 states. [2023-12-02 08:22:40,173 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 925 to 831. [2023-12-02 08:22:40,175 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 831 states, 807 states have (on average 2.0991325898389097) internal successors, (1694), 830 states have internal predecessors, (1694), 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 08:22:40,179 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 831 states to 831 states and 1694 transitions. [2023-12-02 08:22:40,179 INFO L78 Accepts]: Start accepts. Automaton has 831 states and 1694 transitions. Word has length 45 [2023-12-02 08:22:40,180 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-12-02 08:22:40,180 INFO L495 AbstractCegarLoop]: Abstraction has 831 states and 1694 transitions. [2023-12-02 08:22:40,180 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 8 states have (on average 2.25) internal successors, (18), 8 states have internal predecessors, (18), 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 08:22:40,180 INFO L276 IsEmpty]: Start isEmpty. Operand 831 states and 1694 transitions. [2023-12-02 08:22:40,181 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 46 [2023-12-02 08:22:40,181 INFO L187 NwaCegarLoop]: Found error trace [2023-12-02 08:22:40,181 INFO L195 NwaCegarLoop]: trace histogram [10, 10, 10, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-12-02 08:22:40,181 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable18 [2023-12-02 08:22:40,181 INFO L420 AbstractCegarLoop]: === Iteration 20 === Targeting ULTIMATE.startErr3ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 12 more)] === [2023-12-02 08:22:40,182 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-12-02 08:22:40,182 INFO L85 PathProgramCache]: Analyzing trace with hash 928483543, now seen corresponding path program 3 times [2023-12-02 08:22:40,182 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2023-12-02 08:22:40,182 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [902958144] [2023-12-02 08:22:40,182 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-02 08:22:40,182 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-12-02 08:22:40,204 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-02 08:22:40,556 INFO L134 CoverageAnalysis]: Checked inductivity of 145 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 145 trivial. 0 not checked. [2023-12-02 08:22:40,557 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2023-12-02 08:22:40,557 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [902958144] [2023-12-02 08:22:40,557 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [902958144] provided 1 perfect and 0 imperfect interpolant sequences [2023-12-02 08:22:40,557 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-12-02 08:22:40,557 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2023-12-02 08:22:40,557 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1679012155] [2023-12-02 08:22:40,558 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-12-02 08:22:40,558 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2023-12-02 08:22:40,558 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2023-12-02 08:22:40,558 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2023-12-02 08:22:40,558 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=23, Invalid=49, Unknown=0, NotChecked=0, Total=72 [2023-12-02 08:22:40,559 INFO L87 Difference]: Start difference. First operand 831 states and 1694 transitions. Second operand has 9 states, 8 states have (on average 2.25) internal successors, (18), 8 states have internal predecessors, (18), 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 08:22:40,915 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-12-02 08:22:40,915 INFO L93 Difference]: Finished difference Result 850 states and 1726 transitions. [2023-12-02 08:22:40,915 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2023-12-02 08:22:40,915 INFO L78 Accepts]: Start accepts. Automaton has has 9 states, 8 states have (on average 2.25) internal successors, (18), 8 states have internal predecessors, (18), 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 45 [2023-12-02 08:22:40,916 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-12-02 08:22:40,921 INFO L225 Difference]: With dead ends: 850 [2023-12-02 08:22:40,921 INFO L226 Difference]: Without dead ends: 850 [2023-12-02 08:22:40,922 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 17 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 17 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 52 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=119, Invalid=223, Unknown=0, NotChecked=0, Total=342 [2023-12-02 08:22:40,922 INFO L413 NwaCegarLoop]: 18 mSDtfsCounter, 91 mSDsluCounter, 66 mSDsCounter, 0 mSdLazyCounter, 254 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 91 SdHoareTripleChecker+Valid, 84 SdHoareTripleChecker+Invalid, 257 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 254 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2023-12-02 08:22:40,923 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [91 Valid, 84 Invalid, 257 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 254 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2023-12-02 08:22:40,925 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 850 states. [2023-12-02 08:22:40,942 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 850 to 772. [2023-12-02 08:22:40,944 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 772 states, 748 states have (on average 2.1016042780748663) internal successors, (1572), 771 states have internal predecessors, (1572), 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 08:22:40,947 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 772 states to 772 states and 1572 transitions. [2023-12-02 08:22:40,948 INFO L78 Accepts]: Start accepts. Automaton has 772 states and 1572 transitions. Word has length 45 [2023-12-02 08:22:40,948 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-12-02 08:22:40,948 INFO L495 AbstractCegarLoop]: Abstraction has 772 states and 1572 transitions. [2023-12-02 08:22:40,948 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 8 states have (on average 2.25) internal successors, (18), 8 states have internal predecessors, (18), 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 08:22:40,948 INFO L276 IsEmpty]: Start isEmpty. Operand 772 states and 1572 transitions. [2023-12-02 08:22:40,949 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 49 [2023-12-02 08:22:40,949 INFO L187 NwaCegarLoop]: Found error trace [2023-12-02 08:22:40,949 INFO L195 NwaCegarLoop]: trace histogram [10, 10, 10, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-12-02 08:22:40,949 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable19 [2023-12-02 08:22:40,949 INFO L420 AbstractCegarLoop]: === Iteration 21 === Targeting ULTIMATE.startErr3ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 12 more)] === [2023-12-02 08:22:40,950 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-12-02 08:22:40,950 INFO L85 PathProgramCache]: Analyzing trace with hash 1976714271, now seen corresponding path program 1 times [2023-12-02 08:22:40,950 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2023-12-02 08:22:40,950 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1404625965] [2023-12-02 08:22:40,950 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-02 08:22:40,950 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-12-02 08:22:40,973 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-02 08:22:41,439 INFO L134 CoverageAnalysis]: Checked inductivity of 150 backedges. 0 proven. 5 refuted. 0 times theorem prover too weak. 145 trivial. 0 not checked. [2023-12-02 08:22:41,439 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2023-12-02 08:22:41,439 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1404625965] [2023-12-02 08:22:41,439 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1404625965] provided 0 perfect and 1 imperfect interpolant sequences [2023-12-02 08:22:41,440 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [273123317] [2023-12-02 08:22:41,440 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-02 08:22:41,440 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-12-02 08:22:41,440 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_72ec9ce2-d26b-43c5-a264-de0e9bf99c34/bin/utaipan-verify-nQ1chXbOIh/z3 [2023-12-02 08:22:41,441 INFO L229 MonitoredProcess]: Starting monitored process 8 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_72ec9ce2-d26b-43c5-a264-de0e9bf99c34/bin/utaipan-verify-nQ1chXbOIh/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2023-12-02 08:22:41,444 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_72ec9ce2-d26b-43c5-a264-de0e9bf99c34/bin/utaipan-verify-nQ1chXbOIh/z3 -smt2 -in SMTLIB2_COMPLIANT=true (8)] Waiting until timeout for monitored process [2023-12-02 08:22:41,569 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-02 08:22:41,571 INFO L262 TraceCheckSpWp]: Trace formula consists of 220 conjuncts, 26 conjunts are in the unsatisfiable core [2023-12-02 08:22:41,575 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-12-02 08:22:41,583 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 7 treesize of output 6 [2023-12-02 08:22:41,744 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-12-02 08:22:41,745 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 10 [2023-12-02 08:22:41,833 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 22 treesize of output 17 [2023-12-02 08:22:46,309 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 21 treesize of output 15 [2023-12-02 08:22:46,360 INFO L134 CoverageAnalysis]: Checked inductivity of 150 backedges. 0 proven. 5 refuted. 0 times theorem prover too weak. 145 trivial. 0 not checked. [2023-12-02 08:22:46,360 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2023-12-02 08:22:53,317 INFO L134 CoverageAnalysis]: Checked inductivity of 150 backedges. 0 proven. 5 refuted. 0 times theorem prover too weak. 145 trivial. 0 not checked. [2023-12-02 08:22:53,317 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [273123317] provided 0 perfect and 2 imperfect interpolant sequences [2023-12-02 08:22:53,317 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSifa [181261044] [2023-12-02 08:22:53,318 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 08:22:53,318 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2023-12-02 08:22:53,318 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [10, 8, 8] total 25 [2023-12-02 08:22:53,319 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1353856662] [2023-12-02 08:22:53,319 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2023-12-02 08:22:53,319 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 27 states [2023-12-02 08:22:53,319 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2023-12-02 08:22:53,320 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 27 interpolants. [2023-12-02 08:22:53,320 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=127, Invalid=561, Unknown=14, NotChecked=0, Total=702 [2023-12-02 08:22:53,320 INFO L87 Difference]: Start difference. First operand 772 states and 1572 transitions. Second operand has 27 states, 26 states have (on average 2.269230769230769) internal successors, (59), 26 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 08:22:55,386 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.01s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2023-12-02 08:22:56,906 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.50s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2023-12-02 08:22:58,532 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.59s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2023-12-02 08:23:00,162 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.59s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2023-12-02 08:23:01,708 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.52s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2023-12-02 08:23:03,363 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.61s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2023-12-02 08:23:04,875 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.49s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2023-12-02 08:23:04,897 WARN L854 $PredicateComparison]: unable to prove that (let ((.cse1 (+ (* |c_ULTIMATE.start_main_~i~2#1| 28) |c_~#cache~0.offset|)) (.cse3 ((as const (Array Int Int)) 0)) (.cse2 (select |c_#memory_int| |c_ULTIMATE.start_cache_entry_addref_~entry#1.base|)) (.cse0 (select |c_#memory_int| |c_~#cache~0.base|))) (and (forall ((|v_ULTIMATE.start_cache_entry_addref_~entry#1.offset_39| Int)) (or (< (select .cse0 |v_ULTIMATE.start_cache_entry_addref_~entry#1.offset_39|) 2147483647) (< |v_ULTIMATE.start_cache_entry_addref_~entry#1.offset_39| .cse1))) (< (select .cse2 |c_ULTIMATE.start_cache_entry_addref_~entry#1.offset|) 2147483647) (= |c_ULTIMATE.start_main_~i~2#1| 0) (= |c_~#cache~0.base| 1) (forall ((|v_ULTIMATE.start_cache_entry_addref_~entry#1.offset_39| Int)) (or (< (select .cse0 |v_ULTIMATE.start_cache_entry_addref_~entry#1.offset_39|) 2147483647) (< |v_ULTIMATE.start_cache_entry_addref_~entry#1.offset_39| (+ 28 |c_~#cache~0.offset| (* |c_ULTIMATE.start_main_#t~post38#1| 28))))) (exists ((|ULTIMATE.start_cache_entry_addref_~entry#1.offset| Int)) (and (<= |ULTIMATE.start_cache_entry_addref_~entry#1.offset| .cse1) (let ((.cse4 (select |c_#memory_int| 1))) (= (store .cse3 |ULTIMATE.start_cache_entry_addref_~entry#1.offset| (select .cse4 |ULTIMATE.start_cache_entry_addref_~entry#1.offset|)) .cse4)))) (= |c_ULTIMATE.start_cache_entry_addref_~entry#1.offset| |c_~#cache~0.offset|) (= .cse3 (store .cse2 |c_ULTIMATE.start_cache_entry_addref_~entry#1.offset| 0)) (forall ((|v_ULTIMATE.start_main_~#t1~0#1.base_46| Int) (v_ArrVal_608 (Array Int Int)) (|v_ULTIMATE.start_cache_entry_addref_~entry#1.offset_41| Int) (|ULTIMATE.start_cache_entry_addref_#t~post32#1| Int) (|v_ULTIMATE.start_cache_entry_addref_~entry#1.offset_39| Int)) (or (< (select (store (select (store |c_#memory_int| |v_ULTIMATE.start_main_~#t1~0#1.base_46| v_ArrVal_608) |c_~#cache~0.base|) |v_ULTIMATE.start_cache_entry_addref_~entry#1.offset_41| (+ |ULTIMATE.start_cache_entry_addref_#t~post32#1| 1)) |v_ULTIMATE.start_cache_entry_addref_~entry#1.offset_39|) 2147483647) (< |v_ULTIMATE.start_cache_entry_addref_~entry#1.offset_39| (+ 28 |v_ULTIMATE.start_cache_entry_addref_~entry#1.offset_41|)) (< |v_ULTIMATE.start_main_~#t1~0#1.base_46| (+ |c_#StackHeapBarrier| 1)))) (forall ((|v_ULTIMATE.start_cache_entry_addref_~entry#1.offset_41| Int) (|ULTIMATE.start_cache_entry_addref_#t~post32#1| Int) (|v_ULTIMATE.start_cache_entry_addref_~entry#1.offset_39| Int)) (or (< (select (store .cse0 |v_ULTIMATE.start_cache_entry_addref_~entry#1.offset_41| (+ |ULTIMATE.start_cache_entry_addref_#t~post32#1| 1)) |v_ULTIMATE.start_cache_entry_addref_~entry#1.offset_39|) 2147483647) (< |v_ULTIMATE.start_cache_entry_addref_~entry#1.offset_39| (+ 28 |v_ULTIMATE.start_cache_entry_addref_~entry#1.offset_41|)))) (= |c_~#cache~0.base| |c_ULTIMATE.start_cache_entry_addref_~entry#1.base|))) is different from false [2023-12-02 08:23:10,595 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-12-02 08:23:10,595 INFO L93 Difference]: Finished difference Result 1173 states and 2408 transitions. [2023-12-02 08:23:10,596 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 24 states. [2023-12-02 08:23:10,596 INFO L78 Accepts]: Start accepts. Automaton has has 27 states, 26 states have (on average 2.269230769230769) internal successors, (59), 26 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 48 [2023-12-02 08:23:10,596 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-12-02 08:23:10,604 INFO L225 Difference]: With dead ends: 1173 [2023-12-02 08:23:10,604 INFO L226 Difference]: Without dead ends: 1173 [2023-12-02 08:23:10,605 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 118 GetRequests, 79 SyntacticMatches, 0 SemanticMatches, 39 ConstructedPredicates, 1 IntricatePredicates, 0 DeprecatedPredicates, 378 ImplicationChecksByTransitivity, 15.6s TimeCoverageRelationStatistics Valid=325, Invalid=1220, Unknown=19, NotChecked=76, Total=1640 [2023-12-02 08:23:10,606 INFO L413 NwaCegarLoop]: 28 mSDtfsCounter, 314 mSDsluCounter, 365 mSDsCounter, 0 mSdLazyCounter, 976 mSolverCounterSat, 15 mSolverCounterUnsat, 8 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 12.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 314 SdHoareTripleChecker+Valid, 393 SdHoareTripleChecker+Invalid, 1178 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 15 IncrementalHoareTripleChecker+Valid, 976 IncrementalHoareTripleChecker+Invalid, 8 IncrementalHoareTripleChecker+Unknown, 179 IncrementalHoareTripleChecker+Unchecked, 12.6s IncrementalHoareTripleChecker+Time [2023-12-02 08:23:10,606 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [314 Valid, 393 Invalid, 1178 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [15 Valid, 976 Invalid, 8 Unknown, 179 Unchecked, 12.6s Time] [2023-12-02 08:23:10,609 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1173 states. [2023-12-02 08:23:10,632 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1173 to 948. [2023-12-02 08:23:10,634 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 948 states, 924 states have (on average 2.146103896103896) internal successors, (1983), 947 states have internal predecessors, (1983), 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 08:23:10,638 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 948 states to 948 states and 1983 transitions. [2023-12-02 08:23:10,638 INFO L78 Accepts]: Start accepts. Automaton has 948 states and 1983 transitions. Word has length 48 [2023-12-02 08:23:10,638 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-12-02 08:23:10,638 INFO L495 AbstractCegarLoop]: Abstraction has 948 states and 1983 transitions. [2023-12-02 08:23:10,638 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 27 states, 26 states have (on average 2.269230769230769) internal successors, (59), 26 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 08:23:10,638 INFO L276 IsEmpty]: Start isEmpty. Operand 948 states and 1983 transitions. [2023-12-02 08:23:10,639 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 49 [2023-12-02 08:23:10,639 INFO L187 NwaCegarLoop]: Found error trace [2023-12-02 08:23:10,639 INFO L195 NwaCegarLoop]: trace histogram [10, 10, 10, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-12-02 08:23:10,646 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_72ec9ce2-d26b-43c5-a264-de0e9bf99c34/bin/utaipan-verify-nQ1chXbOIh/z3 -smt2 -in SMTLIB2_COMPLIANT=true (8)] Forceful destruction successful, exit code 0 [2023-12-02 08:23:10,845 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable20,8 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_72ec9ce2-d26b-43c5-a264-de0e9bf99c34/bin/utaipan-verify-nQ1chXbOIh/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-12-02 08:23:10,845 INFO L420 AbstractCegarLoop]: === Iteration 22 === Targeting t_funErr1ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 12 more)] === [2023-12-02 08:23:10,846 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-12-02 08:23:10,846 INFO L85 PathProgramCache]: Analyzing trace with hash 1545095116, now seen corresponding path program 1 times [2023-12-02 08:23:10,846 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2023-12-02 08:23:10,846 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [652144350] [2023-12-02 08:23:10,846 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-02 08:23:10,846 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-12-02 08:23:10,868 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-02 08:23:11,262 INFO L134 CoverageAnalysis]: Checked inductivity of 150 backedges. 0 proven. 5 refuted. 0 times theorem prover too weak. 145 trivial. 0 not checked. [2023-12-02 08:23:11,263 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2023-12-02 08:23:11,263 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [652144350] [2023-12-02 08:23:11,263 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [652144350] provided 0 perfect and 1 imperfect interpolant sequences [2023-12-02 08:23:11,263 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [128342101] [2023-12-02 08:23:11,263 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-02 08:23:11,263 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-12-02 08:23:11,263 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_72ec9ce2-d26b-43c5-a264-de0e9bf99c34/bin/utaipan-verify-nQ1chXbOIh/z3 [2023-12-02 08:23:11,264 INFO L229 MonitoredProcess]: Starting monitored process 9 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_72ec9ce2-d26b-43c5-a264-de0e9bf99c34/bin/utaipan-verify-nQ1chXbOIh/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2023-12-02 08:23:11,269 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_72ec9ce2-d26b-43c5-a264-de0e9bf99c34/bin/utaipan-verify-nQ1chXbOIh/z3 -smt2 -in SMTLIB2_COMPLIANT=true (9)] Waiting until timeout for monitored process [2023-12-02 08:23:11,375 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-02 08:23:11,377 INFO L262 TraceCheckSpWp]: Trace formula consists of 224 conjuncts, 26 conjunts are in the unsatisfiable core [2023-12-02 08:23:11,381 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-12-02 08:23:11,387 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 7 treesize of output 6 [2023-12-02 08:23:11,567 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-12-02 08:23:11,568 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 10 [2023-12-02 08:23:11,648 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 22 treesize of output 17 [2023-12-02 08:23:16,365 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 21 treesize of output 15 [2023-12-02 08:23:16,400 INFO L134 CoverageAnalysis]: Checked inductivity of 150 backedges. 0 proven. 5 refuted. 0 times theorem prover too weak. 145 trivial. 0 not checked. [2023-12-02 08:23:16,400 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2023-12-02 08:23:23,476 INFO L134 CoverageAnalysis]: Checked inductivity of 150 backedges. 0 proven. 5 refuted. 0 times theorem prover too weak. 145 trivial. 0 not checked. [2023-12-02 08:23:23,476 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [128342101] provided 0 perfect and 2 imperfect interpolant sequences [2023-12-02 08:23:23,476 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSifa [1957853285] [2023-12-02 08:23:23,477 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 08:23:23,477 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2023-12-02 08:23:23,477 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [10, 8, 8] total 25 [2023-12-02 08:23:23,477 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1136666831] [2023-12-02 08:23:23,477 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2023-12-02 08:23:23,478 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 27 states [2023-12-02 08:23:23,478 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2023-12-02 08:23:23,478 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 27 interpolants. [2023-12-02 08:23:23,479 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=137, Invalid=552, Unknown=13, NotChecked=0, Total=702 [2023-12-02 08:23:23,479 INFO L87 Difference]: Start difference. First operand 948 states and 1983 transitions. Second operand has 27 states, 26 states have (on average 2.269230769230769) internal successors, (59), 26 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 08:23:25,076 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.54s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2023-12-02 08:23:26,608 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.52s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2023-12-02 08:23:28,292 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.65s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2023-12-02 08:23:29,966 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.64s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2023-12-02 08:23:31,613 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.63s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2023-12-02 08:23:33,249 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.60s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2023-12-02 08:23:35,746 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0, 1] [2023-12-02 08:23:39,893 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.01s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0, 1] [2023-12-02 08:23:42,760 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0, 1] [2023-12-02 08:23:44,799 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.01s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0, 1] [2023-12-02 08:23:46,847 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0, 1] [2023-12-02 08:23:48,869 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0, 1] [2023-12-02 08:23:50,895 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0, 1] [2023-12-02 08:23:52,934 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0, 1] [2023-12-02 08:23:54,957 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0, 1] [2023-12-02 08:23:59,183 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0, 1] [2023-12-02 08:24:01,228 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.02s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0, 1] [2023-12-02 08:24:03,261 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.01s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0, 1] [2023-12-02 08:24:05,282 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0, 1] [2023-12-02 08:24:07,314 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0, 1] [2023-12-02 08:24:09,341 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.01s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0, 1] [2023-12-02 08:24:11,374 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.01s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0, 1] [2023-12-02 08:24:17,563 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0, 1] [2023-12-02 08:24:19,592 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0, 1] [2023-12-02 08:24:21,690 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0, 1] [2023-12-02 08:24:28,176 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.01s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0, 1] [2023-12-02 08:24:30,315 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 [1] [2023-12-02 08:24:38,447 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 [1] [2023-12-02 08:24:46,574 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 [1] [2023-12-02 08:24:48,601 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 [1] [2023-12-02 08:24:50,622 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 [1] [2023-12-02 08:24:52,629 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 [1] [2023-12-02 08:24:54,650 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 [1] [2023-12-02 08:24:56,659 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 [1] [2023-12-02 08:24:58,668 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 [1] [2023-12-02 08:25:00,678 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 [1] [2023-12-02 08:25:08,816 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 [1] [2023-12-02 08:25:10,821 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 [1] [2023-12-02 08:25:12,835 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 [1] [2023-12-02 08:25:20,940 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 [1] [2023-12-02 08:25:22,963 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 [1] [2023-12-02 08:25:24,987 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 [1] [2023-12-02 08:25:26,992 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 [1] [2023-12-02 08:25:28,997 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 [1] [2023-12-02 08:25:31,007 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 [1] [2023-12-02 08:25:33,032 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0, 1] [2023-12-02 08:25:35,083 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 [1] [2023-12-02 08:25:37,088 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 [1] [2023-12-02 08:25:39,094 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 [1] [2023-12-02 08:25:41,104 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 [1] [2023-12-02 08:25:43,125 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0, 1] [2023-12-02 08:25:45,160 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 [1] [2023-12-02 08:25:47,175 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 [1] [2023-12-02 08:25:49,195 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0, 1] [2023-12-02 08:26:07,332 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 [1] [2023-12-02 08:26:09,338 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 [1] [2023-12-02 08:26:11,346 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0, 1] [2023-12-02 08:26:13,399 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.01s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0, 1] [2023-12-02 08:26:15,412 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 [1] [2023-12-02 08:26:17,418 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.01s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0, 1] [2023-12-02 08:26:19,456 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0, 1] [2023-12-02 08:26:19,793 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-12-02 08:26:19,794 INFO L93 Difference]: Finished difference Result 1288 states and 2660 transitions. [2023-12-02 08:26:19,794 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 28 states. [2023-12-02 08:26:19,794 INFO L78 Accepts]: Start accepts. Automaton has has 27 states, 26 states have (on average 2.269230769230769) internal successors, (59), 26 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 48 [2023-12-02 08:26:19,794 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-12-02 08:26:19,801 INFO L225 Difference]: With dead ends: 1288 [2023-12-02 08:26:19,801 INFO L226 Difference]: Without dead ends: 1288 [2023-12-02 08:26:19,802 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 123 GetRequests, 79 SyntacticMatches, 0 SemanticMatches, 44 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 529 ImplicationChecksByTransitivity, 65.9s TimeCoverageRelationStatistics Valid=460, Invalid=1563, Unknown=47, NotChecked=0, Total=2070 [2023-12-02 08:26:19,803 INFO L413 NwaCegarLoop]: 28 mSDtfsCounter, 501 mSDsluCounter, 403 mSDsCounter, 0 mSdLazyCounter, 932 mSolverCounterSat, 19 mSolverCounterUnsat, 64 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 121.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 501 SdHoareTripleChecker+Valid, 431 SdHoareTripleChecker+Invalid, 1015 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 19 IncrementalHoareTripleChecker+Valid, 932 IncrementalHoareTripleChecker+Invalid, 64 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 121.8s IncrementalHoareTripleChecker+Time [2023-12-02 08:26:19,803 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [501 Valid, 431 Invalid, 1015 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [19 Valid, 932 Invalid, 64 Unknown, 0 Unchecked, 121.8s Time] [2023-12-02 08:26:19,805 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1288 states. [2023-12-02 08:26:19,820 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1288 to 990. [2023-12-02 08:26:19,822 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 990 states, 966 states have (on average 2.1459627329192545) internal successors, (2073), 989 states have internal predecessors, (2073), 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 08:26:19,824 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 990 states to 990 states and 2073 transitions. [2023-12-02 08:26:19,824 INFO L78 Accepts]: Start accepts. Automaton has 990 states and 2073 transitions. Word has length 48 [2023-12-02 08:26:19,825 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-12-02 08:26:19,825 INFO L495 AbstractCegarLoop]: Abstraction has 990 states and 2073 transitions. [2023-12-02 08:26:19,825 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 27 states, 26 states have (on average 2.269230769230769) internal successors, (59), 26 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 08:26:19,825 INFO L276 IsEmpty]: Start isEmpty. Operand 990 states and 2073 transitions. [2023-12-02 08:26:19,825 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 50 [2023-12-02 08:26:19,825 INFO L187 NwaCegarLoop]: Found error trace [2023-12-02 08:26:19,826 INFO L195 NwaCegarLoop]: trace histogram [10, 10, 10, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-12-02 08:26:19,830 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_72ec9ce2-d26b-43c5-a264-de0e9bf99c34/bin/utaipan-verify-nQ1chXbOIh/z3 -smt2 -in SMTLIB2_COMPLIANT=true (9)] Ended with exit code 0 [2023-12-02 08:26:20,028 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable21,9 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_72ec9ce2-d26b-43c5-a264-de0e9bf99c34/bin/utaipan-verify-nQ1chXbOIh/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-12-02 08:26:20,029 INFO L420 AbstractCegarLoop]: === Iteration 23 === Targeting ULTIMATE.startErr3ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 12 more)] === [2023-12-02 08:26:20,029 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-12-02 08:26:20,029 INFO L85 PathProgramCache]: Analyzing trace with hash 341160648, now seen corresponding path program 1 times [2023-12-02 08:26:20,029 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2023-12-02 08:26:20,029 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [651721005] [2023-12-02 08:26:20,029 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-02 08:26:20,030 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-12-02 08:26:20,050 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-02 08:26:20,479 INFO L134 CoverageAnalysis]: Checked inductivity of 150 backedges. 0 proven. 5 refuted. 0 times theorem prover too weak. 145 trivial. 0 not checked. [2023-12-02 08:26:20,479 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2023-12-02 08:26:20,479 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [651721005] [2023-12-02 08:26:20,479 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [651721005] provided 0 perfect and 1 imperfect interpolant sequences [2023-12-02 08:26:20,479 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [125392275] [2023-12-02 08:26:20,479 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-02 08:26:20,479 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-12-02 08:26:20,479 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_72ec9ce2-d26b-43c5-a264-de0e9bf99c34/bin/utaipan-verify-nQ1chXbOIh/z3 [2023-12-02 08:26:20,480 INFO L229 MonitoredProcess]: Starting monitored process 10 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_72ec9ce2-d26b-43c5-a264-de0e9bf99c34/bin/utaipan-verify-nQ1chXbOIh/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2023-12-02 08:26:20,481 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_72ec9ce2-d26b-43c5-a264-de0e9bf99c34/bin/utaipan-verify-nQ1chXbOIh/z3 -smt2 -in SMTLIB2_COMPLIANT=true (10)] Waiting until timeout for monitored process [2023-12-02 08:26:20,574 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-02 08:26:20,576 INFO L262 TraceCheckSpWp]: Trace formula consists of 226 conjuncts, 26 conjunts are in the unsatisfiable core [2023-12-02 08:26:20,579 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-12-02 08:26:20,584 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 7 treesize of output 6 [2023-12-02 08:26:20,734 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-12-02 08:26:20,734 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 10 [2023-12-02 08:26:20,822 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 22 treesize of output 17 [2023-12-02 08:26:26,240 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 21 treesize of output 15 [2023-12-02 08:26:26,286 INFO L134 CoverageAnalysis]: Checked inductivity of 150 backedges. 0 proven. 5 refuted. 0 times theorem prover too weak. 145 trivial. 0 not checked. [2023-12-02 08:26:26,286 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2023-12-02 08:26:32,690 WARN L854 $PredicateComparison]: unable to prove that (forall ((|v_ULTIMATE.start_main_~#t1~0#1.base_48| Int) (v_ArrVal_747 (Array Int Int)) (|v_ULTIMATE.start_cache_entry_addref_~entry#1.offset_43| Int) (|v_ULTIMATE.start_cache_entry_addref_~entry#1.offset_45| Int) (|ULTIMATE.start_cache_entry_addref_#t~post32#1| Int)) (or (< |v_ULTIMATE.start_main_~#t1~0#1.base_48| (+ |c_#StackHeapBarrier| 1)) (< |v_ULTIMATE.start_cache_entry_addref_~entry#1.offset_43| (+ 28 |v_ULTIMATE.start_cache_entry_addref_~entry#1.offset_45|)) (< (select (store (select (store |c_#memory_int| |v_ULTIMATE.start_main_~#t1~0#1.base_48| v_ArrVal_747) |c_~#cache~0.base|) |v_ULTIMATE.start_cache_entry_addref_~entry#1.offset_45| (+ |ULTIMATE.start_cache_entry_addref_#t~post32#1| 1)) |v_ULTIMATE.start_cache_entry_addref_~entry#1.offset_43|) 2147483647))) is different from false [2023-12-02 08:26:33,023 INFO L134 CoverageAnalysis]: Checked inductivity of 150 backedges. 0 proven. 5 refuted. 0 times theorem prover too weak. 145 trivial. 0 not checked. [2023-12-02 08:26:33,023 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [125392275] provided 0 perfect and 2 imperfect interpolant sequences [2023-12-02 08:26:33,023 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSifa [327196376] [2023-12-02 08:26:33,024 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 08:26:33,024 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2023-12-02 08:26:33,024 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [10, 8, 8] total 25 [2023-12-02 08:26:33,025 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1166174153] [2023-12-02 08:26:33,025 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2023-12-02 08:26:33,025 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 27 states [2023-12-02 08:26:33,025 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2023-12-02 08:26:33,026 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 27 interpolants. [2023-12-02 08:26:33,026 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=126, Invalid=521, Unknown=7, NotChecked=48, Total=702 [2023-12-02 08:26:33,026 INFO L87 Difference]: Start difference. First operand 990 states and 2073 transitions. Second operand has 27 states, 26 states have (on average 2.3846153846153846) internal successors, (62), 26 states have internal predecessors, (62), 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 08:26:35,117 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.02s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2023-12-02 08:26:37,065 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.93s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2023-12-02 08:26:38,931 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.82s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2023-12-02 08:26:40,779 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.80s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2023-12-02 08:26:42,638 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.83s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2023-12-02 08:26:44,444 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.76s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2023-12-02 08:26:46,214 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.75s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2023-12-02 08:26:48,587 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.01s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0, 1] [2023-12-02 08:26:52,717 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.01s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0, 1] [2023-12-02 08:26:56,806 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.01s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0, 1] [2023-12-02 08:26:58,821 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0, 1] [2023-12-02 08:27:00,840 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0, 1] [2023-12-02 08:27:02,851 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0, 1] [2023-12-02 08:27:04,919 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.01s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0, 1] [2023-12-02 08:27:06,940 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.01s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0, 1] [2023-12-02 08:27:08,948 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 [1] [2023-12-02 08:27:10,953 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 [1] [2023-12-02 08:27:12,959 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 [1] [2023-12-02 08:27:14,973 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0, 1] [2023-12-02 08:27:17,027 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0, 1] [2023-12-02 08:27:21,122 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.01s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0, 1] [2023-12-02 08:27:23,130 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 [1] [2023-12-02 08:27:25,134 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 [1] [2023-12-02 08:27:27,140 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 [1] [2023-12-02 08:27:29,166 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.02s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0, 1] [2023-12-02 08:27:31,207 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.01s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0, 1] [2023-12-02 08:27:33,227 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.01s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0, 1] [2023-12-02 08:27:35,244 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0, 1] [2023-12-02 08:27:37,253 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 [1] [2023-12-02 08:27:39,259 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 [1] [2023-12-02 08:27:41,266 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 [1] [2023-12-02 08:27:43,284 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.01s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0, 1] [2023-12-02 08:27:45,395 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0, 1] [2023-12-02 08:27:49,490 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0, 1] [2023-12-02 08:27:51,506 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0, 1] [2023-12-02 08:27:53,513 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 [1] [2023-12-02 08:27:55,516 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 [1] [2023-12-02 08:27:57,522 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 [1] [2023-12-02 08:27:59,535 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.01s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0, 1] [2023-12-02 08:28:01,563 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 [1] [2023-12-02 08:28:03,576 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 [1] [2023-12-02 08:28:05,593 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0, 1] [2023-12-02 08:28:07,598 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0, 1] [2023-12-02 08:28:09,603 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 [1] [2023-12-02 08:28:11,607 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 [1] [2023-12-02 08:28:13,611 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 [1] [2023-12-02 08:28:25,755 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 [1] [2023-12-02 08:28:27,768 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0, 1] [2023-12-02 08:28:29,834 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 [1] [2023-12-02 08:28:31,844 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.01s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0, 1] [2023-12-02 08:28:33,882 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 [1] [2023-12-02 08:28:41,970 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 [1] [2023-12-02 08:28:43,987 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 [1] [2023-12-02 08:28:46,008 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 [1] [2023-12-02 08:28:48,012 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 [1] [2023-12-02 08:28:50,016 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 [1] [2023-12-02 08:28:52,030 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 [1] [2023-12-02 08:28:54,045 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 [1] [2023-12-02 08:28:56,050 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 [1] [2023-12-02 08:28:58,076 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 [1] [2023-12-02 08:29:00,087 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 [1] [2023-12-02 08:29:02,126 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.03s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2023-12-02 08:29:04,150 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 [1] [2023-12-02 08:29:10,240 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 [1] [2023-12-02 08:29:12,267 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 [1] [2023-12-02 08:29:18,388 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 [1] [2023-12-02 08:29:20,405 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 [1] [2023-12-02 08:29:22,412 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 [1] [2023-12-02 08:29:24,428 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0, 1] [2023-12-02 08:29:26,472 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 [1] [2023-12-02 08:29:28,486 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 [1] [2023-12-02 08:29:30,512 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.03s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2023-12-02 08:29:37,008 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 [1] [2023-12-02 08:29:39,016 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 [1] [2023-12-02 08:29:41,206 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 [1] [2023-12-02 08:29:53,303 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 [1] [2023-12-02 08:30:13,467 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 [1] [2023-12-02 08:30:15,474 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0, 1] [2023-12-02 08:30:17,479 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 [1] [2023-12-02 08:30:19,488 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 [1] [2023-12-02 08:30:21,499 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.01s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2023-12-02 08:30:23,546 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 [1] [2023-12-02 08:30:25,550 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 [1] [2023-12-02 08:30:27,563 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.01s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0, 1] [2023-12-02 08:30:29,590 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 [1] [2023-12-02 08:30:31,602 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0, 1] [2023-12-02 08:30:33,610 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.01s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0, 1] [2023-12-02 08:30:35,694 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0, 1] [2023-12-02 08:30:35,964 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-12-02 08:30:35,964 INFO L93 Difference]: Finished difference Result 1418 states and 2955 transitions. [2023-12-02 08:30:35,965 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 30 states. [2023-12-02 08:30:35,965 INFO L78 Accepts]: Start accepts. Automaton has has 27 states, 26 states have (on average 2.3846153846153846) internal successors, (62), 26 states have internal predecessors, (62), 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 49 [2023-12-02 08:30:35,965 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-12-02 08:30:35,973 INFO L225 Difference]: With dead ends: 1418 [2023-12-02 08:30:35,973 INFO L226 Difference]: Without dead ends: 1418 [2023-12-02 08:30:35,974 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 126 GetRequests, 81 SyntacticMatches, 0 SemanticMatches, 45 ConstructedPredicates, 1 IntricatePredicates, 0 DeprecatedPredicates, 531 ImplicationChecksByTransitivity, 77.2s TimeCoverageRelationStatistics Valid=458, Invalid=1577, Unknown=39, NotChecked=88, Total=2162 [2023-12-02 08:30:35,975 INFO L413 NwaCegarLoop]: 27 mSDtfsCounter, 445 mSDsluCounter, 386 mSDsCounter, 0 mSdLazyCounter, 888 mSolverCounterSat, 17 mSolverCounterUnsat, 88 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 177.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 445 SdHoareTripleChecker+Valid, 413 SdHoareTripleChecker+Invalid, 1274 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 17 IncrementalHoareTripleChecker+Valid, 888 IncrementalHoareTripleChecker+Invalid, 88 IncrementalHoareTripleChecker+Unknown, 281 IncrementalHoareTripleChecker+Unchecked, 177.5s IncrementalHoareTripleChecker+Time [2023-12-02 08:30:35,975 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [445 Valid, 413 Invalid, 1274 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [17 Valid, 888 Invalid, 88 Unknown, 281 Unchecked, 177.5s Time] [2023-12-02 08:30:35,977 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1418 states. [2023-12-02 08:30:35,997 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1418 to 856. [2023-12-02 08:30:35,999 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 856 states, 832 states have (on average 2.105769230769231) internal successors, (1752), 855 states have internal predecessors, (1752), 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 08:30:36,002 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 856 states to 856 states and 1752 transitions. [2023-12-02 08:30:36,003 INFO L78 Accepts]: Start accepts. Automaton has 856 states and 1752 transitions. Word has length 49 [2023-12-02 08:30:36,003 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-12-02 08:30:36,003 INFO L495 AbstractCegarLoop]: Abstraction has 856 states and 1752 transitions. [2023-12-02 08:30:36,003 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 27 states, 26 states have (on average 2.3846153846153846) internal successors, (62), 26 states have internal predecessors, (62), 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 08:30:36,003 INFO L276 IsEmpty]: Start isEmpty. Operand 856 states and 1752 transitions. [2023-12-02 08:30:36,004 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 52 [2023-12-02 08:30:36,004 INFO L187 NwaCegarLoop]: Found error trace [2023-12-02 08:30:36,004 INFO L195 NwaCegarLoop]: trace histogram [10, 10, 10, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1] [2023-12-02 08:30:36,010 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_72ec9ce2-d26b-43c5-a264-de0e9bf99c34/bin/utaipan-verify-nQ1chXbOIh/z3 -smt2 -in SMTLIB2_COMPLIANT=true (10)] Ended with exit code 0 [2023-12-02 08:30:36,205 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable22,10 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_72ec9ce2-d26b-43c5-a264-de0e9bf99c34/bin/utaipan-verify-nQ1chXbOIh/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-12-02 08:30:36,206 INFO L420 AbstractCegarLoop]: === Iteration 24 === Targeting ULTIMATE.startErr4ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 12 more)] === [2023-12-02 08:30:36,206 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-12-02 08:30:36,206 INFO L85 PathProgramCache]: Analyzing trace with hash -1503058, now seen corresponding path program 1 times [2023-12-02 08:30:36,206 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2023-12-02 08:30:36,206 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [337956955] [2023-12-02 08:30:36,206 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-02 08:30:36,206 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-12-02 08:30:36,224 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-02 08:30:36,298 INFO L134 CoverageAnalysis]: Checked inductivity of 153 backedges. 0 proven. 8 refuted. 0 times theorem prover too weak. 145 trivial. 0 not checked. [2023-12-02 08:30:36,298 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2023-12-02 08:30:36,298 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [337956955] [2023-12-02 08:30:36,298 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [337956955] provided 0 perfect and 1 imperfect interpolant sequences [2023-12-02 08:30:36,298 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [649575963] [2023-12-02 08:30:36,299 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-02 08:30:36,299 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-12-02 08:30:36,299 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_72ec9ce2-d26b-43c5-a264-de0e9bf99c34/bin/utaipan-verify-nQ1chXbOIh/z3 [2023-12-02 08:30:36,300 INFO L229 MonitoredProcess]: Starting monitored process 11 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_72ec9ce2-d26b-43c5-a264-de0e9bf99c34/bin/utaipan-verify-nQ1chXbOIh/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2023-12-02 08:30:36,308 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_72ec9ce2-d26b-43c5-a264-de0e9bf99c34/bin/utaipan-verify-nQ1chXbOIh/z3 -smt2 -in SMTLIB2_COMPLIANT=true (11)] Waiting until timeout for monitored process [2023-12-02 08:30:36,438 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-02 08:30:36,440 INFO L262 TraceCheckSpWp]: Trace formula consists of 233 conjuncts, 5 conjunts are in the unsatisfiable core [2023-12-02 08:30:36,442 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-12-02 08:30:36,486 INFO L134 CoverageAnalysis]: Checked inductivity of 153 backedges. 8 proven. 0 refuted. 0 times theorem prover too weak. 145 trivial. 0 not checked. [2023-12-02 08:30:36,486 INFO L323 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2023-12-02 08:30:36,486 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [649575963] provided 1 perfect and 0 imperfect interpolant sequences [2023-12-02 08:30:36,486 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2023-12-02 08:30:36,487 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [5] total 7 [2023-12-02 08:30:36,487 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [296443198] [2023-12-02 08:30:36,487 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-12-02 08:30:36,487 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2023-12-02 08:30:36,487 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2023-12-02 08:30:36,488 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2023-12-02 08:30:36,488 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=39, Unknown=0, NotChecked=0, Total=56 [2023-12-02 08:30:36,488 INFO L87 Difference]: Start difference. First operand 856 states and 1752 transitions. Second operand has 6 states, 5 states have (on average 4.8) internal successors, (24), 6 states have internal predecessors, (24), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-12-02 08:30:36,641 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-12-02 08:30:36,641 INFO L93 Difference]: Finished difference Result 835 states and 1689 transitions. [2023-12-02 08:30:36,641 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2023-12-02 08:30:36,641 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 5 states have (on average 4.8) internal successors, (24), 6 states have internal predecessors, (24), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 51 [2023-12-02 08:30:36,642 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-12-02 08:30:36,647 INFO L225 Difference]: With dead ends: 835 [2023-12-02 08:30:36,647 INFO L226 Difference]: Without dead ends: 835 [2023-12-02 08:30:36,647 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 57 GetRequests, 49 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=28, Invalid=62, Unknown=0, NotChecked=0, Total=90 [2023-12-02 08:30:36,648 INFO L413 NwaCegarLoop]: 29 mSDtfsCounter, 71 mSDsluCounter, 71 mSDsCounter, 0 mSdLazyCounter, 228 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 71 SdHoareTripleChecker+Valid, 100 SdHoareTripleChecker+Invalid, 228 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 228 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2023-12-02 08:30:36,648 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [71 Valid, 100 Invalid, 228 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 228 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2023-12-02 08:30:36,650 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 835 states. [2023-12-02 08:30:36,664 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 835 to 827. [2023-12-02 08:30:36,666 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 827 states, 808 states have (on average 2.0903465346534653) internal successors, (1689), 826 states have internal predecessors, (1689), 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 08:30:36,669 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 827 states to 827 states and 1689 transitions. [2023-12-02 08:30:36,669 INFO L78 Accepts]: Start accepts. Automaton has 827 states and 1689 transitions. Word has length 51 [2023-12-02 08:30:36,670 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-12-02 08:30:36,670 INFO L495 AbstractCegarLoop]: Abstraction has 827 states and 1689 transitions. [2023-12-02 08:30:36,670 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 5 states have (on average 4.8) internal successors, (24), 6 states have internal predecessors, (24), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-12-02 08:30:36,670 INFO L276 IsEmpty]: Start isEmpty. Operand 827 states and 1689 transitions. [2023-12-02 08:30:36,671 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 52 [2023-12-02 08:30:36,671 INFO L187 NwaCegarLoop]: Found error trace [2023-12-02 08:30:36,671 INFO L195 NwaCegarLoop]: trace histogram [10, 10, 10, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1] [2023-12-02 08:30:36,676 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_72ec9ce2-d26b-43c5-a264-de0e9bf99c34/bin/utaipan-verify-nQ1chXbOIh/z3 -smt2 -in SMTLIB2_COMPLIANT=true (11)] Ended with exit code 0 [2023-12-02 08:30:36,871 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 11 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_72ec9ce2-d26b-43c5-a264-de0e9bf99c34/bin/utaipan-verify-nQ1chXbOIh/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable23 [2023-12-02 08:30:36,871 INFO L420 AbstractCegarLoop]: === Iteration 25 === Targeting t_funErr2ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 12 more)] === [2023-12-02 08:30:36,872 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-12-02 08:30:36,872 INFO L85 PathProgramCache]: Analyzing trace with hash 764365612, now seen corresponding path program 1 times [2023-12-02 08:30:36,872 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2023-12-02 08:30:36,872 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [147737170] [2023-12-02 08:30:36,872 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-02 08:30:36,872 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-12-02 08:30:36,886 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-02 08:30:36,938 INFO L134 CoverageAnalysis]: Checked inductivity of 153 backedges. 0 proven. 8 refuted. 0 times theorem prover too weak. 145 trivial. 0 not checked. [2023-12-02 08:30:36,938 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2023-12-02 08:30:36,938 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [147737170] [2023-12-02 08:30:36,938 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [147737170] provided 0 perfect and 1 imperfect interpolant sequences [2023-12-02 08:30:36,938 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [498134535] [2023-12-02 08:30:36,939 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-02 08:30:36,939 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-12-02 08:30:36,939 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_72ec9ce2-d26b-43c5-a264-de0e9bf99c34/bin/utaipan-verify-nQ1chXbOIh/z3 [2023-12-02 08:30:36,940 INFO L229 MonitoredProcess]: Starting monitored process 12 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_72ec9ce2-d26b-43c5-a264-de0e9bf99c34/bin/utaipan-verify-nQ1chXbOIh/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2023-12-02 08:30:36,942 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_72ec9ce2-d26b-43c5-a264-de0e9bf99c34/bin/utaipan-verify-nQ1chXbOIh/z3 -smt2 -in SMTLIB2_COMPLIANT=true (12)] Waiting until timeout for monitored process [2023-12-02 08:30:37,068 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-02 08:30:37,069 INFO L262 TraceCheckSpWp]: Trace formula consists of 237 conjuncts, 5 conjunts are in the unsatisfiable core [2023-12-02 08:30:37,070 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-12-02 08:30:37,108 INFO L134 CoverageAnalysis]: Checked inductivity of 153 backedges. 8 proven. 0 refuted. 0 times theorem prover too weak. 145 trivial. 0 not checked. [2023-12-02 08:30:37,108 INFO L323 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2023-12-02 08:30:37,108 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [498134535] provided 1 perfect and 0 imperfect interpolant sequences [2023-12-02 08:30:37,108 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2023-12-02 08:30:37,108 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [5] total 7 [2023-12-02 08:30:37,108 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1827845739] [2023-12-02 08:30:37,109 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-12-02 08:30:37,109 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2023-12-02 08:30:37,109 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2023-12-02 08:30:37,109 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2023-12-02 08:30:37,109 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=39, Unknown=0, NotChecked=0, Total=56 [2023-12-02 08:30:37,110 INFO L87 Difference]: Start difference. First operand 827 states and 1689 transitions. Second operand has 6 states, 5 states have (on average 4.8) internal successors, (24), 6 states have internal predecessors, (24), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-12-02 08:30:37,251 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-12-02 08:30:37,251 INFO L93 Difference]: Finished difference Result 805 states and 1628 transitions. [2023-12-02 08:30:37,252 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2023-12-02 08:30:37,252 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 5 states have (on average 4.8) internal successors, (24), 6 states have internal predecessors, (24), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 51 [2023-12-02 08:30:37,252 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-12-02 08:30:37,257 INFO L225 Difference]: With dead ends: 805 [2023-12-02 08:30:37,257 INFO L226 Difference]: Without dead ends: 805 [2023-12-02 08:30:37,257 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 57 GetRequests, 49 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=28, Invalid=62, Unknown=0, NotChecked=0, Total=90 [2023-12-02 08:30:37,258 INFO L413 NwaCegarLoop]: 30 mSDtfsCounter, 70 mSDsluCounter, 63 mSDsCounter, 0 mSdLazyCounter, 212 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 70 SdHoareTripleChecker+Valid, 93 SdHoareTripleChecker+Invalid, 212 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 212 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2023-12-02 08:30:37,258 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [70 Valid, 93 Invalid, 212 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 212 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2023-12-02 08:30:37,259 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 805 states. [2023-12-02 08:30:37,272 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 805 to 799. [2023-12-02 08:30:37,274 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 799 states, 784 states have (on average 2.076530612244898) internal successors, (1628), 798 states have internal predecessors, (1628), 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 08:30:37,276 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 799 states to 799 states and 1628 transitions. [2023-12-02 08:30:37,276 INFO L78 Accepts]: Start accepts. Automaton has 799 states and 1628 transitions. Word has length 51 [2023-12-02 08:30:37,277 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-12-02 08:30:37,277 INFO L495 AbstractCegarLoop]: Abstraction has 799 states and 1628 transitions. [2023-12-02 08:30:37,277 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 5 states have (on average 4.8) internal successors, (24), 6 states have internal predecessors, (24), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-12-02 08:30:37,277 INFO L276 IsEmpty]: Start isEmpty. Operand 799 states and 1628 transitions. [2023-12-02 08:30:37,278 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 53 [2023-12-02 08:30:37,278 INFO L187 NwaCegarLoop]: Found error trace [2023-12-02 08:30:37,278 INFO L195 NwaCegarLoop]: trace histogram [10, 10, 10, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1] [2023-12-02 08:30:37,284 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_72ec9ce2-d26b-43c5-a264-de0e9bf99c34/bin/utaipan-verify-nQ1chXbOIh/z3 -smt2 -in SMTLIB2_COMPLIANT=true (12)] Ended with exit code 0 [2023-12-02 08:30:37,484 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 12 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_72ec9ce2-d26b-43c5-a264-de0e9bf99c34/bin/utaipan-verify-nQ1chXbOIh/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable24 [2023-12-02 08:30:37,484 INFO L420 AbstractCegarLoop]: === Iteration 26 === Targeting ULTIMATE.startErr5ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 12 more)] === [2023-12-02 08:30:37,484 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-12-02 08:30:37,484 INFO L85 PathProgramCache]: Analyzing trace with hash -46594532, now seen corresponding path program 1 times [2023-12-02 08:30:37,484 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2023-12-02 08:30:37,485 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1451266209] [2023-12-02 08:30:37,485 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-02 08:30:37,485 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-12-02 08:30:37,497 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-02 08:30:37,528 INFO L134 CoverageAnalysis]: Checked inductivity of 154 backedges. 8 proven. 0 refuted. 0 times theorem prover too weak. 146 trivial. 0 not checked. [2023-12-02 08:30:37,528 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2023-12-02 08:30:37,528 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1451266209] [2023-12-02 08:30:37,529 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1451266209] provided 1 perfect and 0 imperfect interpolant sequences [2023-12-02 08:30:37,529 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-12-02 08:30:37,529 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2023-12-02 08:30:37,529 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1949335235] [2023-12-02 08:30:37,529 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-12-02 08:30:37,530 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2023-12-02 08:30:37,530 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2023-12-02 08:30:37,530 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2023-12-02 08:30:37,530 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2023-12-02 08:30:37,531 INFO L87 Difference]: Start difference. First operand 799 states and 1628 transitions. Second operand has 4 states, 3 states have (on average 8.333333333333334) internal successors, (25), 4 states have internal predecessors, (25), 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 08:30:37,615 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-12-02 08:30:37,615 INFO L93 Difference]: Finished difference Result 771 states and 1567 transitions. [2023-12-02 08:30:37,616 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2023-12-02 08:30:37,616 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 3 states have (on average 8.333333333333334) internal successors, (25), 4 states have internal predecessors, (25), 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 52 [2023-12-02 08:30:37,616 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-12-02 08:30:37,620 INFO L225 Difference]: With dead ends: 771 [2023-12-02 08:30:37,620 INFO L226 Difference]: Without dead ends: 771 [2023-12-02 08:30:37,621 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2023-12-02 08:30:37,621 INFO L413 NwaCegarLoop]: 17 mSDtfsCounter, 32 mSDsluCounter, 18 mSDsCounter, 0 mSdLazyCounter, 89 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 32 SdHoareTripleChecker+Valid, 35 SdHoareTripleChecker+Invalid, 90 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 89 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2023-12-02 08:30:37,621 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [32 Valid, 35 Invalid, 90 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 89 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2023-12-02 08:30:37,623 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 771 states. [2023-12-02 08:30:37,630 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 771 to 672. [2023-12-02 08:30:37,631 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 672 states, 661 states have (on average 2.0847201210287443) internal successors, (1378), 671 states have internal predecessors, (1378), 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 08:30:37,634 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 672 states to 672 states and 1378 transitions. [2023-12-02 08:30:37,635 INFO L78 Accepts]: Start accepts. Automaton has 672 states and 1378 transitions. Word has length 52 [2023-12-02 08:30:37,635 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-12-02 08:30:37,635 INFO L495 AbstractCegarLoop]: Abstraction has 672 states and 1378 transitions. [2023-12-02 08:30:37,635 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 3 states have (on average 8.333333333333334) internal successors, (25), 4 states have internal predecessors, (25), 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 08:30:37,635 INFO L276 IsEmpty]: Start isEmpty. Operand 672 states and 1378 transitions. [2023-12-02 08:30:37,635 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 53 [2023-12-02 08:30:37,636 INFO L187 NwaCegarLoop]: Found error trace [2023-12-02 08:30:37,636 INFO L195 NwaCegarLoop]: trace histogram [10, 10, 10, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1] [2023-12-02 08:30:37,636 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable25 [2023-12-02 08:30:37,636 INFO L420 AbstractCegarLoop]: === Iteration 27 === Targeting t_funErr3ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 12 more)] === [2023-12-02 08:30:37,636 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-12-02 08:30:37,636 INFO L85 PathProgramCache]: Analyzing trace with hash -2074469521, now seen corresponding path program 1 times [2023-12-02 08:30:37,636 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2023-12-02 08:30:37,636 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1520858367] [2023-12-02 08:30:37,637 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-02 08:30:37,637 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-12-02 08:30:37,650 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-02 08:30:37,677 INFO L134 CoverageAnalysis]: Checked inductivity of 154 backedges. 8 proven. 0 refuted. 0 times theorem prover too weak. 146 trivial. 0 not checked. [2023-12-02 08:30:37,678 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2023-12-02 08:30:37,678 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1520858367] [2023-12-02 08:30:37,678 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1520858367] provided 1 perfect and 0 imperfect interpolant sequences [2023-12-02 08:30:37,678 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-12-02 08:30:37,678 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2023-12-02 08:30:37,678 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1122198238] [2023-12-02 08:30:37,678 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-12-02 08:30:37,678 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2023-12-02 08:30:37,678 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2023-12-02 08:30:37,679 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2023-12-02 08:30:37,679 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2023-12-02 08:30:37,679 INFO L87 Difference]: Start difference. First operand 672 states and 1378 transitions. Second operand has 4 states, 3 states have (on average 8.333333333333334) internal successors, (25), 4 states have internal predecessors, (25), 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 08:30:37,778 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-12-02 08:30:37,778 INFO L93 Difference]: Finished difference Result 655 states and 1335 transitions. [2023-12-02 08:30:37,779 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2023-12-02 08:30:37,779 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 3 states have (on average 8.333333333333334) internal successors, (25), 4 states have internal predecessors, (25), 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 52 [2023-12-02 08:30:37,780 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-12-02 08:30:37,783 INFO L225 Difference]: With dead ends: 655 [2023-12-02 08:30:37,784 INFO L226 Difference]: Without dead ends: 655 [2023-12-02 08:30:37,784 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2023-12-02 08:30:37,784 INFO L413 NwaCegarLoop]: 14 mSDtfsCounter, 30 mSDsluCounter, 15 mSDsCounter, 0 mSdLazyCounter, 89 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 30 SdHoareTripleChecker+Valid, 29 SdHoareTripleChecker+Invalid, 90 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 89 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2023-12-02 08:30:37,785 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [30 Valid, 29 Invalid, 90 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 89 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2023-12-02 08:30:37,786 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 655 states. [2023-12-02 08:30:37,792 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 655 to 582. [2023-12-02 08:30:37,793 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 582 states, 574 states have (on average 2.0801393728222997) internal successors, (1194), 581 states have internal predecessors, (1194), 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 08:30:37,795 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 582 states to 582 states and 1194 transitions. [2023-12-02 08:30:37,796 INFO L78 Accepts]: Start accepts. Automaton has 582 states and 1194 transitions. Word has length 52 [2023-12-02 08:30:37,796 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-12-02 08:30:37,796 INFO L495 AbstractCegarLoop]: Abstraction has 582 states and 1194 transitions. [2023-12-02 08:30:37,796 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 3 states have (on average 8.333333333333334) internal successors, (25), 4 states have internal predecessors, (25), 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 08:30:37,796 INFO L276 IsEmpty]: Start isEmpty. Operand 582 states and 1194 transitions. [2023-12-02 08:30:37,797 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 54 [2023-12-02 08:30:37,797 INFO L187 NwaCegarLoop]: Found error trace [2023-12-02 08:30:37,797 INFO L195 NwaCegarLoop]: trace histogram [10, 10, 10, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-12-02 08:30:37,797 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable26 [2023-12-02 08:30:37,797 INFO L420 AbstractCegarLoop]: === Iteration 28 === Targeting t_funErr0ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 12 more)] === [2023-12-02 08:30:37,798 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-12-02 08:30:37,798 INFO L85 PathProgramCache]: Analyzing trace with hash -1423178446, now seen corresponding path program 1 times [2023-12-02 08:30:37,798 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2023-12-02 08:30:37,798 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [947750053] [2023-12-02 08:30:37,798 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-02 08:30:37,798 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-12-02 08:30:37,817 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-02 08:30:38,406 INFO L134 CoverageAnalysis]: Checked inductivity of 150 backedges. 0 proven. 5 refuted. 0 times theorem prover too weak. 145 trivial. 0 not checked. [2023-12-02 08:30:38,406 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2023-12-02 08:30:38,406 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [947750053] [2023-12-02 08:30:38,407 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [947750053] provided 0 perfect and 1 imperfect interpolant sequences [2023-12-02 08:30:38,407 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1401318374] [2023-12-02 08:30:38,407 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-02 08:30:38,407 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-12-02 08:30:38,407 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_72ec9ce2-d26b-43c5-a264-de0e9bf99c34/bin/utaipan-verify-nQ1chXbOIh/z3 [2023-12-02 08:30:38,408 INFO L229 MonitoredProcess]: Starting monitored process 13 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_72ec9ce2-d26b-43c5-a264-de0e9bf99c34/bin/utaipan-verify-nQ1chXbOIh/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2023-12-02 08:30:38,420 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_72ec9ce2-d26b-43c5-a264-de0e9bf99c34/bin/utaipan-verify-nQ1chXbOIh/z3 -smt2 -in SMTLIB2_COMPLIANT=true (13)] Waiting until timeout for monitored process [2023-12-02 08:30:38,563 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-02 08:30:38,565 INFO L262 TraceCheckSpWp]: Trace formula consists of 252 conjuncts, 40 conjunts are in the unsatisfiable core [2023-12-02 08:30:38,568 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-12-02 08:30:38,816 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 1 [2023-12-02 08:30:39,010 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-12-02 08:30:39,010 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 25 treesize of output 13 [2023-12-02 08:30:39,110 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 17 treesize of output 9 [2023-12-02 08:30:39,129 INFO L134 CoverageAnalysis]: Checked inductivity of 150 backedges. 0 proven. 5 refuted. 0 times theorem prover too weak. 145 trivial. 0 not checked. [2023-12-02 08:30:39,129 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2023-12-02 08:30:44,315 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-12-02 08:30:44,316 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 24 treesize of output 25 [2023-12-02 08:30:44,324 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-12-02 08:30:44,324 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 25 treesize of output 29 [2023-12-02 08:30:44,335 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 22 treesize of output 20 [2023-12-02 08:30:44,353 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-12-02 08:30:44,354 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 35 treesize of output 39 [2023-12-02 08:30:44,500 INFO L134 CoverageAnalysis]: Checked inductivity of 150 backedges. 0 proven. 5 refuted. 0 times theorem prover too weak. 145 trivial. 0 not checked. [2023-12-02 08:30:44,500 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1401318374] provided 0 perfect and 2 imperfect interpolant sequences [2023-12-02 08:30:44,500 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSifa [1786034952] [2023-12-02 08:30:44,501 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 08:30:44,501 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2023-12-02 08:30:44,501 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [11, 12, 12] total 34 [2023-12-02 08:30:44,501 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1793564171] [2023-12-02 08:30:44,502 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2023-12-02 08:30:44,502 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 35 states [2023-12-02 08:30:44,502 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2023-12-02 08:30:44,503 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 35 interpolants. [2023-12-02 08:30:44,503 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=146, Invalid=1042, Unknown=2, NotChecked=0, Total=1190 [2023-12-02 08:30:44,503 INFO L87 Difference]: Start difference. First operand 582 states and 1194 transitions. Second operand has 35 states, 34 states have (on average 2.264705882352941) internal successors, (77), 35 states have internal predecessors, (77), 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 08:30:57,600 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-12-02 08:30:57,600 INFO L93 Difference]: Finished difference Result 1537 states and 3088 transitions. [2023-12-02 08:30:57,600 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 174 states. [2023-12-02 08:30:57,601 INFO L78 Accepts]: Start accepts. Automaton has has 35 states, 34 states have (on average 2.264705882352941) internal successors, (77), 35 states have internal predecessors, (77), 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 53 [2023-12-02 08:30:57,601 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-12-02 08:30:57,607 INFO L225 Difference]: With dead ends: 1537 [2023-12-02 08:30:57,607 INFO L226 Difference]: Without dead ends: 1537 [2023-12-02 08:30:57,618 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 285 GetRequests, 82 SyntacticMatches, 2 SemanticMatches, 201 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 15936 ImplicationChecksByTransitivity, 15.1s TimeCoverageRelationStatistics Valid=5083, Invalid=35921, Unknown=2, NotChecked=0, Total=41006 [2023-12-02 08:30:57,619 INFO L413 NwaCegarLoop]: 19 mSDtfsCounter, 2080 mSDsluCounter, 301 mSDsCounter, 0 mSdLazyCounter, 2762 mSolverCounterSat, 216 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 3.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 2080 SdHoareTripleChecker+Valid, 320 SdHoareTripleChecker+Invalid, 2978 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 216 IncrementalHoareTripleChecker+Valid, 2762 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 3.5s IncrementalHoareTripleChecker+Time [2023-12-02 08:30:57,619 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [2080 Valid, 320 Invalid, 2978 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [216 Valid, 2762 Invalid, 0 Unknown, 0 Unchecked, 3.5s Time] [2023-12-02 08:30:57,621 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1537 states. [2023-12-02 08:30:57,631 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1537 to 781. [2023-12-02 08:30:57,632 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 781 states, 773 states have (on average 2.0763260025873223) internal successors, (1605), 780 states have internal predecessors, (1605), 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 08:30:57,633 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 781 states to 781 states and 1605 transitions. [2023-12-02 08:30:57,634 INFO L78 Accepts]: Start accepts. Automaton has 781 states and 1605 transitions. Word has length 53 [2023-12-02 08:30:57,634 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-12-02 08:30:57,634 INFO L495 AbstractCegarLoop]: Abstraction has 781 states and 1605 transitions. [2023-12-02 08:30:57,634 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 35 states, 34 states have (on average 2.264705882352941) internal successors, (77), 35 states have internal predecessors, (77), 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 08:30:57,634 INFO L276 IsEmpty]: Start isEmpty. Operand 781 states and 1605 transitions. [2023-12-02 08:30:57,635 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 54 [2023-12-02 08:30:57,635 INFO L187 NwaCegarLoop]: Found error trace [2023-12-02 08:30:57,635 INFO L195 NwaCegarLoop]: trace histogram [10, 10, 10, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-12-02 08:30:57,640 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_72ec9ce2-d26b-43c5-a264-de0e9bf99c34/bin/utaipan-verify-nQ1chXbOIh/z3 -smt2 -in SMTLIB2_COMPLIANT=true (13)] Forceful destruction successful, exit code 0 [2023-12-02 08:30:57,835 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 13 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_72ec9ce2-d26b-43c5-a264-de0e9bf99c34/bin/utaipan-verify-nQ1chXbOIh/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable27 [2023-12-02 08:30:57,836 INFO L420 AbstractCegarLoop]: === Iteration 29 === Targeting ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 12 more)] === [2023-12-02 08:30:57,836 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-12-02 08:30:57,836 INFO L85 PathProgramCache]: Analyzing trace with hash 2014046515, now seen corresponding path program 1 times [2023-12-02 08:30:57,836 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2023-12-02 08:30:57,836 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [971751511] [2023-12-02 08:30:57,836 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-02 08:30:57,837 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-12-02 08:30:57,857 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-02 08:30:58,486 INFO L134 CoverageAnalysis]: Checked inductivity of 149 backedges. 0 proven. 4 refuted. 0 times theorem prover too weak. 145 trivial. 0 not checked. [2023-12-02 08:30:58,486 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2023-12-02 08:30:58,486 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [971751511] [2023-12-02 08:30:58,486 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [971751511] provided 0 perfect and 1 imperfect interpolant sequences [2023-12-02 08:30:58,487 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [720485435] [2023-12-02 08:30:58,487 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-02 08:30:58,487 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-12-02 08:30:58,487 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_72ec9ce2-d26b-43c5-a264-de0e9bf99c34/bin/utaipan-verify-nQ1chXbOIh/z3 [2023-12-02 08:30:58,488 INFO L229 MonitoredProcess]: Starting monitored process 14 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_72ec9ce2-d26b-43c5-a264-de0e9bf99c34/bin/utaipan-verify-nQ1chXbOIh/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2023-12-02 08:30:58,492 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_72ec9ce2-d26b-43c5-a264-de0e9bf99c34/bin/utaipan-verify-nQ1chXbOIh/z3 -smt2 -in SMTLIB2_COMPLIANT=true (14)] Waiting until timeout for monitored process [2023-12-02 08:30:58,639 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-02 08:30:58,641 INFO L262 TraceCheckSpWp]: Trace formula consists of 252 conjuncts, 44 conjunts are in the unsatisfiable core [2023-12-02 08:30:58,644 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-12-02 08:30:58,650 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 7 treesize of output 6 [2023-12-02 08:30:58,937 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-12-02 08:30:58,938 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 10 [2023-12-02 08:30:59,047 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 22 treesize of output 17 [2023-12-02 08:30:59,328 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 29 treesize of output 22 [2023-12-02 08:30:59,362 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 21 treesize of output 15 [2023-12-02 08:30:59,412 INFO L134 CoverageAnalysis]: Checked inductivity of 149 backedges. 0 proven. 4 refuted. 0 times theorem prover too weak. 145 trivial. 0 not checked. [2023-12-02 08:30:59,412 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2023-12-02 08:31:00,553 INFO L134 CoverageAnalysis]: Checked inductivity of 149 backedges. 1 proven. 3 refuted. 0 times theorem prover too weak. 145 trivial. 0 not checked. [2023-12-02 08:31:00,553 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [720485435] provided 0 perfect and 2 imperfect interpolant sequences [2023-12-02 08:31:00,553 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSifa [2142192807] [2023-12-02 08:31:00,554 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 08:31:00,555 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2023-12-02 08:31:00,555 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [13, 12, 11] total 36 [2023-12-02 08:31:00,556 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1281287955] [2023-12-02 08:31:00,556 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2023-12-02 08:31:00,556 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 38 states [2023-12-02 08:31:00,556 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2023-12-02 08:31:00,557 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 38 interpolants. [2023-12-02 08:31:00,557 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=188, Invalid=1212, Unknown=6, NotChecked=0, Total=1406 [2023-12-02 08:31:00,558 INFO L87 Difference]: Start difference. First operand 781 states and 1605 transitions. Second operand has 38 states, 37 states have (on average 2.108108108108108) internal successors, (78), 37 states have internal predecessors, (78), 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 08:31:05,988 WARN L854 $PredicateComparison]: unable to prove that (let ((.cse0 ((as const (Array Int Int)) 0))) (and (= |c_ULTIMATE.start_cache_entry_addref_~entry#1.base| 1) (exists ((v_DerPreprocessor_5 Int) (|ULTIMATE.start_cache_entry_addref_~entry#1.offset| Int)) (and (<= 28 |ULTIMATE.start_cache_entry_addref_~entry#1.offset|) (<= (select (store .cse0 0 v_DerPreprocessor_5) |ULTIMATE.start_cache_entry_addref_~entry#1.offset|) |c_ULTIMATE.start_cache_entry_addref_#t~post32#1|))) (<= 1 |c_ULTIMATE.start_main_~i~2#1|) (= |c_~#cache~0.base| 1) (let ((.cse1 (select |c_#memory_int| 1))) (= (store .cse0 0 (select .cse1 0)) .cse1)) (forall ((|v_ULTIMATE.start_main_~#t1~0#1.base_49| Int) (|v_ULTIMATE.start_cache_entry_addref_~entry#1.offset_49| Int) (v_ArrVal_1125 Int) (v_ArrVal_1122 (Array Int Int))) (or (< 0 (+ 2147483650 (select (store (select (store |c_#memory_int| |v_ULTIMATE.start_main_~#t1~0#1.base_49| v_ArrVal_1122) |c_~#cache~0.base|) |c_~#cache~0.offset| v_ArrVal_1125) |v_ULTIMATE.start_cache_entry_addref_~entry#1.offset_49|))) (< |v_ULTIMATE.start_main_~#t1~0#1.base_49| (+ |c_#StackHeapBarrier| 1)) (< |v_ULTIMATE.start_cache_entry_addref_~entry#1.offset_49| (+ 28 |c_~#cache~0.offset|)))) (= |c_~#cache~0.offset| 0) (forall ((|v_ULTIMATE.start_cache_entry_addref_~entry#1.offset_49| Int) (v_ArrVal_1125 Int) (|ULTIMATE.start_cache_entry_addref_#t~post32#1| Int)) (or (< |v_ULTIMATE.start_cache_entry_addref_~entry#1.offset_49| (+ (* |c_ULTIMATE.start_main_~i~2#1| 28) 28 |c_~#cache~0.offset|)) (< 0 (+ 2147483650 (select (store (select (store |c_#memory_int| |c_ULTIMATE.start_cache_entry_addref_~entry#1.base| (store (select |c_#memory_int| |c_ULTIMATE.start_cache_entry_addref_~entry#1.base|) |c_ULTIMATE.start_cache_entry_addref_~entry#1.offset| (+ |ULTIMATE.start_cache_entry_addref_#t~post32#1| 1))) |c_~#cache~0.base|) |c_~#cache~0.offset| v_ArrVal_1125) |v_ULTIMATE.start_cache_entry_addref_~entry#1.offset_49|))))) (= |c_t_funThread1of1ForFork0_~i~0#1| 0) (<= 28 |c_ULTIMATE.start_cache_entry_addref_~entry#1.offset|))) is different from false [2023-12-02 08:31:26,495 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 [1] [2023-12-02 08:31:33,717 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-12-02 08:31:33,717 INFO L93 Difference]: Finished difference Result 2385 states and 4892 transitions. [2023-12-02 08:31:33,718 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 98 states. [2023-12-02 08:31:33,718 INFO L78 Accepts]: Start accepts. Automaton has has 38 states, 37 states have (on average 2.108108108108108) internal successors, (78), 37 states have internal predecessors, (78), 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 53 [2023-12-02 08:31:33,718 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-12-02 08:31:33,724 INFO L225 Difference]: With dead ends: 2385 [2023-12-02 08:31:33,724 INFO L226 Difference]: Without dead ends: 2385 [2023-12-02 08:31:33,727 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 203 GetRequests, 81 SyntacticMatches, 1 SemanticMatches, 121 ConstructedPredicates, 1 IntricatePredicates, 0 DeprecatedPredicates, 5093 ImplicationChecksByTransitivity, 19.9s TimeCoverageRelationStatistics Valid=1890, Invalid=12771, Unknown=105, NotChecked=240, Total=15006 [2023-12-02 08:31:33,727 INFO L413 NwaCegarLoop]: 43 mSDtfsCounter, 1171 mSDsluCounter, 955 mSDsCounter, 0 mSdLazyCounter, 3492 mSolverCounterSat, 90 mSolverCounterUnsat, 274 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 13.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1171 SdHoareTripleChecker+Valid, 998 SdHoareTripleChecker+Invalid, 4072 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 90 IncrementalHoareTripleChecker+Valid, 3492 IncrementalHoareTripleChecker+Invalid, 274 IncrementalHoareTripleChecker+Unknown, 216 IncrementalHoareTripleChecker+Unchecked, 14.1s IncrementalHoareTripleChecker+Time [2023-12-02 08:31:33,728 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [1171 Valid, 998 Invalid, 4072 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [90 Valid, 3492 Invalid, 274 Unknown, 216 Unchecked, 14.1s Time] [2023-12-02 08:31:33,730 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2385 states. [2023-12-02 08:31:33,747 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2385 to 1114. [2023-12-02 08:31:33,748 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1114 states, 1106 states have (on average 2.1048824593128392) internal successors, (2328), 1113 states have internal predecessors, (2328), 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 08:31:33,750 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1114 states to 1114 states and 2328 transitions. [2023-12-02 08:31:33,751 INFO L78 Accepts]: Start accepts. Automaton has 1114 states and 2328 transitions. Word has length 53 [2023-12-02 08:31:33,751 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-12-02 08:31:33,751 INFO L495 AbstractCegarLoop]: Abstraction has 1114 states and 2328 transitions. [2023-12-02 08:31:33,751 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 38 states, 37 states have (on average 2.108108108108108) internal successors, (78), 37 states have internal predecessors, (78), 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 08:31:33,751 INFO L276 IsEmpty]: Start isEmpty. Operand 1114 states and 2328 transitions. [2023-12-02 08:31:33,752 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 54 [2023-12-02 08:31:33,752 INFO L187 NwaCegarLoop]: Found error trace [2023-12-02 08:31:33,752 INFO L195 NwaCegarLoop]: trace histogram [10, 10, 10, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-12-02 08:31:33,758 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_72ec9ce2-d26b-43c5-a264-de0e9bf99c34/bin/utaipan-verify-nQ1chXbOIh/z3 -smt2 -in SMTLIB2_COMPLIANT=true (14)] Ended with exit code 0 [2023-12-02 08:31:33,952 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 14 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_72ec9ce2-d26b-43c5-a264-de0e9bf99c34/bin/utaipan-verify-nQ1chXbOIh/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable28 [2023-12-02 08:31:33,953 INFO L420 AbstractCegarLoop]: === Iteration 30 === Targeting ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 12 more)] === [2023-12-02 08:31:33,953 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-12-02 08:31:33,953 INFO L85 PathProgramCache]: Analyzing trace with hash 1454483601, now seen corresponding path program 2 times [2023-12-02 08:31:33,953 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2023-12-02 08:31:33,953 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1923538101] [2023-12-02 08:31:33,953 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-02 08:31:33,954 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-12-02 08:31:33,974 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-02 08:31:34,570 INFO L134 CoverageAnalysis]: Checked inductivity of 149 backedges. 0 proven. 4 refuted. 0 times theorem prover too weak. 145 trivial. 0 not checked. [2023-12-02 08:31:34,570 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2023-12-02 08:31:34,571 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1923538101] [2023-12-02 08:31:34,571 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1923538101] provided 0 perfect and 1 imperfect interpolant sequences [2023-12-02 08:31:34,571 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1147870182] [2023-12-02 08:31:34,571 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2023-12-02 08:31:34,571 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-12-02 08:31:34,571 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_72ec9ce2-d26b-43c5-a264-de0e9bf99c34/bin/utaipan-verify-nQ1chXbOIh/z3 [2023-12-02 08:31:34,572 INFO L229 MonitoredProcess]: Starting monitored process 15 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_72ec9ce2-d26b-43c5-a264-de0e9bf99c34/bin/utaipan-verify-nQ1chXbOIh/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2023-12-02 08:31:34,574 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_72ec9ce2-d26b-43c5-a264-de0e9bf99c34/bin/utaipan-verify-nQ1chXbOIh/z3 -smt2 -in SMTLIB2_COMPLIANT=true (15)] Waiting until timeout for monitored process [2023-12-02 08:31:34,682 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 2 check-sat command(s) [2023-12-02 08:31:34,682 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2023-12-02 08:31:34,683 INFO L262 TraceCheckSpWp]: Trace formula consists of 153 conjuncts, 44 conjunts are in the unsatisfiable core [2023-12-02 08:31:34,685 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-12-02 08:31:34,692 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 7 treesize of output 6 [2023-12-02 08:31:34,931 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-12-02 08:31:34,931 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 10 [2023-12-02 08:31:35,056 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 22 treesize of output 17 [2023-12-02 08:31:35,321 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 29 treesize of output 22 [2023-12-02 08:31:35,356 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 21 treesize of output 15 [2023-12-02 08:31:35,404 INFO L134 CoverageAnalysis]: Checked inductivity of 149 backedges. 0 proven. 4 refuted. 0 times theorem prover too weak. 145 trivial. 0 not checked. [2023-12-02 08:31:35,404 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2023-12-02 08:31:36,493 INFO L134 CoverageAnalysis]: Checked inductivity of 149 backedges. 0 proven. 4 refuted. 0 times theorem prover too weak. 145 trivial. 0 not checked. [2023-12-02 08:31:36,493 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1147870182] provided 0 perfect and 2 imperfect interpolant sequences [2023-12-02 08:31:36,493 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSifa [1574564610] [2023-12-02 08:31:36,494 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 08:31:36,494 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2023-12-02 08:31:36,494 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [13, 12, 11] total 36 [2023-12-02 08:31:36,494 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1598257871] [2023-12-02 08:31:36,495 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2023-12-02 08:31:36,495 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 38 states [2023-12-02 08:31:36,495 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2023-12-02 08:31:36,495 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 38 interpolants. [2023-12-02 08:31:36,496 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=182, Invalid=1222, Unknown=2, NotChecked=0, Total=1406 [2023-12-02 08:31:36,496 INFO L87 Difference]: Start difference. First operand 1114 states and 2328 transitions. Second operand has 38 states, 37 states have (on average 2.108108108108108) internal successors, (78), 37 states have internal predecessors, (78), 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 08:31:38,070 WARN L854 $PredicateComparison]: unable to prove that (let ((.cse0 (+ 28 |c_~#cache~0.offset|))) (and (forall ((v_ArrVal_1201 (Array Int Int)) (v_ArrVal_1203 Int) (|v_ULTIMATE.start_cache_entry_addref_~entry#1.offset_52| Int) (|v_ULTIMATE.start_main_~#t1~0#1.base_50| Int)) (or (< |v_ULTIMATE.start_main_~#t1~0#1.base_50| (+ |c_#StackHeapBarrier| 1)) (< |v_ULTIMATE.start_cache_entry_addref_~entry#1.offset_52| .cse0) (< 0 (+ 2147483650 (select (store (select (store |c_#memory_int| |v_ULTIMATE.start_main_~#t1~0#1.base_50| v_ArrVal_1201) |c_~#cache~0.base|) |c_~#cache~0.offset| v_ArrVal_1203) |v_ULTIMATE.start_cache_entry_addref_~entry#1.offset_52|))))) (forall ((|v_ULTIMATE.start_cache_entry_addref_~entry#1.offset_52| Int) (v_ArrVal_1203 Int)) (or (< 0 (+ 2147483650 (select (store (select |c_#memory_int| |c_~#cache~0.base|) |c_~#cache~0.offset| v_ArrVal_1203) |v_ULTIMATE.start_cache_entry_addref_~entry#1.offset_52|))) (< |v_ULTIMATE.start_cache_entry_addref_~entry#1.offset_52| .cse0))) (forall ((v_ArrVal_1203 Int) (|v_ULTIMATE.start_cache_entry_addref_~entry#1.offset_52| Int) (|ULTIMATE.start_cache_entry_addref_#t~post32#1| Int)) (or (< |v_ULTIMATE.start_cache_entry_addref_~entry#1.offset_52| (+ (* |c_ULTIMATE.start_main_~i~2#1| 28) 28 |c_~#cache~0.offset|)) (< 0 (+ 2147483650 (select (store (select (store |c_#memory_int| |c_ULTIMATE.start_cache_entry_addref_~entry#1.base| (store (select |c_#memory_int| |c_ULTIMATE.start_cache_entry_addref_~entry#1.base|) |c_ULTIMATE.start_cache_entry_addref_~entry#1.offset| (+ |ULTIMATE.start_cache_entry_addref_#t~post32#1| 1))) |c_~#cache~0.base|) |c_~#cache~0.offset| v_ArrVal_1203) |v_ULTIMATE.start_cache_entry_addref_~entry#1.offset_52|))))))) is different from false [2023-12-02 08:31:43,609 WARN L854 $PredicateComparison]: unable to prove that (let ((.cse1 (select |c_#memory_int| |c_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.base|)) (.cse0 ((as const (Array Int Int)) 0))) (let ((.cse2 (@diff .cse1 .cse0)) (.cse3 (* |c_ULTIMATE.start_main_~i~2#1| 28))) (and (= .cse0 (store .cse1 .cse2 0)) (= |c_ULTIMATE.start_cache_entry_addref_~entry#1.base| 1) (forall ((v_ArrVal_1201 (Array Int Int)) (v_ArrVal_1203 Int) (|v_ULTIMATE.start_cache_entry_addref_~entry#1.offset_52| Int) (|v_ULTIMATE.start_main_~#t1~0#1.base_50| Int)) (or (< |v_ULTIMATE.start_main_~#t1~0#1.base_50| (+ |c_#StackHeapBarrier| 1)) (< |v_ULTIMATE.start_cache_entry_addref_~entry#1.offset_52| (+ 28 |c_~#cache~0.offset|)) (< 0 (+ 2147483650 (select (store (select (store |c_#memory_int| |v_ULTIMATE.start_main_~#t1~0#1.base_50| v_ArrVal_1201) |c_~#cache~0.base|) |c_~#cache~0.offset| v_ArrVal_1203) |v_ULTIMATE.start_cache_entry_addref_~entry#1.offset_52|))))) (<= 1 |c_ULTIMATE.start_main_~i~2#1|) (= |c_~#cache~0.base| |c_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.base|) (= |c_~#cache~0.base| 1) (or (< (+ .cse2 27) (+ .cse3 |c_~#cache~0.offset|)) (= .cse0 .cse1)) (let ((.cse4 (select |c_#memory_int| 1))) (= (store .cse0 0 (select .cse4 0)) .cse4)) (forall ((v_ArrVal_1203 Int) (|v_ULTIMATE.start_cache_entry_addref_~entry#1.offset_52| Int) (|ULTIMATE.start_cache_entry_addref_#t~post32#1| Int)) (or (< |v_ULTIMATE.start_cache_entry_addref_~entry#1.offset_52| (+ .cse3 28 |c_~#cache~0.offset|)) (< 0 (+ 2147483650 (select (store (select (store |c_#memory_int| |c_ULTIMATE.start_cache_entry_addref_~entry#1.base| (store (select |c_#memory_int| |c_ULTIMATE.start_cache_entry_addref_~entry#1.base|) |c_ULTIMATE.start_cache_entry_addref_~entry#1.offset| (+ |ULTIMATE.start_cache_entry_addref_#t~post32#1| 1))) |c_~#cache~0.base|) |c_~#cache~0.offset| v_ArrVal_1203) |v_ULTIMATE.start_cache_entry_addref_~entry#1.offset_52|))))) (= |c_~#cache~0.offset| 0) (<= 28 |c_ULTIMATE.start_cache_entry_addref_~entry#1.offset|)))) is different from false [2023-12-02 08:31:44,016 WARN L854 $PredicateComparison]: unable to prove that (let ((.cse0 ((as const (Array Int Int)) 0))) (and (= |c_ULTIMATE.start_cache_entry_addref_~entry#1.base| 1) (forall ((v_ArrVal_1201 (Array Int Int)) (v_ArrVal_1203 Int) (|v_ULTIMATE.start_cache_entry_addref_~entry#1.offset_52| Int) (|v_ULTIMATE.start_main_~#t1~0#1.base_50| Int)) (or (< |v_ULTIMATE.start_main_~#t1~0#1.base_50| (+ |c_#StackHeapBarrier| 1)) (< |v_ULTIMATE.start_cache_entry_addref_~entry#1.offset_52| (+ 28 |c_~#cache~0.offset|)) (< 0 (+ 2147483650 (select (store (select (store |c_#memory_int| |v_ULTIMATE.start_main_~#t1~0#1.base_50| v_ArrVal_1201) |c_~#cache~0.base|) |c_~#cache~0.offset| v_ArrVal_1203) |v_ULTIMATE.start_cache_entry_addref_~entry#1.offset_52|))))) (<= 1 |c_ULTIMATE.start_main_~i~2#1|) (= |c_~#cache~0.base| 1) (let ((.cse1 (select |c_#memory_int| 1))) (= (store .cse0 0 (select .cse1 0)) .cse1)) (exists ((v_DerPreprocessor_7 Int) (|ULTIMATE.start_cache_entry_addref_~entry#1.offset| Int)) (and (<= (select (store .cse0 0 v_DerPreprocessor_7) |ULTIMATE.start_cache_entry_addref_~entry#1.offset|) |c_ULTIMATE.start_cache_entry_addref_#t~post32#1|) (<= 28 |ULTIMATE.start_cache_entry_addref_~entry#1.offset|))) (forall ((v_ArrVal_1203 Int) (|v_ULTIMATE.start_cache_entry_addref_~entry#1.offset_52| Int) (|ULTIMATE.start_cache_entry_addref_#t~post32#1| Int)) (or (< |v_ULTIMATE.start_cache_entry_addref_~entry#1.offset_52| (+ (* |c_ULTIMATE.start_main_~i~2#1| 28) 28 |c_~#cache~0.offset|)) (< 0 (+ 2147483650 (select (store (select (store |c_#memory_int| |c_ULTIMATE.start_cache_entry_addref_~entry#1.base| (store (select |c_#memory_int| |c_ULTIMATE.start_cache_entry_addref_~entry#1.base|) |c_ULTIMATE.start_cache_entry_addref_~entry#1.offset| (+ |ULTIMATE.start_cache_entry_addref_#t~post32#1| 1))) |c_~#cache~0.base|) |c_~#cache~0.offset| v_ArrVal_1203) |v_ULTIMATE.start_cache_entry_addref_~entry#1.offset_52|))))) (= |c_~#cache~0.offset| 0) (= |c_t_funThread1of1ForFork0_~i~0#1| 0) (<= 28 |c_ULTIMATE.start_cache_entry_addref_~entry#1.offset|))) is different from false [2023-12-02 08:31:46,364 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 [1] [2023-12-02 08:32:26,281 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.95s for a HTC check with result INVALID. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0, 1] [2023-12-02 08:32:26,335 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-12-02 08:32:26,335 INFO L93 Difference]: Finished difference Result 4010 states and 8339 transitions. [2023-12-02 08:32:26,336 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 152 states. [2023-12-02 08:32:26,336 INFO L78 Accepts]: Start accepts. Automaton has has 38 states, 37 states have (on average 2.108108108108108) internal successors, (78), 37 states have internal predecessors, (78), 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 53 [2023-12-02 08:32:26,336 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-12-02 08:32:26,344 INFO L225 Difference]: With dead ends: 4010 [2023-12-02 08:32:26,344 INFO L226 Difference]: Without dead ends: 4010 [2023-12-02 08:32:26,346 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 256 GetRequests, 83 SyntacticMatches, 1 SemanticMatches, 172 ConstructedPredicates, 3 IntricatePredicates, 0 DeprecatedPredicates, 10951 ImplicationChecksByTransitivity, 30.0s TimeCoverageRelationStatistics Valid=3315, Invalid=25607, Unknown=160, NotChecked=1020, Total=30102 [2023-12-02 08:32:26,346 INFO L413 NwaCegarLoop]: 62 mSDtfsCounter, 1267 mSDsluCounter, 972 mSDsCounter, 0 mSdLazyCounter, 4275 mSolverCounterSat, 126 mSolverCounterUnsat, 323 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 19.9s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1267 SdHoareTripleChecker+Valid, 1034 SdHoareTripleChecker+Invalid, 5520 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 126 IncrementalHoareTripleChecker+Valid, 4275 IncrementalHoareTripleChecker+Invalid, 323 IncrementalHoareTripleChecker+Unknown, 796 IncrementalHoareTripleChecker+Unchecked, 20.7s IncrementalHoareTripleChecker+Time [2023-12-02 08:32:26,346 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [1267 Valid, 1034 Invalid, 5520 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [126 Valid, 4275 Invalid, 323 Unknown, 796 Unchecked, 20.7s Time] [2023-12-02 08:32:26,352 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 4010 states. [2023-12-02 08:32:26,376 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 4010 to 1441. [2023-12-02 08:32:26,377 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1441 states, 1433 states have (on average 2.145847871598046) internal successors, (3075), 1440 states have internal predecessors, (3075), 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 08:32:26,380 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1441 states to 1441 states and 3075 transitions. [2023-12-02 08:32:26,380 INFO L78 Accepts]: Start accepts. Automaton has 1441 states and 3075 transitions. Word has length 53 [2023-12-02 08:32:26,380 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-12-02 08:32:26,380 INFO L495 AbstractCegarLoop]: Abstraction has 1441 states and 3075 transitions. [2023-12-02 08:32:26,381 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 38 states, 37 states have (on average 2.108108108108108) internal successors, (78), 37 states have internal predecessors, (78), 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 08:32:26,381 INFO L276 IsEmpty]: Start isEmpty. Operand 1441 states and 3075 transitions. [2023-12-02 08:32:26,382 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 54 [2023-12-02 08:32:26,382 INFO L187 NwaCegarLoop]: Found error trace [2023-12-02 08:32:26,382 INFO L195 NwaCegarLoop]: trace histogram [10, 10, 10, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-12-02 08:32:26,387 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_72ec9ce2-d26b-43c5-a264-de0e9bf99c34/bin/utaipan-verify-nQ1chXbOIh/z3 -smt2 -in SMTLIB2_COMPLIANT=true (15)] Ended with exit code 0 [2023-12-02 08:32:26,583 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable29,15 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_72ec9ce2-d26b-43c5-a264-de0e9bf99c34/bin/utaipan-verify-nQ1chXbOIh/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-12-02 08:32:26,583 INFO L420 AbstractCegarLoop]: === Iteration 31 === Targeting ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 12 more)] === [2023-12-02 08:32:26,583 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-12-02 08:32:26,583 INFO L85 PathProgramCache]: Analyzing trace with hash 141584747, now seen corresponding path program 3 times [2023-12-02 08:32:26,584 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2023-12-02 08:32:26,584 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1882534934] [2023-12-02 08:32:26,584 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-02 08:32:26,584 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-12-02 08:32:26,598 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-02 08:32:27,206 INFO L134 CoverageAnalysis]: Checked inductivity of 149 backedges. 0 proven. 4 refuted. 0 times theorem prover too weak. 145 trivial. 0 not checked. [2023-12-02 08:32:27,206 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2023-12-02 08:32:27,206 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1882534934] [2023-12-02 08:32:27,206 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1882534934] provided 0 perfect and 1 imperfect interpolant sequences [2023-12-02 08:32:27,206 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [386399992] [2023-12-02 08:32:27,207 INFO L93 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST [2023-12-02 08:32:27,207 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-12-02 08:32:27,207 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_72ec9ce2-d26b-43c5-a264-de0e9bf99c34/bin/utaipan-verify-nQ1chXbOIh/z3 [2023-12-02 08:32:27,208 INFO L229 MonitoredProcess]: Starting monitored process 16 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_72ec9ce2-d26b-43c5-a264-de0e9bf99c34/bin/utaipan-verify-nQ1chXbOIh/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2023-12-02 08:32:27,208 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_72ec9ce2-d26b-43c5-a264-de0e9bf99c34/bin/utaipan-verify-nQ1chXbOIh/z3 -smt2 -in SMTLIB2_COMPLIANT=true (16)] Waiting until timeout for monitored process [2023-12-02 08:32:27,331 INFO L228 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2023-12-02 08:32:27,331 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2023-12-02 08:32:27,333 INFO L262 TraceCheckSpWp]: Trace formula consists of 252 conjuncts, 44 conjunts are in the unsatisfiable core [2023-12-02 08:32:27,336 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-12-02 08:32:27,343 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 7 treesize of output 6 [2023-12-02 08:32:27,552 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-12-02 08:32:27,552 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 10 [2023-12-02 08:32:27,666 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 22 treesize of output 17 [2023-12-02 08:32:27,886 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 29 treesize of output 22 [2023-12-02 08:32:27,973 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 21 treesize of output 15 [2023-12-02 08:32:28,028 INFO L134 CoverageAnalysis]: Checked inductivity of 149 backedges. 0 proven. 4 refuted. 0 times theorem prover too weak. 145 trivial. 0 not checked. [2023-12-02 08:32:28,028 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2023-12-02 08:32:28,845 WARN L854 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_1280 (Array Int Int)) (v_ArrVal_1282 Int) (|v_ULTIMATE.start_cache_entry_addref_~entry#1.offset_55| Int) (|v_ULTIMATE.start_main_~#t1~0#1.base_51| Int)) (or (< |v_ULTIMATE.start_main_~#t1~0#1.base_51| (+ |c_#StackHeapBarrier| 1)) (< |v_ULTIMATE.start_cache_entry_addref_~entry#1.offset_55| (+ 28 |c_~#cache~0.offset|)) (< 0 (+ 2147483650 (select (store (select (store |c_#memory_int| |v_ULTIMATE.start_main_~#t1~0#1.base_51| v_ArrVal_1280) |c_~#cache~0.base|) |c_~#cache~0.offset| v_ArrVal_1282) |v_ULTIMATE.start_cache_entry_addref_~entry#1.offset_55|))))) is different from false [2023-12-02 08:32:29,171 INFO L134 CoverageAnalysis]: Checked inductivity of 149 backedges. 0 proven. 4 refuted. 0 times theorem prover too weak. 145 trivial. 0 not checked. [2023-12-02 08:32:29,171 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [386399992] provided 0 perfect and 2 imperfect interpolant sequences [2023-12-02 08:32:29,171 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSifa [1122585041] [2023-12-02 08:32:29,171 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 08:32:29,172 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2023-12-02 08:32:29,172 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [13, 11, 11] total 35 [2023-12-02 08:32:29,172 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1784340771] [2023-12-02 08:32:29,172 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2023-12-02 08:32:29,172 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 37 states [2023-12-02 08:32:29,172 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2023-12-02 08:32:29,173 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 37 interpolants. [2023-12-02 08:32:29,173 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=207, Invalid=1056, Unknown=1, NotChecked=68, Total=1332 [2023-12-02 08:32:29,173 INFO L87 Difference]: Start difference. First operand 1441 states and 3075 transitions. Second operand has 37 states, 36 states have (on average 2.1666666666666665) internal successors, (78), 36 states have internal predecessors, (78), 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 08:32:41,753 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-12-02 08:32:41,753 INFO L93 Difference]: Finished difference Result 2844 states and 5977 transitions. [2023-12-02 08:32:41,754 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 68 states. [2023-12-02 08:32:41,754 INFO L78 Accepts]: Start accepts. Automaton has has 37 states, 36 states have (on average 2.1666666666666665) internal successors, (78), 36 states have internal predecessors, (78), 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 53 [2023-12-02 08:32:41,754 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-12-02 08:32:41,760 INFO L225 Difference]: With dead ends: 2844 [2023-12-02 08:32:41,760 INFO L226 Difference]: Without dead ends: 2844 [2023-12-02 08:32:41,761 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 177 GetRequests, 81 SyntacticMatches, 2 SemanticMatches, 94 ConstructedPredicates, 1 IntricatePredicates, 0 DeprecatedPredicates, 3160 ImplicationChecksByTransitivity, 7.4s TimeCoverageRelationStatistics Valid=1546, Invalid=7387, Unknown=1, NotChecked=186, Total=9120 [2023-12-02 08:32:41,761 INFO L413 NwaCegarLoop]: 28 mSDtfsCounter, 1134 mSDsluCounter, 590 mSDsCounter, 0 mSdLazyCounter, 2294 mSolverCounterSat, 77 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 5.8s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1134 SdHoareTripleChecker+Valid, 618 SdHoareTripleChecker+Invalid, 3025 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 77 IncrementalHoareTripleChecker+Valid, 2294 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 654 IncrementalHoareTripleChecker+Unchecked, 6.2s IncrementalHoareTripleChecker+Time [2023-12-02 08:32:41,762 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [1134 Valid, 618 Invalid, 3025 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [77 Valid, 2294 Invalid, 0 Unknown, 654 Unchecked, 6.2s Time] [2023-12-02 08:32:41,764 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2844 states. [2023-12-02 08:32:41,783 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2844 to 1361. [2023-12-02 08:32:41,784 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1361 states, 1353 states have (on average 2.1367331855136733) internal successors, (2891), 1360 states have internal predecessors, (2891), 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 08:32:41,797 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1361 states to 1361 states and 2891 transitions. [2023-12-02 08:32:41,797 INFO L78 Accepts]: Start accepts. Automaton has 1361 states and 2891 transitions. Word has length 53 [2023-12-02 08:32:41,797 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-12-02 08:32:41,797 INFO L495 AbstractCegarLoop]: Abstraction has 1361 states and 2891 transitions. [2023-12-02 08:32:41,797 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 37 states, 36 states have (on average 2.1666666666666665) internal successors, (78), 36 states have internal predecessors, (78), 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 08:32:41,797 INFO L276 IsEmpty]: Start isEmpty. Operand 1361 states and 2891 transitions. [2023-12-02 08:32:41,798 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 54 [2023-12-02 08:32:41,798 INFO L187 NwaCegarLoop]: Found error trace [2023-12-02 08:32:41,798 INFO L195 NwaCegarLoop]: trace histogram [10, 10, 10, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-12-02 08:32:41,803 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_72ec9ce2-d26b-43c5-a264-de0e9bf99c34/bin/utaipan-verify-nQ1chXbOIh/z3 -smt2 -in SMTLIB2_COMPLIANT=true (16)] Ended with exit code 0 [2023-12-02 08:32:41,999 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable30,16 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_72ec9ce2-d26b-43c5-a264-de0e9bf99c34/bin/utaipan-verify-nQ1chXbOIh/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-12-02 08:32:41,999 INFO L420 AbstractCegarLoop]: === Iteration 32 === Targeting ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 12 more)] === [2023-12-02 08:32:42,000 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-12-02 08:32:42,000 INFO L85 PathProgramCache]: Analyzing trace with hash -192670273, now seen corresponding path program 4 times [2023-12-02 08:32:42,000 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2023-12-02 08:32:42,000 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1547288508] [2023-12-02 08:32:42,000 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-02 08:32:42,000 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-12-02 08:32:42,015 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-02 08:32:42,532 INFO L134 CoverageAnalysis]: Checked inductivity of 149 backedges. 0 proven. 4 refuted. 0 times theorem prover too weak. 145 trivial. 0 not checked. [2023-12-02 08:32:42,532 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2023-12-02 08:32:42,533 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1547288508] [2023-12-02 08:32:42,533 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1547288508] provided 0 perfect and 1 imperfect interpolant sequences [2023-12-02 08:32:42,533 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [166096428] [2023-12-02 08:32:42,533 INFO L93 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2023-12-02 08:32:42,533 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-12-02 08:32:42,533 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_72ec9ce2-d26b-43c5-a264-de0e9bf99c34/bin/utaipan-verify-nQ1chXbOIh/z3 [2023-12-02 08:32:42,534 INFO L229 MonitoredProcess]: Starting monitored process 17 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_72ec9ce2-d26b-43c5-a264-de0e9bf99c34/bin/utaipan-verify-nQ1chXbOIh/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2023-12-02 08:32:42,545 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_72ec9ce2-d26b-43c5-a264-de0e9bf99c34/bin/utaipan-verify-nQ1chXbOIh/z3 -smt2 -in SMTLIB2_COMPLIANT=true (17)] Waiting until timeout for monitored process [2023-12-02 08:32:42,655 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-02 08:32:42,657 INFO L262 TraceCheckSpWp]: Trace formula consists of 252 conjuncts, 44 conjunts are in the unsatisfiable core [2023-12-02 08:32:42,659 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-12-02 08:32:42,666 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 7 treesize of output 6 [2023-12-02 08:32:42,888 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-12-02 08:32:42,889 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 10 [2023-12-02 08:32:43,016 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 22 treesize of output 17 [2023-12-02 08:32:43,292 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 29 treesize of output 22 [2023-12-02 08:32:43,332 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 21 treesize of output 15 [2023-12-02 08:32:43,389 INFO L134 CoverageAnalysis]: Checked inductivity of 149 backedges. 0 proven. 4 refuted. 0 times theorem prover too weak. 145 trivial. 0 not checked. [2023-12-02 08:32:43,389 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2023-12-02 08:32:44,186 WARN L854 $PredicateComparison]: unable to prove that (forall ((|v_ULTIMATE.start_cache_entry_addref_~entry#1.offset_58| Int) (v_ArrVal_1361 Int) (v_ArrVal_1359 (Array Int Int)) (|v_ULTIMATE.start_main_~#t1~0#1.base_52| Int)) (or (< |v_ULTIMATE.start_main_~#t1~0#1.base_52| (+ |c_#StackHeapBarrier| 1)) (< 0 (+ 2147483650 (select (store (select (store |c_#memory_int| |v_ULTIMATE.start_main_~#t1~0#1.base_52| v_ArrVal_1359) |c_~#cache~0.base|) |c_~#cache~0.offset| v_ArrVal_1361) |v_ULTIMATE.start_cache_entry_addref_~entry#1.offset_58|))) (< |v_ULTIMATE.start_cache_entry_addref_~entry#1.offset_58| (+ 28 |c_~#cache~0.offset|)))) is different from false [2023-12-02 08:32:44,512 INFO L134 CoverageAnalysis]: Checked inductivity of 149 backedges. 0 proven. 4 refuted. 0 times theorem prover too weak. 145 trivial. 0 not checked. [2023-12-02 08:32:44,512 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [166096428] provided 0 perfect and 2 imperfect interpolant sequences [2023-12-02 08:32:44,512 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSifa [968628386] [2023-12-02 08:32:44,513 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 08:32:44,513 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2023-12-02 08:32:44,513 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [13, 12, 11] total 36 [2023-12-02 08:32:44,513 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [482409076] [2023-12-02 08:32:44,514 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2023-12-02 08:32:44,514 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 38 states [2023-12-02 08:32:44,514 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2023-12-02 08:32:44,514 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 38 interpolants. [2023-12-02 08:32:44,515 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=167, Invalid=1168, Unknown=1, NotChecked=70, Total=1406 [2023-12-02 08:32:44,515 INFO L87 Difference]: Start difference. First operand 1361 states and 2891 transitions. Second operand has 38 states, 37 states have (on average 2.108108108108108) internal successors, (78), 37 states have internal predecessors, (78), 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 08:32:57,681 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-12-02 08:32:57,681 INFO L93 Difference]: Finished difference Result 2834 states and 5999 transitions. [2023-12-02 08:32:57,682 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 77 states. [2023-12-02 08:32:57,682 INFO L78 Accepts]: Start accepts. Automaton has has 38 states, 37 states have (on average 2.108108108108108) internal successors, (78), 37 states have internal predecessors, (78), 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 53 [2023-12-02 08:32:57,682 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-12-02 08:32:57,688 INFO L225 Difference]: With dead ends: 2834 [2023-12-02 08:32:57,688 INFO L226 Difference]: Without dead ends: 2834 [2023-12-02 08:32:57,689 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 183 GetRequests, 80 SyntacticMatches, 2 SemanticMatches, 101 ConstructedPredicates, 1 IntricatePredicates, 0 DeprecatedPredicates, 3453 ImplicationChecksByTransitivity, 7.9s TimeCoverageRelationStatistics Valid=1334, Invalid=8971, Unknown=1, NotChecked=200, Total=10506 [2023-12-02 08:32:57,689 INFO L413 NwaCegarLoop]: 31 mSDtfsCounter, 654 mSDsluCounter, 623 mSDsCounter, 0 mSdLazyCounter, 2655 mSolverCounterSat, 78 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 5.9s Time, 0 mProtectedPredicate, 0 mProtectedAction, 654 SdHoareTripleChecker+Valid, 654 SdHoareTripleChecker+Invalid, 3340 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 78 IncrementalHoareTripleChecker+Valid, 2655 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 607 IncrementalHoareTripleChecker+Unchecked, 6.3s IncrementalHoareTripleChecker+Time [2023-12-02 08:32:57,689 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [654 Valid, 654 Invalid, 3340 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [78 Valid, 2655 Invalid, 0 Unknown, 607 Unchecked, 6.3s Time] [2023-12-02 08:32:57,693 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2834 states. [2023-12-02 08:32:57,720 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2834 to 1482. [2023-12-02 08:32:57,723 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1482 states, 1474 states have (on average 2.144504748982361) internal successors, (3161), 1481 states have internal predecessors, (3161), 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 08:32:57,728 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1482 states to 1482 states and 3161 transitions. [2023-12-02 08:32:57,729 INFO L78 Accepts]: Start accepts. Automaton has 1482 states and 3161 transitions. Word has length 53 [2023-12-02 08:32:57,729 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-12-02 08:32:57,729 INFO L495 AbstractCegarLoop]: Abstraction has 1482 states and 3161 transitions. [2023-12-02 08:32:57,729 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 38 states, 37 states have (on average 2.108108108108108) internal successors, (78), 37 states have internal predecessors, (78), 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 08:32:57,729 INFO L276 IsEmpty]: Start isEmpty. Operand 1482 states and 3161 transitions. [2023-12-02 08:32:57,731 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 54 [2023-12-02 08:32:57,731 INFO L187 NwaCegarLoop]: Found error trace [2023-12-02 08:32:57,731 INFO L195 NwaCegarLoop]: trace histogram [10, 10, 10, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-12-02 08:32:57,736 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_72ec9ce2-d26b-43c5-a264-de0e9bf99c34/bin/utaipan-verify-nQ1chXbOIh/z3 -smt2 -in SMTLIB2_COMPLIANT=true (17)] Ended with exit code 0 [2023-12-02 08:32:57,932 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 17 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_72ec9ce2-d26b-43c5-a264-de0e9bf99c34/bin/utaipan-verify-nQ1chXbOIh/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable31 [2023-12-02 08:32:57,932 INFO L420 AbstractCegarLoop]: === Iteration 33 === Targeting ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 12 more)] === [2023-12-02 08:32:57,932 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-12-02 08:32:57,932 INFO L85 PathProgramCache]: Analyzing trace with hash 89262805, now seen corresponding path program 5 times [2023-12-02 08:32:57,932 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2023-12-02 08:32:57,933 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [748380792] [2023-12-02 08:32:57,933 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-02 08:32:57,933 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-12-02 08:32:57,949 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-02 08:32:58,564 INFO L134 CoverageAnalysis]: Checked inductivity of 149 backedges. 0 proven. 4 refuted. 0 times theorem prover too weak. 145 trivial. 0 not checked. [2023-12-02 08:32:58,564 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2023-12-02 08:32:58,565 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [748380792] [2023-12-02 08:32:58,565 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [748380792] provided 0 perfect and 1 imperfect interpolant sequences [2023-12-02 08:32:58,565 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1573104978] [2023-12-02 08:32:58,565 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2023-12-02 08:32:58,565 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-12-02 08:32:58,565 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_72ec9ce2-d26b-43c5-a264-de0e9bf99c34/bin/utaipan-verify-nQ1chXbOIh/z3 [2023-12-02 08:32:58,566 INFO L229 MonitoredProcess]: Starting monitored process 18 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_72ec9ce2-d26b-43c5-a264-de0e9bf99c34/bin/utaipan-verify-nQ1chXbOIh/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2023-12-02 08:32:58,570 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_72ec9ce2-d26b-43c5-a264-de0e9bf99c34/bin/utaipan-verify-nQ1chXbOIh/z3 -smt2 -in SMTLIB2_COMPLIANT=true (18)] Waiting until timeout for monitored process [2023-12-02 08:32:58,727 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 2 check-sat command(s) [2023-12-02 08:32:58,728 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2023-12-02 08:32:58,729 INFO L262 TraceCheckSpWp]: Trace formula consists of 153 conjuncts, 44 conjunts are in the unsatisfiable core [2023-12-02 08:32:58,732 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-12-02 08:32:58,740 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 7 treesize of output 6 [2023-12-02 08:32:59,057 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-12-02 08:32:59,057 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 10 [2023-12-02 08:32:59,200 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 22 treesize of output 17 [2023-12-02 08:32:59,548 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 29 treesize of output 22 [2023-12-02 08:32:59,595 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 21 treesize of output 15 [2023-12-02 08:32:59,656 INFO L134 CoverageAnalysis]: Checked inductivity of 149 backedges. 0 proven. 4 refuted. 0 times theorem prover too weak. 145 trivial. 0 not checked. [2023-12-02 08:32:59,656 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2023-12-02 08:33:00,529 WARN L854 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_1438 (Array Int Int)) (v_ArrVal_1441 Int) (|v_ULTIMATE.start_cache_entry_addref_~entry#1.offset_61| Int) (|v_ULTIMATE.start_main_~#t1~0#1.base_53| Int)) (or (< |v_ULTIMATE.start_main_~#t1~0#1.base_53| (+ |c_#StackHeapBarrier| 1)) (< 0 (+ (select (store (select (store |c_#memory_int| |v_ULTIMATE.start_main_~#t1~0#1.base_53| v_ArrVal_1438) |c_~#cache~0.base|) |c_~#cache~0.offset| v_ArrVal_1441) |v_ULTIMATE.start_cache_entry_addref_~entry#1.offset_61|) 2147483650)) (< |v_ULTIMATE.start_cache_entry_addref_~entry#1.offset_61| (+ 28 |c_~#cache~0.offset|)))) is different from false [2023-12-02 08:33:00,893 INFO L134 CoverageAnalysis]: Checked inductivity of 149 backedges. 0 proven. 4 refuted. 0 times theorem prover too weak. 145 trivial. 0 not checked. [2023-12-02 08:33:00,893 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1573104978] provided 0 perfect and 2 imperfect interpolant sequences [2023-12-02 08:33:00,893 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSifa [1953768768] [2023-12-02 08:33:00,894 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 08:33:00,894 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2023-12-02 08:33:00,894 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [13, 12, 11] total 36 [2023-12-02 08:33:00,895 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1297160776] [2023-12-02 08:33:00,895 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2023-12-02 08:33:00,895 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 38 states [2023-12-02 08:33:00,895 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2023-12-02 08:33:00,896 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 38 interpolants. [2023-12-02 08:33:00,896 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=175, Invalid=1160, Unknown=1, NotChecked=70, Total=1406 [2023-12-02 08:33:00,897 INFO L87 Difference]: Start difference. First operand 1482 states and 3161 transitions. Second operand has 38 states, 37 states have (on average 2.108108108108108) internal successors, (78), 37 states have internal predecessors, (78), 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 08:33:29,807 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-12-02 08:33:29,808 INFO L93 Difference]: Finished difference Result 3344 states and 7042 transitions. [2023-12-02 08:33:29,808 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 105 states. [2023-12-02 08:33:29,808 INFO L78 Accepts]: Start accepts. Automaton has has 38 states, 37 states have (on average 2.108108108108108) internal successors, (78), 37 states have internal predecessors, (78), 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 53 [2023-12-02 08:33:29,808 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-12-02 08:33:29,816 INFO L225 Difference]: With dead ends: 3344 [2023-12-02 08:33:29,816 INFO L226 Difference]: Without dead ends: 3344 [2023-12-02 08:33:29,817 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 211 GetRequests, 80 SyntacticMatches, 2 SemanticMatches, 129 ConstructedPredicates, 1 IntricatePredicates, 0 DeprecatedPredicates, 6189 ImplicationChecksByTransitivity, 21.2s TimeCoverageRelationStatistics Valid=2085, Invalid=14687, Unknown=2, NotChecked=256, Total=17030 [2023-12-02 08:33:29,817 INFO L413 NwaCegarLoop]: 51 mSDtfsCounter, 850 mSDsluCounter, 946 mSDsCounter, 0 mSdLazyCounter, 2896 mSolverCounterSat, 82 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 8.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 850 SdHoareTripleChecker+Valid, 997 SdHoareTripleChecker+Invalid, 3778 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 82 IncrementalHoareTripleChecker+Valid, 2896 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 800 IncrementalHoareTripleChecker+Unchecked, 8.9s IncrementalHoareTripleChecker+Time [2023-12-02 08:33:29,818 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [850 Valid, 997 Invalid, 3778 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [82 Valid, 2896 Invalid, 0 Unknown, 800 Unchecked, 8.9s Time] [2023-12-02 08:33:29,823 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3344 states. [2023-12-02 08:33:29,851 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3344 to 1648. [2023-12-02 08:33:29,853 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1648 states, 1640 states have (on average 2.1567073170731708) internal successors, (3537), 1647 states have internal predecessors, (3537), 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 08:33:29,857 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1648 states to 1648 states and 3537 transitions. [2023-12-02 08:33:29,857 INFO L78 Accepts]: Start accepts. Automaton has 1648 states and 3537 transitions. Word has length 53 [2023-12-02 08:33:29,857 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-12-02 08:33:29,857 INFO L495 AbstractCegarLoop]: Abstraction has 1648 states and 3537 transitions. [2023-12-02 08:33:29,857 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 38 states, 37 states have (on average 2.108108108108108) internal successors, (78), 37 states have internal predecessors, (78), 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 08:33:29,857 INFO L276 IsEmpty]: Start isEmpty. Operand 1648 states and 3537 transitions. [2023-12-02 08:33:29,859 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 54 [2023-12-02 08:33:29,859 INFO L187 NwaCegarLoop]: Found error trace [2023-12-02 08:33:29,859 INFO L195 NwaCegarLoop]: trace histogram [10, 10, 10, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-12-02 08:33:29,864 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_72ec9ce2-d26b-43c5-a264-de0e9bf99c34/bin/utaipan-verify-nQ1chXbOIh/z3 -smt2 -in SMTLIB2_COMPLIANT=true (18)] Ended with exit code 0 [2023-12-02 08:33:30,059 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 18 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_72ec9ce2-d26b-43c5-a264-de0e9bf99c34/bin/utaipan-verify-nQ1chXbOIh/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable32 [2023-12-02 08:33:30,060 INFO L420 AbstractCegarLoop]: === Iteration 34 === Targeting ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 12 more)] === [2023-12-02 08:33:30,060 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-12-02 08:33:30,060 INFO L85 PathProgramCache]: Analyzing trace with hash 910129073, now seen corresponding path program 6 times [2023-12-02 08:33:30,060 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2023-12-02 08:33:30,060 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1457383264] [2023-12-02 08:33:30,061 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-02 08:33:30,061 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-12-02 08:33:30,075 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-02 08:33:30,716 INFO L134 CoverageAnalysis]: Checked inductivity of 149 backedges. 0 proven. 4 refuted. 0 times theorem prover too weak. 145 trivial. 0 not checked. [2023-12-02 08:33:30,717 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2023-12-02 08:33:30,717 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1457383264] [2023-12-02 08:33:30,717 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1457383264] provided 0 perfect and 1 imperfect interpolant sequences [2023-12-02 08:33:30,717 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [431690827] [2023-12-02 08:33:30,717 INFO L93 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST [2023-12-02 08:33:30,717 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-12-02 08:33:30,717 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_72ec9ce2-d26b-43c5-a264-de0e9bf99c34/bin/utaipan-verify-nQ1chXbOIh/z3 [2023-12-02 08:33:30,718 INFO L229 MonitoredProcess]: Starting monitored process 19 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_72ec9ce2-d26b-43c5-a264-de0e9bf99c34/bin/utaipan-verify-nQ1chXbOIh/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2023-12-02 08:33:30,719 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_72ec9ce2-d26b-43c5-a264-de0e9bf99c34/bin/utaipan-verify-nQ1chXbOIh/z3 -smt2 -in SMTLIB2_COMPLIANT=true (19)] Waiting until timeout for monitored process [2023-12-02 08:33:30,863 INFO L228 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2023-12-02 08:33:30,863 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2023-12-02 08:33:30,865 INFO L262 TraceCheckSpWp]: Trace formula consists of 252 conjuncts, 44 conjunts are in the unsatisfiable core [2023-12-02 08:33:30,867 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-12-02 08:33:30,874 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 7 treesize of output 6 [2023-12-02 08:33:31,110 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-12-02 08:33:31,110 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 10 [2023-12-02 08:33:31,246 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 22 treesize of output 17 [2023-12-02 08:33:31,510 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 29 treesize of output 22 [2023-12-02 08:33:31,626 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 21 treesize of output 15 [2023-12-02 08:33:31,684 INFO L134 CoverageAnalysis]: Checked inductivity of 149 backedges. 0 proven. 4 refuted. 0 times theorem prover too weak. 145 trivial. 0 not checked. [2023-12-02 08:33:31,684 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2023-12-02 08:33:32,984 INFO L134 CoverageAnalysis]: Checked inductivity of 149 backedges. 0 proven. 4 refuted. 0 times theorem prover too weak. 145 trivial. 0 not checked. [2023-12-02 08:33:32,984 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [431690827] provided 0 perfect and 2 imperfect interpolant sequences [2023-12-02 08:33:32,984 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSifa [770553448] [2023-12-02 08:33:32,985 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 08:33:32,985 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2023-12-02 08:33:32,985 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [13, 12, 11] total 36 [2023-12-02 08:33:32,985 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [512455184] [2023-12-02 08:33:32,985 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2023-12-02 08:33:32,985 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 38 states [2023-12-02 08:33:32,986 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2023-12-02 08:33:32,986 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 38 interpolants. [2023-12-02 08:33:32,986 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=202, Invalid=1198, Unknown=6, NotChecked=0, Total=1406 [2023-12-02 08:33:32,986 INFO L87 Difference]: Start difference. First operand 1648 states and 3537 transitions. Second operand has 38 states, 37 states have (on average 2.108108108108108) internal successors, (78), 37 states have internal predecessors, (78), 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 08:33:47,167 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 [1] [2023-12-02 08:33:51,409 WARN L854 $PredicateComparison]: unable to prove that (let ((.cse8 (select |c_#memory_int| |c_~#cache~0.base|)) (.cse0 ((as const (Array Int Int)) 0))) (let ((.cse11 (@diff .cse8 .cse0)) (.cse1 (select |c_#memory_int| |c_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.base|))) (let ((.cse2 (@diff .cse1 .cse0)) (.cse9 (store .cse8 .cse11 0))) (let ((.cse6 (@diff .cse9 .cse0)) (.cse4 (= .cse0 .cse1)) (.cse3 (= |c_ULTIMATE.start_main_~i~2#1| 0)) (.cse5 (<= .cse2 |c_~#cache~0.offset|)) (.cse7 (+ (* |c_ULTIMATE.start_main_~i~2#1| 28) |c_~#cache~0.offset|))) (and (= .cse0 (store .cse1 .cse2 0)) .cse3 (= |c_~#cache~0.base| |c_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.base|) (or .cse4 (and (= |c_ULTIMATE.start_main_#t~post38#1| 0) .cse5)) (= |c_~#cache~0.base| 1) (or (< (+ .cse6 27) .cse7) (< 0 (+ (select .cse8 .cse6) 2147483649))) (forall ((|v_ULTIMATE.start_cache_entry_addref_~entry#1.offset_64| Int) (|v_ULTIMATE.start_main_~#t1~0#1.base_54| Int) (v_ArrVal_1520 Int) (v_ArrVal_1517 (Array Int Int))) (or (< |v_ULTIMATE.start_cache_entry_addref_~entry#1.offset_64| (+ 28 |c_~#cache~0.offset|)) (< 0 (+ 2147483650 (select (store (select (store |c_#memory_int| |v_ULTIMATE.start_main_~#t1~0#1.base_54| v_ArrVal_1517) |c_~#cache~0.base|) |c_~#cache~0.offset| v_ArrVal_1520) |v_ULTIMATE.start_cache_entry_addref_~entry#1.offset_64|))) (< |v_ULTIMATE.start_main_~#t1~0#1.base_54| (+ |c_#StackHeapBarrier| 1)))) (= .cse0 (store .cse9 .cse6 0)) (<= 0 |c_ULTIMATE.start_main_#t~post38#1|) (let ((.cse10 (select |c_#memory_int| 1))) (= (store .cse0 0 (select .cse10 0)) .cse10)) (= |c_~#cache~0.offset| 0) (or .cse4 (and .cse3 .cse5)) (or (< 0 (+ 2147483649 (select .cse8 .cse11))) (< (+ .cse11 27) .cse7))))))) is different from false [2023-12-02 08:33:57,475 WARN L854 $PredicateComparison]: unable to prove that (let ((.cse0 (select |c_#memory_int| |c_~#cache~0.base|)) (.cse2 ((as const (Array Int Int)) 0))) (let ((.cse7 (@diff .cse0 .cse2))) (let ((.cse3 (store .cse0 .cse7 0))) (let ((.cse4 (@diff .cse3 .cse2)) (.cse6 (= |c_ULTIMATE.start_main_#t~post38#1| 0)) (.cse1 (+ (* |c_ULTIMATE.start_main_~i~2#1| 28) 28 |c_~#cache~0.offset|))) (and (= |c_ULTIMATE.start_cache_entry_addref_~entry#1.base| 1) (forall ((|v_ULTIMATE.start_cache_entry_addref_~entry#1.offset_64| Int) (v_ArrVal_1520 Int)) (or (< 0 (+ 2147483650 (select (store .cse0 (+ (* |c_t_funThread1of1ForFork0_~i~0#1| 28) |c_~#cache~0.offset|) v_ArrVal_1520) |v_ULTIMATE.start_cache_entry_addref_~entry#1.offset_64|))) (< |v_ULTIMATE.start_cache_entry_addref_~entry#1.offset_64| .cse1))) (<= 1 |c_ULTIMATE.start_main_~i~2#1|) (= |c_~#cache~0.base| 1) (forall ((|v_ULTIMATE.start_cache_entry_addref_~entry#1.offset_64| Int) (|v_ULTIMATE.start_main_~#t1~0#1.base_54| Int) (v_ArrVal_1520 Int) (v_ArrVal_1517 (Array Int Int))) (or (< |v_ULTIMATE.start_cache_entry_addref_~entry#1.offset_64| (+ 28 |c_~#cache~0.offset|)) (< 0 (+ 2147483650 (select (store (select (store |c_#memory_int| |v_ULTIMATE.start_main_~#t1~0#1.base_54| v_ArrVal_1517) |c_~#cache~0.base|) |c_~#cache~0.offset| v_ArrVal_1520) |v_ULTIMATE.start_cache_entry_addref_~entry#1.offset_64|))) (< |v_ULTIMATE.start_main_~#t1~0#1.base_54| (+ |c_#StackHeapBarrier| 1)))) (= .cse2 (store .cse3 .cse4 0)) (let ((.cse5 (select |c_#memory_int| 1))) (= (store .cse2 0 (select .cse5 0)) .cse5)) (or (< 0 (+ (select .cse0 .cse4) 2147483649)) (and .cse6 (<= .cse4 |c_~#cache~0.offset|))) (= |c_~#cache~0.offset| 0) (or (< 0 (+ 2147483649 (select .cse0 .cse7))) (and .cse6 (<= .cse7 |c_~#cache~0.offset|))) (<= 28 |c_ULTIMATE.start_cache_entry_addref_~entry#1.offset|) (forall ((|v_ULTIMATE.start_cache_entry_addref_~entry#1.offset_64| Int) (v_ArrVal_1520 Int) (|ULTIMATE.start_cache_entry_addref_#t~post32#1| Int)) (or (< 0 (+ 2147483650 (select (store (select (store |c_#memory_int| |c_ULTIMATE.start_cache_entry_addref_~entry#1.base| (store (select |c_#memory_int| |c_ULTIMATE.start_cache_entry_addref_~entry#1.base|) |c_ULTIMATE.start_cache_entry_addref_~entry#1.offset| (+ |ULTIMATE.start_cache_entry_addref_#t~post32#1| 1))) |c_~#cache~0.base|) |c_~#cache~0.offset| v_ArrVal_1520) |v_ULTIMATE.start_cache_entry_addref_~entry#1.offset_64|))) (< |v_ULTIMATE.start_cache_entry_addref_~entry#1.offset_64| .cse1)))))))) is different from false [2023-12-02 08:34:03,666 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.35s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0, 1] [2023-12-02 08:34:18,625 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 [1] [2023-12-02 08:34:19,247 WARN L854 $PredicateComparison]: unable to prove that (let ((.cse4 (select |c_#memory_int| |c_~#cache~0.base|)) (.cse0 ((as const (Array Int Int)) 0))) (let ((.cse6 (@diff .cse4 .cse0))) (let ((.cse1 (store .cse4 .cse6 0))) (let ((.cse2 (@diff .cse1 .cse0)) (.cse5 (= |c_ULTIMATE.start_main_#t~post38#1| 0))) (and (= |c_ULTIMATE.start_cache_entry_addref_~entry#1.base| 1) (<= 1 |c_ULTIMATE.start_main_~i~2#1|) (= |c_~#cache~0.base| 1) (forall ((|v_ULTIMATE.start_cache_entry_addref_~entry#1.offset_64| Int) (|v_ULTIMATE.start_main_~#t1~0#1.base_54| Int) (v_ArrVal_1520 Int) (v_ArrVal_1517 (Array Int Int))) (or (< |v_ULTIMATE.start_cache_entry_addref_~entry#1.offset_64| (+ 28 |c_~#cache~0.offset|)) (< 0 (+ 2147483650 (select (store (select (store |c_#memory_int| |v_ULTIMATE.start_main_~#t1~0#1.base_54| v_ArrVal_1517) |c_~#cache~0.base|) |c_~#cache~0.offset| v_ArrVal_1520) |v_ULTIMATE.start_cache_entry_addref_~entry#1.offset_64|))) (< |v_ULTIMATE.start_main_~#t1~0#1.base_54| (+ |c_#StackHeapBarrier| 1)))) (= .cse0 (store .cse1 .cse2 0)) (let ((.cse3 (select |c_#memory_int| 1))) (= (store .cse0 0 (select .cse3 0)) .cse3)) (or (< 0 (+ (select .cse4 .cse2) 2147483649)) (and .cse5 (<= .cse2 |c_~#cache~0.offset|))) (= |c_~#cache~0.offset| 0) (exists ((v_DerPreprocessor_15 Int) (|ULTIMATE.start_cache_entry_addref_~entry#1.offset| Int)) (and (<= (select (store .cse0 0 v_DerPreprocessor_15) |ULTIMATE.start_cache_entry_addref_~entry#1.offset|) |c_ULTIMATE.start_cache_entry_addref_#t~post32#1|) (<= 28 |ULTIMATE.start_cache_entry_addref_~entry#1.offset|))) (or (< 0 (+ 2147483649 (select .cse4 .cse6))) (and .cse5 (<= .cse6 |c_~#cache~0.offset|))) (<= 28 |c_ULTIMATE.start_cache_entry_addref_~entry#1.offset|) (forall ((|v_ULTIMATE.start_cache_entry_addref_~entry#1.offset_64| Int) (v_ArrVal_1520 Int) (|ULTIMATE.start_cache_entry_addref_#t~post32#1| Int)) (or (< 0 (+ 2147483650 (select (store (select (store |c_#memory_int| |c_ULTIMATE.start_cache_entry_addref_~entry#1.base| (store (select |c_#memory_int| |c_ULTIMATE.start_cache_entry_addref_~entry#1.base|) |c_ULTIMATE.start_cache_entry_addref_~entry#1.offset| (+ |ULTIMATE.start_cache_entry_addref_#t~post32#1| 1))) |c_~#cache~0.base|) |c_~#cache~0.offset| v_ArrVal_1520) |v_ULTIMATE.start_cache_entry_addref_~entry#1.offset_64|))) (< |v_ULTIMATE.start_cache_entry_addref_~entry#1.offset_64| (+ (* |c_ULTIMATE.start_main_~i~2#1| 28) 28 |c_~#cache~0.offset|))))))))) is different from false [2023-12-02 08:34:39,504 WARN L854 $PredicateComparison]: unable to prove that (let ((.cse0 (select |c_#memory_int| |c_~#cache~0.base|)) (.cse2 ((as const (Array Int Int)) 0))) (let ((.cse7 (@diff .cse0 .cse2))) (let ((.cse3 (store .cse0 .cse7 0))) (let ((.cse4 (@diff .cse3 .cse2)) (.cse6 (= |c_ULTIMATE.start_main_#t~post38#1| 0)) (.cse1 (+ (* |c_ULTIMATE.start_main_~i~2#1| 28) 28 |c_~#cache~0.offset|))) (and (= |c_ULTIMATE.start_cache_entry_addref_~entry#1.base| 1) (forall ((|v_ULTIMATE.start_cache_entry_addref_~entry#1.offset_64| Int) (v_ArrVal_1520 Int)) (or (< 0 (+ 2147483650 (select (store .cse0 (+ (* |c_t_funThread1of1ForFork0_~i~0#1| 28) |c_~#cache~0.offset|) v_ArrVal_1520) |v_ULTIMATE.start_cache_entry_addref_~entry#1.offset_64|))) (< |v_ULTIMATE.start_cache_entry_addref_~entry#1.offset_64| .cse1))) (<= 1 |c_ULTIMATE.start_main_~i~2#1|) (= |c_~#cache~0.base| 1) (forall ((|v_ULTIMATE.start_cache_entry_addref_~entry#1.offset_64| Int) (|v_ULTIMATE.start_main_~#t1~0#1.base_54| Int) (v_ArrVal_1520 Int) (v_ArrVal_1517 (Array Int Int))) (or (< |v_ULTIMATE.start_cache_entry_addref_~entry#1.offset_64| (+ 28 |c_~#cache~0.offset|)) (< 0 (+ 2147483650 (select (store (select (store |c_#memory_int| |v_ULTIMATE.start_main_~#t1~0#1.base_54| v_ArrVal_1517) |c_~#cache~0.base|) |c_~#cache~0.offset| v_ArrVal_1520) |v_ULTIMATE.start_cache_entry_addref_~entry#1.offset_64|))) (< |v_ULTIMATE.start_main_~#t1~0#1.base_54| (+ |c_#StackHeapBarrier| 1)))) (= .cse2 (store .cse3 .cse4 0)) (let ((.cse5 (select |c_#memory_int| 1))) (= (store .cse2 0 (select .cse5 0)) .cse5)) (or (< 0 (+ (select .cse0 .cse4) 2147483649)) (and .cse6 (<= .cse4 |c_~#cache~0.offset|))) (= |c_~#cache~0.offset| 0) (exists ((v_DerPreprocessor_15 Int) (|ULTIMATE.start_cache_entry_addref_~entry#1.offset| Int)) (and (<= (select (store .cse2 0 v_DerPreprocessor_15) |ULTIMATE.start_cache_entry_addref_~entry#1.offset|) |c_ULTIMATE.start_cache_entry_addref_#t~post32#1|) (<= 28 |ULTIMATE.start_cache_entry_addref_~entry#1.offset|))) (or (< 0 (+ 2147483649 (select .cse0 .cse7))) (and .cse6 (<= .cse7 |c_~#cache~0.offset|))) (<= 28 |c_ULTIMATE.start_cache_entry_addref_~entry#1.offset|) (forall ((|v_ULTIMATE.start_cache_entry_addref_~entry#1.offset_64| Int) (v_ArrVal_1520 Int) (|ULTIMATE.start_cache_entry_addref_#t~post32#1| Int)) (or (< 0 (+ 2147483650 (select (store (select (store |c_#memory_int| |c_ULTIMATE.start_cache_entry_addref_~entry#1.base| (store (select |c_#memory_int| |c_ULTIMATE.start_cache_entry_addref_~entry#1.base|) |c_ULTIMATE.start_cache_entry_addref_~entry#1.offset| (+ |ULTIMATE.start_cache_entry_addref_#t~post32#1| 1))) |c_~#cache~0.base|) |c_~#cache~0.offset| v_ArrVal_1520) |v_ULTIMATE.start_cache_entry_addref_~entry#1.offset_64|))) (< |v_ULTIMATE.start_cache_entry_addref_~entry#1.offset_64| .cse1))) (forall ((|v_ULTIMATE.start_cache_entry_addref_~entry#1.offset_64| Int) (v_ArrVal_1520 Int)) (or (< 0 (+ 2147483650 (select (select (store |c_#memory_int| |c_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.base| (store (select |c_#memory_int| |c_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.base|) |c_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset| v_ArrVal_1520)) |c_~#cache~0.base|) |v_ULTIMATE.start_cache_entry_addref_~entry#1.offset_64|))) (< |v_ULTIMATE.start_cache_entry_addref_~entry#1.offset_64| .cse1)))))))) is different from false [2023-12-02 08:35:09,141 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.75s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2023-12-02 08:35:11,031 WARN L854 $PredicateComparison]: unable to prove that (let ((.cse0 (+ (* |c_ULTIMATE.start_main_~i~2#1| 28) 28 |c_~#cache~0.offset|))) (and (= |c_ULTIMATE.start_cache_entry_addref_~entry#1.base| 1) (forall ((|v_ULTIMATE.start_cache_entry_addref_~entry#1.offset_64| Int) (v_ArrVal_1520 Int)) (or (< 0 (+ 2147483650 (select (store (select |c_#memory_int| |c_~#cache~0.base|) (+ (* |c_t_funThread1of1ForFork0_~i~0#1| 28) |c_~#cache~0.offset|) v_ArrVal_1520) |v_ULTIMATE.start_cache_entry_addref_~entry#1.offset_64|))) (< |v_ULTIMATE.start_cache_entry_addref_~entry#1.offset_64| .cse0))) (<= 1 |c_ULTIMATE.start_main_~i~2#1|) (= |c_~#cache~0.base| 1) (forall ((|v_ULTIMATE.start_cache_entry_addref_~entry#1.offset_64| Int) (|v_ULTIMATE.start_main_~#t1~0#1.base_54| Int) (v_ArrVal_1520 Int) (v_ArrVal_1517 (Array Int Int))) (or (< |v_ULTIMATE.start_cache_entry_addref_~entry#1.offset_64| (+ 28 |c_~#cache~0.offset|)) (< 0 (+ 2147483650 (select (store (select (store |c_#memory_int| |v_ULTIMATE.start_main_~#t1~0#1.base_54| v_ArrVal_1517) |c_~#cache~0.base|) |c_~#cache~0.offset| v_ArrVal_1520) |v_ULTIMATE.start_cache_entry_addref_~entry#1.offset_64|))) (< |v_ULTIMATE.start_main_~#t1~0#1.base_54| (+ |c_#StackHeapBarrier| 1)))) (let ((.cse1 (select |c_#memory_int| 1))) (= (store ((as const (Array Int Int)) 0) 0 (select .cse1 0)) .cse1)) (= |c_~#cache~0.offset| 0) (<= 28 |c_ULTIMATE.start_cache_entry_addref_~entry#1.offset|) (forall ((|v_ULTIMATE.start_cache_entry_addref_~entry#1.offset_64| Int) (v_ArrVal_1520 Int) (|ULTIMATE.start_cache_entry_addref_#t~post32#1| Int)) (or (< 0 (+ 2147483650 (select (store (select (store |c_#memory_int| |c_ULTIMATE.start_cache_entry_addref_~entry#1.base| (store (select |c_#memory_int| |c_ULTIMATE.start_cache_entry_addref_~entry#1.base|) |c_ULTIMATE.start_cache_entry_addref_~entry#1.offset| (+ |ULTIMATE.start_cache_entry_addref_#t~post32#1| 1))) |c_~#cache~0.base|) |c_~#cache~0.offset| v_ArrVal_1520) |v_ULTIMATE.start_cache_entry_addref_~entry#1.offset_64|))) (< |v_ULTIMATE.start_cache_entry_addref_~entry#1.offset_64| .cse0))) (forall ((|v_ULTIMATE.start_cache_entry_addref_~entry#1.offset_64| Int) (v_ArrVal_1520 Int)) (or (< 0 (+ 2147483650 (select (select (store |c_#memory_int| |c_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.base| (store (select |c_#memory_int| |c_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.base|) |c_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset| v_ArrVal_1520)) |c_~#cache~0.base|) |v_ULTIMATE.start_cache_entry_addref_~entry#1.offset_64|))) (< |v_ULTIMATE.start_cache_entry_addref_~entry#1.offset_64| .cse0))))) is different from false [2023-12-02 08:36:16,482 WARN L854 $PredicateComparison]: unable to prove that (let ((.cse0 ((as const (Array Int Int)) 0))) (and (= |c_ULTIMATE.start_cache_entry_addref_~entry#1.base| 1) (<= 1 |c_ULTIMATE.start_main_~i~2#1|) (= |c_~#cache~0.base| 1) (forall ((|v_ULTIMATE.start_cache_entry_addref_~entry#1.offset_64| Int) (|v_ULTIMATE.start_main_~#t1~0#1.base_54| Int) (v_ArrVal_1520 Int) (v_ArrVal_1517 (Array Int Int))) (or (< |v_ULTIMATE.start_cache_entry_addref_~entry#1.offset_64| (+ 28 |c_~#cache~0.offset|)) (< 0 (+ 2147483650 (select (store (select (store |c_#memory_int| |v_ULTIMATE.start_main_~#t1~0#1.base_54| v_ArrVal_1517) |c_~#cache~0.base|) |c_~#cache~0.offset| v_ArrVal_1520) |v_ULTIMATE.start_cache_entry_addref_~entry#1.offset_64|))) (< |v_ULTIMATE.start_main_~#t1~0#1.base_54| (+ |c_#StackHeapBarrier| 1)))) (let ((.cse1 (select |c_#memory_int| 1))) (= (store .cse0 0 (select .cse1 0)) .cse1)) (= |c_~#cache~0.offset| 0) (exists ((v_DerPreprocessor_15 Int) (|ULTIMATE.start_cache_entry_addref_~entry#1.offset| Int)) (and (<= (select (store .cse0 0 v_DerPreprocessor_15) |ULTIMATE.start_cache_entry_addref_~entry#1.offset|) |c_ULTIMATE.start_cache_entry_addref_#t~post32#1|) (<= 28 |ULTIMATE.start_cache_entry_addref_~entry#1.offset|))) (<= 28 |c_ULTIMATE.start_cache_entry_addref_~entry#1.offset|) (forall ((|v_ULTIMATE.start_cache_entry_addref_~entry#1.offset_64| Int) (v_ArrVal_1520 Int) (|ULTIMATE.start_cache_entry_addref_#t~post32#1| Int)) (or (< 0 (+ 2147483650 (select (store (select (store |c_#memory_int| |c_ULTIMATE.start_cache_entry_addref_~entry#1.base| (store (select |c_#memory_int| |c_ULTIMATE.start_cache_entry_addref_~entry#1.base|) |c_ULTIMATE.start_cache_entry_addref_~entry#1.offset| (+ |ULTIMATE.start_cache_entry_addref_#t~post32#1| 1))) |c_~#cache~0.base|) |c_~#cache~0.offset| v_ArrVal_1520) |v_ULTIMATE.start_cache_entry_addref_~entry#1.offset_64|))) (< |v_ULTIMATE.start_cache_entry_addref_~entry#1.offset_64| (+ (* |c_ULTIMATE.start_main_~i~2#1| 28) 28 |c_~#cache~0.offset|)))))) is different from false [2023-12-02 08:36:19,196 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 [1] [2023-12-02 08:36:26,986 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-12-02 08:36:26,986 INFO L93 Difference]: Finished difference Result 5922 states and 12523 transitions. [2023-12-02 08:36:26,987 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 190 states. [2023-12-02 08:36:26,987 INFO L78 Accepts]: Start accepts. Automaton has has 38 states, 37 states have (on average 2.108108108108108) internal successors, (78), 37 states have internal predecessors, (78), 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 53 [2023-12-02 08:36:26,987 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-12-02 08:36:26,996 INFO L225 Difference]: With dead ends: 5922 [2023-12-02 08:36:26,996 INFO L226 Difference]: Without dead ends: 5922 [2023-12-02 08:36:26,999 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 293 GetRequests, 83 SyntacticMatches, 1 SemanticMatches, 209 ConstructedPredicates, 6 IntricatePredicates, 0 DeprecatedPredicates, 17350 ImplicationChecksByTransitivity, 147.9s TimeCoverageRelationStatistics Valid=5415, Invalid=36215, Unknown=214, NotChecked=2466, Total=44310 [2023-12-02 08:36:27,000 INFO L413 NwaCegarLoop]: 56 mSDtfsCounter, 1918 mSDsluCounter, 1279 mSDsCounter, 0 mSdLazyCounter, 5208 mSolverCounterSat, 185 mSolverCounterUnsat, 167 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 26.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1918 SdHoareTripleChecker+Valid, 1335 SdHoareTripleChecker+Invalid, 7092 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 185 IncrementalHoareTripleChecker+Valid, 5208 IncrementalHoareTripleChecker+Invalid, 167 IncrementalHoareTripleChecker+Unknown, 1532 IncrementalHoareTripleChecker+Unchecked, 27.1s IncrementalHoareTripleChecker+Time [2023-12-02 08:36:27,000 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [1918 Valid, 1335 Invalid, 7092 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [185 Valid, 5208 Invalid, 167 Unknown, 1532 Unchecked, 27.1s Time] [2023-12-02 08:36:27,009 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 5922 states. [2023-12-02 08:36:27,057 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 5922 to 2263. [2023-12-02 08:36:27,060 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 2263 states, 2255 states have (on average 2.1671840354767182) internal successors, (4887), 2262 states have internal predecessors, (4887), 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 08:36:27,065 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2263 states to 2263 states and 4887 transitions. [2023-12-02 08:36:27,065 INFO L78 Accepts]: Start accepts. Automaton has 2263 states and 4887 transitions. Word has length 53 [2023-12-02 08:36:27,065 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-12-02 08:36:27,065 INFO L495 AbstractCegarLoop]: Abstraction has 2263 states and 4887 transitions. [2023-12-02 08:36:27,066 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 38 states, 37 states have (on average 2.108108108108108) internal successors, (78), 37 states have internal predecessors, (78), 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 08:36:27,066 INFO L276 IsEmpty]: Start isEmpty. Operand 2263 states and 4887 transitions. [2023-12-02 08:36:27,068 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 54 [2023-12-02 08:36:27,069 INFO L187 NwaCegarLoop]: Found error trace [2023-12-02 08:36:27,069 INFO L195 NwaCegarLoop]: trace histogram [10, 10, 10, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-12-02 08:36:27,073 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_72ec9ce2-d26b-43c5-a264-de0e9bf99c34/bin/utaipan-verify-nQ1chXbOIh/z3 -smt2 -in SMTLIB2_COMPLIANT=true (19)] Forceful destruction successful, exit code 0 [2023-12-02 08:36:27,269 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 19 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_72ec9ce2-d26b-43c5-a264-de0e9bf99c34/bin/utaipan-verify-nQ1chXbOIh/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable33 [2023-12-02 08:36:27,269 INFO L420 AbstractCegarLoop]: === Iteration 35 === Targeting ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 12 more)] === [2023-12-02 08:36:27,270 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-12-02 08:36:27,270 INFO L85 PathProgramCache]: Analyzing trace with hash 575874053, now seen corresponding path program 7 times [2023-12-02 08:36:27,270 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2023-12-02 08:36:27,270 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1047401239] [2023-12-02 08:36:27,270 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-02 08:36:27,270 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-12-02 08:36:27,288 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-02 08:36:27,937 INFO L134 CoverageAnalysis]: Checked inductivity of 149 backedges. 0 proven. 4 refuted. 0 times theorem prover too weak. 145 trivial. 0 not checked. [2023-12-02 08:36:27,938 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2023-12-02 08:36:27,938 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1047401239] [2023-12-02 08:36:27,938 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1047401239] provided 0 perfect and 1 imperfect interpolant sequences [2023-12-02 08:36:27,938 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1850397713] [2023-12-02 08:36:27,938 INFO L93 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2023-12-02 08:36:27,938 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-12-02 08:36:27,938 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_72ec9ce2-d26b-43c5-a264-de0e9bf99c34/bin/utaipan-verify-nQ1chXbOIh/z3 [2023-12-02 08:36:27,939 INFO L229 MonitoredProcess]: Starting monitored process 20 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_72ec9ce2-d26b-43c5-a264-de0e9bf99c34/bin/utaipan-verify-nQ1chXbOIh/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2023-12-02 08:36:27,944 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_72ec9ce2-d26b-43c5-a264-de0e9bf99c34/bin/utaipan-verify-nQ1chXbOIh/z3 -smt2 -in SMTLIB2_COMPLIANT=true (20)] Waiting until timeout for monitored process [2023-12-02 08:36:28,060 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-02 08:36:28,062 INFO L262 TraceCheckSpWp]: Trace formula consists of 252 conjuncts, 44 conjunts are in the unsatisfiable core [2023-12-02 08:36:28,064 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-12-02 08:36:28,070 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 7 treesize of output 6 [2023-12-02 08:36:28,307 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-12-02 08:36:28,308 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 10 [2023-12-02 08:36:28,445 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 22 treesize of output 17 [2023-12-02 08:36:28,781 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 29 treesize of output 22 [2023-12-02 08:36:28,820 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 21 treesize of output 15 [2023-12-02 08:36:28,878 INFO L134 CoverageAnalysis]: Checked inductivity of 149 backedges. 0 proven. 4 refuted. 0 times theorem prover too weak. 145 trivial. 0 not checked. [2023-12-02 08:36:28,878 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2023-12-02 08:36:30,055 INFO L134 CoverageAnalysis]: Checked inductivity of 149 backedges. 0 proven. 4 refuted. 0 times theorem prover too weak. 145 trivial. 0 not checked. [2023-12-02 08:36:30,055 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1850397713] provided 0 perfect and 2 imperfect interpolant sequences [2023-12-02 08:36:30,055 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSifa [1159729417] [2023-12-02 08:36:30,056 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 08:36:30,056 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2023-12-02 08:36:30,056 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [13, 12, 11] total 36 [2023-12-02 08:36:30,056 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [498048127] [2023-12-02 08:36:30,056 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2023-12-02 08:36:30,057 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 38 states [2023-12-02 08:36:30,057 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2023-12-02 08:36:30,057 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 38 interpolants. [2023-12-02 08:36:30,057 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=165, Invalid=1234, Unknown=7, NotChecked=0, Total=1406 [2023-12-02 08:36:30,058 INFO L87 Difference]: Start difference. First operand 2263 states and 4887 transitions. Second operand has 38 states, 37 states have (on average 2.108108108108108) internal successors, (78), 37 states have internal predecessors, (78), 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)