./Ultimate.py --spec ../../sv-benchmarks/c/properties/no-overflow.prp --file ../../sv-benchmarks/c/goblint-regression/06-symbeq_05-funloop_hard2.i --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for overflows Using default analysis Version b5237d83 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_ff69d8cc-fe65-417d-aa30-ee22f35513bc/bin/utaipan-g80aRyZoba/data/config -Xmx15G -Xms4m -jar /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_ff69d8cc-fe65-417d-aa30-ee22f35513bc/bin/utaipan-g80aRyZoba/plugins/org.eclipse.equinox.launcher_1.5.800.v20200727-1323.jar -data @noDefault -ultimatedata /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_ff69d8cc-fe65-417d-aa30-ee22f35513bc/bin/utaipan-g80aRyZoba/data -tc /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_ff69d8cc-fe65-417d-aa30-ee22f35513bc/bin/utaipan-g80aRyZoba/config/TaipanReach.xml -i ../../sv-benchmarks/c/goblint-regression/06-symbeq_05-funloop_hard2.i -s /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_ff69d8cc-fe65-417d-aa30-ee22f35513bc/bin/utaipan-g80aRyZoba/config/svcomp-Overflow-32bit-Taipan_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_ff69d8cc-fe65-417d-aa30-ee22f35513bc/bin/utaipan-g80aRyZoba --witnessprinter.witness.filename witness.graphml --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 9e83a031749850377e0f1ecd2c361048b8f87f697f146600048034d31c93bd9a --- Real Ultimate output --- [0.001s][warning][os,container] Duplicate cpuset controllers detected. Picking /sys/fs/cgroup/cpuset, skipping /sys/fs/cgroup/cpuset. This is Ultimate 0.2.2-dev-b5237d8 [2022-11-22 01:08:54,258 INFO L177 SettingsManager]: Resetting all preferences to default values... [2022-11-22 01:08:54,260 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2022-11-22 01:08:54,279 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2022-11-22 01:08:54,280 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2022-11-22 01:08:54,281 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2022-11-22 01:08:54,282 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2022-11-22 01:08:54,284 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2022-11-22 01:08:54,285 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2022-11-22 01:08:54,286 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2022-11-22 01:08:54,287 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2022-11-22 01:08:54,288 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2022-11-22 01:08:54,289 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2022-11-22 01:08:54,290 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2022-11-22 01:08:54,291 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2022-11-22 01:08:54,292 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2022-11-22 01:08:54,292 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2022-11-22 01:08:54,293 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2022-11-22 01:08:54,295 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2022-11-22 01:08:54,297 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2022-11-22 01:08:54,298 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2022-11-22 01:08:54,299 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2022-11-22 01:08:54,300 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2022-11-22 01:08:54,301 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2022-11-22 01:08:54,304 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2022-11-22 01:08:54,304 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2022-11-22 01:08:54,305 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2022-11-22 01:08:54,306 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2022-11-22 01:08:54,306 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2022-11-22 01:08:54,307 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2022-11-22 01:08:54,307 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2022-11-22 01:08:54,308 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2022-11-22 01:08:54,309 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2022-11-22 01:08:54,310 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2022-11-22 01:08:54,311 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2022-11-22 01:08:54,311 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2022-11-22 01:08:54,312 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2022-11-22 01:08:54,312 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2022-11-22 01:08:54,312 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2022-11-22 01:08:54,313 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2022-11-22 01:08:54,314 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2022-11-22 01:08:54,315 INFO L101 SettingsManager]: Beginning loading settings from /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_ff69d8cc-fe65-417d-aa30-ee22f35513bc/bin/utaipan-g80aRyZoba/config/svcomp-Overflow-32bit-Taipan_Default.epf [2022-11-22 01:08:54,337 INFO L113 SettingsManager]: Loading preferences was successful [2022-11-22 01:08:54,337 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2022-11-22 01:08:54,337 INFO L136 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2022-11-22 01:08:54,338 INFO L138 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2022-11-22 01:08:54,338 INFO L136 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2022-11-22 01:08:54,338 INFO L138 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2022-11-22 01:08:54,339 INFO L138 SettingsManager]: * User list type=DISABLED [2022-11-22 01:08:54,339 INFO L136 SettingsManager]: Preferences of Abstract Interpretation differ from their defaults: [2022-11-22 01:08:54,339 INFO L138 SettingsManager]: * Explicit value domain=true [2022-11-22 01:08:54,339 INFO L138 SettingsManager]: * Abstract domain for RCFG-of-the-future=PoormanAbstractDomain [2022-11-22 01:08:54,339 INFO L138 SettingsManager]: * Octagon Domain=false [2022-11-22 01:08:54,339 INFO L138 SettingsManager]: * Abstract domain=CompoundDomain [2022-11-22 01:08:54,340 INFO L138 SettingsManager]: * Check feasibility of abstract posts with an SMT solver=true [2022-11-22 01:08:54,340 INFO L138 SettingsManager]: * Use the RCFG-of-the-future interface=true [2022-11-22 01:08:54,340 INFO L138 SettingsManager]: * Interval Domain=false [2022-11-22 01:08:54,340 INFO L136 SettingsManager]: Preferences of Sifa differ from their defaults: [2022-11-22 01:08:54,340 INFO L138 SettingsManager]: * Call Summarizer=TopInputCallSummarizer [2022-11-22 01:08:54,340 INFO L138 SettingsManager]: * Simplification Technique=POLY_PAC [2022-11-22 01:08:54,341 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2022-11-22 01:08:54,341 INFO L138 SettingsManager]: * sizeof long=4 [2022-11-22 01:08:54,341 INFO L138 SettingsManager]: * Check unreachability of error function in SV-COMP mode=false [2022-11-22 01:08:54,342 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2022-11-22 01:08:54,342 INFO L138 SettingsManager]: * sizeof POINTER=4 [2022-11-22 01:08:54,342 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2022-11-22 01:08:54,342 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2022-11-22 01:08:54,342 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2022-11-22 01:08:54,342 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2022-11-22 01:08:54,343 INFO L138 SettingsManager]: * Check absence of signed integer overflows=true [2022-11-22 01:08:54,343 INFO L138 SettingsManager]: * sizeof long double=12 [2022-11-22 01:08:54,343 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2022-11-22 01:08:54,343 INFO L138 SettingsManager]: * Use constant arrays=true [2022-11-22 01:08:54,343 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2022-11-22 01:08:54,344 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2022-11-22 01:08:54,344 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2022-11-22 01:08:54,344 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-11-22 01:08:54,344 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2022-11-22 01:08:54,344 INFO L138 SettingsManager]: * Abstract interpretation Mode=USE_PREDICATES [2022-11-22 01:08:54,344 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2022-11-22 01:08:54,345 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2022-11-22 01:08:54,345 INFO L138 SettingsManager]: * Trace refinement strategy=SIFA_TAIPAN [2022-11-22 01:08:54,345 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2022-11-22 01:08:54,345 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2022-11-22 01:08:54,345 INFO L138 SettingsManager]: * Trace refinement exception blacklist=NONE [2022-11-22 01:08:54,345 INFO L138 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode 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_ff69d8cc-fe65-417d-aa30-ee22f35513bc/bin/utaipan-g80aRyZoba/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_ff69d8cc-fe65-417d-aa30-ee22f35513bc/bin/utaipan-g80aRyZoba Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Witness filename -> witness.graphml 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 -> 9e83a031749850377e0f1ecd2c361048b8f87f697f146600048034d31c93bd9a [2022-11-22 01:08:54,656 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2022-11-22 01:08:54,690 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2022-11-22 01:08:54,693 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2022-11-22 01:08:54,695 INFO L271 PluginConnector]: Initializing CDTParser... [2022-11-22 01:08:54,696 INFO L275 PluginConnector]: CDTParser initialized [2022-11-22 01:08:54,697 INFO L432 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_ff69d8cc-fe65-417d-aa30-ee22f35513bc/bin/utaipan-g80aRyZoba/../../sv-benchmarks/c/goblint-regression/06-symbeq_05-funloop_hard2.i [2022-11-22 01:08:57,791 INFO L500 CDTParser]: Created temporary CDT project at NULL [2022-11-22 01:08:58,135 INFO L351 CDTParser]: Found 1 translation units. [2022-11-22 01:08:58,135 INFO L172 CDTParser]: Scanning /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_ff69d8cc-fe65-417d-aa30-ee22f35513bc/sv-benchmarks/c/goblint-regression/06-symbeq_05-funloop_hard2.i [2022-11-22 01:08:58,167 INFO L394 CDTParser]: About to delete temporary CDT project at /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_ff69d8cc-fe65-417d-aa30-ee22f35513bc/bin/utaipan-g80aRyZoba/data/ad8e839b9/14ef71b4a8344d63ad5d97de8e67941f/FLAG364ac52d1 [2022-11-22 01:08:58,183 INFO L402 CDTParser]: Successfully deleted /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_ff69d8cc-fe65-417d-aa30-ee22f35513bc/bin/utaipan-g80aRyZoba/data/ad8e839b9/14ef71b4a8344d63ad5d97de8e67941f [2022-11-22 01:08:58,186 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2022-11-22 01:08:58,187 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2022-11-22 01:08:58,189 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2022-11-22 01:08:58,189 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2022-11-22 01:08:58,194 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2022-11-22 01:08:58,195 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 22.11 01:08:58" (1/1) ... [2022-11-22 01:08:58,196 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@7bcfcbab and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.11 01:08:58, skipping insertion in model container [2022-11-22 01:08:58,196 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 22.11 01:08:58" (1/1) ... [2022-11-22 01:08:58,205 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2022-11-22 01:08:58,242 INFO L178 MainTranslator]: Built tables and reachable declarations [2022-11-22 01:08:58,845 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-11-22 01:08:58,875 INFO L203 MainTranslator]: Completed pre-run [2022-11-22 01:08:58,941 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-11-22 01:08:59,001 INFO L208 MainTranslator]: Completed translation [2022-11-22 01:08:59,001 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.11 01:08:59 WrapperNode [2022-11-22 01:08:59,002 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2022-11-22 01:08:59,003 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2022-11-22 01:08:59,003 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2022-11-22 01:08:59,004 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2022-11-22 01:08:59,011 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.11 01:08:59" (1/1) ... [2022-11-22 01:08:59,046 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.11 01:08:59" (1/1) ... [2022-11-22 01:08:59,082 INFO L138 Inliner]: procedures = 262, calls = 16, calls flagged for inlining = 4, calls inlined = 4, statements flattened = 91 [2022-11-22 01:08:59,083 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2022-11-22 01:08:59,084 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2022-11-22 01:08:59,084 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2022-11-22 01:08:59,084 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2022-11-22 01:08:59,094 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.11 01:08:59" (1/1) ... [2022-11-22 01:08:59,094 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.11 01:08:59" (1/1) ... [2022-11-22 01:08:59,111 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.11 01:08:59" (1/1) ... [2022-11-22 01:08:59,119 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.11 01:08:59" (1/1) ... [2022-11-22 01:08:59,126 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.11 01:08:59" (1/1) ... [2022-11-22 01:08:59,129 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.11 01:08:59" (1/1) ... [2022-11-22 01:08:59,141 INFO L185 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.11 01:08:59" (1/1) ... [2022-11-22 01:08:59,142 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.11 01:08:59" (1/1) ... [2022-11-22 01:08:59,144 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2022-11-22 01:08:59,145 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2022-11-22 01:08:59,145 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2022-11-22 01:08:59,145 INFO L275 PluginConnector]: RCFGBuilder initialized [2022-11-22 01:08:59,146 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.11 01:08:59" (1/1) ... [2022-11-22 01:08:59,159 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-11-22 01:08:59,172 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_ff69d8cc-fe65-417d-aa30-ee22f35513bc/bin/utaipan-g80aRyZoba/z3 [2022-11-22 01:08:59,188 INFO L229 MonitoredProcess]: Starting monitored process 1 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_ff69d8cc-fe65-417d-aa30-ee22f35513bc/bin/utaipan-g80aRyZoba/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (exit command is (exit), workingDir is null) [2022-11-22 01:08:59,204 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_ff69d8cc-fe65-417d-aa30-ee22f35513bc/bin/utaipan-g80aRyZoba/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (1)] Waiting until timeout for monitored process [2022-11-22 01:08:59,238 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2022-11-22 01:08:59,239 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2022-11-22 01:08:59,239 INFO L130 BoogieDeclarations]: Found specification of procedure read~int [2022-11-22 01:08:59,239 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2022-11-22 01:08:59,239 INFO L130 BoogieDeclarations]: Found specification of procedure #PthreadsMutexLock [2022-11-22 01:08:59,240 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2022-11-22 01:08:59,240 INFO L130 BoogieDeclarations]: Found specification of procedure t_fun [2022-11-22 01:08:59,240 INFO L138 BoogieDeclarations]: Found implementation of procedure t_fun [2022-11-22 01:08:59,240 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2022-11-22 01:08:59,240 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2022-11-22 01:08:59,242 WARN L209 CfgBuilder]: User set CodeBlockSize to LoopFreeBlock but program contains fork statements. Overwriting the user preferences and setting CodeBlockSize to SingleStatement [2022-11-22 01:08:59,412 INFO L235 CfgBuilder]: Building ICFG [2022-11-22 01:08:59,414 INFO L261 CfgBuilder]: Building CFG for each procedure with an implementation [2022-11-22 01:08:59,655 INFO L276 CfgBuilder]: Performing block encoding [2022-11-22 01:08:59,662 INFO L295 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2022-11-22 01:08:59,663 INFO L300 CfgBuilder]: Removed 3 assume(true) statements. [2022-11-22 01:08:59,665 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 22.11 01:08:59 BoogieIcfgContainer [2022-11-22 01:08:59,665 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2022-11-22 01:08:59,668 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2022-11-22 01:08:59,668 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2022-11-22 01:08:59,672 INFO L275 PluginConnector]: TraceAbstraction initialized [2022-11-22 01:08:59,672 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 22.11 01:08:58" (1/3) ... [2022-11-22 01:08:59,673 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@25632aae and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 22.11 01:08:59, skipping insertion in model container [2022-11-22 01:08:59,673 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.11 01:08:59" (2/3) ... [2022-11-22 01:08:59,673 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@25632aae and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 22.11 01:08:59, skipping insertion in model container [2022-11-22 01:08:59,674 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 22.11 01:08:59" (3/3) ... [2022-11-22 01:08:59,675 INFO L112 eAbstractionObserver]: Analyzing ICFG 06-symbeq_05-funloop_hard2.i [2022-11-22 01:08:59,684 WARN L145 ceAbstractionStarter]: Switching off computation of Hoare annotation because input is a concurrent program [2022-11-22 01:08:59,695 INFO L203 ceAbstractionStarter]: Automizer settings: Hoare:false NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2022-11-22 01:08:59,697 INFO L162 ceAbstractionStarter]: Applying trace abstraction to program that has 12 error locations. [2022-11-22 01:08:59,698 INFO L515 ceAbstractionStarter]: Constructing petrified ICFG for 1 thread instances. [2022-11-22 01:08:59,788 INFO L144 ThreadInstanceAdder]: Constructed 0 joinOtherThreadTransitions. [2022-11-22 01:08:59,823 INFO L115 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-11-22 01:08:59,845 INFO L131 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 108 places, 110 transitions, 225 flow [2022-11-22 01:08:59,851 INFO L113 LiptonReduction]: Starting Lipton reduction on Petri net that has 108 places, 110 transitions, 225 flow [2022-11-22 01:08:59,856 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 108 places, 110 transitions, 225 flow [2022-11-22 01:08:59,934 INFO L130 PetriNetUnfolder]: 6/109 cut-off events. [2022-11-22 01:08:59,936 INFO L131 PetriNetUnfolder]: For 0/0 co-relation queries the response was YES. [2022-11-22 01:08:59,943 INFO L83 FinitePrefix]: Finished finitePrefix Result has 113 conditions, 109 events. 6/109 cut-off events. For 0/0 co-relation queries the response was YES. Maximal size of possible extension queue 5. Compared 201 event pairs, 0 based on Foata normal form. 0/91 useless extension candidates. Maximal degree in co-relation 80. Up to 2 conditions per place. [2022-11-22 01:08:59,947 INFO L119 LiptonReduction]: Number of co-enabled transitions 3072 [2022-11-22 01:09:03,410 INFO L134 LiptonReduction]: Checked pairs total: 4494 [2022-11-22 01:09:03,410 INFO L136 LiptonReduction]: Total number of compositions: 109 [2022-11-22 01:09:03,419 INFO L113 iNet2FiniteAutomaton]: Start petriNet2FiniteAutomaton. Operand has 33 places, 32 transitions, 69 flow [2022-11-22 01:09:03,444 INFO L135 iNet2FiniteAutomaton]: Finished petriNet2FiniteAutomaton. Result has 153 states, 116 states have (on average 2.603448275862069) internal successors, (302), 152 states have internal predecessors, (302), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-22 01:09:03,464 INFO L356 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2022-11-22 01:09:03,472 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=LoopsAndPotentialCycles, 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;@5e3854b6, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2022-11-22 01:09:03,472 INFO L358 AbstractCegarLoop]: Starting to check reachability of 17 error locations. [2022-11-22 01:09:03,475 INFO L276 IsEmpty]: Start isEmpty. Operand has 153 states, 116 states have (on average 2.603448275862069) internal successors, (302), 152 states have internal predecessors, (302), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-22 01:09:03,481 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 3 [2022-11-22 01:09:03,481 INFO L187 NwaCegarLoop]: Found error trace [2022-11-22 01:09:03,482 INFO L195 NwaCegarLoop]: trace histogram [1, 1] [2022-11-22 01:09:03,482 INFO L420 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr6ASSERT_VIOLATIONINTEGER_OVERFLOW (and 14 more)] === [2022-11-22 01:09:03,488 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-22 01:09:03,489 INFO L85 PathProgramCache]: Analyzing trace with hash 13452, now seen corresponding path program 1 times [2022-11-22 01:09:03,500 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2022-11-22 01:09:03,501 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1016790572] [2022-11-22 01:09:03,501 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-22 01:09:03,502 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-22 01:09:03,616 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-22 01:09:03,713 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-11-22 01:09:03,714 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2022-11-22 01:09:03,714 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1016790572] [2022-11-22 01:09:03,715 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1016790572] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-22 01:09:03,715 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-22 01:09:03,716 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2022-11-22 01:09:03,717 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [516881353] [2022-11-22 01:09:03,718 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-22 01:09:03,722 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-11-22 01:09:03,723 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2022-11-22 01:09:03,747 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-11-22 01:09:03,747 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-11-22 01:09:03,751 INFO L87 Difference]: Start difference. First operand has 153 states, 116 states have (on average 2.603448275862069) internal successors, (302), 152 states have internal predecessors, (302), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Second operand has 3 states, 2 states have (on average 1.0) internal successors, (2), 2 states have internal predecessors, (2), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-22 01:09:03,855 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-22 01:09:03,856 INFO L93 Difference]: Finished difference Result 151 states and 300 transitions. [2022-11-22 01:09:03,858 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-11-22 01:09:03,859 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 2 states have (on average 1.0) internal successors, (2), 2 states have internal predecessors, (2), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 2 [2022-11-22 01:09:03,859 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-22 01:09:03,876 INFO L225 Difference]: With dead ends: 151 [2022-11-22 01:09:03,877 INFO L226 Difference]: Without dead ends: 150 [2022-11-22 01:09:03,878 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 1 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-11-22 01:09:03,884 INFO L413 NwaCegarLoop]: 0 mSDtfsCounter, 27 mSDsluCounter, 0 mSDsCounter, 0 mSdLazyCounter, 29 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 27 SdHoareTripleChecker+Valid, 0 SdHoareTripleChecker+Invalid, 30 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 29 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-11-22 01:09:03,889 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [27 Valid, 0 Invalid, 30 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 29 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-11-22 01:09:03,911 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 150 states. [2022-11-22 01:09:03,948 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 150 to 150. [2022-11-22 01:09:03,953 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 150 states, 116 states have (on average 2.5689655172413794) internal successors, (298), 149 states have internal predecessors, (298), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-22 01:09:03,961 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 150 states to 150 states and 298 transitions. [2022-11-22 01:09:03,962 INFO L78 Accepts]: Start accepts. Automaton has 150 states and 298 transitions. Word has length 2 [2022-11-22 01:09:03,962 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-22 01:09:03,963 INFO L495 AbstractCegarLoop]: Abstraction has 150 states and 298 transitions. [2022-11-22 01:09:03,963 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 2 states have (on average 1.0) internal successors, (2), 2 states have internal predecessors, (2), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-22 01:09:03,963 INFO L276 IsEmpty]: Start isEmpty. Operand 150 states and 298 transitions. [2022-11-22 01:09:03,963 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 6 [2022-11-22 01:09:03,963 INFO L187 NwaCegarLoop]: Found error trace [2022-11-22 01:09:03,964 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1] [2022-11-22 01:09:03,964 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2022-11-22 01:09:03,964 INFO L420 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr7ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr6ASSERT_VIOLATIONINTEGER_OVERFLOW (and 14 more)] === [2022-11-22 01:09:03,965 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-22 01:09:03,965 INFO L85 PathProgramCache]: Analyzing trace with hash 401239678, now seen corresponding path program 1 times [2022-11-22 01:09:03,965 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2022-11-22 01:09:03,965 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [570665675] [2022-11-22 01:09:03,965 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-22 01:09:03,965 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-22 01:09:03,987 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-22 01:09:04,038 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-11-22 01:09:04,038 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2022-11-22 01:09:04,039 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [570665675] [2022-11-22 01:09:04,039 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [570665675] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-22 01:09:04,039 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-22 01:09:04,041 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2022-11-22 01:09:04,042 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [409326143] [2022-11-22 01:09:04,043 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-22 01:09:04,044 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-11-22 01:09:04,045 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2022-11-22 01:09:04,046 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-11-22 01:09:04,047 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-11-22 01:09:04,047 INFO L87 Difference]: Start difference. First operand 150 states and 298 transitions. Second operand has 3 states, 3 states have (on average 1.6666666666666667) internal successors, (5), 2 states have internal predecessors, (5), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-22 01:09:04,103 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-22 01:09:04,103 INFO L93 Difference]: Finished difference Result 151 states and 299 transitions. [2022-11-22 01:09:04,103 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-11-22 01:09:04,104 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 1.6666666666666667) internal successors, (5), 2 states have internal predecessors, (5), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 5 [2022-11-22 01:09:04,104 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-22 01:09:04,105 INFO L225 Difference]: With dead ends: 151 [2022-11-22 01:09:04,105 INFO L226 Difference]: Without dead ends: 151 [2022-11-22 01:09:04,106 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 [2022-11-22 01:09:04,107 INFO L413 NwaCegarLoop]: 0 mSDtfsCounter, 0 mSDsluCounter, 0 mSDsCounter, 0 mSdLazyCounter, 57 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 0 SdHoareTripleChecker+Invalid, 57 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 57 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-11-22 01:09:04,107 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 0 Invalid, 57 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 57 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-11-22 01:09:04,109 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 151 states. [2022-11-22 01:09:04,117 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 151 to 151. [2022-11-22 01:09:04,118 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 151 states, 117 states have (on average 2.5555555555555554) internal successors, (299), 150 states have internal predecessors, (299), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-22 01:09:04,119 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 151 states to 151 states and 299 transitions. [2022-11-22 01:09:04,119 INFO L78 Accepts]: Start accepts. Automaton has 151 states and 299 transitions. Word has length 5 [2022-11-22 01:09:04,119 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-22 01:09:04,119 INFO L495 AbstractCegarLoop]: Abstraction has 151 states and 299 transitions. [2022-11-22 01:09:04,120 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 1.6666666666666667) internal successors, (5), 2 states have internal predecessors, (5), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-22 01:09:04,120 INFO L276 IsEmpty]: Start isEmpty. Operand 151 states and 299 transitions. [2022-11-22 01:09:04,120 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 7 [2022-11-22 01:09:04,120 INFO L187 NwaCegarLoop]: Found error trace [2022-11-22 01:09:04,121 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1] [2022-11-22 01:09:04,121 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2022-11-22 01:09:04,121 INFO L420 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr7ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr6ASSERT_VIOLATIONINTEGER_OVERFLOW (and 14 more)] === [2022-11-22 01:09:04,121 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-22 01:09:04,122 INFO L85 PathProgramCache]: Analyzing trace with hash -438177807, now seen corresponding path program 1 times [2022-11-22 01:09:04,122 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2022-11-22 01:09:04,122 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [962230917] [2022-11-22 01:09:04,122 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-22 01:09:04,123 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-22 01:09:04,140 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-22 01:09:04,231 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-11-22 01:09:04,231 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2022-11-22 01:09:04,232 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [962230917] [2022-11-22 01:09:04,232 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [962230917] provided 0 perfect and 1 imperfect interpolant sequences [2022-11-22 01:09:04,232 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [351370779] [2022-11-22 01:09:04,232 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-22 01:09:04,233 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-11-22 01:09:04,233 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_ff69d8cc-fe65-417d-aa30-ee22f35513bc/bin/utaipan-g80aRyZoba/z3 [2022-11-22 01:09:04,239 INFO L229 MonitoredProcess]: Starting monitored process 2 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_ff69d8cc-fe65-417d-aa30-ee22f35513bc/bin/utaipan-g80aRyZoba/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-11-22 01:09:04,272 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_ff69d8cc-fe65-417d-aa30-ee22f35513bc/bin/utaipan-g80aRyZoba/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Waiting until timeout for monitored process [2022-11-22 01:09:04,341 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-22 01:09:04,343 INFO L263 TraceCheckSpWp]: Trace formula consists of 72 conjuncts, 2 conjunts are in the unsatisfiable core [2022-11-22 01:09:04,347 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-11-22 01:09:04,375 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2022-11-22 01:09:04,375 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-11-22 01:09:04,376 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [351370779] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-22 01:09:04,376 INFO L184 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2022-11-22 01:09:04,376 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [3] total 5 [2022-11-22 01:09:04,376 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1084297589] [2022-11-22 01:09:04,376 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-22 01:09:04,377 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-11-22 01:09:04,377 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2022-11-22 01:09:04,377 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-11-22 01:09:04,378 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2022-11-22 01:09:04,378 INFO L87 Difference]: Start difference. First operand 151 states and 299 transitions. Second operand has 3 states, 2 states have (on average 3.0) internal successors, (6), 3 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) [2022-11-22 01:09:04,464 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-22 01:09:04,465 INFO L93 Difference]: Finished difference Result 211 states and 429 transitions. [2022-11-22 01:09:04,474 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-11-22 01:09:04,474 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 2 states have (on average 3.0) internal successors, (6), 3 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 [2022-11-22 01:09:04,474 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-22 01:09:04,476 INFO L225 Difference]: With dead ends: 211 [2022-11-22 01:09:04,476 INFO L226 Difference]: Without dead ends: 211 [2022-11-22 01:09:04,476 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 5 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2022-11-22 01:09:04,477 INFO L413 NwaCegarLoop]: 0 mSDtfsCounter, 16 mSDsluCounter, 0 mSDsCounter, 0 mSdLazyCounter, 66 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 16 SdHoareTripleChecker+Valid, 0 SdHoareTripleChecker+Invalid, 69 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 66 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-11-22 01:09:04,478 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [16 Valid, 0 Invalid, 69 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 66 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-11-22 01:09:04,479 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 211 states. [2022-11-22 01:09:04,488 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 211 to 191. [2022-11-22 01:09:04,489 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 191 states, 157 states have (on average 2.605095541401274) internal successors, (409), 190 states have internal predecessors, (409), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-22 01:09:04,490 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 191 states to 191 states and 409 transitions. [2022-11-22 01:09:04,490 INFO L78 Accepts]: Start accepts. Automaton has 191 states and 409 transitions. Word has length 6 [2022-11-22 01:09:04,490 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-22 01:09:04,507 INFO L495 AbstractCegarLoop]: Abstraction has 191 states and 409 transitions. [2022-11-22 01:09:04,507 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 2 states have (on average 3.0) internal successors, (6), 3 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) [2022-11-22 01:09:04,507 INFO L276 IsEmpty]: Start isEmpty. Operand 191 states and 409 transitions. [2022-11-22 01:09:04,507 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 7 [2022-11-22 01:09:04,508 INFO L187 NwaCegarLoop]: Found error trace [2022-11-22 01:09:04,508 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1] [2022-11-22 01:09:04,524 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_ff69d8cc-fe65-417d-aa30-ee22f35513bc/bin/utaipan-g80aRyZoba/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Ended with exit code 0 [2022-11-22 01:09:04,708 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2,2 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_ff69d8cc-fe65-417d-aa30-ee22f35513bc/bin/utaipan-g80aRyZoba/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-11-22 01:09:04,709 INFO L420 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr3ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr6ASSERT_VIOLATIONINTEGER_OVERFLOW (and 14 more)] === [2022-11-22 01:09:04,709 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-22 01:09:04,710 INFO L85 PathProgramCache]: Analyzing trace with hash -438177803, now seen corresponding path program 1 times [2022-11-22 01:09:04,710 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2022-11-22 01:09:04,710 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2130166796] [2022-11-22 01:09:04,710 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-22 01:09:04,710 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-22 01:09:04,737 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-22 01:09:04,821 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-11-22 01:09:04,821 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2022-11-22 01:09:04,822 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2130166796] [2022-11-22 01:09:04,822 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2130166796] provided 0 perfect and 1 imperfect interpolant sequences [2022-11-22 01:09:04,822 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [688836071] [2022-11-22 01:09:04,822 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-22 01:09:04,823 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-11-22 01:09:04,823 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_ff69d8cc-fe65-417d-aa30-ee22f35513bc/bin/utaipan-g80aRyZoba/z3 [2022-11-22 01:09:04,824 INFO L229 MonitoredProcess]: Starting monitored process 3 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_ff69d8cc-fe65-417d-aa30-ee22f35513bc/bin/utaipan-g80aRyZoba/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-11-22 01:09:04,843 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_ff69d8cc-fe65-417d-aa30-ee22f35513bc/bin/utaipan-g80aRyZoba/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Waiting until timeout for monitored process [2022-11-22 01:09:04,897 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-22 01:09:04,898 INFO L263 TraceCheckSpWp]: Trace formula consists of 80 conjuncts, 3 conjunts are in the unsatisfiable core [2022-11-22 01:09:04,899 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-11-22 01:09:04,927 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-11-22 01:09:04,927 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-11-22 01:09:04,963 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-11-22 01:09:04,963 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [688836071] provided 0 perfect and 2 imperfect interpolant sequences [2022-11-22 01:09:04,963 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSifa [1472438577] [2022-11-22 01:09:04,972 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:266) at de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.tracehandling.AutomatonFreeRefinementEngine.generateProof(AutomatonFreeRefinementEngine.java:147) 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:336) 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:168) at de.uni_freiburg.informatik.ultimate.core.coreplugin.PluginConnector.runTool(PluginConnector.java:151) at de.uni_freiburg.informatik.ultimate.core.coreplugin.PluginConnector.run(PluginConnector.java:128) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.executePluginConnector(ToolchainWalker.java:232) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.processPlugin(ToolchainWalker.java:226) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.walkUnprotected(ToolchainWalker.java:142) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.walk(ToolchainWalker.java:104) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainManager$Toolchain.processToolchain(ToolchainManager.java:320) 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) [2022-11-22 01:09:04,975 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-11-22 01:09:04,975 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [3, 3, 3] total 5 [2022-11-22 01:09:04,976 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1902975276] [2022-11-22 01:09:04,976 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-11-22 01:09:04,977 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2022-11-22 01:09:04,977 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2022-11-22 01:09:04,977 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2022-11-22 01:09:04,978 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=15, Unknown=0, NotChecked=0, Total=30 [2022-11-22 01:09:04,978 INFO L87 Difference]: Start difference. First operand 191 states and 409 transitions. Second operand has 6 states, 6 states have (on average 1.5) internal successors, (9), 5 states have internal predecessors, (9), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-22 01:09:05,110 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-22 01:09:05,111 INFO L93 Difference]: Finished difference Result 194 states and 412 transitions. [2022-11-22 01:09:05,111 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2022-11-22 01:09:05,112 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 1.5) internal successors, (9), 5 states have internal predecessors, (9), 0 states have call successors, (0), 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 [2022-11-22 01:09:05,112 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-22 01:09:05,113 INFO L225 Difference]: With dead ends: 194 [2022-11-22 01:09:05,114 INFO L226 Difference]: Without dead ends: 194 [2022-11-22 01:09:05,114 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 13 GetRequests, 9 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=15, Invalid=15, Unknown=0, NotChecked=0, Total=30 [2022-11-22 01:09:05,115 INFO L413 NwaCegarLoop]: 0 mSDtfsCounter, 0 mSDsluCounter, 0 mSDsCounter, 0 mSdLazyCounter, 141 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 0 SdHoareTripleChecker+Invalid, 144 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 141 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-11-22 01:09:05,116 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 0 Invalid, 144 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 141 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-11-22 01:09:05,117 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 194 states. [2022-11-22 01:09:05,126 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 194 to 194. [2022-11-22 01:09:05,127 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 194 states, 160 states have (on average 2.575) internal successors, (412), 193 states have internal predecessors, (412), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-22 01:09:05,128 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 194 states to 194 states and 412 transitions. [2022-11-22 01:09:05,129 INFO L78 Accepts]: Start accepts. Automaton has 194 states and 412 transitions. Word has length 6 [2022-11-22 01:09:05,129 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-22 01:09:05,129 INFO L495 AbstractCegarLoop]: Abstraction has 194 states and 412 transitions. [2022-11-22 01:09:05,129 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 1.5) internal successors, (9), 5 states have internal predecessors, (9), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-22 01:09:05,130 INFO L276 IsEmpty]: Start isEmpty. Operand 194 states and 412 transitions. [2022-11-22 01:09:05,130 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 10 [2022-11-22 01:09:05,130 INFO L187 NwaCegarLoop]: Found error trace [2022-11-22 01:09:05,130 INFO L195 NwaCegarLoop]: trace histogram [4, 1, 1, 1, 1, 1] [2022-11-22 01:09:05,142 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_ff69d8cc-fe65-417d-aa30-ee22f35513bc/bin/utaipan-g80aRyZoba/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Forceful destruction successful, exit code 0 [2022-11-22 01:09:05,337 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3,3 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_ff69d8cc-fe65-417d-aa30-ee22f35513bc/bin/utaipan-g80aRyZoba/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-11-22 01:09:05,337 INFO L420 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr3ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr6ASSERT_VIOLATIONINTEGER_OVERFLOW (and 14 more)] === [2022-11-22 01:09:05,337 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-22 01:09:05,338 INFO L85 PathProgramCache]: Analyzing trace with hash -1703365822, now seen corresponding path program 2 times [2022-11-22 01:09:05,338 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2022-11-22 01:09:05,338 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2025859559] [2022-11-22 01:09:05,338 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-22 01:09:05,338 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-22 01:09:05,371 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-22 01:09:05,538 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 0 proven. 10 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-11-22 01:09:05,538 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2022-11-22 01:09:05,539 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2025859559] [2022-11-22 01:09:05,539 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2025859559] provided 0 perfect and 1 imperfect interpolant sequences [2022-11-22 01:09:05,539 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [329169485] [2022-11-22 01:09:05,539 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2022-11-22 01:09:05,540 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-11-22 01:09:05,540 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_ff69d8cc-fe65-417d-aa30-ee22f35513bc/bin/utaipan-g80aRyZoba/z3 [2022-11-22 01:09:05,543 INFO L229 MonitoredProcess]: Starting monitored process 4 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_ff69d8cc-fe65-417d-aa30-ee22f35513bc/bin/utaipan-g80aRyZoba/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-11-22 01:09:05,574 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_ff69d8cc-fe65-417d-aa30-ee22f35513bc/bin/utaipan-g80aRyZoba/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Waiting until timeout for monitored process [2022-11-22 01:09:05,644 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 1 check-sat command(s) [2022-11-22 01:09:05,645 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-11-22 01:09:05,647 INFO L263 TraceCheckSpWp]: Trace formula consists of 72 conjuncts, 14 conjunts are in the unsatisfiable core [2022-11-22 01:09:05,649 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-11-22 01:09:05,693 INFO L350 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 [2022-11-22 01:09:05,792 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-22 01:09:05,821 INFO L350 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 13 treesize of output 15 [2022-11-22 01:09:05,857 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 10 trivial. 0 not checked. [2022-11-22 01:09:05,858 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-11-22 01:09:05,858 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [329169485] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-22 01:09:05,858 INFO L184 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2022-11-22 01:09:05,858 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [6] total 8 [2022-11-22 01:09:05,859 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1734473653] [2022-11-22 01:09:05,859 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-22 01:09:05,859 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-11-22 01:09:05,859 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2022-11-22 01:09:05,860 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-11-22 01:09:05,863 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=26, Invalid=46, Unknown=0, NotChecked=0, Total=72 [2022-11-22 01:09:05,863 INFO L87 Difference]: Start difference. First operand 194 states and 412 transitions. Second operand has 4 states, 3 states have (on average 2.0) internal successors, (6), 3 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) [2022-11-22 01:09:05,963 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-22 01:09:05,963 INFO L93 Difference]: Finished difference Result 225 states and 472 transitions. [2022-11-22 01:09:05,964 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-11-22 01:09:05,965 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 3 states have (on average 2.0) internal successors, (6), 3 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 9 [2022-11-22 01:09:05,966 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-22 01:09:05,969 INFO L225 Difference]: With dead ends: 225 [2022-11-22 01:09:05,970 INFO L226 Difference]: Without dead ends: 225 [2022-11-22 01:09:05,971 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 14 GetRequests, 7 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 8 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=26, Invalid=46, Unknown=0, NotChecked=0, Total=72 [2022-11-22 01:09:05,979 INFO L413 NwaCegarLoop]: 0 mSDtfsCounter, 21 mSDsluCounter, 0 mSDsCounter, 0 mSdLazyCounter, 54 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 21 SdHoareTripleChecker+Valid, 0 SdHoareTripleChecker+Invalid, 56 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 54 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-11-22 01:09:05,982 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [21 Valid, 0 Invalid, 56 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 54 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-11-22 01:09:05,984 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 225 states. [2022-11-22 01:09:06,002 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 225 to 206. [2022-11-22 01:09:06,010 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 206 states, 172 states have (on average 2.5290697674418605) internal successors, (435), 205 states have internal predecessors, (435), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-22 01:09:06,011 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 206 states to 206 states and 435 transitions. [2022-11-22 01:09:06,011 INFO L78 Accepts]: Start accepts. Automaton has 206 states and 435 transitions. Word has length 9 [2022-11-22 01:09:06,011 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-22 01:09:06,012 INFO L495 AbstractCegarLoop]: Abstraction has 206 states and 435 transitions. [2022-11-22 01:09:06,012 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 3 states have (on average 2.0) internal successors, (6), 3 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) [2022-11-22 01:09:06,012 INFO L276 IsEmpty]: Start isEmpty. Operand 206 states and 435 transitions. [2022-11-22 01:09:06,012 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 11 [2022-11-22 01:09:06,013 INFO L187 NwaCegarLoop]: Found error trace [2022-11-22 01:09:06,013 INFO L195 NwaCegarLoop]: trace histogram [4, 1, 1, 1, 1, 1, 1] [2022-11-22 01:09:06,026 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_ff69d8cc-fe65-417d-aa30-ee22f35513bc/bin/utaipan-g80aRyZoba/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Forceful destruction successful, exit code 0 [2022-11-22 01:09:06,226 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4,4 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_ff69d8cc-fe65-417d-aa30-ee22f35513bc/bin/utaipan-g80aRyZoba/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-11-22 01:09:06,227 INFO L420 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr6ASSERT_VIOLATIONINTEGER_OVERFLOW (and 14 more)] === [2022-11-22 01:09:06,227 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-22 01:09:06,228 INFO L85 PathProgramCache]: Analyzing trace with hash -1264732600, now seen corresponding path program 1 times [2022-11-22 01:09:06,228 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2022-11-22 01:09:06,228 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1271929082] [2022-11-22 01:09:06,228 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-22 01:09:06,228 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-22 01:09:06,254 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-22 01:09:06,334 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 0 proven. 10 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-11-22 01:09:06,335 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2022-11-22 01:09:06,335 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1271929082] [2022-11-22 01:09:06,335 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1271929082] provided 0 perfect and 1 imperfect interpolant sequences [2022-11-22 01:09:06,335 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [752986511] [2022-11-22 01:09:06,336 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-22 01:09:06,336 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-11-22 01:09:06,336 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_ff69d8cc-fe65-417d-aa30-ee22f35513bc/bin/utaipan-g80aRyZoba/z3 [2022-11-22 01:09:06,337 INFO L229 MonitoredProcess]: Starting monitored process 5 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_ff69d8cc-fe65-417d-aa30-ee22f35513bc/bin/utaipan-g80aRyZoba/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-11-22 01:09:06,363 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_ff69d8cc-fe65-417d-aa30-ee22f35513bc/bin/utaipan-g80aRyZoba/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Waiting until timeout for monitored process [2022-11-22 01:09:06,442 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-22 01:09:06,443 INFO L263 TraceCheckSpWp]: Trace formula consists of 106 conjuncts, 6 conjunts are in the unsatisfiable core [2022-11-22 01:09:06,445 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-11-22 01:09:06,465 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 0 proven. 10 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-11-22 01:09:06,466 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-11-22 01:09:06,545 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 0 proven. 10 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-11-22 01:09:06,546 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [752986511] provided 0 perfect and 2 imperfect interpolant sequences [2022-11-22 01:09:06,546 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSifa [10084513] [2022-11-22 01:09:06,547 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:266) at de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.tracehandling.AutomatonFreeRefinementEngine.generateProof(AutomatonFreeRefinementEngine.java:147) 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:336) 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:168) at de.uni_freiburg.informatik.ultimate.core.coreplugin.PluginConnector.runTool(PluginConnector.java:151) at de.uni_freiburg.informatik.ultimate.core.coreplugin.PluginConnector.run(PluginConnector.java:128) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.executePluginConnector(ToolchainWalker.java:232) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.processPlugin(ToolchainWalker.java:226) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.walkUnprotected(ToolchainWalker.java:142) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.walk(ToolchainWalker.java:104) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainManager$Toolchain.processToolchain(ToolchainManager.java:320) 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) [2022-11-22 01:09:06,550 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-11-22 01:09:06,550 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [6, 6, 6] total 11 [2022-11-22 01:09:06,551 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1244841962] [2022-11-22 01:09:06,551 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-11-22 01:09:06,551 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 12 states [2022-11-22 01:09:06,552 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2022-11-22 01:09:06,552 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2022-11-22 01:09:06,553 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=66, Invalid=66, Unknown=0, NotChecked=0, Total=132 [2022-11-22 01:09:06,553 INFO L87 Difference]: Start difference. First operand 206 states and 435 transitions. Second operand has 12 states, 12 states have (on average 1.3333333333333333) internal successors, (16), 11 states have internal predecessors, (16), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-22 01:09:06,680 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-22 01:09:06,680 INFO L93 Difference]: Finished difference Result 212 states and 441 transitions. [2022-11-22 01:09:06,681 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2022-11-22 01:09:06,681 INFO L78 Accepts]: Start accepts. Automaton has has 12 states, 12 states have (on average 1.3333333333333333) internal successors, (16), 11 states have internal predecessors, (16), 0 states have call successors, (0), 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 10 [2022-11-22 01:09:06,681 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-22 01:09:06,682 INFO L225 Difference]: With dead ends: 212 [2022-11-22 01:09:06,682 INFO L226 Difference]: Without dead ends: 212 [2022-11-22 01:09:06,683 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 24 GetRequests, 14 SyntacticMatches, 0 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=66, Invalid=66, Unknown=0, NotChecked=0, Total=132 [2022-11-22 01:09:06,683 INFO L413 NwaCegarLoop]: 0 mSDtfsCounter, 0 mSDsluCounter, 0 mSDsCounter, 0 mSdLazyCounter, 147 mSolverCounterSat, 7 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 0 SdHoareTripleChecker+Invalid, 154 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 7 IncrementalHoareTripleChecker+Valid, 147 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-11-22 01:09:06,684 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 0 Invalid, 154 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [7 Valid, 147 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-11-22 01:09:06,685 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 212 states. [2022-11-22 01:09:06,692 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 212 to 212. [2022-11-22 01:09:06,693 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 212 states, 178 states have (on average 2.4775280898876404) internal successors, (441), 211 states have internal predecessors, (441), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-22 01:09:06,694 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 212 states to 212 states and 441 transitions. [2022-11-22 01:09:06,694 INFO L78 Accepts]: Start accepts. Automaton has 212 states and 441 transitions. Word has length 10 [2022-11-22 01:09:06,694 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-22 01:09:06,694 INFO L495 AbstractCegarLoop]: Abstraction has 212 states and 441 transitions. [2022-11-22 01:09:06,694 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 12 states, 12 states have (on average 1.3333333333333333) internal successors, (16), 11 states have internal predecessors, (16), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-22 01:09:06,694 INFO L276 IsEmpty]: Start isEmpty. Operand 212 states and 441 transitions. [2022-11-22 01:09:06,695 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 17 [2022-11-22 01:09:06,695 INFO L187 NwaCegarLoop]: Found error trace [2022-11-22 01:09:06,695 INFO L195 NwaCegarLoop]: trace histogram [10, 1, 1, 1, 1, 1, 1] [2022-11-22 01:09:06,703 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_ff69d8cc-fe65-417d-aa30-ee22f35513bc/bin/utaipan-g80aRyZoba/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Forceful destruction successful, exit code 0 [2022-11-22 01:09:06,903 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 5 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_ff69d8cc-fe65-417d-aa30-ee22f35513bc/bin/utaipan-g80aRyZoba/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable5 [2022-11-22 01:09:06,903 INFO L420 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr6ASSERT_VIOLATIONINTEGER_OVERFLOW (and 14 more)] === [2022-11-22 01:09:06,904 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-22 01:09:06,904 INFO L85 PathProgramCache]: Analyzing trace with hash -924162264, now seen corresponding path program 2 times [2022-11-22 01:09:06,904 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2022-11-22 01:09:06,904 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1438579215] [2022-11-22 01:09:06,904 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-22 01:09:06,904 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-22 01:09:06,939 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-22 01:09:07,272 INFO L134 CoverageAnalysis]: Checked inductivity of 55 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 55 trivial. 0 not checked. [2022-11-22 01:09:07,272 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2022-11-22 01:09:07,272 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1438579215] [2022-11-22 01:09:07,272 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1438579215] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-22 01:09:07,273 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-22 01:09:07,273 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-11-22 01:09:07,273 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1880744067] [2022-11-22 01:09:07,273 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-22 01:09:07,274 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-11-22 01:09:07,274 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2022-11-22 01:09:07,274 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-11-22 01:09:07,275 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2022-11-22 01:09:07,275 INFO L87 Difference]: Start difference. First operand 212 states and 441 transitions. Second operand has 5 states, 4 states have (on average 1.75) internal successors, (7), 4 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) [2022-11-22 01:09:07,414 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-22 01:09:07,414 INFO L93 Difference]: Finished difference Result 224 states and 464 transitions. [2022-11-22 01:09:07,414 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-11-22 01:09:07,415 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 4 states have (on average 1.75) internal successors, (7), 4 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 16 [2022-11-22 01:09:07,415 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-22 01:09:07,416 INFO L225 Difference]: With dead ends: 224 [2022-11-22 01:09:07,416 INFO L226 Difference]: Without dead ends: 224 [2022-11-22 01:09:07,417 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=13, Invalid=17, Unknown=0, NotChecked=0, Total=30 [2022-11-22 01:09:07,418 INFO L413 NwaCegarLoop]: 0 mSDtfsCounter, 18 mSDsluCounter, 0 mSDsCounter, 0 mSdLazyCounter, 118 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 18 SdHoareTripleChecker+Valid, 0 SdHoareTripleChecker+Invalid, 120 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 118 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-11-22 01:09:07,418 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [18 Valid, 0 Invalid, 120 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 118 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-11-22 01:09:07,419 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 224 states. [2022-11-22 01:09:07,426 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 224 to 218. [2022-11-22 01:09:07,426 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 218 states, 184 states have (on average 2.4565217391304346) internal successors, (452), 217 states have internal predecessors, (452), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-22 01:09:07,428 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 218 states to 218 states and 452 transitions. [2022-11-22 01:09:07,428 INFO L78 Accepts]: Start accepts. Automaton has 218 states and 452 transitions. Word has length 16 [2022-11-22 01:09:07,428 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-22 01:09:07,428 INFO L495 AbstractCegarLoop]: Abstraction has 218 states and 452 transitions. [2022-11-22 01:09:07,428 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 4 states have (on average 1.75) internal successors, (7), 4 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) [2022-11-22 01:09:07,429 INFO L276 IsEmpty]: Start isEmpty. Operand 218 states and 452 transitions. [2022-11-22 01:09:07,429 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 17 [2022-11-22 01:09:07,429 INFO L187 NwaCegarLoop]: Found error trace [2022-11-22 01:09:07,430 INFO L195 NwaCegarLoop]: trace histogram [10, 1, 1, 1, 1, 1, 1] [2022-11-22 01:09:07,430 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2022-11-22 01:09:07,430 INFO L420 AbstractCegarLoop]: === Iteration 8 === Targeting t_funErr1ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr6ASSERT_VIOLATIONINTEGER_OVERFLOW (and 14 more)] === [2022-11-22 01:09:07,430 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-22 01:09:07,431 INFO L85 PathProgramCache]: Analyzing trace with hash -924161553, now seen corresponding path program 1 times [2022-11-22 01:09:07,431 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2022-11-22 01:09:07,431 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [612495292] [2022-11-22 01:09:07,431 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-22 01:09:07,431 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-22 01:09:07,463 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-22 01:09:07,636 INFO L134 CoverageAnalysis]: Checked inductivity of 55 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 55 trivial. 0 not checked. [2022-11-22 01:09:07,636 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2022-11-22 01:09:07,636 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [612495292] [2022-11-22 01:09:07,637 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [612495292] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-22 01:09:07,637 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-22 01:09:07,637 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-11-22 01:09:07,637 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1602173071] [2022-11-22 01:09:07,637 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-22 01:09:07,638 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-11-22 01:09:07,638 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2022-11-22 01:09:07,638 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-11-22 01:09:07,638 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2022-11-22 01:09:07,639 INFO L87 Difference]: Start difference. First operand 218 states and 452 transitions. Second operand has 5 states, 4 states have (on average 1.75) internal successors, (7), 4 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) [2022-11-22 01:09:07,784 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-22 01:09:07,784 INFO L93 Difference]: Finished difference Result 216 states and 448 transitions. [2022-11-22 01:09:07,785 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-11-22 01:09:07,785 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 4 states have (on average 1.75) internal successors, (7), 4 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 16 [2022-11-22 01:09:07,786 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-22 01:09:07,787 INFO L225 Difference]: With dead ends: 216 [2022-11-22 01:09:07,787 INFO L226 Difference]: Without dead ends: 216 [2022-11-22 01:09:07,787 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=13, Invalid=17, Unknown=0, NotChecked=0, Total=30 [2022-11-22 01:09:07,790 INFO L413 NwaCegarLoop]: 0 mSDtfsCounter, 13 mSDsluCounter, 0 mSDsCounter, 0 mSdLazyCounter, 115 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 13 SdHoareTripleChecker+Valid, 0 SdHoareTripleChecker+Invalid, 118 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 115 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-11-22 01:09:07,791 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [13 Valid, 0 Invalid, 118 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 115 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-11-22 01:09:07,792 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 216 states. [2022-11-22 01:09:07,797 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 216 to 214. [2022-11-22 01:09:07,797 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 214 states, 180 states have (on average 2.4722222222222223) internal successors, (445), 213 states have internal predecessors, (445), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-22 01:09:07,798 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 214 states to 214 states and 445 transitions. [2022-11-22 01:09:07,799 INFO L78 Accepts]: Start accepts. Automaton has 214 states and 445 transitions. Word has length 16 [2022-11-22 01:09:07,799 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-22 01:09:07,800 INFO L495 AbstractCegarLoop]: Abstraction has 214 states and 445 transitions. [2022-11-22 01:09:07,800 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 4 states have (on average 1.75) internal successors, (7), 4 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) [2022-11-22 01:09:07,800 INFO L276 IsEmpty]: Start isEmpty. Operand 214 states and 445 transitions. [2022-11-22 01:09:07,802 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 19 [2022-11-22 01:09:07,802 INFO L187 NwaCegarLoop]: Found error trace [2022-11-22 01:09:07,802 INFO L195 NwaCegarLoop]: trace histogram [10, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-22 01:09:07,802 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2022-11-22 01:09:07,803 INFO L420 AbstractCegarLoop]: === Iteration 9 === Targeting ULTIMATE.startErr5ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr6ASSERT_VIOLATIONINTEGER_OVERFLOW (and 14 more)] === [2022-11-22 01:09:07,803 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-22 01:09:07,803 INFO L85 PathProgramCache]: Analyzing trace with hash 938314412, now seen corresponding path program 1 times [2022-11-22 01:09:07,803 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2022-11-22 01:09:07,804 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1032483209] [2022-11-22 01:09:07,804 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-22 01:09:07,804 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-22 01:09:07,825 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-22 01:09:07,866 INFO L134 CoverageAnalysis]: Checked inductivity of 55 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 55 trivial. 0 not checked. [2022-11-22 01:09:07,866 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2022-11-22 01:09:07,867 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1032483209] [2022-11-22 01:09:07,867 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1032483209] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-22 01:09:07,867 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-22 01:09:07,867 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2022-11-22 01:09:07,868 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [152212942] [2022-11-22 01:09:07,868 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-22 01:09:07,868 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-11-22 01:09:07,868 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2022-11-22 01:09:07,869 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-11-22 01:09:07,869 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-11-22 01:09:07,869 INFO L87 Difference]: Start difference. First operand 214 states and 445 transitions. Second operand has 3 states, 2 states have (on average 4.5) internal successors, (9), 3 states have internal predecessors, (9), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-22 01:09:07,946 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-22 01:09:07,947 INFO L93 Difference]: Finished difference Result 232 states and 453 transitions. [2022-11-22 01:09:07,947 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-11-22 01:09:07,948 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 2 states have (on average 4.5) internal successors, (9), 3 states have internal predecessors, (9), 0 states have call successors, (0), 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 18 [2022-11-22 01:09:07,948 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-22 01:09:07,950 INFO L225 Difference]: With dead ends: 232 [2022-11-22 01:09:07,954 INFO L226 Difference]: Without dead ends: 232 [2022-11-22 01:09:07,954 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 [2022-11-22 01:09:07,955 INFO L413 NwaCegarLoop]: 0 mSDtfsCounter, 12 mSDsluCounter, 0 mSDsCounter, 0 mSdLazyCounter, 67 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 12 SdHoareTripleChecker+Valid, 0 SdHoareTripleChecker+Invalid, 67 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 67 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-11-22 01:09:07,956 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [12 Valid, 0 Invalid, 67 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 67 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-11-22 01:09:07,957 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 232 states. [2022-11-22 01:09:07,964 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 232 to 214. [2022-11-22 01:09:07,965 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 214 states, 180 states have (on average 2.4166666666666665) internal successors, (435), 213 states have internal predecessors, (435), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-22 01:09:07,967 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 214 states to 214 states and 435 transitions. [2022-11-22 01:09:07,967 INFO L78 Accepts]: Start accepts. Automaton has 214 states and 435 transitions. Word has length 18 [2022-11-22 01:09:07,972 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-22 01:09:07,972 INFO L495 AbstractCegarLoop]: Abstraction has 214 states and 435 transitions. [2022-11-22 01:09:07,973 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 2 states have (on average 4.5) internal successors, (9), 3 states have internal predecessors, (9), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-22 01:09:07,973 INFO L276 IsEmpty]: Start isEmpty. Operand 214 states and 435 transitions. [2022-11-22 01:09:07,974 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 19 [2022-11-22 01:09:07,975 INFO L187 NwaCegarLoop]: Found error trace [2022-11-22 01:09:07,975 INFO L195 NwaCegarLoop]: trace histogram [10, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-22 01:09:07,975 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2022-11-22 01:09:07,975 INFO L420 AbstractCegarLoop]: === Iteration 10 === Targeting t_funErr3ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr6ASSERT_VIOLATIONINTEGER_OVERFLOW (and 14 more)] === [2022-11-22 01:09:07,976 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-22 01:09:07,976 INFO L85 PathProgramCache]: Analyzing trace with hash 938917044, now seen corresponding path program 1 times [2022-11-22 01:09:07,976 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2022-11-22 01:09:07,976 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [934507682] [2022-11-22 01:09:07,977 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-22 01:09:07,977 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-22 01:09:07,995 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-22 01:09:08,038 INFO L134 CoverageAnalysis]: Checked inductivity of 55 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 55 trivial. 0 not checked. [2022-11-22 01:09:08,039 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2022-11-22 01:09:08,040 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [934507682] [2022-11-22 01:09:08,040 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [934507682] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-22 01:09:08,040 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-22 01:09:08,040 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2022-11-22 01:09:08,040 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1158882175] [2022-11-22 01:09:08,041 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-22 01:09:08,041 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-11-22 01:09:08,041 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2022-11-22 01:09:08,041 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-11-22 01:09:08,042 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-11-22 01:09:08,042 INFO L87 Difference]: Start difference. First operand 214 states and 435 transitions. Second operand has 3 states, 2 states have (on average 4.5) internal successors, (9), 3 states have internal predecessors, (9), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-22 01:09:08,119 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-22 01:09:08,119 INFO L93 Difference]: Finished difference Result 306 states and 620 transitions. [2022-11-22 01:09:08,120 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-11-22 01:09:08,120 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 2 states have (on average 4.5) internal successors, (9), 3 states have internal predecessors, (9), 0 states have call successors, (0), 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 18 [2022-11-22 01:09:08,120 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-22 01:09:08,122 INFO L225 Difference]: With dead ends: 306 [2022-11-22 01:09:08,122 INFO L226 Difference]: Without dead ends: 306 [2022-11-22 01:09:08,123 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 [2022-11-22 01:09:08,124 INFO L413 NwaCegarLoop]: 0 mSDtfsCounter, 17 mSDsluCounter, 0 mSDsCounter, 0 mSdLazyCounter, 72 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 17 SdHoareTripleChecker+Valid, 0 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 [2022-11-22 01:09:08,125 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [17 Valid, 0 Invalid, 74 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 72 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-11-22 01:09:08,126 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 306 states. [2022-11-22 01:09:08,132 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 306 to 276. [2022-11-22 01:09:08,132 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 276 states, 242 states have (on average 2.43801652892562) internal successors, (590), 275 states have internal predecessors, (590), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-22 01:09:08,134 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 276 states to 276 states and 590 transitions. [2022-11-22 01:09:08,134 INFO L78 Accepts]: Start accepts. Automaton has 276 states and 590 transitions. Word has length 18 [2022-11-22 01:09:08,134 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-22 01:09:08,135 INFO L495 AbstractCegarLoop]: Abstraction has 276 states and 590 transitions. [2022-11-22 01:09:08,135 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 2 states have (on average 4.5) internal successors, (9), 3 states have internal predecessors, (9), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-22 01:09:08,135 INFO L276 IsEmpty]: Start isEmpty. Operand 276 states and 590 transitions. [2022-11-22 01:09:08,136 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 20 [2022-11-22 01:09:08,136 INFO L187 NwaCegarLoop]: Found error trace [2022-11-22 01:09:08,136 INFO L195 NwaCegarLoop]: trace histogram [10, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-22 01:09:08,137 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9 [2022-11-22 01:09:08,137 INFO L420 AbstractCegarLoop]: === Iteration 11 === Targeting ULTIMATE.startErr7ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr6ASSERT_VIOLATIONINTEGER_OVERFLOW (and 14 more)] === [2022-11-22 01:09:08,138 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-22 01:09:08,138 INFO L85 PathProgramCache]: Analyzing trace with hash -977023667, now seen corresponding path program 1 times [2022-11-22 01:09:08,138 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2022-11-22 01:09:08,138 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [139282609] [2022-11-22 01:09:08,138 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-22 01:09:08,139 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-22 01:09:08,158 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-22 01:09:08,212 INFO L134 CoverageAnalysis]: Checked inductivity of 56 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 55 trivial. 0 not checked. [2022-11-22 01:09:08,212 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2022-11-22 01:09:08,213 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [139282609] [2022-11-22 01:09:08,213 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [139282609] provided 0 perfect and 1 imperfect interpolant sequences [2022-11-22 01:09:08,213 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [80249667] [2022-11-22 01:09:08,213 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-22 01:09:08,213 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-11-22 01:09:08,214 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_ff69d8cc-fe65-417d-aa30-ee22f35513bc/bin/utaipan-g80aRyZoba/z3 [2022-11-22 01:09:08,215 INFO L229 MonitoredProcess]: Starting monitored process 6 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_ff69d8cc-fe65-417d-aa30-ee22f35513bc/bin/utaipan-g80aRyZoba/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-11-22 01:09:08,251 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_ff69d8cc-fe65-417d-aa30-ee22f35513bc/bin/utaipan-g80aRyZoba/z3 -smt2 -in SMTLIB2_COMPLIANT=true (6)] Waiting until timeout for monitored process [2022-11-22 01:09:08,345 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-22 01:09:08,347 INFO L263 TraceCheckSpWp]: Trace formula consists of 179 conjuncts, 3 conjunts are in the unsatisfiable core [2022-11-22 01:09:08,348 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-11-22 01:09:08,373 INFO L134 CoverageAnalysis]: Checked inductivity of 56 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 55 trivial. 0 not checked. [2022-11-22 01:09:08,373 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-11-22 01:09:08,394 INFO L134 CoverageAnalysis]: Checked inductivity of 56 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 55 trivial. 0 not checked. [2022-11-22 01:09:08,394 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [80249667] provided 0 perfect and 2 imperfect interpolant sequences [2022-11-22 01:09:08,394 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSifa [382034124] [2022-11-22 01:09:08,395 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:266) at de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.tracehandling.AutomatonFreeRefinementEngine.generateProof(AutomatonFreeRefinementEngine.java:147) 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:336) 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:168) at de.uni_freiburg.informatik.ultimate.core.coreplugin.PluginConnector.runTool(PluginConnector.java:151) at de.uni_freiburg.informatik.ultimate.core.coreplugin.PluginConnector.run(PluginConnector.java:128) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.executePluginConnector(ToolchainWalker.java:232) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.processPlugin(ToolchainWalker.java:226) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.walkUnprotected(ToolchainWalker.java:142) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.walk(ToolchainWalker.java:104) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainManager$Toolchain.processToolchain(ToolchainManager.java:320) 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) [2022-11-22 01:09:08,395 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-11-22 01:09:08,395 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [3, 3, 3] total 6 [2022-11-22 01:09:08,395 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [920792073] [2022-11-22 01:09:08,396 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-11-22 01:09:08,396 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2022-11-22 01:09:08,396 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2022-11-22 01:09:08,396 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2022-11-22 01:09:08,397 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=21, Invalid=21, Unknown=0, NotChecked=0, Total=42 [2022-11-22 01:09:08,397 INFO L87 Difference]: Start difference. First operand 276 states and 590 transitions. Second operand has 7 states, 6 states have (on average 3.5) internal successors, (21), 7 states have internal predecessors, (21), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-22 01:09:08,583 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-22 01:09:08,583 INFO L93 Difference]: Finished difference Result 464 states and 1012 transitions. [2022-11-22 01:09:08,584 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2022-11-22 01:09:08,584 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 6 states have (on average 3.5) internal successors, (21), 7 states have internal predecessors, (21), 0 states have call successors, (0), 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 19 [2022-11-22 01:09:08,584 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-22 01:09:08,587 INFO L225 Difference]: With dead ends: 464 [2022-11-22 01:09:08,587 INFO L226 Difference]: Without dead ends: 464 [2022-11-22 01:09:08,587 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 39 GetRequests, 34 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=21, Invalid=21, Unknown=0, NotChecked=0, Total=42 [2022-11-22 01:09:08,588 INFO L413 NwaCegarLoop]: 0 mSDtfsCounter, 93 mSDsluCounter, 0 mSDsCounter, 0 mSdLazyCounter, 158 mSolverCounterSat, 16 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 93 SdHoareTripleChecker+Valid, 0 SdHoareTripleChecker+Invalid, 174 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 16 IncrementalHoareTripleChecker+Valid, 158 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2022-11-22 01:09:08,588 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [93 Valid, 0 Invalid, 174 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [16 Valid, 158 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2022-11-22 01:09:08,589 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 464 states. [2022-11-22 01:09:08,598 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 464 to 388. [2022-11-22 01:09:08,599 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 388 states, 359 states have (on average 2.584958217270195) internal successors, (928), 387 states have internal predecessors, (928), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-22 01:09:08,601 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 388 states to 388 states and 928 transitions. [2022-11-22 01:09:08,601 INFO L78 Accepts]: Start accepts. Automaton has 388 states and 928 transitions. Word has length 19 [2022-11-22 01:09:08,602 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-22 01:09:08,602 INFO L495 AbstractCegarLoop]: Abstraction has 388 states and 928 transitions. [2022-11-22 01:09:08,602 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 6 states have (on average 3.5) internal successors, (21), 7 states have internal predecessors, (21), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-22 01:09:08,602 INFO L276 IsEmpty]: Start isEmpty. Operand 388 states and 928 transitions. [2022-11-22 01:09:08,603 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 20 [2022-11-22 01:09:08,603 INFO L187 NwaCegarLoop]: Found error trace [2022-11-22 01:09:08,603 INFO L195 NwaCegarLoop]: trace histogram [10, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-22 01:09:08,615 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_ff69d8cc-fe65-417d-aa30-ee22f35513bc/bin/utaipan-g80aRyZoba/z3 -smt2 -in SMTLIB2_COMPLIANT=true (6)] Forceful destruction successful, exit code 0 [2022-11-22 01:09:08,809 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10,6 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_ff69d8cc-fe65-417d-aa30-ee22f35513bc/bin/utaipan-g80aRyZoba/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-11-22 01:09:08,810 INFO L420 AbstractCegarLoop]: === Iteration 12 === Targeting ULTIMATE.startErr3ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr6ASSERT_VIOLATIONINTEGER_OVERFLOW (and 14 more)] === [2022-11-22 01:09:08,810 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-22 01:09:08,810 INFO L85 PathProgramCache]: Analyzing trace with hash -977023663, now seen corresponding path program 1 times [2022-11-22 01:09:08,810 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2022-11-22 01:09:08,810 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1800799842] [2022-11-22 01:09:08,810 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-22 01:09:08,810 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-22 01:09:08,835 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-22 01:09:09,328 INFO L134 CoverageAnalysis]: Checked inductivity of 56 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 55 trivial. 0 not checked. [2022-11-22 01:09:09,329 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2022-11-22 01:09:09,329 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1800799842] [2022-11-22 01:09:09,329 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1800799842] provided 0 perfect and 1 imperfect interpolant sequences [2022-11-22 01:09:09,329 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [131789853] [2022-11-22 01:09:09,330 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-22 01:09:09,330 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-11-22 01:09:09,330 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_ff69d8cc-fe65-417d-aa30-ee22f35513bc/bin/utaipan-g80aRyZoba/z3 [2022-11-22 01:09:09,331 INFO L229 MonitoredProcess]: Starting monitored process 7 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_ff69d8cc-fe65-417d-aa30-ee22f35513bc/bin/utaipan-g80aRyZoba/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-11-22 01:09:09,355 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_ff69d8cc-fe65-417d-aa30-ee22f35513bc/bin/utaipan-g80aRyZoba/z3 -smt2 -in SMTLIB2_COMPLIANT=true (7)] Waiting until timeout for monitored process [2022-11-22 01:09:09,454 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-22 01:09:09,456 INFO L263 TraceCheckSpWp]: Trace formula consists of 187 conjuncts, 25 conjunts are in the unsatisfiable core [2022-11-22 01:09:09,459 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-11-22 01:09:09,469 INFO L350 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 [2022-11-22 01:09:09,575 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-22 01:09:09,577 INFO L350 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 13 treesize of output 15 [2022-11-22 01:09:09,653 INFO L350 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 18 treesize of output 13 [2022-11-22 01:09:14,532 INFO L134 CoverageAnalysis]: Checked inductivity of 56 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 55 trivial. 0 not checked. [2022-11-22 01:09:14,532 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-11-22 01:09:18,845 WARN L837 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_358 (Array Int Int)) (|v_ULTIMATE.start_cache_entry_addref_~entry#1.offset_109| Int) (|v_ULTIMATE.start_main_~#t1~0#1.base_44| Int) (|v_ULTIMATE.start_cache_entry_addref_~entry#1.offset_108| Int) (v_ArrVal_359 Int)) (or (< |v_ULTIMATE.start_cache_entry_addref_~entry#1.offset_108| (+ |v_ULTIMATE.start_cache_entry_addref_~entry#1.offset_109| 28)) (< 0 (+ (select (store (select (store |c_#memory_int| |v_ULTIMATE.start_main_~#t1~0#1.base_44| v_ArrVal_358) |c_~#cache~0.base|) |v_ULTIMATE.start_cache_entry_addref_~entry#1.offset_109| v_ArrVal_359) |v_ULTIMATE.start_cache_entry_addref_~entry#1.offset_108|) 2147483650)) (not (< |c_#StackHeapBarrier| |v_ULTIMATE.start_main_~#t1~0#1.base_44|)))) is different from false [2022-11-22 01:09:19,038 INFO L134 CoverageAnalysis]: Checked inductivity of 56 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 55 trivial. 0 not checked. [2022-11-22 01:09:19,038 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [131789853] provided 0 perfect and 2 imperfect interpolant sequences [2022-11-22 01:09:19,038 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSifa [594333772] [2022-11-22 01:09:19,040 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:266) at de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.tracehandling.AutomatonFreeRefinementEngine.generateProof(AutomatonFreeRefinementEngine.java:147) 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:336) 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:168) at de.uni_freiburg.informatik.ultimate.core.coreplugin.PluginConnector.runTool(PluginConnector.java:151) at de.uni_freiburg.informatik.ultimate.core.coreplugin.PluginConnector.run(PluginConnector.java:128) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.executePluginConnector(ToolchainWalker.java:232) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.processPlugin(ToolchainWalker.java:226) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.walkUnprotected(ToolchainWalker.java:142) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.walk(ToolchainWalker.java:104) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainManager$Toolchain.processToolchain(ToolchainManager.java:320) 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) [2022-11-22 01:09:19,041 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-11-22 01:09:19,041 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [6, 5, 5] total 16 [2022-11-22 01:09:19,042 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1886742929] [2022-11-22 01:09:19,042 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-11-22 01:09:19,043 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 18 states [2022-11-22 01:09:19,043 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2022-11-22 01:09:19,043 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 18 interpolants. [2022-11-22 01:09:19,044 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=92, Invalid=178, Unknown=6, NotChecked=30, Total=306 [2022-11-22 01:09:19,044 INFO L87 Difference]: Start difference. First operand 388 states and 928 transitions. Second operand has 18 states, 17 states have (on average 1.7647058823529411) internal successors, (30), 17 states have internal predecessors, (30), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-22 01:09:20,999 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.95s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2022-11-22 01:09:23,037 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] [2022-11-22 01:09:24,996 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.91s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2022-11-22 01:09:26,695 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.69s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2022-11-22 01:09:28,319 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] [2022-11-22 01:09:30,080 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] [2022-11-22 01:09:31,882 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.79s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2022-11-22 01:09:35,823 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] [2022-11-22 01:09:37,829 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] [2022-11-22 01:09:41,414 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] [2022-11-22 01:09:43,348 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] [2022-11-22 01:09:45,257 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.90s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2022-11-22 01:09:49,361 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] [2022-11-22 01:09:51,182 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.79s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2022-11-22 01:09:57,036 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.97s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2022-11-22 01:09:59,057 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] [2022-11-22 01:10:11,853 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] [2022-11-22 01:10:22,049 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] [2022-11-22 01:10:24,055 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] [2022-11-22 01:10:26,073 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 [1] [2022-11-22 01:10:36,187 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] [2022-11-22 01:10:38,192 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] [2022-11-22 01:10:40,311 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] [2022-11-22 01:10:42,317 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] [2022-11-22 01:10:44,328 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] [2022-11-22 01:10:46,337 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] [2022-11-22 01:10:48,350 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] [2022-11-22 01:10:50,355 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] [2022-11-22 01:10:52,367 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] [2022-11-22 01:10:54,462 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] [2022-11-22 01:10:56,473 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] [2022-11-22 01:10:58,491 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.01s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2022-11-22 01:11:00,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] [2022-11-22 01:11:02,512 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] [2022-11-22 01:11:04,562 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2022-11-22 01:11:06,575 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] [2022-11-22 01:11:08,582 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] [2022-11-22 01:11:10,605 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] [2022-11-22 01:11:12,653 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] [2022-11-22 01:11:12,760 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-22 01:11:12,761 INFO L93 Difference]: Finished difference Result 514 states and 1113 transitions. [2022-11-22 01:11:12,761 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 16 states. [2022-11-22 01:11:12,762 INFO L78 Accepts]: Start accepts. Automaton has has 18 states, 17 states have (on average 1.7647058823529411) internal successors, (30), 17 states have internal predecessors, (30), 0 states have call successors, (0), 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 19 [2022-11-22 01:11:12,762 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-22 01:11:12,765 INFO L225 Difference]: With dead ends: 514 [2022-11-22 01:11:12,765 INFO L226 Difference]: Without dead ends: 514 [2022-11-22 01:11:12,765 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 55 GetRequests, 26 SyntacticMatches, 2 SemanticMatches, 27 ConstructedPredicates, 1 IntricatePredicates, 0 DeprecatedPredicates, 240 ImplicationChecksByTransitivity, 45.2s TimeCoverageRelationStatistics Valid=252, Invalid=487, Unknown=21, NotChecked=52, Total=812 [2022-11-22 01:11:12,766 INFO L413 NwaCegarLoop]: 0 mSDtfsCounter, 222 mSDsluCounter, 0 mSDsCounter, 0 mSdLazyCounter, 357 mSolverCounterSat, 42 mSolverCounterUnsat, 39 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 77.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 222 SdHoareTripleChecker+Valid, 0 SdHoareTripleChecker+Invalid, 516 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 42 IncrementalHoareTripleChecker+Valid, 357 IncrementalHoareTripleChecker+Invalid, 39 IncrementalHoareTripleChecker+Unknown, 78 IncrementalHoareTripleChecker+Unchecked, 77.5s IncrementalHoareTripleChecker+Time [2022-11-22 01:11:12,766 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [222 Valid, 0 Invalid, 516 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [42 Valid, 357 Invalid, 39 Unknown, 78 Unchecked, 77.5s Time] [2022-11-22 01:11:12,768 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 514 states. [2022-11-22 01:11:12,777 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 514 to 398. [2022-11-22 01:11:12,778 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 398 states, 369 states have (on average 2.4227642276422765) internal successors, (894), 397 states have internal predecessors, (894), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-22 01:11:12,780 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 398 states to 398 states and 894 transitions. [2022-11-22 01:11:12,780 INFO L78 Accepts]: Start accepts. Automaton has 398 states and 894 transitions. Word has length 19 [2022-11-22 01:11:12,780 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-22 01:11:12,780 INFO L495 AbstractCegarLoop]: Abstraction has 398 states and 894 transitions. [2022-11-22 01:11:12,781 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 18 states, 17 states have (on average 1.7647058823529411) internal successors, (30), 17 states have internal predecessors, (30), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-22 01:11:12,781 INFO L276 IsEmpty]: Start isEmpty. Operand 398 states and 894 transitions. [2022-11-22 01:11:12,781 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 21 [2022-11-22 01:11:12,782 INFO L187 NwaCegarLoop]: Found error trace [2022-11-22 01:11:12,782 INFO L195 NwaCegarLoop]: trace histogram [10, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-22 01:11:12,791 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_ff69d8cc-fe65-417d-aa30-ee22f35513bc/bin/utaipan-g80aRyZoba/z3 -smt2 -in SMTLIB2_COMPLIANT=true (7)] Forceful destruction successful, exit code 0 [2022-11-22 01:11:12,987 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 7 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_ff69d8cc-fe65-417d-aa30-ee22f35513bc/bin/utaipan-g80aRyZoba/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable11 [2022-11-22 01:11:12,988 INFO L420 AbstractCegarLoop]: === Iteration 13 === Targeting t_funErr1ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr6ASSERT_VIOLATIONINTEGER_OVERFLOW (and 14 more)] === [2022-11-22 01:11:12,988 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-22 01:11:12,989 INFO L85 PathProgramCache]: Analyzing trace with hash -220705012, now seen corresponding path program 1 times [2022-11-22 01:11:12,989 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2022-11-22 01:11:12,989 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [374917926] [2022-11-22 01:11:12,989 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-22 01:11:12,989 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-22 01:11:13,023 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-22 01:11:13,380 INFO L134 CoverageAnalysis]: Checked inductivity of 55 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 55 trivial. 0 not checked. [2022-11-22 01:11:13,380 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2022-11-22 01:11:13,381 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [374917926] [2022-11-22 01:11:13,381 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [374917926] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-22 01:11:13,381 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-22 01:11:13,381 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2022-11-22 01:11:13,381 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [263140612] [2022-11-22 01:11:13,381 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-22 01:11:13,381 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2022-11-22 01:11:13,382 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2022-11-22 01:11:13,382 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2022-11-22 01:11:13,382 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=39, Unknown=0, NotChecked=0, Total=56 [2022-11-22 01:11:13,382 INFO L87 Difference]: Start difference. First operand 398 states and 894 transitions. Second operand has 8 states, 7 states have (on average 1.5714285714285714) internal successors, (11), 7 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) [2022-11-22 01:11:13,884 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-22 01:11:13,885 INFO L93 Difference]: Finished difference Result 564 states and 1237 transitions. [2022-11-22 01:11:13,885 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2022-11-22 01:11:13,885 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 7 states have (on average 1.5714285714285714) internal successors, (11), 7 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 20 [2022-11-22 01:11:13,886 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-22 01:11:13,888 INFO L225 Difference]: With dead ends: 564 [2022-11-22 01:11:13,888 INFO L226 Difference]: Without dead ends: 564 [2022-11-22 01:11:13,889 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 13 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 13 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 21 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=71, Invalid=139, Unknown=0, NotChecked=0, Total=210 [2022-11-22 01:11:13,889 INFO L413 NwaCegarLoop]: 0 mSDtfsCounter, 42 mSDsluCounter, 0 mSDsCounter, 0 mSdLazyCounter, 301 mSolverCounterSat, 10 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 42 SdHoareTripleChecker+Valid, 0 SdHoareTripleChecker+Invalid, 311 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 10 IncrementalHoareTripleChecker+Valid, 301 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2022-11-22 01:11:13,890 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [42 Valid, 0 Invalid, 311 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [10 Valid, 301 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2022-11-22 01:11:13,891 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 564 states. [2022-11-22 01:11:13,900 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 564 to 403. [2022-11-22 01:11:13,901 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 403 states, 374 states have (on average 2.43048128342246) internal successors, (909), 402 states have internal predecessors, (909), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-22 01:11:13,903 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 403 states to 403 states and 909 transitions. [2022-11-22 01:11:13,904 INFO L78 Accepts]: Start accepts. Automaton has 403 states and 909 transitions. Word has length 20 [2022-11-22 01:11:13,904 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-22 01:11:13,904 INFO L495 AbstractCegarLoop]: Abstraction has 403 states and 909 transitions. [2022-11-22 01:11:13,904 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 7 states have (on average 1.5714285714285714) internal successors, (11), 7 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) [2022-11-22 01:11:13,904 INFO L276 IsEmpty]: Start isEmpty. Operand 403 states and 909 transitions. [2022-11-22 01:11:13,905 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 21 [2022-11-22 01:11:13,905 INFO L187 NwaCegarLoop]: Found error trace [2022-11-22 01:11:13,905 INFO L195 NwaCegarLoop]: trace histogram [10, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-22 01:11:13,905 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable12 [2022-11-22 01:11:13,905 INFO L420 AbstractCegarLoop]: === Iteration 14 === Targeting t_funErr0ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr6ASSERT_VIOLATIONINTEGER_OVERFLOW (and 14 more)] === [2022-11-22 01:11:13,906 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-22 01:11:13,906 INFO L85 PathProgramCache]: Analyzing trace with hash -220705011, now seen corresponding path program 1 times [2022-11-22 01:11:13,906 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2022-11-22 01:11:13,906 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1391541690] [2022-11-22 01:11:13,906 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-22 01:11:13,906 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-22 01:11:13,924 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-22 01:11:14,237 INFO L134 CoverageAnalysis]: Checked inductivity of 55 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 55 trivial. 0 not checked. [2022-11-22 01:11:14,238 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2022-11-22 01:11:14,238 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1391541690] [2022-11-22 01:11:14,238 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1391541690] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-22 01:11:14,238 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-22 01:11:14,238 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2022-11-22 01:11:14,238 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [814141686] [2022-11-22 01:11:14,238 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-22 01:11:14,239 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2022-11-22 01:11:14,239 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2022-11-22 01:11:14,239 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2022-11-22 01:11:14,239 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=39, Unknown=0, NotChecked=0, Total=56 [2022-11-22 01:11:14,239 INFO L87 Difference]: Start difference. First operand 403 states and 909 transitions. Second operand has 8 states, 7 states have (on average 1.5714285714285714) internal successors, (11), 7 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) [2022-11-22 01:11:14,657 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-22 01:11:14,658 INFO L93 Difference]: Finished difference Result 434 states and 948 transitions. [2022-11-22 01:11:14,658 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2022-11-22 01:11:14,658 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 7 states have (on average 1.5714285714285714) internal successors, (11), 7 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 20 [2022-11-22 01:11:14,658 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-22 01:11:14,661 INFO L225 Difference]: With dead ends: 434 [2022-11-22 01:11:14,661 INFO L226 Difference]: Without dead ends: 434 [2022-11-22 01:11:14,661 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 13 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 13 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 21 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=71, Invalid=139, Unknown=0, NotChecked=0, Total=210 [2022-11-22 01:11:14,662 INFO L413 NwaCegarLoop]: 0 mSDtfsCounter, 36 mSDsluCounter, 0 mSDsCounter, 0 mSdLazyCounter, 262 mSolverCounterSat, 6 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 36 SdHoareTripleChecker+Valid, 0 SdHoareTripleChecker+Invalid, 268 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 6 IncrementalHoareTripleChecker+Valid, 262 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2022-11-22 01:11:14,662 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [36 Valid, 0 Invalid, 268 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [6 Valid, 262 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2022-11-22 01:11:14,663 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 434 states. [2022-11-22 01:11:14,672 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 434 to 403. [2022-11-22 01:11:14,673 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 403 states, 374 states have (on average 2.4171122994652405) internal successors, (904), 402 states have internal predecessors, (904), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-22 01:11:14,675 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 403 states to 403 states and 904 transitions. [2022-11-22 01:11:14,675 INFO L78 Accepts]: Start accepts. Automaton has 403 states and 904 transitions. Word has length 20 [2022-11-22 01:11:14,675 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-22 01:11:14,675 INFO L495 AbstractCegarLoop]: Abstraction has 403 states and 904 transitions. [2022-11-22 01:11:14,676 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 7 states have (on average 1.5714285714285714) internal successors, (11), 7 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) [2022-11-22 01:11:14,676 INFO L276 IsEmpty]: Start isEmpty. Operand 403 states and 904 transitions. [2022-11-22 01:11:14,676 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 21 [2022-11-22 01:11:14,676 INFO L187 NwaCegarLoop]: Found error trace [2022-11-22 01:11:14,676 INFO L195 NwaCegarLoop]: trace histogram [10, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-22 01:11:14,677 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable13 [2022-11-22 01:11:14,677 INFO L420 AbstractCegarLoop]: === Iteration 15 === Targeting t_funErr1ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr6ASSERT_VIOLATIONINTEGER_OVERFLOW (and 14 more)] === [2022-11-22 01:11:14,677 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-22 01:11:14,677 INFO L85 PathProgramCache]: Analyzing trace with hash -220791502, now seen corresponding path program 2 times [2022-11-22 01:11:14,678 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2022-11-22 01:11:14,678 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1650824052] [2022-11-22 01:11:14,678 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-22 01:11:14,678 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-22 01:11:14,695 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-22 01:11:15,012 INFO L134 CoverageAnalysis]: Checked inductivity of 55 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 55 trivial. 0 not checked. [2022-11-22 01:11:15,012 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2022-11-22 01:11:15,012 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1650824052] [2022-11-22 01:11:15,012 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1650824052] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-22 01:11:15,013 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-22 01:11:15,013 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2022-11-22 01:11:15,013 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [30535286] [2022-11-22 01:11:15,013 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-22 01:11:15,013 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2022-11-22 01:11:15,013 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2022-11-22 01:11:15,014 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2022-11-22 01:11:15,014 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=21, Invalid=35, Unknown=0, NotChecked=0, Total=56 [2022-11-22 01:11:15,014 INFO L87 Difference]: Start difference. First operand 403 states and 904 transitions. Second operand has 8 states, 7 states have (on average 1.5714285714285714) internal successors, (11), 7 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) [2022-11-22 01:11:15,408 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-22 01:11:15,408 INFO L93 Difference]: Finished difference Result 582 states and 1257 transitions. [2022-11-22 01:11:15,409 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2022-11-22 01:11:15,409 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 7 states have (on average 1.5714285714285714) internal successors, (11), 7 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 20 [2022-11-22 01:11:15,409 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-22 01:11:15,412 INFO L225 Difference]: With dead ends: 582 [2022-11-22 01:11:15,412 INFO L226 Difference]: Without dead ends: 582 [2022-11-22 01:11:15,413 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 12 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 12 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 22 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=69, Invalid=113, Unknown=0, NotChecked=0, Total=182 [2022-11-22 01:11:15,413 INFO L413 NwaCegarLoop]: 0 mSDtfsCounter, 61 mSDsluCounter, 0 mSDsCounter, 0 mSdLazyCounter, 180 mSolverCounterSat, 10 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 61 SdHoareTripleChecker+Valid, 0 SdHoareTripleChecker+Invalid, 190 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 10 IncrementalHoareTripleChecker+Valid, 180 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2022-11-22 01:11:15,413 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [61 Valid, 0 Invalid, 190 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [10 Valid, 180 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2022-11-22 01:11:15,415 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 582 states. [2022-11-22 01:11:15,428 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 582 to 414. [2022-11-22 01:11:15,430 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 414 states, 385 states have (on average 2.4077922077922076) internal successors, (927), 413 states have internal predecessors, (927), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-22 01:11:15,431 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 414 states to 414 states and 927 transitions. [2022-11-22 01:11:15,431 INFO L78 Accepts]: Start accepts. Automaton has 414 states and 927 transitions. Word has length 20 [2022-11-22 01:11:15,432 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-22 01:11:15,432 INFO L495 AbstractCegarLoop]: Abstraction has 414 states and 927 transitions. [2022-11-22 01:11:15,432 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 7 states have (on average 1.5714285714285714) internal successors, (11), 7 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) [2022-11-22 01:11:15,432 INFO L276 IsEmpty]: Start isEmpty. Operand 414 states and 927 transitions. [2022-11-22 01:11:15,433 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 21 [2022-11-22 01:11:15,433 INFO L187 NwaCegarLoop]: Found error trace [2022-11-22 01:11:15,433 INFO L195 NwaCegarLoop]: trace histogram [10, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-22 01:11:15,433 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable14 [2022-11-22 01:11:15,433 INFO L420 AbstractCegarLoop]: === Iteration 16 === Targeting t_funErr0ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr6ASSERT_VIOLATIONINTEGER_OVERFLOW (and 14 more)] === [2022-11-22 01:11:15,434 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-22 01:11:15,434 INFO L85 PathProgramCache]: Analyzing trace with hash -220791501, now seen corresponding path program 2 times [2022-11-22 01:11:15,434 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2022-11-22 01:11:15,434 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [223082199] [2022-11-22 01:11:15,435 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-22 01:11:15,435 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-22 01:11:15,451 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-22 01:11:15,750 INFO L134 CoverageAnalysis]: Checked inductivity of 55 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 55 trivial. 0 not checked. [2022-11-22 01:11:15,750 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2022-11-22 01:11:15,750 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [223082199] [2022-11-22 01:11:15,750 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [223082199] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-22 01:11:15,751 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-22 01:11:15,751 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2022-11-22 01:11:15,751 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1974564832] [2022-11-22 01:11:15,751 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-22 01:11:15,751 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2022-11-22 01:11:15,751 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2022-11-22 01:11:15,752 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2022-11-22 01:11:15,752 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=21, Invalid=35, Unknown=0, NotChecked=0, Total=56 [2022-11-22 01:11:15,752 INFO L87 Difference]: Start difference. First operand 414 states and 927 transitions. Second operand has 8 states, 7 states have (on average 1.5714285714285714) internal successors, (11), 7 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) [2022-11-22 01:11:16,106 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-22 01:11:16,106 INFO L93 Difference]: Finished difference Result 437 states and 949 transitions. [2022-11-22 01:11:16,107 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2022-11-22 01:11:16,107 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 7 states have (on average 1.5714285714285714) internal successors, (11), 7 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 20 [2022-11-22 01:11:16,107 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-22 01:11:16,109 INFO L225 Difference]: With dead ends: 437 [2022-11-22 01:11:16,109 INFO L226 Difference]: Without dead ends: 437 [2022-11-22 01:11:16,110 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 12 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 12 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 23 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=69, Invalid=113, Unknown=0, NotChecked=0, Total=182 [2022-11-22 01:11:16,110 INFO L413 NwaCegarLoop]: 0 mSDtfsCounter, 49 mSDsluCounter, 0 mSDsCounter, 0 mSdLazyCounter, 178 mSolverCounterSat, 5 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 49 SdHoareTripleChecker+Valid, 0 SdHoareTripleChecker+Invalid, 183 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 5 IncrementalHoareTripleChecker+Valid, 178 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2022-11-22 01:11:16,110 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [49 Valid, 0 Invalid, 183 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [5 Valid, 178 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2022-11-22 01:11:16,112 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 437 states. [2022-11-22 01:11:16,119 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 437 to 409. [2022-11-22 01:11:16,121 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 409 states, 380 states have (on average 2.4) internal successors, (912), 408 states have internal predecessors, (912), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-22 01:11:16,122 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 409 states to 409 states and 912 transitions. [2022-11-22 01:11:16,123 INFO L78 Accepts]: Start accepts. Automaton has 409 states and 912 transitions. Word has length 20 [2022-11-22 01:11:16,123 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-22 01:11:16,123 INFO L495 AbstractCegarLoop]: Abstraction has 409 states and 912 transitions. [2022-11-22 01:11:16,123 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 7 states have (on average 1.5714285714285714) internal successors, (11), 7 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) [2022-11-22 01:11:16,123 INFO L276 IsEmpty]: Start isEmpty. Operand 409 states and 912 transitions. [2022-11-22 01:11:16,124 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 21 [2022-11-22 01:11:16,124 INFO L187 NwaCegarLoop]: Found error trace [2022-11-22 01:11:16,124 INFO L195 NwaCegarLoop]: trace histogram [10, 2, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-22 01:11:16,124 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable15 [2022-11-22 01:11:16,125 INFO L420 AbstractCegarLoop]: === Iteration 17 === Targeting ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr6ASSERT_VIOLATIONINTEGER_OVERFLOW (and 14 more)] === [2022-11-22 01:11:16,125 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-22 01:11:16,125 INFO L85 PathProgramCache]: Analyzing trace with hash -222962151, now seen corresponding path program 1 times [2022-11-22 01:11:16,125 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2022-11-22 01:11:16,125 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1019902086] [2022-11-22 01:11:16,126 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-22 01:11:16,126 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-22 01:11:16,173 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-22 01:11:16,495 INFO L134 CoverageAnalysis]: Checked inductivity of 57 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 55 trivial. 0 not checked. [2022-11-22 01:11:16,495 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2022-11-22 01:11:16,495 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1019902086] [2022-11-22 01:11:16,495 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1019902086] provided 0 perfect and 1 imperfect interpolant sequences [2022-11-22 01:11:16,496 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [159134757] [2022-11-22 01:11:16,496 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-22 01:11:16,496 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-11-22 01:11:16,496 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_ff69d8cc-fe65-417d-aa30-ee22f35513bc/bin/utaipan-g80aRyZoba/z3 [2022-11-22 01:11:16,497 INFO L229 MonitoredProcess]: Starting monitored process 8 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_ff69d8cc-fe65-417d-aa30-ee22f35513bc/bin/utaipan-g80aRyZoba/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-11-22 01:11:16,522 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_ff69d8cc-fe65-417d-aa30-ee22f35513bc/bin/utaipan-g80aRyZoba/z3 -smt2 -in SMTLIB2_COMPLIANT=true (8)] Waiting until timeout for monitored process [2022-11-22 01:11:16,619 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-22 01:11:16,620 INFO L263 TraceCheckSpWp]: Trace formula consists of 189 conjuncts, 25 conjunts are in the unsatisfiable core [2022-11-22 01:11:16,622 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-11-22 01:11:16,628 INFO L350 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 [2022-11-22 01:11:16,724 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-22 01:11:16,725 INFO L350 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 13 treesize of output 15 [2022-11-22 01:11:16,804 INFO L350 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 18 treesize of output 13 [2022-11-22 01:11:24,945 INFO L134 CoverageAnalysis]: Checked inductivity of 57 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 55 trivial. 0 not checked. [2022-11-22 01:11:24,945 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-11-22 01:11:29,492 INFO L134 CoverageAnalysis]: Checked inductivity of 57 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 55 trivial. 0 not checked. [2022-11-22 01:11:29,492 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [159134757] provided 0 perfect and 2 imperfect interpolant sequences [2022-11-22 01:11:29,492 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSifa [1000488744] [2022-11-22 01:11:29,493 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:266) at de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.tracehandling.AutomatonFreeRefinementEngine.generateProof(AutomatonFreeRefinementEngine.java:147) 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:336) 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:168) at de.uni_freiburg.informatik.ultimate.core.coreplugin.PluginConnector.runTool(PluginConnector.java:151) at de.uni_freiburg.informatik.ultimate.core.coreplugin.PluginConnector.run(PluginConnector.java:128) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.executePluginConnector(ToolchainWalker.java:232) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.processPlugin(ToolchainWalker.java:226) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.walkUnprotected(ToolchainWalker.java:142) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.walk(ToolchainWalker.java:104) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainManager$Toolchain.processToolchain(ToolchainManager.java:320) 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) [2022-11-22 01:11:29,493 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-11-22 01:11:29,493 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [6, 6, 6] total 18 [2022-11-22 01:11:29,493 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [806487279] [2022-11-22 01:11:29,493 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-11-22 01:11:29,494 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 20 states [2022-11-22 01:11:29,494 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2022-11-22 01:11:29,495 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 20 interpolants. [2022-11-22 01:11:29,496 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=95, Invalid=273, Unknown=12, NotChecked=0, Total=380 [2022-11-22 01:11:29,496 INFO L87 Difference]: Start difference. First operand 409 states and 912 transitions. Second operand has 20 states, 19 states have (on average 1.736842105263158) internal successors, (33), 19 states have internal predecessors, (33), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-22 01:11:31,085 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.58s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2022-11-22 01:11:33,094 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] [2022-11-22 01:11:35,112 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] [2022-11-22 01:11:37,122 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] [2022-11-22 01:11:39,017 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.89s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2022-11-22 01:11:40,765 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.74s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2022-11-22 01:11:42,780 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] [2022-11-22 01:11:44,784 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] [2022-11-22 01:11:50,612 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] [2022-11-22 01:11:52,620 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] [2022-11-22 01:11:54,590 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.97s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2022-11-22 01:11:56,597 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] [2022-11-22 01:11:58,600 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] [2022-11-22 01:12:00,355 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] [2022-11-22 01:12:02,419 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] [2022-11-22 01:12:04,422 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] [2022-11-22 01:12:08,420 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.91s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2022-11-22 01:12:10,152 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.73s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2022-11-22 01:12:13,091 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-22 01:12:13,091 INFO L93 Difference]: Finished difference Result 483 states and 1022 transitions. [2022-11-22 01:12:13,092 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2022-11-22 01:12:13,092 INFO L78 Accepts]: Start accepts. Automaton has has 20 states, 19 states have (on average 1.736842105263158) internal successors, (33), 19 states have internal predecessors, (33), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 20 [2022-11-22 01:12:13,092 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-22 01:12:13,095 INFO L225 Difference]: With dead ends: 483 [2022-11-22 01:12:13,095 INFO L226 Difference]: Without dead ends: 483 [2022-11-22 01:12:13,095 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 50 GetRequests, 26 SyntacticMatches, 0 SemanticMatches, 24 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 177 ImplicationChecksByTransitivity, 20.5s TimeCoverageRelationStatistics Valid=161, Invalid=471, Unknown=18, NotChecked=0, Total=650 [2022-11-22 01:12:13,096 INFO L413 NwaCegarLoop]: 0 mSDtfsCounter, 113 mSDsluCounter, 0 mSDsCounter, 0 mSdLazyCounter, 488 mSolverCounterSat, 17 mSolverCounterUnsat, 18 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 35.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 113 SdHoareTripleChecker+Valid, 0 SdHoareTripleChecker+Invalid, 523 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 17 IncrementalHoareTripleChecker+Valid, 488 IncrementalHoareTripleChecker+Invalid, 18 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 35.5s IncrementalHoareTripleChecker+Time [2022-11-22 01:12:13,096 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [113 Valid, 0 Invalid, 523 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [17 Valid, 488 Invalid, 18 Unknown, 0 Unchecked, 35.5s Time] [2022-11-22 01:12:13,097 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 483 states. [2022-11-22 01:12:13,106 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 483 to 422. [2022-11-22 01:12:13,107 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 422 states, 393 states have (on average 2.3435114503816794) internal successors, (921), 421 states have internal predecessors, (921), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-22 01:12:13,109 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 422 states to 422 states and 921 transitions. [2022-11-22 01:12:13,109 INFO L78 Accepts]: Start accepts. Automaton has 422 states and 921 transitions. Word has length 20 [2022-11-22 01:12:13,109 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-22 01:12:13,109 INFO L495 AbstractCegarLoop]: Abstraction has 422 states and 921 transitions. [2022-11-22 01:12:13,109 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 20 states, 19 states have (on average 1.736842105263158) internal successors, (33), 19 states have internal predecessors, (33), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-22 01:12:13,110 INFO L276 IsEmpty]: Start isEmpty. Operand 422 states and 921 transitions. [2022-11-22 01:12:13,110 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 21 [2022-11-22 01:12:13,110 INFO L187 NwaCegarLoop]: Found error trace [2022-11-22 01:12:13,110 INFO L195 NwaCegarLoop]: trace histogram [10, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-22 01:12:13,123 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_ff69d8cc-fe65-417d-aa30-ee22f35513bc/bin/utaipan-g80aRyZoba/z3 -smt2 -in SMTLIB2_COMPLIANT=true (8)] Forceful destruction successful, exit code 0 [2022-11-22 01:12:13,316 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 8 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_ff69d8cc-fe65-417d-aa30-ee22f35513bc/bin/utaipan-g80aRyZoba/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable16 [2022-11-22 01:12:13,316 INFO L420 AbstractCegarLoop]: === Iteration 18 === Targeting ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr6ASSERT_VIOLATIONINTEGER_OVERFLOW (and 14 more)] === [2022-11-22 01:12:13,317 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-22 01:12:13,317 INFO L85 PathProgramCache]: Analyzing trace with hash -228600493, now seen corresponding path program 1 times [2022-11-22 01:12:13,317 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2022-11-22 01:12:13,317 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1504726820] [2022-11-22 01:12:13,317 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-22 01:12:13,317 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-22 01:12:13,337 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-22 01:12:13,659 INFO L134 CoverageAnalysis]: Checked inductivity of 55 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 55 trivial. 0 not checked. [2022-11-22 01:12:13,660 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2022-11-22 01:12:13,660 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1504726820] [2022-11-22 01:12:13,660 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1504726820] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-22 01:12:13,660 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-22 01:12:13,660 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2022-11-22 01:12:13,660 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [994036350] [2022-11-22 01:12:13,661 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-22 01:12:13,661 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2022-11-22 01:12:13,661 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2022-11-22 01:12:13,661 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2022-11-22 01:12:13,661 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=39, Unknown=0, NotChecked=0, Total=56 [2022-11-22 01:12:13,662 INFO L87 Difference]: Start difference. First operand 422 states and 921 transitions. Second operand has 8 states, 7 states have (on average 1.5714285714285714) internal successors, (11), 7 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) [2022-11-22 01:12:13,962 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-22 01:12:13,962 INFO L93 Difference]: Finished difference Result 447 states and 962 transitions. [2022-11-22 01:12:13,963 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2022-11-22 01:12:13,963 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 7 states have (on average 1.5714285714285714) internal successors, (11), 7 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 20 [2022-11-22 01:12:13,963 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-22 01:12:13,965 INFO L225 Difference]: With dead ends: 447 [2022-11-22 01:12:13,966 INFO L226 Difference]: Without dead ends: 447 [2022-11-22 01:12:13,966 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 11 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=46, Invalid=86, Unknown=0, NotChecked=0, Total=132 [2022-11-22 01:12:13,966 INFO L413 NwaCegarLoop]: 0 mSDtfsCounter, 32 mSDsluCounter, 0 mSDsCounter, 0 mSdLazyCounter, 230 mSolverCounterSat, 5 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 32 SdHoareTripleChecker+Valid, 0 SdHoareTripleChecker+Invalid, 235 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 5 IncrementalHoareTripleChecker+Valid, 230 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2022-11-22 01:12:13,967 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [32 Valid, 0 Invalid, 235 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [5 Valid, 230 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2022-11-22 01:12:13,968 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 447 states. [2022-11-22 01:12:13,976 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 447 to 430. [2022-11-22 01:12:13,977 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 430 states, 401 states have (on average 2.336658354114713) internal successors, (937), 429 states have internal predecessors, (937), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-22 01:12:13,979 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 430 states to 430 states and 937 transitions. [2022-11-22 01:12:13,981 INFO L78 Accepts]: Start accepts. Automaton has 430 states and 937 transitions. Word has length 20 [2022-11-22 01:12:13,981 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-22 01:12:13,981 INFO L495 AbstractCegarLoop]: Abstraction has 430 states and 937 transitions. [2022-11-22 01:12:13,982 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 7 states have (on average 1.5714285714285714) internal successors, (11), 7 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) [2022-11-22 01:12:13,982 INFO L276 IsEmpty]: Start isEmpty. Operand 430 states and 937 transitions. [2022-11-22 01:12:13,982 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 21 [2022-11-22 01:12:13,982 INFO L187 NwaCegarLoop]: Found error trace [2022-11-22 01:12:13,983 INFO L195 NwaCegarLoop]: trace histogram [10, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-22 01:12:13,983 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable17 [2022-11-22 01:12:13,985 INFO L420 AbstractCegarLoop]: === Iteration 19 === Targeting ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr6ASSERT_VIOLATIONINTEGER_OVERFLOW (and 14 more)] === [2022-11-22 01:12:13,985 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-22 01:12:13,985 INFO L85 PathProgramCache]: Analyzing trace with hash -928391083, now seen corresponding path program 2 times [2022-11-22 01:12:13,985 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2022-11-22 01:12:13,985 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2134452620] [2022-11-22 01:12:13,986 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-22 01:12:13,986 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-22 01:12:14,038 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-22 01:12:14,343 INFO L134 CoverageAnalysis]: Checked inductivity of 55 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 55 trivial. 0 not checked. [2022-11-22 01:12:14,343 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2022-11-22 01:12:14,343 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2134452620] [2022-11-22 01:12:14,343 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2134452620] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-22 01:12:14,343 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-22 01:12:14,343 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2022-11-22 01:12:14,344 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1992369810] [2022-11-22 01:12:14,344 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-22 01:12:14,344 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2022-11-22 01:12:14,344 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2022-11-22 01:12:14,345 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2022-11-22 01:12:14,345 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=16, Invalid=40, Unknown=0, NotChecked=0, Total=56 [2022-11-22 01:12:14,345 INFO L87 Difference]: Start difference. First operand 430 states and 937 transitions. Second operand has 8 states, 7 states have (on average 1.5714285714285714) internal successors, (11), 7 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) [2022-11-22 01:12:14,716 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-22 01:12:14,716 INFO L93 Difference]: Finished difference Result 455 states and 978 transitions. [2022-11-22 01:12:14,717 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2022-11-22 01:12:14,717 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 7 states have (on average 1.5714285714285714) internal successors, (11), 7 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 20 [2022-11-22 01:12:14,717 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-22 01:12:14,720 INFO L225 Difference]: With dead ends: 455 [2022-11-22 01:12:14,720 INFO L226 Difference]: Without dead ends: 455 [2022-11-22 01:12:14,720 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 12 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 12 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 14 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=61, Invalid=121, Unknown=0, NotChecked=0, Total=182 [2022-11-22 01:12:14,721 INFO L413 NwaCegarLoop]: 0 mSDtfsCounter, 35 mSDsluCounter, 0 mSDsCounter, 0 mSdLazyCounter, 219 mSolverCounterSat, 5 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 35 SdHoareTripleChecker+Valid, 0 SdHoareTripleChecker+Invalid, 224 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 5 IncrementalHoareTripleChecker+Valid, 219 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2022-11-22 01:12:14,721 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [35 Valid, 0 Invalid, 224 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [5 Valid, 219 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2022-11-22 01:12:14,722 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 455 states. [2022-11-22 01:12:14,732 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 455 to 429. [2022-11-22 01:12:14,733 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 429 states, 400 states have (on average 2.3375) internal successors, (935), 428 states have internal predecessors, (935), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-22 01:12:14,735 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 429 states to 429 states and 935 transitions. [2022-11-22 01:12:14,735 INFO L78 Accepts]: Start accepts. Automaton has 429 states and 935 transitions. Word has length 20 [2022-11-22 01:12:14,736 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-22 01:12:14,736 INFO L495 AbstractCegarLoop]: Abstraction has 429 states and 935 transitions. [2022-11-22 01:12:14,736 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 7 states have (on average 1.5714285714285714) internal successors, (11), 7 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) [2022-11-22 01:12:14,736 INFO L276 IsEmpty]: Start isEmpty. Operand 429 states and 935 transitions. [2022-11-22 01:12:14,737 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 21 [2022-11-22 01:12:14,737 INFO L187 NwaCegarLoop]: Found error trace [2022-11-22 01:12:14,737 INFO L195 NwaCegarLoop]: trace histogram [10, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-22 01:12:14,737 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable18 [2022-11-22 01:12:14,737 INFO L420 AbstractCegarLoop]: === Iteration 20 === Targeting ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr6ASSERT_VIOLATIONINTEGER_OVERFLOW (and 14 more)] === [2022-11-22 01:12:14,738 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-22 01:12:14,738 INFO L85 PathProgramCache]: Analyzing trace with hash -931422883, now seen corresponding path program 3 times [2022-11-22 01:12:14,738 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2022-11-22 01:12:14,738 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [356487065] [2022-11-22 01:12:14,739 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-22 01:12:14,739 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-22 01:12:14,755 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-22 01:12:15,046 INFO L134 CoverageAnalysis]: Checked inductivity of 55 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 55 trivial. 0 not checked. [2022-11-22 01:12:15,047 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2022-11-22 01:12:15,047 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [356487065] [2022-11-22 01:12:15,047 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [356487065] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-22 01:12:15,047 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-22 01:12:15,047 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2022-11-22 01:12:15,047 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [705414845] [2022-11-22 01:12:15,047 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-22 01:12:15,048 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2022-11-22 01:12:15,048 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2022-11-22 01:12:15,048 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2022-11-22 01:12:15,048 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=21, Invalid=35, Unknown=0, NotChecked=0, Total=56 [2022-11-22 01:12:15,048 INFO L87 Difference]: Start difference. First operand 429 states and 935 transitions. Second operand has 8 states, 7 states have (on average 1.5714285714285714) internal successors, (11), 7 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) [2022-11-22 01:12:15,402 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-22 01:12:15,402 INFO L93 Difference]: Finished difference Result 444 states and 948 transitions. [2022-11-22 01:12:15,402 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2022-11-22 01:12:15,403 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 7 states have (on average 1.5714285714285714) internal successors, (11), 7 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 20 [2022-11-22 01:12:15,403 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-22 01:12:15,405 INFO L225 Difference]: With dead ends: 444 [2022-11-22 01:12:15,405 INFO L226 Difference]: Without dead ends: 444 [2022-11-22 01:12:15,405 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 12 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 12 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 23 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=69, Invalid=113, Unknown=0, NotChecked=0, Total=182 [2022-11-22 01:12:15,405 INFO L413 NwaCegarLoop]: 0 mSDtfsCounter, 53 mSDsluCounter, 0 mSDsCounter, 0 mSdLazyCounter, 182 mSolverCounterSat, 6 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 53 SdHoareTripleChecker+Valid, 0 SdHoareTripleChecker+Invalid, 188 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 6 IncrementalHoareTripleChecker+Valid, 182 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2022-11-22 01:12:15,406 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [53 Valid, 0 Invalid, 188 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [6 Valid, 182 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2022-11-22 01:12:15,407 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 444 states. [2022-11-22 01:12:15,415 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 444 to 425. [2022-11-22 01:12:15,416 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 425 states, 396 states have (on average 2.3257575757575757) internal successors, (921), 424 states have internal predecessors, (921), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-22 01:12:15,417 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 425 states to 425 states and 921 transitions. [2022-11-22 01:12:15,418 INFO L78 Accepts]: Start accepts. Automaton has 425 states and 921 transitions. Word has length 20 [2022-11-22 01:12:15,418 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-22 01:12:15,418 INFO L495 AbstractCegarLoop]: Abstraction has 425 states and 921 transitions. [2022-11-22 01:12:15,418 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 7 states have (on average 1.5714285714285714) internal successors, (11), 7 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) [2022-11-22 01:12:15,418 INFO L276 IsEmpty]: Start isEmpty. Operand 425 states and 921 transitions. [2022-11-22 01:12:15,419 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 21 [2022-11-22 01:12:15,419 INFO L187 NwaCegarLoop]: Found error trace [2022-11-22 01:12:15,419 INFO L195 NwaCegarLoop]: trace histogram [10, 2, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-22 01:12:15,419 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable19 [2022-11-22 01:12:15,420 INFO L420 AbstractCegarLoop]: === Iteration 21 === Targeting t_funErr0ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr6ASSERT_VIOLATIONINTEGER_OVERFLOW (and 14 more)] === [2022-11-22 01:12:15,420 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-22 01:12:15,420 INFO L85 PathProgramCache]: Analyzing trace with hash 356180406, now seen corresponding path program 1 times [2022-11-22 01:12:15,420 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2022-11-22 01:12:15,420 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [156957514] [2022-11-22 01:12:15,421 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-22 01:12:15,421 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-22 01:12:15,437 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-22 01:12:15,735 INFO L134 CoverageAnalysis]: Checked inductivity of 57 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 55 trivial. 0 not checked. [2022-11-22 01:12:15,735 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2022-11-22 01:12:15,735 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [156957514] [2022-11-22 01:12:15,735 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [156957514] provided 0 perfect and 1 imperfect interpolant sequences [2022-11-22 01:12:15,735 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [280335075] [2022-11-22 01:12:15,736 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-22 01:12:15,736 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-11-22 01:12:15,736 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_ff69d8cc-fe65-417d-aa30-ee22f35513bc/bin/utaipan-g80aRyZoba/z3 [2022-11-22 01:12:15,739 INFO L229 MonitoredProcess]: Starting monitored process 9 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_ff69d8cc-fe65-417d-aa30-ee22f35513bc/bin/utaipan-g80aRyZoba/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-11-22 01:12:15,763 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_ff69d8cc-fe65-417d-aa30-ee22f35513bc/bin/utaipan-g80aRyZoba/z3 -smt2 -in SMTLIB2_COMPLIANT=true (9)] Waiting until timeout for monitored process [2022-11-22 01:12:15,869 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-22 01:12:15,870 INFO L263 TraceCheckSpWp]: Trace formula consists of 189 conjuncts, 25 conjunts are in the unsatisfiable core [2022-11-22 01:12:15,872 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-11-22 01:12:15,879 INFO L350 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 [2022-11-22 01:12:15,980 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-22 01:12:15,981 INFO L350 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 13 treesize of output 15 [2022-11-22 01:12:16,070 INFO L350 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 18 treesize of output 13 [2022-11-22 01:12:24,161 INFO L134 CoverageAnalysis]: Checked inductivity of 57 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 55 trivial. 0 not checked. [2022-11-22 01:12:24,161 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-11-22 01:12:28,798 INFO L134 CoverageAnalysis]: Checked inductivity of 57 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 55 trivial. 0 not checked. [2022-11-22 01:12:28,798 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [280335075] provided 0 perfect and 2 imperfect interpolant sequences [2022-11-22 01:12:28,799 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSifa [2030198741] [2022-11-22 01:12:28,799 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:266) at de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.tracehandling.AutomatonFreeRefinementEngine.generateProof(AutomatonFreeRefinementEngine.java:147) 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:336) 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:168) at de.uni_freiburg.informatik.ultimate.core.coreplugin.PluginConnector.runTool(PluginConnector.java:151) at de.uni_freiburg.informatik.ultimate.core.coreplugin.PluginConnector.run(PluginConnector.java:128) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.executePluginConnector(ToolchainWalker.java:232) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.processPlugin(ToolchainWalker.java:226) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.walkUnprotected(ToolchainWalker.java:142) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.walk(ToolchainWalker.java:104) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainManager$Toolchain.processToolchain(ToolchainManager.java:320) 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) [2022-11-22 01:12:28,800 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-11-22 01:12:28,800 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 6, 6] total 19 [2022-11-22 01:12:28,801 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [393962974] [2022-11-22 01:12:28,801 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-11-22 01:12:28,801 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 21 states [2022-11-22 01:12:28,801 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2022-11-22 01:12:28,802 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 21 interpolants. [2022-11-22 01:12:28,802 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=111, Invalid=299, Unknown=10, NotChecked=0, Total=420 [2022-11-22 01:12:28,802 INFO L87 Difference]: Start difference. First operand 425 states and 921 transitions. Second operand has 21 states, 20 states have (on average 1.65) internal successors, (33), 20 states have internal predecessors, (33), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-22 01:12:30,811 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] [2022-11-22 01:12:32,824 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] [2022-11-22 01:12:34,841 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] [2022-11-22 01:12:36,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] [2022-11-22 01:12:38,791 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.94s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2022-11-22 01:12:40,753 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.95s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2022-11-22 01:12:42,766 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] [2022-11-22 01:12:44,786 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] [2022-11-22 01:12:46,790 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] [2022-11-22 01:12:52,640 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.95s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2022-11-22 01:12:54,508 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.86s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2022-11-22 01:12:56,417 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.91s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2022-11-22 01:12:58,280 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.86s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2022-11-22 01:13:00,213 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] [2022-11-22 01:13:04,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] [2022-11-22 01:13:06,286 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] [2022-11-22 01:13:12,388 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.97s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2022-11-22 01:13:14,298 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.91s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2022-11-22 01:13:16,312 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] [2022-11-22 01:13:26,656 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-22 01:13:26,656 INFO L93 Difference]: Finished difference Result 454 states and 948 transitions. [2022-11-22 01:13:26,657 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2022-11-22 01:13:26,657 INFO L78 Accepts]: Start accepts. Automaton has has 21 states, 20 states have (on average 1.65) internal successors, (33), 20 states have internal predecessors, (33), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 20 [2022-11-22 01:13:26,657 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-22 01:13:26,659 INFO L225 Difference]: With dead ends: 454 [2022-11-22 01:13:26,660 INFO L226 Difference]: Without dead ends: 454 [2022-11-22 01:13:26,660 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 53 GetRequests, 26 SyntacticMatches, 0 SemanticMatches, 27 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 226 ImplicationChecksByTransitivity, 31.0s TimeCoverageRelationStatistics Valid=230, Invalid=562, Unknown=20, NotChecked=0, Total=812 [2022-11-22 01:13:26,660 INFO L413 NwaCegarLoop]: 0 mSDtfsCounter, 136 mSDsluCounter, 0 mSDsCounter, 0 mSdLazyCounter, 671 mSolverCounterSat, 18 mSolverCounterUnsat, 19 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 39.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 136 SdHoareTripleChecker+Valid, 0 SdHoareTripleChecker+Invalid, 708 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 18 IncrementalHoareTripleChecker+Valid, 671 IncrementalHoareTripleChecker+Invalid, 19 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 39.4s IncrementalHoareTripleChecker+Time [2022-11-22 01:13:26,661 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [136 Valid, 0 Invalid, 708 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [18 Valid, 671 Invalid, 19 Unknown, 0 Unchecked, 39.4s Time] [2022-11-22 01:13:26,662 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 454 states. [2022-11-22 01:13:26,670 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 454 to 420. [2022-11-22 01:13:26,671 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 420 states, 392 states have (on average 2.318877551020408) internal successors, (909), 419 states have internal predecessors, (909), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-22 01:13:26,672 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 420 states to 420 states and 909 transitions. [2022-11-22 01:13:26,672 INFO L78 Accepts]: Start accepts. Automaton has 420 states and 909 transitions. Word has length 20 [2022-11-22 01:13:26,673 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-22 01:13:26,673 INFO L495 AbstractCegarLoop]: Abstraction has 420 states and 909 transitions. [2022-11-22 01:13:26,673 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 21 states, 20 states have (on average 1.65) internal successors, (33), 20 states have internal predecessors, (33), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-22 01:13:26,673 INFO L276 IsEmpty]: Start isEmpty. Operand 420 states and 909 transitions. [2022-11-22 01:13:26,674 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2022-11-22 01:13:26,674 INFO L187 NwaCegarLoop]: Found error trace [2022-11-22 01:13:26,674 INFO L195 NwaCegarLoop]: trace histogram [10, 2, 2, 2, 1, 1, 1, 1, 1, 1] [2022-11-22 01:13:26,691 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_ff69d8cc-fe65-417d-aa30-ee22f35513bc/bin/utaipan-g80aRyZoba/z3 -smt2 -in SMTLIB2_COMPLIANT=true (9)] Ended with exit code 0 [2022-11-22 01:13:26,883 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable20,9 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_ff69d8cc-fe65-417d-aa30-ee22f35513bc/bin/utaipan-g80aRyZoba/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-11-22 01:13:26,883 INFO L420 AbstractCegarLoop]: === Iteration 22 === Targeting ULTIMATE.startErr5ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr6ASSERT_VIOLATIONINTEGER_OVERFLOW (and 14 more)] === [2022-11-22 01:13:26,883 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-22 01:13:26,883 INFO L85 PathProgramCache]: Analyzing trace with hash 481757533, now seen corresponding path program 1 times [2022-11-22 01:13:26,883 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2022-11-22 01:13:26,884 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [288406263] [2022-11-22 01:13:26,884 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-22 01:13:26,884 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-22 01:13:26,899 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-22 01:13:26,932 INFO L134 CoverageAnalysis]: Checked inductivity of 59 backedges. 4 proven. 0 refuted. 0 times theorem prover too weak. 55 trivial. 0 not checked. [2022-11-22 01:13:26,932 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2022-11-22 01:13:26,932 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [288406263] [2022-11-22 01:13:26,933 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [288406263] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-22 01:13:26,933 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-22 01:13:26,933 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2022-11-22 01:13:26,933 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1966064826] [2022-11-22 01:13:26,933 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-22 01:13:26,934 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-11-22 01:13:26,934 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2022-11-22 01:13:26,934 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-11-22 01:13:26,934 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-11-22 01:13:26,934 INFO L87 Difference]: Start difference. First operand 420 states and 909 transitions. Second operand has 3 states, 2 states have (on average 6.5) internal successors, (13), 3 states have internal predecessors, (13), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-22 01:13:26,996 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-22 01:13:26,996 INFO L93 Difference]: Finished difference Result 406 states and 845 transitions. [2022-11-22 01:13:26,996 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-11-22 01:13:26,997 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 2 states have (on average 6.5) internal successors, (13), 3 states have internal predecessors, (13), 0 states have call successors, (0), 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 22 [2022-11-22 01:13:26,997 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-22 01:13:26,999 INFO L225 Difference]: With dead ends: 406 [2022-11-22 01:13:26,999 INFO L226 Difference]: Without dead ends: 406 [2022-11-22 01:13:26,999 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 [2022-11-22 01:13:27,000 INFO L413 NwaCegarLoop]: 0 mSDtfsCounter, 18 mSDsluCounter, 0 mSDsCounter, 0 mSdLazyCounter, 48 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 18 SdHoareTripleChecker+Valid, 0 SdHoareTripleChecker+Invalid, 49 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 48 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-11-22 01:13:27,001 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [18 Valid, 0 Invalid, 49 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 48 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-11-22 01:13:27,002 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 406 states. [2022-11-22 01:13:27,011 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 406 to 406. [2022-11-22 01:13:27,013 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 406 states, 383 states have (on average 2.206266318537859) internal successors, (845), 405 states have internal predecessors, (845), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-22 01:13:27,015 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 406 states to 406 states and 845 transitions. [2022-11-22 01:13:27,015 INFO L78 Accepts]: Start accepts. Automaton has 406 states and 845 transitions. Word has length 22 [2022-11-22 01:13:27,016 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-22 01:13:27,016 INFO L495 AbstractCegarLoop]: Abstraction has 406 states and 845 transitions. [2022-11-22 01:13:27,016 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 2 states have (on average 6.5) internal successors, (13), 3 states have internal predecessors, (13), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-22 01:13:27,016 INFO L276 IsEmpty]: Start isEmpty. Operand 406 states and 845 transitions. [2022-11-22 01:13:27,017 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2022-11-22 01:13:27,017 INFO L187 NwaCegarLoop]: Found error trace [2022-11-22 01:13:27,017 INFO L195 NwaCegarLoop]: trace histogram [10, 2, 2, 2, 1, 1, 1, 1, 1, 1] [2022-11-22 01:13:27,017 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable21 [2022-11-22 01:13:27,017 INFO L420 AbstractCegarLoop]: === Iteration 23 === Targeting t_funErr3ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr6ASSERT_VIOLATIONINTEGER_OVERFLOW (and 14 more)] === [2022-11-22 01:13:27,018 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-22 01:13:27,018 INFO L85 PathProgramCache]: Analyzing trace with hash -1308075270, now seen corresponding path program 1 times [2022-11-22 01:13:27,018 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2022-11-22 01:13:27,018 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [627038979] [2022-11-22 01:13:27,018 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-22 01:13:27,019 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-22 01:13:27,040 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-22 01:13:27,086 INFO L134 CoverageAnalysis]: Checked inductivity of 59 backedges. 0 proven. 4 refuted. 0 times theorem prover too weak. 55 trivial. 0 not checked. [2022-11-22 01:13:27,086 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2022-11-22 01:13:27,087 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [627038979] [2022-11-22 01:13:27,087 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [627038979] provided 0 perfect and 1 imperfect interpolant sequences [2022-11-22 01:13:27,087 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1711269669] [2022-11-22 01:13:27,087 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-22 01:13:27,087 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-11-22 01:13:27,088 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_ff69d8cc-fe65-417d-aa30-ee22f35513bc/bin/utaipan-g80aRyZoba/z3 [2022-11-22 01:13:27,089 INFO L229 MonitoredProcess]: Starting monitored process 10 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_ff69d8cc-fe65-417d-aa30-ee22f35513bc/bin/utaipan-g80aRyZoba/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-11-22 01:13:27,140 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_ff69d8cc-fe65-417d-aa30-ee22f35513bc/bin/utaipan-g80aRyZoba/z3 -smt2 -in SMTLIB2_COMPLIANT=true (10)] Waiting until timeout for monitored process [2022-11-22 01:13:27,251 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-22 01:13:27,252 INFO L263 TraceCheckSpWp]: Trace formula consists of 201 conjuncts, 4 conjunts are in the unsatisfiable core [2022-11-22 01:13:27,255 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-11-22 01:13:27,273 INFO L134 CoverageAnalysis]: Checked inductivity of 59 backedges. 4 proven. 0 refuted. 0 times theorem prover too weak. 55 trivial. 0 not checked. [2022-11-22 01:13:27,273 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-11-22 01:13:27,274 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1711269669] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-22 01:13:27,274 INFO L184 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2022-11-22 01:13:27,274 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [3] total 4 [2022-11-22 01:13:27,274 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1335412119] [2022-11-22 01:13:27,274 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-22 01:13:27,275 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-11-22 01:13:27,275 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2022-11-22 01:13:27,275 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-11-22 01:13:27,275 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2022-11-22 01:13:27,275 INFO L87 Difference]: Start difference. First operand 406 states and 845 transitions. Second operand has 4 states, 3 states have (on average 4.333333333333333) internal successors, (13), 4 states have internal predecessors, (13), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-22 01:13:27,373 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-22 01:13:27,373 INFO L93 Difference]: Finished difference Result 391 states and 795 transitions. [2022-11-22 01:13:27,373 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-11-22 01:13:27,374 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 3 states have (on average 4.333333333333333) internal successors, (13), 4 states have internal predecessors, (13), 0 states have call successors, (0), 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 22 [2022-11-22 01:13:27,374 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-22 01:13:27,376 INFO L225 Difference]: With dead ends: 391 [2022-11-22 01:13:27,376 INFO L226 Difference]: Without dead ends: 391 [2022-11-22 01:13:27,376 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 24 GetRequests, 21 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2022-11-22 01:13:27,376 INFO L413 NwaCegarLoop]: 0 mSDtfsCounter, 36 mSDsluCounter, 0 mSDsCounter, 0 mSdLazyCounter, 86 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 36 SdHoareTripleChecker+Valid, 0 SdHoareTripleChecker+Invalid, 87 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 86 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-11-22 01:13:27,377 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [36 Valid, 0 Invalid, 87 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 86 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-11-22 01:13:27,378 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 391 states. [2022-11-22 01:13:27,384 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 391 to 379. [2022-11-22 01:13:27,385 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 379 states, 361 states have (on average 2.1800554016620497) internal successors, (787), 378 states have internal predecessors, (787), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-22 01:13:27,386 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 379 states to 379 states and 787 transitions. [2022-11-22 01:13:27,387 INFO L78 Accepts]: Start accepts. Automaton has 379 states and 787 transitions. Word has length 22 [2022-11-22 01:13:27,387 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-22 01:13:27,387 INFO L495 AbstractCegarLoop]: Abstraction has 379 states and 787 transitions. [2022-11-22 01:13:27,387 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 3 states have (on average 4.333333333333333) internal successors, (13), 4 states have internal predecessors, (13), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-22 01:13:27,388 INFO L276 IsEmpty]: Start isEmpty. Operand 379 states and 787 transitions. [2022-11-22 01:13:27,388 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2022-11-22 01:13:27,388 INFO L187 NwaCegarLoop]: Found error trace [2022-11-22 01:13:27,388 INFO L195 NwaCegarLoop]: trace histogram [10, 2, 2, 2, 1, 1, 1, 1, 1, 1] [2022-11-22 01:13:27,394 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_ff69d8cc-fe65-417d-aa30-ee22f35513bc/bin/utaipan-g80aRyZoba/z3 -smt2 -in SMTLIB2_COMPLIANT=true (10)] Forceful destruction successful, exit code 0 [2022-11-22 01:13:27,594 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable22,10 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_ff69d8cc-fe65-417d-aa30-ee22f35513bc/bin/utaipan-g80aRyZoba/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-11-22 01:13:27,595 INFO L420 AbstractCegarLoop]: === Iteration 24 === Targeting t_funErr2ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr6ASSERT_VIOLATIONINTEGER_OVERFLOW (and 14 more)] === [2022-11-22 01:13:27,595 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-22 01:13:27,595 INFO L85 PathProgramCache]: Analyzing trace with hash -1308075269, now seen corresponding path program 1 times [2022-11-22 01:13:27,595 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2022-11-22 01:13:27,595 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2070268029] [2022-11-22 01:13:27,596 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-22 01:13:27,596 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-22 01:13:27,609 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-22 01:13:27,644 INFO L134 CoverageAnalysis]: Checked inductivity of 59 backedges. 3 proven. 0 refuted. 0 times theorem prover too weak. 56 trivial. 0 not checked. [2022-11-22 01:13:27,644 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2022-11-22 01:13:27,645 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2070268029] [2022-11-22 01:13:27,645 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2070268029] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-22 01:13:27,645 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-22 01:13:27,645 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2022-11-22 01:13:27,645 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [48109664] [2022-11-22 01:13:27,645 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-22 01:13:27,646 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-11-22 01:13:27,646 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2022-11-22 01:13:27,646 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-11-22 01:13:27,646 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-11-22 01:13:27,646 INFO L87 Difference]: Start difference. First operand 379 states and 787 transitions. Second operand has 3 states, 2 states have (on average 6.5) internal successors, (13), 3 states have internal predecessors, (13), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-22 01:13:27,709 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-22 01:13:27,709 INFO L93 Difference]: Finished difference Result 352 states and 729 transitions. [2022-11-22 01:13:27,710 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-11-22 01:13:27,710 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 2 states have (on average 6.5) internal successors, (13), 3 states have internal predecessors, (13), 0 states have call successors, (0), 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 22 [2022-11-22 01:13:27,710 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-22 01:13:27,711 INFO L225 Difference]: With dead ends: 352 [2022-11-22 01:13:27,711 INFO L226 Difference]: Without dead ends: 352 [2022-11-22 01:13:27,712 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 [2022-11-22 01:13:27,713 INFO L413 NwaCegarLoop]: 0 mSDtfsCounter, 15 mSDsluCounter, 0 mSDsCounter, 0 mSdLazyCounter, 55 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 15 SdHoareTripleChecker+Valid, 0 SdHoareTripleChecker+Invalid, 56 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 55 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-11-22 01:13:27,713 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [15 Valid, 0 Invalid, 56 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 55 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-11-22 01:13:27,714 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 352 states. [2022-11-22 01:13:27,719 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 352 to 316. [2022-11-22 01:13:27,720 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 316 states, 303 states have (on average 2.1386138613861387) internal successors, (648), 315 states have internal predecessors, (648), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-22 01:13:27,721 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 316 states to 316 states and 648 transitions. [2022-11-22 01:13:27,721 INFO L78 Accepts]: Start accepts. Automaton has 316 states and 648 transitions. Word has length 22 [2022-11-22 01:13:27,721 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-22 01:13:27,722 INFO L495 AbstractCegarLoop]: Abstraction has 316 states and 648 transitions. [2022-11-22 01:13:27,722 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 2 states have (on average 6.5) internal successors, (13), 3 states have internal predecessors, (13), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-22 01:13:27,722 INFO L276 IsEmpty]: Start isEmpty. Operand 316 states and 648 transitions. [2022-11-22 01:13:27,723 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 24 [2022-11-22 01:13:27,723 INFO L187 NwaCegarLoop]: Found error trace [2022-11-22 01:13:27,723 INFO L195 NwaCegarLoop]: trace histogram [10, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1] [2022-11-22 01:13:27,723 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable23 [2022-11-22 01:13:27,723 INFO L420 AbstractCegarLoop]: === Iteration 25 === Targeting ULTIMATE.startErr3ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr6ASSERT_VIOLATIONINTEGER_OVERFLOW (and 14 more)] === [2022-11-22 01:13:27,724 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-22 01:13:27,724 INFO L85 PathProgramCache]: Analyzing trace with hash -1895627503, now seen corresponding path program 1 times [2022-11-22 01:13:27,724 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2022-11-22 01:13:27,724 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1293518858] [2022-11-22 01:13:27,725 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-22 01:13:27,725 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-22 01:13:27,753 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-22 01:13:28,423 INFO L134 CoverageAnalysis]: Checked inductivity of 58 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 55 trivial. 0 not checked. [2022-11-22 01:13:28,423 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2022-11-22 01:13:28,423 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1293518858] [2022-11-22 01:13:28,423 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1293518858] provided 0 perfect and 1 imperfect interpolant sequences [2022-11-22 01:13:28,423 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [671763779] [2022-11-22 01:13:28,423 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-22 01:13:28,424 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-11-22 01:13:28,424 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_ff69d8cc-fe65-417d-aa30-ee22f35513bc/bin/utaipan-g80aRyZoba/z3 [2022-11-22 01:13:28,425 INFO L229 MonitoredProcess]: Starting monitored process 11 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_ff69d8cc-fe65-417d-aa30-ee22f35513bc/bin/utaipan-g80aRyZoba/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-11-22 01:13:28,461 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_ff69d8cc-fe65-417d-aa30-ee22f35513bc/bin/utaipan-g80aRyZoba/z3 -smt2 -in SMTLIB2_COMPLIANT=true (11)] Waiting until timeout for monitored process [2022-11-22 01:13:28,577 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-22 01:13:28,579 INFO L263 TraceCheckSpWp]: Trace formula consists of 216 conjuncts, 40 conjunts are in the unsatisfiable core [2022-11-22 01:13:28,583 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-11-22 01:13:28,733 INFO L350 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 11 [2022-11-22 01:13:28,872 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-22 01:13:28,873 INFO L350 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 21 treesize of output 20 [2022-11-22 01:13:28,951 INFO L134 CoverageAnalysis]: Checked inductivity of 58 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 55 trivial. 0 not checked. [2022-11-22 01:13:28,951 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-11-22 01:13:31,411 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-11-22 01:13:31,411 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 20 treesize of output 21 [2022-11-22 01:13:31,422 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-11-22 01:13:31,423 INFO L350 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 22 treesize of output 26 [2022-11-22 01:13:31,441 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 7 treesize of output 5 [2022-11-22 01:13:31,456 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-11-22 01:13:31,457 INFO L350 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 33 treesize of output 37 [2022-11-22 01:13:31,564 INFO L134 CoverageAnalysis]: Checked inductivity of 58 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 55 trivial. 0 not checked. [2022-11-22 01:13:31,564 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [671763779] provided 0 perfect and 2 imperfect interpolant sequences [2022-11-22 01:13:31,564 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSifa [2079600758] [2022-11-22 01:13:31,565 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:266) at de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.tracehandling.AutomatonFreeRefinementEngine.generateProof(AutomatonFreeRefinementEngine.java:147) 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:336) 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:168) at de.uni_freiburg.informatik.ultimate.core.coreplugin.PluginConnector.runTool(PluginConnector.java:151) at de.uni_freiburg.informatik.ultimate.core.coreplugin.PluginConnector.run(PluginConnector.java:128) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.executePluginConnector(ToolchainWalker.java:232) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.processPlugin(ToolchainWalker.java:226) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.walkUnprotected(ToolchainWalker.java:142) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.walk(ToolchainWalker.java:104) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainManager$Toolchain.processToolchain(ToolchainManager.java:320) 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) [2022-11-22 01:13:31,565 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-11-22 01:13:31,565 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [8, 8, 8] total 24 [2022-11-22 01:13:31,565 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [502992185] [2022-11-22 01:13:31,565 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-11-22 01:13:31,566 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 25 states [2022-11-22 01:13:31,566 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2022-11-22 01:13:31,566 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 25 interpolants. [2022-11-22 01:13:31,566 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=109, Invalid=490, Unknown=1, NotChecked=0, Total=600 [2022-11-22 01:13:31,567 INFO L87 Difference]: Start difference. First operand 316 states and 648 transitions. Second operand has 25 states, 24 states have (on average 1.75) internal successors, (42), 25 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) [2022-11-22 01:13:33,690 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-22 01:13:33,691 INFO L93 Difference]: Finished difference Result 647 states and 1310 transitions. [2022-11-22 01:13:33,691 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 27 states. [2022-11-22 01:13:33,691 INFO L78 Accepts]: Start accepts. Automaton has has 25 states, 24 states have (on average 1.75) internal successors, (42), 25 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 23 [2022-11-22 01:13:33,692 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-22 01:13:33,695 INFO L225 Difference]: With dead ends: 647 [2022-11-22 01:13:33,695 INFO L226 Difference]: Without dead ends: 647 [2022-11-22 01:13:33,696 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 75 GetRequests, 30 SyntacticMatches, 0 SemanticMatches, 45 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 473 ImplicationChecksByTransitivity, 3.9s TimeCoverageRelationStatistics Valid=469, Invalid=1692, Unknown=1, NotChecked=0, Total=2162 [2022-11-22 01:13:33,696 INFO L413 NwaCegarLoop]: 0 mSDtfsCounter, 457 mSDsluCounter, 0 mSDsCounter, 0 mSdLazyCounter, 879 mSolverCounterSat, 54 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.9s Time, 0 mProtectedPredicate, 0 mProtectedAction, 457 SdHoareTripleChecker+Valid, 0 SdHoareTripleChecker+Invalid, 933 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 54 IncrementalHoareTripleChecker+Valid, 879 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.0s IncrementalHoareTripleChecker+Time [2022-11-22 01:13:33,697 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [457 Valid, 0 Invalid, 933 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [54 Valid, 879 Invalid, 0 Unknown, 0 Unchecked, 1.0s Time] [2022-11-22 01:13:33,698 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 647 states. [2022-11-22 01:13:33,706 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 647 to 320. [2022-11-22 01:13:33,707 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 320 states, 309 states have (on average 2.1391585760517797) internal successors, (661), 319 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) [2022-11-22 01:13:33,708 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 320 states to 320 states and 661 transitions. [2022-11-22 01:13:33,708 INFO L78 Accepts]: Start accepts. Automaton has 320 states and 661 transitions. Word has length 23 [2022-11-22 01:13:33,708 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-22 01:13:33,708 INFO L495 AbstractCegarLoop]: Abstraction has 320 states and 661 transitions. [2022-11-22 01:13:33,708 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 25 states, 24 states have (on average 1.75) internal successors, (42), 25 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) [2022-11-22 01:13:33,709 INFO L276 IsEmpty]: Start isEmpty. Operand 320 states and 661 transitions. [2022-11-22 01:13:33,709 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 25 [2022-11-22 01:13:33,709 INFO L187 NwaCegarLoop]: Found error trace [2022-11-22 01:13:33,709 INFO L195 NwaCegarLoop]: trace histogram [10, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-22 01:13:33,719 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_ff69d8cc-fe65-417d-aa30-ee22f35513bc/bin/utaipan-g80aRyZoba/z3 -smt2 -in SMTLIB2_COMPLIANT=true (11)] Forceful destruction successful, exit code 0 [2022-11-22 01:13:33,915 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 11 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_ff69d8cc-fe65-417d-aa30-ee22f35513bc/bin/utaipan-g80aRyZoba/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable24 [2022-11-22 01:13:33,915 INFO L420 AbstractCegarLoop]: === Iteration 26 === Targeting t_funErr1ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr6ASSERT_VIOLATIONINTEGER_OVERFLOW (and 14 more)] === [2022-11-22 01:13:33,915 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-22 01:13:33,915 INFO L85 PathProgramCache]: Analyzing trace with hash 469219846, now seen corresponding path program 1 times [2022-11-22 01:13:33,916 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2022-11-22 01:13:33,916 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [700147518] [2022-11-22 01:13:33,916 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-22 01:13:33,916 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-22 01:13:33,936 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-22 01:13:34,461 INFO L134 CoverageAnalysis]: Checked inductivity of 57 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 55 trivial. 0 not checked. [2022-11-22 01:13:34,462 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2022-11-22 01:13:34,462 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [700147518] [2022-11-22 01:13:34,462 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [700147518] provided 0 perfect and 1 imperfect interpolant sequences [2022-11-22 01:13:34,462 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [589577327] [2022-11-22 01:13:34,462 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-22 01:13:34,462 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-11-22 01:13:34,462 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_ff69d8cc-fe65-417d-aa30-ee22f35513bc/bin/utaipan-g80aRyZoba/z3 [2022-11-22 01:13:34,471 INFO L229 MonitoredProcess]: Starting monitored process 12 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_ff69d8cc-fe65-417d-aa30-ee22f35513bc/bin/utaipan-g80aRyZoba/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-11-22 01:13:34,491 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_ff69d8cc-fe65-417d-aa30-ee22f35513bc/bin/utaipan-g80aRyZoba/z3 -smt2 -in SMTLIB2_COMPLIANT=true (12)] Waiting until timeout for monitored process [2022-11-22 01:13:34,617 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-22 01:13:34,619 INFO L263 TraceCheckSpWp]: Trace formula consists of 218 conjuncts, 43 conjunts are in the unsatisfiable core [2022-11-22 01:13:34,621 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-11-22 01:13:34,626 INFO L350 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 [2022-11-22 01:13:34,753 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-22 01:13:34,754 INFO L350 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 13 treesize of output 15 [2022-11-22 01:13:35,012 INFO L350 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 [2022-11-22 01:13:35,178 INFO L350 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 21 treesize of output 16 [2022-11-22 01:13:35,218 INFO L134 CoverageAnalysis]: Checked inductivity of 57 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 55 trivial. 0 not checked. [2022-11-22 01:13:35,218 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-11-22 01:13:35,809 WARN L837 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_1019 (Array Int Int)) (|v_ULTIMATE.start_main_~#t1~0#1.base_47| Int) (|v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_183| Int) (v_ArrVal_1023 Int)) (or (< |v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_183| (+ 28 |c_~#cache~0.offset|)) (< 0 (+ (select (store (select (store |c_#memory_int| |v_ULTIMATE.start_main_~#t1~0#1.base_47| v_ArrVal_1019) |c_~#cache~0.base|) |c_~#cache~0.offset| v_ArrVal_1023) |v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_183|) 2147483650)) (not (< |c_#StackHeapBarrier| |v_ULTIMATE.start_main_~#t1~0#1.base_47|)))) is different from false [2022-11-22 01:13:35,957 INFO L134 CoverageAnalysis]: Checked inductivity of 57 backedges. 1 proven. 1 refuted. 0 times theorem prover too weak. 55 trivial. 0 not checked. [2022-11-22 01:13:35,957 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [589577327] provided 0 perfect and 2 imperfect interpolant sequences [2022-11-22 01:13:35,957 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSifa [873743899] [2022-11-22 01:13:35,958 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:266) at de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.tracehandling.AutomatonFreeRefinementEngine.generateProof(AutomatonFreeRefinementEngine.java:147) 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:336) 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:168) at de.uni_freiburg.informatik.ultimate.core.coreplugin.PluginConnector.runTool(PluginConnector.java:151) at de.uni_freiburg.informatik.ultimate.core.coreplugin.PluginConnector.run(PluginConnector.java:128) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.executePluginConnector(ToolchainWalker.java:232) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.processPlugin(ToolchainWalker.java:226) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.walkUnprotected(ToolchainWalker.java:142) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.walk(ToolchainWalker.java:104) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainManager$Toolchain.processToolchain(ToolchainManager.java:320) 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) [2022-11-22 01:13:35,959 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-11-22 01:13:35,960 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [9, 10, 9] total 28 [2022-11-22 01:13:35,960 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [606315846] [2022-11-22 01:13:35,960 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-11-22 01:13:35,961 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 30 states [2022-11-22 01:13:35,961 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2022-11-22 01:13:35,962 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 30 interpolants. [2022-11-22 01:13:35,963 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=130, Invalid=685, Unknown=1, NotChecked=54, Total=870 [2022-11-22 01:13:35,963 INFO L87 Difference]: Start difference. First operand 320 states and 661 transitions. Second operand has 30 states, 29 states have (on average 1.5517241379310345) internal successors, (45), 29 states have internal predecessors, (45), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-22 01:13:48,497 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-22 01:13:48,497 INFO L93 Difference]: Finished difference Result 574 states and 1142 transitions. [2022-11-22 01:13:48,498 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 71 states. [2022-11-22 01:13:48,498 INFO L78 Accepts]: Start accepts. Automaton has has 30 states, 29 states have (on average 1.5517241379310345) internal successors, (45), 29 states have internal predecessors, (45), 0 states have call successors, (0), 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 24 [2022-11-22 01:13:48,498 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-22 01:13:48,500 INFO L225 Difference]: With dead ends: 574 [2022-11-22 01:13:48,500 INFO L226 Difference]: Without dead ends: 574 [2022-11-22 01:13:48,502 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 119 GetRequests, 26 SyntacticMatches, 2 SemanticMatches, 91 ConstructedPredicates, 1 IntricatePredicates, 0 DeprecatedPredicates, 2811 ImplicationChecksByTransitivity, 9.5s TimeCoverageRelationStatistics Valid=1443, Invalid=6932, Unknown=1, NotChecked=180, Total=8556 [2022-11-22 01:13:48,503 INFO L413 NwaCegarLoop]: 0 mSDtfsCounter, 371 mSDsluCounter, 0 mSDsCounter, 0 mSdLazyCounter, 1091 mSolverCounterSat, 177 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 3.7s Time, 0 mProtectedPredicate, 0 mProtectedAction, 371 SdHoareTripleChecker+Valid, 0 SdHoareTripleChecker+Invalid, 1431 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 177 IncrementalHoareTripleChecker+Valid, 1091 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 163 IncrementalHoareTripleChecker+Unchecked, 3.9s IncrementalHoareTripleChecker+Time [2022-11-22 01:13:48,503 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [371 Valid, 0 Invalid, 1431 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [177 Valid, 1091 Invalid, 0 Unknown, 163 Unchecked, 3.9s Time] [2022-11-22 01:13:48,505 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 574 states. [2022-11-22 01:13:48,512 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 574 to 384. [2022-11-22 01:13:48,513 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 384 states, 373 states have (on average 2.163538873994638) internal successors, (807), 383 states have internal predecessors, (807), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-22 01:13:48,515 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 384 states to 384 states and 807 transitions. [2022-11-22 01:13:48,515 INFO L78 Accepts]: Start accepts. Automaton has 384 states and 807 transitions. Word has length 24 [2022-11-22 01:13:48,515 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-22 01:13:48,515 INFO L495 AbstractCegarLoop]: Abstraction has 384 states and 807 transitions. [2022-11-22 01:13:48,515 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 30 states, 29 states have (on average 1.5517241379310345) internal successors, (45), 29 states have internal predecessors, (45), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-22 01:13:48,516 INFO L276 IsEmpty]: Start isEmpty. Operand 384 states and 807 transitions. [2022-11-22 01:13:48,516 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 25 [2022-11-22 01:13:48,517 INFO L187 NwaCegarLoop]: Found error trace [2022-11-22 01:13:48,517 INFO L195 NwaCegarLoop]: trace histogram [10, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-22 01:13:48,523 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_ff69d8cc-fe65-417d-aa30-ee22f35513bc/bin/utaipan-g80aRyZoba/z3 -smt2 -in SMTLIB2_COMPLIANT=true (12)] Ended with exit code 0 [2022-11-22 01:13:48,722 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 12 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_ff69d8cc-fe65-417d-aa30-ee22f35513bc/bin/utaipan-g80aRyZoba/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable25 [2022-11-22 01:13:48,723 INFO L420 AbstractCegarLoop]: === Iteration 27 === Targeting ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr6ASSERT_VIOLATIONINTEGER_OVERFLOW (and 14 more)] === [2022-11-22 01:13:48,723 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-22 01:13:48,723 INFO L85 PathProgramCache]: Analyzing trace with hash 466158350, now seen corresponding path program 1 times [2022-11-22 01:13:48,723 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2022-11-22 01:13:48,724 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [25288228] [2022-11-22 01:13:48,724 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-22 01:13:48,724 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-22 01:13:48,754 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-22 01:13:49,327 INFO L134 CoverageAnalysis]: Checked inductivity of 57 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 55 trivial. 0 not checked. [2022-11-22 01:13:49,328 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2022-11-22 01:13:49,328 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [25288228] [2022-11-22 01:13:49,328 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [25288228] provided 0 perfect and 1 imperfect interpolant sequences [2022-11-22 01:13:49,328 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1118401716] [2022-11-22 01:13:49,328 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-22 01:13:49,328 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-11-22 01:13:49,328 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_ff69d8cc-fe65-417d-aa30-ee22f35513bc/bin/utaipan-g80aRyZoba/z3 [2022-11-22 01:13:49,329 INFO L229 MonitoredProcess]: Starting monitored process 13 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_ff69d8cc-fe65-417d-aa30-ee22f35513bc/bin/utaipan-g80aRyZoba/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-11-22 01:13:49,351 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_ff69d8cc-fe65-417d-aa30-ee22f35513bc/bin/utaipan-g80aRyZoba/z3 -smt2 -in SMTLIB2_COMPLIANT=true (13)] Waiting until timeout for monitored process [2022-11-22 01:13:49,484 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-22 01:13:49,485 INFO L263 TraceCheckSpWp]: Trace formula consists of 220 conjuncts, 43 conjunts are in the unsatisfiable core [2022-11-22 01:13:49,487 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-11-22 01:13:49,494 INFO L350 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 [2022-11-22 01:13:49,634 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-22 01:13:49,635 INFO L350 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 13 treesize of output 15 [2022-11-22 01:13:49,901 INFO L350 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 18 treesize of output 13 [2022-11-22 01:13:49,955 INFO L350 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 25 treesize of output 20 [2022-11-22 01:13:50,080 INFO L134 CoverageAnalysis]: Checked inductivity of 57 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 55 trivial. 0 not checked. [2022-11-22 01:13:50,080 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-11-22 01:13:53,072 INFO L134 CoverageAnalysis]: Checked inductivity of 57 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 55 trivial. 0 not checked. [2022-11-22 01:13:53,072 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1118401716] provided 0 perfect and 2 imperfect interpolant sequences [2022-11-22 01:13:53,072 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSifa [1335968785] [2022-11-22 01:13:53,073 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:266) at de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.tracehandling.AutomatonFreeRefinementEngine.generateProof(AutomatonFreeRefinementEngine.java:147) 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:336) 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:168) at de.uni_freiburg.informatik.ultimate.core.coreplugin.PluginConnector.runTool(PluginConnector.java:151) at de.uni_freiburg.informatik.ultimate.core.coreplugin.PluginConnector.run(PluginConnector.java:128) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.executePluginConnector(ToolchainWalker.java:232) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.processPlugin(ToolchainWalker.java:226) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.walkUnprotected(ToolchainWalker.java:142) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.walk(ToolchainWalker.java:104) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainManager$Toolchain.processToolchain(ToolchainManager.java:320) 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) [2022-11-22 01:13:53,074 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-11-22 01:13:53,074 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [10, 10, 10] total 30 [2022-11-22 01:13:53,074 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1104050228] [2022-11-22 01:13:53,074 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-11-22 01:13:53,075 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 32 states [2022-11-22 01:13:53,075 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2022-11-22 01:13:53,075 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 32 interpolants. [2022-11-22 01:13:53,076 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=244, Invalid=747, Unknown=1, NotChecked=0, Total=992 [2022-11-22 01:13:53,076 INFO L87 Difference]: Start difference. First operand 384 states and 807 transitions. Second operand has 32 states, 31 states have (on average 1.4516129032258065) internal successors, (45), 31 states have internal predecessors, (45), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-22 01:13:54,070 WARN L837 $PredicateComparison]: unable to prove that (let ((.cse0 (+ (* |c_ULTIMATE.start_main_~i~2#1| 28) 28 |c_~#cache~0.offset|)) (.cse2 (select |c_#memory_int| |c_~#cache~0.base|))) (and (<= 1 |c_ULTIMATE.start_main_~i~2#1|) (= |c_~#cache~0.base| 1) (forall ((|v_ULTIMATE.start_main_~#t1~0#1.base_48| Int) (v_ArrVal_1103 Int) (v_ArrVal_1099 (Array Int Int)) (|v_ULTIMATE.start_cache_entry_addref_~entry#1.offset_115| Int)) (or (not (< |c_#StackHeapBarrier| |v_ULTIMATE.start_main_~#t1~0#1.base_48|)) (< (select (store (select (store |c_#memory_int| |v_ULTIMATE.start_main_~#t1~0#1.base_48| v_ArrVal_1099) |c_~#cache~0.base|) |c_~#cache~0.offset| v_ArrVal_1103) |v_ULTIMATE.start_cache_entry_addref_~entry#1.offset_115|) 2147483647) (< |v_ULTIMATE.start_cache_entry_addref_~entry#1.offset_115| (+ 28 |c_~#cache~0.offset|)))) (forall ((v_ArrVal_1101 Int) (v_ArrVal_1103 Int) (|v_ULTIMATE.start_cache_entry_addref_~entry#1.offset_115| Int)) (or (< |v_ULTIMATE.start_cache_entry_addref_~entry#1.offset_115| .cse0) (< (select (select (let ((.cse1 (store |c_#memory_int| |c_~#cache~0.base| (store .cse2 |c_~#cache~0.offset| v_ArrVal_1101)))) (store .cse1 |c_ULTIMATE.start_cache_entry_addref_~entry#1.base| (store (select .cse1 |c_ULTIMATE.start_cache_entry_addref_~entry#1.base|) |c_ULTIMATE.start_cache_entry_addref_~entry#1.offset| v_ArrVal_1103))) |c_~#cache~0.base|) |v_ULTIMATE.start_cache_entry_addref_~entry#1.offset_115|) 2147483647))) (= |c_~#cache~0.offset| 0) (exists ((v_ArrVal_1103 Int)) (= (store ((as const (Array Int Int)) 0) |c_~#cache~0.offset| v_ArrVal_1103) .cse2)) (forall ((v_ArrVal_1101 Int) (v_ArrVal_1103 Int) (|v_ULTIMATE.start_cache_entry_addref_~entry#1.offset_115| Int)) (or (< |v_ULTIMATE.start_cache_entry_addref_~entry#1.offset_115| .cse0) (< (select (select (let ((.cse3 (store |c_#memory_int| |c_~#cache~0.base| (store .cse2 (+ (* |c_t_funThread1of1ForFork0_~i~0#1| 28) |c_~#cache~0.offset|) v_ArrVal_1101)))) (store .cse3 |c_ULTIMATE.start_cache_entry_addref_~entry#1.base| (store (select .cse3 |c_ULTIMATE.start_cache_entry_addref_~entry#1.base|) |c_ULTIMATE.start_cache_entry_addref_~entry#1.offset| v_ArrVal_1103))) |c_~#cache~0.base|) |v_ULTIMATE.start_cache_entry_addref_~entry#1.offset_115|) 2147483647))))) is different from false [2022-11-22 01:13:54,520 WARN L837 $PredicateComparison]: unable to prove that (let ((.cse0 (+ (* |c_ULTIMATE.start_main_~i~2#1| 28) 28 |c_~#cache~0.offset|)) (.cse2 (select |c_#memory_int| |c_~#cache~0.base|))) (and (<= 1 |c_ULTIMATE.start_main_~i~2#1|) (= |c_~#cache~0.base| 1) (forall ((|v_ULTIMATE.start_main_~#t1~0#1.base_48| Int) (v_ArrVal_1103 Int) (v_ArrVal_1099 (Array Int Int)) (|v_ULTIMATE.start_cache_entry_addref_~entry#1.offset_115| Int)) (or (not (< |c_#StackHeapBarrier| |v_ULTIMATE.start_main_~#t1~0#1.base_48|)) (< (select (store (select (store |c_#memory_int| |v_ULTIMATE.start_main_~#t1~0#1.base_48| v_ArrVal_1099) |c_~#cache~0.base|) |c_~#cache~0.offset| v_ArrVal_1103) |v_ULTIMATE.start_cache_entry_addref_~entry#1.offset_115|) 2147483647) (< |v_ULTIMATE.start_cache_entry_addref_~entry#1.offset_115| (+ 28 |c_~#cache~0.offset|)))) (forall ((v_ArrVal_1101 Int) (v_ArrVal_1103 Int) (|v_ULTIMATE.start_cache_entry_addref_~entry#1.offset_115| Int)) (or (< |v_ULTIMATE.start_cache_entry_addref_~entry#1.offset_115| .cse0) (< (select (select (let ((.cse1 (store |c_#memory_int| |c_~#cache~0.base| (store .cse2 |c_~#cache~0.offset| v_ArrVal_1101)))) (store .cse1 |c_ULTIMATE.start_cache_entry_addref_~entry#1.base| (store (select .cse1 |c_ULTIMATE.start_cache_entry_addref_~entry#1.base|) |c_ULTIMATE.start_cache_entry_addref_~entry#1.offset| v_ArrVal_1103))) |c_~#cache~0.base|) |v_ULTIMATE.start_cache_entry_addref_~entry#1.offset_115|) 2147483647))) (= |c_~#cache~0.offset| 0) (exists ((v_ArrVal_1103 Int)) (= (store ((as const (Array Int Int)) 0) |c_~#cache~0.offset| v_ArrVal_1103) .cse2)) (forall ((v_ArrVal_1101 Int) (v_ArrVal_1103 Int) (|v_ULTIMATE.start_cache_entry_addref_~entry#1.offset_115| Int)) (or (< |v_ULTIMATE.start_cache_entry_addref_~entry#1.offset_115| .cse0) (< (select (select (let ((.cse3 (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_1101)))) (store .cse3 |c_ULTIMATE.start_cache_entry_addref_~entry#1.base| (store (select .cse3 |c_ULTIMATE.start_cache_entry_addref_~entry#1.base|) |c_ULTIMATE.start_cache_entry_addref_~entry#1.offset| v_ArrVal_1103))) |c_~#cache~0.base|) |v_ULTIMATE.start_cache_entry_addref_~entry#1.offset_115|) 2147483647))) (forall ((v_ArrVal_1101 Int) (v_ArrVal_1103 Int) (|v_ULTIMATE.start_cache_entry_addref_~entry#1.offset_115| Int)) (or (< |v_ULTIMATE.start_cache_entry_addref_~entry#1.offset_115| .cse0) (< (select (select (let ((.cse4 (store |c_#memory_int| |c_~#cache~0.base| (store .cse2 (+ (* |c_t_funThread1of1ForFork0_~i~0#1| 28) |c_~#cache~0.offset|) v_ArrVal_1101)))) (store .cse4 |c_ULTIMATE.start_cache_entry_addref_~entry#1.base| (store (select .cse4 |c_ULTIMATE.start_cache_entry_addref_~entry#1.base|) |c_ULTIMATE.start_cache_entry_addref_~entry#1.offset| v_ArrVal_1103))) |c_~#cache~0.base|) |v_ULTIMATE.start_cache_entry_addref_~entry#1.offset_115|) 2147483647))))) is different from false [2022-11-22 01:14:03,202 WARN L837 $PredicateComparison]: unable to prove that (let ((.cse3 ((as const (Array Int Int)) 0)) (.cse0 (+ (* |c_ULTIMATE.start_main_~i~2#1| 28) 28 |c_~#cache~0.offset|)) (.cse2 (select |c_#memory_int| |c_~#cache~0.base|))) (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_main_~#t1~0#1.base_48| Int) (v_ArrVal_1103 Int) (v_ArrVal_1099 (Array Int Int)) (|v_ULTIMATE.start_cache_entry_addref_~entry#1.offset_115| Int)) (or (not (< |c_#StackHeapBarrier| |v_ULTIMATE.start_main_~#t1~0#1.base_48|)) (< (select (store (select (store |c_#memory_int| |v_ULTIMATE.start_main_~#t1~0#1.base_48| v_ArrVal_1099) |c_~#cache~0.base|) |c_~#cache~0.offset| v_ArrVal_1103) |v_ULTIMATE.start_cache_entry_addref_~entry#1.offset_115|) 2147483647) (< |v_ULTIMATE.start_cache_entry_addref_~entry#1.offset_115| (+ 28 |c_~#cache~0.offset|)))) (forall ((v_ArrVal_1101 Int) (v_ArrVal_1103 Int) (|v_ULTIMATE.start_cache_entry_addref_~entry#1.offset_115| Int)) (or (< |v_ULTIMATE.start_cache_entry_addref_~entry#1.offset_115| .cse0) (< (select (select (let ((.cse1 (store |c_#memory_int| |c_~#cache~0.base| (store .cse2 |c_~#cache~0.offset| v_ArrVal_1101)))) (store .cse1 |c_ULTIMATE.start_cache_entry_addref_~entry#1.base| (store (select .cse1 |c_ULTIMATE.start_cache_entry_addref_~entry#1.base|) |c_ULTIMATE.start_cache_entry_addref_~entry#1.offset| v_ArrVal_1103))) |c_~#cache~0.base|) |v_ULTIMATE.start_cache_entry_addref_~entry#1.offset_115|) 2147483647))) (= |c_~#cache~0.offset| 0) (exists ((v_ArrVal_1103 Int)) (= (store .cse3 |c_~#cache~0.offset| v_ArrVal_1103) .cse2)) (forall ((v_ArrVal_1101 Int) (v_ArrVal_1103 Int) (|v_ULTIMATE.start_cache_entry_addref_~entry#1.offset_115| Int)) (or (< |v_ULTIMATE.start_cache_entry_addref_~entry#1.offset_115| .cse0) (< (select (select (let ((.cse4 (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_1101)))) (store .cse4 |c_ULTIMATE.start_cache_entry_addref_~entry#1.base| (store (select .cse4 |c_ULTIMATE.start_cache_entry_addref_~entry#1.base|) |c_ULTIMATE.start_cache_entry_addref_~entry#1.offset| v_ArrVal_1103))) |c_~#cache~0.base|) |v_ULTIMATE.start_cache_entry_addref_~entry#1.offset_115|) 2147483647))) (exists ((v_ArrVal_1103 Int)) (= (select |c_#memory_int| |c_ULTIMATE.start_cache_entry_addref_~entry#1.base|) (store .cse3 0 v_ArrVal_1103))) (<= 28 |c_ULTIMATE.start_cache_entry_addref_~entry#1.offset|) (forall ((v_ArrVal_1101 Int) (v_ArrVal_1103 Int) (|v_ULTIMATE.start_cache_entry_addref_~entry#1.offset_115| Int)) (or (< |v_ULTIMATE.start_cache_entry_addref_~entry#1.offset_115| .cse0) (< (select (select (let ((.cse5 (store |c_#memory_int| |c_~#cache~0.base| (store .cse2 (+ (* |c_t_funThread1of1ForFork0_~i~0#1| 28) |c_~#cache~0.offset|) v_ArrVal_1101)))) (store .cse5 |c_ULTIMATE.start_cache_entry_addref_~entry#1.base| (store (select .cse5 |c_ULTIMATE.start_cache_entry_addref_~entry#1.base|) |c_ULTIMATE.start_cache_entry_addref_~entry#1.offset| v_ArrVal_1103))) |c_~#cache~0.base|) |v_ULTIMATE.start_cache_entry_addref_~entry#1.offset_115|) 2147483647))))) is different from false [2022-11-22 01:14:05,555 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] [2022-11-22 01:14:12,979 WARN L837 $PredicateComparison]: unable to prove that (let ((.cse2 (select |c_#memory_int| |c_~#cache~0.base|)) (.cse0 (+ (* |c_ULTIMATE.start_main_~i~2#1| 28) 28 |c_~#cache~0.offset|)) (.cse3 ((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_main_~#t1~0#1.base_48| Int) (v_ArrVal_1103 Int) (v_ArrVal_1099 (Array Int Int)) (|v_ULTIMATE.start_cache_entry_addref_~entry#1.offset_115| Int)) (or (not (< |c_#StackHeapBarrier| |v_ULTIMATE.start_main_~#t1~0#1.base_48|)) (< (select (store (select (store |c_#memory_int| |v_ULTIMATE.start_main_~#t1~0#1.base_48| v_ArrVal_1099) |c_~#cache~0.base|) |c_~#cache~0.offset| v_ArrVal_1103) |v_ULTIMATE.start_cache_entry_addref_~entry#1.offset_115|) 2147483647) (< |v_ULTIMATE.start_cache_entry_addref_~entry#1.offset_115| (+ 28 |c_~#cache~0.offset|)))) (forall ((v_ArrVal_1101 Int) (v_ArrVal_1103 Int) (|v_ULTIMATE.start_cache_entry_addref_~entry#1.offset_115| Int)) (or (< |v_ULTIMATE.start_cache_entry_addref_~entry#1.offset_115| .cse0) (< (select (select (let ((.cse1 (store |c_#memory_int| |c_~#cache~0.base| (store .cse2 |c_~#cache~0.offset| v_ArrVal_1101)))) (store .cse1 |c_ULTIMATE.start_cache_entry_addref_~entry#1.base| (store (select .cse1 |c_ULTIMATE.start_cache_entry_addref_~entry#1.base|) |c_ULTIMATE.start_cache_entry_addref_~entry#1.offset| v_ArrVal_1103))) |c_~#cache~0.base|) |v_ULTIMATE.start_cache_entry_addref_~entry#1.offset_115|) 2147483647))) (= |c_~#cache~0.offset| 0) (exists ((v_ArrVal_1103 Int)) (= (store .cse3 |c_~#cache~0.offset| v_ArrVal_1103) .cse2)) (forall ((v_ArrVal_1101 Int) (v_ArrVal_1103 Int) (|v_ULTIMATE.start_cache_entry_addref_~entry#1.offset_115| Int)) (or (< |v_ULTIMATE.start_cache_entry_addref_~entry#1.offset_115| .cse0) (< (select (select (let ((.cse4 (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_1101)))) (store .cse4 |c_ULTIMATE.start_cache_entry_addref_~entry#1.base| (store (select .cse4 |c_ULTIMATE.start_cache_entry_addref_~entry#1.base|) |c_ULTIMATE.start_cache_entry_addref_~entry#1.offset| v_ArrVal_1103))) |c_~#cache~0.base|) |v_ULTIMATE.start_cache_entry_addref_~entry#1.offset_115|) 2147483647))) (exists ((v_ArrVal_1103 Int)) (= (select |c_#memory_int| |c_ULTIMATE.start_cache_entry_addref_~entry#1.base|) (store .cse3 0 v_ArrVal_1103))) (<= 28 |c_ULTIMATE.start_cache_entry_addref_~entry#1.offset|))) is different from false [2022-11-22 01:14:15,406 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] [2022-11-22 01:14:18,021 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.05s for a HTC check with result VALID. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2022-11-22 01:14:23,747 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] [2022-11-22 01:14:33,763 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2022-11-22 01:14:37,187 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] [2022-11-22 01:14:42,502 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] [2022-11-22 01:14:45,214 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.41s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2022-11-22 01:14:47,306 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] [2022-11-22 01:14:49,599 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] [2022-11-22 01:14:51,685 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] [2022-11-22 01:14:56,970 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] [2022-11-22 01:15:00,432 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] [2022-11-22 01:15:02,704 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] [2022-11-22 01:15:07,202 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] [2022-11-22 01:15:07,246 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-22 01:15:07,246 INFO L93 Difference]: Finished difference Result 1167 states and 2456 transitions. [2022-11-22 01:15:07,246 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 60 states. [2022-11-22 01:15:07,247 INFO L78 Accepts]: Start accepts. Automaton has has 32 states, 31 states have (on average 1.4516129032258065) internal successors, (45), 31 states have internal predecessors, (45), 0 states have call successors, (0), 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 24 [2022-11-22 01:15:07,247 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-22 01:15:07,252 INFO L225 Difference]: With dead ends: 1167 [2022-11-22 01:15:07,252 INFO L226 Difference]: Without dead ends: 1167 [2022-11-22 01:15:07,254 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 111 GetRequests, 30 SyntacticMatches, 0 SemanticMatches, 81 ConstructedPredicates, 4 IntricatePredicates, 0 DeprecatedPredicates, 2137 ImplicationChecksByTransitivity, 31.2s TimeCoverageRelationStatistics Valid=1163, Invalid=4965, Unknown=50, NotChecked=628, Total=6806 [2022-11-22 01:15:07,254 INFO L413 NwaCegarLoop]: 0 mSDtfsCounter, 381 mSDsluCounter, 0 mSDsCounter, 0 mSdLazyCounter, 1689 mSolverCounterSat, 104 mSolverCounterUnsat, 32 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 45.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 381 SdHoareTripleChecker+Valid, 0 SdHoareTripleChecker+Invalid, 1941 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 104 IncrementalHoareTripleChecker+Valid, 1689 IncrementalHoareTripleChecker+Invalid, 32 IncrementalHoareTripleChecker+Unknown, 116 IncrementalHoareTripleChecker+Unchecked, 46.1s IncrementalHoareTripleChecker+Time [2022-11-22 01:15:07,255 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [381 Valid, 0 Invalid, 1941 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [104 Valid, 1689 Invalid, 32 Unknown, 116 Unchecked, 46.1s Time] [2022-11-22 01:15:07,257 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1167 states. [2022-11-22 01:15:07,271 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1167 to 535. [2022-11-22 01:15:07,272 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 535 states, 524 states have (on average 2.2519083969465647) internal successors, (1180), 534 states have internal predecessors, (1180), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-22 01:15:07,274 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 535 states to 535 states and 1180 transitions. [2022-11-22 01:15:07,274 INFO L78 Accepts]: Start accepts. Automaton has 535 states and 1180 transitions. Word has length 24 [2022-11-22 01:15:07,275 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-22 01:15:07,275 INFO L495 AbstractCegarLoop]: Abstraction has 535 states and 1180 transitions. [2022-11-22 01:15:07,275 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 32 states, 31 states have (on average 1.4516129032258065) internal successors, (45), 31 states have internal predecessors, (45), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-22 01:15:07,275 INFO L276 IsEmpty]: Start isEmpty. Operand 535 states and 1180 transitions. [2022-11-22 01:15:07,276 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 25 [2022-11-22 01:15:07,276 INFO L187 NwaCegarLoop]: Found error trace [2022-11-22 01:15:07,276 INFO L195 NwaCegarLoop]: trace histogram [10, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-22 01:15:07,283 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_ff69d8cc-fe65-417d-aa30-ee22f35513bc/bin/utaipan-g80aRyZoba/z3 -smt2 -in SMTLIB2_COMPLIANT=true (13)] Forceful destruction successful, exit code 0 [2022-11-22 01:15:07,481 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable26,13 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_ff69d8cc-fe65-417d-aa30-ee22f35513bc/bin/utaipan-g80aRyZoba/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-11-22 01:15:07,482 INFO L420 AbstractCegarLoop]: === Iteration 28 === Targeting ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr6ASSERT_VIOLATIONINTEGER_OVERFLOW (and 14 more)] === [2022-11-22 01:15:07,482 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-22 01:15:07,482 INFO L85 PathProgramCache]: Analyzing trace with hash 408988460, now seen corresponding path program 2 times [2022-11-22 01:15:07,483 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2022-11-22 01:15:07,483 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [245129689] [2022-11-22 01:15:07,483 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-22 01:15:07,483 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-22 01:15:07,511 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-22 01:15:08,120 INFO L134 CoverageAnalysis]: Checked inductivity of 57 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 55 trivial. 0 not checked. [2022-11-22 01:15:08,121 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2022-11-22 01:15:08,121 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [245129689] [2022-11-22 01:15:08,121 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [245129689] provided 0 perfect and 1 imperfect interpolant sequences [2022-11-22 01:15:08,121 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1088968542] [2022-11-22 01:15:08,121 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2022-11-22 01:15:08,121 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-11-22 01:15:08,121 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_ff69d8cc-fe65-417d-aa30-ee22f35513bc/bin/utaipan-g80aRyZoba/z3 [2022-11-22 01:15:08,123 INFO L229 MonitoredProcess]: Starting monitored process 14 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_ff69d8cc-fe65-417d-aa30-ee22f35513bc/bin/utaipan-g80aRyZoba/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-11-22 01:15:08,143 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_ff69d8cc-fe65-417d-aa30-ee22f35513bc/bin/utaipan-g80aRyZoba/z3 -smt2 -in SMTLIB2_COMPLIANT=true (14)] Waiting until timeout for monitored process [2022-11-22 01:15:08,278 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 2 check-sat command(s) [2022-11-22 01:15:08,278 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-11-22 01:15:08,280 INFO L263 TraceCheckSpWp]: Trace formula consists of 156 conjuncts, 28 conjunts are in the unsatisfiable core [2022-11-22 01:15:08,281 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-11-22 01:15:08,342 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 13 treesize of output 9 [2022-11-22 01:15:08,405 INFO L134 CoverageAnalysis]: Checked inductivity of 57 backedges. 2 proven. 0 refuted. 0 times theorem prover too weak. 55 trivial. 0 not checked. [2022-11-22 01:15:08,405 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-11-22 01:15:08,405 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1088968542] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-22 01:15:08,406 INFO L184 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2022-11-22 01:15:08,406 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [9] total 14 [2022-11-22 01:15:08,406 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1826602219] [2022-11-22 01:15:08,406 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-22 01:15:08,406 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2022-11-22 01:15:08,407 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2022-11-22 01:15:08,407 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2022-11-22 01:15:08,407 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=49, Invalid=161, Unknown=0, NotChecked=0, Total=210 [2022-11-22 01:15:08,407 INFO L87 Difference]: Start difference. First operand 535 states and 1180 transitions. Second operand has 6 states, 6 states have (on average 2.5) internal successors, (15), 5 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) [2022-11-22 01:15:08,554 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-22 01:15:08,555 INFO L93 Difference]: Finished difference Result 507 states and 1110 transitions. [2022-11-22 01:15:08,555 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2022-11-22 01:15:08,555 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 2.5) internal successors, (15), 5 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 24 [2022-11-22 01:15:08,555 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-22 01:15:08,558 INFO L225 Difference]: With dead ends: 507 [2022-11-22 01:15:08,558 INFO L226 Difference]: Without dead ends: 507 [2022-11-22 01:15:08,558 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 34 GetRequests, 19 SyntacticMatches, 0 SemanticMatches, 15 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 62 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=61, Invalid=211, Unknown=0, NotChecked=0, Total=272 [2022-11-22 01:15:08,559 INFO L413 NwaCegarLoop]: 0 mSDtfsCounter, 45 mSDsluCounter, 0 mSDsCounter, 0 mSdLazyCounter, 116 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 45 SdHoareTripleChecker+Valid, 0 SdHoareTripleChecker+Invalid, 117 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 116 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-11-22 01:15:08,559 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [45 Valid, 0 Invalid, 117 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 116 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-11-22 01:15:08,560 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 507 states. [2022-11-22 01:15:08,574 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 507 to 464. [2022-11-22 01:15:08,576 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 464 states, 453 states have (on average 2.260485651214128) internal successors, (1024), 463 states have internal predecessors, (1024), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-22 01:15:08,578 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 464 states to 464 states and 1024 transitions. [2022-11-22 01:15:08,578 INFO L78 Accepts]: Start accepts. Automaton has 464 states and 1024 transitions. Word has length 24 [2022-11-22 01:15:08,578 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-22 01:15:08,578 INFO L495 AbstractCegarLoop]: Abstraction has 464 states and 1024 transitions. [2022-11-22 01:15:08,578 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 2.5) internal successors, (15), 5 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) [2022-11-22 01:15:08,579 INFO L276 IsEmpty]: Start isEmpty. Operand 464 states and 1024 transitions. [2022-11-22 01:15:08,579 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 25 [2022-11-22 01:15:08,579 INFO L187 NwaCegarLoop]: Found error trace [2022-11-22 01:15:08,579 INFO L195 NwaCegarLoop]: trace histogram [10, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-22 01:15:08,589 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_ff69d8cc-fe65-417d-aa30-ee22f35513bc/bin/utaipan-g80aRyZoba/z3 -smt2 -in SMTLIB2_COMPLIANT=true (14)] Forceful destruction successful, exit code 0 [2022-11-22 01:15:08,789 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 14 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_ff69d8cc-fe65-417d-aa30-ee22f35513bc/bin/utaipan-g80aRyZoba/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable27 [2022-11-22 01:15:08,789 INFO L420 AbstractCegarLoop]: === Iteration 29 === Targeting t_funErr1ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr6ASSERT_VIOLATIONINTEGER_OVERFLOW (and 14 more)] === [2022-11-22 01:15:08,790 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-22 01:15:08,790 INFO L85 PathProgramCache]: Analyzing trace with hash -1863585541, now seen corresponding path program 1 times [2022-11-22 01:15:08,790 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2022-11-22 01:15:08,790 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1962487981] [2022-11-22 01:15:08,790 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-22 01:15:08,790 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-22 01:15:08,829 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-22 01:15:09,382 INFO L134 CoverageAnalysis]: Checked inductivity of 58 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 55 trivial. 0 not checked. [2022-11-22 01:15:09,382 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2022-11-22 01:15:09,382 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1962487981] [2022-11-22 01:15:09,382 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1962487981] provided 0 perfect and 1 imperfect interpolant sequences [2022-11-22 01:15:09,382 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [567141847] [2022-11-22 01:15:09,382 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-22 01:15:09,383 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-11-22 01:15:09,383 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_ff69d8cc-fe65-417d-aa30-ee22f35513bc/bin/utaipan-g80aRyZoba/z3 [2022-11-22 01:15:09,387 INFO L229 MonitoredProcess]: Starting monitored process 15 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_ff69d8cc-fe65-417d-aa30-ee22f35513bc/bin/utaipan-g80aRyZoba/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-11-22 01:15:09,411 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_ff69d8cc-fe65-417d-aa30-ee22f35513bc/bin/utaipan-g80aRyZoba/z3 -smt2 -in SMTLIB2_COMPLIANT=true (15)] Waiting until timeout for monitored process [2022-11-22 01:15:09,550 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-22 01:15:09,552 INFO L263 TraceCheckSpWp]: Trace formula consists of 220 conjuncts, 40 conjunts are in the unsatisfiable core [2022-11-22 01:15:09,554 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-11-22 01:15:09,818 INFO L350 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 11 [2022-11-22 01:15:10,050 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-22 01:15:10,051 INFO L350 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 21 treesize of output 20 [2022-11-22 01:15:10,087 INFO L134 CoverageAnalysis]: Checked inductivity of 58 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 55 trivial. 0 not checked. [2022-11-22 01:15:10,087 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-11-22 01:15:11,522 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-11-22 01:15:11,522 INFO L350 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 [2022-11-22 01:15:11,535 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-11-22 01:15:11,535 INFO L350 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 27 treesize of output 31 [2022-11-22 01:15:11,553 INFO L350 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 8 treesize of output 6 [2022-11-22 01:15:11,567 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-11-22 01:15:11,568 INFO L350 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 46 treesize of output 50 [2022-11-22 01:15:11,807 INFO L134 CoverageAnalysis]: Checked inductivity of 58 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 55 trivial. 0 not checked. [2022-11-22 01:15:11,808 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [567141847] provided 0 perfect and 2 imperfect interpolant sequences [2022-11-22 01:15:11,808 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSifa [1680245686] [2022-11-22 01:15:11,808 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:266) at de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.tracehandling.AutomatonFreeRefinementEngine.generateProof(AutomatonFreeRefinementEngine.java:147) 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:336) 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:168) at de.uni_freiburg.informatik.ultimate.core.coreplugin.PluginConnector.runTool(PluginConnector.java:151) at de.uni_freiburg.informatik.ultimate.core.coreplugin.PluginConnector.run(PluginConnector.java:128) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.executePluginConnector(ToolchainWalker.java:232) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.processPlugin(ToolchainWalker.java:226) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.walkUnprotected(ToolchainWalker.java:142) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.walk(ToolchainWalker.java:104) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainManager$Toolchain.processToolchain(ToolchainManager.java:320) 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) [2022-11-22 01:15:11,808 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-11-22 01:15:11,808 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [10, 10, 10] total 30 [2022-11-22 01:15:11,809 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1435014653] [2022-11-22 01:15:11,809 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-11-22 01:15:11,809 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 31 states [2022-11-22 01:15:11,809 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2022-11-22 01:15:11,810 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 31 interpolants. [2022-11-22 01:15:11,810 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=114, Invalid=816, Unknown=0, NotChecked=0, Total=930 [2022-11-22 01:15:11,810 INFO L87 Difference]: Start difference. First operand 464 states and 1024 transitions. Second operand has 31 states, 30 states have (on average 1.5) internal successors, (45), 31 states have internal predecessors, (45), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-22 01:15:32,193 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-22 01:15:32,193 INFO L93 Difference]: Finished difference Result 1544 states and 3292 transitions. [2022-11-22 01:15:32,193 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 144 states. [2022-11-22 01:15:32,193 INFO L78 Accepts]: Start accepts. Automaton has has 31 states, 30 states have (on average 1.5) internal successors, (45), 31 states have internal predecessors, (45), 0 states have call successors, (0), 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 24 [2022-11-22 01:15:32,193 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-22 01:15:32,197 INFO L225 Difference]: With dead ends: 1544 [2022-11-22 01:15:32,198 INFO L226 Difference]: Without dead ends: 1544 [2022-11-22 01:15:32,202 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 195 GetRequests, 28 SyntacticMatches, 0 SemanticMatches, 167 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 10601 ImplicationChecksByTransitivity, 17.0s TimeCoverageRelationStatistics Valid=3620, Invalid=24772, Unknown=0, NotChecked=0, Total=28392 [2022-11-22 01:15:32,202 INFO L413 NwaCegarLoop]: 0 mSDtfsCounter, 996 mSDsluCounter, 0 mSDsCounter, 0 mSdLazyCounter, 2467 mSolverCounterSat, 268 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 4.8s Time, 0 mProtectedPredicate, 0 mProtectedAction, 996 SdHoareTripleChecker+Valid, 0 SdHoareTripleChecker+Invalid, 2735 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 268 IncrementalHoareTripleChecker+Valid, 2467 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 5.2s IncrementalHoareTripleChecker+Time [2022-11-22 01:15:32,202 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [996 Valid, 0 Invalid, 2735 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [268 Valid, 2467 Invalid, 0 Unknown, 0 Unchecked, 5.2s Time] [2022-11-22 01:15:32,205 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1544 states. [2022-11-22 01:15:32,223 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1544 to 633. [2022-11-22 01:15:32,224 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 633 states, 622 states have (on average 2.392282958199357) internal successors, (1488), 632 states have internal predecessors, (1488), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-22 01:15:32,226 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 633 states to 633 states and 1488 transitions. [2022-11-22 01:15:32,227 INFO L78 Accepts]: Start accepts. Automaton has 633 states and 1488 transitions. Word has length 24 [2022-11-22 01:15:32,227 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-22 01:15:32,227 INFO L495 AbstractCegarLoop]: Abstraction has 633 states and 1488 transitions. [2022-11-22 01:15:32,227 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 31 states, 30 states have (on average 1.5) internal successors, (45), 31 states have internal predecessors, (45), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-22 01:15:32,228 INFO L276 IsEmpty]: Start isEmpty. Operand 633 states and 1488 transitions. [2022-11-22 01:15:32,228 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 25 [2022-11-22 01:15:32,228 INFO L187 NwaCegarLoop]: Found error trace [2022-11-22 01:15:32,228 INFO L195 NwaCegarLoop]: trace histogram [10, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-22 01:15:32,235 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_ff69d8cc-fe65-417d-aa30-ee22f35513bc/bin/utaipan-g80aRyZoba/z3 -smt2 -in SMTLIB2_COMPLIANT=true (15)] Ended with exit code 0 [2022-11-22 01:15:32,434 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 15 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_ff69d8cc-fe65-417d-aa30-ee22f35513bc/bin/utaipan-g80aRyZoba/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable28 [2022-11-22 01:15:32,434 INFO L420 AbstractCegarLoop]: === Iteration 30 === Targeting t_funErr0ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr6ASSERT_VIOLATIONINTEGER_OVERFLOW (and 14 more)] === [2022-11-22 01:15:32,435 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-22 01:15:32,435 INFO L85 PathProgramCache]: Analyzing trace with hash -1863585540, now seen corresponding path program 1 times [2022-11-22 01:15:32,435 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2022-11-22 01:15:32,435 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [780831864] [2022-11-22 01:15:32,435 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-22 01:15:32,435 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-22 01:15:32,456 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-22 01:15:33,167 INFO L134 CoverageAnalysis]: Checked inductivity of 58 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 55 trivial. 0 not checked. [2022-11-22 01:15:33,168 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2022-11-22 01:15:33,168 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [780831864] [2022-11-22 01:15:33,168 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [780831864] provided 0 perfect and 1 imperfect interpolant sequences [2022-11-22 01:15:33,168 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [794859782] [2022-11-22 01:15:33,168 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-22 01:15:33,168 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-11-22 01:15:33,169 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_ff69d8cc-fe65-417d-aa30-ee22f35513bc/bin/utaipan-g80aRyZoba/z3 [2022-11-22 01:15:33,171 INFO L229 MonitoredProcess]: Starting monitored process 16 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_ff69d8cc-fe65-417d-aa30-ee22f35513bc/bin/utaipan-g80aRyZoba/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-11-22 01:15:33,186 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_ff69d8cc-fe65-417d-aa30-ee22f35513bc/bin/utaipan-g80aRyZoba/z3 -smt2 -in SMTLIB2_COMPLIANT=true (16)] Waiting until timeout for monitored process [2022-11-22 01:15:33,352 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-22 01:15:33,353 INFO L263 TraceCheckSpWp]: Trace formula consists of 220 conjuncts, 46 conjunts are in the unsatisfiable core [2022-11-22 01:15:33,356 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-11-22 01:15:33,365 INFO L350 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 [2022-11-22 01:15:33,518 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-22 01:15:33,520 INFO L350 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 13 treesize of output 15 [2022-11-22 01:15:33,824 INFO L350 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 35 treesize of output 28 [2022-11-22 01:15:34,152 INFO L350 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 21 treesize of output 16 [2022-11-22 01:15:34,229 INFO L134 CoverageAnalysis]: Checked inductivity of 58 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 55 trivial. 0 not checked. [2022-11-22 01:15:34,229 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-11-22 01:15:45,375 INFO L134 CoverageAnalysis]: Checked inductivity of 58 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 55 trivial. 0 not checked. [2022-11-22 01:15:45,375 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [794859782] provided 0 perfect and 2 imperfect interpolant sequences [2022-11-22 01:15:45,375 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSifa [215360531] [2022-11-22 01:15:45,376 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:266) at de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.tracehandling.AutomatonFreeRefinementEngine.generateProof(AutomatonFreeRefinementEngine.java:147) 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:336) 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:168) at de.uni_freiburg.informatik.ultimate.core.coreplugin.PluginConnector.runTool(PluginConnector.java:151) at de.uni_freiburg.informatik.ultimate.core.coreplugin.PluginConnector.run(PluginConnector.java:128) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.executePluginConnector(ToolchainWalker.java:232) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.processPlugin(ToolchainWalker.java:226) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.walkUnprotected(ToolchainWalker.java:142) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.walk(ToolchainWalker.java:104) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainManager$Toolchain.processToolchain(ToolchainManager.java:320) 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) [2022-11-22 01:15:45,377 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-11-22 01:15:45,377 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [11, 11, 11] total 33 [2022-11-22 01:15:45,378 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2031964982] [2022-11-22 01:15:45,378 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-11-22 01:15:45,379 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 35 states [2022-11-22 01:15:45,379 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2022-11-22 01:15:45,379 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 35 interpolants. [2022-11-22 01:15:45,380 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=184, Invalid=1000, Unknown=6, NotChecked=0, Total=1190 [2022-11-22 01:15:45,380 INFO L87 Difference]: Start difference. First operand 633 states and 1488 transitions. Second operand has 35 states, 34 states have (on average 1.3235294117647058) internal successors, (45), 34 states have internal predecessors, (45), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-22 01:15:55,375 WARN L837 $PredicateComparison]: unable to prove that (let ((.cse1 ((as const (Array Int Int)) 0))) (and (forall ((|v_ULTIMATE.start_main_~#t1~0#1.base_49| Int) (v_ArrVal_1333 (Array Int Int)) (v_ArrVal_1336 Int) (v_ArrVal_1335 Int) (|v_ULTIMATE.start_cache_entry_addref_~entry#1.offset_119| Int)) (let ((.cse0 (select (store |c_#memory_int| |v_ULTIMATE.start_main_~#t1~0#1.base_49| v_ArrVal_1333) |c_~#cache~0.base|))) (or (< (select (store (store .cse0 |c_~#cache~0.offset| v_ArrVal_1335) |v_ULTIMATE.start_cache_entry_addref_~entry#1.offset_119| v_ArrVal_1336) |c_~#cache~0.offset|) 2147483647) (< |v_ULTIMATE.start_cache_entry_addref_~entry#1.offset_119| (+ 28 |c_~#cache~0.offset|)) (not (< |c_#StackHeapBarrier| |v_ULTIMATE.start_main_~#t1~0#1.base_49|)) (< (+ (select .cse0 |c_~#cache~0.offset|) 1) v_ArrVal_1335)))) (exists ((v_ArrVal_1336 Int) (v_ArrVal_1335 Int) (|ULTIMATE.start_cache_entry_addref_~entry#1.offset| Int)) (and (<= (+ |c_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset| 28) |ULTIMATE.start_cache_entry_addref_~entry#1.offset|) (<= v_ArrVal_1335 (+ (select .cse1 |c_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset|) 1)) (= (store (store .cse1 |c_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset| v_ArrVal_1335) |ULTIMATE.start_cache_entry_addref_~entry#1.offset| v_ArrVal_1336) (select |c_#memory_int| 1)))) (<= 1 |c_ULTIMATE.start_main_~i~2#1|) (= |c_~#cache~0.base| 1) (= |c_~#cache~0.offset| 0) (= |c_t_funThread1of1ForFork0_~i~0#1| 0) (exists ((v_ArrVal_1335 Int)) (and (= (store .cse1 |c_~#cache~0.offset| v_ArrVal_1335) (select |c_#memory_int| |c_~#cache~0.base|)) (<= v_ArrVal_1335 (+ (select .cse1 |c_~#cache~0.offset|) 1)))) (= |c_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.base| 1) (= |c_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset| 0))) is different from false [2022-11-22 01:15:57,407 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] [2022-11-22 01:15:59,425 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] [2022-11-22 01:16:04,092 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.04s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2022-11-22 01:16:23,471 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 [1] [2022-11-22 01:16:37,858 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] [2022-11-22 01:16:41,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] [2022-11-22 01:16:50,726 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.10s for a HTC check with result INVALID. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2022-11-22 01:16:59,181 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] [2022-11-22 01:17:03,801 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] [2022-11-22 01:17:08,355 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] [2022-11-22 01:17:17,759 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] [2022-11-22 01:17:30,795 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] [2022-11-22 01:17:32,881 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] [2022-11-22 01:17:44,818 WARN L233 SmtUtils]: Spent 6.62s on a formula simplification. DAG size of input: 106 DAG size of output: 98 (called from [L 361] de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.predicates.PredicateUnifier.getOrConstructPredicate) [2022-11-22 01:17:47,631 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] [2022-11-22 01:17:49,640 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] [2022-11-22 01:18:05,831 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-22 01:18:05,831 INFO L93 Difference]: Finished difference Result 992 states and 2210 transitions. [2022-11-22 01:18:05,832 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 63 states. [2022-11-22 01:18:05,832 INFO L78 Accepts]: Start accepts. Automaton has has 35 states, 34 states have (on average 1.3235294117647058) internal successors, (45), 34 states have internal predecessors, (45), 0 states have call successors, (0), 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 24 [2022-11-22 01:18:05,832 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-22 01:18:05,837 INFO L225 Difference]: With dead ends: 992 [2022-11-22 01:18:05,837 INFO L226 Difference]: Without dead ends: 992 [2022-11-22 01:18:05,839 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 114 GetRequests, 24 SyntacticMatches, 0 SemanticMatches, 90 ConstructedPredicates, 1 IntricatePredicates, 1 DeprecatedPredicates, 2568 ImplicationChecksByTransitivity, 111.2s TimeCoverageRelationStatistics Valid=1225, Invalid=6908, Unknown=61, NotChecked=178, Total=8372 [2022-11-22 01:18:05,840 INFO L413 NwaCegarLoop]: 0 mSDtfsCounter, 351 mSDsluCounter, 0 mSDsCounter, 0 mSdLazyCounter, 1592 mSolverCounterSat, 77 mSolverCounterUnsat, 60 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 40.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 351 SdHoareTripleChecker+Valid, 0 SdHoareTripleChecker+Invalid, 1768 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 77 IncrementalHoareTripleChecker+Valid, 1592 IncrementalHoareTripleChecker+Invalid, 60 IncrementalHoareTripleChecker+Unknown, 39 IncrementalHoareTripleChecker+Unchecked, 40.7s IncrementalHoareTripleChecker+Time [2022-11-22 01:18:05,840 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [351 Valid, 0 Invalid, 1768 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [77 Valid, 1592 Invalid, 60 Unknown, 39 Unchecked, 40.7s Time] [2022-11-22 01:18:05,842 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 992 states. [2022-11-22 01:18:05,857 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 992 to 689. [2022-11-22 01:18:05,859 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 689 states, 678 states have (on average 2.387905604719764) internal successors, (1619), 688 states have internal predecessors, (1619), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-22 01:18:05,861 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 689 states to 689 states and 1619 transitions. [2022-11-22 01:18:05,861 INFO L78 Accepts]: Start accepts. Automaton has 689 states and 1619 transitions. Word has length 24 [2022-11-22 01:18:05,861 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-22 01:18:05,861 INFO L495 AbstractCegarLoop]: Abstraction has 689 states and 1619 transitions. [2022-11-22 01:18:05,862 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 35 states, 34 states have (on average 1.3235294117647058) internal successors, (45), 34 states have internal predecessors, (45), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-22 01:18:05,862 INFO L276 IsEmpty]: Start isEmpty. Operand 689 states and 1619 transitions. [2022-11-22 01:18:05,862 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 25 [2022-11-22 01:18:05,863 INFO L187 NwaCegarLoop]: Found error trace [2022-11-22 01:18:05,863 INFO L195 NwaCegarLoop]: trace histogram [10, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-22 01:18:05,871 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_ff69d8cc-fe65-417d-aa30-ee22f35513bc/bin/utaipan-g80aRyZoba/z3 -smt2 -in SMTLIB2_COMPLIANT=true (16)] Ended with exit code 0 [2022-11-22 01:18:06,068 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable29,16 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_ff69d8cc-fe65-417d-aa30-ee22f35513bc/bin/utaipan-g80aRyZoba/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-11-22 01:18:06,068 INFO L420 AbstractCegarLoop]: === Iteration 31 === Targeting ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr6ASSERT_VIOLATIONINTEGER_OVERFLOW (and 14 more)] === [2022-11-22 01:18:06,069 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-22 01:18:06,069 INFO L85 PathProgramCache]: Analyzing trace with hash -1863437452, now seen corresponding path program 3 times [2022-11-22 01:18:06,069 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2022-11-22 01:18:06,069 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [463340304] [2022-11-22 01:18:06,069 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-22 01:18:06,069 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-22 01:18:06,087 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-22 01:18:06,618 INFO L134 CoverageAnalysis]: Checked inductivity of 57 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 55 trivial. 0 not checked. [2022-11-22 01:18:06,618 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2022-11-22 01:18:06,618 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [463340304] [2022-11-22 01:18:06,618 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [463340304] provided 0 perfect and 1 imperfect interpolant sequences [2022-11-22 01:18:06,618 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [294014025] [2022-11-22 01:18:06,618 INFO L93 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST [2022-11-22 01:18:06,619 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-11-22 01:18:06,619 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_ff69d8cc-fe65-417d-aa30-ee22f35513bc/bin/utaipan-g80aRyZoba/z3 [2022-11-22 01:18:06,623 INFO L229 MonitoredProcess]: Starting monitored process 17 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_ff69d8cc-fe65-417d-aa30-ee22f35513bc/bin/utaipan-g80aRyZoba/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-11-22 01:18:06,643 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_ff69d8cc-fe65-417d-aa30-ee22f35513bc/bin/utaipan-g80aRyZoba/z3 -smt2 -in SMTLIB2_COMPLIANT=true (17)] Waiting until timeout for monitored process [2022-11-22 01:18:06,798 INFO L228 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2022-11-22 01:18:06,798 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-11-22 01:18:06,800 INFO L263 TraceCheckSpWp]: Trace formula consists of 220 conjuncts, 43 conjunts are in the unsatisfiable core [2022-11-22 01:18:06,804 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-11-22 01:18:06,809 INFO L350 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 [2022-11-22 01:18:06,951 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-22 01:18:06,954 INFO L350 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 13 treesize of output 15 [2022-11-22 01:18:07,199 INFO L350 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 [2022-11-22 01:18:07,472 INFO L350 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 21 treesize of output 16 [2022-11-22 01:18:07,522 INFO L134 CoverageAnalysis]: Checked inductivity of 57 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 55 trivial. 0 not checked. [2022-11-22 01:18:07,522 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-11-22 01:18:08,176 WARN L837 $PredicateComparison]: unable to prove that (forall ((|v_ULTIMATE.start_cache_entry_addref_~entry#1.offset_121| Int) (v_ArrVal_1413 (Array Int Int)) (|v_ULTIMATE.start_main_~#t1~0#1.base_50| Int) (v_ArrVal_1417 Int)) (or (not (< |c_#StackHeapBarrier| |v_ULTIMATE.start_main_~#t1~0#1.base_50|)) (< |v_ULTIMATE.start_cache_entry_addref_~entry#1.offset_121| (+ 28 |c_~#cache~0.offset|)) (< (select (store (select (store |c_#memory_int| |v_ULTIMATE.start_main_~#t1~0#1.base_50| v_ArrVal_1413) |c_~#cache~0.base|) |c_~#cache~0.offset| v_ArrVal_1417) |v_ULTIMATE.start_cache_entry_addref_~entry#1.offset_121|) 2147483647))) is different from false [2022-11-22 01:18:08,319 INFO L134 CoverageAnalysis]: Checked inductivity of 57 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 55 trivial. 0 not checked. [2022-11-22 01:18:08,320 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [294014025] provided 0 perfect and 2 imperfect interpolant sequences [2022-11-22 01:18:08,320 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSifa [948705429] [2022-11-22 01:18:08,320 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:266) at de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.tracehandling.AutomatonFreeRefinementEngine.generateProof(AutomatonFreeRefinementEngine.java:147) 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:336) 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:168) at de.uni_freiburg.informatik.ultimate.core.coreplugin.PluginConnector.runTool(PluginConnector.java:151) at de.uni_freiburg.informatik.ultimate.core.coreplugin.PluginConnector.run(PluginConnector.java:128) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.executePluginConnector(ToolchainWalker.java:232) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.processPlugin(ToolchainWalker.java:226) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.walkUnprotected(ToolchainWalker.java:142) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.walk(ToolchainWalker.java:104) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainManager$Toolchain.processToolchain(ToolchainManager.java:320) 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) [2022-11-22 01:18:08,320 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-11-22 01:18:08,320 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [10, 10, 10] total 30 [2022-11-22 01:18:08,321 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2108949312] [2022-11-22 01:18:08,321 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-11-22 01:18:08,321 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 32 states [2022-11-22 01:18:08,321 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2022-11-22 01:18:08,322 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 32 interpolants. [2022-11-22 01:18:08,322 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=163, Invalid=770, Unknown=1, NotChecked=58, Total=992 [2022-11-22 01:18:08,322 INFO L87 Difference]: Start difference. First operand 689 states and 1619 transitions. Second operand has 32 states, 31 states have (on average 1.4516129032258065) internal successors, (45), 31 states have internal predecessors, (45), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-22 01:18:15,871 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-22 01:18:15,871 INFO L93 Difference]: Finished difference Result 1295 states and 2886 transitions. [2022-11-22 01:18:15,872 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 33 states. [2022-11-22 01:18:15,872 INFO L78 Accepts]: Start accepts. Automaton has has 32 states, 31 states have (on average 1.4516129032258065) internal successors, (45), 31 states have internal predecessors, (45), 0 states have call successors, (0), 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 24 [2022-11-22 01:18:15,872 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-22 01:18:15,879 INFO L225 Difference]: With dead ends: 1295 [2022-11-22 01:18:15,879 INFO L226 Difference]: Without dead ends: 1295 [2022-11-22 01:18:15,881 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 84 GetRequests, 26 SyntacticMatches, 1 SemanticMatches, 57 ConstructedPredicates, 1 IntricatePredicates, 0 DeprecatedPredicates, 1014 ImplicationChecksByTransitivity, 5.7s TimeCoverageRelationStatistics Valid=596, Invalid=2713, Unknown=1, NotChecked=112, Total=3422 [2022-11-22 01:18:15,883 INFO L413 NwaCegarLoop]: 0 mSDtfsCounter, 225 mSDsluCounter, 0 mSDsCounter, 0 mSdLazyCounter, 762 mSolverCounterSat, 60 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 2.8s Time, 0 mProtectedPredicate, 0 mProtectedAction, 225 SdHoareTripleChecker+Valid, 0 SdHoareTripleChecker+Invalid, 928 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 60 IncrementalHoareTripleChecker+Valid, 762 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 106 IncrementalHoareTripleChecker+Unchecked, 2.9s IncrementalHoareTripleChecker+Time [2022-11-22 01:18:15,884 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [225 Valid, 0 Invalid, 928 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [60 Valid, 762 Invalid, 0 Unknown, 106 Unchecked, 2.9s Time] [2022-11-22 01:18:15,886 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1295 states. [2022-11-22 01:18:15,905 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1295 to 769. [2022-11-22 01:18:15,906 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 769 states, 758 states have (on average 2.395778364116095) internal successors, (1816), 768 states have internal predecessors, (1816), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-22 01:18:15,909 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 769 states to 769 states and 1816 transitions. [2022-11-22 01:18:15,909 INFO L78 Accepts]: Start accepts. Automaton has 769 states and 1816 transitions. Word has length 24 [2022-11-22 01:18:15,909 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-22 01:18:15,909 INFO L495 AbstractCegarLoop]: Abstraction has 769 states and 1816 transitions. [2022-11-22 01:18:15,909 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 32 states, 31 states have (on average 1.4516129032258065) internal successors, (45), 31 states have internal predecessors, (45), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-22 01:18:15,910 INFO L276 IsEmpty]: Start isEmpty. Operand 769 states and 1816 transitions. [2022-11-22 01:18:15,910 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 25 [2022-11-22 01:18:15,910 INFO L187 NwaCegarLoop]: Found error trace [2022-11-22 01:18:15,911 INFO L195 NwaCegarLoop]: trace histogram [10, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-22 01:18:15,925 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_ff69d8cc-fe65-417d-aa30-ee22f35513bc/bin/utaipan-g80aRyZoba/z3 -smt2 -in SMTLIB2_COMPLIANT=true (17)] Forceful destruction successful, exit code 0 [2022-11-22 01:18:16,116 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable30,17 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_ff69d8cc-fe65-417d-aa30-ee22f35513bc/bin/utaipan-g80aRyZoba/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-11-22 01:18:16,116 INFO L420 AbstractCegarLoop]: === Iteration 32 === Targeting t_funErr0ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr6ASSERT_VIOLATIONINTEGER_OVERFLOW (and 14 more)] === [2022-11-22 01:18:16,116 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-22 01:18:16,117 INFO L85 PathProgramCache]: Analyzing trace with hash -1870504740, now seen corresponding path program 2 times [2022-11-22 01:18:16,117 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2022-11-22 01:18:16,117 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1771577500] [2022-11-22 01:18:16,117 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-22 01:18:16,117 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-22 01:18:16,134 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-22 01:18:16,755 INFO L134 CoverageAnalysis]: Checked inductivity of 58 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 55 trivial. 0 not checked. [2022-11-22 01:18:16,755 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2022-11-22 01:18:16,755 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1771577500] [2022-11-22 01:18:16,755 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1771577500] provided 0 perfect and 1 imperfect interpolant sequences [2022-11-22 01:18:16,756 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1107156382] [2022-11-22 01:18:16,756 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2022-11-22 01:18:16,756 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-11-22 01:18:16,756 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_ff69d8cc-fe65-417d-aa30-ee22f35513bc/bin/utaipan-g80aRyZoba/z3 [2022-11-22 01:18:16,757 INFO L229 MonitoredProcess]: Starting monitored process 18 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_ff69d8cc-fe65-417d-aa30-ee22f35513bc/bin/utaipan-g80aRyZoba/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-11-22 01:18:16,759 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_ff69d8cc-fe65-417d-aa30-ee22f35513bc/bin/utaipan-g80aRyZoba/z3 -smt2 -in SMTLIB2_COMPLIANT=true (18)] Waiting until timeout for monitored process [2022-11-22 01:18:16,908 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 2 check-sat command(s) [2022-11-22 01:18:16,908 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-11-22 01:18:16,910 INFO L263 TraceCheckSpWp]: Trace formula consists of 156 conjuncts, 46 conjunts are in the unsatisfiable core [2022-11-22 01:18:16,912 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-11-22 01:18:16,920 INFO L350 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 [2022-11-22 01:18:17,050 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-22 01:18:17,051 INFO L350 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 13 treesize of output 15 [2022-11-22 01:18:17,351 INFO L350 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 35 treesize of output 28 [2022-11-22 01:18:17,623 INFO L350 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 21 treesize of output 16 [2022-11-22 01:18:17,681 INFO L134 CoverageAnalysis]: Checked inductivity of 58 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 55 trivial. 0 not checked. [2022-11-22 01:18:17,681 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-11-22 01:18:22,693 INFO L134 CoverageAnalysis]: Checked inductivity of 58 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 55 trivial. 0 not checked. [2022-11-22 01:18:22,693 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1107156382] provided 0 perfect and 2 imperfect interpolant sequences [2022-11-22 01:18:22,693 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSifa [2007019070] [2022-11-22 01:18:22,694 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:266) at de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.tracehandling.AutomatonFreeRefinementEngine.generateProof(AutomatonFreeRefinementEngine.java:147) 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:336) 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:168) at de.uni_freiburg.informatik.ultimate.core.coreplugin.PluginConnector.runTool(PluginConnector.java:151) at de.uni_freiburg.informatik.ultimate.core.coreplugin.PluginConnector.run(PluginConnector.java:128) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.executePluginConnector(ToolchainWalker.java:232) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.processPlugin(ToolchainWalker.java:226) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.walkUnprotected(ToolchainWalker.java:142) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.walk(ToolchainWalker.java:104) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainManager$Toolchain.processToolchain(ToolchainManager.java:320) 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) [2022-11-22 01:18:22,694 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-11-22 01:18:22,695 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [11, 11, 11] total 33 [2022-11-22 01:18:22,695 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [958921430] [2022-11-22 01:18:22,695 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-11-22 01:18:22,695 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 35 states [2022-11-22 01:18:22,695 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2022-11-22 01:18:22,696 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 35 interpolants. [2022-11-22 01:18:22,696 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=191, Invalid=996, Unknown=3, NotChecked=0, Total=1190 [2022-11-22 01:18:22,696 INFO L87 Difference]: Start difference. First operand 769 states and 1816 transitions. Second operand has 35 states, 34 states have (on average 1.3235294117647058) internal successors, (45), 34 states have internal predecessors, (45), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-22 01:18:35,003 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] [2022-11-22 01:18:37,006 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] [2022-11-22 01:18:39,067 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] [2022-11-22 01:18:40,522 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.45s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2022-11-22 01:18:42,632 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] [2022-11-22 01:18:51,457 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] [2022-11-22 01:18:55,414 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] [2022-11-22 01:18:56,761 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.30s for a HTC check with result INVALID. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2022-11-22 01:18:58,066 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.23s for a HTC check with result VALID. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2022-11-22 01:19:05,739 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] [2022-11-22 01:19:07,242 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 [1] [2022-11-22 01:19:09,374 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] [2022-11-22 01:19:14,011 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] [2022-11-22 01:19:20,280 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] [2022-11-22 01:19:22,849 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] [2022-11-22 01:19:24,870 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] [2022-11-22 01:19:26,930 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] [2022-11-22 01:19:29,060 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] [2022-11-22 01:19:35,171 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] [2022-11-22 01:19:37,304 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2022-11-22 01:19:46,734 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] [2022-11-22 01:19:48,737 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] [2022-11-22 01:19:55,892 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] [2022-11-22 01:19:58,264 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] [2022-11-22 01:20:00,941 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] [2022-11-22 01:20:03,919 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] [2022-11-22 01:20:06,178 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] [2022-11-22 01:20:08,723 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] [2022-11-22 01:20:20,596 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] [2022-11-22 01:20:22,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] [2022-11-22 01:20:24,681 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] [2022-11-22 01:20:26,949 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] [2022-11-22 01:20:36,069 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] [2022-11-22 01:21:15,736 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-22 01:21:15,737 INFO L93 Difference]: Finished difference Result 943 states and 2134 transitions. [2022-11-22 01:21:15,737 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 68 states. [2022-11-22 01:21:15,738 INFO L78 Accepts]: Start accepts. Automaton has has 35 states, 34 states have (on average 1.3235294117647058) internal successors, (45), 34 states have internal predecessors, (45), 0 states have call successors, (0), 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 24 [2022-11-22 01:21:15,738 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-22 01:21:15,742 INFO L225 Difference]: With dead ends: 943 [2022-11-22 01:21:15,742 INFO L226 Difference]: Without dead ends: 943 [2022-11-22 01:21:15,743 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 119 GetRequests, 25 SyntacticMatches, 0 SemanticMatches, 94 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2931 ImplicationChecksByTransitivity, 99.8s TimeCoverageRelationStatistics Valid=1138, Invalid=7904, Unknown=78, NotChecked=0, Total=9120 [2022-11-22 01:21:15,743 INFO L413 NwaCegarLoop]: 0 mSDtfsCounter, 307 mSDsluCounter, 0 mSDsCounter, 0 mSdLazyCounter, 1615 mSolverCounterSat, 67 mSolverCounterUnsat, 72 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 77.9s Time, 0 mProtectedPredicate, 0 mProtectedAction, 307 SdHoareTripleChecker+Valid, 0 SdHoareTripleChecker+Invalid, 1754 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 67 IncrementalHoareTripleChecker+Valid, 1615 IncrementalHoareTripleChecker+Invalid, 72 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 78.5s IncrementalHoareTripleChecker+Time [2022-11-22 01:21:15,743 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [307 Valid, 0 Invalid, 1754 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [67 Valid, 1615 Invalid, 72 Unknown, 0 Unchecked, 78.5s Time] [2022-11-22 01:21:15,745 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 943 states. [2022-11-22 01:21:15,758 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 943 to 768. [2022-11-22 01:21:15,759 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 768 states, 757 states have (on average 2.3844121532364597) internal successors, (1805), 767 states have internal predecessors, (1805), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-22 01:21:15,762 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 768 states to 768 states and 1805 transitions. [2022-11-22 01:21:15,762 INFO L78 Accepts]: Start accepts. Automaton has 768 states and 1805 transitions. Word has length 24 [2022-11-22 01:21:15,762 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-22 01:21:15,762 INFO L495 AbstractCegarLoop]: Abstraction has 768 states and 1805 transitions. [2022-11-22 01:21:15,763 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 35 states, 34 states have (on average 1.3235294117647058) internal successors, (45), 34 states have internal predecessors, (45), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-22 01:21:15,763 INFO L276 IsEmpty]: Start isEmpty. Operand 768 states and 1805 transitions. [2022-11-22 01:21:15,763 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 25 [2022-11-22 01:21:15,764 INFO L187 NwaCegarLoop]: Found error trace [2022-11-22 01:21:15,764 INFO L195 NwaCegarLoop]: trace histogram [10, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-22 01:21:15,776 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_ff69d8cc-fe65-417d-aa30-ee22f35513bc/bin/utaipan-g80aRyZoba/z3 -smt2 -in SMTLIB2_COMPLIANT=true (18)] Forceful destruction successful, exit code 0 [2022-11-22 01:21:15,969 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 18 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_ff69d8cc-fe65-417d-aa30-ee22f35513bc/bin/utaipan-g80aRyZoba/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable31 [2022-11-22 01:21:15,970 INFO L420 AbstractCegarLoop]: === Iteration 33 === Targeting ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr6ASSERT_VIOLATIONINTEGER_OVERFLOW (and 14 more)] === [2022-11-22 01:21:15,970 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-22 01:21:15,970 INFO L85 PathProgramCache]: Analyzing trace with hash -1870587292, now seen corresponding path program 4 times [2022-11-22 01:21:15,970 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2022-11-22 01:21:15,970 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1651734041] [2022-11-22 01:21:15,970 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-22 01:21:15,971 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-22 01:21:15,988 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-22 01:21:16,552 INFO L134 CoverageAnalysis]: Checked inductivity of 57 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 55 trivial. 0 not checked. [2022-11-22 01:21:16,553 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2022-11-22 01:21:16,553 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1651734041] [2022-11-22 01:21:16,553 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1651734041] provided 0 perfect and 1 imperfect interpolant sequences [2022-11-22 01:21:16,553 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1289224019] [2022-11-22 01:21:16,553 INFO L93 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2022-11-22 01:21:16,553 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-11-22 01:21:16,554 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_ff69d8cc-fe65-417d-aa30-ee22f35513bc/bin/utaipan-g80aRyZoba/z3 [2022-11-22 01:21:16,555 INFO L229 MonitoredProcess]: Starting monitored process 19 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_ff69d8cc-fe65-417d-aa30-ee22f35513bc/bin/utaipan-g80aRyZoba/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-11-22 01:21:16,557 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_ff69d8cc-fe65-417d-aa30-ee22f35513bc/bin/utaipan-g80aRyZoba/z3 -smt2 -in SMTLIB2_COMPLIANT=true (19)] Waiting until timeout for monitored process [2022-11-22 01:21:16,718 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-22 01:21:16,720 INFO L263 TraceCheckSpWp]: Trace formula consists of 220 conjuncts, 43 conjunts are in the unsatisfiable core [2022-11-22 01:21:16,722 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-11-22 01:21:16,728 INFO L350 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 [2022-11-22 01:21:16,887 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-22 01:21:16,888 INFO L350 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 13 treesize of output 15 [2022-11-22 01:21:17,136 INFO L350 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 [2022-11-22 01:21:17,413 INFO L350 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 21 treesize of output 16 [2022-11-22 01:21:17,458 INFO L134 CoverageAnalysis]: Checked inductivity of 57 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 55 trivial. 0 not checked. [2022-11-22 01:21:17,458 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-11-22 01:21:18,475 INFO L134 CoverageAnalysis]: Checked inductivity of 57 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 55 trivial. 0 not checked. [2022-11-22 01:21:18,475 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1289224019] provided 0 perfect and 2 imperfect interpolant sequences [2022-11-22 01:21:18,475 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSifa [1071850667] [2022-11-22 01:21:18,476 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:266) at de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.tracehandling.AutomatonFreeRefinementEngine.generateProof(AutomatonFreeRefinementEngine.java:147) 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:336) 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:168) at de.uni_freiburg.informatik.ultimate.core.coreplugin.PluginConnector.runTool(PluginConnector.java:151) at de.uni_freiburg.informatik.ultimate.core.coreplugin.PluginConnector.run(PluginConnector.java:128) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.executePluginConnector(ToolchainWalker.java:232) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.processPlugin(ToolchainWalker.java:226) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.walkUnprotected(ToolchainWalker.java:142) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.walk(ToolchainWalker.java:104) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainManager$Toolchain.processToolchain(ToolchainManager.java:320) 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) [2022-11-22 01:21:18,476 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-11-22 01:21:18,476 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [10, 10, 10] total 30 [2022-11-22 01:21:18,476 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [698267278] [2022-11-22 01:21:18,476 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-11-22 01:21:18,476 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 32 states [2022-11-22 01:21:18,477 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2022-11-22 01:21:18,477 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 32 interpolants. [2022-11-22 01:21:18,477 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=160, Invalid=831, Unknown=1, NotChecked=0, Total=992 [2022-11-22 01:21:18,477 INFO L87 Difference]: Start difference. First operand 768 states and 1805 transitions. Second operand has 32 states, 31 states have (on average 1.4516129032258065) internal successors, (45), 31 states have internal predecessors, (45), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-22 01:21:22,429 WARN L837 $PredicateComparison]: unable to prove that (let ((.cse4 (* |c_ULTIMATE.start_main_~i~2#1| 28))) (let ((.cse1 (+ .cse4 28 |c_~#cache~0.offset|)) (.cse2 (select |c_#memory_int| |c_ULTIMATE.start_cache_entry_addref_~entry#1.base|)) (.cse3 (+ (* |c_t_funThread1of1ForFork0_~i~0#1| 28) |c_~#cache~0.offset|)) (.cse5 (select |c_#memory_int| |c_~#cache~0.base|)) (.cse0 (+ 28 |c_~#cache~0.offset|))) (and (forall ((v_ArrVal_1576 Int) (v_ArrVal_1573 (Array Int Int)) (|v_ULTIMATE.start_main_~#t1~0#1.base_52| Int) (|v_ULTIMATE.start_cache_entry_addref_~entry#1.offset_125| Int)) (or (< (select (store (select (store |c_#memory_int| |v_ULTIMATE.start_main_~#t1~0#1.base_52| v_ArrVal_1573) |c_~#cache~0.base|) |c_~#cache~0.offset| v_ArrVal_1576) |v_ULTIMATE.start_cache_entry_addref_~entry#1.offset_125|) 2147483647) (not (< |c_#StackHeapBarrier| |v_ULTIMATE.start_main_~#t1~0#1.base_52|)) (< |v_ULTIMATE.start_cache_entry_addref_~entry#1.offset_125| .cse0))) (forall ((v_ArrVal_1574 Int) (v_ArrVal_1576 Int) (|v_ULTIMATE.start_cache_entry_addref_~entry#1.offset_125| Int)) (or (< |v_ULTIMATE.start_cache_entry_addref_~entry#1.offset_125| .cse1) (< (select (store (select (store |c_#memory_int| |c_ULTIMATE.start_cache_entry_addref_~entry#1.base| (store .cse2 |c_ULTIMATE.start_cache_entry_addref_~entry#1.offset| v_ArrVal_1574)) |c_~#cache~0.base|) |c_~#cache~0.offset| v_ArrVal_1576) |v_ULTIMATE.start_cache_entry_addref_~entry#1.offset_125|) 2147483647))) (forall ((v_ArrVal_1574 Int) (v_ArrVal_1576 Int) (|v_ULTIMATE.start_cache_entry_addref_~entry#1.offset_125| Int)) (or (< |v_ULTIMATE.start_cache_entry_addref_~entry#1.offset_125| .cse1) (< (select (store (select (store |c_#memory_int| |c_ULTIMATE.start_cache_entry_addref_~entry#1.base| (store .cse2 |c_ULTIMATE.start_cache_entry_addref_~entry#1.offset| v_ArrVal_1574)) |c_~#cache~0.base|) .cse3 v_ArrVal_1576) |v_ULTIMATE.start_cache_entry_addref_~entry#1.offset_125|) 2147483647))) (forall ((v_ArrVal_1576 Int) (|v_ULTIMATE.start_cache_entry_addref_~entry#1.offset_125| Int)) (or (< |v_ULTIMATE.start_cache_entry_addref_~entry#1.offset_125| (+ .cse4 |c_~#cache~0.offset|)) (< (select (store .cse5 .cse3 v_ArrVal_1576) |v_ULTIMATE.start_cache_entry_addref_~entry#1.offset_125|) 2147483647))) (forall ((v_ArrVal_1576 Int) (|v_ULTIMATE.start_cache_entry_addref_~entry#1.offset_125| Int)) (or (< (select (store .cse5 |c_~#cache~0.offset| v_ArrVal_1576) |v_ULTIMATE.start_cache_entry_addref_~entry#1.offset_125|) 2147483647) (< |v_ULTIMATE.start_cache_entry_addref_~entry#1.offset_125| .cse0)))))) is different from false [2022-11-22 01:21:22,524 WARN L837 $PredicateComparison]: unable to prove that (let ((.cse1 (+ (* |c_ULTIMATE.start_main_~i~2#1| 28) 28 |c_~#cache~0.offset|)) (.cse2 (select |c_#memory_int| |c_ULTIMATE.start_cache_entry_addref_~entry#1.base|)) (.cse0 ((as const (Array Int Int)) 0))) (and (forall ((v_ArrVal_1576 Int) (v_ArrVal_1573 (Array Int Int)) (|v_ULTIMATE.start_main_~#t1~0#1.base_52| Int) (|v_ULTIMATE.start_cache_entry_addref_~entry#1.offset_125| Int)) (or (< (select (store (select (store |c_#memory_int| |v_ULTIMATE.start_main_~#t1~0#1.base_52| v_ArrVal_1573) |c_~#cache~0.base|) |c_~#cache~0.offset| v_ArrVal_1576) |v_ULTIMATE.start_cache_entry_addref_~entry#1.offset_125|) 2147483647) (not (< |c_#StackHeapBarrier| |v_ULTIMATE.start_main_~#t1~0#1.base_52|)) (< |v_ULTIMATE.start_cache_entry_addref_~entry#1.offset_125| (+ 28 |c_~#cache~0.offset|)))) (= |c_ULTIMATE.start_cache_entry_addref_~entry#1.base| 1) (exists ((v_ArrVal_1576 Int)) (= (select |c_#memory_int| 1) (store .cse0 0 v_ArrVal_1576))) (forall ((v_ArrVal_1574 Int) (v_ArrVal_1576 Int) (|v_ULTIMATE.start_cache_entry_addref_~entry#1.offset_125| Int)) (or (< |v_ULTIMATE.start_cache_entry_addref_~entry#1.offset_125| .cse1) (< (select (store (select (store |c_#memory_int| |c_ULTIMATE.start_cache_entry_addref_~entry#1.base| (store .cse2 |c_ULTIMATE.start_cache_entry_addref_~entry#1.offset| v_ArrVal_1574)) |c_~#cache~0.base|) |c_~#cache~0.offset| v_ArrVal_1576) |v_ULTIMATE.start_cache_entry_addref_~entry#1.offset_125|) 2147483647))) (<= 1 |c_ULTIMATE.start_main_~i~2#1|) (= |c_~#cache~0.base| 1) (forall ((v_ArrVal_1574 Int) (v_ArrVal_1576 Int) (|v_ULTIMATE.start_cache_entry_addref_~entry#1.offset_125| Int)) (or (< |v_ULTIMATE.start_cache_entry_addref_~entry#1.offset_125| .cse1) (< (select (store (select (store |c_#memory_int| |c_ULTIMATE.start_cache_entry_addref_~entry#1.base| (store .cse2 |c_ULTIMATE.start_cache_entry_addref_~entry#1.offset| v_ArrVal_1574)) |c_~#cache~0.base|) (+ (* |c_t_funThread1of1ForFork0_~i~0#1| 28) |c_~#cache~0.offset|) v_ArrVal_1576) |v_ULTIMATE.start_cache_entry_addref_~entry#1.offset_125|) 2147483647))) (= |c_~#cache~0.offset| 0) (exists ((v_ArrVal_1574 Int)) (= (store .cse0 |c_~#cache~0.offset| v_ArrVal_1574) (select |c_#memory_int| |c_~#cache~0.base|))) (= |c_t_funThread1of1ForFork0_~i~0#1| 0) (<= 28 |c_ULTIMATE.start_cache_entry_addref_~entry#1.offset|))) is different from false [2022-11-22 01:21:34,255 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-22 01:21:34,255 INFO L93 Difference]: Finished difference Result 1313 states and 2976 transitions. [2022-11-22 01:21:34,256 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 40 states. [2022-11-22 01:21:34,256 INFO L78 Accepts]: Start accepts. Automaton has has 32 states, 31 states have (on average 1.4516129032258065) internal successors, (45), 31 states have internal predecessors, (45), 0 states have call successors, (0), 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 24 [2022-11-22 01:21:34,256 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-22 01:21:34,262 INFO L225 Difference]: With dead ends: 1313 [2022-11-22 01:21:34,262 INFO L226 Difference]: Without dead ends: 1313 [2022-11-22 01:21:34,263 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 88 GetRequests, 27 SyntacticMatches, 0 SemanticMatches, 61 ConstructedPredicates, 2 IntricatePredicates, 0 DeprecatedPredicates, 1082 ImplicationChecksByTransitivity, 12.6s TimeCoverageRelationStatistics Valid=573, Invalid=3062, Unknown=33, NotChecked=238, Total=3906 [2022-11-22 01:21:34,264 INFO L413 NwaCegarLoop]: 0 mSDtfsCounter, 227 mSDsluCounter, 0 mSDsCounter, 0 mSdLazyCounter, 1098 mSolverCounterSat, 68 mSolverCounterUnsat, 18 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 4.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 227 SdHoareTripleChecker+Valid, 0 SdHoareTripleChecker+Invalid, 1190 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 68 IncrementalHoareTripleChecker+Valid, 1098 IncrementalHoareTripleChecker+Invalid, 18 IncrementalHoareTripleChecker+Unknown, 6 IncrementalHoareTripleChecker+Unchecked, 4.5s IncrementalHoareTripleChecker+Time [2022-11-22 01:21:34,264 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [227 Valid, 0 Invalid, 1190 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [68 Valid, 1098 Invalid, 18 Unknown, 6 Unchecked, 4.5s Time] [2022-11-22 01:21:34,266 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1313 states. [2022-11-22 01:21:34,283 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1313 to 823. [2022-11-22 01:21:34,285 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 823 states, 812 states have (on average 2.4014778325123154) internal successors, (1950), 822 states have internal predecessors, (1950), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-22 01:21:34,288 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 823 states to 823 states and 1950 transitions. [2022-11-22 01:21:34,288 INFO L78 Accepts]: Start accepts. Automaton has 823 states and 1950 transitions. Word has length 24 [2022-11-22 01:21:34,288 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-22 01:21:34,288 INFO L495 AbstractCegarLoop]: Abstraction has 823 states and 1950 transitions. [2022-11-22 01:21:34,288 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 32 states, 31 states have (on average 1.4516129032258065) internal successors, (45), 31 states have internal predecessors, (45), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-22 01:21:34,289 INFO L276 IsEmpty]: Start isEmpty. Operand 823 states and 1950 transitions. [2022-11-22 01:21:34,289 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 25 [2022-11-22 01:21:34,289 INFO L187 NwaCegarLoop]: Found error trace [2022-11-22 01:21:34,290 INFO L195 NwaCegarLoop]: trace histogram [10, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-22 01:21:34,300 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_ff69d8cc-fe65-417d-aa30-ee22f35513bc/bin/utaipan-g80aRyZoba/z3 -smt2 -in SMTLIB2_COMPLIANT=true (19)] Forceful destruction successful, exit code 0 [2022-11-22 01:21:34,495 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable32,19 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_ff69d8cc-fe65-417d-aa30-ee22f35513bc/bin/utaipan-g80aRyZoba/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-11-22 01:21:34,496 INFO L420 AbstractCegarLoop]: === Iteration 34 === Targeting t_funErr0ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr6ASSERT_VIOLATIONINTEGER_OVERFLOW (and 14 more)] === [2022-11-22 01:21:34,496 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-22 01:21:34,496 INFO L85 PathProgramCache]: Analyzing trace with hash -885201538, now seen corresponding path program 3 times [2022-11-22 01:21:34,496 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2022-11-22 01:21:34,496 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1594772048] [2022-11-22 01:21:34,496 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-22 01:21:34,497 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-22 01:21:34,514 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-22 01:21:35,223 INFO L134 CoverageAnalysis]: Checked inductivity of 58 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 55 trivial. 0 not checked. [2022-11-22 01:21:35,224 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2022-11-22 01:21:35,224 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1594772048] [2022-11-22 01:21:35,224 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1594772048] provided 0 perfect and 1 imperfect interpolant sequences [2022-11-22 01:21:35,224 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [736664508] [2022-11-22 01:21:35,224 INFO L93 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST [2022-11-22 01:21:35,224 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-11-22 01:21:35,224 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_ff69d8cc-fe65-417d-aa30-ee22f35513bc/bin/utaipan-g80aRyZoba/z3 [2022-11-22 01:21:35,225 INFO L229 MonitoredProcess]: Starting monitored process 20 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_ff69d8cc-fe65-417d-aa30-ee22f35513bc/bin/utaipan-g80aRyZoba/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-11-22 01:21:35,227 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_ff69d8cc-fe65-417d-aa30-ee22f35513bc/bin/utaipan-g80aRyZoba/z3 -smt2 -in SMTLIB2_COMPLIANT=true (20)] Waiting until timeout for monitored process [2022-11-22 01:21:35,389 INFO L228 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2022-11-22 01:21:35,389 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-11-22 01:21:35,391 INFO L263 TraceCheckSpWp]: Trace formula consists of 220 conjuncts, 46 conjunts are in the unsatisfiable core [2022-11-22 01:21:35,393 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-11-22 01:21:35,397 INFO L350 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 [2022-11-22 01:21:35,532 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-22 01:21:35,533 INFO L350 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 13 treesize of output 15 [2022-11-22 01:21:35,736 INFO L350 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 35 treesize of output 28 [2022-11-22 01:21:36,101 INFO L350 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 21 treesize of output 16 [2022-11-22 01:21:36,167 INFO L134 CoverageAnalysis]: Checked inductivity of 58 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 55 trivial. 0 not checked. [2022-11-22 01:21:36,167 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-11-22 01:21:42,838 WARN L837 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_1653 (Array Int Int)) (|v_ULTIMATE.start_cache_entry_addref_~entry#1.offset_127| Int) (|v_ULTIMATE.start_main_~#t1~0#1.base_53| Int) (v_ArrVal_1655 Int) (v_ArrVal_1656 Int)) (let ((.cse0 (select (store |c_#memory_int| |v_ULTIMATE.start_main_~#t1~0#1.base_53| v_ArrVal_1653) |c_~#cache~0.base|))) (or (< (+ (select .cse0 |c_~#cache~0.offset|) 1) v_ArrVal_1655) (< |v_ULTIMATE.start_cache_entry_addref_~entry#1.offset_127| (+ 28 |c_~#cache~0.offset|)) (not (< |c_#StackHeapBarrier| |v_ULTIMATE.start_main_~#t1~0#1.base_53|)) (< (select (store (store .cse0 |c_~#cache~0.offset| v_ArrVal_1655) |v_ULTIMATE.start_cache_entry_addref_~entry#1.offset_127| v_ArrVal_1656) |c_~#cache~0.offset|) 2147483647)))) is different from false [2022-11-22 01:21:43,042 INFO L134 CoverageAnalysis]: Checked inductivity of 58 backedges. 1 proven. 2 refuted. 0 times theorem prover too weak. 55 trivial. 0 not checked. [2022-11-22 01:21:43,043 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [736664508] provided 0 perfect and 2 imperfect interpolant sequences [2022-11-22 01:21:43,043 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSifa [2136080510] [2022-11-22 01:21:43,043 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:266) at de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.tracehandling.AutomatonFreeRefinementEngine.generateProof(AutomatonFreeRefinementEngine.java:147) 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:336) 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:168) at de.uni_freiburg.informatik.ultimate.core.coreplugin.PluginConnector.runTool(PluginConnector.java:151) at de.uni_freiburg.informatik.ultimate.core.coreplugin.PluginConnector.run(PluginConnector.java:128) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.executePluginConnector(ToolchainWalker.java:232) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.processPlugin(ToolchainWalker.java:226) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.walkUnprotected(ToolchainWalker.java:142) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.walk(ToolchainWalker.java:104) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainManager$Toolchain.processToolchain(ToolchainManager.java:320) 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) [2022-11-22 01:21:43,043 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-11-22 01:21:43,044 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [11, 11, 11] total 33 [2022-11-22 01:21:43,044 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1525628097] [2022-11-22 01:21:43,044 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-11-22 01:21:43,044 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 35 states [2022-11-22 01:21:43,044 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2022-11-22 01:21:43,045 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 35 interpolants. [2022-11-22 01:21:43,045 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=178, Invalid=945, Unknown=3, NotChecked=64, Total=1190 [2022-11-22 01:21:43,045 INFO L87 Difference]: Start difference. First operand 823 states and 1950 transitions. Second operand has 35 states, 34 states have (on average 1.3235294117647058) internal successors, (45), 34 states have internal predecessors, (45), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-22 01:21:49,208 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] [2022-11-22 01:21:54,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] [2022-11-22 01:21:56,043 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] [2022-11-22 01:21:58,055 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] [2022-11-22 01:22:00,084 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] [2022-11-22 01:22:02,190 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] [2022-11-22 01:22:04,204 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] [2022-11-22 01:22:06,223 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] [2022-11-22 01:22:11,159 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] [2022-11-22 01:22:19,759 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] [2022-11-22 01:22:21,779 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] [2022-11-22 01:22:24,438 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-22 01:22:24,438 INFO L93 Difference]: Finished difference Result 1289 states and 2919 transitions. [2022-11-22 01:22:24,439 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 37 states. [2022-11-22 01:22:24,439 INFO L78 Accepts]: Start accepts. Automaton has has 35 states, 34 states have (on average 1.3235294117647058) internal successors, (45), 34 states have internal predecessors, (45), 0 states have call successors, (0), 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 24 [2022-11-22 01:22:24,439 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-22 01:22:24,445 INFO L225 Difference]: With dead ends: 1289 [2022-11-22 01:22:24,445 INFO L226 Difference]: Without dead ends: 1289 [2022-11-22 01:22:24,445 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 88 GetRequests, 24 SyntacticMatches, 1 SemanticMatches, 63 ConstructedPredicates, 1 IntricatePredicates, 0 DeprecatedPredicates, 1207 ImplicationChecksByTransitivity, 20.6s TimeCoverageRelationStatistics Valid=679, Invalid=3351, Unknown=6, NotChecked=124, Total=4160 [2022-11-22 01:22:24,446 INFO L413 NwaCegarLoop]: 0 mSDtfsCounter, 329 mSDsluCounter, 0 mSDsCounter, 0 mSdLazyCounter, 1762 mSolverCounterSat, 67 mSolverCounterUnsat, 11 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 27.6s Time, 0 mProtectedPredicate, 0 mProtectedAction, 329 SdHoareTripleChecker+Valid, 0 SdHoareTripleChecker+Invalid, 1954 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 67 IncrementalHoareTripleChecker+Valid, 1762 IncrementalHoareTripleChecker+Invalid, 11 IncrementalHoareTripleChecker+Unknown, 114 IncrementalHoareTripleChecker+Unchecked, 27.9s IncrementalHoareTripleChecker+Time [2022-11-22 01:22:24,446 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [329 Valid, 0 Invalid, 1954 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [67 Valid, 1762 Invalid, 11 Unknown, 114 Unchecked, 27.9s Time] [2022-11-22 01:22:24,447 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1289 states. [2022-11-22 01:22:24,464 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1289 to 845. [2022-11-22 01:22:24,466 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 845 states, 834 states have (on average 2.3956834532374103) internal successors, (1998), 844 states have internal predecessors, (1998), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-22 01:22:24,469 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 845 states to 845 states and 1998 transitions. [2022-11-22 01:22:24,469 INFO L78 Accepts]: Start accepts. Automaton has 845 states and 1998 transitions. Word has length 24 [2022-11-22 01:22:24,469 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-22 01:22:24,470 INFO L495 AbstractCegarLoop]: Abstraction has 845 states and 1998 transitions. [2022-11-22 01:22:24,470 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 35 states, 34 states have (on average 1.3235294117647058) internal successors, (45), 34 states have internal predecessors, (45), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-22 01:22:24,470 INFO L276 IsEmpty]: Start isEmpty. Operand 845 states and 1998 transitions. [2022-11-22 01:22:24,471 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 25 [2022-11-22 01:22:24,471 INFO L187 NwaCegarLoop]: Found error trace [2022-11-22 01:22:24,471 INFO L195 NwaCegarLoop]: trace histogram [10, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-22 01:22:24,482 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_ff69d8cc-fe65-417d-aa30-ee22f35513bc/bin/utaipan-g80aRyZoba/z3 -smt2 -in SMTLIB2_COMPLIANT=true (20)] Ended with exit code 0 [2022-11-22 01:22:24,677 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 20 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_ff69d8cc-fe65-417d-aa30-ee22f35513bc/bin/utaipan-g80aRyZoba/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable33 [2022-11-22 01:22:24,677 INFO L420 AbstractCegarLoop]: === Iteration 35 === Targeting t_funErr1ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr6ASSERT_VIOLATIONINTEGER_OVERFLOW (and 14 more)] === [2022-11-22 01:22:24,678 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-22 01:22:24,678 INFO L85 PathProgramCache]: Analyzing trace with hash -885288029, now seen corresponding path program 2 times [2022-11-22 01:22:24,678 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2022-11-22 01:22:24,678 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1121954304] [2022-11-22 01:22:24,678 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-22 01:22:24,678 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-22 01:22:24,697 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-22 01:22:25,329 INFO L134 CoverageAnalysis]: Checked inductivity of 58 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 55 trivial. 0 not checked. [2022-11-22 01:22:25,330 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2022-11-22 01:22:25,330 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1121954304] [2022-11-22 01:22:25,330 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1121954304] provided 0 perfect and 1 imperfect interpolant sequences [2022-11-22 01:22:25,330 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1500748576] [2022-11-22 01:22:25,330 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2022-11-22 01:22:25,330 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-11-22 01:22:25,331 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_ff69d8cc-fe65-417d-aa30-ee22f35513bc/bin/utaipan-g80aRyZoba/z3 [2022-11-22 01:22:25,331 INFO L229 MonitoredProcess]: Starting monitored process 21 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_ff69d8cc-fe65-417d-aa30-ee22f35513bc/bin/utaipan-g80aRyZoba/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-11-22 01:22:25,334 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_ff69d8cc-fe65-417d-aa30-ee22f35513bc/bin/utaipan-g80aRyZoba/z3 -smt2 -in SMTLIB2_COMPLIANT=true (21)] Waiting until timeout for monitored process [2022-11-22 01:22:25,505 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 2 check-sat command(s) [2022-11-22 01:22:25,506 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-11-22 01:22:25,507 INFO L263 TraceCheckSpWp]: Trace formula consists of 156 conjuncts, 40 conjunts are in the unsatisfiable core [2022-11-22 01:22:25,509 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-11-22 01:22:25,763 INFO L350 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 11 [2022-11-22 01:22:26,018 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-22 01:22:26,019 INFO L350 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 21 treesize of output 20 [2022-11-22 01:22:26,115 INFO L134 CoverageAnalysis]: Checked inductivity of 58 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 55 trivial. 0 not checked. [2022-11-22 01:22:26,116 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-11-22 01:22:26,553 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-11-22 01:22:26,553 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 20 treesize of output 21 [2022-11-22 01:22:26,572 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-11-22 01:22:26,572 INFO L350 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 23 treesize of output 27 [2022-11-22 01:22:26,581 INFO L350 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 8 treesize of output 6 [2022-11-22 01:22:26,606 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-11-22 01:22:26,607 INFO L350 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 34 treesize of output 38 [2022-11-22 01:22:26,837 INFO L134 CoverageAnalysis]: Checked inductivity of 58 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 55 trivial. 0 not checked. [2022-11-22 01:22:26,837 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1500748576] provided 0 perfect and 2 imperfect interpolant sequences [2022-11-22 01:22:26,837 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSifa [465261918] [2022-11-22 01:22:26,838 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:266) at de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.tracehandling.AutomatonFreeRefinementEngine.generateProof(AutomatonFreeRefinementEngine.java:147) 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:336) 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:168) at de.uni_freiburg.informatik.ultimate.core.coreplugin.PluginConnector.runTool(PluginConnector.java:151) at de.uni_freiburg.informatik.ultimate.core.coreplugin.PluginConnector.run(PluginConnector.java:128) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.executePluginConnector(ToolchainWalker.java:232) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.processPlugin(ToolchainWalker.java:226) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.walkUnprotected(ToolchainWalker.java:142) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.walk(ToolchainWalker.java:104) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainManager$Toolchain.processToolchain(ToolchainManager.java:320) 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) [2022-11-22 01:22:26,838 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-11-22 01:22:26,838 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [10, 10, 10] total 30 [2022-11-22 01:22:26,838 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1253908502] [2022-11-22 01:22:26,838 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-11-22 01:22:26,839 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 31 states [2022-11-22 01:22:26,839 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2022-11-22 01:22:26,839 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 31 interpolants. [2022-11-22 01:22:26,840 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=123, Invalid=807, Unknown=0, NotChecked=0, Total=930 [2022-11-22 01:22:26,840 INFO L87 Difference]: Start difference. First operand 845 states and 1998 transitions. Second operand has 31 states, 30 states have (on average 1.5) internal successors, (45), 31 states have internal predecessors, (45), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-22 01:22:43,021 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-22 01:22:43,021 INFO L93 Difference]: Finished difference Result 1332 states and 2945 transitions. [2022-11-22 01:22:43,022 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 110 states. [2022-11-22 01:22:43,022 INFO L78 Accepts]: Start accepts. Automaton has has 31 states, 30 states have (on average 1.5) internal successors, (45), 31 states have internal predecessors, (45), 0 states have call successors, (0), 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 24 [2022-11-22 01:22:43,022 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-22 01:22:43,029 INFO L225 Difference]: With dead ends: 1332 [2022-11-22 01:22:43,029 INFO L226 Difference]: Without dead ends: 1332 [2022-11-22 01:22:43,032 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 160 GetRequests, 27 SyntacticMatches, 0 SemanticMatches, 133 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6458 ImplicationChecksByTransitivity, 13.2s TimeCoverageRelationStatistics Valid=2784, Invalid=15306, Unknown=0, NotChecked=0, Total=18090 [2022-11-22 01:22:43,032 INFO L413 NwaCegarLoop]: 0 mSDtfsCounter, 1231 mSDsluCounter, 0 mSDsCounter, 0 mSdLazyCounter, 1784 mSolverCounterSat, 277 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 3.7s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1231 SdHoareTripleChecker+Valid, 0 SdHoareTripleChecker+Invalid, 2061 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 277 IncrementalHoareTripleChecker+Valid, 1784 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 4.0s IncrementalHoareTripleChecker+Time [2022-11-22 01:22:43,033 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [1231 Valid, 0 Invalid, 2061 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [277 Valid, 1784 Invalid, 0 Unknown, 0 Unchecked, 4.0s Time] [2022-11-22 01:22:43,035 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1332 states. [2022-11-22 01:22:43,075 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1332 to 862. [2022-11-22 01:22:43,077 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 862 states, 851 states have (on average 2.353701527614571) internal successors, (2003), 861 states have internal predecessors, (2003), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-22 01:22:43,080 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 862 states to 862 states and 2003 transitions. [2022-11-22 01:22:43,081 INFO L78 Accepts]: Start accepts. Automaton has 862 states and 2003 transitions. Word has length 24 [2022-11-22 01:22:43,081 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-22 01:22:43,081 INFO L495 AbstractCegarLoop]: Abstraction has 862 states and 2003 transitions. [2022-11-22 01:22:43,081 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 31 states, 30 states have (on average 1.5) internal successors, (45), 31 states have internal predecessors, (45), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-22 01:22:43,082 INFO L276 IsEmpty]: Start isEmpty. Operand 862 states and 2003 transitions. [2022-11-22 01:22:43,082 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 25 [2022-11-22 01:22:43,083 INFO L187 NwaCegarLoop]: Found error trace [2022-11-22 01:22:43,083 INFO L195 NwaCegarLoop]: trace histogram [10, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-22 01:22:43,093 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_ff69d8cc-fe65-417d-aa30-ee22f35513bc/bin/utaipan-g80aRyZoba/z3 -smt2 -in SMTLIB2_COMPLIANT=true (21)] Forceful destruction successful, exit code 0 [2022-11-22 01:22:43,290 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable34,21 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_ff69d8cc-fe65-417d-aa30-ee22f35513bc/bin/utaipan-g80aRyZoba/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-11-22 01:22:43,291 INFO L420 AbstractCegarLoop]: === Iteration 36 === Targeting ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr6ASSERT_VIOLATIONINTEGER_OVERFLOW (and 14 more)] === [2022-11-22 01:22:43,292 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-22 01:22:43,292 INFO L85 PathProgramCache]: Analyzing trace with hash -893097020, now seen corresponding path program 5 times [2022-11-22 01:22:43,292 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2022-11-22 01:22:43,292 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [602852250] [2022-11-22 01:22:43,292 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-22 01:22:43,292 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-22 01:22:43,312 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-22 01:22:43,937 INFO L134 CoverageAnalysis]: Checked inductivity of 57 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 55 trivial. 0 not checked. [2022-11-22 01:22:43,937 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2022-11-22 01:22:43,938 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [602852250] [2022-11-22 01:22:43,938 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [602852250] provided 0 perfect and 1 imperfect interpolant sequences [2022-11-22 01:22:43,938 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [231820413] [2022-11-22 01:22:43,938 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2022-11-22 01:22:43,938 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-11-22 01:22:43,938 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_ff69d8cc-fe65-417d-aa30-ee22f35513bc/bin/utaipan-g80aRyZoba/z3 [2022-11-22 01:22:43,943 INFO L229 MonitoredProcess]: Starting monitored process 22 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_ff69d8cc-fe65-417d-aa30-ee22f35513bc/bin/utaipan-g80aRyZoba/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-11-22 01:22:43,945 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_ff69d8cc-fe65-417d-aa30-ee22f35513bc/bin/utaipan-g80aRyZoba/z3 -smt2 -in SMTLIB2_COMPLIANT=true (22)] Waiting until timeout for monitored process [2022-11-22 01:22:44,146 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 2 check-sat command(s) [2022-11-22 01:22:44,147 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-11-22 01:22:44,149 INFO L263 TraceCheckSpWp]: Trace formula consists of 156 conjuncts, 43 conjunts are in the unsatisfiable core [2022-11-22 01:22:44,151 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-11-22 01:22:44,158 INFO L350 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 [2022-11-22 01:22:44,347 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-22 01:22:44,348 INFO L350 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 13 treesize of output 15 [2022-11-22 01:22:44,547 INFO L350 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 [2022-11-22 01:22:44,896 INFO L350 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 21 treesize of output 16 [2022-11-22 01:22:44,945 INFO L134 CoverageAnalysis]: Checked inductivity of 57 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 55 trivial. 0 not checked. [2022-11-22 01:22:44,945 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-11-22 01:22:45,544 WARN L837 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_1814 Int) (|v_ULTIMATE.start_cache_entry_addref_~entry#1.offset_131| Int) (v_ArrVal_1811 (Array Int Int)) (|v_ULTIMATE.start_main_~#t1~0#1.base_54| Int)) (or (< |v_ULTIMATE.start_cache_entry_addref_~entry#1.offset_131| (+ 28 |c_~#cache~0.offset|)) (not (< |c_#StackHeapBarrier| |v_ULTIMATE.start_main_~#t1~0#1.base_54|)) (< (select (store (select (store |c_#memory_int| |v_ULTIMATE.start_main_~#t1~0#1.base_54| v_ArrVal_1811) |c_~#cache~0.base|) |c_~#cache~0.offset| v_ArrVal_1814) |v_ULTIMATE.start_cache_entry_addref_~entry#1.offset_131|) 2147483647))) is different from false [2022-11-22 01:22:45,682 INFO L134 CoverageAnalysis]: Checked inductivity of 57 backedges. 1 proven. 1 refuted. 0 times theorem prover too weak. 55 trivial. 0 not checked. [2022-11-22 01:22:45,682 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [231820413] provided 0 perfect and 2 imperfect interpolant sequences [2022-11-22 01:22:45,682 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSifa [1243445496] [2022-11-22 01:22:45,682 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:266) at de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.tracehandling.AutomatonFreeRefinementEngine.generateProof(AutomatonFreeRefinementEngine.java:147) 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:336) 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:168) at de.uni_freiburg.informatik.ultimate.core.coreplugin.PluginConnector.runTool(PluginConnector.java:151) at de.uni_freiburg.informatik.ultimate.core.coreplugin.PluginConnector.run(PluginConnector.java:128) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.executePluginConnector(ToolchainWalker.java:232) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.processPlugin(ToolchainWalker.java:226) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.walkUnprotected(ToolchainWalker.java:142) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.walk(ToolchainWalker.java:104) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainManager$Toolchain.processToolchain(ToolchainManager.java:320) 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) [2022-11-22 01:22:45,683 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-11-22 01:22:45,683 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [10, 10, 9] total 29 [2022-11-22 01:22:45,683 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [86915557] [2022-11-22 01:22:45,683 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-11-22 01:22:45,683 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 31 states [2022-11-22 01:22:45,683 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2022-11-22 01:22:45,684 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 31 interpolants. [2022-11-22 01:22:45,684 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=147, Invalid=726, Unknown=1, NotChecked=56, Total=930 [2022-11-22 01:22:45,684 INFO L87 Difference]: Start difference. First operand 862 states and 2003 transitions. Second operand has 31 states, 30 states have (on average 1.5) internal successors, (45), 30 states have internal predecessors, (45), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-22 01:22:50,612 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-22 01:22:50,613 INFO L93 Difference]: Finished difference Result 1173 states and 2640 transitions. [2022-11-22 01:22:50,613 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 23 states. [2022-11-22 01:22:50,613 INFO L78 Accepts]: Start accepts. Automaton has has 31 states, 30 states have (on average 1.5) internal successors, (45), 30 states have internal predecessors, (45), 0 states have call successors, (0), 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 24 [2022-11-22 01:22:50,613 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-22 01:22:50,618 INFO L225 Difference]: With dead ends: 1173 [2022-11-22 01:22:50,619 INFO L226 Difference]: Without dead ends: 1173 [2022-11-22 01:22:50,619 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 73 GetRequests, 26 SyntacticMatches, 2 SemanticMatches, 45 ConstructedPredicates, 1 IntricatePredicates, 0 DeprecatedPredicates, 647 ImplicationChecksByTransitivity, 3.3s TimeCoverageRelationStatistics Valid=371, Invalid=1702, Unknown=1, NotChecked=88, Total=2162 [2022-11-22 01:22:50,620 INFO L413 NwaCegarLoop]: 0 mSDtfsCounter, 155 mSDsluCounter, 0 mSDsCounter, 0 mSdLazyCounter, 930 mSolverCounterSat, 28 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 2.6s Time, 0 mProtectedPredicate, 0 mProtectedAction, 155 SdHoareTripleChecker+Valid, 0 SdHoareTripleChecker+Invalid, 1037 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 28 IncrementalHoareTripleChecker+Valid, 930 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 79 IncrementalHoareTripleChecker+Unchecked, 2.7s IncrementalHoareTripleChecker+Time [2022-11-22 01:22:50,620 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [155 Valid, 0 Invalid, 1037 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [28 Valid, 930 Invalid, 0 Unknown, 79 Unchecked, 2.7s Time] [2022-11-22 01:22:50,622 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1173 states. [2022-11-22 01:22:50,641 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1173 to 862. [2022-11-22 01:22:50,642 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 862 states, 851 states have (on average 2.353701527614571) internal successors, (2003), 861 states have internal predecessors, (2003), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-22 01:22:50,645 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 862 states to 862 states and 2003 transitions. [2022-11-22 01:22:50,648 INFO L78 Accepts]: Start accepts. Automaton has 862 states and 2003 transitions. Word has length 24 [2022-11-22 01:22:50,648 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-22 01:22:50,648 INFO L495 AbstractCegarLoop]: Abstraction has 862 states and 2003 transitions. [2022-11-22 01:22:50,648 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 31 states, 30 states have (on average 1.5) internal successors, (45), 30 states have internal predecessors, (45), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-22 01:22:50,649 INFO L276 IsEmpty]: Start isEmpty. Operand 862 states and 2003 transitions. [2022-11-22 01:22:50,649 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 25 [2022-11-22 01:22:50,649 INFO L187 NwaCegarLoop]: Found error trace [2022-11-22 01:22:50,650 INFO L195 NwaCegarLoop]: trace histogram [10, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-22 01:22:50,656 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_ff69d8cc-fe65-417d-aa30-ee22f35513bc/bin/utaipan-g80aRyZoba/z3 -smt2 -in SMTLIB2_COMPLIANT=true (22)] Ended with exit code 0 [2022-11-22 01:22:50,856 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 22 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_ff69d8cc-fe65-417d-aa30-ee22f35513bc/bin/utaipan-g80aRyZoba/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable35 [2022-11-22 01:22:50,856 INFO L420 AbstractCegarLoop]: === Iteration 37 === Targeting t_funErr0ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr6ASSERT_VIOLATIONINTEGER_OVERFLOW (and 14 more)] === [2022-11-22 01:22:50,857 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-22 01:22:50,857 INFO L85 PathProgramCache]: Analyzing trace with hash -1585885858, now seen corresponding path program 4 times [2022-11-22 01:22:50,857 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2022-11-22 01:22:50,857 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1655336181] [2022-11-22 01:22:50,857 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-22 01:22:50,857 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-22 01:22:50,876 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-22 01:22:51,781 INFO L134 CoverageAnalysis]: Checked inductivity of 58 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 55 trivial. 0 not checked. [2022-11-22 01:22:51,781 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2022-11-22 01:22:51,781 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1655336181] [2022-11-22 01:22:51,781 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1655336181] provided 0 perfect and 1 imperfect interpolant sequences [2022-11-22 01:22:51,781 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [516505952] [2022-11-22 01:22:51,782 INFO L93 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2022-11-22 01:22:51,782 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-11-22 01:22:51,782 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_ff69d8cc-fe65-417d-aa30-ee22f35513bc/bin/utaipan-g80aRyZoba/z3 [2022-11-22 01:22:51,783 INFO L229 MonitoredProcess]: Starting monitored process 23 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_ff69d8cc-fe65-417d-aa30-ee22f35513bc/bin/utaipan-g80aRyZoba/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-11-22 01:22:51,791 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_ff69d8cc-fe65-417d-aa30-ee22f35513bc/bin/utaipan-g80aRyZoba/z3 -smt2 -in SMTLIB2_COMPLIANT=true (23)] Waiting until timeout for monitored process [2022-11-22 01:22:51,978 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-22 01:22:51,980 INFO L263 TraceCheckSpWp]: Trace formula consists of 220 conjuncts, 46 conjunts are in the unsatisfiable core [2022-11-22 01:22:51,983 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-11-22 01:22:52,000 INFO L350 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 [2022-11-22 01:22:52,183 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-22 01:22:52,185 INFO L350 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 13 treesize of output 15 [2022-11-22 01:22:52,471 INFO L350 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 35 treesize of output 28 [2022-11-22 01:22:52,895 INFO L350 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 21 treesize of output 16 [2022-11-22 01:22:52,979 INFO L134 CoverageAnalysis]: Checked inductivity of 58 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 55 trivial. 0 not checked. [2022-11-22 01:22:52,979 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-11-22 01:23:02,923 INFO L134 CoverageAnalysis]: Checked inductivity of 58 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 55 trivial. 0 not checked. [2022-11-22 01:23:02,923 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [516505952] provided 0 perfect and 2 imperfect interpolant sequences [2022-11-22 01:23:02,923 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSifa [154260377] [2022-11-22 01:23:02,924 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:266) at de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.tracehandling.AutomatonFreeRefinementEngine.generateProof(AutomatonFreeRefinementEngine.java:147) 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:336) 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:168) at de.uni_freiburg.informatik.ultimate.core.coreplugin.PluginConnector.runTool(PluginConnector.java:151) at de.uni_freiburg.informatik.ultimate.core.coreplugin.PluginConnector.run(PluginConnector.java:128) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.executePluginConnector(ToolchainWalker.java:232) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.processPlugin(ToolchainWalker.java:226) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.walkUnprotected(ToolchainWalker.java:142) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.walk(ToolchainWalker.java:104) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainManager$Toolchain.processToolchain(ToolchainManager.java:320) 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) [2022-11-22 01:23:02,925 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-11-22 01:23:02,925 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [11, 11, 11] total 33 [2022-11-22 01:23:02,925 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1601130962] [2022-11-22 01:23:02,926 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-11-22 01:23:02,926 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 35 states [2022-11-22 01:23:02,926 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2022-11-22 01:23:02,927 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 35 interpolants. [2022-11-22 01:23:02,927 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=187, Invalid=999, Unknown=4, NotChecked=0, Total=1190 [2022-11-22 01:23:02,927 INFO L87 Difference]: Start difference. First operand 862 states and 2003 transitions. Second operand has 35 states, 34 states have (on average 1.3235294117647058) internal successors, (45), 34 states have internal predecessors, (45), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-22 01:23:09,400 WARN L837 $PredicateComparison]: unable to prove that (let ((.cse1 (+ 28 |c_~#cache~0.offset|))) (and (forall ((|v_ULTIMATE.start_cache_entry_addref_~entry#1.offset_133| Int) (v_ArrVal_1892 Int) (v_ArrVal_1895 Int)) (or (< (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| v_ArrVal_1892)) |c_~#cache~0.base|) |v_ULTIMATE.start_cache_entry_addref_~entry#1.offset_133| v_ArrVal_1895) |c_~#cache~0.offset|) 2147483647) (< |v_ULTIMATE.start_cache_entry_addref_~entry#1.offset_133| (+ (* |c_ULTIMATE.start_main_~i~2#1| 28) 28 |c_~#cache~0.offset|)) (not (<= v_ArrVal_1892 (+ |c_ULTIMATE.start_cache_entry_addref_#t~post32#1| 1))))) (forall ((|v_ULTIMATE.start_cache_entry_addref_~entry#1.offset_133| Int) (v_ArrVal_1892 Int) (|v_ULTIMATE.start_main_~#t1~0#1.base_55| Int) (v_ArrVal_1895 Int) (v_ArrVal_1891 (Array Int Int))) (let ((.cse0 (select (store |c_#memory_int| |v_ULTIMATE.start_main_~#t1~0#1.base_55| v_ArrVal_1891) |c_~#cache~0.base|))) (or (< (select (store (store .cse0 |c_~#cache~0.offset| v_ArrVal_1892) |v_ULTIMATE.start_cache_entry_addref_~entry#1.offset_133| v_ArrVal_1895) |c_~#cache~0.offset|) 2147483647) (< |v_ULTIMATE.start_cache_entry_addref_~entry#1.offset_133| .cse1) (< (+ (select .cse0 |c_~#cache~0.offset|) 1) v_ArrVal_1892) (not (< |c_#StackHeapBarrier| |v_ULTIMATE.start_main_~#t1~0#1.base_55|))))) (exists ((v_ArrVal_1892 Int)) (let ((.cse2 ((as const (Array Int Int)) 0))) (and (<= v_ArrVal_1892 (+ (select .cse2 |c_~#cache~0.offset|) 1)) (= (select |c_#memory_int| |c_~#cache~0.base|) (store .cse2 |c_~#cache~0.offset| v_ArrVal_1892))))) (<= 1 |c_ULTIMATE.start_main_~i~2#1|) (= |c_~#cache~0.base| 1) (= |c_~#cache~0.offset| 0) (= |c_t_funThread1of1ForFork0_~i~0#1| 0) (= |c_~#cache~0.base| |c_ULTIMATE.start_cache_entry_addref_~entry#1.base|) (<= .cse1 |c_ULTIMATE.start_cache_entry_addref_~entry#1.offset|))) is different from false [2022-11-22 01:23:09,852 WARN L837 $PredicateComparison]: unable to prove that (and (forall ((|v_ULTIMATE.start_cache_entry_addref_~entry#1.offset_133| Int) (v_ArrVal_1892 Int) (v_ArrVal_1895 Int)) (or (< (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| v_ArrVal_1892)) |c_~#cache~0.base|) |v_ULTIMATE.start_cache_entry_addref_~entry#1.offset_133| v_ArrVal_1895) |c_~#cache~0.offset|) 2147483647) (< |v_ULTIMATE.start_cache_entry_addref_~entry#1.offset_133| (+ (* |c_ULTIMATE.start_main_~i~2#1| 28) 28 |c_~#cache~0.offset|)) (not (<= v_ArrVal_1892 (+ |c_ULTIMATE.start_cache_entry_addref_#t~post32#1| 1))))) (forall ((|v_ULTIMATE.start_cache_entry_addref_~entry#1.offset_133| Int) (v_ArrVal_1892 Int) (|v_ULTIMATE.start_main_~#t1~0#1.base_55| Int) (v_ArrVal_1895 Int) (v_ArrVal_1891 (Array Int Int))) (let ((.cse0 (select (store |c_#memory_int| |v_ULTIMATE.start_main_~#t1~0#1.base_55| v_ArrVal_1891) |c_~#cache~0.base|))) (or (< (select (store (store .cse0 |c_~#cache~0.offset| v_ArrVal_1892) |v_ULTIMATE.start_cache_entry_addref_~entry#1.offset_133| v_ArrVal_1895) |c_~#cache~0.offset|) 2147483647) (< |v_ULTIMATE.start_cache_entry_addref_~entry#1.offset_133| (+ 28 |c_~#cache~0.offset|)) (< (+ (select .cse0 |c_~#cache~0.offset|) 1) v_ArrVal_1892) (not (< |c_#StackHeapBarrier| |v_ULTIMATE.start_main_~#t1~0#1.base_55|))))) (exists ((v_ArrVal_1892 Int)) (let ((.cse1 ((as const (Array Int Int)) 0))) (and (<= v_ArrVal_1892 (+ (select .cse1 |c_~#cache~0.offset|) 1)) (= (select |c_#memory_int| |c_~#cache~0.base|) (store .cse1 |c_~#cache~0.offset| v_ArrVal_1892))))) (<= 1 |c_ULTIMATE.start_main_~i~2#1|) (= |c_~#cache~0.base| 1) (= |c_~#cache~0.offset| 0) (<= (select (select |c_#memory_int| |c_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.base|) |c_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset|) 1)) is different from false [2022-11-22 01:23:18,532 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] [2022-11-22 01:23:20,558 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] [2022-11-22 01:23:22,708 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] [2022-11-22 01:23:26,353 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] [2022-11-22 01:23:39,421 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]