./Ultimate.py --spec ../../sv-benchmarks/c/properties/no-overflow.prp --file ../../sv-benchmarks/c/systemc/token_ring.02.cil-2.c --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for overflows Using default analysis Version 2329fc70 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_ad0d263f-12fa-4ad5-bee0-2e1f42890785/bin/uautomizer-uyxdKDjOR8/data/config -Xmx15G -Xms4m -jar /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_ad0d263f-12fa-4ad5-bee0-2e1f42890785/bin/uautomizer-uyxdKDjOR8/plugins/org.eclipse.equinox.launcher_1.5.800.v20200727-1323.jar -data @noDefault -ultimatedata /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_ad0d263f-12fa-4ad5-bee0-2e1f42890785/bin/uautomizer-uyxdKDjOR8/data -tc /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_ad0d263f-12fa-4ad5-bee0-2e1f42890785/bin/uautomizer-uyxdKDjOR8/config/AutomizerReach.xml -i ../../sv-benchmarks/c/systemc/token_ring.02.cil-2.c -s /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_ad0d263f-12fa-4ad5-bee0-2e1f42890785/bin/uautomizer-uyxdKDjOR8/config/svcomp-Overflow-32bit-Automizer_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_ad0d263f-12fa-4ad5-bee0-2e1f42890785/bin/uautomizer-uyxdKDjOR8 --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 bc8487f898950b83c481f83a71342af68752fb6e7598d76df123761c32c89f72 --- 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-2329fc7 [2022-12-13 11:11:14,052 INFO L177 SettingsManager]: Resetting all preferences to default values... [2022-12-13 11:11:14,053 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2022-12-13 11:11:14,071 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2022-12-13 11:11:14,072 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2022-12-13 11:11:14,073 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2022-12-13 11:11:14,074 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2022-12-13 11:11:14,075 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2022-12-13 11:11:14,077 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2022-12-13 11:11:14,078 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2022-12-13 11:11:14,078 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2022-12-13 11:11:14,079 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2022-12-13 11:11:14,080 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2022-12-13 11:11:14,081 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2022-12-13 11:11:14,082 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2022-12-13 11:11:14,083 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2022-12-13 11:11:14,084 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2022-12-13 11:11:14,085 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2022-12-13 11:11:14,086 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2022-12-13 11:11:14,088 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2022-12-13 11:11:14,089 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2022-12-13 11:11:14,090 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2022-12-13 11:11:14,091 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2022-12-13 11:11:14,092 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2022-12-13 11:11:14,095 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2022-12-13 11:11:14,095 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2022-12-13 11:11:14,096 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2022-12-13 11:11:14,096 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2022-12-13 11:11:14,097 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2022-12-13 11:11:14,098 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2022-12-13 11:11:14,098 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2022-12-13 11:11:14,099 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2022-12-13 11:11:14,099 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2022-12-13 11:11:14,100 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2022-12-13 11:11:14,101 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2022-12-13 11:11:14,101 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2022-12-13 11:11:14,101 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2022-12-13 11:11:14,102 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2022-12-13 11:11:14,102 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2022-12-13 11:11:14,102 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2022-12-13 11:11:14,103 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2022-12-13 11:11:14,104 INFO L101 SettingsManager]: Beginning loading settings from /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_ad0d263f-12fa-4ad5-bee0-2e1f42890785/bin/uautomizer-uyxdKDjOR8/config/svcomp-Overflow-32bit-Automizer_Default.epf [2022-12-13 11:11:14,122 INFO L113 SettingsManager]: Loading preferences was successful [2022-12-13 11:11:14,122 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2022-12-13 11:11:14,122 INFO L136 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2022-12-13 11:11:14,122 INFO L138 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2022-12-13 11:11:14,123 INFO L136 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2022-12-13 11:11:14,123 INFO L138 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2022-12-13 11:11:14,124 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2022-12-13 11:11:14,124 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2022-12-13 11:11:14,124 INFO L138 SettingsManager]: * Use SBE=true [2022-12-13 11:11:14,124 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2022-12-13 11:11:14,124 INFO L138 SettingsManager]: * sizeof long=4 [2022-12-13 11:11:14,124 INFO L138 SettingsManager]: * Check unreachability of error function in SV-COMP mode=false [2022-12-13 11:11:14,125 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2022-12-13 11:11:14,125 INFO L138 SettingsManager]: * sizeof POINTER=4 [2022-12-13 11:11:14,125 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2022-12-13 11:11:14,125 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2022-12-13 11:11:14,125 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2022-12-13 11:11:14,125 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2022-12-13 11:11:14,125 INFO L138 SettingsManager]: * Check absence of signed integer overflows=true [2022-12-13 11:11:14,126 INFO L138 SettingsManager]: * sizeof long double=12 [2022-12-13 11:11:14,126 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2022-12-13 11:11:14,126 INFO L138 SettingsManager]: * Use constant arrays=true [2022-12-13 11:11:14,126 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2022-12-13 11:11:14,126 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2022-12-13 11:11:14,126 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2022-12-13 11:11:14,127 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2022-12-13 11:11:14,127 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-12-13 11:11:14,127 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2022-12-13 11:11:14,127 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2022-12-13 11:11:14,127 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2022-12-13 11:11:14,127 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2022-12-13 11:11:14,127 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2022-12-13 11:11:14,128 INFO L138 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2022-12-13 11:11:14,128 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2022-12-13 11:11:14,128 INFO L138 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2022-12-13 11:11:14,128 INFO L138 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2022-12-13 11:11:14,128 INFO L138 SettingsManager]: * Independence relation used for large block encoding in concurrent analysis=SYNTACTIC [2022-12-13 11:11:14,128 INFO L138 SettingsManager]: * Looper check in Petri net analysis=SEMANTIC 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_ad0d263f-12fa-4ad5-bee0-2e1f42890785/bin/uautomizer-uyxdKDjOR8/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_ad0d263f-12fa-4ad5-bee0-2e1f42890785/bin/uautomizer-uyxdKDjOR8 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 -> bc8487f898950b83c481f83a71342af68752fb6e7598d76df123761c32c89f72 [2022-12-13 11:11:14,334 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2022-12-13 11:11:14,355 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2022-12-13 11:11:14,358 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2022-12-13 11:11:14,359 INFO L271 PluginConnector]: Initializing CDTParser... [2022-12-13 11:11:14,359 INFO L275 PluginConnector]: CDTParser initialized [2022-12-13 11:11:14,361 INFO L432 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_ad0d263f-12fa-4ad5-bee0-2e1f42890785/bin/uautomizer-uyxdKDjOR8/../../sv-benchmarks/c/systemc/token_ring.02.cil-2.c [2022-12-13 11:11:17,046 INFO L500 CDTParser]: Created temporary CDT project at NULL [2022-12-13 11:11:17,230 INFO L351 CDTParser]: Found 1 translation units. [2022-12-13 11:11:17,230 INFO L172 CDTParser]: Scanning /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_ad0d263f-12fa-4ad5-bee0-2e1f42890785/sv-benchmarks/c/systemc/token_ring.02.cil-2.c [2022-12-13 11:11:17,236 INFO L394 CDTParser]: About to delete temporary CDT project at /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_ad0d263f-12fa-4ad5-bee0-2e1f42890785/bin/uautomizer-uyxdKDjOR8/data/e1ae60566/9b306b276dda45d9aa901735dfce84ac/FLAG1f705e7ed [2022-12-13 11:11:17,617 INFO L402 CDTParser]: Successfully deleted /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_ad0d263f-12fa-4ad5-bee0-2e1f42890785/bin/uautomizer-uyxdKDjOR8/data/e1ae60566/9b306b276dda45d9aa901735dfce84ac [2022-12-13 11:11:17,619 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2022-12-13 11:11:17,620 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2022-12-13 11:11:17,620 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2022-12-13 11:11:17,621 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2022-12-13 11:11:17,623 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2022-12-13 11:11:17,623 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 13.12 11:11:17" (1/1) ... [2022-12-13 11:11:17,624 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@427d2f0a and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.12 11:11:17, skipping insertion in model container [2022-12-13 11:11:17,624 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 13.12 11:11:17" (1/1) ... [2022-12-13 11:11:17,629 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2022-12-13 11:11:17,648 INFO L178 MainTranslator]: Built tables and reachable declarations [2022-12-13 11:11:17,739 WARN L237 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_ad0d263f-12fa-4ad5-bee0-2e1f42890785/sv-benchmarks/c/systemc/token_ring.02.cil-2.c[671,684] [2022-12-13 11:11:17,783 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-12-13 11:11:17,793 INFO L203 MainTranslator]: Completed pre-run [2022-12-13 11:11:17,802 WARN L237 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_ad0d263f-12fa-4ad5-bee0-2e1f42890785/sv-benchmarks/c/systemc/token_ring.02.cil-2.c[671,684] [2022-12-13 11:11:17,825 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-12-13 11:11:17,836 INFO L208 MainTranslator]: Completed translation [2022-12-13 11:11:17,836 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.12 11:11:17 WrapperNode [2022-12-13 11:11:17,836 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2022-12-13 11:11:17,837 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2022-12-13 11:11:17,837 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2022-12-13 11:11:17,837 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2022-12-13 11:11:17,842 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.12 11:11:17" (1/1) ... [2022-12-13 11:11:17,848 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.12 11:11:17" (1/1) ... [2022-12-13 11:11:17,864 INFO L138 Inliner]: procedures = 32, calls = 38, calls flagged for inlining = 15, calls inlined = 15, statements flattened = 284 [2022-12-13 11:11:17,864 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2022-12-13 11:11:17,865 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2022-12-13 11:11:17,865 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2022-12-13 11:11:17,865 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2022-12-13 11:11:17,871 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.12 11:11:17" (1/1) ... [2022-12-13 11:11:17,872 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.12 11:11:17" (1/1) ... [2022-12-13 11:11:17,873 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.12 11:11:17" (1/1) ... [2022-12-13 11:11:17,873 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.12 11:11:17" (1/1) ... [2022-12-13 11:11:17,876 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.12 11:11:17" (1/1) ... [2022-12-13 11:11:17,880 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.12 11:11:17" (1/1) ... [2022-12-13 11:11:17,881 INFO L185 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.12 11:11:17" (1/1) ... [2022-12-13 11:11:17,882 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.12 11:11:17" (1/1) ... [2022-12-13 11:11:17,884 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2022-12-13 11:11:17,885 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2022-12-13 11:11:17,885 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2022-12-13 11:11:17,885 INFO L275 PluginConnector]: RCFGBuilder initialized [2022-12-13 11:11:17,885 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.12 11:11:17" (1/1) ... [2022-12-13 11:11:17,890 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-12-13 11:11:17,898 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_ad0d263f-12fa-4ad5-bee0-2e1f42890785/bin/uautomizer-uyxdKDjOR8/z3 [2022-12-13 11:11:17,906 INFO L229 MonitoredProcess]: Starting monitored process 1 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_ad0d263f-12fa-4ad5-bee0-2e1f42890785/bin/uautomizer-uyxdKDjOR8/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (exit command is (exit), workingDir is null) [2022-12-13 11:11:17,908 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_ad0d263f-12fa-4ad5-bee0-2e1f42890785/bin/uautomizer-uyxdKDjOR8/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (1)] Waiting until timeout for monitored process [2022-12-13 11:11:17,937 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2022-12-13 11:11:17,937 INFO L130 BoogieDeclarations]: Found specification of procedure error [2022-12-13 11:11:17,937 INFO L138 BoogieDeclarations]: Found implementation of procedure error [2022-12-13 11:11:17,937 INFO L130 BoogieDeclarations]: Found specification of procedure fire_delta_events [2022-12-13 11:11:17,937 INFO L138 BoogieDeclarations]: Found implementation of procedure fire_delta_events [2022-12-13 11:11:17,938 INFO L130 BoogieDeclarations]: Found specification of procedure activate_threads [2022-12-13 11:11:17,938 INFO L138 BoogieDeclarations]: Found implementation of procedure activate_threads [2022-12-13 11:11:17,938 INFO L130 BoogieDeclarations]: Found specification of procedure immediate_notify [2022-12-13 11:11:17,938 INFO L138 BoogieDeclarations]: Found implementation of procedure immediate_notify [2022-12-13 11:11:17,938 INFO L130 BoogieDeclarations]: Found specification of procedure exists_runnable_thread [2022-12-13 11:11:17,938 INFO L138 BoogieDeclarations]: Found implementation of procedure exists_runnable_thread [2022-12-13 11:11:17,938 INFO L130 BoogieDeclarations]: Found specification of procedure reset_delta_events [2022-12-13 11:11:17,938 INFO L138 BoogieDeclarations]: Found implementation of procedure reset_delta_events [2022-12-13 11:11:17,939 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2022-12-13 11:11:17,939 INFO L130 BoogieDeclarations]: Found specification of procedure update_channels [2022-12-13 11:11:17,939 INFO L138 BoogieDeclarations]: Found implementation of procedure update_channels [2022-12-13 11:11:17,939 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2022-12-13 11:11:17,939 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2022-12-13 11:11:18,002 INFO L235 CfgBuilder]: Building ICFG [2022-12-13 11:11:18,004 INFO L261 CfgBuilder]: Building CFG for each procedure with an implementation [2022-12-13 11:11:18,282 INFO L276 CfgBuilder]: Performing block encoding [2022-12-13 11:11:18,289 INFO L295 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2022-12-13 11:11:18,289 INFO L300 CfgBuilder]: Removed 5 assume(true) statements. [2022-12-13 11:11:18,291 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 13.12 11:11:18 BoogieIcfgContainer [2022-12-13 11:11:18,291 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2022-12-13 11:11:18,292 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2022-12-13 11:11:18,293 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2022-12-13 11:11:18,295 INFO L275 PluginConnector]: TraceAbstraction initialized [2022-12-13 11:11:18,295 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 13.12 11:11:17" (1/3) ... [2022-12-13 11:11:18,295 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@59219978 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 13.12 11:11:18, skipping insertion in model container [2022-12-13 11:11:18,296 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.12 11:11:17" (2/3) ... [2022-12-13 11:11:18,296 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@59219978 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 13.12 11:11:18, skipping insertion in model container [2022-12-13 11:11:18,296 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 13.12 11:11:18" (3/3) ... [2022-12-13 11:11:18,297 INFO L112 eAbstractionObserver]: Analyzing ICFG token_ring.02.cil-2.c [2022-12-13 11:11:18,311 INFO L203 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2022-12-13 11:11:18,311 INFO L162 ceAbstractionStarter]: Applying trace abstraction to program that has 6 error locations. [2022-12-13 11:11:18,348 INFO L356 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2022-12-13 11:11:18,353 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=PETRI_NET, 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;@2a5d1f3b, mLbeIndependenceSettings=[IndependenceType=SYNTACTIC, AbstractionType=NONE, UseConditional=, UseSemiCommutativity=, Solver=, SolverTimeout=] [2022-12-13 11:11:18,353 INFO L358 AbstractCegarLoop]: Starting to check reachability of 6 error locations. [2022-12-13 11:11:18,356 INFO L276 IsEmpty]: Start isEmpty. Operand has 149 states, 117 states have (on average 1.606837606837607) internal successors, (188), 126 states have internal predecessors, (188), 18 states have call successors, (18), 7 states have call predecessors, (18), 7 states have return successors, (18), 17 states have call predecessors, (18), 18 states have call successors, (18) [2022-12-13 11:11:18,363 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 67 [2022-12-13 11:11:18,364 INFO L187 NwaCegarLoop]: Found error trace [2022-12-13 11:11:18,370 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-13 11:11:18,371 INFO L420 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 3 more)] === [2022-12-13 11:11:18,375 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 11:11:18,375 INFO L85 PathProgramCache]: Analyzing trace with hash -1140351228, now seen corresponding path program 1 times [2022-12-13 11:11:18,381 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-13 11:11:18,382 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [14860112] [2022-12-13 11:11:18,382 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 11:11:18,382 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-13 11:11:18,457 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 11:11:18,534 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2022-12-13 11:11:18,537 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 11:11:18,553 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2022-12-13 11:11:18,559 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 11:11:18,572 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 20 [2022-12-13 11:11:18,579 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 11:11:18,588 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 41 [2022-12-13 11:11:18,592 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 11:11:18,596 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 53 [2022-12-13 11:11:18,598 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 11:11:18,601 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-13 11:11:18,601 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-13 11:11:18,601 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [14860112] [2022-12-13 11:11:18,602 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [14860112] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-13 11:11:18,602 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-13 11:11:18,602 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2022-12-13 11:11:18,603 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1126173480] [2022-12-13 11:11:18,604 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-13 11:11:18,607 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-12-13 11:11:18,607 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-13 11:11:18,628 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-12-13 11:11:18,628 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2022-12-13 11:11:18,630 INFO L87 Difference]: Start difference. First operand has 149 states, 117 states have (on average 1.606837606837607) internal successors, (188), 126 states have internal predecessors, (188), 18 states have call successors, (18), 7 states have call predecessors, (18), 7 states have return successors, (18), 17 states have call predecessors, (18), 18 states have call successors, (18) Second operand has 5 states, 5 states have (on average 11.2) internal successors, (56), 3 states have internal predecessors, (56), 2 states have call successors, (5), 3 states have call predecessors, (5), 1 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) [2022-12-13 11:11:19,009 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-12-13 11:11:19,009 INFO L93 Difference]: Finished difference Result 322 states and 494 transitions. [2022-12-13 11:11:19,011 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2022-12-13 11:11:19,012 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 11.2) internal successors, (56), 3 states have internal predecessors, (56), 2 states have call successors, (5), 3 states have call predecessors, (5), 1 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) Word has length 66 [2022-12-13 11:11:19,012 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-12-13 11:11:19,020 INFO L225 Difference]: With dead ends: 322 [2022-12-13 11:11:19,020 INFO L226 Difference]: Without dead ends: 172 [2022-12-13 11:11:19,023 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 19 GetRequests, 13 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=22, Invalid=34, Unknown=0, NotChecked=0, Total=56 [2022-12-13 11:11:19,025 INFO L413 NwaCegarLoop]: 148 mSDtfsCounter, 309 mSDsluCounter, 175 mSDsCounter, 0 mSdLazyCounter, 266 mSolverCounterSat, 40 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 323 SdHoareTripleChecker+Valid, 323 SdHoareTripleChecker+Invalid, 306 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 40 IncrementalHoareTripleChecker+Valid, 266 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2022-12-13 11:11:19,026 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [323 Valid, 323 Invalid, 306 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [40 Valid, 266 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2022-12-13 11:11:19,039 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 172 states. [2022-12-13 11:11:19,074 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 172 to 140. [2022-12-13 11:11:19,075 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 140 states, 112 states have (on average 1.5089285714285714) internal successors, (169), 118 states have internal predecessors, (169), 16 states have call successors, (16), 6 states have call predecessors, (16), 6 states have return successors, (16), 16 states have call predecessors, (16), 16 states have call successors, (16) [2022-12-13 11:11:19,077 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 140 states to 140 states and 201 transitions. [2022-12-13 11:11:19,078 INFO L78 Accepts]: Start accepts. Automaton has 140 states and 201 transitions. Word has length 66 [2022-12-13 11:11:19,078 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-12-13 11:11:19,078 INFO L495 AbstractCegarLoop]: Abstraction has 140 states and 201 transitions. [2022-12-13 11:11:19,079 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 11.2) internal successors, (56), 3 states have internal predecessors, (56), 2 states have call successors, (5), 3 states have call predecessors, (5), 1 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) [2022-12-13 11:11:19,079 INFO L276 IsEmpty]: Start isEmpty. Operand 140 states and 201 transitions. [2022-12-13 11:11:19,081 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 67 [2022-12-13 11:11:19,081 INFO L187 NwaCegarLoop]: Found error trace [2022-12-13 11:11:19,081 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-13 11:11:19,081 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2022-12-13 11:11:19,081 INFO L420 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 3 more)] === [2022-12-13 11:11:19,082 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 11:11:19,082 INFO L85 PathProgramCache]: Analyzing trace with hash -1701051006, now seen corresponding path program 1 times [2022-12-13 11:11:19,082 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-13 11:11:19,082 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [806490477] [2022-12-13 11:11:19,082 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 11:11:19,082 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-13 11:11:19,098 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 11:11:19,170 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2022-12-13 11:11:19,172 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 11:11:19,183 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2022-12-13 11:11:19,188 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 11:11:19,220 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 20 [2022-12-13 11:11:19,224 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 11:11:19,232 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 41 [2022-12-13 11:11:19,235 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 11:11:19,238 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 53 [2022-12-13 11:11:19,240 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 11:11:19,241 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-13 11:11:19,242 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-13 11:11:19,242 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [806490477] [2022-12-13 11:11:19,242 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [806490477] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-13 11:11:19,242 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-13 11:11:19,242 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2022-12-13 11:11:19,242 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [370813831] [2022-12-13 11:11:19,243 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-13 11:11:19,243 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2022-12-13 11:11:19,244 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-13 11:11:19,244 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2022-12-13 11:11:19,244 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2022-12-13 11:11:19,245 INFO L87 Difference]: Start difference. First operand 140 states and 201 transitions. Second operand has 6 states, 6 states have (on average 9.333333333333334) internal successors, (56), 4 states have internal predecessors, (56), 2 states have call successors, (5), 3 states have call predecessors, (5), 2 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) [2022-12-13 11:11:19,863 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-12-13 11:11:19,863 INFO L93 Difference]: Finished difference Result 462 states and 682 transitions. [2022-12-13 11:11:19,863 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2022-12-13 11:11:19,863 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 9.333333333333334) internal successors, (56), 4 states have internal predecessors, (56), 2 states have call successors, (5), 3 states have call predecessors, (5), 2 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) Word has length 66 [2022-12-13 11:11:19,864 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-12-13 11:11:19,866 INFO L225 Difference]: With dead ends: 462 [2022-12-13 11:11:19,866 INFO L226 Difference]: Without dead ends: 332 [2022-12-13 11:11:19,868 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 21 GetRequests, 12 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 10 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=33, Invalid=77, Unknown=0, NotChecked=0, Total=110 [2022-12-13 11:11:19,869 INFO L413 NwaCegarLoop]: 145 mSDtfsCounter, 428 mSDsluCounter, 382 mSDsCounter, 0 mSdLazyCounter, 635 mSolverCounterSat, 68 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 437 SdHoareTripleChecker+Valid, 527 SdHoareTripleChecker+Invalid, 703 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 68 IncrementalHoareTripleChecker+Valid, 635 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.5s IncrementalHoareTripleChecker+Time [2022-12-13 11:11:19,869 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [437 Valid, 527 Invalid, 703 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [68 Valid, 635 Invalid, 0 Unknown, 0 Unchecked, 0.5s Time] [2022-12-13 11:11:19,870 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 332 states. [2022-12-13 11:11:19,902 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 332 to 265. [2022-12-13 11:11:19,903 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 265 states, 219 states have (on average 1.5205479452054795) internal successors, (333), 226 states have internal predecessors, (333), 27 states have call successors, (27), 12 states have call predecessors, (27), 13 states have return successors, (30), 27 states have call predecessors, (30), 27 states have call successors, (30) [2022-12-13 11:11:19,905 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 265 states to 265 states and 390 transitions. [2022-12-13 11:11:19,906 INFO L78 Accepts]: Start accepts. Automaton has 265 states and 390 transitions. Word has length 66 [2022-12-13 11:11:19,906 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-12-13 11:11:19,906 INFO L495 AbstractCegarLoop]: Abstraction has 265 states and 390 transitions. [2022-12-13 11:11:19,906 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 9.333333333333334) internal successors, (56), 4 states have internal predecessors, (56), 2 states have call successors, (5), 3 states have call predecessors, (5), 2 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) [2022-12-13 11:11:19,906 INFO L276 IsEmpty]: Start isEmpty. Operand 265 states and 390 transitions. [2022-12-13 11:11:19,908 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 67 [2022-12-13 11:11:19,908 INFO L187 NwaCegarLoop]: Found error trace [2022-12-13 11:11:19,908 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-13 11:11:19,908 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2022-12-13 11:11:19,908 INFO L420 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 3 more)] === [2022-12-13 11:11:19,909 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 11:11:19,909 INFO L85 PathProgramCache]: Analyzing trace with hash -959045506, now seen corresponding path program 1 times [2022-12-13 11:11:19,909 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-13 11:11:19,909 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [93899220] [2022-12-13 11:11:19,910 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 11:11:19,910 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-13 11:11:19,920 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 11:11:19,992 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2022-12-13 11:11:19,993 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 11:11:20,003 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2022-12-13 11:11:20,006 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 11:11:20,044 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 20 [2022-12-13 11:11:20,048 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 11:11:20,052 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 41 [2022-12-13 11:11:20,054 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 11:11:20,057 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 53 [2022-12-13 11:11:20,059 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 11:11:20,061 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-13 11:11:20,061 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-13 11:11:20,061 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [93899220] [2022-12-13 11:11:20,061 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [93899220] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-13 11:11:20,062 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-13 11:11:20,062 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2022-12-13 11:11:20,062 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2072408210] [2022-12-13 11:11:20,062 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-13 11:11:20,062 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2022-12-13 11:11:20,063 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-13 11:11:20,063 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2022-12-13 11:11:20,063 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2022-12-13 11:11:20,064 INFO L87 Difference]: Start difference. First operand 265 states and 390 transitions. Second operand has 7 states, 7 states have (on average 8.0) internal successors, (56), 5 states have internal predecessors, (56), 2 states have call successors, (5), 3 states have call predecessors, (5), 2 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) [2022-12-13 11:11:20,746 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-12-13 11:11:20,746 INFO L93 Difference]: Finished difference Result 743 states and 1102 transitions. [2022-12-13 11:11:20,746 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2022-12-13 11:11:20,747 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 8.0) internal successors, (56), 5 states have internal predecessors, (56), 2 states have call successors, (5), 3 states have call predecessors, (5), 2 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) Word has length 66 [2022-12-13 11:11:20,747 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-12-13 11:11:20,748 INFO L225 Difference]: With dead ends: 743 [2022-12-13 11:11:20,749 INFO L226 Difference]: Without dead ends: 488 [2022-12-13 11:11:20,749 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 27 GetRequests, 13 SyntacticMatches, 0 SemanticMatches, 14 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 37 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=66, Invalid=174, Unknown=0, NotChecked=0, Total=240 [2022-12-13 11:11:20,750 INFO L413 NwaCegarLoop]: 225 mSDtfsCounter, 423 mSDsluCounter, 745 mSDsCounter, 0 mSdLazyCounter, 953 mSolverCounterSat, 43 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 432 SdHoareTripleChecker+Valid, 970 SdHoareTripleChecker+Invalid, 996 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 43 IncrementalHoareTripleChecker+Valid, 953 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.5s IncrementalHoareTripleChecker+Time [2022-12-13 11:11:20,751 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [432 Valid, 970 Invalid, 996 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [43 Valid, 953 Invalid, 0 Unknown, 0 Unchecked, 0.5s Time] [2022-12-13 11:11:20,751 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 488 states. [2022-12-13 11:11:20,772 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 488 to 383. [2022-12-13 11:11:20,773 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 383 states, 319 states have (on average 1.5141065830721003) internal successors, (483), 327 states have internal predecessors, (483), 38 states have call successors, (38), 18 states have call predecessors, (38), 20 states have return successors, (43), 39 states have call predecessors, (43), 38 states have call successors, (43) [2022-12-13 11:11:20,774 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 383 states to 383 states and 564 transitions. [2022-12-13 11:11:20,775 INFO L78 Accepts]: Start accepts. Automaton has 383 states and 564 transitions. Word has length 66 [2022-12-13 11:11:20,775 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-12-13 11:11:20,775 INFO L495 AbstractCegarLoop]: Abstraction has 383 states and 564 transitions. [2022-12-13 11:11:20,775 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 8.0) internal successors, (56), 5 states have internal predecessors, (56), 2 states have call successors, (5), 3 states have call predecessors, (5), 2 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) [2022-12-13 11:11:20,775 INFO L276 IsEmpty]: Start isEmpty. Operand 383 states and 564 transitions. [2022-12-13 11:11:20,776 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 67 [2022-12-13 11:11:20,776 INFO L187 NwaCegarLoop]: Found error trace [2022-12-13 11:11:20,776 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-13 11:11:20,776 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2022-12-13 11:11:20,776 INFO L420 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 3 more)] === [2022-12-13 11:11:20,776 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 11:11:20,777 INFO L85 PathProgramCache]: Analyzing trace with hash -515144832, now seen corresponding path program 1 times [2022-12-13 11:11:20,777 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-13 11:11:20,777 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [943870974] [2022-12-13 11:11:20,777 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 11:11:20,777 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-13 11:11:20,783 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 11:11:20,816 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2022-12-13 11:11:20,818 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 11:11:20,827 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2022-12-13 11:11:20,829 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 11:11:20,858 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 20 [2022-12-13 11:11:20,861 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 11:11:20,866 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 41 [2022-12-13 11:11:20,867 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 11:11:20,870 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 53 [2022-12-13 11:11:20,870 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 11:11:20,872 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-13 11:11:20,872 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-13 11:11:20,872 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [943870974] [2022-12-13 11:11:20,872 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [943870974] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-13 11:11:20,872 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-13 11:11:20,872 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2022-12-13 11:11:20,872 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2109891236] [2022-12-13 11:11:20,872 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-13 11:11:20,873 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2022-12-13 11:11:20,873 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-13 11:11:20,873 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2022-12-13 11:11:20,873 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2022-12-13 11:11:20,873 INFO L87 Difference]: Start difference. First operand 383 states and 564 transitions. Second operand has 7 states, 7 states have (on average 8.0) internal successors, (56), 5 states have internal predecessors, (56), 2 states have call successors, (5), 3 states have call predecessors, (5), 2 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) [2022-12-13 11:11:21,505 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-12-13 11:11:21,505 INFO L93 Difference]: Finished difference Result 1156 states and 1720 transitions. [2022-12-13 11:11:21,506 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2022-12-13 11:11:21,506 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 8.0) internal successors, (56), 5 states have internal predecessors, (56), 2 states have call successors, (5), 3 states have call predecessors, (5), 2 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) Word has length 66 [2022-12-13 11:11:21,506 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-12-13 11:11:21,510 INFO L225 Difference]: With dead ends: 1156 [2022-12-13 11:11:21,510 INFO L226 Difference]: Without dead ends: 783 [2022-12-13 11:11:21,512 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 27 GetRequests, 13 SyntacticMatches, 0 SemanticMatches, 14 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 37 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=66, Invalid=174, Unknown=0, NotChecked=0, Total=240 [2022-12-13 11:11:21,513 INFO L413 NwaCegarLoop]: 150 mSDtfsCounter, 461 mSDsluCounter, 499 mSDsCounter, 0 mSdLazyCounter, 843 mSolverCounterSat, 59 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 470 SdHoareTripleChecker+Valid, 649 SdHoareTripleChecker+Invalid, 902 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 59 IncrementalHoareTripleChecker+Valid, 843 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.5s IncrementalHoareTripleChecker+Time [2022-12-13 11:11:21,514 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [470 Valid, 649 Invalid, 902 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [59 Valid, 843 Invalid, 0 Unknown, 0 Unchecked, 0.5s Time] [2022-12-13 11:11:21,515 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 783 states. [2022-12-13 11:11:21,558 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 783 to 620. [2022-12-13 11:11:21,560 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 620 states, 520 states have (on average 1.5076923076923077) internal successors, (784), 530 states have internal predecessors, (784), 60 states have call successors, (60), 30 states have call predecessors, (60), 34 states have return successors, (73), 63 states have call predecessors, (73), 60 states have call successors, (73) [2022-12-13 11:11:21,564 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 620 states to 620 states and 917 transitions. [2022-12-13 11:11:21,564 INFO L78 Accepts]: Start accepts. Automaton has 620 states and 917 transitions. Word has length 66 [2022-12-13 11:11:21,564 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-12-13 11:11:21,564 INFO L495 AbstractCegarLoop]: Abstraction has 620 states and 917 transitions. [2022-12-13 11:11:21,564 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 8.0) internal successors, (56), 5 states have internal predecessors, (56), 2 states have call successors, (5), 3 states have call predecessors, (5), 2 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) [2022-12-13 11:11:21,565 INFO L276 IsEmpty]: Start isEmpty. Operand 620 states and 917 transitions. [2022-12-13 11:11:21,566 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 67 [2022-12-13 11:11:21,566 INFO L187 NwaCegarLoop]: Found error trace [2022-12-13 11:11:21,566 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-13 11:11:21,566 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2022-12-13 11:11:21,567 INFO L420 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 3 more)] === [2022-12-13 11:11:21,567 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 11:11:21,567 INFO L85 PathProgramCache]: Analyzing trace with hash 1023195198, now seen corresponding path program 1 times [2022-12-13 11:11:21,567 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-13 11:11:21,567 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1497760016] [2022-12-13 11:11:21,568 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 11:11:21,568 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-13 11:11:21,575 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 11:11:21,620 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2022-12-13 11:11:21,621 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 11:11:21,630 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2022-12-13 11:11:21,632 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 11:11:21,660 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 20 [2022-12-13 11:11:21,663 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 11:11:21,666 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 41 [2022-12-13 11:11:21,668 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 11:11:21,670 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 53 [2022-12-13 11:11:21,671 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 11:11:21,672 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-13 11:11:21,673 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-13 11:11:21,673 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1497760016] [2022-12-13 11:11:21,673 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1497760016] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-13 11:11:21,673 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-13 11:11:21,673 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2022-12-13 11:11:21,673 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [827212902] [2022-12-13 11:11:21,673 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-13 11:11:21,674 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2022-12-13 11:11:21,674 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-13 11:11:21,674 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2022-12-13 11:11:21,675 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2022-12-13 11:11:21,675 INFO L87 Difference]: Start difference. First operand 620 states and 917 transitions. Second operand has 7 states, 7 states have (on average 8.0) internal successors, (56), 5 states have internal predecessors, (56), 2 states have call successors, (5), 3 states have call predecessors, (5), 2 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) [2022-12-13 11:11:22,416 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-12-13 11:11:22,416 INFO L93 Difference]: Finished difference Result 2054 states and 3059 transitions. [2022-12-13 11:11:22,416 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2022-12-13 11:11:22,416 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 8.0) internal successors, (56), 5 states have internal predecessors, (56), 2 states have call successors, (5), 3 states have call predecessors, (5), 2 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) Word has length 66 [2022-12-13 11:11:22,416 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-12-13 11:11:22,421 INFO L225 Difference]: With dead ends: 2054 [2022-12-13 11:11:22,421 INFO L226 Difference]: Without dead ends: 1444 [2022-12-13 11:11:22,422 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 30 GetRequests, 15 SyntacticMatches, 0 SemanticMatches, 15 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 45 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=73, Invalid=199, Unknown=0, NotChecked=0, Total=272 [2022-12-13 11:11:22,423 INFO L413 NwaCegarLoop]: 220 mSDtfsCounter, 433 mSDsluCounter, 734 mSDsCounter, 0 mSdLazyCounter, 1042 mSolverCounterSat, 47 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 441 SdHoareTripleChecker+Valid, 954 SdHoareTripleChecker+Invalid, 1089 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 47 IncrementalHoareTripleChecker+Valid, 1042 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.5s IncrementalHoareTripleChecker+Time [2022-12-13 11:11:22,423 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [441 Valid, 954 Invalid, 1089 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [47 Valid, 1042 Invalid, 0 Unknown, 0 Unchecked, 0.5s Time] [2022-12-13 11:11:22,425 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1444 states. [2022-12-13 11:11:22,472 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1444 to 1040. [2022-12-13 11:11:22,473 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1040 states, 872 states have (on average 1.5) internal successors, (1308), 886 states have internal predecessors, (1308), 100 states have call successors, (100), 54 states have call predecessors, (100), 62 states have return successors, (135), 107 states have call predecessors, (135), 100 states have call successors, (135) [2022-12-13 11:11:22,477 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1040 states to 1040 states and 1543 transitions. [2022-12-13 11:11:22,477 INFO L78 Accepts]: Start accepts. Automaton has 1040 states and 1543 transitions. Word has length 66 [2022-12-13 11:11:22,477 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-12-13 11:11:22,477 INFO L495 AbstractCegarLoop]: Abstraction has 1040 states and 1543 transitions. [2022-12-13 11:11:22,477 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 8.0) internal successors, (56), 5 states have internal predecessors, (56), 2 states have call successors, (5), 3 states have call predecessors, (5), 2 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) [2022-12-13 11:11:22,478 INFO L276 IsEmpty]: Start isEmpty. Operand 1040 states and 1543 transitions. [2022-12-13 11:11:22,478 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 67 [2022-12-13 11:11:22,479 INFO L187 NwaCegarLoop]: Found error trace [2022-12-13 11:11:22,479 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-13 11:11:22,479 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2022-12-13 11:11:22,479 INFO L420 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 3 more)] === [2022-12-13 11:11:22,479 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 11:11:22,479 INFO L85 PathProgramCache]: Analyzing trace with hash 542114940, now seen corresponding path program 1 times [2022-12-13 11:11:22,479 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-13 11:11:22,479 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [680121641] [2022-12-13 11:11:22,479 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 11:11:22,479 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-13 11:11:22,484 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 11:11:22,509 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2022-12-13 11:11:22,510 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 11:11:22,517 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2022-12-13 11:11:22,518 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 11:11:22,550 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 20 [2022-12-13 11:11:22,553 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 11:11:22,556 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 41 [2022-12-13 11:11:22,558 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 11:11:22,560 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 53 [2022-12-13 11:11:22,561 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 11:11:22,562 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-13 11:11:22,562 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-13 11:11:22,563 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [680121641] [2022-12-13 11:11:22,563 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [680121641] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-13 11:11:22,563 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-13 11:11:22,563 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2022-12-13 11:11:22,563 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1935609228] [2022-12-13 11:11:22,563 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-13 11:11:22,564 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2022-12-13 11:11:22,564 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-13 11:11:22,564 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2022-12-13 11:11:22,564 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2022-12-13 11:11:22,564 INFO L87 Difference]: Start difference. First operand 1040 states and 1543 transitions. Second operand has 7 states, 7 states have (on average 8.0) internal successors, (56), 5 states have internal predecessors, (56), 2 states have call successors, (5), 3 states have call predecessors, (5), 2 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) [2022-12-13 11:11:23,277 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-12-13 11:11:23,277 INFO L93 Difference]: Finished difference Result 3476 states and 5171 transitions. [2022-12-13 11:11:23,278 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2022-12-13 11:11:23,278 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 8.0) internal successors, (56), 5 states have internal predecessors, (56), 2 states have call successors, (5), 3 states have call predecessors, (5), 2 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) Word has length 66 [2022-12-13 11:11:23,278 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-12-13 11:11:23,286 INFO L225 Difference]: With dead ends: 3476 [2022-12-13 11:11:23,286 INFO L226 Difference]: Without dead ends: 2446 [2022-12-13 11:11:23,288 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 30 GetRequests, 15 SyntacticMatches, 0 SemanticMatches, 15 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 45 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=73, Invalid=199, Unknown=0, NotChecked=0, Total=272 [2022-12-13 11:11:23,289 INFO L413 NwaCegarLoop]: 221 mSDtfsCounter, 435 mSDsluCounter, 737 mSDsCounter, 0 mSdLazyCounter, 901 mSolverCounterSat, 51 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 447 SdHoareTripleChecker+Valid, 958 SdHoareTripleChecker+Invalid, 952 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 51 IncrementalHoareTripleChecker+Valid, 901 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.5s IncrementalHoareTripleChecker+Time [2022-12-13 11:11:23,290 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [447 Valid, 958 Invalid, 952 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [51 Valid, 901 Invalid, 0 Unknown, 0 Unchecked, 0.5s Time] [2022-12-13 11:11:23,292 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2446 states. [2022-12-13 11:11:23,389 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2446 to 1913. [2022-12-13 11:11:23,391 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1913 states, 1613 states have (on average 1.4941103533787972) internal successors, (2410), 1635 states have internal predecessors, (2410), 176 states have call successors, (176), 102 states have call predecessors, (176), 118 states have return successors, (273), 191 states have call predecessors, (273), 176 states have call successors, (273) [2022-12-13 11:11:23,396 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1913 states to 1913 states and 2859 transitions. [2022-12-13 11:11:23,397 INFO L78 Accepts]: Start accepts. Automaton has 1913 states and 2859 transitions. Word has length 66 [2022-12-13 11:11:23,397 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-12-13 11:11:23,397 INFO L495 AbstractCegarLoop]: Abstraction has 1913 states and 2859 transitions. [2022-12-13 11:11:23,397 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 8.0) internal successors, (56), 5 states have internal predecessors, (56), 2 states have call successors, (5), 3 states have call predecessors, (5), 2 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) [2022-12-13 11:11:23,397 INFO L276 IsEmpty]: Start isEmpty. Operand 1913 states and 2859 transitions. [2022-12-13 11:11:23,398 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 67 [2022-12-13 11:11:23,399 INFO L187 NwaCegarLoop]: Found error trace [2022-12-13 11:11:23,399 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-13 11:11:23,399 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2022-12-13 11:11:23,399 INFO L420 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 3 more)] === [2022-12-13 11:11:23,399 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 11:11:23,399 INFO L85 PathProgramCache]: Analyzing trace with hash 526596222, now seen corresponding path program 1 times [2022-12-13 11:11:23,400 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-13 11:11:23,400 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [699734186] [2022-12-13 11:11:23,400 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 11:11:23,400 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-13 11:11:23,406 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 11:11:23,422 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2022-12-13 11:11:23,423 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 11:11:23,432 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2022-12-13 11:11:23,434 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 11:11:23,442 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 20 [2022-12-13 11:11:23,444 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 11:11:23,459 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 41 [2022-12-13 11:11:23,460 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 11:11:23,463 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 53 [2022-12-13 11:11:23,464 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 11:11:23,465 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-13 11:11:23,465 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-13 11:11:23,465 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [699734186] [2022-12-13 11:11:23,466 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [699734186] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-13 11:11:23,466 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-13 11:11:23,466 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2022-12-13 11:11:23,466 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1169669081] [2022-12-13 11:11:23,466 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-13 11:11:23,466 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2022-12-13 11:11:23,467 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-13 11:11:23,467 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2022-12-13 11:11:23,467 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2022-12-13 11:11:23,467 INFO L87 Difference]: Start difference. First operand 1913 states and 2859 transitions. Second operand has 6 states, 6 states have (on average 9.333333333333334) internal successors, (56), 4 states have internal predecessors, (56), 2 states have call successors, (5), 3 states have call predecessors, (5), 2 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) [2022-12-13 11:11:24,194 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-12-13 11:11:24,195 INFO L93 Difference]: Finished difference Result 5361 states and 8029 transitions. [2022-12-13 11:11:24,195 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2022-12-13 11:11:24,195 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 9.333333333333334) internal successors, (56), 4 states have internal predecessors, (56), 2 states have call successors, (5), 3 states have call predecessors, (5), 2 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) Word has length 66 [2022-12-13 11:11:24,195 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-12-13 11:11:24,207 INFO L225 Difference]: With dead ends: 5361 [2022-12-13 11:11:24,207 INFO L226 Difference]: Without dead ends: 3459 [2022-12-13 11:11:24,211 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 23 GetRequests, 13 SyntacticMatches, 0 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 15 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=39, Invalid=93, Unknown=0, NotChecked=0, Total=132 [2022-12-13 11:11:24,212 INFO L413 NwaCegarLoop]: 236 mSDtfsCounter, 568 mSDsluCounter, 435 mSDsCounter, 0 mSdLazyCounter, 778 mSolverCounterSat, 67 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 593 SdHoareTripleChecker+Valid, 671 SdHoareTripleChecker+Invalid, 845 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 67 IncrementalHoareTripleChecker+Valid, 778 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.5s IncrementalHoareTripleChecker+Time [2022-12-13 11:11:24,212 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [593 Valid, 671 Invalid, 845 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [67 Valid, 778 Invalid, 0 Unknown, 0 Unchecked, 0.5s Time] [2022-12-13 11:11:24,214 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3459 states. [2022-12-13 11:11:24,357 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3459 to 2868. [2022-12-13 11:11:24,362 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 2868 states, 2410 states have (on average 1.4751037344398341) internal successors, (3555), 2449 states have internal predecessors, (3555), 272 states have call successors, (272), 156 states have call predecessors, (272), 180 states have return successors, (397), 278 states have call predecessors, (397), 272 states have call successors, (397) [2022-12-13 11:11:24,371 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2868 states to 2868 states and 4224 transitions. [2022-12-13 11:11:24,371 INFO L78 Accepts]: Start accepts. Automaton has 2868 states and 4224 transitions. Word has length 66 [2022-12-13 11:11:24,372 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-12-13 11:11:24,372 INFO L495 AbstractCegarLoop]: Abstraction has 2868 states and 4224 transitions. [2022-12-13 11:11:24,372 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 9.333333333333334) internal successors, (56), 4 states have internal predecessors, (56), 2 states have call successors, (5), 3 states have call predecessors, (5), 2 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) [2022-12-13 11:11:24,372 INFO L276 IsEmpty]: Start isEmpty. Operand 2868 states and 4224 transitions. [2022-12-13 11:11:24,374 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 68 [2022-12-13 11:11:24,374 INFO L187 NwaCegarLoop]: Found error trace [2022-12-13 11:11:24,374 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-13 11:11:24,375 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2022-12-13 11:11:24,375 INFO L420 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 3 more)] === [2022-12-13 11:11:24,375 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 11:11:24,375 INFO L85 PathProgramCache]: Analyzing trace with hash 579540116, now seen corresponding path program 1 times [2022-12-13 11:11:24,375 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-13 11:11:24,375 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [508780916] [2022-12-13 11:11:24,376 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 11:11:24,376 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-13 11:11:24,383 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 11:11:24,412 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2022-12-13 11:11:24,413 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 11:11:24,420 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2022-12-13 11:11:24,421 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 11:11:24,426 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 20 [2022-12-13 11:11:24,430 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 11:11:24,468 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 41 [2022-12-13 11:11:24,470 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 11:11:24,472 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 53 [2022-12-13 11:11:24,472 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 11:11:24,474 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-13 11:11:24,474 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-13 11:11:24,474 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [508780916] [2022-12-13 11:11:24,474 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [508780916] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-13 11:11:24,474 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-13 11:11:24,474 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2022-12-13 11:11:24,474 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [472242634] [2022-12-13 11:11:24,474 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-13 11:11:24,475 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2022-12-13 11:11:24,475 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-13 11:11:24,475 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2022-12-13 11:11:24,475 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2022-12-13 11:11:24,476 INFO L87 Difference]: Start difference. First operand 2868 states and 4224 transitions. Second operand has 7 states, 7 states have (on average 8.142857142857142) internal successors, (57), 5 states have internal predecessors, (57), 2 states have call successors, (5), 3 states have call predecessors, (5), 2 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) [2022-12-13 11:11:25,175 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-12-13 11:11:25,175 INFO L93 Difference]: Finished difference Result 6517 states and 9702 transitions. [2022-12-13 11:11:25,176 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2022-12-13 11:11:25,176 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 8.142857142857142) internal successors, (57), 5 states have internal predecessors, (57), 2 states have call successors, (5), 3 states have call predecessors, (5), 2 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) Word has length 67 [2022-12-13 11:11:25,176 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-12-13 11:11:25,186 INFO L225 Difference]: With dead ends: 6517 [2022-12-13 11:11:25,186 INFO L226 Difference]: Without dead ends: 3660 [2022-12-13 11:11:25,199 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 24 GetRequests, 12 SyntacticMatches, 0 SemanticMatches, 12 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 14 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=60, Invalid=122, Unknown=0, NotChecked=0, Total=182 [2022-12-13 11:11:25,200 INFO L413 NwaCegarLoop]: 139 mSDtfsCounter, 267 mSDsluCounter, 512 mSDsCounter, 0 mSdLazyCounter, 618 mSolverCounterSat, 35 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 267 SdHoareTripleChecker+Valid, 651 SdHoareTripleChecker+Invalid, 653 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 35 IncrementalHoareTripleChecker+Valid, 618 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2022-12-13 11:11:25,200 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [267 Valid, 651 Invalid, 653 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [35 Valid, 618 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2022-12-13 11:11:25,203 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3660 states. [2022-12-13 11:11:25,340 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3660 to 2895. [2022-12-13 11:11:25,344 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 2895 states, 2437 states have (on average 1.4628641772671318) internal successors, (3565), 2476 states have internal predecessors, (3565), 272 states have call successors, (272), 156 states have call predecessors, (272), 180 states have return successors, (397), 278 states have call predecessors, (397), 272 states have call successors, (397) [2022-12-13 11:11:25,363 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2895 states to 2895 states and 4234 transitions. [2022-12-13 11:11:25,364 INFO L78 Accepts]: Start accepts. Automaton has 2895 states and 4234 transitions. Word has length 67 [2022-12-13 11:11:25,364 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-12-13 11:11:25,364 INFO L495 AbstractCegarLoop]: Abstraction has 2895 states and 4234 transitions. [2022-12-13 11:11:25,364 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 8.142857142857142) internal successors, (57), 5 states have internal predecessors, (57), 2 states have call successors, (5), 3 states have call predecessors, (5), 2 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) [2022-12-13 11:11:25,365 INFO L276 IsEmpty]: Start isEmpty. Operand 2895 states and 4234 transitions. [2022-12-13 11:11:25,366 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 68 [2022-12-13 11:11:25,367 INFO L187 NwaCegarLoop]: Found error trace [2022-12-13 11:11:25,367 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-13 11:11:25,367 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2022-12-13 11:11:25,367 INFO L420 AbstractCegarLoop]: === Iteration 9 === Targeting ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 3 more)] === [2022-12-13 11:11:25,367 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 11:11:25,368 INFO L85 PathProgramCache]: Analyzing trace with hash 1003186838, now seen corresponding path program 1 times [2022-12-13 11:11:25,368 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-13 11:11:25,368 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1486031921] [2022-12-13 11:11:25,368 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 11:11:25,368 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-13 11:11:25,376 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 11:11:25,404 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2022-12-13 11:11:25,405 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 11:11:25,413 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2022-12-13 11:11:25,414 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 11:11:25,420 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 20 [2022-12-13 11:11:25,424 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 11:11:25,460 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 41 [2022-12-13 11:11:25,461 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 11:11:25,463 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 53 [2022-12-13 11:11:25,464 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 11:11:25,465 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-13 11:11:25,465 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-13 11:11:25,466 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1486031921] [2022-12-13 11:11:25,466 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1486031921] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-13 11:11:25,466 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-13 11:11:25,466 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2022-12-13 11:11:25,466 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1216925450] [2022-12-13 11:11:25,466 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-13 11:11:25,466 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2022-12-13 11:11:25,466 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-13 11:11:25,467 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2022-12-13 11:11:25,467 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2022-12-13 11:11:25,467 INFO L87 Difference]: Start difference. First operand 2895 states and 4234 transitions. Second operand has 7 states, 7 states have (on average 8.142857142857142) internal successors, (57), 5 states have internal predecessors, (57), 2 states have call successors, (5), 3 states have call predecessors, (5), 2 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) [2022-12-13 11:11:26,156 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-12-13 11:11:26,156 INFO L93 Difference]: Finished difference Result 6807 states and 10065 transitions. [2022-12-13 11:11:26,157 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2022-12-13 11:11:26,157 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 8.142857142857142) internal successors, (57), 5 states have internal predecessors, (57), 2 states have call successors, (5), 3 states have call predecessors, (5), 2 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) Word has length 67 [2022-12-13 11:11:26,157 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-12-13 11:11:26,168 INFO L225 Difference]: With dead ends: 6807 [2022-12-13 11:11:26,169 INFO L226 Difference]: Without dead ends: 3923 [2022-12-13 11:11:26,174 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 26 GetRequests, 12 SyntacticMatches, 0 SemanticMatches, 14 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 31 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=77, Invalid=163, Unknown=0, NotChecked=0, Total=240 [2022-12-13 11:11:26,174 INFO L413 NwaCegarLoop]: 139 mSDtfsCounter, 267 mSDsluCounter, 512 mSDsCounter, 0 mSdLazyCounter, 576 mSolverCounterSat, 36 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 267 SdHoareTripleChecker+Valid, 651 SdHoareTripleChecker+Invalid, 612 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 36 IncrementalHoareTripleChecker+Valid, 576 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2022-12-13 11:11:26,175 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [267 Valid, 651 Invalid, 612 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [36 Valid, 576 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2022-12-13 11:11:26,178 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3923 states. [2022-12-13 11:11:26,359 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3923 to 2973. [2022-12-13 11:11:26,362 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 2973 states, 2515 states have (on average 1.4485089463220675) internal successors, (3643), 2554 states have internal predecessors, (3643), 272 states have call successors, (272), 156 states have call predecessors, (272), 180 states have return successors, (397), 278 states have call predecessors, (397), 272 states have call successors, (397) [2022-12-13 11:11:26,367 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2973 states to 2973 states and 4312 transitions. [2022-12-13 11:11:26,368 INFO L78 Accepts]: Start accepts. Automaton has 2973 states and 4312 transitions. Word has length 67 [2022-12-13 11:11:26,368 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-12-13 11:11:26,368 INFO L495 AbstractCegarLoop]: Abstraction has 2973 states and 4312 transitions. [2022-12-13 11:11:26,368 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 8.142857142857142) internal successors, (57), 5 states have internal predecessors, (57), 2 states have call successors, (5), 3 states have call predecessors, (5), 2 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) [2022-12-13 11:11:26,368 INFO L276 IsEmpty]: Start isEmpty. Operand 2973 states and 4312 transitions. [2022-12-13 11:11:26,369 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 68 [2022-12-13 11:11:26,369 INFO L187 NwaCegarLoop]: Found error trace [2022-12-13 11:11:26,370 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-13 11:11:26,370 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2022-12-13 11:11:26,370 INFO L420 AbstractCegarLoop]: === Iteration 10 === Targeting ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 3 more)] === [2022-12-13 11:11:26,370 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 11:11:26,370 INFO L85 PathProgramCache]: Analyzing trace with hash 159181336, now seen corresponding path program 1 times [2022-12-13 11:11:26,370 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-13 11:11:26,370 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1810214291] [2022-12-13 11:11:26,370 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 11:11:26,371 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-13 11:11:26,376 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 11:11:26,394 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2022-12-13 11:11:26,394 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 11:11:26,402 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2022-12-13 11:11:26,403 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 11:11:26,410 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 20 [2022-12-13 11:11:26,412 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 11:11:26,449 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 41 [2022-12-13 11:11:26,451 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 11:11:26,453 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 53 [2022-12-13 11:11:26,454 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 11:11:26,455 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-13 11:11:26,455 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-13 11:11:26,456 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1810214291] [2022-12-13 11:11:26,456 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1810214291] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-13 11:11:26,456 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-13 11:11:26,456 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2022-12-13 11:11:26,456 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [645775408] [2022-12-13 11:11:26,456 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-13 11:11:26,456 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2022-12-13 11:11:26,456 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-13 11:11:26,457 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2022-12-13 11:11:26,457 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=30, Unknown=0, NotChecked=0, Total=42 [2022-12-13 11:11:26,457 INFO L87 Difference]: Start difference. First operand 2973 states and 4312 transitions. Second operand has 7 states, 7 states have (on average 8.142857142857142) internal successors, (57), 5 states have internal predecessors, (57), 2 states have call successors, (5), 3 states have call predecessors, (5), 2 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) [2022-12-13 11:11:28,093 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-12-13 11:11:28,093 INFO L93 Difference]: Finished difference Result 10631 states and 15675 transitions. [2022-12-13 11:11:28,094 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 17 states. [2022-12-13 11:11:28,094 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 8.142857142857142) internal successors, (57), 5 states have internal predecessors, (57), 2 states have call successors, (5), 3 states have call predecessors, (5), 2 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) Word has length 67 [2022-12-13 11:11:28,094 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-12-13 11:11:28,113 INFO L225 Difference]: With dead ends: 10631 [2022-12-13 11:11:28,113 INFO L226 Difference]: Without dead ends: 7669 [2022-12-13 11:11:28,119 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 32 GetRequests, 16 SyntacticMatches, 0 SemanticMatches, 16 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 52 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=87, Invalid=219, Unknown=0, NotChecked=0, Total=306 [2022-12-13 11:11:28,119 INFO L413 NwaCegarLoop]: 266 mSDtfsCounter, 1064 mSDsluCounter, 510 mSDsCounter, 0 mSdLazyCounter, 1011 mSolverCounterSat, 211 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.8s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1089 SdHoareTripleChecker+Valid, 776 SdHoareTripleChecker+Invalid, 1222 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 211 IncrementalHoareTripleChecker+Valid, 1011 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.9s IncrementalHoareTripleChecker+Time [2022-12-13 11:11:28,119 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [1089 Valid, 776 Invalid, 1222 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [211 Valid, 1011 Invalid, 0 Unknown, 0 Unchecked, 0.9s Time] [2022-12-13 11:11:28,124 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 7669 states. [2022-12-13 11:11:28,552 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 7669 to 6563. [2022-12-13 11:11:28,560 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 6563 states, 5533 states have (on average 1.4333996023856859) internal successors, (7931), 5631 states have internal predecessors, (7931), 606 states have call successors, (606), 362 states have call predecessors, (606), 418 states have return successors, (986), 585 states have call predecessors, (986), 606 states have call successors, (986) [2022-12-13 11:11:28,577 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6563 states to 6563 states and 9523 transitions. [2022-12-13 11:11:28,577 INFO L78 Accepts]: Start accepts. Automaton has 6563 states and 9523 transitions. Word has length 67 [2022-12-13 11:11:28,577 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-12-13 11:11:28,578 INFO L495 AbstractCegarLoop]: Abstraction has 6563 states and 9523 transitions. [2022-12-13 11:11:28,578 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 8.142857142857142) internal successors, (57), 5 states have internal predecessors, (57), 2 states have call successors, (5), 3 states have call predecessors, (5), 2 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) [2022-12-13 11:11:28,578 INFO L276 IsEmpty]: Start isEmpty. Operand 6563 states and 9523 transitions. [2022-12-13 11:11:28,580 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 68 [2022-12-13 11:11:28,580 INFO L187 NwaCegarLoop]: Found error trace [2022-12-13 11:11:28,580 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-13 11:11:28,580 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9 [2022-12-13 11:11:28,580 INFO L420 AbstractCegarLoop]: === Iteration 11 === Targeting ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 3 more)] === [2022-12-13 11:11:28,581 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 11:11:28,581 INFO L85 PathProgramCache]: Analyzing trace with hash -1417376423, now seen corresponding path program 1 times [2022-12-13 11:11:28,581 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-13 11:11:28,581 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1560003203] [2022-12-13 11:11:28,581 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 11:11:28,581 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-13 11:11:28,588 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 11:11:28,617 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2022-12-13 11:11:28,618 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 11:11:28,625 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2022-12-13 11:11:28,626 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 11:11:28,632 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 20 [2022-12-13 11:11:28,634 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 11:11:28,668 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 41 [2022-12-13 11:11:28,670 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 11:11:28,671 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 53 [2022-12-13 11:11:28,672 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 11:11:28,672 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-13 11:11:28,673 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-13 11:11:28,673 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1560003203] [2022-12-13 11:11:28,673 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1560003203] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-13 11:11:28,673 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-13 11:11:28,673 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2022-12-13 11:11:28,673 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2054748224] [2022-12-13 11:11:28,673 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-13 11:11:28,674 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2022-12-13 11:11:28,674 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-13 11:11:28,674 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2022-12-13 11:11:28,674 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2022-12-13 11:11:28,674 INFO L87 Difference]: Start difference. First operand 6563 states and 9523 transitions. Second operand has 7 states, 7 states have (on average 8.142857142857142) internal successors, (57), 5 states have internal predecessors, (57), 2 states have call successors, (5), 3 states have call predecessors, (5), 2 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) [2022-12-13 11:11:29,684 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-12-13 11:11:29,684 INFO L93 Difference]: Finished difference Result 14527 states and 21622 transitions. [2022-12-13 11:11:29,685 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2022-12-13 11:11:29,685 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 8.142857142857142) internal successors, (57), 5 states have internal predecessors, (57), 2 states have call successors, (5), 3 states have call predecessors, (5), 2 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) Word has length 67 [2022-12-13 11:11:29,685 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-12-13 11:11:29,704 INFO L225 Difference]: With dead ends: 14527 [2022-12-13 11:11:29,704 INFO L226 Difference]: Without dead ends: 7975 [2022-12-13 11:11:29,713 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 26 GetRequests, 12 SyntacticMatches, 0 SemanticMatches, 14 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 26 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=77, Invalid=163, Unknown=0, NotChecked=0, Total=240 [2022-12-13 11:11:29,714 INFO L413 NwaCegarLoop]: 134 mSDtfsCounter, 184 mSDsluCounter, 512 mSDsCounter, 0 mSdLazyCounter, 511 mSolverCounterSat, 37 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 184 SdHoareTripleChecker+Valid, 646 SdHoareTripleChecker+Invalid, 548 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 37 IncrementalHoareTripleChecker+Valid, 511 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2022-12-13 11:11:29,714 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [184 Valid, 646 Invalid, 548 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [37 Valid, 511 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2022-12-13 11:11:29,719 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 7975 states. [2022-12-13 11:11:30,241 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 7975 to 6668. [2022-12-13 11:11:30,246 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 6668 states, 5638 states have (on average 1.4207165661582122) internal successors, (8010), 5736 states have internal predecessors, (8010), 606 states have call successors, (606), 362 states have call predecessors, (606), 418 states have return successors, (986), 585 states have call predecessors, (986), 606 states have call successors, (986) [2022-12-13 11:11:30,256 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6668 states to 6668 states and 9602 transitions. [2022-12-13 11:11:30,257 INFO L78 Accepts]: Start accepts. Automaton has 6668 states and 9602 transitions. Word has length 67 [2022-12-13 11:11:30,257 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-12-13 11:11:30,257 INFO L495 AbstractCegarLoop]: Abstraction has 6668 states and 9602 transitions. [2022-12-13 11:11:30,257 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 8.142857142857142) internal successors, (57), 5 states have internal predecessors, (57), 2 states have call successors, (5), 3 states have call predecessors, (5), 2 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) [2022-12-13 11:11:30,257 INFO L276 IsEmpty]: Start isEmpty. Operand 6668 states and 9602 transitions. [2022-12-13 11:11:30,258 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 68 [2022-12-13 11:11:30,258 INFO L187 NwaCegarLoop]: Found error trace [2022-12-13 11:11:30,258 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-13 11:11:30,258 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10 [2022-12-13 11:11:30,258 INFO L420 AbstractCegarLoop]: === Iteration 12 === Targeting ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 3 more)] === [2022-12-13 11:11:30,259 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 11:11:30,259 INFO L85 PathProgramCache]: Analyzing trace with hash -31173029, now seen corresponding path program 1 times [2022-12-13 11:11:30,259 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-13 11:11:30,259 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1349621649] [2022-12-13 11:11:30,259 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 11:11:30,259 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-13 11:11:30,264 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 11:11:30,299 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2022-12-13 11:11:30,299 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 11:11:30,308 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2022-12-13 11:11:30,310 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 11:11:30,328 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 20 [2022-12-13 11:11:30,330 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 11:11:30,334 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 41 [2022-12-13 11:11:30,336 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 11:11:30,353 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 53 [2022-12-13 11:11:30,354 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 11:11:30,356 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-13 11:11:30,356 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-13 11:11:30,356 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1349621649] [2022-12-13 11:11:30,356 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1349621649] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-13 11:11:30,356 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-13 11:11:30,356 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2022-12-13 11:11:30,356 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [445766276] [2022-12-13 11:11:30,356 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-13 11:11:30,357 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2022-12-13 11:11:30,357 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-13 11:11:30,357 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2022-12-13 11:11:30,357 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=14, Invalid=42, Unknown=0, NotChecked=0, Total=56 [2022-12-13 11:11:30,357 INFO L87 Difference]: Start difference. First operand 6668 states and 9602 transitions. Second operand has 8 states, 8 states have (on average 7.125) internal successors, (57), 6 states have internal predecessors, (57), 2 states have call successors, (5), 3 states have call predecessors, (5), 3 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) [2022-12-13 11:11:31,288 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-12-13 11:11:31,288 INFO L93 Difference]: Finished difference Result 8755 states and 12684 transitions. [2022-12-13 11:11:31,288 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 16 states. [2022-12-13 11:11:31,288 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 8 states have (on average 7.125) internal successors, (57), 6 states have internal predecessors, (57), 2 states have call successors, (5), 3 states have call predecessors, (5), 3 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) Word has length 67 [2022-12-13 11:11:31,288 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-12-13 11:11:31,301 INFO L225 Difference]: With dead ends: 8755 [2022-12-13 11:11:31,301 INFO L226 Difference]: Without dead ends: 5048 [2022-12-13 11:11:31,307 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 28 GetRequests, 11 SyntacticMatches, 0 SemanticMatches, 17 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 55 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=96, Invalid=246, Unknown=0, NotChecked=0, Total=342 [2022-12-13 11:11:31,307 INFO L413 NwaCegarLoop]: 139 mSDtfsCounter, 698 mSDsluCounter, 498 mSDsCounter, 0 mSdLazyCounter, 676 mSolverCounterSat, 96 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 709 SdHoareTripleChecker+Valid, 637 SdHoareTripleChecker+Invalid, 772 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 96 IncrementalHoareTripleChecker+Valid, 676 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2022-12-13 11:11:31,307 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [709 Valid, 637 Invalid, 772 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [96 Valid, 676 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2022-12-13 11:11:31,311 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 5048 states. [2022-12-13 11:11:31,606 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 5048 to 4128. [2022-12-13 11:11:31,610 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 4128 states, 3481 states have (on average 1.4036196495259983) internal successors, (4886), 3539 states have internal predecessors, (4886), 387 states have call successors, (387), 226 states have call predecessors, (387), 254 states have return successors, (556), 370 states have call predecessors, (556), 387 states have call successors, (556) [2022-12-13 11:11:31,616 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4128 states to 4128 states and 5829 transitions. [2022-12-13 11:11:31,617 INFO L78 Accepts]: Start accepts. Automaton has 4128 states and 5829 transitions. Word has length 67 [2022-12-13 11:11:31,617 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-12-13 11:11:31,617 INFO L495 AbstractCegarLoop]: Abstraction has 4128 states and 5829 transitions. [2022-12-13 11:11:31,617 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 7.125) internal successors, (57), 6 states have internal predecessors, (57), 2 states have call successors, (5), 3 states have call predecessors, (5), 3 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) [2022-12-13 11:11:31,617 INFO L276 IsEmpty]: Start isEmpty. Operand 4128 states and 5829 transitions. [2022-12-13 11:11:31,618 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 68 [2022-12-13 11:11:31,618 INFO L187 NwaCegarLoop]: Found error trace [2022-12-13 11:11:31,618 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-13 11:11:31,618 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable11 [2022-12-13 11:11:31,618 INFO L420 AbstractCegarLoop]: === Iteration 13 === Targeting ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 3 more)] === [2022-12-13 11:11:31,618 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 11:11:31,618 INFO L85 PathProgramCache]: Analyzing trace with hash -165186535, now seen corresponding path program 1 times [2022-12-13 11:11:31,619 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-13 11:11:31,619 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1044943651] [2022-12-13 11:11:31,619 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 11:11:31,619 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-13 11:11:31,623 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 11:11:31,657 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2022-12-13 11:11:31,658 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 11:11:31,666 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2022-12-13 11:11:31,667 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 11:11:31,683 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 20 [2022-12-13 11:11:31,685 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 11:11:31,688 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 41 [2022-12-13 11:11:31,690 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 11:11:31,707 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 53 [2022-12-13 11:11:31,708 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 11:11:31,709 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-13 11:11:31,709 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-13 11:11:31,709 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1044943651] [2022-12-13 11:11:31,709 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1044943651] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-13 11:11:31,709 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-13 11:11:31,709 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2022-12-13 11:11:31,710 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1369622878] [2022-12-13 11:11:31,710 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-13 11:11:31,710 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2022-12-13 11:11:31,710 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-13 11:11:31,710 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2022-12-13 11:11:31,710 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=14, Invalid=42, Unknown=0, NotChecked=0, Total=56 [2022-12-13 11:11:31,710 INFO L87 Difference]: Start difference. First operand 4128 states and 5829 transitions. Second operand has 8 states, 8 states have (on average 7.125) internal successors, (57), 6 states have internal predecessors, (57), 2 states have call successors, (5), 3 states have call predecessors, (5), 3 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) [2022-12-13 11:11:33,000 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-12-13 11:11:33,000 INFO L93 Difference]: Finished difference Result 12796 states and 18214 transitions. [2022-12-13 11:11:33,000 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 17 states. [2022-12-13 11:11:33,001 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 8 states have (on average 7.125) internal successors, (57), 6 states have internal predecessors, (57), 2 states have call successors, (5), 3 states have call predecessors, (5), 3 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) Word has length 67 [2022-12-13 11:11:33,001 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-12-13 11:11:33,018 INFO L225 Difference]: With dead ends: 12796 [2022-12-13 11:11:33,018 INFO L226 Difference]: Without dead ends: 8680 [2022-12-13 11:11:33,024 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 31 GetRequests, 13 SyntacticMatches, 0 SemanticMatches, 18 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 69 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=104, Invalid=276, Unknown=0, NotChecked=0, Total=380 [2022-12-13 11:11:33,025 INFO L413 NwaCegarLoop]: 142 mSDtfsCounter, 595 mSDsluCounter, 581 mSDsCounter, 0 mSdLazyCounter, 862 mSolverCounterSat, 71 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 605 SdHoareTripleChecker+Valid, 723 SdHoareTripleChecker+Invalid, 933 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 71 IncrementalHoareTripleChecker+Valid, 862 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.5s IncrementalHoareTripleChecker+Time [2022-12-13 11:11:33,025 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [605 Valid, 723 Invalid, 933 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [71 Valid, 862 Invalid, 0 Unknown, 0 Unchecked, 0.5s Time] [2022-12-13 11:11:33,031 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 8680 states. [2022-12-13 11:11:33,587 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 8680 to 7088. [2022-12-13 11:11:33,594 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 7088 states, 5970 states have (on average 1.3871021775544388) internal successors, (8281), 6095 states have internal predecessors, (8281), 643 states have call successors, (643), 390 states have call predecessors, (643), 469 states have return successors, (994), 618 states have call predecessors, (994), 643 states have call successors, (994) [2022-12-13 11:11:33,607 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7088 states to 7088 states and 9918 transitions. [2022-12-13 11:11:33,607 INFO L78 Accepts]: Start accepts. Automaton has 7088 states and 9918 transitions. Word has length 67 [2022-12-13 11:11:33,608 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-12-13 11:11:33,608 INFO L495 AbstractCegarLoop]: Abstraction has 7088 states and 9918 transitions. [2022-12-13 11:11:33,609 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 7.125) internal successors, (57), 6 states have internal predecessors, (57), 2 states have call successors, (5), 3 states have call predecessors, (5), 3 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) [2022-12-13 11:11:33,609 INFO L276 IsEmpty]: Start isEmpty. Operand 7088 states and 9918 transitions. [2022-12-13 11:11:33,610 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 68 [2022-12-13 11:11:33,610 INFO L187 NwaCegarLoop]: Found error trace [2022-12-13 11:11:33,610 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-13 11:11:33,610 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable12 [2022-12-13 11:11:33,610 INFO L420 AbstractCegarLoop]: === Iteration 14 === Targeting ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 3 more)] === [2022-12-13 11:11:33,610 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 11:11:33,610 INFO L85 PathProgramCache]: Analyzing trace with hash 53668183, now seen corresponding path program 1 times [2022-12-13 11:11:33,611 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-13 11:11:33,611 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1096881121] [2022-12-13 11:11:33,611 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 11:11:33,611 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-13 11:11:33,616 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 11:11:33,646 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2022-12-13 11:11:33,647 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 11:11:33,654 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2022-12-13 11:11:33,656 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 11:11:33,670 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 20 [2022-12-13 11:11:33,672 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 11:11:33,675 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 41 [2022-12-13 11:11:33,676 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 11:11:33,693 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 53 [2022-12-13 11:11:33,693 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 11:11:33,694 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-13 11:11:33,694 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-13 11:11:33,694 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1096881121] [2022-12-13 11:11:33,694 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1096881121] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-13 11:11:33,694 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-13 11:11:33,695 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2022-12-13 11:11:33,695 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1800134290] [2022-12-13 11:11:33,695 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-13 11:11:33,695 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2022-12-13 11:11:33,695 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-13 11:11:33,695 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2022-12-13 11:11:33,695 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=14, Invalid=42, Unknown=0, NotChecked=0, Total=56 [2022-12-13 11:11:33,695 INFO L87 Difference]: Start difference. First operand 7088 states and 9918 transitions. Second operand has 8 states, 8 states have (on average 7.125) internal successors, (57), 6 states have internal predecessors, (57), 2 states have call successors, (5), 3 states have call predecessors, (5), 3 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) [2022-12-13 11:11:35,057 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-12-13 11:11:35,058 INFO L93 Difference]: Finished difference Result 13144 states and 18312 transitions. [2022-12-13 11:11:35,058 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 17 states. [2022-12-13 11:11:35,058 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 8 states have (on average 7.125) internal successors, (57), 6 states have internal predecessors, (57), 2 states have call successors, (5), 3 states have call predecessors, (5), 3 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) Word has length 67 [2022-12-13 11:11:35,058 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-12-13 11:11:35,073 INFO L225 Difference]: With dead ends: 13144 [2022-12-13 11:11:35,073 INFO L226 Difference]: Without dead ends: 7604 [2022-12-13 11:11:35,082 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 31 GetRequests, 13 SyntacticMatches, 0 SemanticMatches, 18 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 66 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=104, Invalid=276, Unknown=0, NotChecked=0, Total=380 [2022-12-13 11:11:35,082 INFO L413 NwaCegarLoop]: 141 mSDtfsCounter, 526 mSDsluCounter, 579 mSDsCounter, 0 mSdLazyCounter, 823 mSolverCounterSat, 66 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 535 SdHoareTripleChecker+Valid, 720 SdHoareTripleChecker+Invalid, 889 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 66 IncrementalHoareTripleChecker+Valid, 823 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.5s IncrementalHoareTripleChecker+Time [2022-12-13 11:11:35,082 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [535 Valid, 720 Invalid, 889 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [66 Valid, 823 Invalid, 0 Unknown, 0 Unchecked, 0.5s Time] [2022-12-13 11:11:35,087 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 7604 states. [2022-12-13 11:11:35,546 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 7604 to 5932. [2022-12-13 11:11:35,550 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 5932 states, 5026 states have (on average 1.3631118185435733) internal successors, (6851), 5127 states have internal predecessors, (6851), 519 states have call successors, (519), 326 states have call predecessors, (519), 381 states have return successors, (774), 486 states have call predecessors, (774), 519 states have call successors, (774) [2022-12-13 11:11:35,560 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5932 states to 5932 states and 8144 transitions. [2022-12-13 11:11:35,560 INFO L78 Accepts]: Start accepts. Automaton has 5932 states and 8144 transitions. Word has length 67 [2022-12-13 11:11:35,560 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-12-13 11:11:35,561 INFO L495 AbstractCegarLoop]: Abstraction has 5932 states and 8144 transitions. [2022-12-13 11:11:35,561 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 7.125) internal successors, (57), 6 states have internal predecessors, (57), 2 states have call successors, (5), 3 states have call predecessors, (5), 3 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) [2022-12-13 11:11:35,561 INFO L276 IsEmpty]: Start isEmpty. Operand 5932 states and 8144 transitions. [2022-12-13 11:11:35,561 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 68 [2022-12-13 11:11:35,562 INFO L187 NwaCegarLoop]: Found error trace [2022-12-13 11:11:35,562 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-13 11:11:35,562 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable13 [2022-12-13 11:11:35,562 INFO L420 AbstractCegarLoop]: === Iteration 15 === Targeting ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 3 more)] === [2022-12-13 11:11:35,562 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 11:11:35,562 INFO L85 PathProgramCache]: Analyzing trace with hash 476370009, now seen corresponding path program 1 times [2022-12-13 11:11:35,562 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-13 11:11:35,562 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1368084219] [2022-12-13 11:11:35,562 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 11:11:35,562 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-13 11:11:35,567 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 11:11:35,594 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2022-12-13 11:11:35,594 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 11:11:35,602 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2022-12-13 11:11:35,603 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 11:11:35,617 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 20 [2022-12-13 11:11:35,619 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 11:11:35,621 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 41 [2022-12-13 11:11:35,622 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 11:11:35,637 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 53 [2022-12-13 11:11:35,638 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 11:11:35,639 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-13 11:11:35,639 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-13 11:11:35,639 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1368084219] [2022-12-13 11:11:35,639 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1368084219] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-13 11:11:35,639 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-13 11:11:35,639 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2022-12-13 11:11:35,639 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1569496976] [2022-12-13 11:11:35,639 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-13 11:11:35,640 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2022-12-13 11:11:35,640 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-13 11:11:35,640 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2022-12-13 11:11:35,640 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=14, Invalid=42, Unknown=0, NotChecked=0, Total=56 [2022-12-13 11:11:35,640 INFO L87 Difference]: Start difference. First operand 5932 states and 8144 transitions. Second operand has 8 states, 8 states have (on average 7.125) internal successors, (57), 6 states have internal predecessors, (57), 2 states have call successors, (5), 3 states have call predecessors, (5), 3 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) [2022-12-13 11:11:37,016 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-12-13 11:11:37,016 INFO L93 Difference]: Finished difference Result 11136 states and 15377 transitions. [2022-12-13 11:11:37,016 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 17 states. [2022-12-13 11:11:37,016 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 8 states have (on average 7.125) internal successors, (57), 6 states have internal predecessors, (57), 2 states have call successors, (5), 3 states have call predecessors, (5), 3 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) Word has length 67 [2022-12-13 11:11:37,016 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-12-13 11:11:37,028 INFO L225 Difference]: With dead ends: 11136 [2022-12-13 11:11:37,028 INFO L226 Difference]: Without dead ends: 7546 [2022-12-13 11:11:37,033 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 31 GetRequests, 13 SyntacticMatches, 0 SemanticMatches, 18 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 65 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=104, Invalid=276, Unknown=0, NotChecked=0, Total=380 [2022-12-13 11:11:37,033 INFO L413 NwaCegarLoop]: 137 mSDtfsCounter, 701 mSDsluCounter, 492 mSDsCounter, 0 mSdLazyCounter, 668 mSolverCounterSat, 98 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 710 SdHoareTripleChecker+Valid, 629 SdHoareTripleChecker+Invalid, 766 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 98 IncrementalHoareTripleChecker+Valid, 668 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2022-12-13 11:11:37,033 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [710 Valid, 629 Invalid, 766 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [98 Valid, 668 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time] [2022-12-13 11:11:37,038 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 7546 states. [2022-12-13 11:11:37,478 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 7546 to 5899. [2022-12-13 11:11:37,483 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 5899 states, 5003 states have (on average 1.3565860483709775) internal successors, (6787), 5094 states have internal predecessors, (6787), 519 states have call successors, (519), 326 states have call predecessors, (519), 371 states have return successors, (730), 482 states have call predecessors, (730), 519 states have call successors, (730) [2022-12-13 11:11:37,492 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5899 states to 5899 states and 8036 transitions. [2022-12-13 11:11:37,493 INFO L78 Accepts]: Start accepts. Automaton has 5899 states and 8036 transitions. Word has length 67 [2022-12-13 11:11:37,493 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-12-13 11:11:37,493 INFO L495 AbstractCegarLoop]: Abstraction has 5899 states and 8036 transitions. [2022-12-13 11:11:37,493 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 7.125) internal successors, (57), 6 states have internal predecessors, (57), 2 states have call successors, (5), 3 states have call predecessors, (5), 3 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) [2022-12-13 11:11:37,493 INFO L276 IsEmpty]: Start isEmpty. Operand 5899 states and 8036 transitions. [2022-12-13 11:11:37,493 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 68 [2022-12-13 11:11:37,493 INFO L187 NwaCegarLoop]: Found error trace [2022-12-13 11:11:37,494 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-13 11:11:37,494 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable14 [2022-12-13 11:11:37,494 INFO L420 AbstractCegarLoop]: === Iteration 16 === Targeting ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 3 more)] === [2022-12-13 11:11:37,494 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 11:11:37,494 INFO L85 PathProgramCache]: Analyzing trace with hash -341278441, now seen corresponding path program 1 times [2022-12-13 11:11:37,494 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-13 11:11:37,494 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1786886684] [2022-12-13 11:11:37,494 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 11:11:37,494 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-13 11:11:37,499 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 11:11:37,515 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2022-12-13 11:11:37,515 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 11:11:37,524 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2022-12-13 11:11:37,525 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 11:11:37,533 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 20 [2022-12-13 11:11:37,535 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 11:11:37,548 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 41 [2022-12-13 11:11:37,549 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 11:11:37,551 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 53 [2022-12-13 11:11:37,552 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 11:11:37,555 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-13 11:11:37,555 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-13 11:11:37,555 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1786886684] [2022-12-13 11:11:37,555 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1786886684] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-13 11:11:37,555 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-13 11:11:37,555 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2022-12-13 11:11:37,555 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [954113645] [2022-12-13 11:11:37,555 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-13 11:11:37,556 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2022-12-13 11:11:37,556 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-13 11:11:37,556 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2022-12-13 11:11:37,556 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2022-12-13 11:11:37,556 INFO L87 Difference]: Start difference. First operand 5899 states and 8036 transitions. Second operand has 6 states, 6 states have (on average 9.5) internal successors, (57), 4 states have internal predecessors, (57), 2 states have call successors, (5), 3 states have call predecessors, (5), 3 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) [2022-12-13 11:11:38,927 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-12-13 11:11:38,927 INFO L93 Difference]: Finished difference Result 16795 states and 23244 transitions. [2022-12-13 11:11:38,927 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2022-12-13 11:11:38,928 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 9.5) internal successors, (57), 4 states have internal predecessors, (57), 2 states have call successors, (5), 3 states have call predecessors, (5), 3 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) Word has length 67 [2022-12-13 11:11:38,928 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-12-13 11:11:38,947 INFO L225 Difference]: With dead ends: 16795 [2022-12-13 11:11:38,947 INFO L226 Difference]: Without dead ends: 10910 [2022-12-13 11:11:38,956 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 24 GetRequests, 14 SyntacticMatches, 0 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 15 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=47, Invalid=85, Unknown=0, NotChecked=0, Total=132 [2022-12-13 11:11:38,957 INFO L413 NwaCegarLoop]: 139 mSDtfsCounter, 614 mSDsluCounter, 272 mSDsCounter, 0 mSdLazyCounter, 374 mSolverCounterSat, 109 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 621 SdHoareTripleChecker+Valid, 411 SdHoareTripleChecker+Invalid, 483 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 109 IncrementalHoareTripleChecker+Valid, 374 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2022-12-13 11:11:38,957 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [621 Valid, 411 Invalid, 483 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [109 Valid, 374 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2022-12-13 11:11:38,963 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 10910 states. [2022-12-13 11:11:39,804 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 10910 to 9192. [2022-12-13 11:11:39,810 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 9192 states, 7800 states have (on average 1.3425641025641026) internal successors, (10472), 7928 states have internal predecessors, (10472), 788 states have call successors, (788), 506 states have call predecessors, (788), 598 states have return successors, (1266), 761 states have call predecessors, (1266), 788 states have call successors, (1266) [2022-12-13 11:11:39,826 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9192 states to 9192 states and 12526 transitions. [2022-12-13 11:11:39,827 INFO L78 Accepts]: Start accepts. Automaton has 9192 states and 12526 transitions. Word has length 67 [2022-12-13 11:11:39,827 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-12-13 11:11:39,827 INFO L495 AbstractCegarLoop]: Abstraction has 9192 states and 12526 transitions. [2022-12-13 11:11:39,827 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 9.5) internal successors, (57), 4 states have internal predecessors, (57), 2 states have call successors, (5), 3 states have call predecessors, (5), 3 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) [2022-12-13 11:11:39,827 INFO L276 IsEmpty]: Start isEmpty. Operand 9192 states and 12526 transitions. [2022-12-13 11:11:39,828 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 69 [2022-12-13 11:11:39,828 INFO L187 NwaCegarLoop]: Found error trace [2022-12-13 11:11:39,828 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-13 11:11:39,828 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable15 [2022-12-13 11:11:39,828 INFO L420 AbstractCegarLoop]: === Iteration 17 === Targeting ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 3 more)] === [2022-12-13 11:11:39,828 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 11:11:39,828 INFO L85 PathProgramCache]: Analyzing trace with hash 1596133247, now seen corresponding path program 1 times [2022-12-13 11:11:39,828 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-13 11:11:39,828 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [382730575] [2022-12-13 11:11:39,828 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 11:11:39,829 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-13 11:11:39,833 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 11:11:39,843 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2022-12-13 11:11:39,844 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 11:11:39,851 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2022-12-13 11:11:39,852 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 11:11:39,858 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 20 [2022-12-13 11:11:39,860 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 11:11:39,864 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 41 [2022-12-13 11:11:39,865 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 11:11:39,867 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 53 [2022-12-13 11:11:39,868 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 11:11:39,869 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-13 11:11:39,870 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-13 11:11:39,870 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [382730575] [2022-12-13 11:11:39,870 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [382730575] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-13 11:11:39,870 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-13 11:11:39,870 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2022-12-13 11:11:39,870 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1216672734] [2022-12-13 11:11:39,870 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-13 11:11:39,871 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-12-13 11:11:39,871 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-13 11:11:39,871 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-12-13 11:11:39,871 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2022-12-13 11:11:39,871 INFO L87 Difference]: Start difference. First operand 9192 states and 12526 transitions. Second operand has 5 states, 5 states have (on average 11.6) internal successors, (58), 3 states have internal predecessors, (58), 1 states have call successors, (5), 3 states have call predecessors, (5), 1 states have return successors, (5), 1 states have call predecessors, (5), 1 states have call successors, (5) [2022-12-13 11:11:41,745 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-12-13 11:11:41,745 INFO L93 Difference]: Finished difference Result 25942 states and 35629 transitions. [2022-12-13 11:11:41,745 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2022-12-13 11:11:41,746 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 11.6) internal successors, (58), 3 states have internal predecessors, (58), 1 states have call successors, (5), 3 states have call predecessors, (5), 1 states have return successors, (5), 1 states have call predecessors, (5), 1 states have call successors, (5) Word has length 68 [2022-12-13 11:11:41,746 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-12-13 11:11:41,775 INFO L225 Difference]: With dead ends: 25942 [2022-12-13 11:11:41,775 INFO L226 Difference]: Without dead ends: 16674 [2022-12-13 11:11:41,787 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 20 GetRequests, 13 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=27, Invalid=45, Unknown=0, NotChecked=0, Total=72 [2022-12-13 11:11:41,788 INFO L413 NwaCegarLoop]: 145 mSDtfsCounter, 494 mSDsluCounter, 259 mSDsCounter, 0 mSdLazyCounter, 326 mSolverCounterSat, 63 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 506 SdHoareTripleChecker+Valid, 404 SdHoareTripleChecker+Invalid, 389 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 63 IncrementalHoareTripleChecker+Valid, 326 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2022-12-13 11:11:41,788 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [506 Valid, 404 Invalid, 389 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [63 Valid, 326 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2022-12-13 11:11:41,797 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 16674 states. [2022-12-13 11:11:43,060 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 16674 to 14116. [2022-12-13 11:11:43,069 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 14116 states, 11940 states have (on average 1.3276381909547739) internal successors, (15852), 12138 states have internal predecessors, (15852), 1224 states have call successors, (1224), 800 states have call predecessors, (1224), 946 states have return successors, (1951), 1181 states have call predecessors, (1951), 1224 states have call successors, (1951) [2022-12-13 11:11:43,097 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 14116 states to 14116 states and 19027 transitions. [2022-12-13 11:11:43,099 INFO L78 Accepts]: Start accepts. Automaton has 14116 states and 19027 transitions. Word has length 68 [2022-12-13 11:11:43,099 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-12-13 11:11:43,099 INFO L495 AbstractCegarLoop]: Abstraction has 14116 states and 19027 transitions. [2022-12-13 11:11:43,099 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 11.6) internal successors, (58), 3 states have internal predecessors, (58), 1 states have call successors, (5), 3 states have call predecessors, (5), 1 states have return successors, (5), 1 states have call predecessors, (5), 1 states have call successors, (5) [2022-12-13 11:11:43,099 INFO L276 IsEmpty]: Start isEmpty. Operand 14116 states and 19027 transitions. [2022-12-13 11:11:43,100 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 87 [2022-12-13 11:11:43,100 INFO L187 NwaCegarLoop]: Found error trace [2022-12-13 11:11:43,100 INFO L195 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-13 11:11:43,100 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable16 [2022-12-13 11:11:43,100 INFO L420 AbstractCegarLoop]: === Iteration 18 === Targeting ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 3 more)] === [2022-12-13 11:11:43,101 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 11:11:43,101 INFO L85 PathProgramCache]: Analyzing trace with hash 660145097, now seen corresponding path program 1 times [2022-12-13 11:11:43,101 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-13 11:11:43,101 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1340214960] [2022-12-13 11:11:43,101 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 11:11:43,101 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-13 11:11:43,106 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 11:11:43,124 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2022-12-13 11:11:43,125 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 11:11:43,133 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2022-12-13 11:11:43,135 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 11:11:43,142 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 20 [2022-12-13 11:11:43,144 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 11:11:43,156 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 41 [2022-12-13 11:11:43,157 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 11:11:43,159 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 53 [2022-12-13 11:11:43,160 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 11:11:43,161 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 71 [2022-12-13 11:11:43,162 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 11:11:43,164 INFO L134 CoverageAnalysis]: Checked inductivity of 14 backedges. 9 proven. 0 refuted. 0 times theorem prover too weak. 5 trivial. 0 not checked. [2022-12-13 11:11:43,164 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-13 11:11:43,164 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1340214960] [2022-12-13 11:11:43,164 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1340214960] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-13 11:11:43,164 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-13 11:11:43,164 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2022-12-13 11:11:43,164 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1314610295] [2022-12-13 11:11:43,164 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-13 11:11:43,165 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2022-12-13 11:11:43,165 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-13 11:11:43,165 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2022-12-13 11:11:43,165 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2022-12-13 11:11:43,165 INFO L87 Difference]: Start difference. First operand 14116 states and 19027 transitions. Second operand has 6 states, 6 states have (on average 11.666666666666666) internal successors, (70), 4 states have internal predecessors, (70), 3 states have call successors, (6), 3 states have call predecessors, (6), 2 states have return successors, (6), 3 states have call predecessors, (6), 3 states have call successors, (6) [2022-12-13 11:11:46,564 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-12-13 11:11:46,564 INFO L93 Difference]: Finished difference Result 46612 states and 63333 transitions. [2022-12-13 11:11:46,565 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2022-12-13 11:11:46,565 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 11.666666666666666) internal successors, (70), 4 states have internal predecessors, (70), 3 states have call successors, (6), 3 states have call predecessors, (6), 2 states have return successors, (6), 3 states have call predecessors, (6), 3 states have call successors, (6) Word has length 86 [2022-12-13 11:11:46,565 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-12-13 11:11:46,627 INFO L225 Difference]: With dead ends: 46612 [2022-12-13 11:11:46,627 INFO L226 Difference]: Without dead ends: 32510 [2022-12-13 11:11:46,650 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 25 GetRequests, 15 SyntacticMatches, 0 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 14 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=47, Invalid=85, Unknown=0, NotChecked=0, Total=132 [2022-12-13 11:11:46,650 INFO L413 NwaCegarLoop]: 167 mSDtfsCounter, 589 mSDsluCounter, 328 mSDsCounter, 0 mSdLazyCounter, 386 mSolverCounterSat, 123 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 596 SdHoareTripleChecker+Valid, 495 SdHoareTripleChecker+Invalid, 509 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 123 IncrementalHoareTripleChecker+Valid, 386 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2022-12-13 11:11:46,650 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [596 Valid, 495 Invalid, 509 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [123 Valid, 386 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time] [2022-12-13 11:11:46,669 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 32510 states. [2022-12-13 11:11:49,021 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 32510 to 27760. [2022-12-13 11:11:49,034 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 27760 states, 23323 states have (on average 1.3105089396732839) internal successors, (30565), 23826 states have internal predecessors, (30565), 2379 states have call successors, (2379), 1582 states have call predecessors, (2379), 2052 states have return successors, (4447), 2359 states have call predecessors, (4447), 2379 states have call successors, (4447) [2022-12-13 11:11:49,081 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 27760 states to 27760 states and 37391 transitions. [2022-12-13 11:11:49,084 INFO L78 Accepts]: Start accepts. Automaton has 27760 states and 37391 transitions. Word has length 86 [2022-12-13 11:11:49,084 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-12-13 11:11:49,084 INFO L495 AbstractCegarLoop]: Abstraction has 27760 states and 37391 transitions. [2022-12-13 11:11:49,084 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 11.666666666666666) internal successors, (70), 4 states have internal predecessors, (70), 3 states have call successors, (6), 3 states have call predecessors, (6), 2 states have return successors, (6), 3 states have call predecessors, (6), 3 states have call successors, (6) [2022-12-13 11:11:49,084 INFO L276 IsEmpty]: Start isEmpty. Operand 27760 states and 37391 transitions. [2022-12-13 11:11:49,086 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 87 [2022-12-13 11:11:49,086 INFO L187 NwaCegarLoop]: Found error trace [2022-12-13 11:11:49,086 INFO L195 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-13 11:11:49,086 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable17 [2022-12-13 11:11:49,086 INFO L420 AbstractCegarLoop]: === Iteration 19 === Targeting ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 3 more)] === [2022-12-13 11:11:49,086 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 11:11:49,086 INFO L85 PathProgramCache]: Analyzing trace with hash 687210699, now seen corresponding path program 1 times [2022-12-13 11:11:49,086 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-13 11:11:49,086 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1674209287] [2022-12-13 11:11:49,086 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 11:11:49,087 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-13 11:11:49,090 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 11:11:49,099 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2022-12-13 11:11:49,099 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 11:11:49,108 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2022-12-13 11:11:49,109 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 11:11:49,116 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 20 [2022-12-13 11:11:49,118 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 11:11:49,120 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 41 [2022-12-13 11:11:49,121 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 11:11:49,122 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 53 [2022-12-13 11:11:49,123 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 11:11:49,124 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 71 [2022-12-13 11:11:49,124 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 11:11:49,125 INFO L134 CoverageAnalysis]: Checked inductivity of 14 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 14 trivial. 0 not checked. [2022-12-13 11:11:49,125 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-13 11:11:49,126 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1674209287] [2022-12-13 11:11:49,126 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1674209287] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-13 11:11:49,126 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-13 11:11:49,126 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2022-12-13 11:11:49,126 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [255986340] [2022-12-13 11:11:49,126 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-13 11:11:49,126 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-12-13 11:11:49,126 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-13 11:11:49,126 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-12-13 11:11:49,126 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2022-12-13 11:11:49,127 INFO L87 Difference]: Start difference. First operand 27760 states and 37391 transitions. Second operand has 5 states, 5 states have (on average 12.6) internal successors, (63), 3 states have internal predecessors, (63), 2 states have call successors, (5), 3 states have call predecessors, (5), 1 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) [2022-12-13 11:11:52,346 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-12-13 11:11:52,346 INFO L93 Difference]: Finished difference Result 58036 states and 78781 transitions. [2022-12-13 11:11:52,347 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2022-12-13 11:11:52,347 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 12.6) internal successors, (63), 3 states have internal predecessors, (63), 2 states have call successors, (5), 3 states have call predecessors, (5), 1 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) Word has length 86 [2022-12-13 11:11:52,347 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-12-13 11:11:52,413 INFO L225 Difference]: With dead ends: 58036 [2022-12-13 11:11:52,413 INFO L226 Difference]: Without dead ends: 30290 [2022-12-13 11:11:52,450 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 21 GetRequests, 15 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=22, Invalid=34, Unknown=0, NotChecked=0, Total=56 [2022-12-13 11:11:52,450 INFO L413 NwaCegarLoop]: 132 mSDtfsCounter, 382 mSDsluCounter, 162 mSDsCounter, 0 mSdLazyCounter, 198 mSolverCounterSat, 38 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 402 SdHoareTripleChecker+Valid, 294 SdHoareTripleChecker+Invalid, 236 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 38 IncrementalHoareTripleChecker+Valid, 198 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2022-12-13 11:11:52,450 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [402 Valid, 294 Invalid, 236 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [38 Valid, 198 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2022-12-13 11:11:52,469 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 30290 states. [2022-12-13 11:11:54,703 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 30290 to 25918. [2022-12-13 11:11:54,716 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 25918 states, 21776 states have (on average 1.31704628949302) internal successors, (28680), 22248 states have internal predecessors, (28680), 2216 states have call successors, (2216), 1464 states have call predecessors, (2216), 1920 states have return successors, (4255), 2209 states have call predecessors, (4255), 2216 states have call successors, (4255) [2022-12-13 11:11:54,762 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 25918 states to 25918 states and 35151 transitions. [2022-12-13 11:11:54,765 INFO L78 Accepts]: Start accepts. Automaton has 25918 states and 35151 transitions. Word has length 86 [2022-12-13 11:11:54,765 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-12-13 11:11:54,765 INFO L495 AbstractCegarLoop]: Abstraction has 25918 states and 35151 transitions. [2022-12-13 11:11:54,765 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 12.6) internal successors, (63), 3 states have internal predecessors, (63), 2 states have call successors, (5), 3 states have call predecessors, (5), 1 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) [2022-12-13 11:11:54,765 INFO L276 IsEmpty]: Start isEmpty. Operand 25918 states and 35151 transitions. [2022-12-13 11:11:54,766 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 88 [2022-12-13 11:11:54,766 INFO L187 NwaCegarLoop]: Found error trace [2022-12-13 11:11:54,766 INFO L195 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-13 11:11:54,766 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable18 [2022-12-13 11:11:54,766 INFO L420 AbstractCegarLoop]: === Iteration 20 === Targeting ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 3 more)] === [2022-12-13 11:11:54,767 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 11:11:54,767 INFO L85 PathProgramCache]: Analyzing trace with hash -1390274218, now seen corresponding path program 1 times [2022-12-13 11:11:54,767 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-13 11:11:54,767 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [324139893] [2022-12-13 11:11:54,767 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 11:11:54,767 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-13 11:11:54,772 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 11:11:54,794 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2022-12-13 11:11:54,794 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 11:11:54,804 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2022-12-13 11:11:54,805 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 11:11:54,812 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 20 [2022-12-13 11:11:54,813 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 11:11:54,815 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 41 [2022-12-13 11:11:54,816 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 11:11:54,817 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 53 [2022-12-13 11:11:54,818 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 11:11:54,819 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 72 [2022-12-13 11:11:54,820 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 11:11:54,821 INFO L134 CoverageAnalysis]: Checked inductivity of 14 backedges. 9 proven. 0 refuted. 0 times theorem prover too weak. 5 trivial. 0 not checked. [2022-12-13 11:11:54,821 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-13 11:11:54,821 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [324139893] [2022-12-13 11:11:54,821 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [324139893] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-13 11:11:54,821 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-13 11:11:54,822 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2022-12-13 11:11:54,822 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [876388116] [2022-12-13 11:11:54,822 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-13 11:11:54,822 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2022-12-13 11:11:54,822 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-13 11:11:54,822 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2022-12-13 11:11:54,822 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2022-12-13 11:11:54,822 INFO L87 Difference]: Start difference. First operand 25918 states and 35151 transitions. Second operand has 6 states, 6 states have (on average 11.833333333333334) internal successors, (71), 4 states have internal predecessors, (71), 3 states have call successors, (6), 3 states have call predecessors, (6), 1 states have return successors, (6), 3 states have call predecessors, (6), 3 states have call successors, (6) [2022-12-13 11:12:01,372 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-12-13 11:12:01,372 INFO L93 Difference]: Finished difference Result 83341 states and 114720 transitions. [2022-12-13 11:12:01,373 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 17 states. [2022-12-13 11:12:01,373 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 11.833333333333334) internal successors, (71), 4 states have internal predecessors, (71), 3 states have call successors, (6), 3 states have call predecessors, (6), 1 states have return successors, (6), 3 states have call predecessors, (6), 3 states have call successors, (6) Word has length 87 [2022-12-13 11:12:01,373 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-12-13 11:12:01,493 INFO L225 Difference]: With dead ends: 83341 [2022-12-13 11:12:01,494 INFO L226 Difference]: Without dead ends: 57437 [2022-12-13 11:12:01,526 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 38 GetRequests, 23 SyntacticMatches, 0 SemanticMatches, 15 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 51 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=81, Invalid=191, Unknown=0, NotChecked=0, Total=272 [2022-12-13 11:12:01,527 INFO L413 NwaCegarLoop]: 194 mSDtfsCounter, 966 mSDsluCounter, 493 mSDsCounter, 0 mSdLazyCounter, 786 mSolverCounterSat, 164 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 982 SdHoareTripleChecker+Valid, 687 SdHoareTripleChecker+Invalid, 950 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 164 IncrementalHoareTripleChecker+Valid, 786 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.6s IncrementalHoareTripleChecker+Time [2022-12-13 11:12:01,527 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [982 Valid, 687 Invalid, 950 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [164 Valid, 786 Invalid, 0 Unknown, 0 Unchecked, 0.6s Time] [2022-12-13 11:12:01,559 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 57437 states. [2022-12-13 11:12:06,843 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 57437 to 52505. [2022-12-13 11:12:06,864 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 52505 states, 44110 states have (on average 1.2984130582634323) internal successors, (57273), 45229 states have internal predecessors, (57273), 4299 states have call successors, (4299), 2886 states have call predecessors, (4299), 4090 states have return successors, (10441), 4397 states have call predecessors, (10441), 4299 states have call successors, (10441) [2022-12-13 11:12:06,970 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 52505 states to 52505 states and 72013 transitions. [2022-12-13 11:12:06,975 INFO L78 Accepts]: Start accepts. Automaton has 52505 states and 72013 transitions. Word has length 87 [2022-12-13 11:12:06,975 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-12-13 11:12:06,975 INFO L495 AbstractCegarLoop]: Abstraction has 52505 states and 72013 transitions. [2022-12-13 11:12:06,975 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 11.833333333333334) internal successors, (71), 4 states have internal predecessors, (71), 3 states have call successors, (6), 3 states have call predecessors, (6), 1 states have return successors, (6), 3 states have call predecessors, (6), 3 states have call successors, (6) [2022-12-13 11:12:06,975 INFO L276 IsEmpty]: Start isEmpty. Operand 52505 states and 72013 transitions. [2022-12-13 11:12:06,977 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 88 [2022-12-13 11:12:06,977 INFO L187 NwaCegarLoop]: Found error trace [2022-12-13 11:12:06,977 INFO L195 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-13 11:12:06,977 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable19 [2022-12-13 11:12:06,977 INFO L420 AbstractCegarLoop]: === Iteration 21 === Targeting ULTIMATE.startErr4ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 3 more)] === [2022-12-13 11:12:06,978 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 11:12:06,978 INFO L85 PathProgramCache]: Analyzing trace with hash -1475053337, now seen corresponding path program 1 times [2022-12-13 11:12:06,978 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-13 11:12:06,978 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1188058008] [2022-12-13 11:12:06,978 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 11:12:06,978 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-13 11:12:06,983 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 11:12:06,999 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2022-12-13 11:12:07,000 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 11:12:07,008 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2022-12-13 11:12:07,009 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 11:12:07,016 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 20 [2022-12-13 11:12:07,018 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 11:12:07,029 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 41 [2022-12-13 11:12:07,030 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 11:12:07,031 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 53 [2022-12-13 11:12:07,032 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 11:12:07,033 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 71 [2022-12-13 11:12:07,034 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 11:12:07,035 INFO L134 CoverageAnalysis]: Checked inductivity of 15 backedges. 7 proven. 0 refuted. 0 times theorem prover too weak. 8 trivial. 0 not checked. [2022-12-13 11:12:07,035 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-13 11:12:07,035 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1188058008] [2022-12-13 11:12:07,035 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1188058008] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-13 11:12:07,035 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-13 11:12:07,035 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2022-12-13 11:12:07,035 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1682700822] [2022-12-13 11:12:07,035 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-13 11:12:07,036 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2022-12-13 11:12:07,036 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-13 11:12:07,036 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2022-12-13 11:12:07,036 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2022-12-13 11:12:07,037 INFO L87 Difference]: Start difference. First operand 52505 states and 72013 transitions. Second operand has 6 states, 6 states have (on average 11.5) internal successors, (69), 4 states have internal predecessors, (69), 3 states have call successors, (6), 3 states have call predecessors, (6), 2 states have return successors, (6), 3 states have call predecessors, (6), 3 states have call successors, (6) [2022-12-13 11:12:13,519 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-12-13 11:12:13,519 INFO L93 Difference]: Finished difference Result 104022 states and 142212 transitions. [2022-12-13 11:12:13,520 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2022-12-13 11:12:13,520 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 11.5) internal successors, (69), 4 states have internal predecessors, (69), 3 states have call successors, (6), 3 states have call predecessors, (6), 2 states have return successors, (6), 3 states have call predecessors, (6), 3 states have call successors, (6) Word has length 87 [2022-12-13 11:12:13,520 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-12-13 11:12:13,654 INFO L225 Difference]: With dead ends: 104022 [2022-12-13 11:12:13,654 INFO L226 Difference]: Without dead ends: 60507 [2022-12-13 11:12:13,714 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 25 GetRequests, 15 SyntacticMatches, 0 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 13 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=47, Invalid=85, Unknown=0, NotChecked=0, Total=132 [2022-12-13 11:12:13,715 INFO L413 NwaCegarLoop]: 174 mSDtfsCounter, 595 mSDsluCounter, 342 mSDsCounter, 0 mSdLazyCounter, 406 mSolverCounterSat, 116 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 602 SdHoareTripleChecker+Valid, 516 SdHoareTripleChecker+Invalid, 522 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 116 IncrementalHoareTripleChecker+Valid, 406 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2022-12-13 11:12:13,715 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [602 Valid, 516 Invalid, 522 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [116 Valid, 406 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2022-12-13 11:12:13,755 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 60507 states. [2022-12-13 11:12:18,897 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 60507 to 52769. [2022-12-13 11:12:18,925 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 52769 states, 44242 states have (on average 1.2899281225984358) internal successors, (57069), 45451 states have internal predecessors, (57069), 4299 states have call successors, (4299), 2886 states have call predecessors, (4299), 4222 states have return successors, (9302), 4439 states have call predecessors, (9302), 4299 states have call successors, (9302) [2022-12-13 11:12:19,034 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 52769 states to 52769 states and 70670 transitions. [2022-12-13 11:12:19,041 INFO L78 Accepts]: Start accepts. Automaton has 52769 states and 70670 transitions. Word has length 87 [2022-12-13 11:12:19,041 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-12-13 11:12:19,041 INFO L495 AbstractCegarLoop]: Abstraction has 52769 states and 70670 transitions. [2022-12-13 11:12:19,041 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 11.5) internal successors, (69), 4 states have internal predecessors, (69), 3 states have call successors, (6), 3 states have call predecessors, (6), 2 states have return successors, (6), 3 states have call predecessors, (6), 3 states have call successors, (6) [2022-12-13 11:12:19,041 INFO L276 IsEmpty]: Start isEmpty. Operand 52769 states and 70670 transitions. [2022-12-13 11:12:19,043 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 88 [2022-12-13 11:12:19,043 INFO L187 NwaCegarLoop]: Found error trace [2022-12-13 11:12:19,043 INFO L195 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-13 11:12:19,043 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable20 [2022-12-13 11:12:19,043 INFO L420 AbstractCegarLoop]: === Iteration 22 === Targeting ULTIMATE.startErr4ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 3 more)] === [2022-12-13 11:12:19,044 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 11:12:19,044 INFO L85 PathProgramCache]: Analyzing trace with hash -1234813591, now seen corresponding path program 1 times [2022-12-13 11:12:19,044 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-13 11:12:19,044 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1697516957] [2022-12-13 11:12:19,044 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 11:12:19,044 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-13 11:12:19,048 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 11:12:19,056 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2022-12-13 11:12:19,056 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 11:12:19,062 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2022-12-13 11:12:19,063 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 11:12:19,067 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 20 [2022-12-13 11:12:19,068 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 11:12:19,070 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 41 [2022-12-13 11:12:19,070 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 11:12:19,071 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 53 [2022-12-13 11:12:19,072 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 11:12:19,072 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 71 [2022-12-13 11:12:19,073 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 11:12:19,073 INFO L134 CoverageAnalysis]: Checked inductivity of 15 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 15 trivial. 0 not checked. [2022-12-13 11:12:19,073 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-13 11:12:19,073 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1697516957] [2022-12-13 11:12:19,074 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1697516957] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-13 11:12:19,074 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-13 11:12:19,074 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2022-12-13 11:12:19,074 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1323423516] [2022-12-13 11:12:19,074 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-13 11:12:19,074 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-12-13 11:12:19,074 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-13 11:12:19,074 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-12-13 11:12:19,075 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2022-12-13 11:12:19,075 INFO L87 Difference]: Start difference. First operand 52769 states and 70670 transitions. Second operand has 5 states, 5 states have (on average 12.6) internal successors, (63), 3 states have internal predecessors, (63), 2 states have call successors, (5), 3 states have call predecessors, (5), 1 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) [2022-12-13 11:12:24,528 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-12-13 11:12:24,528 INFO L93 Difference]: Finished difference Result 58684 states and 79014 transitions. [2022-12-13 11:12:24,528 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2022-12-13 11:12:24,529 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 12.6) internal successors, (63), 3 states have internal predecessors, (63), 2 states have call successors, (5), 3 states have call predecessors, (5), 1 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) Word has length 87 [2022-12-13 11:12:24,529 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-12-13 11:12:24,636 INFO L225 Difference]: With dead ends: 58684 [2022-12-13 11:12:24,636 INFO L226 Difference]: Without dead ends: 49848 [2022-12-13 11:12:24,660 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 21 GetRequests, 15 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=22, Invalid=34, Unknown=0, NotChecked=0, Total=56 [2022-12-13 11:12:24,661 INFO L413 NwaCegarLoop]: 131 mSDtfsCounter, 382 mSDsluCounter, 161 mSDsCounter, 0 mSdLazyCounter, 197 mSolverCounterSat, 38 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 402 SdHoareTripleChecker+Valid, 292 SdHoareTripleChecker+Invalid, 235 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 38 IncrementalHoareTripleChecker+Valid, 197 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2022-12-13 11:12:24,661 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [402 Valid, 292 Invalid, 235 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [38 Valid, 197 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2022-12-13 11:12:24,693 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 49848 states. [2022-12-13 11:12:29,169 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 49848 to 43937. [2022-12-13 11:12:29,187 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 43937 states, 36893 states have (on average 1.2947713658417586) internal successors, (47768), 37930 states have internal predecessors, (47768), 3509 states have call successors, (3509), 2352 states have call predecessors, (3509), 3529 states have return successors, (7826), 3658 states have call predecessors, (7826), 3509 states have call successors, (7826) [2022-12-13 11:12:29,266 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 43937 states to 43937 states and 59103 transitions. [2022-12-13 11:12:29,270 INFO L78 Accepts]: Start accepts. Automaton has 43937 states and 59103 transitions. Word has length 87 [2022-12-13 11:12:29,270 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-12-13 11:12:29,270 INFO L495 AbstractCegarLoop]: Abstraction has 43937 states and 59103 transitions. [2022-12-13 11:12:29,270 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 12.6) internal successors, (63), 3 states have internal predecessors, (63), 2 states have call successors, (5), 3 states have call predecessors, (5), 1 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) [2022-12-13 11:12:29,270 INFO L276 IsEmpty]: Start isEmpty. Operand 43937 states and 59103 transitions. [2022-12-13 11:12:29,271 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 90 [2022-12-13 11:12:29,271 INFO L187 NwaCegarLoop]: Found error trace [2022-12-13 11:12:29,272 INFO L195 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-13 11:12:29,272 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable21 [2022-12-13 11:12:29,272 INFO L420 AbstractCegarLoop]: === Iteration 23 === Targeting ULTIMATE.startErr4ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 3 more)] === [2022-12-13 11:12:29,272 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 11:12:29,272 INFO L85 PathProgramCache]: Analyzing trace with hash -47309187, now seen corresponding path program 1 times [2022-12-13 11:12:29,272 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-13 11:12:29,272 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2008006260] [2022-12-13 11:12:29,272 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 11:12:29,272 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-13 11:12:29,277 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 11:12:29,298 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2022-12-13 11:12:29,298 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 11:12:29,308 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2022-12-13 11:12:29,308 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 11:12:29,315 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 20 [2022-12-13 11:12:29,316 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 11:12:29,318 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 41 [2022-12-13 11:12:29,318 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 11:12:29,319 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 53 [2022-12-13 11:12:29,319 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 11:12:29,320 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 72 [2022-12-13 11:12:29,321 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 11:12:29,321 INFO L134 CoverageAnalysis]: Checked inductivity of 16 backedges. 11 proven. 0 refuted. 0 times theorem prover too weak. 5 trivial. 0 not checked. [2022-12-13 11:12:29,321 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-13 11:12:29,322 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2008006260] [2022-12-13 11:12:29,322 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2008006260] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-13 11:12:29,322 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-13 11:12:29,322 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2022-12-13 11:12:29,322 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1440004581] [2022-12-13 11:12:29,322 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-13 11:12:29,322 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2022-12-13 11:12:29,322 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-13 11:12:29,322 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2022-12-13 11:12:29,322 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2022-12-13 11:12:29,323 INFO L87 Difference]: Start difference. First operand 43937 states and 59103 transitions. Second operand has 6 states, 6 states have (on average 12.166666666666666) internal successors, (73), 4 states have internal predecessors, (73), 3 states have call successors, (6), 3 states have call predecessors, (6), 1 states have return successors, (6), 3 states have call predecessors, (6), 3 states have call successors, (6) [2022-12-13 11:12:35,103 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-12-13 11:12:35,104 INFO L93 Difference]: Finished difference Result 90886 states and 123009 transitions. [2022-12-13 11:12:35,104 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 17 states. [2022-12-13 11:12:35,105 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 12.166666666666666) internal successors, (73), 4 states have internal predecessors, (73), 3 states have call successors, (6), 3 states have call predecessors, (6), 1 states have return successors, (6), 3 states have call predecessors, (6), 3 states have call successors, (6) Word has length 89 [2022-12-13 11:12:35,105 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-12-13 11:12:35,221 INFO L225 Difference]: With dead ends: 90886 [2022-12-13 11:12:35,221 INFO L226 Difference]: Without dead ends: 50162 [2022-12-13 11:12:35,277 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 38 GetRequests, 23 SyntacticMatches, 0 SemanticMatches, 15 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 50 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=81, Invalid=191, Unknown=0, NotChecked=0, Total=272 [2022-12-13 11:12:35,277 INFO L413 NwaCegarLoop]: 221 mSDtfsCounter, 913 mSDsluCounter, 566 mSDsCounter, 0 mSdLazyCounter, 798 mSolverCounterSat, 128 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 929 SdHoareTripleChecker+Valid, 787 SdHoareTripleChecker+Invalid, 926 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 128 IncrementalHoareTripleChecker+Valid, 798 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.6s IncrementalHoareTripleChecker+Time [2022-12-13 11:12:35,278 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [929 Valid, 787 Invalid, 926 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [128 Valid, 798 Invalid, 0 Unknown, 0 Unchecked, 0.6s Time] [2022-12-13 11:12:35,309 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 50162 states. [2022-12-13 11:12:39,734 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 50162 to 39179. [2022-12-13 11:12:39,752 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 39179 states, 32943 states have (on average 1.2890750690586772) internal successors, (42466), 33888 states have internal predecessors, (42466), 3069 states have call successors, (3069), 2060 states have call predecessors, (3069), 3161 states have return successors, (6714), 3234 states have call predecessors, (6714), 3069 states have call successors, (6714) [2022-12-13 11:12:39,823 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 39179 states to 39179 states and 52249 transitions. [2022-12-13 11:12:39,827 INFO L78 Accepts]: Start accepts. Automaton has 39179 states and 52249 transitions. Word has length 89 [2022-12-13 11:12:39,827 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-12-13 11:12:39,828 INFO L495 AbstractCegarLoop]: Abstraction has 39179 states and 52249 transitions. [2022-12-13 11:12:39,828 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 12.166666666666666) internal successors, (73), 4 states have internal predecessors, (73), 3 states have call successors, (6), 3 states have call predecessors, (6), 1 states have return successors, (6), 3 states have call predecessors, (6), 3 states have call successors, (6) [2022-12-13 11:12:39,828 INFO L276 IsEmpty]: Start isEmpty. Operand 39179 states and 52249 transitions. [2022-12-13 11:12:39,829 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 100 [2022-12-13 11:12:39,829 INFO L187 NwaCegarLoop]: Found error trace [2022-12-13 11:12:39,829 INFO L195 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-13 11:12:39,829 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable22 [2022-12-13 11:12:39,830 INFO L420 AbstractCegarLoop]: === Iteration 24 === Targeting ULTIMATE.startErr4ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 3 more)] === [2022-12-13 11:12:39,830 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 11:12:39,830 INFO L85 PathProgramCache]: Analyzing trace with hash -23581593, now seen corresponding path program 1 times [2022-12-13 11:12:39,830 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-13 11:12:39,830 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [403510273] [2022-12-13 11:12:39,830 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 11:12:39,830 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-13 11:12:39,838 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 11:12:39,848 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2022-12-13 11:12:39,849 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 11:12:39,858 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2022-12-13 11:12:39,859 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 11:12:39,866 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 20 [2022-12-13 11:12:39,867 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 11:12:39,870 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 41 [2022-12-13 11:12:39,871 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 11:12:39,873 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 53 [2022-12-13 11:12:39,874 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 11:12:39,875 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 66 [2022-12-13 11:12:39,876 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 11:12:39,879 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-12-13 11:12:39,880 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 11:12:39,883 INFO L134 CoverageAnalysis]: Checked inductivity of 20 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 20 trivial. 0 not checked. [2022-12-13 11:12:39,883 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-13 11:12:39,883 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [403510273] [2022-12-13 11:12:39,883 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [403510273] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-13 11:12:39,883 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-13 11:12:39,883 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2022-12-13 11:12:39,883 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1121793602] [2022-12-13 11:12:39,883 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-13 11:12:39,884 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-12-13 11:12:39,884 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-13 11:12:39,884 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-12-13 11:12:39,884 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2022-12-13 11:12:39,884 INFO L87 Difference]: Start difference. First operand 39179 states and 52249 transitions. Second operand has 5 states, 5 states have (on average 13.2) internal successors, (66), 3 states have internal predecessors, (66), 2 states have call successors, (7), 3 states have call predecessors, (7), 1 states have return successors, (7), 2 states have call predecessors, (7), 2 states have call successors, (7) [2022-12-13 11:12:46,230 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-12-13 11:12:46,230 INFO L93 Difference]: Finished difference Result 92880 states and 125239 transitions. [2022-12-13 11:12:46,231 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2022-12-13 11:12:46,231 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 13.2) internal successors, (66), 3 states have internal predecessors, (66), 2 states have call successors, (7), 3 states have call predecessors, (7), 1 states have return successors, (7), 2 states have call predecessors, (7), 2 states have call successors, (7) Word has length 99 [2022-12-13 11:12:46,231 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-12-13 11:12:46,369 INFO L225 Difference]: With dead ends: 92880 [2022-12-13 11:12:46,370 INFO L226 Difference]: Without dead ends: 56888 [2022-12-13 11:12:46,430 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 24 GetRequests, 17 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=27, Invalid=45, Unknown=0, NotChecked=0, Total=72 [2022-12-13 11:12:46,430 INFO L413 NwaCegarLoop]: 145 mSDtfsCounter, 489 mSDsluCounter, 257 mSDsCounter, 0 mSdLazyCounter, 327 mSolverCounterSat, 59 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 500 SdHoareTripleChecker+Valid, 402 SdHoareTripleChecker+Invalid, 386 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 59 IncrementalHoareTripleChecker+Valid, 327 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2022-12-13 11:12:46,431 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [500 Valid, 402 Invalid, 386 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [59 Valid, 327 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2022-12-13 11:12:46,468 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 56888 states. [2022-12-13 11:12:51,841 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 56888 to 49789. [2022-12-13 11:12:51,861 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 49789 states, 41889 states have (on average 1.2872114397574543) internal successors, (53920), 43028 states have internal predecessors, (53920), 3949 states have call successors, (3949), 2644 states have call predecessors, (3949), 3945 states have return successors, (8312), 4120 states have call predecessors, (8312), 3949 states have call successors, (8312) [2022-12-13 11:12:51,953 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 49789 states to 49789 states and 66181 transitions. [2022-12-13 11:12:51,957 INFO L78 Accepts]: Start accepts. Automaton has 49789 states and 66181 transitions. Word has length 99 [2022-12-13 11:12:51,957 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-12-13 11:12:51,958 INFO L495 AbstractCegarLoop]: Abstraction has 49789 states and 66181 transitions. [2022-12-13 11:12:51,958 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 13.2) internal successors, (66), 3 states have internal predecessors, (66), 2 states have call successors, (7), 3 states have call predecessors, (7), 1 states have return successors, (7), 2 states have call predecessors, (7), 2 states have call successors, (7) [2022-12-13 11:12:51,958 INFO L276 IsEmpty]: Start isEmpty. Operand 49789 states and 66181 transitions. [2022-12-13 11:12:51,960 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 111 [2022-12-13 11:12:51,960 INFO L187 NwaCegarLoop]: Found error trace [2022-12-13 11:12:51,961 INFO L195 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-13 11:12:51,961 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable23 [2022-12-13 11:12:51,961 INFO L420 AbstractCegarLoop]: === Iteration 25 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 3 more)] === [2022-12-13 11:12:51,961 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 11:12:51,961 INFO L85 PathProgramCache]: Analyzing trace with hash -1286351433, now seen corresponding path program 1 times [2022-12-13 11:12:51,961 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-13 11:12:51,961 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1599212349] [2022-12-13 11:12:51,961 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 11:12:51,961 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-13 11:12:51,967 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 11:12:51,990 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2022-12-13 11:12:51,990 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 11:12:51,999 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2022-12-13 11:12:52,000 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 11:12:52,008 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 20 [2022-12-13 11:12:52,009 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 11:12:52,011 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 41 [2022-12-13 11:12:52,012 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 11:12:52,013 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 53 [2022-12-13 11:12:52,013 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 11:12:52,014 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 66 [2022-12-13 11:12:52,015 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 11:12:52,017 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-12-13 11:12:52,018 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 11:12:52,020 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 97 [2022-12-13 11:12:52,021 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 11:12:52,027 INFO L134 CoverageAnalysis]: Checked inductivity of 32 backedges. 10 proven. 0 refuted. 0 times theorem prover too weak. 22 trivial. 0 not checked. [2022-12-13 11:12:52,028 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-13 11:12:52,028 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1599212349] [2022-12-13 11:12:52,028 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1599212349] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-13 11:12:52,028 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-13 11:12:52,028 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2022-12-13 11:12:52,028 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [989618107] [2022-12-13 11:12:52,028 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-13 11:12:52,028 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2022-12-13 11:12:52,028 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-13 11:12:52,029 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2022-12-13 11:12:52,029 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2022-12-13 11:12:52,029 INFO L87 Difference]: Start difference. First operand 49789 states and 66181 transitions. Second operand has 7 states, 7 states have (on average 10.571428571428571) internal successors, (74), 5 states have internal predecessors, (74), 4 states have call successors, (8), 3 states have call predecessors, (8), 2 states have return successors, (8), 3 states have call predecessors, (8), 4 states have call successors, (8) [2022-12-13 11:12:58,612 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-12-13 11:12:58,612 INFO L93 Difference]: Finished difference Result 94908 states and 127539 transitions. [2022-12-13 11:12:58,613 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 18 states. [2022-12-13 11:12:58,613 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 10.571428571428571) internal successors, (74), 5 states have internal predecessors, (74), 4 states have call successors, (8), 3 states have call predecessors, (8), 2 states have return successors, (8), 3 states have call predecessors, (8), 4 states have call successors, (8) Word has length 110 [2022-12-13 11:12:58,614 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-12-13 11:12:58,744 INFO L225 Difference]: With dead ends: 94908 [2022-12-13 11:12:58,744 INFO L226 Difference]: Without dead ends: 55628 [2022-12-13 11:12:58,807 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 49 GetRequests, 30 SyntacticMatches, 0 SemanticMatches, 19 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 85 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=101, Invalid=319, Unknown=0, NotChecked=0, Total=420 [2022-12-13 11:12:58,807 INFO L413 NwaCegarLoop]: 196 mSDtfsCounter, 1551 mSDsluCounter, 593 mSDsCounter, 0 mSdLazyCounter, 958 mSolverCounterSat, 272 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.6s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1565 SdHoareTripleChecker+Valid, 789 SdHoareTripleChecker+Invalid, 1230 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 272 IncrementalHoareTripleChecker+Valid, 958 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.7s IncrementalHoareTripleChecker+Time [2022-12-13 11:12:58,808 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [1565 Valid, 789 Invalid, 1230 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [272 Valid, 958 Invalid, 0 Unknown, 0 Unchecked, 0.7s Time] [2022-12-13 11:12:58,843 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 55628 states. [2022-12-13 11:13:04,209 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 55628 to 49789. [2022-12-13 11:13:04,232 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 49789 states, 41889 states have (on average 1.2785218076344624) internal successors, (53556), 43028 states have internal predecessors, (53556), 3949 states have call successors, (3949), 2644 states have call predecessors, (3949), 3945 states have return successors, (7766), 4120 states have call predecessors, (7766), 3949 states have call successors, (7766) [2022-12-13 11:13:04,322 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 49789 states to 49789 states and 65271 transitions. [2022-12-13 11:13:04,326 INFO L78 Accepts]: Start accepts. Automaton has 49789 states and 65271 transitions. Word has length 110 [2022-12-13 11:13:04,326 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-12-13 11:13:04,327 INFO L495 AbstractCegarLoop]: Abstraction has 49789 states and 65271 transitions. [2022-12-13 11:13:04,327 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 10.571428571428571) internal successors, (74), 5 states have internal predecessors, (74), 4 states have call successors, (8), 3 states have call predecessors, (8), 2 states have return successors, (8), 3 states have call predecessors, (8), 4 states have call successors, (8) [2022-12-13 11:13:04,327 INFO L276 IsEmpty]: Start isEmpty. Operand 49789 states and 65271 transitions. [2022-12-13 11:13:04,330 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 117 [2022-12-13 11:13:04,330 INFO L187 NwaCegarLoop]: Found error trace [2022-12-13 11:13:04,330 INFO L195 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-13 11:13:04,330 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable24 [2022-12-13 11:13:04,330 INFO L420 AbstractCegarLoop]: === Iteration 26 === Targeting ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 3 more)] === [2022-12-13 11:13:04,330 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 11:13:04,331 INFO L85 PathProgramCache]: Analyzing trace with hash -495718868, now seen corresponding path program 1 times [2022-12-13 11:13:04,331 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-13 11:13:04,331 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1479099157] [2022-12-13 11:13:04,331 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 11:13:04,331 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-13 11:13:04,337 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 11:13:04,356 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2022-12-13 11:13:04,357 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 11:13:04,365 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2022-12-13 11:13:04,366 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 11:13:04,372 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 20 [2022-12-13 11:13:04,373 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 11:13:04,375 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 41 [2022-12-13 11:13:04,376 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 11:13:04,377 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 53 [2022-12-13 11:13:04,378 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 11:13:04,378 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 72 [2022-12-13 11:13:04,379 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 11:13:04,380 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 85 [2022-12-13 11:13:04,382 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 11:13:04,385 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-12-13 11:13:04,386 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 11:13:04,388 INFO L134 CoverageAnalysis]: Checked inductivity of 33 backedges. 3 proven. 0 refuted. 0 times theorem prover too weak. 30 trivial. 0 not checked. [2022-12-13 11:13:04,388 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-13 11:13:04,388 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1479099157] [2022-12-13 11:13:04,388 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1479099157] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-13 11:13:04,388 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-13 11:13:04,388 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-12-13 11:13:04,388 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [246328047] [2022-12-13 11:13:04,389 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-13 11:13:04,389 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-12-13 11:13:04,389 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-13 11:13:04,389 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-12-13 11:13:04,390 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2022-12-13 11:13:04,390 INFO L87 Difference]: Start difference. First operand 49789 states and 65271 transitions. Second operand has 5 states, 4 states have (on average 19.0) internal successors, (76), 3 states have internal predecessors, (76), 3 states have call successors, (7), 3 states have call predecessors, (7), 1 states have return successors, (7), 2 states have call predecessors, (7), 3 states have call successors, (7) [2022-12-13 11:13:10,828 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-12-13 11:13:10,828 INFO L93 Difference]: Finished difference Result 56624 states and 74631 transitions. [2022-12-13 11:13:10,829 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2022-12-13 11:13:10,829 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 4 states have (on average 19.0) internal successors, (76), 3 states have internal predecessors, (76), 3 states have call successors, (7), 3 states have call predecessors, (7), 1 states have return successors, (7), 2 states have call predecessors, (7), 3 states have call successors, (7) Word has length 116 [2022-12-13 11:13:10,829 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-12-13 11:13:10,944 INFO L225 Difference]: With dead ends: 56624 [2022-12-13 11:13:10,945 INFO L226 Difference]: Without dead ends: 56622 [2022-12-13 11:13:10,964 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 24 GetRequests, 18 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=22, Invalid=34, Unknown=0, NotChecked=0, Total=56 [2022-12-13 11:13:10,964 INFO L413 NwaCegarLoop]: 123 mSDtfsCounter, 375 mSDsluCounter, 146 mSDsCounter, 0 mSdLazyCounter, 213 mSolverCounterSat, 37 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 394 SdHoareTripleChecker+Valid, 269 SdHoareTripleChecker+Invalid, 250 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 37 IncrementalHoareTripleChecker+Valid, 213 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2022-12-13 11:13:10,964 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [394 Valid, 269 Invalid, 250 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [37 Valid, 213 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2022-12-13 11:13:11,001 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 56622 states. [2022-12-13 11:13:16,632 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 56622 to 49787. [2022-12-13 11:13:16,652 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 49787 states, 41889 states have (on average 1.2741769915729666) internal successors, (53374), 43026 states have internal predecessors, (53374), 3949 states have call successors, (3949), 2644 states have call predecessors, (3949), 3945 states have return successors, (7766), 4120 states have call predecessors, (7766), 3949 states have call successors, (7766) [2022-12-13 11:13:16,739 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 49787 states to 49787 states and 65089 transitions. [2022-12-13 11:13:16,742 INFO L78 Accepts]: Start accepts. Automaton has 49787 states and 65089 transitions. Word has length 116 [2022-12-13 11:13:16,742 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-12-13 11:13:16,743 INFO L495 AbstractCegarLoop]: Abstraction has 49787 states and 65089 transitions. [2022-12-13 11:13:16,743 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 4 states have (on average 19.0) internal successors, (76), 3 states have internal predecessors, (76), 3 states have call successors, (7), 3 states have call predecessors, (7), 1 states have return successors, (7), 2 states have call predecessors, (7), 3 states have call successors, (7) [2022-12-13 11:13:16,743 INFO L276 IsEmpty]: Start isEmpty. Operand 49787 states and 65089 transitions. [2022-12-13 11:13:16,746 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 118 [2022-12-13 11:13:16,746 INFO L187 NwaCegarLoop]: Found error trace [2022-12-13 11:13:16,746 INFO L195 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-13 11:13:16,746 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable25 [2022-12-13 11:13:16,746 INFO L420 AbstractCegarLoop]: === Iteration 27 === Targeting ULTIMATE.startErr3ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 3 more)] === [2022-12-13 11:13:16,746 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 11:13:16,747 INFO L85 PathProgramCache]: Analyzing trace with hash 1812584644, now seen corresponding path program 1 times [2022-12-13 11:13:16,747 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-13 11:13:16,747 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1213680844] [2022-12-13 11:13:16,747 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 11:13:16,747 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-13 11:13:16,754 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-12-13 11:13:16,754 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2022-12-13 11:13:16,759 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-12-13 11:13:16,788 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2022-12-13 11:13:16,788 INFO L360 BasicCegarLoop]: Counterexample is feasible [2022-12-13 11:13:16,789 INFO L805 garLoopResultBuilder]: Registering result UNSAFE for location ULTIMATE.startErr3ASSERT_VIOLATIONINTEGER_OVERFLOW (5 of 6 remaining) [2022-12-13 11:13:16,790 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW (4 of 6 remaining) [2022-12-13 11:13:16,791 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW (3 of 6 remaining) [2022-12-13 11:13:16,791 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (2 of 6 remaining) [2022-12-13 11:13:16,791 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr4ASSERT_VIOLATIONINTEGER_OVERFLOW (1 of 6 remaining) [2022-12-13 11:13:16,791 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr5ASSERT_VIOLATIONINTEGER_OVERFLOW (0 of 6 remaining) [2022-12-13 11:13:16,791 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable26 [2022-12-13 11:13:16,794 INFO L445 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, 1, 1, 1] [2022-12-13 11:13:16,797 INFO L178 ceAbstractionStarter]: Computing trace abstraction results [2022-12-13 11:13:16,856 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 13.12 11:13:16 BoogieIcfgContainer [2022-12-13 11:13:16,856 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2022-12-13 11:13:16,856 INFO L113 PluginConnector]: ------------------------Witness Printer---------------------------- [2022-12-13 11:13:16,856 INFO L271 PluginConnector]: Initializing Witness Printer... [2022-12-13 11:13:16,856 INFO L275 PluginConnector]: Witness Printer initialized [2022-12-13 11:13:16,856 INFO L185 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 13.12 11:11:18" (3/4) ... [2022-12-13 11:13:16,858 INFO L131 WitnessPrinter]: Generating witness for reachability counterexample [2022-12-13 11:13:16,928 INFO L141 WitnessManager]: Wrote witness to /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_ad0d263f-12fa-4ad5-bee0-2e1f42890785/bin/uautomizer-uyxdKDjOR8/witness.graphml [2022-12-13 11:13:16,928 INFO L132 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2022-12-13 11:13:16,928 INFO L158 Benchmark]: Toolchain (without parser) took 119308.34ms. Allocated memory was 130.0MB in the beginning and 4.4GB in the end (delta: 4.2GB). Free memory was 98.6MB in the beginning and 2.1GB in the end (delta: -2.0GB). Peak memory consumption was 2.2GB. Max. memory is 16.1GB. [2022-12-13 11:13:16,928 INFO L158 Benchmark]: CDTParser took 0.19ms. Allocated memory is still 130.0MB. Free memory was 102.1MB in the beginning and 102.1MB in the end (delta: 2.0kB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. [2022-12-13 11:13:16,928 INFO L158 Benchmark]: CACSL2BoogieTranslator took 215.77ms. Allocated memory is still 130.0MB. Free memory was 98.2MB in the beginning and 84.6MB in the end (delta: 13.5MB). Peak memory consumption was 12.6MB. Max. memory is 16.1GB. [2022-12-13 11:13:16,928 INFO L158 Benchmark]: Boogie Procedure Inliner took 27.85ms. Allocated memory is still 130.0MB. Free memory was 84.6MB in the beginning and 82.6MB in the end (delta: 2.0MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. [2022-12-13 11:13:16,929 INFO L158 Benchmark]: Boogie Preprocessor took 19.14ms. Allocated memory is still 130.0MB. Free memory was 82.6MB in the beginning and 80.5MB in the end (delta: 2.1MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. [2022-12-13 11:13:16,929 INFO L158 Benchmark]: RCFGBuilder took 406.17ms. Allocated memory is still 130.0MB. Free memory was 80.5MB in the beginning and 59.6MB in the end (delta: 21.0MB). Peak memory consumption was 21.0MB. Max. memory is 16.1GB. [2022-12-13 11:13:16,929 INFO L158 Benchmark]: TraceAbstraction took 118563.23ms. Allocated memory was 130.0MB in the beginning and 4.4GB in the end (delta: 4.2GB). Free memory was 58.8MB in the beginning and 2.2GB in the end (delta: -2.1GB). Peak memory consumption was 2.1GB. Max. memory is 16.1GB. [2022-12-13 11:13:16,929 INFO L158 Benchmark]: Witness Printer took 71.73ms. Allocated memory is still 4.4GB. Free memory was 2.2GB in the beginning and 2.1GB in the end (delta: 10.5MB). Peak memory consumption was 10.5MB. Max. memory is 16.1GB. [2022-12-13 11:13:16,930 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.19ms. Allocated memory is still 130.0MB. Free memory was 102.1MB in the beginning and 102.1MB in the end (delta: 2.0kB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. * CACSL2BoogieTranslator took 215.77ms. Allocated memory is still 130.0MB. Free memory was 98.2MB in the beginning and 84.6MB in the end (delta: 13.5MB). Peak memory consumption was 12.6MB. Max. memory is 16.1GB. * Boogie Procedure Inliner took 27.85ms. Allocated memory is still 130.0MB. Free memory was 84.6MB in the beginning and 82.6MB in the end (delta: 2.0MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. * Boogie Preprocessor took 19.14ms. Allocated memory is still 130.0MB. Free memory was 82.6MB in the beginning and 80.5MB in the end (delta: 2.1MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. * RCFGBuilder took 406.17ms. Allocated memory is still 130.0MB. Free memory was 80.5MB in the beginning and 59.6MB in the end (delta: 21.0MB). Peak memory consumption was 21.0MB. Max. memory is 16.1GB. * TraceAbstraction took 118563.23ms. Allocated memory was 130.0MB in the beginning and 4.4GB in the end (delta: 4.2GB). Free memory was 58.8MB in the beginning and 2.2GB in the end (delta: -2.1GB). Peak memory consumption was 2.1GB. Max. memory is 16.1GB. * Witness Printer took 71.73ms. Allocated memory is still 4.4GB. Free memory was 2.2GB in the beginning and 2.1GB in the end (delta: 10.5MB). Peak memory consumption was 10.5MB. Max. memory is 16.1GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - 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 - CounterExampleResult [Line: 125]: integer overflow possible integer overflow possible We found a FailurePath: [L24] int m_pc = 0; [L25] int t1_pc = 0; [L26] int t2_pc = 0; [L27] int m_st ; [L28] int t1_st ; [L29] int t2_st ; [L30] int m_i ; [L31] int t1_i ; [L32] int t2_i ; [L33] int M_E = 2; [L34] int T1_E = 2; [L35] int T2_E = 2; [L36] int E_M = 2; [L37] int E_1 = 2; [L38] int E_2 = 2; [L43] int token ; [L45] int local ; VAL [E_1=2, E_2=2, E_M=2, local=0, M_E=2, m_i=0, m_pc=0, m_st=0, T1_E=2, t1_i=0, t1_pc=0, t1_st=0, T2_E=2, t2_i=0, t2_pc=0, t2_st=0, token=0] [L610] int __retres1 ; [L614] CALL init_model() [L524] m_i = 1 [L525] t1_i = 1 [L526] t2_i = 1 VAL [E_1=2, E_2=2, E_M=2, local=0, M_E=2, m_i=1, m_pc=0, m_st=0, T1_E=2, t1_i=1, t1_pc=0, t1_st=0, T2_E=2, t2_i=1, t2_pc=0, t2_st=0, token=0] [L614] RET init_model() [L615] CALL start_simulation() [L551] int kernel_st ; [L552] int tmp ; [L553] int tmp___0 ; [L557] kernel_st = 0 VAL [E_1=2, E_2=2, E_M=2, kernel_st=0, local=0, M_E=2, m_i=1, m_pc=0, m_st=0, T1_E=2, t1_i=1, t1_pc=0, t1_st=0, T2_E=2, t2_i=1, t2_pc=0, t2_st=0, token=0] [L558] FCALL update_channels() VAL [E_1=2, E_2=2, E_M=2, kernel_st=0, local=0, M_E=2, m_i=1, m_pc=0, m_st=0, T1_E=2, t1_i=1, t1_pc=0, t1_st=0, T2_E=2, t2_i=1, t2_pc=0, t2_st=0, token=0] [L559] CALL init_threads() [L243] COND TRUE m_i == 1 [L244] m_st = 0 VAL [E_1=2, E_2=2, E_M=2, local=0, M_E=2, m_i=1, m_pc=0, m_st=0, T1_E=2, t1_i=1, t1_pc=0, t1_st=0, T2_E=2, t2_i=1, t2_pc=0, t2_st=0, token=0] [L248] COND TRUE t1_i == 1 [L249] t1_st = 0 VAL [E_1=2, E_2=2, E_M=2, local=0, M_E=2, m_i=1, m_pc=0, m_st=0, T1_E=2, t1_i=1, t1_pc=0, t1_st=0, T2_E=2, t2_i=1, t2_pc=0, t2_st=0, token=0] [L253] COND TRUE t2_i == 1 [L254] t2_st = 0 VAL [E_1=2, E_2=2, E_M=2, local=0, M_E=2, m_i=1, m_pc=0, m_st=0, T1_E=2, t1_i=1, t1_pc=0, t1_st=0, T2_E=2, t2_i=1, t2_pc=0, t2_st=0, token=0] [L559] RET init_threads() [L560] CALL fire_delta_events() VAL [\old(E_1)=2, \old(E_2)=2, \old(E_M)=2, \old(M_E)=2, \old(T1_E)=2, \old(T2_E)=2, E_1=2, E_2=2, E_M=2, local=0, M_E=2, m_i=1, m_pc=0, m_st=0, T1_E=2, t1_i=1, t1_pc=0, t1_st=0, T2_E=2, t2_i=1, t2_pc=0, t2_st=0, token=0] [L356] COND FALSE !(M_E == 0) VAL [\old(E_1)=2, \old(E_2)=2, \old(E_M)=2, \old(M_E)=2, \old(T1_E)=2, \old(T2_E)=2, E_1=2, E_2=2, E_M=2, local=0, M_E=2, m_i=1, m_pc=0, m_st=0, T1_E=2, t1_i=1, t1_pc=0, t1_st=0, T2_E=2, t2_i=1, t2_pc=0, t2_st=0, token=0] [L361] COND FALSE !(T1_E == 0) VAL [\old(E_1)=2, \old(E_2)=2, \old(E_M)=2, \old(M_E)=2, \old(T1_E)=2, \old(T2_E)=2, E_1=2, E_2=2, E_M=2, local=0, M_E=2, m_i=1, m_pc=0, m_st=0, T1_E=2, t1_i=1, t1_pc=0, t1_st=0, T2_E=2, t2_i=1, t2_pc=0, t2_st=0, token=0] [L366] COND FALSE !(T2_E == 0) VAL [\old(E_1)=2, \old(E_2)=2, \old(E_M)=2, \old(M_E)=2, \old(T1_E)=2, \old(T2_E)=2, E_1=2, E_2=2, E_M=2, local=0, M_E=2, m_i=1, m_pc=0, m_st=0, T1_E=2, t1_i=1, t1_pc=0, t1_st=0, T2_E=2, t2_i=1, t2_pc=0, t2_st=0, token=0] [L371] COND FALSE !(E_M == 0) VAL [\old(E_1)=2, \old(E_2)=2, \old(E_M)=2, \old(M_E)=2, \old(T1_E)=2, \old(T2_E)=2, E_1=2, E_2=2, E_M=2, local=0, M_E=2, m_i=1, m_pc=0, m_st=0, T1_E=2, t1_i=1, t1_pc=0, t1_st=0, T2_E=2, t2_i=1, t2_pc=0, t2_st=0, token=0] [L376] COND FALSE !(E_1 == 0) VAL [\old(E_1)=2, \old(E_2)=2, \old(E_M)=2, \old(M_E)=2, \old(T1_E)=2, \old(T2_E)=2, E_1=2, E_2=2, E_M=2, local=0, M_E=2, m_i=1, m_pc=0, m_st=0, T1_E=2, t1_i=1, t1_pc=0, t1_st=0, T2_E=2, t2_i=1, t2_pc=0, t2_st=0, token=0] [L381] COND FALSE !(E_2 == 0) VAL [\old(E_1)=2, \old(E_2)=2, \old(E_M)=2, \old(M_E)=2, \old(T1_E)=2, \old(T2_E)=2, E_1=2, E_2=2, E_M=2, local=0, M_E=2, m_i=1, m_pc=0, m_st=0, T1_E=2, t1_i=1, t1_pc=0, t1_st=0, T2_E=2, t2_i=1, t2_pc=0, t2_st=0, token=0] [L560] RET fire_delta_events() VAL [E_1=2, E_2=2, E_M=2, kernel_st=0, local=0, M_E=2, m_i=1, m_pc=0, m_st=0, T1_E=2, t1_i=1, t1_pc=0, t1_st=0, T2_E=2, t2_i=1, t2_pc=0, t2_st=0, token=0] [L561] CALL activate_threads() VAL [\old(m_st)=0, \old(t1_st)=0, \old(t2_st)=0, E_1=2, E_2=2, E_M=2, local=0, M_E=2, m_i=1, m_pc=0, m_st=0, T1_E=2, t1_i=1, t1_pc=0, t1_st=0, T2_E=2, t2_i=1, t2_pc=0, t2_st=0, token=0] [L429] int tmp ; [L430] int tmp___0 ; [L431] int tmp___1 ; [L435] CALL, EXPR is_master_triggered() [L175] int __retres1 ; VAL [\old(m_st)=0, \old(t1_st)=0, \old(t2_st)=0, E_1=2, E_2=2, E_M=2, local=0, M_E=2, m_i=1, m_pc=0, m_st=0, T1_E=2, t1_i=1, t1_pc=0, t1_st=0, T2_E=2, t2_i=1, t2_pc=0, t2_st=0, token=0] [L178] COND FALSE !(m_pc == 1) VAL [\old(m_st)=0, \old(t1_st)=0, \old(t2_st)=0, E_1=2, E_2=2, E_M=2, local=0, M_E=2, m_i=1, m_pc=0, m_st=0, T1_E=2, t1_i=1, t1_pc=0, t1_st=0, T2_E=2, t2_i=1, t2_pc=0, t2_st=0, token=0] [L188] __retres1 = 0 VAL [\old(m_st)=0, \old(t1_st)=0, \old(t2_st)=0, __retres1=0, E_1=2, E_2=2, E_M=2, local=0, M_E=2, m_i=1, m_pc=0, m_st=0, T1_E=2, t1_i=1, t1_pc=0, t1_st=0, T2_E=2, t2_i=1, t2_pc=0, t2_st=0, token=0] [L190] return (__retres1); VAL [\old(m_st)=0, \old(t1_st)=0, \old(t2_st)=0, \result=0, __retres1=0, E_1=2, E_2=2, E_M=2, local=0, M_E=2, m_i=1, m_pc=0, m_st=0, T1_E=2, t1_i=1, t1_pc=0, t1_st=0, T2_E=2, t2_i=1, t2_pc=0, t2_st=0, token=0] [L435] RET, EXPR is_master_triggered() [L435] tmp = is_master_triggered() [L437] COND FALSE !(\read(tmp)) VAL [\old(m_st)=0, \old(t1_st)=0, \old(t2_st)=0, E_1=2, E_2=2, E_M=2, local=0, M_E=2, m_i=1, m_pc=0, m_st=0, T1_E=2, t1_i=1, t1_pc=0, t1_st=0, T2_E=2, t2_i=1, t2_pc=0, t2_st=0, tmp=0, token=0] [L443] CALL, EXPR is_transmit1_triggered() [L194] int __retres1 ; VAL [\old(m_st)=0, \old(t1_st)=0, \old(t2_st)=0, E_1=2, E_2=2, E_M=2, local=0, M_E=2, m_i=1, m_pc=0, m_st=0, T1_E=2, t1_i=1, t1_pc=0, t1_st=0, T2_E=2, t2_i=1, t2_pc=0, t2_st=0, token=0] [L197] COND FALSE !(t1_pc == 1) VAL [\old(m_st)=0, \old(t1_st)=0, \old(t2_st)=0, E_1=2, E_2=2, E_M=2, local=0, M_E=2, m_i=1, m_pc=0, m_st=0, T1_E=2, t1_i=1, t1_pc=0, t1_st=0, T2_E=2, t2_i=1, t2_pc=0, t2_st=0, token=0] [L207] __retres1 = 0 VAL [\old(m_st)=0, \old(t1_st)=0, \old(t2_st)=0, __retres1=0, E_1=2, E_2=2, E_M=2, local=0, M_E=2, m_i=1, m_pc=0, m_st=0, T1_E=2, t1_i=1, t1_pc=0, t1_st=0, T2_E=2, t2_i=1, t2_pc=0, t2_st=0, token=0] [L209] return (__retres1); VAL [\old(m_st)=0, \old(t1_st)=0, \old(t2_st)=0, \result=0, __retres1=0, E_1=2, E_2=2, E_M=2, local=0, M_E=2, m_i=1, m_pc=0, m_st=0, T1_E=2, t1_i=1, t1_pc=0, t1_st=0, T2_E=2, t2_i=1, t2_pc=0, t2_st=0, token=0] [L443] RET, EXPR is_transmit1_triggered() [L443] tmp___0 = is_transmit1_triggered() [L445] COND FALSE !(\read(tmp___0)) VAL [\old(m_st)=0, \old(t1_st)=0, \old(t2_st)=0, E_1=2, E_2=2, E_M=2, local=0, M_E=2, m_i=1, m_pc=0, m_st=0, T1_E=2, t1_i=1, t1_pc=0, t1_st=0, T2_E=2, t2_i=1, t2_pc=0, t2_st=0, tmp=0, tmp___0=0, token=0] [L451] CALL, EXPR is_transmit2_triggered() [L213] int __retres1 ; VAL [\old(m_st)=0, \old(t1_st)=0, \old(t2_st)=0, E_1=2, E_2=2, E_M=2, local=0, M_E=2, m_i=1, m_pc=0, m_st=0, T1_E=2, t1_i=1, t1_pc=0, t1_st=0, T2_E=2, t2_i=1, t2_pc=0, t2_st=0, token=0] [L216] COND FALSE !(t2_pc == 1) VAL [\old(m_st)=0, \old(t1_st)=0, \old(t2_st)=0, E_1=2, E_2=2, E_M=2, local=0, M_E=2, m_i=1, m_pc=0, m_st=0, T1_E=2, t1_i=1, t1_pc=0, t1_st=0, T2_E=2, t2_i=1, t2_pc=0, t2_st=0, token=0] [L226] __retres1 = 0 VAL [\old(m_st)=0, \old(t1_st)=0, \old(t2_st)=0, __retres1=0, E_1=2, E_2=2, E_M=2, local=0, M_E=2, m_i=1, m_pc=0, m_st=0, T1_E=2, t1_i=1, t1_pc=0, t1_st=0, T2_E=2, t2_i=1, t2_pc=0, t2_st=0, token=0] [L228] return (__retres1); VAL [\old(m_st)=0, \old(t1_st)=0, \old(t2_st)=0, \result=0, __retres1=0, E_1=2, E_2=2, E_M=2, local=0, M_E=2, m_i=1, m_pc=0, m_st=0, T1_E=2, t1_i=1, t1_pc=0, t1_st=0, T2_E=2, t2_i=1, t2_pc=0, t2_st=0, token=0] [L451] RET, EXPR is_transmit2_triggered() [L451] tmp___1 = is_transmit2_triggered() [L453] COND FALSE !(\read(tmp___1)) VAL [\old(m_st)=0, \old(t1_st)=0, \old(t2_st)=0, E_1=2, E_2=2, E_M=2, local=0, M_E=2, m_i=1, m_pc=0, m_st=0, T1_E=2, t1_i=1, t1_pc=0, t1_st=0, T2_E=2, t2_i=1, t2_pc=0, t2_st=0, tmp=0, tmp___0=0, tmp___1=0, token=0] [L561] RET activate_threads() VAL [E_1=2, E_2=2, E_M=2, kernel_st=0, local=0, M_E=2, m_i=1, m_pc=0, m_st=0, T1_E=2, t1_i=1, t1_pc=0, t1_st=0, T2_E=2, t2_i=1, t2_pc=0, t2_st=0, token=0] [L562] CALL reset_delta_events() VAL [\old(E_1)=2, \old(E_2)=2, \old(E_M)=2, \old(M_E)=2, \old(T1_E)=2, \old(T2_E)=2, E_1=2, E_2=2, E_M=2, local=0, M_E=2, m_i=1, m_pc=0, m_st=0, T1_E=2, t1_i=1, t1_pc=0, t1_st=0, T2_E=2, t2_i=1, t2_pc=0, t2_st=0, token=0] [L394] COND FALSE !(M_E == 1) VAL [\old(E_1)=2, \old(E_2)=2, \old(E_M)=2, \old(M_E)=2, \old(T1_E)=2, \old(T2_E)=2, E_1=2, E_2=2, E_M=2, local=0, M_E=2, m_i=1, m_pc=0, m_st=0, T1_E=2, t1_i=1, t1_pc=0, t1_st=0, T2_E=2, t2_i=1, t2_pc=0, t2_st=0, token=0] [L399] COND FALSE !(T1_E == 1) VAL [\old(E_1)=2, \old(E_2)=2, \old(E_M)=2, \old(M_E)=2, \old(T1_E)=2, \old(T2_E)=2, E_1=2, E_2=2, E_M=2, local=0, M_E=2, m_i=1, m_pc=0, m_st=0, T1_E=2, t1_i=1, t1_pc=0, t1_st=0, T2_E=2, t2_i=1, t2_pc=0, t2_st=0, token=0] [L404] COND FALSE !(T2_E == 1) VAL [\old(E_1)=2, \old(E_2)=2, \old(E_M)=2, \old(M_E)=2, \old(T1_E)=2, \old(T2_E)=2, E_1=2, E_2=2, E_M=2, local=0, M_E=2, m_i=1, m_pc=0, m_st=0, T1_E=2, t1_i=1, t1_pc=0, t1_st=0, T2_E=2, t2_i=1, t2_pc=0, t2_st=0, token=0] [L409] COND FALSE !(E_M == 1) VAL [\old(E_1)=2, \old(E_2)=2, \old(E_M)=2, \old(M_E)=2, \old(T1_E)=2, \old(T2_E)=2, E_1=2, E_2=2, E_M=2, local=0, M_E=2, m_i=1, m_pc=0, m_st=0, T1_E=2, t1_i=1, t1_pc=0, t1_st=0, T2_E=2, t2_i=1, t2_pc=0, t2_st=0, token=0] [L414] COND FALSE !(E_1 == 1) VAL [\old(E_1)=2, \old(E_2)=2, \old(E_M)=2, \old(M_E)=2, \old(T1_E)=2, \old(T2_E)=2, E_1=2, E_2=2, E_M=2, local=0, M_E=2, m_i=1, m_pc=0, m_st=0, T1_E=2, t1_i=1, t1_pc=0, t1_st=0, T2_E=2, t2_i=1, t2_pc=0, t2_st=0, token=0] [L419] COND FALSE !(E_2 == 1) VAL [\old(E_1)=2, \old(E_2)=2, \old(E_M)=2, \old(M_E)=2, \old(T1_E)=2, \old(T2_E)=2, E_1=2, E_2=2, E_M=2, local=0, M_E=2, m_i=1, m_pc=0, m_st=0, T1_E=2, t1_i=1, t1_pc=0, t1_st=0, T2_E=2, t2_i=1, t2_pc=0, t2_st=0, token=0] [L562] RET reset_delta_events() VAL [E_1=2, E_2=2, E_M=2, kernel_st=0, local=0, M_E=2, m_i=1, m_pc=0, m_st=0, T1_E=2, t1_i=1, t1_pc=0, t1_st=0, T2_E=2, t2_i=1, t2_pc=0, t2_st=0, token=0] [L565] COND TRUE 1 VAL [E_1=2, E_2=2, E_M=2, kernel_st=0, local=0, M_E=2, m_i=1, m_pc=0, m_st=0, T1_E=2, t1_i=1, t1_pc=0, t1_st=0, T2_E=2, t2_i=1, t2_pc=0, t2_st=0, token=0] [L568] kernel_st = 1 [L569] CALL eval() [L289] int tmp ; VAL [E_1=2, E_2=2, E_M=2, local=0, M_E=2, m_i=1, m_pc=0, m_st=0, T1_E=2, t1_i=1, t1_pc=0, t1_st=0, T2_E=2, t2_i=1, t2_pc=0, t2_st=0, token=0] [L293] COND TRUE 1 VAL [E_1=2, E_2=2, E_M=2, local=0, M_E=2, m_i=1, m_pc=0, m_st=0, T1_E=2, t1_i=1, t1_pc=0, t1_st=0, T2_E=2, t2_i=1, t2_pc=0, t2_st=0, token=0] [L296] CALL, EXPR exists_runnable_thread() VAL [E_1=2, E_2=2, E_M=2, local=0, M_E=2, m_i=1, m_pc=0, m_st=0, T1_E=2, t1_i=1, t1_pc=0, t1_st=0, T2_E=2, t2_i=1, t2_pc=0, t2_st=0, token=0] [L263] int __retres1 ; VAL [E_1=2, E_2=2, E_M=2, local=0, M_E=2, m_i=1, m_pc=0, m_st=0, T1_E=2, t1_i=1, t1_pc=0, t1_st=0, T2_E=2, t2_i=1, t2_pc=0, t2_st=0, token=0] [L266] COND TRUE m_st == 0 [L267] __retres1 = 1 VAL [__retres1=1, E_1=2, E_2=2, E_M=2, local=0, M_E=2, m_i=1, m_pc=0, m_st=0, T1_E=2, t1_i=1, t1_pc=0, t1_st=0, T2_E=2, t2_i=1, t2_pc=0, t2_st=0, token=0] [L284] return (__retres1); VAL [\result=1, __retres1=1, E_1=2, E_2=2, E_M=2, local=0, M_E=2, m_i=1, m_pc=0, m_st=0, T1_E=2, t1_i=1, t1_pc=0, t1_st=0, T2_E=2, t2_i=1, t2_pc=0, t2_st=0, token=0] [L296] RET, EXPR exists_runnable_thread() VAL [E_1=2, E_2=2, E_M=2, exists_runnable_thread()=1, local=0, M_E=2, m_i=1, m_pc=0, m_st=0, T1_E=2, t1_i=1, t1_pc=0, t1_st=0, T2_E=2, t2_i=1, t2_pc=0, t2_st=0, token=0] [L296] tmp = exists_runnable_thread() [L298] COND TRUE \read(tmp) VAL [E_1=2, E_2=2, E_M=2, local=0, M_E=2, m_i=1, m_pc=0, m_st=0, T1_E=2, t1_i=1, t1_pc=0, t1_st=0, T2_E=2, t2_i=1, t2_pc=0, t2_st=0, tmp=1, token=0] [L303] COND TRUE m_st == 0 [L304] int tmp_ndt_1; [L305] tmp_ndt_1 = __VERIFIER_nondet_int() [L306] COND FALSE !(\read(tmp_ndt_1)) VAL [E_1=2, E_2=2, E_M=2, local=0, M_E=2, m_i=1, m_pc=0, m_st=0, T1_E=2, t1_i=1, t1_pc=0, t1_st=0, T2_E=2, t2_i=1, t2_pc=0, t2_st=0, tmp=1, tmp_ndt_1=0, token=0] [L317] COND TRUE t1_st == 0 [L318] int tmp_ndt_2; [L319] tmp_ndt_2 = __VERIFIER_nondet_int() [L320] COND TRUE \read(tmp_ndt_2) [L322] t1_st = 1 [L323] CALL transmit1() [L106] COND TRUE t1_pc == 0 VAL [E_1=2, E_2=2, E_M=2, local=0, M_E=2, m_i=1, m_pc=0, m_st=0, T1_E=2, t1_i=1, t1_pc=0, t1_st=1, T2_E=2, t2_i=1, t2_pc=0, t2_st=0, token=0] [L117] COND TRUE 1 VAL [E_1=2, E_2=2, E_M=2, local=0, M_E=2, m_i=1, m_pc=0, m_st=0, T1_E=2, t1_i=1, t1_pc=0, t1_st=1, T2_E=2, t2_i=1, t2_pc=0, t2_st=0, token=0] [L119] t1_pc = 1 [L120] t1_st = 2 VAL [E_1=2, E_2=2, E_M=2, local=0, M_E=2, m_i=1, m_pc=0, m_st=0, T1_E=2, t1_i=1, t1_pc=1, t1_st=2, T2_E=2, t2_i=1, t2_pc=0, t2_st=0, token=0] [L323] RET transmit1() [L331] COND TRUE t2_st == 0 [L332] int tmp_ndt_3; [L333] tmp_ndt_3 = __VERIFIER_nondet_int() [L334] COND FALSE !(\read(tmp_ndt_3)) VAL [E_1=2, E_2=2, E_M=2, local=0, M_E=2, m_i=1, m_pc=0, m_st=0, T1_E=2, t1_i=1, t1_pc=1, t1_st=2, T2_E=2, t2_i=1, t2_pc=0, t2_st=0, tmp=1, tmp_ndt_1=0, tmp_ndt_2=1, tmp_ndt_3=0, token=0] [L293] COND TRUE 1 VAL [E_1=2, E_2=2, E_M=2, local=0, M_E=2, m_i=1, m_pc=0, m_st=0, T1_E=2, t1_i=1, t1_pc=1, t1_st=2, T2_E=2, t2_i=1, t2_pc=0, t2_st=0, tmp=1, tmp_ndt_1=0, tmp_ndt_2=1, tmp_ndt_3=0, token=0] [L296] CALL, EXPR exists_runnable_thread() VAL [E_1=2, E_2=2, E_M=2, local=0, M_E=2, m_i=1, m_pc=0, m_st=0, T1_E=2, t1_i=1, t1_pc=1, t1_st=2, T2_E=2, t2_i=1, t2_pc=0, t2_st=0, token=0] [L263] int __retres1 ; VAL [E_1=2, E_2=2, E_M=2, local=0, M_E=2, m_i=1, m_pc=0, m_st=0, T1_E=2, t1_i=1, t1_pc=1, t1_st=2, T2_E=2, t2_i=1, t2_pc=0, t2_st=0, token=0] [L266] COND TRUE m_st == 0 [L267] __retres1 = 1 VAL [__retres1=1, E_1=2, E_2=2, E_M=2, local=0, M_E=2, m_i=1, m_pc=0, m_st=0, T1_E=2, t1_i=1, t1_pc=1, t1_st=2, T2_E=2, t2_i=1, t2_pc=0, t2_st=0, token=0] [L284] return (__retres1); VAL [\result=1, __retres1=1, E_1=2, E_2=2, E_M=2, local=0, M_E=2, m_i=1, m_pc=0, m_st=0, T1_E=2, t1_i=1, t1_pc=1, t1_st=2, T2_E=2, t2_i=1, t2_pc=0, t2_st=0, token=0] [L296] RET, EXPR exists_runnable_thread() VAL [E_1=2, E_2=2, E_M=2, exists_runnable_thread()=1, local=0, M_E=2, m_i=1, m_pc=0, m_st=0, T1_E=2, t1_i=1, t1_pc=1, t1_st=2, T2_E=2, t2_i=1, t2_pc=0, t2_st=0, tmp=1, tmp_ndt_1=0, tmp_ndt_2=1, tmp_ndt_3=0, token=0] [L296] tmp = exists_runnable_thread() [L298] COND TRUE \read(tmp) VAL [E_1=2, E_2=2, E_M=2, local=0, M_E=2, m_i=1, m_pc=0, m_st=0, T1_E=2, t1_i=1, t1_pc=1, t1_st=2, T2_E=2, t2_i=1, t2_pc=0, t2_st=0, tmp=1, tmp_ndt_1=0, tmp_ndt_2=1, tmp_ndt_3=0, token=0] [L303] COND TRUE m_st == 0 [L304] int tmp_ndt_1; [L305] tmp_ndt_1 = __VERIFIER_nondet_int() [L306] COND TRUE \read(tmp_ndt_1) [L308] m_st = 1 [L309] CALL master() [L48] int tmp_var = __VERIFIER_nondet_int(); [L50] COND TRUE m_pc == 0 VAL [E_1=2, E_2=2, E_M=2, local=0, M_E=2, m_i=1, m_pc=0, m_st=1, T1_E=2, t1_i=1, t1_pc=1, t1_st=2, T2_E=2, t2_i=1, t2_pc=0, t2_st=0, tmp_var=0, token=0] [L61] COND TRUE 1 VAL [E_1=2, E_2=2, E_M=2, local=0, M_E=2, m_i=1, m_pc=0, m_st=1, T1_E=2, t1_i=1, t1_pc=1, t1_st=2, T2_E=2, t2_i=1, t2_pc=0, t2_st=0, tmp_var=0, token=0] [L64] token = __VERIFIER_nondet_int() [L65] local = token [L66] E_1 = 1 VAL [E_1=1, E_2=2, E_M=2, local=2147483647, M_E=2, m_i=1, m_pc=0, m_st=1, T1_E=2, t1_i=1, t1_pc=1, t1_st=2, T2_E=2, t2_i=1, t2_pc=0, t2_st=0, tmp_var=0, token=2147483647] [L67] CALL immediate_notify() VAL [\old(m_st)=1, \old(t1_st)=2, \old(t2_st)=0, E_1=1, E_2=2, E_M=2, local=2147483647, M_E=2, m_i=1, m_pc=0, m_st=1, T1_E=2, t1_i=1, t1_pc=1, t1_st=2, T2_E=2, t2_i=1, t2_pc=0, t2_st=0, token=2147483647] [L467] CALL activate_threads() VAL [\old(m_st)=1, \old(t1_st)=2, \old(t2_st)=0, E_1=1, E_2=2, E_M=2, local=2147483647, M_E=2, m_i=1, m_pc=0, m_st=1, T1_E=2, t1_i=1, t1_pc=1, t1_st=2, T2_E=2, t2_i=1, t2_pc=0, t2_st=0, token=2147483647] [L429] int tmp ; [L430] int tmp___0 ; [L431] int tmp___1 ; [L435] CALL, EXPR is_master_triggered() [L175] int __retres1 ; VAL [\old(m_st)=1, \old(t1_st)=2, \old(t2_st)=0, E_1=1, E_2=2, E_M=2, local=2147483647, M_E=2, m_i=1, m_pc=0, m_st=1, T1_E=2, t1_i=1, t1_pc=1, t1_st=2, T2_E=2, t2_i=1, t2_pc=0, t2_st=0, token=2147483647] [L178] COND FALSE !(m_pc == 1) VAL [\old(m_st)=1, \old(t1_st)=2, \old(t2_st)=0, E_1=1, E_2=2, E_M=2, local=2147483647, M_E=2, m_i=1, m_pc=0, m_st=1, T1_E=2, t1_i=1, t1_pc=1, t1_st=2, T2_E=2, t2_i=1, t2_pc=0, t2_st=0, token=2147483647] [L188] __retres1 = 0 VAL [\old(m_st)=1, \old(t1_st)=2, \old(t2_st)=0, __retres1=0, E_1=1, E_2=2, E_M=2, local=2147483647, M_E=2, m_i=1, m_pc=0, m_st=1, T1_E=2, t1_i=1, t1_pc=1, t1_st=2, T2_E=2, t2_i=1, t2_pc=0, t2_st=0, token=2147483647] [L190] return (__retres1); VAL [\old(m_st)=1, \old(t1_st)=2, \old(t2_st)=0, \result=0, __retres1=0, E_1=1, E_2=2, E_M=2, local=2147483647, M_E=2, m_i=1, m_pc=0, m_st=1, T1_E=2, t1_i=1, t1_pc=1, t1_st=2, T2_E=2, t2_i=1, t2_pc=0, t2_st=0, token=2147483647] [L435] RET, EXPR is_master_triggered() [L435] tmp = is_master_triggered() [L437] COND FALSE !(\read(tmp)) VAL [\old(m_st)=1, \old(t1_st)=2, \old(t2_st)=0, E_1=1, E_2=2, E_M=2, local=2147483647, M_E=2, m_i=1, m_pc=0, m_st=1, T1_E=2, t1_i=1, t1_pc=1, t1_st=2, T2_E=2, t2_i=1, t2_pc=0, t2_st=0, tmp=0, token=2147483647] [L443] CALL, EXPR is_transmit1_triggered() [L194] int __retres1 ; VAL [\old(m_st)=1, \old(t1_st)=2, \old(t2_st)=0, E_1=1, E_2=2, E_M=2, local=2147483647, M_E=2, m_i=1, m_pc=0, m_st=1, T1_E=2, t1_i=1, t1_pc=1, t1_st=2, T2_E=2, t2_i=1, t2_pc=0, t2_st=0, token=2147483647] [L197] COND TRUE t1_pc == 1 VAL [\old(m_st)=1, \old(t1_st)=2, \old(t2_st)=0, E_1=1, E_2=2, E_M=2, local=2147483647, M_E=2, m_i=1, m_pc=0, m_st=1, T1_E=2, t1_i=1, t1_pc=1, t1_st=2, T2_E=2, t2_i=1, t2_pc=0, t2_st=0, token=2147483647] [L198] COND TRUE E_1 == 1 [L199] __retres1 = 1 VAL [\old(m_st)=1, \old(t1_st)=2, \old(t2_st)=0, __retres1=1, E_1=1, E_2=2, E_M=2, local=2147483647, M_E=2, m_i=1, m_pc=0, m_st=1, T1_E=2, t1_i=1, t1_pc=1, t1_st=2, T2_E=2, t2_i=1, t2_pc=0, t2_st=0, token=2147483647] [L209] return (__retres1); VAL [\old(m_st)=1, \old(t1_st)=2, \old(t2_st)=0, \result=1, __retres1=1, E_1=1, E_2=2, E_M=2, local=2147483647, M_E=2, m_i=1, m_pc=0, m_st=1, T1_E=2, t1_i=1, t1_pc=1, t1_st=2, T2_E=2, t2_i=1, t2_pc=0, t2_st=0, token=2147483647] [L443] RET, EXPR is_transmit1_triggered() [L443] tmp___0 = is_transmit1_triggered() [L445] COND TRUE \read(tmp___0) [L446] t1_st = 0 VAL [\old(m_st)=1, \old(t1_st)=2, \old(t2_st)=0, E_1=1, E_2=2, E_M=2, local=2147483647, M_E=2, m_i=1, m_pc=0, m_st=1, T1_E=2, t1_i=1, t1_pc=1, t1_st=0, T2_E=2, t2_i=1, t2_pc=0, t2_st=0, tmp=0, tmp___0=1, token=2147483647] [L451] CALL, EXPR is_transmit2_triggered() [L213] int __retres1 ; VAL [\old(m_st)=1, \old(t1_st)=2, \old(t2_st)=0, E_1=1, E_2=2, E_M=2, local=2147483647, M_E=2, m_i=1, m_pc=0, m_st=1, T1_E=2, t1_i=1, t1_pc=1, t1_st=0, T2_E=2, t2_i=1, t2_pc=0, t2_st=0, token=2147483647] [L216] COND FALSE !(t2_pc == 1) VAL [\old(m_st)=1, \old(t1_st)=2, \old(t2_st)=0, E_1=1, E_2=2, E_M=2, local=2147483647, M_E=2, m_i=1, m_pc=0, m_st=1, T1_E=2, t1_i=1, t1_pc=1, t1_st=0, T2_E=2, t2_i=1, t2_pc=0, t2_st=0, token=2147483647] [L226] __retres1 = 0 VAL [\old(m_st)=1, \old(t1_st)=2, \old(t2_st)=0, __retres1=0, E_1=1, E_2=2, E_M=2, local=2147483647, M_E=2, m_i=1, m_pc=0, m_st=1, T1_E=2, t1_i=1, t1_pc=1, t1_st=0, T2_E=2, t2_i=1, t2_pc=0, t2_st=0, token=2147483647] [L228] return (__retres1); VAL [\old(m_st)=1, \old(t1_st)=2, \old(t2_st)=0, \result=0, __retres1=0, E_1=1, E_2=2, E_M=2, local=2147483647, M_E=2, m_i=1, m_pc=0, m_st=1, T1_E=2, t1_i=1, t1_pc=1, t1_st=0, T2_E=2, t2_i=1, t2_pc=0, t2_st=0, token=2147483647] [L451] RET, EXPR is_transmit2_triggered() [L451] tmp___1 = is_transmit2_triggered() [L453] COND FALSE !(\read(tmp___1)) VAL [\old(m_st)=1, \old(t1_st)=2, \old(t2_st)=0, E_1=1, E_2=2, E_M=2, local=2147483647, M_E=2, m_i=1, m_pc=0, m_st=1, T1_E=2, t1_i=1, t1_pc=1, t1_st=0, T2_E=2, t2_i=1, t2_pc=0, t2_st=0, tmp=0, tmp___0=1, tmp___1=0, token=2147483647] [L467] RET activate_threads() VAL [\old(m_st)=1, \old(t1_st)=2, \old(t2_st)=0, E_1=1, E_2=2, E_M=2, local=2147483647, M_E=2, m_i=1, m_pc=0, m_st=1, T1_E=2, t1_i=1, t1_pc=1, t1_st=0, T2_E=2, t2_i=1, t2_pc=0, t2_st=0, token=2147483647] [L67] RET immediate_notify() VAL [E_1=1, E_2=2, E_M=2, local=2147483647, M_E=2, m_i=1, m_pc=0, m_st=1, T1_E=2, t1_i=1, t1_pc=1, t1_st=0, T2_E=2, t2_i=1, t2_pc=0, t2_st=0, tmp_var=0, token=2147483647] [L68] E_1 = 2 [L69] m_pc = 1 [L70] m_st = 2 VAL [E_1=2, E_2=2, E_M=2, local=2147483647, M_E=2, m_i=1, m_pc=1, m_st=2, T1_E=2, t1_i=1, t1_pc=1, t1_st=0, T2_E=2, t2_i=1, t2_pc=0, t2_st=0, tmp_var=0, token=2147483647] [L309] RET master() [L317] COND TRUE t1_st == 0 [L318] int tmp_ndt_2; [L319] tmp_ndt_2 = __VERIFIER_nondet_int() [L320] COND TRUE \read(tmp_ndt_2) [L322] t1_st = 1 [L323] CALL transmit1() [L106] COND FALSE !(t1_pc == 0) VAL [E_1=2, E_2=2, E_M=2, local=2147483647, M_E=2, m_i=1, m_pc=1, m_st=2, T1_E=2, t1_i=1, t1_pc=1, t1_st=1, T2_E=2, t2_i=1, t2_pc=0, t2_st=0, token=2147483647] [L109] COND TRUE t1_pc == 1 VAL [E_1=2, E_2=2, E_M=2, local=2147483647, M_E=2, m_i=1, m_pc=1, m_st=2, T1_E=2, t1_i=1, t1_pc=1, t1_st=1, T2_E=2, t2_i=1, t2_pc=0, t2_st=0, token=2147483647] [L125] token += 1 VAL [E_1=2, E_2=2, E_M=2, local=2147483647, M_E=2, m_i=1, m_pc=1, m_st=2, T1_E=2, t1_i=1, t1_pc=1, t1_st=1, T2_E=2, t2_i=1, t2_pc=0, t2_st=0, token=2147483647] - UnprovableResult [Line: 75]: Unable to prove that integer overflow can never occur Unable to prove that integer overflow can never occur Reason: Not analyzed. - UnprovableResult [Line: 75]: Unable to prove that integer overflow can never occur Unable to prove that integer overflow can never occur Reason: Not analyzed. - UnprovableResult [Line: 125]: Unable to prove that integer overflow can never occur Unable to prove that integer overflow can never occur Reason: Not analyzed. - UnprovableResult [Line: 161]: Unable to prove that integer overflow can never occur Unable to prove that integer overflow can never occur Reason: Not analyzed. - UnprovableResult [Line: 161]: Unable to prove that integer overflow can never occur Unable to prove that integer overflow can never occur Reason: Not analyzed. - StatisticsResult: Ultimate Automizer benchmark data CFG has 8 procedures, 149 locations, 6 error locations. Started 1 CEGAR loops. OverallTime: 118.5s, OverallIterations: 27, TraceHistogramMax: 2, PathProgramHistogramMax: 1, EmptinessCheckTime: 0.1s, AutomataDifference: 68.7s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 0.0s, HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 15008 SdHoareTripleChecker+Valid, 11.3s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 14709 mSDsluCounter, 15831 SdHoareTripleChecker+Invalid, 9.4s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 11482 mSDsCounter, 2172 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 16132 IncrementalHoareTripleChecker+Invalid, 18304 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 2172 mSolverCounterUnsat, 4349 mSDtfsCounter, 16132 mSolverCounterSat, 0.2s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 715 GetRequests, 394 SyntacticMatches, 0 SemanticMatches, 321 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 819 ImplicationChecksByTransitivity, 2.5s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=52769occurred in iteration=21, InterpolantAutomatonStates: 323, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s DumpTime, AutomataMinimizationStatistics: 47.3s AutomataMinimizationTime, 26 MinimizatonAttempts, 74589 StatesRemovedByMinimization, 26 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.0s SsaConstructionTime, 0.1s SatisfiabilityAnalysisTime, 1.9s InterpolantComputationTime, 2097 NumberOfCodeBlocks, 2097 NumberOfCodeBlocksAsserted, 27 NumberOfCheckSat, 1954 ConstructedInterpolants, 0 QuantifiedInterpolants, 4665 SizeOfPredicates, 0 NumberOfNonLiveVariables, 0 ConjunctsInSsa, 0 ConjunctsInUnsatCore, 26 InterpolantComputations, 26 PerfectInterpolantSequences, 173/173 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 RESULT: Ultimate proved your program to be incorrect! [2022-12-13 11:13:16,942 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_ad0d263f-12fa-4ad5-bee0-2e1f42890785/bin/uautomizer-uyxdKDjOR8/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (1)] Forceful destruction successful, exit code 0 Received shutdown request... --- End real Ultimate output --- Execution finished normally Writing output log to file Ultimate.log Writing human readable error path to file UltimateCounterExample.errorpath Result: FALSE(OVERFLOW)