./Ultimate.py --spec ../../sv-benchmarks/c/properties/no-overflow.prp --file ../../sv-benchmarks/c/weaver/chl-collitem-subst.wvr.c --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for overflows Using default analysis Version 5e519f3a 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_e36b2227-d285-4776-ac3b-7ae48afdc8c7/bin/uautomizer-Dbtcem3rbc/data/config -Xmx15G -Xms4m -jar /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_e36b2227-d285-4776-ac3b-7ae48afdc8c7/bin/uautomizer-Dbtcem3rbc/plugins/org.eclipse.equinox.launcher_1.5.800.v20200727-1323.jar -data @noDefault -ultimatedata /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_e36b2227-d285-4776-ac3b-7ae48afdc8c7/bin/uautomizer-Dbtcem3rbc/data -tc /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_e36b2227-d285-4776-ac3b-7ae48afdc8c7/bin/uautomizer-Dbtcem3rbc/config/AutomizerReach.xml -i ../../sv-benchmarks/c/weaver/chl-collitem-subst.wvr.c -s /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_e36b2227-d285-4776-ac3b-7ae48afdc8c7/bin/uautomizer-Dbtcem3rbc/config/svcomp-Overflow-32bit-Automizer_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_e36b2227-d285-4776-ac3b-7ae48afdc8c7/bin/uautomizer-Dbtcem3rbc --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 Automizer --witnessprinter.graph.data.architecture 32bit --witnessprinter.graph.data.programhash e2cb2ea6991951b6a9c5c1df0de2ac5ff84f75971959d591fa5f258025f94929 --- 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-5e519f3 [2022-11-02 20:45:33,748 INFO L177 SettingsManager]: Resetting all preferences to default values... [2022-11-02 20:45:33,750 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2022-11-02 20:45:33,793 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2022-11-02 20:45:33,793 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2022-11-02 20:45:33,797 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2022-11-02 20:45:33,800 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2022-11-02 20:45:33,804 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2022-11-02 20:45:33,807 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2022-11-02 20:45:33,812 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2022-11-02 20:45:33,813 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2022-11-02 20:45:33,815 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2022-11-02 20:45:33,816 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2022-11-02 20:45:33,818 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2022-11-02 20:45:33,820 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2022-11-02 20:45:33,822 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2022-11-02 20:45:33,824 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2022-11-02 20:45:33,825 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2022-11-02 20:45:33,827 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2022-11-02 20:45:33,837 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2022-11-02 20:45:33,838 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2022-11-02 20:45:33,843 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2022-11-02 20:45:33,847 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2022-11-02 20:45:33,848 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2022-11-02 20:45:33,856 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2022-11-02 20:45:33,857 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2022-11-02 20:45:33,857 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2022-11-02 20:45:33,859 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2022-11-02 20:45:33,860 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2022-11-02 20:45:33,861 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2022-11-02 20:45:33,862 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2022-11-02 20:45:33,863 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2022-11-02 20:45:33,866 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2022-11-02 20:45:33,867 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2022-11-02 20:45:33,869 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2022-11-02 20:45:33,869 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2022-11-02 20:45:33,870 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2022-11-02 20:45:33,870 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2022-11-02 20:45:33,870 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2022-11-02 20:45:33,871 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2022-11-02 20:45:33,872 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2022-11-02 20:45:33,873 INFO L101 SettingsManager]: Beginning loading settings from /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_e36b2227-d285-4776-ac3b-7ae48afdc8c7/bin/uautomizer-Dbtcem3rbc/config/svcomp-Overflow-32bit-Automizer_Default.epf [2022-11-02 20:45:33,906 INFO L113 SettingsManager]: Loading preferences was successful [2022-11-02 20:45:33,906 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2022-11-02 20:45:33,906 INFO L136 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2022-11-02 20:45:33,907 INFO L138 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2022-11-02 20:45:33,907 INFO L136 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2022-11-02 20:45:33,908 INFO L138 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2022-11-02 20:45:33,908 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2022-11-02 20:45:33,909 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2022-11-02 20:45:33,909 INFO L138 SettingsManager]: * Use SBE=true [2022-11-02 20:45:33,909 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2022-11-02 20:45:33,909 INFO L138 SettingsManager]: * sizeof long=4 [2022-11-02 20:45:33,910 INFO L138 SettingsManager]: * Check unreachability of error function in SV-COMP mode=false [2022-11-02 20:45:33,910 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2022-11-02 20:45:33,910 INFO L138 SettingsManager]: * sizeof POINTER=4 [2022-11-02 20:45:33,910 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2022-11-02 20:45:33,911 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2022-11-02 20:45:33,911 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2022-11-02 20:45:33,911 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2022-11-02 20:45:33,911 INFO L138 SettingsManager]: * Check absence of signed integer overflows=true [2022-11-02 20:45:33,912 INFO L138 SettingsManager]: * sizeof long double=12 [2022-11-02 20:45:33,912 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2022-11-02 20:45:33,912 INFO L138 SettingsManager]: * Use constant arrays=true [2022-11-02 20:45:33,912 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2022-11-02 20:45:33,912 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2022-11-02 20:45:33,913 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2022-11-02 20:45:33,913 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2022-11-02 20:45:33,913 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-11-02 20:45:33,913 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2022-11-02 20:45:33,914 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2022-11-02 20:45:33,914 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2022-11-02 20:45:33,914 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2022-11-02 20:45:33,914 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2022-11-02 20:45:33,915 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2022-11-02 20:45:33,915 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_e36b2227-d285-4776-ac3b-7ae48afdc8c7/bin/uautomizer-Dbtcem3rbc/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_e36b2227-d285-4776-ac3b-7ae48afdc8c7/bin/uautomizer-Dbtcem3rbc 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 -> Automizer 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 -> e2cb2ea6991951b6a9c5c1df0de2ac5ff84f75971959d591fa5f258025f94929 [2022-11-02 20:45:34,193 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2022-11-02 20:45:34,222 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2022-11-02 20:45:34,224 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2022-11-02 20:45:34,225 INFO L271 PluginConnector]: Initializing CDTParser... [2022-11-02 20:45:34,226 INFO L275 PluginConnector]: CDTParser initialized [2022-11-02 20:45:34,227 INFO L432 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_e36b2227-d285-4776-ac3b-7ae48afdc8c7/bin/uautomizer-Dbtcem3rbc/../../sv-benchmarks/c/weaver/chl-collitem-subst.wvr.c [2022-11-02 20:45:34,312 INFO L220 CDTParser]: Created temporary CDT project at /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_e36b2227-d285-4776-ac3b-7ae48afdc8c7/bin/uautomizer-Dbtcem3rbc/data/881497c1e/9e51bbc926774f008e30cbd5822f3767/FLAG19ddb2067 [2022-11-02 20:45:34,862 INFO L306 CDTParser]: Found 1 translation units. [2022-11-02 20:45:34,863 INFO L160 CDTParser]: Scanning /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_e36b2227-d285-4776-ac3b-7ae48afdc8c7/sv-benchmarks/c/weaver/chl-collitem-subst.wvr.c [2022-11-02 20:45:34,883 INFO L349 CDTParser]: About to delete temporary CDT project at /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_e36b2227-d285-4776-ac3b-7ae48afdc8c7/bin/uautomizer-Dbtcem3rbc/data/881497c1e/9e51bbc926774f008e30cbd5822f3767/FLAG19ddb2067 [2022-11-02 20:45:35,207 INFO L357 CDTParser]: Successfully deleted /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_e36b2227-d285-4776-ac3b-7ae48afdc8c7/bin/uautomizer-Dbtcem3rbc/data/881497c1e/9e51bbc926774f008e30cbd5822f3767 [2022-11-02 20:45:35,210 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2022-11-02 20:45:35,211 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2022-11-02 20:45:35,213 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2022-11-02 20:45:35,213 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2022-11-02 20:45:35,217 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2022-11-02 20:45:35,217 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 02.11 08:45:35" (1/1) ... [2022-11-02 20:45:35,219 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@25be734d and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.11 08:45:35, skipping insertion in model container [2022-11-02 20:45:35,219 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 02.11 08:45:35" (1/1) ... [2022-11-02 20:45:35,230 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2022-11-02 20:45:35,267 INFO L178 MainTranslator]: Built tables and reachable declarations [2022-11-02 20:45:35,497 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_e36b2227-d285-4776-ac3b-7ae48afdc8c7/sv-benchmarks/c/weaver/chl-collitem-subst.wvr.c[3544,3557] [2022-11-02 20:45:35,502 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-11-02 20:45:35,511 INFO L203 MainTranslator]: Completed pre-run [2022-11-02 20:45:35,539 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_e36b2227-d285-4776-ac3b-7ae48afdc8c7/sv-benchmarks/c/weaver/chl-collitem-subst.wvr.c[3544,3557] [2022-11-02 20:45:35,542 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-11-02 20:45:35,554 INFO L208 MainTranslator]: Completed translation [2022-11-02 20:45:35,555 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.11 08:45:35 WrapperNode [2022-11-02 20:45:35,555 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2022-11-02 20:45:35,556 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2022-11-02 20:45:35,556 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2022-11-02 20:45:35,556 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2022-11-02 20:45:35,563 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.11 08:45:35" (1/1) ... [2022-11-02 20:45:35,586 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.11 08:45:35" (1/1) ... [2022-11-02 20:45:35,650 INFO L138 Inliner]: procedures = 23, calls = 46, calls flagged for inlining = 18, calls inlined = 40, statements flattened = 521 [2022-11-02 20:45:35,650 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2022-11-02 20:45:35,651 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2022-11-02 20:45:35,651 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2022-11-02 20:45:35,651 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2022-11-02 20:45:35,664 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.11 08:45:35" (1/1) ... [2022-11-02 20:45:35,664 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.11 08:45:35" (1/1) ... [2022-11-02 20:45:35,679 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.11 08:45:35" (1/1) ... [2022-11-02 20:45:35,679 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.11 08:45:35" (1/1) ... [2022-11-02 20:45:35,689 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.11 08:45:35" (1/1) ... [2022-11-02 20:45:35,724 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.11 08:45:35" (1/1) ... [2022-11-02 20:45:35,727 INFO L185 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.11 08:45:35" (1/1) ... [2022-11-02 20:45:35,729 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.11 08:45:35" (1/1) ... [2022-11-02 20:45:35,733 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2022-11-02 20:45:35,734 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2022-11-02 20:45:35,735 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2022-11-02 20:45:35,735 INFO L275 PluginConnector]: RCFGBuilder initialized [2022-11-02 20:45:35,744 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.11 08:45:35" (1/1) ... [2022-11-02 20:45:35,753 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-11-02 20:45:35,767 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_e36b2227-d285-4776-ac3b-7ae48afdc8c7/bin/uautomizer-Dbtcem3rbc/z3 [2022-11-02 20:45:35,779 INFO L229 MonitoredProcess]: Starting monitored process 1 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_e36b2227-d285-4776-ac3b-7ae48afdc8c7/bin/uautomizer-Dbtcem3rbc/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (exit command is (exit), workingDir is null) [2022-11-02 20:45:35,792 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_e36b2227-d285-4776-ac3b-7ae48afdc8c7/bin/uautomizer-Dbtcem3rbc/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (1)] Waiting until timeout for monitored process [2022-11-02 20:45:35,832 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2022-11-02 20:45:35,832 INFO L130 BoogieDeclarations]: Found specification of procedure thread1 [2022-11-02 20:45:35,833 INFO L138 BoogieDeclarations]: Found implementation of procedure thread1 [2022-11-02 20:45:35,833 INFO L130 BoogieDeclarations]: Found specification of procedure thread2 [2022-11-02 20:45:35,833 INFO L138 BoogieDeclarations]: Found implementation of procedure thread2 [2022-11-02 20:45:35,834 INFO L130 BoogieDeclarations]: Found specification of procedure thread3 [2022-11-02 20:45:35,834 INFO L138 BoogieDeclarations]: Found implementation of procedure thread3 [2022-11-02 20:45:35,837 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2022-11-02 20:45:35,837 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2022-11-02 20:45:35,838 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2022-11-02 20:45:35,838 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_end [2022-11-02 20:45:35,838 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_begin [2022-11-02 20:45:35,838 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2022-11-02 20:45:35,838 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2022-11-02 20:45:35,838 INFO L130 BoogieDeclarations]: Found specification of procedure read~int [2022-11-02 20:45:35,838 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2022-11-02 20:45:35,840 WARN L209 CfgBuilder]: User set CodeBlockSize to SequenceOfStatements but program contains fork statements. Overwriting the user preferences and setting CodeBlockSize to SingleStatement [2022-11-02 20:45:35,996 INFO L235 CfgBuilder]: Building ICFG [2022-11-02 20:45:35,999 INFO L261 CfgBuilder]: Building CFG for each procedure with an implementation [2022-11-02 20:45:36,975 INFO L276 CfgBuilder]: Performing block encoding [2022-11-02 20:45:41,681 INFO L295 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2022-11-02 20:45:41,681 INFO L300 CfgBuilder]: Removed 0 assume(true) statements. [2022-11-02 20:45:41,684 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 02.11 08:45:41 BoogieIcfgContainer [2022-11-02 20:45:41,684 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2022-11-02 20:45:41,687 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2022-11-02 20:45:41,687 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2022-11-02 20:45:41,690 INFO L275 PluginConnector]: TraceAbstraction initialized [2022-11-02 20:45:41,691 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 02.11 08:45:35" (1/3) ... [2022-11-02 20:45:41,692 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@15b335da and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 02.11 08:45:41, skipping insertion in model container [2022-11-02 20:45:41,692 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.11 08:45:35" (2/3) ... [2022-11-02 20:45:41,692 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@15b335da and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 02.11 08:45:41, skipping insertion in model container [2022-11-02 20:45:41,692 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 02.11 08:45:41" (3/3) ... [2022-11-02 20:45:41,694 INFO L112 eAbstractionObserver]: Analyzing ICFG chl-collitem-subst.wvr.c [2022-11-02 20:45:41,703 WARN L145 ceAbstractionStarter]: Switching off computation of Hoare annotation because input is a concurrent program [2022-11-02 20:45:41,713 INFO L203 ceAbstractionStarter]: Automizer settings: Hoare:false NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2022-11-02 20:45:41,714 INFO L162 ceAbstractionStarter]: Applying trace abstraction to program that has 72 error locations. [2022-11-02 20:45:41,714 INFO L515 ceAbstractionStarter]: Constructing petrified ICFG for 1 thread instances. [2022-11-02 20:45:43,063 INFO L144 ThreadInstanceAdder]: Constructed 3 joinOtherThreadTransitions. [2022-11-02 20:45:43,099 INFO L115 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-11-02 20:45:43,113 INFO L131 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 212 places, 204 transitions, 432 flow [2022-11-02 20:45:43,116 INFO L112 LiptonReduction]: Starting Lipton reduction on Petri net that has 212 places, 204 transitions, 432 flow [2022-11-02 20:45:43,118 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 212 places, 204 transitions, 432 flow [2022-11-02 20:45:43,519 INFO L130 PetriNetUnfolder]: 2/201 cut-off events. [2022-11-02 20:45:43,519 INFO L131 PetriNetUnfolder]: For 3/3 co-relation queries the response was YES. [2022-11-02 20:45:43,522 INFO L83 FinitePrefix]: Finished finitePrefix Result has 214 conditions, 201 events. 2/201 cut-off events. For 3/3 co-relation queries the response was YES. Maximal size of possible extension queue 26. Compared 545 event pairs, 0 based on Foata normal form. 0/127 useless extension candidates. Maximal degree in co-relation 90. Up to 2 conditions per place. [2022-11-02 20:45:43,526 INFO L118 LiptonReduction]: Number of co-enabled transitions 6318 [2022-11-02 20:45:54,516 WARN L234 SmtUtils]: Spent 5.70s on a formula simplification. DAG size of input: 699 DAG size of output: 468 (called from [L 278] de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.cfg.transitions.TransFormulaUtils.sequentialComposition) [2022-11-02 20:46:03,881 WARN L234 SmtUtils]: Spent 5.13s on a formula simplification. DAG size of input: 648 DAG size of output: 374 (called from [L 278] de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.cfg.transitions.TransFormulaUtils.sequentialComposition) [2022-11-02 20:46:17,731 WARN L234 SmtUtils]: Spent 12.06s on a formula simplification. DAG size of input: 1323 DAG size of output: 682 (called from [L 278] de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.cfg.transitions.TransFormulaUtils.sequentialComposition) [2022-11-02 20:46:39,042 WARN L234 SmtUtils]: Spent 18.68s on a formula simplification. DAG size of input: 1524 DAG size of output: 813 (called from [L 278] de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.cfg.transitions.TransFormulaUtils.sequentialComposition) [2022-11-02 20:46:59,232 INFO L133 LiptonReduction]: Checked pairs total: 4380 [2022-11-02 20:46:59,233 INFO L135 LiptonReduction]: Total number of compositions: 124 [2022-11-02 20:46:59,242 INFO L113 iNet2FiniteAutomaton]: Start petriNet2FiniteAutomaton. Operand has 101 places, 91 transitions, 206 flow [2022-11-02 20:47:00,468 INFO L135 iNet2FiniteAutomaton]: Finished petriNet2FiniteAutomaton. Result has 37956 states, 22332 states have (on average 5.6899964176965785) internal successors, (127069), 37955 states have internal predecessors, (127069), 0 states have call successors, (0), 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-02 20:47:00,495 INFO L356 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2022-11-02 20:47:00,503 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;@d339e40, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2022-11-02 20:47:00,503 INFO L358 AbstractCegarLoop]: Starting to check reachability of 147 error locations. [2022-11-02 20:47:00,589 INFO L276 IsEmpty]: Start isEmpty. Operand has 37956 states, 22332 states have (on average 5.6899964176965785) internal successors, (127069), 37955 states have internal predecessors, (127069), 0 states have call successors, (0), 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-02 20:47:00,599 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 4 [2022-11-02 20:47:00,600 INFO L187 NwaCegarLoop]: Found error trace [2022-11-02 20:47:00,601 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1] [2022-11-02 20:47:00,602 INFO L420 AbstractCegarLoop]: === Iteration 1 === Targeting thread1Err12ASSERT_VIOLATIONINTEGER_OVERFLOW === [thread1Err0ASSERT_VIOLATIONINTEGER_OVERFLOW, thread1Err1ASSERT_VIOLATIONINTEGER_OVERFLOW, thread1Err2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 144 more)] === [2022-11-02 20:47:00,611 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-02 20:47:00,611 INFO L85 PathProgramCache]: Analyzing trace with hash 2640098, now seen corresponding path program 1 times [2022-11-02 20:47:00,624 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-02 20:47:00,624 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1364003313] [2022-11-02 20:47:00,625 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-02 20:47:00,625 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-02 20:47:00,889 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 20:47:01,290 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-02 20:47:01,291 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-02 20:47:01,291 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1364003313] [2022-11-02 20:47:01,292 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1364003313] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-02 20:47:01,292 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-02 20:47:01,293 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2022-11-02 20:47:01,294 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1732459894] [2022-11-02 20:47:01,295 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-02 20:47:01,300 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-11-02 20:47:01,300 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-02 20:47:01,328 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-11-02 20:47:01,329 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-11-02 20:47:01,406 INFO L87 Difference]: Start difference. First operand has 37956 states, 22332 states have (on average 5.6899964176965785) internal successors, (127069), 37955 states have internal predecessors, (127069), 0 states have call successors, (0), 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.5) internal successors, (3), 2 states have internal predecessors, (3), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-02 20:47:02,224 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-02 20:47:02,225 INFO L93 Difference]: Finished difference Result 11692 states and 38261 transitions. [2022-11-02 20:47:02,227 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-11-02 20:47:02,229 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 2 states have (on average 1.5) internal successors, (3), 2 states have internal predecessors, (3), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 3 [2022-11-02 20:47:02,229 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-02 20:47:02,403 INFO L225 Difference]: With dead ends: 11692 [2022-11-02 20:47:02,403 INFO L226 Difference]: Without dead ends: 11692 [2022-11-02 20:47:02,404 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-02 20:47:02,410 INFO L413 NwaCegarLoop]: 0 mSDtfsCounter, 58 mSDsluCounter, 0 mSDsCounter, 0 mSdLazyCounter, 60 mSolverCounterSat, 25 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 58 SdHoareTripleChecker+Valid, 0 SdHoareTripleChecker+Invalid, 85 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 25 IncrementalHoareTripleChecker+Valid, 60 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.6s IncrementalHoareTripleChecker+Time [2022-11-02 20:47:02,416 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [58 Valid, 0 Invalid, 85 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [25 Valid, 60 Invalid, 0 Unknown, 0 Unchecked, 0.6s Time] [2022-11-02 20:47:02,483 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 11692 states. [2022-11-02 20:47:02,925 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 11692 to 11692. [2022-11-02 20:47:02,957 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 11692 states, 7341 states have (on average 5.211960223402806) internal successors, (38261), 11691 states have internal predecessors, (38261), 0 states have call successors, (0), 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-02 20:47:03,425 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 11692 states to 11692 states and 38261 transitions. [2022-11-02 20:47:03,426 INFO L78 Accepts]: Start accepts. Automaton has 11692 states and 38261 transitions. Word has length 3 [2022-11-02 20:47:03,427 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-02 20:47:03,428 INFO L495 AbstractCegarLoop]: Abstraction has 11692 states and 38261 transitions. [2022-11-02 20:47:03,428 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 2 states have (on average 1.5) internal successors, (3), 2 states have internal predecessors, (3), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-02 20:47:03,439 INFO L276 IsEmpty]: Start isEmpty. Operand 11692 states and 38261 transitions. [2022-11-02 20:47:03,440 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 4 [2022-11-02 20:47:03,440 INFO L187 NwaCegarLoop]: Found error trace [2022-11-02 20:47:03,440 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1] [2022-11-02 20:47:03,441 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2022-11-02 20:47:03,441 INFO L420 AbstractCegarLoop]: === Iteration 2 === Targeting thread1Err15ASSERT_VIOLATIONINTEGER_OVERFLOW === [thread1Err0ASSERT_VIOLATIONINTEGER_OVERFLOW, thread1Err1ASSERT_VIOLATIONINTEGER_OVERFLOW, thread1Err2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 144 more)] === [2022-11-02 20:47:03,443 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-02 20:47:03,443 INFO L85 PathProgramCache]: Analyzing trace with hash 2640101, now seen corresponding path program 1 times [2022-11-02 20:47:03,443 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-02 20:47:03,444 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [607825235] [2022-11-02 20:47:03,444 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-02 20:47:03,444 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-02 20:47:03,515 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 20:47:03,647 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-02 20:47:03,647 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-02 20:47:03,648 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [607825235] [2022-11-02 20:47:03,648 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [607825235] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-02 20:47:03,648 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-02 20:47:03,648 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2022-11-02 20:47:03,648 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1513853141] [2022-11-02 20:47:03,649 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-02 20:47:03,650 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-11-02 20:47:03,650 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-02 20:47:03,651 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-11-02 20:47:03,651 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-11-02 20:47:03,651 INFO L87 Difference]: Start difference. First operand 11692 states and 38261 transitions. Second operand has 3 states, 2 states have (on average 1.5) internal successors, (3), 2 states have internal predecessors, (3), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-02 20:47:04,326 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-02 20:47:04,326 INFO L93 Difference]: Finished difference Result 10428 states and 34021 transitions. [2022-11-02 20:47:04,327 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-11-02 20:47:04,327 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 2 states have (on average 1.5) internal successors, (3), 2 states have internal predecessors, (3), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 3 [2022-11-02 20:47:04,327 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-02 20:47:04,406 INFO L225 Difference]: With dead ends: 10428 [2022-11-02 20:47:04,407 INFO L226 Difference]: Without dead ends: 10428 [2022-11-02 20:47:04,407 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-02 20:47:04,409 INFO L413 NwaCegarLoop]: 0 mSDtfsCounter, 56 mSDsluCounter, 0 mSDsCounter, 0 mSdLazyCounter, 58 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 56 SdHoareTripleChecker+Valid, 0 SdHoareTripleChecker+Invalid, 59 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 58 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.5s IncrementalHoareTripleChecker+Time [2022-11-02 20:47:04,410 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [56 Valid, 0 Invalid, 59 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 58 Invalid, 0 Unknown, 0 Unchecked, 0.5s Time] [2022-11-02 20:47:04,444 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 10428 states. [2022-11-02 20:47:04,862 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 10428 to 10428. [2022-11-02 20:47:04,881 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 10428 states, 6604 states have (on average 5.1515748031496065) internal successors, (34021), 10427 states have internal predecessors, (34021), 0 states have call successors, (0), 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-02 20:47:04,954 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 10428 states to 10428 states and 34021 transitions. [2022-11-02 20:47:04,955 INFO L78 Accepts]: Start accepts. Automaton has 10428 states and 34021 transitions. Word has length 3 [2022-11-02 20:47:04,955 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-02 20:47:04,955 INFO L495 AbstractCegarLoop]: Abstraction has 10428 states and 34021 transitions. [2022-11-02 20:47:04,956 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 2 states have (on average 1.5) internal successors, (3), 2 states have internal predecessors, (3), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-02 20:47:04,957 INFO L276 IsEmpty]: Start isEmpty. Operand 10428 states and 34021 transitions. [2022-11-02 20:47:04,957 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 4 [2022-11-02 20:47:04,957 INFO L187 NwaCegarLoop]: Found error trace [2022-11-02 20:47:04,958 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1] [2022-11-02 20:47:04,958 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2022-11-02 20:47:04,958 INFO L420 AbstractCegarLoop]: === Iteration 3 === Targeting thread1Err16ASSERT_VIOLATIONINTEGER_OVERFLOW === [thread1Err0ASSERT_VIOLATIONINTEGER_OVERFLOW, thread1Err1ASSERT_VIOLATIONINTEGER_OVERFLOW, thread1Err2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 144 more)] === [2022-11-02 20:47:04,960 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-02 20:47:04,961 INFO L85 PathProgramCache]: Analyzing trace with hash 2640102, now seen corresponding path program 1 times [2022-11-02 20:47:04,961 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-02 20:47:04,961 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [285700791] [2022-11-02 20:47:04,962 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-02 20:47:04,962 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-02 20:47:05,052 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 20:47:05,552 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-02 20:47:05,552 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-02 20:47:05,552 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [285700791] [2022-11-02 20:47:05,553 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [285700791] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-02 20:47:05,553 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-02 20:47:05,553 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2022-11-02 20:47:05,553 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [58561791] [2022-11-02 20:47:05,554 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-02 20:47:05,554 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-11-02 20:47:05,554 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-02 20:47:05,555 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-11-02 20:47:05,555 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-11-02 20:47:05,555 INFO L87 Difference]: Start difference. First operand 10428 states and 34021 transitions. Second operand has 3 states, 2 states have (on average 1.5) internal successors, (3), 2 states have internal predecessors, (3), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-02 20:47:05,958 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-02 20:47:05,958 INFO L93 Difference]: Finished difference Result 9272 states and 30163 transitions. [2022-11-02 20:47:05,959 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-11-02 20:47:05,959 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 2 states have (on average 1.5) internal successors, (3), 2 states have internal predecessors, (3), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 3 [2022-11-02 20:47:05,959 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-02 20:47:06,019 INFO L225 Difference]: With dead ends: 9272 [2022-11-02 20:47:06,019 INFO L226 Difference]: Without dead ends: 9272 [2022-11-02 20:47:06,020 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-02 20:47:06,021 INFO L413 NwaCegarLoop]: 0 mSDtfsCounter, 54 mSDsluCounter, 0 mSDsCounter, 0 mSdLazyCounter, 56 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 54 SdHoareTripleChecker+Valid, 0 SdHoareTripleChecker+Invalid, 57 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 56 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2022-11-02 20:47:06,022 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [54 Valid, 0 Invalid, 57 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 56 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2022-11-02 20:47:06,050 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 9272 states. [2022-11-02 20:47:06,486 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 9272 to 9272. [2022-11-02 20:47:06,500 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 9272 states, 5913 states have (on average 5.101133096566887) internal successors, (30163), 9271 states have internal predecessors, (30163), 0 states have call successors, (0), 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-02 20:47:06,554 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9272 states to 9272 states and 30163 transitions. [2022-11-02 20:47:06,555 INFO L78 Accepts]: Start accepts. Automaton has 9272 states and 30163 transitions. Word has length 3 [2022-11-02 20:47:06,556 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-02 20:47:06,556 INFO L495 AbstractCegarLoop]: Abstraction has 9272 states and 30163 transitions. [2022-11-02 20:47:06,556 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 2 states have (on average 1.5) internal successors, (3), 2 states have internal predecessors, (3), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-02 20:47:06,556 INFO L276 IsEmpty]: Start isEmpty. Operand 9272 states and 30163 transitions. [2022-11-02 20:47:06,558 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 4 [2022-11-02 20:47:06,558 INFO L187 NwaCegarLoop]: Found error trace [2022-11-02 20:47:06,559 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1] [2022-11-02 20:47:06,559 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2022-11-02 20:47:06,559 INFO L420 AbstractCegarLoop]: === Iteration 4 === Targeting thread1Err17ASSERT_VIOLATIONINTEGER_OVERFLOW === [thread1Err0ASSERT_VIOLATIONINTEGER_OVERFLOW, thread1Err1ASSERT_VIOLATIONINTEGER_OVERFLOW, thread1Err2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 144 more)] === [2022-11-02 20:47:06,560 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-02 20:47:06,561 INFO L85 PathProgramCache]: Analyzing trace with hash 2640103, now seen corresponding path program 1 times [2022-11-02 20:47:06,561 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-02 20:47:06,564 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [423820106] [2022-11-02 20:47:06,564 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-02 20:47:06,564 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-02 20:47:06,634 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 20:47:07,067 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-02 20:47:07,070 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-02 20:47:07,070 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [423820106] [2022-11-02 20:47:07,072 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [423820106] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-02 20:47:07,073 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-02 20:47:07,073 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2022-11-02 20:47:07,073 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [479592813] [2022-11-02 20:47:07,073 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-02 20:47:07,074 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-11-02 20:47:07,074 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-02 20:47:07,075 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-11-02 20:47:07,075 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-11-02 20:47:07,076 INFO L87 Difference]: Start difference. First operand 9272 states and 30163 transitions. Second operand has 3 states, 2 states have (on average 1.5) internal successors, (3), 2 states have internal predecessors, (3), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-02 20:47:07,567 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-02 20:47:07,568 INFO L93 Difference]: Finished difference Result 8184 states and 26537 transitions. [2022-11-02 20:47:07,568 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-11-02 20:47:07,569 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 2 states have (on average 1.5) internal successors, (3), 2 states have internal predecessors, (3), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 3 [2022-11-02 20:47:07,569 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-02 20:47:07,629 INFO L225 Difference]: With dead ends: 8184 [2022-11-02 20:47:07,630 INFO L226 Difference]: Without dead ends: 8184 [2022-11-02 20:47:07,630 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-02 20:47:07,632 INFO L413 NwaCegarLoop]: 0 mSDtfsCounter, 52 mSDsluCounter, 0 mSDsCounter, 0 mSdLazyCounter, 54 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 52 SdHoareTripleChecker+Valid, 0 SdHoareTripleChecker+Invalid, 55 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 54 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2022-11-02 20:47:07,632 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [52 Valid, 0 Invalid, 55 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 54 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time] [2022-11-02 20:47:07,665 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 8184 states. [2022-11-02 20:47:07,928 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 8184 to 8184. [2022-11-02 20:47:07,943 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 8184 states, 5260 states have (on average 5.045057034220532) internal successors, (26537), 8183 states have internal predecessors, (26537), 0 states have call successors, (0), 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-02 20:47:07,995 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8184 states to 8184 states and 26537 transitions. [2022-11-02 20:47:07,996 INFO L78 Accepts]: Start accepts. Automaton has 8184 states and 26537 transitions. Word has length 3 [2022-11-02 20:47:07,996 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-02 20:47:07,997 INFO L495 AbstractCegarLoop]: Abstraction has 8184 states and 26537 transitions. [2022-11-02 20:47:07,997 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 2 states have (on average 1.5) internal successors, (3), 2 states have internal predecessors, (3), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-02 20:47:07,997 INFO L276 IsEmpty]: Start isEmpty. Operand 8184 states and 26537 transitions. [2022-11-02 20:47:07,997 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 4 [2022-11-02 20:47:07,998 INFO L187 NwaCegarLoop]: Found error trace [2022-11-02 20:47:07,998 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1] [2022-11-02 20:47:07,998 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2022-11-02 20:47:07,999 INFO L420 AbstractCegarLoop]: === Iteration 5 === Targeting thread1Err18ASSERT_VIOLATIONINTEGER_OVERFLOW === [thread1Err0ASSERT_VIOLATIONINTEGER_OVERFLOW, thread1Err1ASSERT_VIOLATIONINTEGER_OVERFLOW, thread1Err2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 144 more)] === [2022-11-02 20:47:07,999 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-02 20:47:07,999 INFO L85 PathProgramCache]: Analyzing trace with hash 2640104, now seen corresponding path program 1 times [2022-11-02 20:47:08,000 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-02 20:47:08,000 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1373798437] [2022-11-02 20:47:08,000 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-02 20:47:08,000 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-02 20:47:08,198 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 20:47:08,254 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-02 20:47:08,255 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-02 20:47:08,255 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1373798437] [2022-11-02 20:47:08,256 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1373798437] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-02 20:47:08,257 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-02 20:47:08,257 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2022-11-02 20:47:08,257 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2134674145] [2022-11-02 20:47:08,257 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-02 20:47:08,263 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-11-02 20:47:08,264 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-02 20:47:08,264 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-11-02 20:47:08,265 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-11-02 20:47:08,265 INFO L87 Difference]: Start difference. First operand 8184 states and 26537 transitions. Second operand has 3 states, 2 states have (on average 1.5) internal successors, (3), 2 states have internal predecessors, (3), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-02 20:47:08,610 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-02 20:47:08,610 INFO L93 Difference]: Finished difference Result 7188 states and 23215 transitions. [2022-11-02 20:47:08,611 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-11-02 20:47:08,611 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 2 states have (on average 1.5) internal successors, (3), 2 states have internal predecessors, (3), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 3 [2022-11-02 20:47:08,612 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-02 20:47:08,659 INFO L225 Difference]: With dead ends: 7188 [2022-11-02 20:47:08,660 INFO L226 Difference]: Without dead ends: 7188 [2022-11-02 20:47:08,660 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-02 20:47:08,661 INFO L413 NwaCegarLoop]: 0 mSDtfsCounter, 50 mSDsluCounter, 0 mSDsCounter, 0 mSdLazyCounter, 52 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 50 SdHoareTripleChecker+Valid, 0 SdHoareTripleChecker+Invalid, 53 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 52 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2022-11-02 20:47:08,661 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [50 Valid, 0 Invalid, 53 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 52 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2022-11-02 20:47:08,683 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 7188 states. [2022-11-02 20:47:08,860 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 7188 to 7188. [2022-11-02 20:47:08,872 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 7188 states, 4669 states have (on average 4.97215677875348) internal successors, (23215), 7187 states have internal predecessors, (23215), 0 states have call successors, (0), 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-02 20:47:09,090 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7188 states to 7188 states and 23215 transitions. [2022-11-02 20:47:09,091 INFO L78 Accepts]: Start accepts. Automaton has 7188 states and 23215 transitions. Word has length 3 [2022-11-02 20:47:09,092 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-02 20:47:09,092 INFO L495 AbstractCegarLoop]: Abstraction has 7188 states and 23215 transitions. [2022-11-02 20:47:09,092 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 2 states have (on average 1.5) internal successors, (3), 2 states have internal predecessors, (3), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-02 20:47:09,092 INFO L276 IsEmpty]: Start isEmpty. Operand 7188 states and 23215 transitions. [2022-11-02 20:47:09,093 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 4 [2022-11-02 20:47:09,093 INFO L187 NwaCegarLoop]: Found error trace [2022-11-02 20:47:09,093 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1] [2022-11-02 20:47:09,094 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2022-11-02 20:47:09,094 INFO L420 AbstractCegarLoop]: === Iteration 6 === Targeting thread1Err21ASSERT_VIOLATIONINTEGER_OVERFLOW === [thread1Err0ASSERT_VIOLATIONINTEGER_OVERFLOW, thread1Err1ASSERT_VIOLATIONINTEGER_OVERFLOW, thread1Err2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 144 more)] === [2022-11-02 20:47:09,095 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-02 20:47:09,095 INFO L85 PathProgramCache]: Analyzing trace with hash 2640107, now seen corresponding path program 1 times [2022-11-02 20:47:09,095 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-02 20:47:09,095 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1402947842] [2022-11-02 20:47:09,096 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-02 20:47:09,096 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-02 20:47:09,158 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 20:47:09,212 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-02 20:47:09,212 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-02 20:47:09,213 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1402947842] [2022-11-02 20:47:09,213 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1402947842] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-02 20:47:09,213 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-02 20:47:09,213 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2022-11-02 20:47:09,214 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [12030114] [2022-11-02 20:47:09,214 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-02 20:47:09,214 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-11-02 20:47:09,214 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-02 20:47:09,215 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-11-02 20:47:09,215 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-11-02 20:47:09,215 INFO L87 Difference]: Start difference. First operand 7188 states and 23215 transitions. Second operand has 3 states, 2 states have (on average 1.5) internal successors, (3), 2 states have internal predecessors, (3), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-02 20:47:09,534 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-02 20:47:09,534 INFO L93 Difference]: Finished difference Result 6256 states and 20113 transitions. [2022-11-02 20:47:09,535 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-11-02 20:47:09,536 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 2 states have (on average 1.5) internal successors, (3), 2 states have internal predecessors, (3), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 3 [2022-11-02 20:47:09,536 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-02 20:47:09,575 INFO L225 Difference]: With dead ends: 6256 [2022-11-02 20:47:09,575 INFO L226 Difference]: Without dead ends: 6256 [2022-11-02 20:47:09,576 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-02 20:47:09,578 INFO L413 NwaCegarLoop]: 0 mSDtfsCounter, 48 mSDsluCounter, 0 mSDsCounter, 0 mSdLazyCounter, 50 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 48 SdHoareTripleChecker+Valid, 0 SdHoareTripleChecker+Invalid, 51 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 50 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2022-11-02 20:47:09,578 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [48 Valid, 0 Invalid, 51 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 50 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2022-11-02 20:47:09,599 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 6256 states. [2022-11-02 20:47:09,746 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 6256 to 6256. [2022-11-02 20:47:09,755 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 6256 states, 4112 states have (on average 4.891293774319066) internal successors, (20113), 6255 states have internal predecessors, (20113), 0 states have call successors, (0), 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-02 20:47:09,913 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6256 states to 6256 states and 20113 transitions. [2022-11-02 20:47:09,914 INFO L78 Accepts]: Start accepts. Automaton has 6256 states and 20113 transitions. Word has length 3 [2022-11-02 20:47:09,914 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-02 20:47:09,914 INFO L495 AbstractCegarLoop]: Abstraction has 6256 states and 20113 transitions. [2022-11-02 20:47:09,914 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 2 states have (on average 1.5) internal successors, (3), 2 states have internal predecessors, (3), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-02 20:47:09,914 INFO L276 IsEmpty]: Start isEmpty. Operand 6256 states and 20113 transitions. [2022-11-02 20:47:09,915 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 4 [2022-11-02 20:47:09,915 INFO L187 NwaCegarLoop]: Found error trace [2022-11-02 20:47:09,915 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1] [2022-11-02 20:47:09,915 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2022-11-02 20:47:09,915 INFO L420 AbstractCegarLoop]: === Iteration 7 === Targeting thread1Err0ASSERT_VIOLATIONINTEGER_OVERFLOW === [thread1Err0ASSERT_VIOLATIONINTEGER_OVERFLOW, thread1Err1ASSERT_VIOLATIONINTEGER_OVERFLOW, thread1Err2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 144 more)] === [2022-11-02 20:47:09,917 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-02 20:47:09,917 INFO L85 PathProgramCache]: Analyzing trace with hash 2640086, now seen corresponding path program 1 times [2022-11-02 20:47:09,917 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-02 20:47:09,917 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [547038403] [2022-11-02 20:47:09,917 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-02 20:47:09,918 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-02 20:47:09,952 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 20:47:09,986 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-02 20:47:09,986 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-02 20:47:09,987 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [547038403] [2022-11-02 20:47:09,987 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [547038403] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-02 20:47:09,987 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-02 20:47:09,987 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2022-11-02 20:47:09,987 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [223039697] [2022-11-02 20:47:09,987 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-02 20:47:09,988 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-11-02 20:47:09,988 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-02 20:47:09,988 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-11-02 20:47:09,989 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-11-02 20:47:09,989 INFO L87 Difference]: Start difference. First operand 6256 states and 20113 transitions. Second operand has 3 states, 2 states have (on average 1.5) internal successors, (3), 2 states have internal predecessors, (3), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-02 20:47:10,267 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-02 20:47:10,267 INFO L93 Difference]: Finished difference Result 5388 states and 17231 transitions. [2022-11-02 20:47:10,271 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-11-02 20:47:10,271 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 2 states have (on average 1.5) internal successors, (3), 2 states have internal predecessors, (3), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 3 [2022-11-02 20:47:10,271 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-02 20:47:10,299 INFO L225 Difference]: With dead ends: 5388 [2022-11-02 20:47:10,300 INFO L226 Difference]: Without dead ends: 5388 [2022-11-02 20:47:10,300 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-02 20:47:10,301 INFO L413 NwaCegarLoop]: 0 mSDtfsCounter, 46 mSDsluCounter, 0 mSDsCounter, 0 mSdLazyCounter, 48 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 46 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.2s IncrementalHoareTripleChecker+Time [2022-11-02 20:47:10,301 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [46 Valid, 0 Invalid, 49 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 48 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2022-11-02 20:47:10,317 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 5388 states. [2022-11-02 20:47:10,440 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 5388 to 5388. [2022-11-02 20:47:10,448 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 5388 states, 3589 states have (on average 4.801058790749512) internal successors, (17231), 5387 states have internal predecessors, (17231), 0 states have call successors, (0), 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-02 20:47:10,475 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5388 states to 5388 states and 17231 transitions. [2022-11-02 20:47:10,475 INFO L78 Accepts]: Start accepts. Automaton has 5388 states and 17231 transitions. Word has length 3 [2022-11-02 20:47:10,475 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-02 20:47:10,475 INFO L495 AbstractCegarLoop]: Abstraction has 5388 states and 17231 transitions. [2022-11-02 20:47:10,476 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 2 states have (on average 1.5) internal successors, (3), 2 states have internal predecessors, (3), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-02 20:47:10,476 INFO L276 IsEmpty]: Start isEmpty. Operand 5388 states and 17231 transitions. [2022-11-02 20:47:10,476 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 4 [2022-11-02 20:47:10,476 INFO L187 NwaCegarLoop]: Found error trace [2022-11-02 20:47:10,477 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1] [2022-11-02 20:47:10,477 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2022-11-02 20:47:10,477 INFO L420 AbstractCegarLoop]: === Iteration 8 === Targeting thread1Err3ASSERT_VIOLATIONINTEGER_OVERFLOW === [thread1Err0ASSERT_VIOLATIONINTEGER_OVERFLOW, thread1Err1ASSERT_VIOLATIONINTEGER_OVERFLOW, thread1Err2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 144 more)] === [2022-11-02 20:47:10,478 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-02 20:47:10,478 INFO L85 PathProgramCache]: Analyzing trace with hash 2640089, now seen corresponding path program 1 times [2022-11-02 20:47:10,480 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-02 20:47:10,480 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [385626481] [2022-11-02 20:47:10,480 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-02 20:47:10,480 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-02 20:47:10,526 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 20:47:10,703 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-02 20:47:10,703 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-02 20:47:10,703 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [385626481] [2022-11-02 20:47:10,703 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [385626481] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-02 20:47:10,704 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-02 20:47:10,704 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2022-11-02 20:47:10,704 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [496445488] [2022-11-02 20:47:10,704 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-02 20:47:10,704 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-11-02 20:47:10,704 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-02 20:47:10,705 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-11-02 20:47:10,708 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-11-02 20:47:10,709 INFO L87 Difference]: Start difference. First operand 5388 states and 17231 transitions. Second operand has 3 states, 2 states have (on average 1.5) internal successors, (3), 2 states have internal predecessors, (3), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-02 20:47:10,983 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-02 20:47:10,984 INFO L93 Difference]: Finished difference Result 4584 states and 14569 transitions. [2022-11-02 20:47:10,984 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-11-02 20:47:10,984 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 2 states have (on average 1.5) internal successors, (3), 2 states have internal predecessors, (3), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 3 [2022-11-02 20:47:10,985 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-02 20:47:11,010 INFO L225 Difference]: With dead ends: 4584 [2022-11-02 20:47:11,011 INFO L226 Difference]: Without dead ends: 4584 [2022-11-02 20:47:11,011 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-02 20:47:11,013 INFO L413 NwaCegarLoop]: 0 mSDtfsCounter, 44 mSDsluCounter, 0 mSDsCounter, 0 mSdLazyCounter, 46 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 44 SdHoareTripleChecker+Valid, 0 SdHoareTripleChecker+Invalid, 47 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 46 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2022-11-02 20:47:11,014 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [44 Valid, 0 Invalid, 47 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 46 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2022-11-02 20:47:11,028 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 4584 states. [2022-11-02 20:47:11,137 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 4584 to 4584. [2022-11-02 20:47:11,144 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 4584 states, 3100 states have (on average 4.699677419354838) internal successors, (14569), 4583 states have internal predecessors, (14569), 0 states have call successors, (0), 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-02 20:47:11,165 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4584 states to 4584 states and 14569 transitions. [2022-11-02 20:47:11,166 INFO L78 Accepts]: Start accepts. Automaton has 4584 states and 14569 transitions. Word has length 3 [2022-11-02 20:47:11,166 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-02 20:47:11,166 INFO L495 AbstractCegarLoop]: Abstraction has 4584 states and 14569 transitions. [2022-11-02 20:47:11,166 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 2 states have (on average 1.5) internal successors, (3), 2 states have internal predecessors, (3), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-02 20:47:11,167 INFO L276 IsEmpty]: Start isEmpty. Operand 4584 states and 14569 transitions. [2022-11-02 20:47:11,167 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 4 [2022-11-02 20:47:11,167 INFO L187 NwaCegarLoop]: Found error trace [2022-11-02 20:47:11,167 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1] [2022-11-02 20:47:11,167 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2022-11-02 20:47:11,168 INFO L420 AbstractCegarLoop]: === Iteration 9 === Targeting thread1Err4ASSERT_VIOLATIONINTEGER_OVERFLOW === [thread1Err0ASSERT_VIOLATIONINTEGER_OVERFLOW, thread1Err1ASSERT_VIOLATIONINTEGER_OVERFLOW, thread1Err2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 144 more)] === [2022-11-02 20:47:11,168 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-02 20:47:11,168 INFO L85 PathProgramCache]: Analyzing trace with hash 2640090, now seen corresponding path program 1 times [2022-11-02 20:47:11,169 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-02 20:47:11,169 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1329576406] [2022-11-02 20:47:11,169 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-02 20:47:11,169 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-02 20:47:11,212 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 20:47:11,327 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-02 20:47:11,327 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-02 20:47:11,327 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1329576406] [2022-11-02 20:47:11,327 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1329576406] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-02 20:47:11,328 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-02 20:47:11,328 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2022-11-02 20:47:11,328 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [182047758] [2022-11-02 20:47:11,328 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-02 20:47:11,328 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-11-02 20:47:11,329 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-02 20:47:11,329 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-11-02 20:47:11,329 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-11-02 20:47:11,330 INFO L87 Difference]: Start difference. First operand 4584 states and 14569 transitions. Second operand has 3 states, 2 states have (on average 1.5) internal successors, (3), 2 states have internal predecessors, (3), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-02 20:47:11,629 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-02 20:47:11,629 INFO L93 Difference]: Finished difference Result 3908 states and 12347 transitions. [2022-11-02 20:47:11,629 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-11-02 20:47:11,630 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 2 states have (on average 1.5) internal successors, (3), 2 states have internal predecessors, (3), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 3 [2022-11-02 20:47:11,630 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-02 20:47:11,648 INFO L225 Difference]: With dead ends: 3908 [2022-11-02 20:47:11,648 INFO L226 Difference]: Without dead ends: 3908 [2022-11-02 20:47:11,648 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-02 20:47:11,651 INFO L413 NwaCegarLoop]: 0 mSDtfsCounter, 42 mSDsluCounter, 0 mSDsCounter, 0 mSdLazyCounter, 44 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 42 SdHoareTripleChecker+Valid, 0 SdHoareTripleChecker+Invalid, 45 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 44 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2022-11-02 20:47:11,651 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [42 Valid, 0 Invalid, 45 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 44 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2022-11-02 20:47:11,665 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3908 states. [2022-11-02 20:47:11,770 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3908 to 3908. [2022-11-02 20:47:11,776 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3908 states, 2677 states have (on average 4.612252521479268) internal successors, (12347), 3907 states have internal predecessors, (12347), 0 states have call successors, (0), 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-02 20:47:11,800 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3908 states to 3908 states and 12347 transitions. [2022-11-02 20:47:11,800 INFO L78 Accepts]: Start accepts. Automaton has 3908 states and 12347 transitions. Word has length 3 [2022-11-02 20:47:11,800 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-02 20:47:11,800 INFO L495 AbstractCegarLoop]: Abstraction has 3908 states and 12347 transitions. [2022-11-02 20:47:11,801 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 2 states have (on average 1.5) internal successors, (3), 2 states have internal predecessors, (3), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-02 20:47:11,801 INFO L276 IsEmpty]: Start isEmpty. Operand 3908 states and 12347 transitions. [2022-11-02 20:47:11,801 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 4 [2022-11-02 20:47:11,801 INFO L187 NwaCegarLoop]: Found error trace [2022-11-02 20:47:11,802 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1] [2022-11-02 20:47:11,802 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2022-11-02 20:47:11,802 INFO L420 AbstractCegarLoop]: === Iteration 10 === Targeting thread1Err5ASSERT_VIOLATIONINTEGER_OVERFLOW === [thread1Err0ASSERT_VIOLATIONINTEGER_OVERFLOW, thread1Err1ASSERT_VIOLATIONINTEGER_OVERFLOW, thread1Err2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 144 more)] === [2022-11-02 20:47:11,803 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-02 20:47:11,803 INFO L85 PathProgramCache]: Analyzing trace with hash 2640091, now seen corresponding path program 1 times [2022-11-02 20:47:11,803 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-02 20:47:11,803 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1489913684] [2022-11-02 20:47:11,804 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-02 20:47:11,804 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-02 20:47:11,873 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 20:47:12,053 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-02 20:47:12,053 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-02 20:47:12,054 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1489913684] [2022-11-02 20:47:12,054 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1489913684] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-02 20:47:12,054 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-02 20:47:12,054 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2022-11-02 20:47:12,055 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1179325452] [2022-11-02 20:47:12,055 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-02 20:47:12,055 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-11-02 20:47:12,055 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-02 20:47:12,056 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-11-02 20:47:12,056 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-11-02 20:47:12,056 INFO L87 Difference]: Start difference. First operand 3908 states and 12347 transitions. Second operand has 3 states, 2 states have (on average 1.5) internal successors, (3), 2 states have internal predecessors, (3), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-02 20:47:12,332 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-02 20:47:12,332 INFO L93 Difference]: Finished difference Result 3284 states and 10301 transitions. [2022-11-02 20:47:12,333 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-11-02 20:47:12,333 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 2 states have (on average 1.5) internal successors, (3), 2 states have internal predecessors, (3), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 3 [2022-11-02 20:47:12,333 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-02 20:47:12,352 INFO L225 Difference]: With dead ends: 3284 [2022-11-02 20:47:12,352 INFO L226 Difference]: Without dead ends: 3284 [2022-11-02 20:47:12,353 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-02 20:47:12,354 INFO L413 NwaCegarLoop]: 0 mSDtfsCounter, 40 mSDsluCounter, 0 mSDsCounter, 0 mSdLazyCounter, 42 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 40 SdHoareTripleChecker+Valid, 0 SdHoareTripleChecker+Invalid, 43 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 42 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2022-11-02 20:47:12,354 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [40 Valid, 0 Invalid, 43 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 42 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2022-11-02 20:47:12,367 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3284 states. [2022-11-02 20:47:12,464 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3284 to 3284. [2022-11-02 20:47:12,469 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3284 states, 2284 states have (on average 4.510070052539405) internal successors, (10301), 3283 states have internal predecessors, (10301), 0 states have call successors, (0), 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-02 20:47:12,491 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3284 states to 3284 states and 10301 transitions. [2022-11-02 20:47:12,491 INFO L78 Accepts]: Start accepts. Automaton has 3284 states and 10301 transitions. Word has length 3 [2022-11-02 20:47:12,491 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-02 20:47:12,492 INFO L495 AbstractCegarLoop]: Abstraction has 3284 states and 10301 transitions. [2022-11-02 20:47:12,492 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 2 states have (on average 1.5) internal successors, (3), 2 states have internal predecessors, (3), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-02 20:47:12,492 INFO L276 IsEmpty]: Start isEmpty. Operand 3284 states and 10301 transitions. [2022-11-02 20:47:12,492 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 4 [2022-11-02 20:47:12,493 INFO L187 NwaCegarLoop]: Found error trace [2022-11-02 20:47:12,493 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1] [2022-11-02 20:47:12,493 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9 [2022-11-02 20:47:12,494 INFO L420 AbstractCegarLoop]: === Iteration 11 === Targeting thread1Err22ASSERT_VIOLATIONINTEGER_OVERFLOW === [thread1Err0ASSERT_VIOLATIONINTEGER_OVERFLOW, thread1Err1ASSERT_VIOLATIONINTEGER_OVERFLOW, thread1Err2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 144 more)] === [2022-11-02 20:47:12,494 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-02 20:47:12,494 INFO L85 PathProgramCache]: Analyzing trace with hash 2640108, now seen corresponding path program 1 times [2022-11-02 20:47:12,495 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-02 20:47:12,495 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1076365510] [2022-11-02 20:47:12,495 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-02 20:47:12,495 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-02 20:47:12,635 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 20:47:12,892 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-02 20:47:12,893 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-02 20:47:12,893 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1076365510] [2022-11-02 20:47:12,893 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1076365510] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-02 20:47:12,893 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-02 20:47:12,893 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2022-11-02 20:47:12,894 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1303242425] [2022-11-02 20:47:12,894 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-02 20:47:12,894 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-11-02 20:47:12,894 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-02 20:47:12,895 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-11-02 20:47:12,896 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-11-02 20:47:12,896 INFO L87 Difference]: Start difference. First operand 3284 states and 10301 transitions. Second operand has 3 states, 2 states have (on average 1.5) internal successors, (3), 2 states have internal predecessors, (3), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-02 20:47:13,111 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-02 20:47:13,111 INFO L93 Difference]: Finished difference Result 2712 states and 8431 transitions. [2022-11-02 20:47:13,111 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-11-02 20:47:13,112 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 2 states have (on average 1.5) internal successors, (3), 2 states have internal predecessors, (3), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 3 [2022-11-02 20:47:13,112 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-02 20:47:13,123 INFO L225 Difference]: With dead ends: 2712 [2022-11-02 20:47:13,123 INFO L226 Difference]: Without dead ends: 2712 [2022-11-02 20:47:13,123 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-02 20:47:13,124 INFO L413 NwaCegarLoop]: 0 mSDtfsCounter, 38 mSDsluCounter, 0 mSDsCounter, 0 mSdLazyCounter, 40 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 38 SdHoareTripleChecker+Valid, 0 SdHoareTripleChecker+Invalid, 41 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 40 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2022-11-02 20:47:13,125 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [38 Valid, 0 Invalid, 41 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 40 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2022-11-02 20:47:13,133 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2712 states. [2022-11-02 20:47:13,185 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2712 to 2712. [2022-11-02 20:47:13,189 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 2712 states, 1921 states have (on average 4.388859968766267) internal successors, (8431), 2711 states have internal predecessors, (8431), 0 states have call successors, (0), 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-02 20:47:13,200 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2712 states to 2712 states and 8431 transitions. [2022-11-02 20:47:13,200 INFO L78 Accepts]: Start accepts. Automaton has 2712 states and 8431 transitions. Word has length 3 [2022-11-02 20:47:13,200 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-02 20:47:13,201 INFO L495 AbstractCegarLoop]: Abstraction has 2712 states and 8431 transitions. [2022-11-02 20:47:13,201 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 2 states have (on average 1.5) internal successors, (3), 2 states have internal predecessors, (3), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-02 20:47:13,201 INFO L276 IsEmpty]: Start isEmpty. Operand 2712 states and 8431 transitions. [2022-11-02 20:47:13,201 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 4 [2022-11-02 20:47:13,201 INFO L187 NwaCegarLoop]: Found error trace [2022-11-02 20:47:13,202 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1] [2022-11-02 20:47:13,202 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10 [2022-11-02 20:47:13,202 INFO L420 AbstractCegarLoop]: === Iteration 12 === Targeting thread1Err6ASSERT_VIOLATIONINTEGER_OVERFLOW === [thread1Err0ASSERT_VIOLATIONINTEGER_OVERFLOW, thread1Err1ASSERT_VIOLATIONINTEGER_OVERFLOW, thread1Err2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 144 more)] === [2022-11-02 20:47:13,202 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-02 20:47:13,203 INFO L85 PathProgramCache]: Analyzing trace with hash 2640092, now seen corresponding path program 1 times [2022-11-02 20:47:13,203 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-02 20:47:13,203 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [356473162] [2022-11-02 20:47:13,203 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-02 20:47:13,203 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-02 20:47:13,241 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 20:47:13,268 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-02 20:47:13,269 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-02 20:47:13,269 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [356473162] [2022-11-02 20:47:13,269 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [356473162] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-02 20:47:13,269 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-02 20:47:13,269 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2022-11-02 20:47:13,270 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [260092274] [2022-11-02 20:47:13,270 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-02 20:47:13,270 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-11-02 20:47:13,270 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-02 20:47:13,271 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-11-02 20:47:13,271 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-11-02 20:47:13,271 INFO L87 Difference]: Start difference. First operand 2712 states and 8431 transitions. Second operand has 3 states, 2 states have (on average 1.5) internal successors, (3), 2 states have internal predecessors, (3), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-02 20:47:13,479 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-02 20:47:13,480 INFO L93 Difference]: Finished difference Result 2188 states and 6721 transitions. [2022-11-02 20:47:13,480 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-11-02 20:47:13,480 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 2 states have (on average 1.5) internal successors, (3), 2 states have internal predecessors, (3), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 3 [2022-11-02 20:47:13,480 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-02 20:47:13,486 INFO L225 Difference]: With dead ends: 2188 [2022-11-02 20:47:13,486 INFO L226 Difference]: Without dead ends: 2188 [2022-11-02 20:47:13,487 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-02 20:47:13,487 INFO L413 NwaCegarLoop]: 0 mSDtfsCounter, 36 mSDsluCounter, 0 mSDsCounter, 0 mSdLazyCounter, 38 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 36 SdHoareTripleChecker+Valid, 0 SdHoareTripleChecker+Invalid, 39 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 38 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2022-11-02 20:47:13,488 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [36 Valid, 0 Invalid, 39 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 38 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2022-11-02 20:47:13,493 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2188 states. [2022-11-02 20:47:13,535 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2188 to 2188. [2022-11-02 20:47:13,538 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 2188 states, 1589 states have (on average 4.229704216488358) internal successors, (6721), 2187 states have internal predecessors, (6721), 0 states have call successors, (0), 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-02 20:47:13,546 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2188 states to 2188 states and 6721 transitions. [2022-11-02 20:47:13,546 INFO L78 Accepts]: Start accepts. Automaton has 2188 states and 6721 transitions. Word has length 3 [2022-11-02 20:47:13,546 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-02 20:47:13,547 INFO L495 AbstractCegarLoop]: Abstraction has 2188 states and 6721 transitions. [2022-11-02 20:47:13,547 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 2 states have (on average 1.5) internal successors, (3), 2 states have internal predecessors, (3), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-02 20:47:13,547 INFO L276 IsEmpty]: Start isEmpty. Operand 2188 states and 6721 transitions. [2022-11-02 20:47:13,547 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 4 [2022-11-02 20:47:13,547 INFO L187 NwaCegarLoop]: Found error trace [2022-11-02 20:47:13,548 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1] [2022-11-02 20:47:13,548 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable11 [2022-11-02 20:47:13,548 INFO L420 AbstractCegarLoop]: === Iteration 13 === Targeting thread1Err23ASSERT_VIOLATIONINTEGER_OVERFLOW === [thread1Err0ASSERT_VIOLATIONINTEGER_OVERFLOW, thread1Err1ASSERT_VIOLATIONINTEGER_OVERFLOW, thread1Err2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 144 more)] === [2022-11-02 20:47:13,548 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-02 20:47:13,548 INFO L85 PathProgramCache]: Analyzing trace with hash 2640109, now seen corresponding path program 1 times [2022-11-02 20:47:13,549 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-02 20:47:13,549 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [517495114] [2022-11-02 20:47:13,549 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-02 20:47:13,549 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-02 20:47:13,607 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 20:47:13,718 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-02 20:47:13,718 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-02 20:47:13,718 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [517495114] [2022-11-02 20:47:13,719 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [517495114] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-02 20:47:13,719 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-02 20:47:13,719 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2022-11-02 20:47:13,719 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [917552679] [2022-11-02 20:47:13,719 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-02 20:47:13,720 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-11-02 20:47:13,720 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-02 20:47:13,720 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-11-02 20:47:13,720 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-11-02 20:47:13,721 INFO L87 Difference]: Start difference. First operand 2188 states and 6721 transitions. Second operand has 3 states, 2 states have (on average 1.5) internal successors, (3), 2 states have internal predecessors, (3), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-02 20:47:13,902 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-02 20:47:13,902 INFO L93 Difference]: Finished difference Result 1732 states and 5243 transitions. [2022-11-02 20:47:13,903 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-11-02 20:47:13,903 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 2 states have (on average 1.5) internal successors, (3), 2 states have internal predecessors, (3), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 3 [2022-11-02 20:47:13,903 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-02 20:47:13,911 INFO L225 Difference]: With dead ends: 1732 [2022-11-02 20:47:13,911 INFO L226 Difference]: Without dead ends: 1732 [2022-11-02 20:47:13,912 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-02 20:47:13,913 INFO L413 NwaCegarLoop]: 0 mSDtfsCounter, 34 mSDsluCounter, 0 mSDsCounter, 0 mSdLazyCounter, 36 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 34 SdHoareTripleChecker+Valid, 0 SdHoareTripleChecker+Invalid, 37 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 36 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2022-11-02 20:47:13,913 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [34 Valid, 0 Invalid, 37 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 36 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2022-11-02 20:47:13,918 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1732 states. [2022-11-02 20:47:13,948 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1732 to 1732. [2022-11-02 20:47:13,950 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1732 states, 1293 states have (on average 4.054911059551431) internal successors, (5243), 1731 states have internal predecessors, (5243), 0 states have call successors, (0), 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-02 20:47:13,957 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1732 states to 1732 states and 5243 transitions. [2022-11-02 20:47:13,957 INFO L78 Accepts]: Start accepts. Automaton has 1732 states and 5243 transitions. Word has length 3 [2022-11-02 20:47:13,958 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-02 20:47:13,958 INFO L495 AbstractCegarLoop]: Abstraction has 1732 states and 5243 transitions. [2022-11-02 20:47:13,958 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 2 states have (on average 1.5) internal successors, (3), 2 states have internal predecessors, (3), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-02 20:47:13,958 INFO L276 IsEmpty]: Start isEmpty. Operand 1732 states and 5243 transitions. [2022-11-02 20:47:13,958 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 4 [2022-11-02 20:47:13,958 INFO L187 NwaCegarLoop]: Found error trace [2022-11-02 20:47:13,959 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1] [2022-11-02 20:47:13,959 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable12 [2022-11-02 20:47:13,959 INFO L420 AbstractCegarLoop]: === Iteration 14 === Targeting thread1Err9ASSERT_VIOLATIONINTEGER_OVERFLOW === [thread1Err0ASSERT_VIOLATIONINTEGER_OVERFLOW, thread1Err1ASSERT_VIOLATIONINTEGER_OVERFLOW, thread1Err2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 144 more)] === [2022-11-02 20:47:13,959 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-02 20:47:13,960 INFO L85 PathProgramCache]: Analyzing trace with hash 2640095, now seen corresponding path program 1 times [2022-11-02 20:47:13,960 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-02 20:47:13,960 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [441260357] [2022-11-02 20:47:13,960 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-02 20:47:13,960 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-02 20:47:13,997 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 20:47:14,053 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-02 20:47:14,053 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-02 20:47:14,053 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [441260357] [2022-11-02 20:47:14,054 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [441260357] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-02 20:47:14,054 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-02 20:47:14,054 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2022-11-02 20:47:14,054 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [321717559] [2022-11-02 20:47:14,054 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-02 20:47:14,055 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-11-02 20:47:14,055 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-02 20:47:14,055 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-11-02 20:47:14,055 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-11-02 20:47:14,056 INFO L87 Difference]: Start difference. First operand 1732 states and 5243 transitions. Second operand has 3 states, 2 states have (on average 1.5) internal successors, (3), 2 states have internal predecessors, (3), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-02 20:47:14,230 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-02 20:47:14,230 INFO L93 Difference]: Finished difference Result 1320 states and 3913 transitions. [2022-11-02 20:47:14,231 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-11-02 20:47:14,231 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 2 states have (on average 1.5) internal successors, (3), 2 states have internal predecessors, (3), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 3 [2022-11-02 20:47:14,231 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-02 20:47:14,236 INFO L225 Difference]: With dead ends: 1320 [2022-11-02 20:47:14,236 INFO L226 Difference]: Without dead ends: 1320 [2022-11-02 20:47:14,236 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-02 20:47:14,238 INFO L413 NwaCegarLoop]: 0 mSDtfsCounter, 32 mSDsluCounter, 0 mSDsCounter, 0 mSdLazyCounter, 34 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 32 SdHoareTripleChecker+Valid, 0 SdHoareTripleChecker+Invalid, 35 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 34 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2022-11-02 20:47:14,239 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [32 Valid, 0 Invalid, 35 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 34 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2022-11-02 20:47:14,243 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1320 states. [2022-11-02 20:47:14,264 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1320 to 1320. [2022-11-02 20:47:14,266 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1320 states, 1024 states have (on average 3.8212890625) internal successors, (3913), 1319 states have internal predecessors, (3913), 0 states have call successors, (0), 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-02 20:47:14,271 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1320 states to 1320 states and 3913 transitions. [2022-11-02 20:47:14,271 INFO L78 Accepts]: Start accepts. Automaton has 1320 states and 3913 transitions. Word has length 3 [2022-11-02 20:47:14,271 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-02 20:47:14,272 INFO L495 AbstractCegarLoop]: Abstraction has 1320 states and 3913 transitions. [2022-11-02 20:47:14,272 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 2 states have (on average 1.5) internal successors, (3), 2 states have internal predecessors, (3), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-02 20:47:14,272 INFO L276 IsEmpty]: Start isEmpty. Operand 1320 states and 3913 transitions. [2022-11-02 20:47:14,273 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 4 [2022-11-02 20:47:14,273 INFO L187 NwaCegarLoop]: Found error trace [2022-11-02 20:47:14,273 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1] [2022-11-02 20:47:14,273 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable13 [2022-11-02 20:47:14,274 INFO L420 AbstractCegarLoop]: === Iteration 15 === Targeting thread1Err10ASSERT_VIOLATIONINTEGER_OVERFLOW === [thread1Err0ASSERT_VIOLATIONINTEGER_OVERFLOW, thread1Err1ASSERT_VIOLATIONINTEGER_OVERFLOW, thread1Err2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 144 more)] === [2022-11-02 20:47:14,274 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-02 20:47:14,274 INFO L85 PathProgramCache]: Analyzing trace with hash 2640096, now seen corresponding path program 1 times [2022-11-02 20:47:14,274 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-02 20:47:14,274 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1402045521] [2022-11-02 20:47:14,275 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-02 20:47:14,275 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-02 20:47:14,317 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 20:47:14,460 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-02 20:47:14,460 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-02 20:47:14,460 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1402045521] [2022-11-02 20:47:14,460 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1402045521] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-02 20:47:14,461 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-02 20:47:14,461 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2022-11-02 20:47:14,461 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [929829238] [2022-11-02 20:47:14,461 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-02 20:47:14,461 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-11-02 20:47:14,462 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-02 20:47:14,462 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-11-02 20:47:14,462 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-11-02 20:47:14,463 INFO L87 Difference]: Start difference. First operand 1320 states and 3913 transitions. Second operand has 3 states, 2 states have (on average 1.5) internal successors, (3), 2 states have internal predecessors, (3), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-02 20:47:14,619 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-02 20:47:14,619 INFO L93 Difference]: Finished difference Result 968 states and 2785 transitions. [2022-11-02 20:47:14,619 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-11-02 20:47:14,620 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 2 states have (on average 1.5) internal successors, (3), 2 states have internal predecessors, (3), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 3 [2022-11-02 20:47:14,620 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-02 20:47:14,623 INFO L225 Difference]: With dead ends: 968 [2022-11-02 20:47:14,624 INFO L226 Difference]: Without dead ends: 968 [2022-11-02 20:47:14,625 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-02 20:47:14,627 INFO L413 NwaCegarLoop]: 0 mSDtfsCounter, 30 mSDsluCounter, 0 mSDsCounter, 0 mSdLazyCounter, 32 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 30 SdHoareTripleChecker+Valid, 0 SdHoareTripleChecker+Invalid, 33 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 32 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-11-02 20:47:14,627 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [30 Valid, 0 Invalid, 33 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 32 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-11-02 20:47:14,630 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 968 states. [2022-11-02 20:47:14,650 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 968 to 968. [2022-11-02 20:47:14,673 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 968 states, 789 states have (on average 3.5297845373891) internal successors, (2785), 967 states have internal predecessors, (2785), 0 states have call successors, (0), 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-02 20:47:14,676 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 968 states to 968 states and 2785 transitions. [2022-11-02 20:47:14,677 INFO L78 Accepts]: Start accepts. Automaton has 968 states and 2785 transitions. Word has length 3 [2022-11-02 20:47:14,677 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-02 20:47:14,677 INFO L495 AbstractCegarLoop]: Abstraction has 968 states and 2785 transitions. [2022-11-02 20:47:14,677 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 2 states have (on average 1.5) internal successors, (3), 2 states have internal predecessors, (3), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-02 20:47:14,678 INFO L276 IsEmpty]: Start isEmpty. Operand 968 states and 2785 transitions. [2022-11-02 20:47:14,678 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 4 [2022-11-02 20:47:14,678 INFO L187 NwaCegarLoop]: Found error trace [2022-11-02 20:47:14,678 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1] [2022-11-02 20:47:14,678 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable14 [2022-11-02 20:47:14,678 INFO L420 AbstractCegarLoop]: === Iteration 16 === Targeting thread1Err11ASSERT_VIOLATIONINTEGER_OVERFLOW === [thread1Err0ASSERT_VIOLATIONINTEGER_OVERFLOW, thread1Err1ASSERT_VIOLATIONINTEGER_OVERFLOW, thread1Err2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 144 more)] === [2022-11-02 20:47:14,679 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-02 20:47:14,679 INFO L85 PathProgramCache]: Analyzing trace with hash 2640097, now seen corresponding path program 1 times [2022-11-02 20:47:14,680 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-02 20:47:14,680 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1755411751] [2022-11-02 20:47:14,680 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-02 20:47:14,680 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-02 20:47:14,717 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 20:47:14,826 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-02 20:47:14,827 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-02 20:47:14,827 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1755411751] [2022-11-02 20:47:14,830 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1755411751] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-02 20:47:14,830 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-02 20:47:14,830 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2022-11-02 20:47:14,830 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [543577712] [2022-11-02 20:47:14,831 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-02 20:47:14,832 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-11-02 20:47:14,832 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-02 20:47:14,833 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-11-02 20:47:14,833 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-11-02 20:47:14,833 INFO L87 Difference]: Start difference. First operand 968 states and 2785 transitions. Second operand has 3 states, 2 states have (on average 1.5) internal successors, (3), 2 states have internal predecessors, (3), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-02 20:47:14,991 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-02 20:47:14,992 INFO L93 Difference]: Finished difference Result 660 states and 1805 transitions. [2022-11-02 20:47:14,992 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-11-02 20:47:14,992 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 2 states have (on average 1.5) internal successors, (3), 2 states have internal predecessors, (3), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 3 [2022-11-02 20:47:14,992 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-02 20:47:15,002 INFO L225 Difference]: With dead ends: 660 [2022-11-02 20:47:15,003 INFO L226 Difference]: Without dead ends: 658 [2022-11-02 20:47:15,003 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-02 20:47:15,004 INFO L413 NwaCegarLoop]: 0 mSDtfsCounter, 28 mSDsluCounter, 0 mSDsCounter, 0 mSdLazyCounter, 30 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 28 SdHoareTripleChecker+Valid, 0 SdHoareTripleChecker+Invalid, 31 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 30 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2022-11-02 20:47:15,004 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [28 Valid, 0 Invalid, 31 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 30 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2022-11-02 20:47:15,006 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 658 states. [2022-11-02 20:47:15,018 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 658 to 658. [2022-11-02 20:47:15,019 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 658 states, 578 states have (on average 3.114186851211073) internal successors, (1800), 657 states have internal predecessors, (1800), 0 states have call successors, (0), 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-02 20:47:15,021 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 658 states to 658 states and 1800 transitions. [2022-11-02 20:47:15,022 INFO L78 Accepts]: Start accepts. Automaton has 658 states and 1800 transitions. Word has length 3 [2022-11-02 20:47:15,022 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-02 20:47:15,023 INFO L495 AbstractCegarLoop]: Abstraction has 658 states and 1800 transitions. [2022-11-02 20:47:15,023 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 2 states have (on average 1.5) internal successors, (3), 2 states have internal predecessors, (3), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-02 20:47:15,023 INFO L276 IsEmpty]: Start isEmpty. Operand 658 states and 1800 transitions. [2022-11-02 20:47:15,024 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 6 [2022-11-02 20:47:15,024 INFO L187 NwaCegarLoop]: Found error trace [2022-11-02 20:47:15,024 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1] [2022-11-02 20:47:15,025 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable15 [2022-11-02 20:47:15,025 INFO L420 AbstractCegarLoop]: === Iteration 17 === Targeting thread2Err18ASSERT_VIOLATIONINTEGER_OVERFLOW === [thread1Err0ASSERT_VIOLATIONINTEGER_OVERFLOW, thread1Err1ASSERT_VIOLATIONINTEGER_OVERFLOW, thread1Err2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 144 more)] === [2022-11-02 20:47:15,026 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-02 20:47:15,027 INFO L85 PathProgramCache]: Analyzing trace with hash -1757585815, now seen corresponding path program 1 times [2022-11-02 20:47:15,027 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-02 20:47:15,027 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1220238367] [2022-11-02 20:47:15,027 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-02 20:47:15,027 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-02 20:47:15,075 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 20:47:15,192 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-02 20:47:15,192 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-02 20:47:15,193 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1220238367] [2022-11-02 20:47:15,193 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1220238367] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-02 20:47:15,193 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-02 20:47:15,193 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2022-11-02 20:47:15,193 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2045428780] [2022-11-02 20:47:15,194 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-02 20:47:15,194 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-11-02 20:47:15,194 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-02 20:47:15,195 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-11-02 20:47:15,195 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-11-02 20:47:15,195 INFO L87 Difference]: Start difference. First operand 658 states and 1800 transitions. Second operand has 3 states, 2 states have (on average 2.5) internal successors, (5), 2 states have internal predecessors, (5), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-02 20:47:15,330 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-02 20:47:15,331 INFO L93 Difference]: Finished difference Result 538 states and 1456 transitions. [2022-11-02 20:47:15,331 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-11-02 20:47:15,331 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 2 states have (on average 2.5) internal successors, (5), 2 states have internal predecessors, (5), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 5 [2022-11-02 20:47:15,331 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-02 20:47:15,333 INFO L225 Difference]: With dead ends: 538 [2022-11-02 20:47:15,334 INFO L226 Difference]: Without dead ends: 538 [2022-11-02 20:47:15,334 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-02 20:47:15,335 INFO L413 NwaCegarLoop]: 0 mSDtfsCounter, 24 mSDsluCounter, 0 mSDsCounter, 0 mSdLazyCounter, 28 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 24 SdHoareTripleChecker+Valid, 0 SdHoareTripleChecker+Invalid, 29 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 28 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-11-02 20:47:15,335 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [24 Valid, 0 Invalid, 29 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 28 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-11-02 20:47:15,337 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 538 states. [2022-11-02 20:47:15,346 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 538 to 538. [2022-11-02 20:47:15,347 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 538 states, 475 states have (on average 3.0652631578947367) internal successors, (1456), 537 states have internal predecessors, (1456), 0 states have call successors, (0), 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-02 20:47:15,349 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 538 states to 538 states and 1456 transitions. [2022-11-02 20:47:15,349 INFO L78 Accepts]: Start accepts. Automaton has 538 states and 1456 transitions. Word has length 5 [2022-11-02 20:47:15,349 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-02 20:47:15,350 INFO L495 AbstractCegarLoop]: Abstraction has 538 states and 1456 transitions. [2022-11-02 20:47:15,350 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 2 states have (on average 2.5) internal successors, (5), 2 states have internal predecessors, (5), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-02 20:47:15,350 INFO L276 IsEmpty]: Start isEmpty. Operand 538 states and 1456 transitions. [2022-11-02 20:47:15,350 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 6 [2022-11-02 20:47:15,351 INFO L187 NwaCegarLoop]: Found error trace [2022-11-02 20:47:15,351 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1] [2022-11-02 20:47:15,351 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable16 [2022-11-02 20:47:15,351 INFO L420 AbstractCegarLoop]: === Iteration 18 === Targeting thread2Err3ASSERT_VIOLATIONINTEGER_OVERFLOW === [thread1Err0ASSERT_VIOLATIONINTEGER_OVERFLOW, thread1Err1ASSERT_VIOLATIONINTEGER_OVERFLOW, thread1Err2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 144 more)] === [2022-11-02 20:47:15,352 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-02 20:47:15,352 INFO L85 PathProgramCache]: Analyzing trace with hash -1757585830, now seen corresponding path program 1 times [2022-11-02 20:47:15,352 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-02 20:47:15,352 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [500872631] [2022-11-02 20:47:15,353 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-02 20:47:15,353 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-02 20:47:15,390 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 20:47:15,432 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-02 20:47:15,432 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-02 20:47:15,433 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [500872631] [2022-11-02 20:47:15,433 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [500872631] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-02 20:47:15,433 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-02 20:47:15,433 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2022-11-02 20:47:15,433 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1391307616] [2022-11-02 20:47:15,434 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-02 20:47:15,434 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-11-02 20:47:15,434 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-02 20:47:15,435 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-11-02 20:47:15,435 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-11-02 20:47:15,435 INFO L87 Difference]: Start difference. First operand 538 states and 1456 transitions. Second operand has 3 states, 2 states have (on average 2.5) internal successors, (5), 2 states have internal predecessors, (5), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-02 20:47:15,546 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-02 20:47:15,547 INFO L93 Difference]: Finished difference Result 430 states and 1148 transitions. [2022-11-02 20:47:15,547 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-11-02 20:47:15,547 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 2 states have (on average 2.5) internal successors, (5), 2 states have internal predecessors, (5), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 5 [2022-11-02 20:47:15,548 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-02 20:47:15,549 INFO L225 Difference]: With dead ends: 430 [2022-11-02 20:47:15,549 INFO L226 Difference]: Without dead ends: 430 [2022-11-02 20:47:15,550 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-02 20:47:15,550 INFO L413 NwaCegarLoop]: 0 mSDtfsCounter, 22 mSDsluCounter, 0 mSDsCounter, 0 mSdLazyCounter, 26 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 22 SdHoareTripleChecker+Valid, 0 SdHoareTripleChecker+Invalid, 27 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 26 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-11-02 20:47:15,551 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [22 Valid, 0 Invalid, 27 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 26 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-11-02 20:47:15,552 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 430 states. [2022-11-02 20:47:15,559 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 430 to 430. [2022-11-02 20:47:15,560 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 430 states, 382 states have (on average 3.005235602094241) internal successors, (1148), 429 states have internal predecessors, (1148), 0 states have call successors, (0), 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-02 20:47:15,562 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 430 states to 430 states and 1148 transitions. [2022-11-02 20:47:15,562 INFO L78 Accepts]: Start accepts. Automaton has 430 states and 1148 transitions. Word has length 5 [2022-11-02 20:47:15,563 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-02 20:47:15,563 INFO L495 AbstractCegarLoop]: Abstraction has 430 states and 1148 transitions. [2022-11-02 20:47:15,563 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 2 states have (on average 2.5) internal successors, (5), 2 states have internal predecessors, (5), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-02 20:47:15,563 INFO L276 IsEmpty]: Start isEmpty. Operand 430 states and 1148 transitions. [2022-11-02 20:47:15,564 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 6 [2022-11-02 20:47:15,564 INFO L187 NwaCegarLoop]: Found error trace [2022-11-02 20:47:15,564 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1] [2022-11-02 20:47:15,564 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable17 [2022-11-02 20:47:15,564 INFO L420 AbstractCegarLoop]: === Iteration 19 === Targeting thread2Err21ASSERT_VIOLATIONINTEGER_OVERFLOW === [thread1Err0ASSERT_VIOLATIONINTEGER_OVERFLOW, thread1Err1ASSERT_VIOLATIONINTEGER_OVERFLOW, thread1Err2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 144 more)] === [2022-11-02 20:47:15,565 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-02 20:47:15,565 INFO L85 PathProgramCache]: Analyzing trace with hash -1757585812, now seen corresponding path program 1 times [2022-11-02 20:47:15,565 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-02 20:47:15,565 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1988183093] [2022-11-02 20:47:15,565 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-02 20:47:15,566 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-02 20:47:15,611 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 20:47:15,726 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-02 20:47:15,727 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-02 20:47:15,727 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1988183093] [2022-11-02 20:47:15,727 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1988183093] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-02 20:47:15,727 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-02 20:47:15,728 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2022-11-02 20:47:15,728 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1450819410] [2022-11-02 20:47:15,728 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-02 20:47:15,728 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-11-02 20:47:15,728 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-02 20:47:15,729 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-11-02 20:47:15,729 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-11-02 20:47:15,729 INFO L87 Difference]: Start difference. First operand 430 states and 1148 transitions. Second operand has 3 states, 2 states have (on average 2.5) internal successors, (5), 2 states have internal predecessors, (5), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-02 20:47:15,841 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-02 20:47:15,842 INFO L93 Difference]: Finished difference Result 334 states and 876 transitions. [2022-11-02 20:47:15,842 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-11-02 20:47:15,842 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 2 states have (on average 2.5) internal successors, (5), 2 states have internal predecessors, (5), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 5 [2022-11-02 20:47:15,842 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-02 20:47:15,844 INFO L225 Difference]: With dead ends: 334 [2022-11-02 20:47:15,844 INFO L226 Difference]: Without dead ends: 334 [2022-11-02 20:47:15,844 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-02 20:47:15,845 INFO L413 NwaCegarLoop]: 0 mSDtfsCounter, 20 mSDsluCounter, 0 mSDsCounter, 0 mSdLazyCounter, 24 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 20 SdHoareTripleChecker+Valid, 0 SdHoareTripleChecker+Invalid, 25 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 24 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-11-02 20:47:15,845 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [20 Valid, 0 Invalid, 25 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 24 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-11-02 20:47:15,847 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 334 states. [2022-11-02 20:47:15,854 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 334 to 334. [2022-11-02 20:47:15,855 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 334 states, 299 states have (on average 2.9297658862876252) internal successors, (876), 333 states have internal predecessors, (876), 0 states have call successors, (0), 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-02 20:47:15,856 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 334 states to 334 states and 876 transitions. [2022-11-02 20:47:15,857 INFO L78 Accepts]: Start accepts. Automaton has 334 states and 876 transitions. Word has length 5 [2022-11-02 20:47:15,857 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-02 20:47:15,857 INFO L495 AbstractCegarLoop]: Abstraction has 334 states and 876 transitions. [2022-11-02 20:47:15,858 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 2 states have (on average 2.5) internal successors, (5), 2 states have internal predecessors, (5), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-02 20:47:15,858 INFO L276 IsEmpty]: Start isEmpty. Operand 334 states and 876 transitions. [2022-11-02 20:47:15,858 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 6 [2022-11-02 20:47:15,858 INFO L187 NwaCegarLoop]: Found error trace [2022-11-02 20:47:15,859 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1] [2022-11-02 20:47:15,859 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable18 [2022-11-02 20:47:15,859 INFO L420 AbstractCegarLoop]: === Iteration 20 === Targeting thread2Err6ASSERT_VIOLATIONINTEGER_OVERFLOW === [thread1Err0ASSERT_VIOLATIONINTEGER_OVERFLOW, thread1Err1ASSERT_VIOLATIONINTEGER_OVERFLOW, thread1Err2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 144 more)] === [2022-11-02 20:47:15,860 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-02 20:47:15,860 INFO L85 PathProgramCache]: Analyzing trace with hash -1757585827, now seen corresponding path program 1 times [2022-11-02 20:47:15,860 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-02 20:47:15,860 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1691156199] [2022-11-02 20:47:15,861 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-02 20:47:15,861 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-02 20:47:15,914 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 20:47:15,951 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-02 20:47:15,952 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-02 20:47:15,952 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1691156199] [2022-11-02 20:47:15,952 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1691156199] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-02 20:47:15,952 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-02 20:47:15,953 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2022-11-02 20:47:15,953 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1346830105] [2022-11-02 20:47:15,953 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-02 20:47:15,954 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-11-02 20:47:15,954 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-02 20:47:15,954 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-11-02 20:47:15,955 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-11-02 20:47:15,955 INFO L87 Difference]: Start difference. First operand 334 states and 876 transitions. Second operand has 3 states, 2 states have (on average 2.5) internal successors, (5), 2 states have internal predecessors, (5), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-02 20:47:16,075 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-02 20:47:16,075 INFO L93 Difference]: Finished difference Result 250 states and 640 transitions. [2022-11-02 20:47:16,076 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-11-02 20:47:16,076 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 2 states have (on average 2.5) internal successors, (5), 2 states have internal predecessors, (5), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 5 [2022-11-02 20:47:16,076 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-02 20:47:16,077 INFO L225 Difference]: With dead ends: 250 [2022-11-02 20:47:16,077 INFO L226 Difference]: Without dead ends: 250 [2022-11-02 20:47:16,077 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-02 20:47:16,078 INFO L413 NwaCegarLoop]: 0 mSDtfsCounter, 18 mSDsluCounter, 0 mSDsCounter, 0 mSdLazyCounter, 22 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 18 SdHoareTripleChecker+Valid, 0 SdHoareTripleChecker+Invalid, 23 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 22 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-11-02 20:47:16,078 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [18 Valid, 0 Invalid, 23 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 22 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-11-02 20:47:16,079 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 250 states. [2022-11-02 20:47:16,083 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 250 to 250. [2022-11-02 20:47:16,084 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 250 states, 226 states have (on average 2.831858407079646) internal successors, (640), 249 states have internal predecessors, (640), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-02 20:47:16,084 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 250 states to 250 states and 640 transitions. [2022-11-02 20:47:16,085 INFO L78 Accepts]: Start accepts. Automaton has 250 states and 640 transitions. Word has length 5 [2022-11-02 20:47:16,085 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-02 20:47:16,085 INFO L495 AbstractCegarLoop]: Abstraction has 250 states and 640 transitions. [2022-11-02 20:47:16,085 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 2 states have (on average 2.5) internal successors, (5), 2 states have internal predecessors, (5), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-02 20:47:16,086 INFO L276 IsEmpty]: Start isEmpty. Operand 250 states and 640 transitions. [2022-11-02 20:47:16,086 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 6 [2022-11-02 20:47:16,086 INFO L187 NwaCegarLoop]: Found error trace [2022-11-02 20:47:16,086 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1] [2022-11-02 20:47:16,087 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable19 [2022-11-02 20:47:16,087 INFO L420 AbstractCegarLoop]: === Iteration 21 === Targeting thread2Err9ASSERT_VIOLATIONINTEGER_OVERFLOW === [thread1Err0ASSERT_VIOLATIONINTEGER_OVERFLOW, thread1Err1ASSERT_VIOLATIONINTEGER_OVERFLOW, thread1Err2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 144 more)] === [2022-11-02 20:47:16,087 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-02 20:47:16,087 INFO L85 PathProgramCache]: Analyzing trace with hash -1757585824, now seen corresponding path program 1 times [2022-11-02 20:47:16,088 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-02 20:47:16,088 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [196244885] [2022-11-02 20:47:16,088 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-02 20:47:16,088 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-02 20:47:16,126 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 20:47:16,165 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-02 20:47:16,165 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-02 20:47:16,165 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [196244885] [2022-11-02 20:47:16,166 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [196244885] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-02 20:47:16,166 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-02 20:47:16,166 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2022-11-02 20:47:16,166 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1712213250] [2022-11-02 20:47:16,166 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-02 20:47:16,167 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-11-02 20:47:16,167 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-02 20:47:16,167 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-11-02 20:47:16,168 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-11-02 20:47:16,168 INFO L87 Difference]: Start difference. First operand 250 states and 640 transitions. Second operand has 3 states, 2 states have (on average 2.5) internal successors, (5), 2 states have internal predecessors, (5), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-02 20:47:16,255 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-02 20:47:16,255 INFO L93 Difference]: Finished difference Result 178 states and 440 transitions. [2022-11-02 20:47:16,256 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-11-02 20:47:16,256 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 2 states have (on average 2.5) internal successors, (5), 2 states have internal predecessors, (5), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 5 [2022-11-02 20:47:16,256 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-02 20:47:16,257 INFO L225 Difference]: With dead ends: 178 [2022-11-02 20:47:16,257 INFO L226 Difference]: Without dead ends: 178 [2022-11-02 20:47:16,257 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-02 20:47:16,258 INFO L413 NwaCegarLoop]: 0 mSDtfsCounter, 16 mSDsluCounter, 0 mSDsCounter, 0 mSdLazyCounter, 20 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 16 SdHoareTripleChecker+Valid, 0 SdHoareTripleChecker+Invalid, 21 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 20 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-11-02 20:47:16,258 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [16 Valid, 0 Invalid, 21 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 20 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-11-02 20:47:16,259 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 178 states. [2022-11-02 20:47:16,262 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 178 to 178. [2022-11-02 20:47:16,262 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 178 states, 163 states have (on average 2.6993865030674846) internal successors, (440), 177 states have internal predecessors, (440), 0 states have call successors, (0), 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-02 20:47:16,263 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 178 states to 178 states and 440 transitions. [2022-11-02 20:47:16,263 INFO L78 Accepts]: Start accepts. Automaton has 178 states and 440 transitions. Word has length 5 [2022-11-02 20:47:16,263 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-02 20:47:16,263 INFO L495 AbstractCegarLoop]: Abstraction has 178 states and 440 transitions. [2022-11-02 20:47:16,263 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 2 states have (on average 2.5) internal successors, (5), 2 states have internal predecessors, (5), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-02 20:47:16,264 INFO L276 IsEmpty]: Start isEmpty. Operand 178 states and 440 transitions. [2022-11-02 20:47:16,264 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 6 [2022-11-02 20:47:16,264 INFO L187 NwaCegarLoop]: Found error trace [2022-11-02 20:47:16,264 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1] [2022-11-02 20:47:16,264 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable20 [2022-11-02 20:47:16,264 INFO L420 AbstractCegarLoop]: === Iteration 22 === Targeting thread2Err12ASSERT_VIOLATIONINTEGER_OVERFLOW === [thread1Err0ASSERT_VIOLATIONINTEGER_OVERFLOW, thread1Err1ASSERT_VIOLATIONINTEGER_OVERFLOW, thread1Err2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 144 more)] === [2022-11-02 20:47:16,265 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-02 20:47:16,265 INFO L85 PathProgramCache]: Analyzing trace with hash -1757585821, now seen corresponding path program 1 times [2022-11-02 20:47:16,265 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-02 20:47:16,265 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1390080791] [2022-11-02 20:47:16,265 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-02 20:47:16,265 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-02 20:47:16,303 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 20:47:16,333 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-02 20:47:16,334 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-02 20:47:16,334 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1390080791] [2022-11-02 20:47:16,334 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1390080791] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-02 20:47:16,334 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-02 20:47:16,334 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2022-11-02 20:47:16,335 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1572484288] [2022-11-02 20:47:16,335 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-02 20:47:16,335 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-11-02 20:47:16,335 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-02 20:47:16,336 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-11-02 20:47:16,336 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-11-02 20:47:16,336 INFO L87 Difference]: Start difference. First operand 178 states and 440 transitions. Second operand has 3 states, 2 states have (on average 2.5) internal successors, (5), 2 states have internal predecessors, (5), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-02 20:47:16,405 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-02 20:47:16,405 INFO L93 Difference]: Finished difference Result 118 states and 276 transitions. [2022-11-02 20:47:16,406 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-11-02 20:47:16,406 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 2 states have (on average 2.5) internal successors, (5), 2 states have internal predecessors, (5), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 5 [2022-11-02 20:47:16,406 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-02 20:47:16,406 INFO L225 Difference]: With dead ends: 118 [2022-11-02 20:47:16,406 INFO L226 Difference]: Without dead ends: 118 [2022-11-02 20:47:16,407 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-02 20:47:16,407 INFO L413 NwaCegarLoop]: 0 mSDtfsCounter, 14 mSDsluCounter, 0 mSDsCounter, 0 mSdLazyCounter, 18 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 14 SdHoareTripleChecker+Valid, 0 SdHoareTripleChecker+Invalid, 19 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 18 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-11-02 20:47:16,408 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [14 Valid, 0 Invalid, 19 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 18 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-11-02 20:47:16,408 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 118 states. [2022-11-02 20:47:16,409 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 118 to 118. [2022-11-02 20:47:16,410 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 118 states, 110 states have (on average 2.5090909090909093) internal successors, (276), 117 states have internal predecessors, (276), 0 states have call successors, (0), 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-02 20:47:16,410 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 118 states to 118 states and 276 transitions. [2022-11-02 20:47:16,410 INFO L78 Accepts]: Start accepts. Automaton has 118 states and 276 transitions. Word has length 5 [2022-11-02 20:47:16,410 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-02 20:47:16,410 INFO L495 AbstractCegarLoop]: Abstraction has 118 states and 276 transitions. [2022-11-02 20:47:16,411 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 2 states have (on average 2.5) internal successors, (5), 2 states have internal predecessors, (5), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-02 20:47:16,411 INFO L276 IsEmpty]: Start isEmpty. Operand 118 states and 276 transitions. [2022-11-02 20:47:16,411 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 6 [2022-11-02 20:47:16,411 INFO L187 NwaCegarLoop]: Found error trace [2022-11-02 20:47:16,411 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1] [2022-11-02 20:47:16,411 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable21 [2022-11-02 20:47:16,411 INFO L420 AbstractCegarLoop]: === Iteration 23 === Targeting thread2Err15ASSERT_VIOLATIONINTEGER_OVERFLOW === [thread1Err0ASSERT_VIOLATIONINTEGER_OVERFLOW, thread1Err1ASSERT_VIOLATIONINTEGER_OVERFLOW, thread1Err2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 144 more)] === [2022-11-02 20:47:16,412 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-02 20:47:16,412 INFO L85 PathProgramCache]: Analyzing trace with hash -1757585818, now seen corresponding path program 1 times [2022-11-02 20:47:16,412 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-02 20:47:16,412 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [782563679] [2022-11-02 20:47:16,412 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-02 20:47:16,412 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-02 20:47:16,453 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 20:47:16,510 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-02 20:47:16,510 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-02 20:47:16,511 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [782563679] [2022-11-02 20:47:16,511 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [782563679] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-02 20:47:16,511 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-02 20:47:16,511 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2022-11-02 20:47:16,511 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2020831827] [2022-11-02 20:47:16,512 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-02 20:47:16,512 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-11-02 20:47:16,512 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-02 20:47:16,512 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-11-02 20:47:16,513 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-11-02 20:47:16,513 INFO L87 Difference]: Start difference. First operand 118 states and 276 transitions. Second operand has 3 states, 2 states have (on average 2.5) internal successors, (5), 2 states have internal predecessors, (5), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-02 20:47:16,570 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-02 20:47:16,570 INFO L93 Difference]: Finished difference Result 70 states and 148 transitions. [2022-11-02 20:47:16,571 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-11-02 20:47:16,571 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 2 states have (on average 2.5) internal successors, (5), 2 states have internal predecessors, (5), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 5 [2022-11-02 20:47:16,571 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-02 20:47:16,571 INFO L225 Difference]: With dead ends: 70 [2022-11-02 20:47:16,571 INFO L226 Difference]: Without dead ends: 70 [2022-11-02 20:47:16,572 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-02 20:47:16,572 INFO L413 NwaCegarLoop]: 0 mSDtfsCounter, 12 mSDsluCounter, 0 mSDsCounter, 0 mSdLazyCounter, 16 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 12 SdHoareTripleChecker+Valid, 0 SdHoareTripleChecker+Invalid, 17 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 16 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-11-02 20:47:16,572 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [12 Valid, 0 Invalid, 17 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 16 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-11-02 20:47:16,573 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 70 states. [2022-11-02 20:47:16,574 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 70 to 70. [2022-11-02 20:47:16,574 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 70 states, 67 states have (on average 2.208955223880597) internal successors, (148), 69 states have internal predecessors, (148), 0 states have call successors, (0), 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-02 20:47:16,574 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 70 states to 70 states and 148 transitions. [2022-11-02 20:47:16,574 INFO L78 Accepts]: Start accepts. Automaton has 70 states and 148 transitions. Word has length 5 [2022-11-02 20:47:16,574 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-02 20:47:16,574 INFO L495 AbstractCegarLoop]: Abstraction has 70 states and 148 transitions. [2022-11-02 20:47:16,575 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 2 states have (on average 2.5) internal successors, (5), 2 states have internal predecessors, (5), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-02 20:47:16,575 INFO L276 IsEmpty]: Start isEmpty. Operand 70 states and 148 transitions. [2022-11-02 20:47:16,575 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 6 [2022-11-02 20:47:16,575 INFO L187 NwaCegarLoop]: Found error trace [2022-11-02 20:47:16,575 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1] [2022-11-02 20:47:16,575 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable22 [2022-11-02 20:47:16,575 INFO L420 AbstractCegarLoop]: === Iteration 24 === Targeting thread2Err0ASSERT_VIOLATIONINTEGER_OVERFLOW === [thread1Err0ASSERT_VIOLATIONINTEGER_OVERFLOW, thread1Err1ASSERT_VIOLATIONINTEGER_OVERFLOW, thread1Err2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 144 more)] === [2022-11-02 20:47:16,575 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-02 20:47:16,576 INFO L85 PathProgramCache]: Analyzing trace with hash -1757585833, now seen corresponding path program 1 times [2022-11-02 20:47:16,576 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-02 20:47:16,576 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2121131645] [2022-11-02 20:47:16,576 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-02 20:47:16,576 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-02 20:47:16,607 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 20:47:16,625 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-02 20:47:16,626 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-02 20:47:16,626 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2121131645] [2022-11-02 20:47:16,626 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2121131645] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-02 20:47:16,626 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-02 20:47:16,626 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2022-11-02 20:47:16,627 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1381509143] [2022-11-02 20:47:16,627 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-02 20:47:16,627 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-11-02 20:47:16,627 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-02 20:47:16,627 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-11-02 20:47:16,628 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-11-02 20:47:16,628 INFO L87 Difference]: Start difference. First operand 70 states and 148 transitions. Second operand has 3 states, 2 states have (on average 2.5) internal successors, (5), 2 states have internal predecessors, (5), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-02 20:47:16,671 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-02 20:47:16,671 INFO L93 Difference]: Finished difference Result 34 states and 56 transitions. [2022-11-02 20:47:16,671 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-11-02 20:47:16,672 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 2 states have (on average 2.5) internal successors, (5), 2 states have internal predecessors, (5), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 5 [2022-11-02 20:47:16,672 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-02 20:47:16,672 INFO L225 Difference]: With dead ends: 34 [2022-11-02 20:47:16,672 INFO L226 Difference]: Without dead ends: 0 [2022-11-02 20:47:16,672 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-02 20:47:16,673 INFO L413 NwaCegarLoop]: 0 mSDtfsCounter, 10 mSDsluCounter, 0 mSDsCounter, 0 mSdLazyCounter, 14 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 10 SdHoareTripleChecker+Valid, 0 SdHoareTripleChecker+Invalid, 15 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 14 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-11-02 20:47:16,673 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [10 Valid, 0 Invalid, 15 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 14 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-11-02 20:47:16,674 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 0 states. [2022-11-02 20:47:16,674 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 0 to 0. [2022-11-02 20:47:16,674 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 0 states, 0 states have (on average 0.0) internal successors, (0), 0 states have internal predecessors, (0), 0 states have call successors, (0), 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-02 20:47:16,674 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 0 states to 0 states and 0 transitions. [2022-11-02 20:47:16,675 INFO L78 Accepts]: Start accepts. Automaton has 0 states and 0 transitions. Word has length 5 [2022-11-02 20:47:16,675 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-02 20:47:16,675 INFO L495 AbstractCegarLoop]: Abstraction has 0 states and 0 transitions. [2022-11-02 20:47:16,675 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 2 states have (on average 2.5) internal successors, (5), 2 states have internal predecessors, (5), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-02 20:47:16,675 INFO L276 IsEmpty]: Start isEmpty. Operand 0 states and 0 transitions. [2022-11-02 20:47:16,676 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-11-02 20:47:16,678 INFO L805 garLoopResultBuilder]: Registering result SAFE for location thread1Err0ASSERT_VIOLATIONINTEGER_OVERFLOW (146 of 147 remaining) [2022-11-02 20:47:16,679 INFO L805 garLoopResultBuilder]: Registering result SAFE for location thread1Err1ASSERT_VIOLATIONINTEGER_OVERFLOW (145 of 147 remaining) [2022-11-02 20:47:16,680 INFO L805 garLoopResultBuilder]: Registering result SAFE for location thread1Err2ASSERT_VIOLATIONINTEGER_OVERFLOW (144 of 147 remaining) [2022-11-02 20:47:16,680 INFO L805 garLoopResultBuilder]: Registering result SAFE for location thread1Err3ASSERT_VIOLATIONINTEGER_OVERFLOW (143 of 147 remaining) [2022-11-02 20:47:16,680 INFO L805 garLoopResultBuilder]: Registering result SAFE for location thread1Err4ASSERT_VIOLATIONINTEGER_OVERFLOW (142 of 147 remaining) [2022-11-02 20:47:16,681 INFO L805 garLoopResultBuilder]: Registering result SAFE for location thread1Err5ASSERT_VIOLATIONINTEGER_OVERFLOW (141 of 147 remaining) [2022-11-02 20:47:16,681 INFO L805 garLoopResultBuilder]: Registering result SAFE for location thread1Err6ASSERT_VIOLATIONINTEGER_OVERFLOW (140 of 147 remaining) [2022-11-02 20:47:16,681 INFO L805 garLoopResultBuilder]: Registering result SAFE for location thread1Err7ASSERT_VIOLATIONINTEGER_OVERFLOW (139 of 147 remaining) [2022-11-02 20:47:16,682 INFO L805 garLoopResultBuilder]: Registering result SAFE for location thread1Err8ASSERT_VIOLATIONINTEGER_OVERFLOW (138 of 147 remaining) [2022-11-02 20:47:16,682 INFO L805 garLoopResultBuilder]: Registering result SAFE for location thread1Err9ASSERT_VIOLATIONINTEGER_OVERFLOW (137 of 147 remaining) [2022-11-02 20:47:16,682 INFO L805 garLoopResultBuilder]: Registering result SAFE for location thread1Err10ASSERT_VIOLATIONINTEGER_OVERFLOW (136 of 147 remaining) [2022-11-02 20:47:16,682 INFO L805 garLoopResultBuilder]: Registering result SAFE for location thread1Err11ASSERT_VIOLATIONINTEGER_OVERFLOW (135 of 147 remaining) [2022-11-02 20:47:16,683 INFO L805 garLoopResultBuilder]: Registering result SAFE for location thread1Err12ASSERT_VIOLATIONINTEGER_OVERFLOW (134 of 147 remaining) [2022-11-02 20:47:16,683 INFO L805 garLoopResultBuilder]: Registering result SAFE for location thread1Err13ASSERT_VIOLATIONINTEGER_OVERFLOW (133 of 147 remaining) [2022-11-02 20:47:16,683 INFO L805 garLoopResultBuilder]: Registering result SAFE for location thread1Err14ASSERT_VIOLATIONINTEGER_OVERFLOW (132 of 147 remaining) [2022-11-02 20:47:16,683 INFO L805 garLoopResultBuilder]: Registering result SAFE for location thread1Err15ASSERT_VIOLATIONINTEGER_OVERFLOW (131 of 147 remaining) [2022-11-02 20:47:16,684 INFO L805 garLoopResultBuilder]: Registering result SAFE for location thread1Err16ASSERT_VIOLATIONINTEGER_OVERFLOW (130 of 147 remaining) [2022-11-02 20:47:16,684 INFO L805 garLoopResultBuilder]: Registering result SAFE for location thread1Err17ASSERT_VIOLATIONINTEGER_OVERFLOW (129 of 147 remaining) [2022-11-02 20:47:16,684 INFO L805 garLoopResultBuilder]: Registering result SAFE for location thread1Err18ASSERT_VIOLATIONINTEGER_OVERFLOW (128 of 147 remaining) [2022-11-02 20:47:16,684 INFO L805 garLoopResultBuilder]: Registering result SAFE for location thread1Err19ASSERT_VIOLATIONINTEGER_OVERFLOW (127 of 147 remaining) [2022-11-02 20:47:16,684 INFO L805 garLoopResultBuilder]: Registering result SAFE for location thread1Err20ASSERT_VIOLATIONINTEGER_OVERFLOW (126 of 147 remaining) [2022-11-02 20:47:16,685 INFO L805 garLoopResultBuilder]: Registering result SAFE for location thread1Err21ASSERT_VIOLATIONINTEGER_OVERFLOW (125 of 147 remaining) [2022-11-02 20:47:16,685 INFO L805 garLoopResultBuilder]: Registering result SAFE for location thread1Err22ASSERT_VIOLATIONINTEGER_OVERFLOW (124 of 147 remaining) [2022-11-02 20:47:16,685 INFO L805 garLoopResultBuilder]: Registering result SAFE for location thread1Err23ASSERT_VIOLATIONINTEGER_OVERFLOW (123 of 147 remaining) [2022-11-02 20:47:16,685 INFO L805 garLoopResultBuilder]: Registering result SAFE for location thread2Err0ASSERT_VIOLATIONINTEGER_OVERFLOW (122 of 147 remaining) [2022-11-02 20:47:16,685 INFO L805 garLoopResultBuilder]: Registering result SAFE for location thread2Err1ASSERT_VIOLATIONINTEGER_OVERFLOW (121 of 147 remaining) [2022-11-02 20:47:16,686 INFO L805 garLoopResultBuilder]: Registering result SAFE for location thread2Err2ASSERT_VIOLATIONINTEGER_OVERFLOW (120 of 147 remaining) [2022-11-02 20:47:16,686 INFO L805 garLoopResultBuilder]: Registering result SAFE for location thread2Err3ASSERT_VIOLATIONINTEGER_OVERFLOW (119 of 147 remaining) [2022-11-02 20:47:16,686 INFO L805 garLoopResultBuilder]: Registering result SAFE for location thread2Err4ASSERT_VIOLATIONINTEGER_OVERFLOW (118 of 147 remaining) [2022-11-02 20:47:16,686 INFO L805 garLoopResultBuilder]: Registering result SAFE for location thread2Err5ASSERT_VIOLATIONINTEGER_OVERFLOW (117 of 147 remaining) [2022-11-02 20:47:16,687 INFO L805 garLoopResultBuilder]: Registering result SAFE for location thread2Err6ASSERT_VIOLATIONINTEGER_OVERFLOW (116 of 147 remaining) [2022-11-02 20:47:16,687 INFO L805 garLoopResultBuilder]: Registering result SAFE for location thread2Err7ASSERT_VIOLATIONINTEGER_OVERFLOW (115 of 147 remaining) [2022-11-02 20:47:16,687 INFO L805 garLoopResultBuilder]: Registering result SAFE for location thread2Err8ASSERT_VIOLATIONINTEGER_OVERFLOW (114 of 147 remaining) [2022-11-02 20:47:16,687 INFO L805 garLoopResultBuilder]: Registering result SAFE for location thread2Err9ASSERT_VIOLATIONINTEGER_OVERFLOW (113 of 147 remaining) [2022-11-02 20:47:16,687 INFO L805 garLoopResultBuilder]: Registering result SAFE for location thread2Err10ASSERT_VIOLATIONINTEGER_OVERFLOW (112 of 147 remaining) [2022-11-02 20:47:16,688 INFO L805 garLoopResultBuilder]: Registering result SAFE for location thread2Err11ASSERT_VIOLATIONINTEGER_OVERFLOW (111 of 147 remaining) [2022-11-02 20:47:16,688 INFO L805 garLoopResultBuilder]: Registering result SAFE for location thread2Err12ASSERT_VIOLATIONINTEGER_OVERFLOW (110 of 147 remaining) [2022-11-02 20:47:16,688 INFO L805 garLoopResultBuilder]: Registering result SAFE for location thread2Err13ASSERT_VIOLATIONINTEGER_OVERFLOW (109 of 147 remaining) [2022-11-02 20:47:16,688 INFO L805 garLoopResultBuilder]: Registering result SAFE for location thread2Err14ASSERT_VIOLATIONINTEGER_OVERFLOW (108 of 147 remaining) [2022-11-02 20:47:16,688 INFO L805 garLoopResultBuilder]: Registering result SAFE for location thread2Err15ASSERT_VIOLATIONINTEGER_OVERFLOW (107 of 147 remaining) [2022-11-02 20:47:16,689 INFO L805 garLoopResultBuilder]: Registering result SAFE for location thread2Err16ASSERT_VIOLATIONINTEGER_OVERFLOW (106 of 147 remaining) [2022-11-02 20:47:16,689 INFO L805 garLoopResultBuilder]: Registering result SAFE for location thread2Err17ASSERT_VIOLATIONINTEGER_OVERFLOW (105 of 147 remaining) [2022-11-02 20:47:16,689 INFO L805 garLoopResultBuilder]: Registering result SAFE for location thread2Err18ASSERT_VIOLATIONINTEGER_OVERFLOW (104 of 147 remaining) [2022-11-02 20:47:16,689 INFO L805 garLoopResultBuilder]: Registering result SAFE for location thread2Err19ASSERT_VIOLATIONINTEGER_OVERFLOW (103 of 147 remaining) [2022-11-02 20:47:16,689 INFO L805 garLoopResultBuilder]: Registering result SAFE for location thread2Err20ASSERT_VIOLATIONINTEGER_OVERFLOW (102 of 147 remaining) [2022-11-02 20:47:16,690 INFO L805 garLoopResultBuilder]: Registering result SAFE for location thread2Err21ASSERT_VIOLATIONINTEGER_OVERFLOW (101 of 147 remaining) [2022-11-02 20:47:16,690 INFO L805 garLoopResultBuilder]: Registering result SAFE for location thread2Err22ASSERT_VIOLATIONINTEGER_OVERFLOW (100 of 147 remaining) [2022-11-02 20:47:16,690 INFO L805 garLoopResultBuilder]: Registering result SAFE for location thread2Err23ASSERT_VIOLATIONINTEGER_OVERFLOW (99 of 147 remaining) [2022-11-02 20:47:16,690 INFO L805 garLoopResultBuilder]: Registering result SAFE for location thread3Err0ASSERT_VIOLATIONINTEGER_OVERFLOW (98 of 147 remaining) [2022-11-02 20:47:16,691 INFO L805 garLoopResultBuilder]: Registering result SAFE for location thread3Err1ASSERT_VIOLATIONINTEGER_OVERFLOW (97 of 147 remaining) [2022-11-02 20:47:16,691 INFO L805 garLoopResultBuilder]: Registering result SAFE for location thread3Err2ASSERT_VIOLATIONINTEGER_OVERFLOW (96 of 147 remaining) [2022-11-02 20:47:16,691 INFO L805 garLoopResultBuilder]: Registering result SAFE for location thread3Err3ASSERT_VIOLATIONINTEGER_OVERFLOW (95 of 147 remaining) [2022-11-02 20:47:16,691 INFO L805 garLoopResultBuilder]: Registering result SAFE for location thread3Err4ASSERT_VIOLATIONINTEGER_OVERFLOW (94 of 147 remaining) [2022-11-02 20:47:16,691 INFO L805 garLoopResultBuilder]: Registering result SAFE for location thread3Err5ASSERT_VIOLATIONINTEGER_OVERFLOW (93 of 147 remaining) [2022-11-02 20:47:16,692 INFO L805 garLoopResultBuilder]: Registering result SAFE for location thread3Err6ASSERT_VIOLATIONINTEGER_OVERFLOW (92 of 147 remaining) [2022-11-02 20:47:16,692 INFO L805 garLoopResultBuilder]: Registering result SAFE for location thread3Err7ASSERT_VIOLATIONINTEGER_OVERFLOW (91 of 147 remaining) [2022-11-02 20:47:16,692 INFO L805 garLoopResultBuilder]: Registering result SAFE for location thread3Err8ASSERT_VIOLATIONINTEGER_OVERFLOW (90 of 147 remaining) [2022-11-02 20:47:16,692 INFO L805 garLoopResultBuilder]: Registering result SAFE for location thread3Err9ASSERT_VIOLATIONINTEGER_OVERFLOW (89 of 147 remaining) [2022-11-02 20:47:16,692 INFO L805 garLoopResultBuilder]: Registering result SAFE for location thread3Err10ASSERT_VIOLATIONINTEGER_OVERFLOW (88 of 147 remaining) [2022-11-02 20:47:16,693 INFO L805 garLoopResultBuilder]: Registering result SAFE for location thread3Err11ASSERT_VIOLATIONINTEGER_OVERFLOW (87 of 147 remaining) [2022-11-02 20:47:16,693 INFO L805 garLoopResultBuilder]: Registering result SAFE for location thread3Err12ASSERT_VIOLATIONINTEGER_OVERFLOW (86 of 147 remaining) [2022-11-02 20:47:16,693 INFO L805 garLoopResultBuilder]: Registering result SAFE for location thread3Err13ASSERT_VIOLATIONINTEGER_OVERFLOW (85 of 147 remaining) [2022-11-02 20:47:16,693 INFO L805 garLoopResultBuilder]: Registering result SAFE for location thread3Err14ASSERT_VIOLATIONINTEGER_OVERFLOW (84 of 147 remaining) [2022-11-02 20:47:16,693 INFO L805 garLoopResultBuilder]: Registering result SAFE for location thread3Err15ASSERT_VIOLATIONINTEGER_OVERFLOW (83 of 147 remaining) [2022-11-02 20:47:16,694 INFO L805 garLoopResultBuilder]: Registering result SAFE for location thread3Err16ASSERT_VIOLATIONINTEGER_OVERFLOW (82 of 147 remaining) [2022-11-02 20:47:16,694 INFO L805 garLoopResultBuilder]: Registering result SAFE for location thread3Err17ASSERT_VIOLATIONINTEGER_OVERFLOW (81 of 147 remaining) [2022-11-02 20:47:16,694 INFO L805 garLoopResultBuilder]: Registering result SAFE for location thread3Err18ASSERT_VIOLATIONINTEGER_OVERFLOW (80 of 147 remaining) [2022-11-02 20:47:16,694 INFO L805 garLoopResultBuilder]: Registering result SAFE for location thread3Err19ASSERT_VIOLATIONINTEGER_OVERFLOW (79 of 147 remaining) [2022-11-02 20:47:16,695 INFO L805 garLoopResultBuilder]: Registering result SAFE for location thread3Err20ASSERT_VIOLATIONINTEGER_OVERFLOW (78 of 147 remaining) [2022-11-02 20:47:16,695 INFO L805 garLoopResultBuilder]: Registering result SAFE for location thread3Err21ASSERT_VIOLATIONINTEGER_OVERFLOW (77 of 147 remaining) [2022-11-02 20:47:16,695 INFO L805 garLoopResultBuilder]: Registering result SAFE for location thread3Err22ASSERT_VIOLATIONINTEGER_OVERFLOW (76 of 147 remaining) [2022-11-02 20:47:16,695 INFO L805 garLoopResultBuilder]: Registering result SAFE for location thread3Err23ASSERT_VIOLATIONINTEGER_OVERFLOW (75 of 147 remaining) [2022-11-02 20:47:16,695 INFO L805 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (74 of 147 remaining) [2022-11-02 20:47:16,696 INFO L805 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (73 of 147 remaining) [2022-11-02 20:47:16,696 INFO L805 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr2INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (72 of 147 remaining) [2022-11-02 20:47:16,696 INFO L805 garLoopResultBuilder]: Registering result SAFE for location thread1Err0ASSERT_VIOLATIONINTEGER_OVERFLOW (71 of 147 remaining) [2022-11-02 20:47:16,696 INFO L805 garLoopResultBuilder]: Registering result SAFE for location thread1Err1ASSERT_VIOLATIONINTEGER_OVERFLOW (70 of 147 remaining) [2022-11-02 20:47:16,696 INFO L805 garLoopResultBuilder]: Registering result SAFE for location thread1Err2ASSERT_VIOLATIONINTEGER_OVERFLOW (69 of 147 remaining) [2022-11-02 20:47:16,697 INFO L805 garLoopResultBuilder]: Registering result SAFE for location thread1Err3ASSERT_VIOLATIONINTEGER_OVERFLOW (68 of 147 remaining) [2022-11-02 20:47:16,697 INFO L805 garLoopResultBuilder]: Registering result SAFE for location thread1Err4ASSERT_VIOLATIONINTEGER_OVERFLOW (67 of 147 remaining) [2022-11-02 20:47:16,697 INFO L805 garLoopResultBuilder]: Registering result SAFE for location thread1Err5ASSERT_VIOLATIONINTEGER_OVERFLOW (66 of 147 remaining) [2022-11-02 20:47:16,697 INFO L805 garLoopResultBuilder]: Registering result SAFE for location thread1Err6ASSERT_VIOLATIONINTEGER_OVERFLOW (65 of 147 remaining) [2022-11-02 20:47:16,697 INFO L805 garLoopResultBuilder]: Registering result SAFE for location thread1Err7ASSERT_VIOLATIONINTEGER_OVERFLOW (64 of 147 remaining) [2022-11-02 20:47:16,698 INFO L805 garLoopResultBuilder]: Registering result SAFE for location thread1Err8ASSERT_VIOLATIONINTEGER_OVERFLOW (63 of 147 remaining) [2022-11-02 20:47:16,698 INFO L805 garLoopResultBuilder]: Registering result SAFE for location thread1Err9ASSERT_VIOLATIONINTEGER_OVERFLOW (62 of 147 remaining) [2022-11-02 20:47:16,698 INFO L805 garLoopResultBuilder]: Registering result SAFE for location thread1Err10ASSERT_VIOLATIONINTEGER_OVERFLOW (61 of 147 remaining) [2022-11-02 20:47:16,698 INFO L805 garLoopResultBuilder]: Registering result SAFE for location thread1Err11ASSERT_VIOLATIONINTEGER_OVERFLOW (60 of 147 remaining) [2022-11-02 20:47:16,699 INFO L805 garLoopResultBuilder]: Registering result SAFE for location thread1Err12ASSERT_VIOLATIONINTEGER_OVERFLOW (59 of 147 remaining) [2022-11-02 20:47:16,699 INFO L805 garLoopResultBuilder]: Registering result SAFE for location thread1Err13ASSERT_VIOLATIONINTEGER_OVERFLOW (58 of 147 remaining) [2022-11-02 20:47:16,699 INFO L805 garLoopResultBuilder]: Registering result SAFE for location thread1Err14ASSERT_VIOLATIONINTEGER_OVERFLOW (57 of 147 remaining) [2022-11-02 20:47:16,699 INFO L805 garLoopResultBuilder]: Registering result SAFE for location thread1Err15ASSERT_VIOLATIONINTEGER_OVERFLOW (56 of 147 remaining) [2022-11-02 20:47:16,699 INFO L805 garLoopResultBuilder]: Registering result SAFE for location thread1Err16ASSERT_VIOLATIONINTEGER_OVERFLOW (55 of 147 remaining) [2022-11-02 20:47:16,700 INFO L805 garLoopResultBuilder]: Registering result SAFE for location thread1Err17ASSERT_VIOLATIONINTEGER_OVERFLOW (54 of 147 remaining) [2022-11-02 20:47:16,700 INFO L805 garLoopResultBuilder]: Registering result SAFE for location thread1Err18ASSERT_VIOLATIONINTEGER_OVERFLOW (53 of 147 remaining) [2022-11-02 20:47:16,700 INFO L805 garLoopResultBuilder]: Registering result SAFE for location thread1Err19ASSERT_VIOLATIONINTEGER_OVERFLOW (52 of 147 remaining) [2022-11-02 20:47:16,700 INFO L805 garLoopResultBuilder]: Registering result SAFE for location thread1Err20ASSERT_VIOLATIONINTEGER_OVERFLOW (51 of 147 remaining) [2022-11-02 20:47:16,701 INFO L805 garLoopResultBuilder]: Registering result SAFE for location thread1Err21ASSERT_VIOLATIONINTEGER_OVERFLOW (50 of 147 remaining) [2022-11-02 20:47:16,701 INFO L805 garLoopResultBuilder]: Registering result SAFE for location thread1Err22ASSERT_VIOLATIONINTEGER_OVERFLOW (49 of 147 remaining) [2022-11-02 20:47:16,701 INFO L805 garLoopResultBuilder]: Registering result SAFE for location thread1Err23ASSERT_VIOLATIONINTEGER_OVERFLOW (48 of 147 remaining) [2022-11-02 20:47:16,701 INFO L805 garLoopResultBuilder]: Registering result SAFE for location thread2Err0ASSERT_VIOLATIONINTEGER_OVERFLOW (47 of 147 remaining) [2022-11-02 20:47:16,701 INFO L805 garLoopResultBuilder]: Registering result SAFE for location thread2Err1ASSERT_VIOLATIONINTEGER_OVERFLOW (46 of 147 remaining) [2022-11-02 20:47:16,702 INFO L805 garLoopResultBuilder]: Registering result SAFE for location thread2Err2ASSERT_VIOLATIONINTEGER_OVERFLOW (45 of 147 remaining) [2022-11-02 20:47:16,702 INFO L805 garLoopResultBuilder]: Registering result SAFE for location thread2Err3ASSERT_VIOLATIONINTEGER_OVERFLOW (44 of 147 remaining) [2022-11-02 20:47:16,702 INFO L805 garLoopResultBuilder]: Registering result SAFE for location thread2Err4ASSERT_VIOLATIONINTEGER_OVERFLOW (43 of 147 remaining) [2022-11-02 20:47:16,702 INFO L805 garLoopResultBuilder]: Registering result SAFE for location thread2Err5ASSERT_VIOLATIONINTEGER_OVERFLOW (42 of 147 remaining) [2022-11-02 20:47:16,702 INFO L805 garLoopResultBuilder]: Registering result SAFE for location thread2Err6ASSERT_VIOLATIONINTEGER_OVERFLOW (41 of 147 remaining) [2022-11-02 20:47:16,703 INFO L805 garLoopResultBuilder]: Registering result SAFE for location thread2Err7ASSERT_VIOLATIONINTEGER_OVERFLOW (40 of 147 remaining) [2022-11-02 20:47:16,703 INFO L805 garLoopResultBuilder]: Registering result SAFE for location thread2Err8ASSERT_VIOLATIONINTEGER_OVERFLOW (39 of 147 remaining) [2022-11-02 20:47:16,703 INFO L805 garLoopResultBuilder]: Registering result SAFE for location thread2Err9ASSERT_VIOLATIONINTEGER_OVERFLOW (38 of 147 remaining) [2022-11-02 20:47:16,703 INFO L805 garLoopResultBuilder]: Registering result SAFE for location thread2Err10ASSERT_VIOLATIONINTEGER_OVERFLOW (37 of 147 remaining) [2022-11-02 20:47:16,704 INFO L805 garLoopResultBuilder]: Registering result SAFE for location thread2Err11ASSERT_VIOLATIONINTEGER_OVERFLOW (36 of 147 remaining) [2022-11-02 20:47:16,704 INFO L805 garLoopResultBuilder]: Registering result SAFE for location thread2Err12ASSERT_VIOLATIONINTEGER_OVERFLOW (35 of 147 remaining) [2022-11-02 20:47:16,704 INFO L805 garLoopResultBuilder]: Registering result SAFE for location thread2Err13ASSERT_VIOLATIONINTEGER_OVERFLOW (34 of 147 remaining) [2022-11-02 20:47:16,704 INFO L805 garLoopResultBuilder]: Registering result SAFE for location thread2Err14ASSERT_VIOLATIONINTEGER_OVERFLOW (33 of 147 remaining) [2022-11-02 20:47:16,704 INFO L805 garLoopResultBuilder]: Registering result SAFE for location thread2Err15ASSERT_VIOLATIONINTEGER_OVERFLOW (32 of 147 remaining) [2022-11-02 20:47:16,705 INFO L805 garLoopResultBuilder]: Registering result SAFE for location thread2Err16ASSERT_VIOLATIONINTEGER_OVERFLOW (31 of 147 remaining) [2022-11-02 20:47:16,705 INFO L805 garLoopResultBuilder]: Registering result SAFE for location thread2Err17ASSERT_VIOLATIONINTEGER_OVERFLOW (30 of 147 remaining) [2022-11-02 20:47:16,705 INFO L805 garLoopResultBuilder]: Registering result SAFE for location thread2Err18ASSERT_VIOLATIONINTEGER_OVERFLOW (29 of 147 remaining) [2022-11-02 20:47:16,705 INFO L805 garLoopResultBuilder]: Registering result SAFE for location thread2Err19ASSERT_VIOLATIONINTEGER_OVERFLOW (28 of 147 remaining) [2022-11-02 20:47:16,705 INFO L805 garLoopResultBuilder]: Registering result SAFE for location thread2Err20ASSERT_VIOLATIONINTEGER_OVERFLOW (27 of 147 remaining) [2022-11-02 20:47:16,706 INFO L805 garLoopResultBuilder]: Registering result SAFE for location thread2Err21ASSERT_VIOLATIONINTEGER_OVERFLOW (26 of 147 remaining) [2022-11-02 20:47:16,706 INFO L805 garLoopResultBuilder]: Registering result SAFE for location thread2Err22ASSERT_VIOLATIONINTEGER_OVERFLOW (25 of 147 remaining) [2022-11-02 20:47:16,706 INFO L805 garLoopResultBuilder]: Registering result SAFE for location thread2Err23ASSERT_VIOLATIONINTEGER_OVERFLOW (24 of 147 remaining) [2022-11-02 20:47:16,706 INFO L805 garLoopResultBuilder]: Registering result SAFE for location thread3Err0ASSERT_VIOLATIONINTEGER_OVERFLOW (23 of 147 remaining) [2022-11-02 20:47:16,706 INFO L805 garLoopResultBuilder]: Registering result SAFE for location thread3Err1ASSERT_VIOLATIONINTEGER_OVERFLOW (22 of 147 remaining) [2022-11-02 20:47:16,707 INFO L805 garLoopResultBuilder]: Registering result SAFE for location thread3Err2ASSERT_VIOLATIONINTEGER_OVERFLOW (21 of 147 remaining) [2022-11-02 20:47:16,707 INFO L805 garLoopResultBuilder]: Registering result SAFE for location thread3Err3ASSERT_VIOLATIONINTEGER_OVERFLOW (20 of 147 remaining) [2022-11-02 20:47:16,707 INFO L805 garLoopResultBuilder]: Registering result SAFE for location thread3Err4ASSERT_VIOLATIONINTEGER_OVERFLOW (19 of 147 remaining) [2022-11-02 20:47:16,707 INFO L805 garLoopResultBuilder]: Registering result SAFE for location thread3Err5ASSERT_VIOLATIONINTEGER_OVERFLOW (18 of 147 remaining) [2022-11-02 20:47:16,708 INFO L805 garLoopResultBuilder]: Registering result SAFE for location thread3Err6ASSERT_VIOLATIONINTEGER_OVERFLOW (17 of 147 remaining) [2022-11-02 20:47:16,708 INFO L805 garLoopResultBuilder]: Registering result SAFE for location thread3Err7ASSERT_VIOLATIONINTEGER_OVERFLOW (16 of 147 remaining) [2022-11-02 20:47:16,708 INFO L805 garLoopResultBuilder]: Registering result SAFE for location thread3Err8ASSERT_VIOLATIONINTEGER_OVERFLOW (15 of 147 remaining) [2022-11-02 20:47:16,708 INFO L805 garLoopResultBuilder]: Registering result SAFE for location thread3Err9ASSERT_VIOLATIONINTEGER_OVERFLOW (14 of 147 remaining) [2022-11-02 20:47:16,708 INFO L805 garLoopResultBuilder]: Registering result SAFE for location thread3Err10ASSERT_VIOLATIONINTEGER_OVERFLOW (13 of 147 remaining) [2022-11-02 20:47:16,709 INFO L805 garLoopResultBuilder]: Registering result SAFE for location thread3Err11ASSERT_VIOLATIONINTEGER_OVERFLOW (12 of 147 remaining) [2022-11-02 20:47:16,709 INFO L805 garLoopResultBuilder]: Registering result SAFE for location thread3Err12ASSERT_VIOLATIONINTEGER_OVERFLOW (11 of 147 remaining) [2022-11-02 20:47:16,709 INFO L805 garLoopResultBuilder]: Registering result SAFE for location thread3Err13ASSERT_VIOLATIONINTEGER_OVERFLOW (10 of 147 remaining) [2022-11-02 20:47:16,709 INFO L805 garLoopResultBuilder]: Registering result SAFE for location thread3Err14ASSERT_VIOLATIONINTEGER_OVERFLOW (9 of 147 remaining) [2022-11-02 20:47:16,709 INFO L805 garLoopResultBuilder]: Registering result SAFE for location thread3Err15ASSERT_VIOLATIONINTEGER_OVERFLOW (8 of 147 remaining) [2022-11-02 20:47:16,710 INFO L805 garLoopResultBuilder]: Registering result SAFE for location thread3Err16ASSERT_VIOLATIONINTEGER_OVERFLOW (7 of 147 remaining) [2022-11-02 20:47:16,710 INFO L805 garLoopResultBuilder]: Registering result SAFE for location thread3Err17ASSERT_VIOLATIONINTEGER_OVERFLOW (6 of 147 remaining) [2022-11-02 20:47:16,710 INFO L805 garLoopResultBuilder]: Registering result SAFE for location thread3Err18ASSERT_VIOLATIONINTEGER_OVERFLOW (5 of 147 remaining) [2022-11-02 20:47:16,710 INFO L805 garLoopResultBuilder]: Registering result SAFE for location thread3Err19ASSERT_VIOLATIONINTEGER_OVERFLOW (4 of 147 remaining) [2022-11-02 20:47:16,710 INFO L805 garLoopResultBuilder]: Registering result SAFE for location thread3Err20ASSERT_VIOLATIONINTEGER_OVERFLOW (3 of 147 remaining) [2022-11-02 20:47:16,711 INFO L805 garLoopResultBuilder]: Registering result SAFE for location thread3Err21ASSERT_VIOLATIONINTEGER_OVERFLOW (2 of 147 remaining) [2022-11-02 20:47:16,711 INFO L805 garLoopResultBuilder]: Registering result SAFE for location thread3Err22ASSERT_VIOLATIONINTEGER_OVERFLOW (1 of 147 remaining) [2022-11-02 20:47:16,711 INFO L805 garLoopResultBuilder]: Registering result SAFE for location thread3Err23ASSERT_VIOLATIONINTEGER_OVERFLOW (0 of 147 remaining) [2022-11-02 20:47:16,711 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable23 [2022-11-02 20:47:16,714 INFO L444 BasicCegarLoop]: Path program histogram: [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-02 20:47:16,721 INFO L228 ceAbstractionStarter]: Analysis of concurrent program completed with 1 thread instances [2022-11-02 20:47:16,721 INFO L178 ceAbstractionStarter]: Computing trace abstraction results [2022-11-02 20:47:16,725 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 02.11 08:47:16 BasicIcfg [2022-11-02 20:47:16,725 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2022-11-02 20:47:16,726 INFO L113 PluginConnector]: ------------------------Witness Printer---------------------------- [2022-11-02 20:47:16,726 INFO L271 PluginConnector]: Initializing Witness Printer... [2022-11-02 20:47:16,726 INFO L275 PluginConnector]: Witness Printer initialized [2022-11-02 20:47:16,727 INFO L185 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 02.11 08:45:41" (3/4) ... [2022-11-02 20:47:16,730 INFO L137 WitnessPrinter]: Generating witness for correct program [2022-11-02 20:47:16,736 INFO L354 RCFGBacktranslator]: Ignoring RootEdge to procedure thread1 [2022-11-02 20:47:16,737 INFO L354 RCFGBacktranslator]: Ignoring RootEdge to procedure thread2 [2022-11-02 20:47:16,737 INFO L354 RCFGBacktranslator]: Ignoring RootEdge to procedure thread3 [2022-11-02 20:47:16,742 INFO L910 BoogieBacktranslator]: Reduced CFG by removing 20 nodes and edges [2022-11-02 20:47:16,743 INFO L910 BoogieBacktranslator]: Reduced CFG by removing 4 nodes and edges [2022-11-02 20:47:16,743 INFO L910 BoogieBacktranslator]: Reduced CFG by removing 2 nodes and edges [2022-11-02 20:47:16,743 INFO L910 BoogieBacktranslator]: Reduced CFG by removing 1 nodes and edges [2022-11-02 20:47:16,786 INFO L141 WitnessManager]: Wrote witness to /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_e36b2227-d285-4776-ac3b-7ae48afdc8c7/bin/uautomizer-Dbtcem3rbc/witness.graphml [2022-11-02 20:47:16,786 INFO L132 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2022-11-02 20:47:16,787 INFO L158 Benchmark]: Toolchain (without parser) took 101575.64ms. Allocated memory was 92.3MB in the beginning and 2.4GB in the end (delta: 2.3GB). Free memory was 57.4MB in the beginning and 1.8GB in the end (delta: -1.7GB). Peak memory consumption was 604.2MB. Max. memory is 16.1GB. [2022-11-02 20:47:16,787 INFO L158 Benchmark]: CDTParser took 0.20ms. Allocated memory is still 92.3MB. Free memory was 63.2MB in the beginning and 63.2MB in the end (delta: 27.5kB). There was no memory consumed. Max. memory is 16.1GB. [2022-11-02 20:47:16,787 INFO L158 Benchmark]: CACSL2BoogieTranslator took 342.52ms. Allocated memory is still 92.3MB. Free memory was 57.3MB in the beginning and 66.8MB in the end (delta: -9.5MB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. [2022-11-02 20:47:16,788 INFO L158 Benchmark]: Boogie Procedure Inliner took 94.55ms. Allocated memory is still 92.3MB. Free memory was 66.8MB in the beginning and 63.3MB in the end (delta: 3.5MB). Peak memory consumption was 4.2MB. Max. memory is 16.1GB. [2022-11-02 20:47:16,788 INFO L158 Benchmark]: Boogie Preprocessor took 83.05ms. Allocated memory is still 92.3MB. Free memory was 63.3MB in the beginning and 60.9MB in the end (delta: 2.4MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. [2022-11-02 20:47:16,788 INFO L158 Benchmark]: RCFGBuilder took 5950.11ms. Allocated memory was 92.3MB in the beginning and 478.2MB in the end (delta: 385.9MB). Free memory was 60.9MB in the beginning and 311.2MB in the end (delta: -250.3MB). Peak memory consumption was 227.4MB. Max. memory is 16.1GB. [2022-11-02 20:47:16,789 INFO L158 Benchmark]: TraceAbstraction took 95038.57ms. Allocated memory was 478.2MB in the beginning and 2.4GB in the end (delta: 1.9GB). Free memory was 310.1MB in the beginning and 1.8GB in the end (delta: -1.5GB). Peak memory consumption was 466.6MB. Max. memory is 16.1GB. [2022-11-02 20:47:16,789 INFO L158 Benchmark]: Witness Printer took 60.52ms. Allocated memory is still 2.4GB. Free memory was 1.8GB in the beginning and 1.8GB in the end (delta: 3.1MB). Peak memory consumption was 4.2MB. Max. memory is 16.1GB. [2022-11-02 20:47:16,791 INFO L339 ainManager$Toolchain]: ####################### End [Toolchain 1] ####################### --- Results --- * Results from de.uni_freiburg.informatik.ultimate.core: - StatisticsResult: Toolchain Benchmarks Benchmark results are: * CDTParser took 0.20ms. Allocated memory is still 92.3MB. Free memory was 63.2MB in the beginning and 63.2MB in the end (delta: 27.5kB). There was no memory consumed. Max. memory is 16.1GB. * CACSL2BoogieTranslator took 342.52ms. Allocated memory is still 92.3MB. Free memory was 57.3MB in the beginning and 66.8MB in the end (delta: -9.5MB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. * Boogie Procedure Inliner took 94.55ms. Allocated memory is still 92.3MB. Free memory was 66.8MB in the beginning and 63.3MB in the end (delta: 3.5MB). Peak memory consumption was 4.2MB. Max. memory is 16.1GB. * Boogie Preprocessor took 83.05ms. Allocated memory is still 92.3MB. Free memory was 63.3MB in the beginning and 60.9MB in the end (delta: 2.4MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. * RCFGBuilder took 5950.11ms. Allocated memory was 92.3MB in the beginning and 478.2MB in the end (delta: 385.9MB). Free memory was 60.9MB in the beginning and 311.2MB in the end (delta: -250.3MB). Peak memory consumption was 227.4MB. Max. memory is 16.1GB. * TraceAbstraction took 95038.57ms. Allocated memory was 478.2MB in the beginning and 2.4GB in the end (delta: 1.9GB). Free memory was 310.1MB in the beginning and 1.8GB in the end (delta: -1.5GB). Peak memory consumption was 466.6MB. Max. memory is 16.1GB. * Witness Printer took 60.52ms. Allocated memory is still 2.4GB. Free memory was 1.8GB in the beginning and 1.8GB in the end (delta: 3.1MB). Peak memory consumption was 4.2MB. Max. memory is 16.1GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 76.1s, 212 PlacesBefore, 101 PlacesAfterwards, 204 TransitionsBefore, 91 TransitionsAfterwards, 6318 CoEnabledTransitionPairs, 7 FixpointIterations, 95 TrivialSequentialCompositions, 18 ConcurrentSequentialCompositions, 9 TrivialYvCompositions, 0 ConcurrentYvCompositions, 2 ChoiceCompositions, 124 TotalNumberOfCompositions, 4380 MoverChecksTotal, Independence Relation Statistics: CachedIndependenceRelation.Independence Queries: [ total: 4380, positive: 4380, positive conditional: 0, positive unconditional: 4380, negative: 0, negative conditional: 0, negative unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 1365, positive: 1365, positive conditional: 0, positive unconditional: 1365, negative: 0, negative conditional: 0, negative unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 1365, positive: 1365, positive conditional: 0, positive unconditional: 1365, negative: 0, negative conditional: 0, negative unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 0, positive: 0, positive conditional: 0, positive unconditional: 0, negative: 0, negative conditional: 0, negative unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 0, positive: 0, positive conditional: 0, positive unconditional: 0, negative: 0, negative conditional: 0, negative unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 4380, positive: 3015, positive conditional: 0, positive unconditional: 3015, negative: 0, negative conditional: 0, negative unconditional: 0, unknown: 1365, unknown conditional: 0, unknown unconditional: 1365] , Statistics on independence cache: Total cache size (in pairs): 390, Positive cache size: 390, Positive conditional cache size: 0, Positive unconditional cache size: 390, Negative cache size: 0, Negative conditional cache size: 0, Negative unconditional cache size: 0 - StatisticsResult: ErrorAutomatonStatistics NumberErrorTraces: 0, NumberStatementsAllTraces: 0, NumberRelevantStatements: 0, 0.0s ErrorAutomatonConstructionTimeTotal, 0.0s FaulLocalizationTime, NumberStatementsFirstTrace: -1, TraceLengthAvg: 0, 0.0s ErrorAutomatonConstructionTimeAvg, 0.0s ErrorAutomatonDifferenceTimeAvg, 0.0s ErrorAutomatonDifferenceTimeTotal, NumberOfNoEnhancement: 0, NumberOfFiniteEnhancement: 0, NumberOfInfiniteEnhancement: 0 - PositiveResult [Line: 107]: integer overflow can never occur For all program executions holds that integer overflow can never occur at this location - PositiveResult [Line: 107]: integer overflow can never occur For all program executions holds that integer overflow can never occur at this location - PositiveResult [Line: 108]: integer overflow can never occur For all program executions holds that integer overflow can never occur at this location - PositiveResult [Line: 108]: integer overflow can never occur For all program executions holds that integer overflow can never occur at this location - PositiveResult [Line: 109]: integer overflow can never occur For all program executions holds that integer overflow can never occur at this location - PositiveResult [Line: 109]: integer overflow can never occur For all program executions holds that integer overflow can never occur at this location - PositiveResult [Line: 107]: integer overflow can never occur For all program executions holds that integer overflow can never occur at this location - PositiveResult [Line: 107]: integer overflow can never occur For all program executions holds that integer overflow can never occur at this location - PositiveResult [Line: 108]: integer overflow can never occur For all program executions holds that integer overflow can never occur at this location - PositiveResult [Line: 108]: integer overflow can never occur For all program executions holds that integer overflow can never occur at this location - PositiveResult [Line: 109]: integer overflow can never occur For all program executions holds that integer overflow can never occur at this location - PositiveResult [Line: 109]: integer overflow can never occur For all program executions holds that integer overflow can never occur at this location - PositiveResult [Line: 107]: integer overflow can never occur For all program executions holds that integer overflow can never occur at this location - PositiveResult [Line: 107]: integer overflow can never occur For all program executions holds that integer overflow can never occur at this location - PositiveResult [Line: 108]: integer overflow can never occur For all program executions holds that integer overflow can never occur at this location - PositiveResult [Line: 108]: integer overflow can never occur For all program executions holds that integer overflow can never occur at this location - PositiveResult [Line: 109]: integer overflow can never occur For all program executions holds that integer overflow can never occur at this location - PositiveResult [Line: 109]: integer overflow can never occur For all program executions holds that integer overflow can never occur at this location - PositiveResult [Line: 107]: integer overflow can never occur For all program executions holds that integer overflow can never occur at this location - PositiveResult [Line: 107]: integer overflow can never occur For all program executions holds that integer overflow can never occur at this location - PositiveResult [Line: 108]: integer overflow can never occur For all program executions holds that integer overflow can never occur at this location - PositiveResult [Line: 108]: integer overflow can never occur For all program executions holds that integer overflow can never occur at this location - PositiveResult [Line: 109]: integer overflow can never occur For all program executions holds that integer overflow can never occur at this location - PositiveResult [Line: 109]: integer overflow can never occur For all program executions holds that integer overflow can never occur at this location - PositiveResult [Line: 107]: integer overflow can never occur For all program executions holds that integer overflow can never occur at this location - PositiveResult [Line: 107]: integer overflow can never occur For all program executions holds that integer overflow can never occur at this location - PositiveResult [Line: 108]: integer overflow can never occur For all program executions holds that integer overflow can never occur at this location - PositiveResult [Line: 108]: integer overflow can never occur For all program executions holds that integer overflow can never occur at this location - PositiveResult [Line: 109]: integer overflow can never occur For all program executions holds that integer overflow can never occur at this location - PositiveResult [Line: 109]: integer overflow can never occur For all program executions holds that integer overflow can never occur at this location - PositiveResult [Line: 107]: integer overflow can never occur For all program executions holds that integer overflow can never occur at this location - PositiveResult [Line: 107]: integer overflow can never occur For all program executions holds that integer overflow can never occur at this location - PositiveResult [Line: 108]: integer overflow can never occur For all program executions holds that integer overflow can never occur at this location - PositiveResult [Line: 108]: integer overflow can never occur For all program executions holds that integer overflow can never occur at this location - PositiveResult [Line: 109]: integer overflow can never occur For all program executions holds that integer overflow can never occur at this location - PositiveResult [Line: 109]: integer overflow can never occur For all program executions holds that integer overflow can never occur at this location - PositiveResult [Line: 107]: integer overflow can never occur For all program executions holds that integer overflow can never occur at this location - PositiveResult [Line: 107]: integer overflow can never occur For all program executions holds that integer overflow can never occur at this location - PositiveResult [Line: 108]: integer overflow can never occur For all program executions holds that integer overflow can never occur at this location - PositiveResult [Line: 108]: integer overflow can never occur For all program executions holds that integer overflow can never occur at this location - PositiveResult [Line: 109]: integer overflow can never occur For all program executions holds that integer overflow can never occur at this location - PositiveResult [Line: 109]: integer overflow can never occur For all program executions holds that integer overflow can never occur at this location - PositiveResult [Line: 107]: integer overflow can never occur For all program executions holds that integer overflow can never occur at this location - PositiveResult [Line: 107]: integer overflow can never occur For all program executions holds that integer overflow can never occur at this location - PositiveResult [Line: 108]: integer overflow can never occur For all program executions holds that integer overflow can never occur at this location - PositiveResult [Line: 108]: integer overflow can never occur For all program executions holds that integer overflow can never occur at this location - PositiveResult [Line: 109]: integer overflow can never occur For all program executions holds that integer overflow can never occur at this location - PositiveResult [Line: 109]: integer overflow can never occur For all program executions holds that integer overflow can never occur at this location - PositiveResult [Line: 107]: integer overflow can never occur For all program executions holds that integer overflow can never occur at this location - PositiveResult [Line: 107]: integer overflow can never occur For all program executions holds that integer overflow can never occur at this location - PositiveResult [Line: 108]: integer overflow can never occur For all program executions holds that integer overflow can never occur at this location - PositiveResult [Line: 108]: integer overflow can never occur For all program executions holds that integer overflow can never occur at this location - PositiveResult [Line: 109]: integer overflow can never occur For all program executions holds that integer overflow can never occur at this location - PositiveResult [Line: 109]: integer overflow can never occur For all program executions holds that integer overflow can never occur at this location - PositiveResult [Line: 107]: integer overflow can never occur For all program executions holds that integer overflow can never occur at this location - PositiveResult [Line: 107]: integer overflow can never occur For all program executions holds that integer overflow can never occur at this location - PositiveResult [Line: 108]: integer overflow can never occur For all program executions holds that integer overflow can never occur at this location - PositiveResult [Line: 108]: integer overflow can never occur For all program executions holds that integer overflow can never occur at this location - PositiveResult [Line: 109]: integer overflow can never occur For all program executions holds that integer overflow can never occur at this location - PositiveResult [Line: 109]: integer overflow can never occur For all program executions holds that integer overflow can never occur at this location - PositiveResult [Line: 107]: integer overflow can never occur For all program executions holds that integer overflow can never occur at this location - PositiveResult [Line: 107]: integer overflow can never occur For all program executions holds that integer overflow can never occur at this location - PositiveResult [Line: 108]: integer overflow can never occur For all program executions holds that integer overflow can never occur at this location - PositiveResult [Line: 108]: integer overflow can never occur For all program executions holds that integer overflow can never occur at this location - PositiveResult [Line: 109]: integer overflow can never occur For all program executions holds that integer overflow can never occur at this location - PositiveResult [Line: 109]: integer overflow can never occur For all program executions holds that integer overflow can never occur at this location - PositiveResult [Line: 107]: integer overflow can never occur For all program executions holds that integer overflow can never occur at this location - PositiveResult [Line: 107]: integer overflow can never occur For all program executions holds that integer overflow can never occur at this location - PositiveResult [Line: 108]: integer overflow can never occur For all program executions holds that integer overflow can never occur at this location - PositiveResult [Line: 108]: integer overflow can never occur For all program executions holds that integer overflow can never occur at this location - PositiveResult [Line: 109]: integer overflow can never occur For all program executions holds that integer overflow can never occur at this location - PositiveResult [Line: 109]: integer overflow can never occur For all program executions holds that integer overflow can never occur at this location - StatisticsResult: Ultimate Automizer benchmark data with 1 thread instances CFG has 7 procedures, 290 locations, 147 error locations. Started 1 CEGAR loops. OverallTime: 93.6s, OverallIterations: 24, TraceHistogramMax: 1, PathProgramHistogramMax: 1, EmptinessCheckTime: 0.1s, AutomataDifference: 6.9s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 77.4s, HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 824 SdHoareTripleChecker+Valid, 5.1s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 824 mSDsluCounter, 0 SdHoareTripleChecker+Invalid, 4.6s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 0 mSDsCounter, 48 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 888 IncrementalHoareTripleChecker+Invalid, 936 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 48 mSolverCounterUnsat, 0 mSDtfsCounter, 888 mSolverCounterSat, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 24 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 24 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=37956occurred in iteration=0, InterpolantAutomatonStates: 72, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s DumpTime, AutomataMinimizationStatistics: 4.1s AutomataMinimizationTime, 24 MinimizatonAttempts, 0 StatesRemovedByMinimization, 0 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.1s SsaConstructionTime, 0.5s SatisfiabilityAnalysisTime, 3.2s InterpolantComputationTime, 88 NumberOfCodeBlocks, 88 NumberOfCodeBlocksAsserted, 24 NumberOfCheckSat, 64 ConstructedInterpolants, 0 QuantifiedInterpolants, 256 SizeOfPredicates, 0 NumberOfNonLiveVariables, 0 ConjunctsInSsa, 0 ConjunctsInUnsatCore, 24 InterpolantComputations, 24 PerfectInterpolantSequences, 0/0 InterpolantCoveringCapability, INVARIANT_SYNTHESIS: No data available, INTERPOLANT_CONSOLIDATION: No data available, ABSTRACT_INTERPRETATION: No data available, PDR: No data available, ACCELERATED_INTERPOLATION: No data available, SIFA: No data available, ReuseStatistics: No data available - AllSpecificationsHoldResult: All specifications hold 72 specifications checked. All of them hold RESULT: Ultimate proved your program to be correct! [2022-11-02 20:47:16,859 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_e36b2227-d285-4776-ac3b-7ae48afdc8c7/bin/uautomizer-Dbtcem3rbc/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (1)] Ended with exit code 0 Received shutdown request... --- End real Ultimate output --- Execution finished normally Writing output log to file Ultimate.log Result: TRUE