./Ultimate.py --spec ../../sv-benchmarks/c/properties/no-overflow.prp --file ../../sv-benchmarks/c/systemc/token_ring.01.cil-1.c --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for overflows Using default analysis Version 6b4ec56b Calling Ultimate with: /usr/lib/jvm/java-1.11.0-openjdk-amd64/bin/java -Dosgi.configuration.area=/tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_881119b7-e16e-4526-b171-3c068aa27f33/bin/uautomizer-ug76WZFUDN/data/config -Xmx15G -Xms4m -jar /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_881119b7-e16e-4526-b171-3c068aa27f33/bin/uautomizer-ug76WZFUDN/plugins/org.eclipse.equinox.launcher_1.5.800.v20200727-1323.jar -data @noDefault -ultimatedata /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_881119b7-e16e-4526-b171-3c068aa27f33/bin/uautomizer-ug76WZFUDN/data -tc /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_881119b7-e16e-4526-b171-3c068aa27f33/bin/uautomizer-ug76WZFUDN/config/AutomizerReach.xml -i ../../sv-benchmarks/c/systemc/token_ring.01.cil-1.c -s /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_881119b7-e16e-4526-b171-3c068aa27f33/bin/uautomizer-ug76WZFUDN/config/svcomp-Overflow-32bit-Automizer_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_881119b7-e16e-4526-b171-3c068aa27f33/bin/uautomizer-ug76WZFUDN --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 7b0a21004c99a1cc1588d43a2481960a2ce9f2cdf68e9a363306433e7d24bd30 --- 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-6b4ec56 [2022-11-20 10:44:53,100 INFO L177 SettingsManager]: Resetting all preferences to default values... [2022-11-20 10:44:53,102 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2022-11-20 10:44:53,141 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2022-11-20 10:44:53,142 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2022-11-20 10:44:53,146 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2022-11-20 10:44:53,150 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2022-11-20 10:44:53,154 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2022-11-20 10:44:53,156 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2022-11-20 10:44:53,163 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2022-11-20 10:44:53,165 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2022-11-20 10:44:53,168 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2022-11-20 10:44:53,168 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2022-11-20 10:44:53,172 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2022-11-20 10:44:53,173 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2022-11-20 10:44:53,178 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2022-11-20 10:44:53,180 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2022-11-20 10:44:53,181 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2022-11-20 10:44:53,183 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2022-11-20 10:44:53,191 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2022-11-20 10:44:53,193 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2022-11-20 10:44:53,195 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2022-11-20 10:44:53,197 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2022-11-20 10:44:53,198 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2022-11-20 10:44:53,209 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2022-11-20 10:44:53,211 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2022-11-20 10:44:53,211 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2022-11-20 10:44:53,214 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2022-11-20 10:44:53,214 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2022-11-20 10:44:53,216 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2022-11-20 10:44:53,217 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2022-11-20 10:44:53,218 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2022-11-20 10:44:53,220 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2022-11-20 10:44:53,221 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2022-11-20 10:44:53,222 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2022-11-20 10:44:53,222 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2022-11-20 10:44:53,223 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2022-11-20 10:44:53,223 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2022-11-20 10:44:53,223 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2022-11-20 10:44:53,224 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2022-11-20 10:44:53,225 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2022-11-20 10:44:53,226 INFO L101 SettingsManager]: Beginning loading settings from /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_881119b7-e16e-4526-b171-3c068aa27f33/bin/uautomizer-ug76WZFUDN/config/svcomp-Overflow-32bit-Automizer_Default.epf [2022-11-20 10:44:53,254 INFO L113 SettingsManager]: Loading preferences was successful [2022-11-20 10:44:53,254 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2022-11-20 10:44:53,254 INFO L136 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2022-11-20 10:44:53,255 INFO L138 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2022-11-20 10:44:53,255 INFO L136 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2022-11-20 10:44:53,256 INFO L138 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2022-11-20 10:44:53,256 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2022-11-20 10:44:53,257 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2022-11-20 10:44:53,257 INFO L138 SettingsManager]: * Use SBE=true [2022-11-20 10:44:53,257 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2022-11-20 10:44:53,258 INFO L138 SettingsManager]: * sizeof long=4 [2022-11-20 10:44:53,258 INFO L138 SettingsManager]: * Check unreachability of error function in SV-COMP mode=false [2022-11-20 10:44:53,258 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2022-11-20 10:44:53,258 INFO L138 SettingsManager]: * sizeof POINTER=4 [2022-11-20 10:44:53,258 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2022-11-20 10:44:53,259 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2022-11-20 10:44:53,259 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2022-11-20 10:44:53,259 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2022-11-20 10:44:53,259 INFO L138 SettingsManager]: * Check absence of signed integer overflows=true [2022-11-20 10:44:53,260 INFO L138 SettingsManager]: * sizeof long double=12 [2022-11-20 10:44:53,260 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2022-11-20 10:44:53,260 INFO L138 SettingsManager]: * Use constant arrays=true [2022-11-20 10:44:53,260 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2022-11-20 10:44:53,260 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2022-11-20 10:44:53,261 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2022-11-20 10:44:53,261 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2022-11-20 10:44:53,261 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-11-20 10:44:53,261 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2022-11-20 10:44:53,262 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2022-11-20 10:44:53,262 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2022-11-20 10:44:53,262 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2022-11-20 10:44:53,262 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2022-11-20 10:44:53,263 INFO L138 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2022-11-20 10:44:53,263 INFO L138 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2022-11-20 10:44:53,263 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2022-11-20 10:44:53,263 INFO L138 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode WARNING: An illegal reflective access operation has occurred WARNING: Illegal reflective access by com.sun.xml.bind.v2.runtime.reflect.opt.Injector$1 (file:/tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_881119b7-e16e-4526-b171-3c068aa27f33/bin/uautomizer-ug76WZFUDN/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_881119b7-e16e-4526-b171-3c068aa27f33/bin/uautomizer-ug76WZFUDN 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 -> 7b0a21004c99a1cc1588d43a2481960a2ce9f2cdf68e9a363306433e7d24bd30 [2022-11-20 10:44:53,614 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2022-11-20 10:44:53,643 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2022-11-20 10:44:53,646 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2022-11-20 10:44:53,648 INFO L271 PluginConnector]: Initializing CDTParser... [2022-11-20 10:44:53,649 INFO L275 PluginConnector]: CDTParser initialized [2022-11-20 10:44:53,650 INFO L432 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_881119b7-e16e-4526-b171-3c068aa27f33/bin/uautomizer-ug76WZFUDN/../../sv-benchmarks/c/systemc/token_ring.01.cil-1.c [2022-11-20 10:44:56,916 INFO L500 CDTParser]: Created temporary CDT project at NULL [2022-11-20 10:44:57,262 INFO L351 CDTParser]: Found 1 translation units. [2022-11-20 10:44:57,266 INFO L172 CDTParser]: Scanning /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_881119b7-e16e-4526-b171-3c068aa27f33/sv-benchmarks/c/systemc/token_ring.01.cil-1.c [2022-11-20 10:44:57,282 INFO L394 CDTParser]: About to delete temporary CDT project at /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_881119b7-e16e-4526-b171-3c068aa27f33/bin/uautomizer-ug76WZFUDN/data/e21ec47fb/eb0425ed4c374657a3291aa9a9372b97/FLAG69ccc17e8 [2022-11-20 10:44:57,302 INFO L402 CDTParser]: Successfully deleted /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_881119b7-e16e-4526-b171-3c068aa27f33/bin/uautomizer-ug76WZFUDN/data/e21ec47fb/eb0425ed4c374657a3291aa9a9372b97 [2022-11-20 10:44:57,308 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2022-11-20 10:44:57,309 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2022-11-20 10:44:57,310 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2022-11-20 10:44:57,311 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2022-11-20 10:44:57,319 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2022-11-20 10:44:57,319 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 20.11 10:44:57" (1/1) ... [2022-11-20 10:44:57,321 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@6ba3cb33 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.11 10:44:57, skipping insertion in model container [2022-11-20 10:44:57,321 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 20.11 10:44:57" (1/1) ... [2022-11-20 10:44:57,332 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2022-11-20 10:44:57,372 INFO L178 MainTranslator]: Built tables and reachable declarations [2022-11-20 10:44:57,507 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_881119b7-e16e-4526-b171-3c068aa27f33/sv-benchmarks/c/systemc/token_ring.01.cil-1.c[671,684] [2022-11-20 10:44:57,556 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-11-20 10:44:57,568 INFO L203 MainTranslator]: Completed pre-run [2022-11-20 10:44:57,579 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_881119b7-e16e-4526-b171-3c068aa27f33/sv-benchmarks/c/systemc/token_ring.01.cil-1.c[671,684] [2022-11-20 10:44:57,605 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-11-20 10:44:57,622 INFO L208 MainTranslator]: Completed translation [2022-11-20 10:44:57,622 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.11 10:44:57 WrapperNode [2022-11-20 10:44:57,622 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2022-11-20 10:44:57,624 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2022-11-20 10:44:57,624 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2022-11-20 10:44:57,624 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2022-11-20 10:44:57,634 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.11 10:44:57" (1/1) ... [2022-11-20 10:44:57,643 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.11 10:44:57" (1/1) ... [2022-11-20 10:44:57,671 INFO L138 Inliner]: procedures = 30, calls = 34, calls flagged for inlining = 14, calls inlined = 14, statements flattened = 219 [2022-11-20 10:44:57,671 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2022-11-20 10:44:57,672 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2022-11-20 10:44:57,672 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2022-11-20 10:44:57,673 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2022-11-20 10:44:57,683 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.11 10:44:57" (1/1) ... [2022-11-20 10:44:57,683 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.11 10:44:57" (1/1) ... [2022-11-20 10:44:57,686 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.11 10:44:57" (1/1) ... [2022-11-20 10:44:57,686 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.11 10:44:57" (1/1) ... [2022-11-20 10:44:57,692 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.11 10:44:57" (1/1) ... [2022-11-20 10:44:57,699 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.11 10:44:57" (1/1) ... [2022-11-20 10:44:57,701 INFO L185 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.11 10:44:57" (1/1) ... [2022-11-20 10:44:57,703 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.11 10:44:57" (1/1) ... [2022-11-20 10:44:57,706 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2022-11-20 10:44:57,707 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2022-11-20 10:44:57,708 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2022-11-20 10:44:57,708 INFO L275 PluginConnector]: RCFGBuilder initialized [2022-11-20 10:44:57,709 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.11 10:44:57" (1/1) ... [2022-11-20 10:44:57,717 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-11-20 10:44:57,732 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_881119b7-e16e-4526-b171-3c068aa27f33/bin/uautomizer-ug76WZFUDN/z3 [2022-11-20 10:44:57,753 INFO L229 MonitoredProcess]: Starting monitored process 1 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_881119b7-e16e-4526-b171-3c068aa27f33/bin/uautomizer-ug76WZFUDN/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (exit command is (exit), workingDir is null) [2022-11-20 10:44:57,783 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_881119b7-e16e-4526-b171-3c068aa27f33/bin/uautomizer-ug76WZFUDN/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (1)] Waiting until timeout for monitored process [2022-11-20 10:44:57,813 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2022-11-20 10:44:57,813 INFO L130 BoogieDeclarations]: Found specification of procedure fire_delta_events [2022-11-20 10:44:57,814 INFO L138 BoogieDeclarations]: Found implementation of procedure fire_delta_events [2022-11-20 10:44:57,814 INFO L130 BoogieDeclarations]: Found specification of procedure activate_threads [2022-11-20 10:44:57,814 INFO L138 BoogieDeclarations]: Found implementation of procedure activate_threads [2022-11-20 10:44:57,816 INFO L130 BoogieDeclarations]: Found specification of procedure immediate_notify [2022-11-20 10:44:57,817 INFO L138 BoogieDeclarations]: Found implementation of procedure immediate_notify [2022-11-20 10:44:57,817 INFO L130 BoogieDeclarations]: Found specification of procedure exists_runnable_thread [2022-11-20 10:44:57,817 INFO L138 BoogieDeclarations]: Found implementation of procedure exists_runnable_thread [2022-11-20 10:44:57,818 INFO L130 BoogieDeclarations]: Found specification of procedure reset_delta_events [2022-11-20 10:44:57,818 INFO L138 BoogieDeclarations]: Found implementation of procedure reset_delta_events [2022-11-20 10:44:57,818 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2022-11-20 10:44:57,818 INFO L130 BoogieDeclarations]: Found specification of procedure update_channels [2022-11-20 10:44:57,819 INFO L138 BoogieDeclarations]: Found implementation of procedure update_channels [2022-11-20 10:44:57,819 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2022-11-20 10:44:57,819 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2022-11-20 10:44:57,956 INFO L235 CfgBuilder]: Building ICFG [2022-11-20 10:44:57,959 INFO L261 CfgBuilder]: Building CFG for each procedure with an implementation [2022-11-20 10:44:58,452 INFO L276 CfgBuilder]: Performing block encoding [2022-11-20 10:44:58,461 INFO L295 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2022-11-20 10:44:58,462 INFO L300 CfgBuilder]: Removed 4 assume(true) statements. [2022-11-20 10:44:58,464 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 20.11 10:44:58 BoogieIcfgContainer [2022-11-20 10:44:58,465 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2022-11-20 10:44:58,467 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2022-11-20 10:44:58,467 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2022-11-20 10:44:58,471 INFO L275 PluginConnector]: TraceAbstraction initialized [2022-11-20 10:44:58,472 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 20.11 10:44:57" (1/3) ... [2022-11-20 10:44:58,473 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@52c3ccd6 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 20.11 10:44:58, skipping insertion in model container [2022-11-20 10:44:58,473 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.11 10:44:57" (2/3) ... [2022-11-20 10:44:58,473 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@52c3ccd6 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 20.11 10:44:58, skipping insertion in model container [2022-11-20 10:44:58,474 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 20.11 10:44:58" (3/3) ... [2022-11-20 10:44:58,476 INFO L112 eAbstractionObserver]: Analyzing ICFG token_ring.01.cil-1.c [2022-11-20 10:44:58,499 INFO L203 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2022-11-20 10:44:58,499 INFO L162 ceAbstractionStarter]: Applying trace abstraction to program that has 4 error locations. [2022-11-20 10:44:58,563 INFO L356 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2022-11-20 10:44:58,572 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;@1aa345c8, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2022-11-20 10:44:58,572 INFO L358 AbstractCegarLoop]: Starting to check reachability of 4 error locations. [2022-11-20 10:44:58,578 INFO L276 IsEmpty]: Start isEmpty. Operand has 113 states, 87 states have (on average 1.5402298850574712) internal successors, (134), 92 states have internal predecessors, (134), 15 states have call successors, (15), 6 states have call predecessors, (15), 6 states have return successors, (15), 15 states have call predecessors, (15), 15 states have call successors, (15) [2022-11-20 10:44:58,588 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 56 [2022-11-20 10:44:58,588 INFO L187 NwaCegarLoop]: Found error trace [2022-11-20 10:44:58,589 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] [2022-11-20 10:44:58,589 INFO L420 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 1 more)] === [2022-11-20 10:44:58,595 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-20 10:44:58,595 INFO L85 PathProgramCache]: Analyzing trace with hash -1696984144, now seen corresponding path program 1 times [2022-11-20 10:44:58,605 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-20 10:44:58,606 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1497771321] [2022-11-20 10:44:58,606 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-20 10:44:58,607 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-20 10:44:58,748 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-20 10:44:58,960 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2022-11-20 10:44:58,963 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-20 10:44:58,996 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2022-11-20 10:44:59,003 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-20 10:44:59,062 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 17 [2022-11-20 10:44:59,101 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-20 10:44:59,110 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 32 [2022-11-20 10:44:59,115 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-20 10:44:59,120 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 42 [2022-11-20 10:44:59,124 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-20 10:44:59,129 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-11-20 10:44:59,129 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-20 10:44:59,130 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1497771321] [2022-11-20 10:44:59,130 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1497771321] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-20 10:44:59,131 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-20 10:44:59,131 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2022-11-20 10:44:59,133 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [218613524] [2022-11-20 10:44:59,134 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-20 10:44:59,139 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2022-11-20 10:44:59,139 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-20 10:44:59,174 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2022-11-20 10:44:59,175 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2022-11-20 10:44:59,178 INFO L87 Difference]: Start difference. First operand has 113 states, 87 states have (on average 1.5402298850574712) internal successors, (134), 92 states have internal predecessors, (134), 15 states have call successors, (15), 6 states have call predecessors, (15), 6 states have return successors, (15), 15 states have call predecessors, (15), 15 states have call successors, (15) Second operand has 6 states, 6 states have (on average 7.5) internal successors, (45), 4 states have internal predecessors, (45), 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-11-20 10:45:00,267 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-20 10:45:00,267 INFO L93 Difference]: Finished difference Result 357 states and 529 transitions. [2022-11-20 10:45:00,269 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2022-11-20 10:45:00,271 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 7.5) internal successors, (45), 4 states have internal predecessors, (45), 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 55 [2022-11-20 10:45:00,271 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-20 10:45:00,287 INFO L225 Difference]: With dead ends: 357 [2022-11-20 10:45:00,287 INFO L226 Difference]: Without dead ends: 243 [2022-11-20 10:45:00,292 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-11-20 10:45:00,295 INFO L413 NwaCegarLoop]: 121 mSDtfsCounter, 307 mSDsluCounter, 305 mSDsCounter, 0 mSdLazyCounter, 462 mSolverCounterSat, 64 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.6s Time, 0 mProtectedPredicate, 0 mProtectedAction, 315 SdHoareTripleChecker+Valid, 426 SdHoareTripleChecker+Invalid, 526 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 64 IncrementalHoareTripleChecker+Valid, 462 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.8s IncrementalHoareTripleChecker+Time [2022-11-20 10:45:00,297 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [315 Valid, 426 Invalid, 526 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [64 Valid, 462 Invalid, 0 Unknown, 0 Unchecked, 0.8s Time] [2022-11-20 10:45:00,318 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 243 states. [2022-11-20 10:45:00,412 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 243 to 200. [2022-11-20 10:45:00,416 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 200 states, 158 states have (on average 1.4556962025316456) internal successors, (230), 163 states have internal predecessors, (230), 25 states have call successors, (25), 12 states have call predecessors, (25), 13 states have return successors, (28), 25 states have call predecessors, (28), 25 states have call successors, (28) [2022-11-20 10:45:00,423 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 200 states to 200 states and 283 transitions. [2022-11-20 10:45:00,424 INFO L78 Accepts]: Start accepts. Automaton has 200 states and 283 transitions. Word has length 55 [2022-11-20 10:45:00,425 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-20 10:45:00,426 INFO L495 AbstractCegarLoop]: Abstraction has 200 states and 283 transitions. [2022-11-20 10:45:00,427 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 7.5) internal successors, (45), 4 states have internal predecessors, (45), 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-11-20 10:45:00,427 INFO L276 IsEmpty]: Start isEmpty. Operand 200 states and 283 transitions. [2022-11-20 10:45:00,430 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 56 [2022-11-20 10:45:00,430 INFO L187 NwaCegarLoop]: Found error trace [2022-11-20 10:45:00,431 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] [2022-11-20 10:45:00,431 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2022-11-20 10:45:00,432 INFO L420 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 1 more)] === [2022-11-20 10:45:00,434 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-20 10:45:00,434 INFO L85 PathProgramCache]: Analyzing trace with hash 767450028, now seen corresponding path program 1 times [2022-11-20 10:45:00,434 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-20 10:45:00,435 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1791674014] [2022-11-20 10:45:00,435 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-20 10:45:00,436 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-20 10:45:00,476 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-20 10:45:00,635 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2022-11-20 10:45:00,637 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-20 10:45:00,657 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2022-11-20 10:45:00,660 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-20 10:45:00,744 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 17 [2022-11-20 10:45:00,755 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-20 10:45:00,771 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 32 [2022-11-20 10:45:00,774 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-20 10:45:00,777 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 42 [2022-11-20 10:45:00,786 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-20 10:45:00,789 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-11-20 10:45:00,789 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-20 10:45:00,790 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1791674014] [2022-11-20 10:45:00,790 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1791674014] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-20 10:45:00,790 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-20 10:45:00,790 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2022-11-20 10:45:00,791 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1701942120] [2022-11-20 10:45:00,791 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-20 10:45:00,793 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2022-11-20 10:45:00,793 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-20 10:45:00,793 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2022-11-20 10:45:00,794 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2022-11-20 10:45:00,794 INFO L87 Difference]: Start difference. First operand 200 states and 283 transitions. Second operand has 7 states, 7 states have (on average 6.428571428571429) internal successors, (45), 5 states have internal predecessors, (45), 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-11-20 10:45:01,688 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-20 10:45:01,689 INFO L93 Difference]: Finished difference Result 545 states and 773 transitions. [2022-11-20 10:45:01,689 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2022-11-20 10:45:01,690 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 6.428571428571429) internal successors, (45), 5 states have internal predecessors, (45), 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 55 [2022-11-20 10:45:01,690 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-20 10:45:01,693 INFO L225 Difference]: With dead ends: 545 [2022-11-20 10:45:01,694 INFO L226 Difference]: Without dead ends: 354 [2022-11-20 10:45:01,696 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 27 GetRequests, 13 SyntacticMatches, 0 SemanticMatches, 14 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 37 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=66, Invalid=174, Unknown=0, NotChecked=0, Total=240 [2022-11-20 10:45:01,697 INFO L413 NwaCegarLoop]: 166 mSDtfsCounter, 291 mSDsluCounter, 512 mSDsCounter, 0 mSdLazyCounter, 698 mSolverCounterSat, 41 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.6s Time, 0 mProtectedPredicate, 0 mProtectedAction, 299 SdHoareTripleChecker+Valid, 678 SdHoareTripleChecker+Invalid, 739 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 41 IncrementalHoareTripleChecker+Valid, 698 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.7s IncrementalHoareTripleChecker+Time [2022-11-20 10:45:01,698 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [299 Valid, 678 Invalid, 739 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [41 Valid, 698 Invalid, 0 Unknown, 0 Unchecked, 0.7s Time] [2022-11-20 10:45:01,699 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 354 states. [2022-11-20 10:45:01,750 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 354 to 288. [2022-11-20 10:45:01,751 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 288 states, 229 states have (on average 1.445414847161572) internal successors, (331), 235 states have internal predecessors, (331), 35 states have call successors, (35), 18 states have call predecessors, (35), 20 states have return successors, (40), 36 states have call predecessors, (40), 35 states have call successors, (40) [2022-11-20 10:45:01,753 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 288 states to 288 states and 406 transitions. [2022-11-20 10:45:01,754 INFO L78 Accepts]: Start accepts. Automaton has 288 states and 406 transitions. Word has length 55 [2022-11-20 10:45:01,754 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-20 10:45:01,754 INFO L495 AbstractCegarLoop]: Abstraction has 288 states and 406 transitions. [2022-11-20 10:45:01,755 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 6.428571428571429) internal successors, (45), 5 states have internal predecessors, (45), 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-11-20 10:45:01,755 INFO L276 IsEmpty]: Start isEmpty. Operand 288 states and 406 transitions. [2022-11-20 10:45:01,757 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 56 [2022-11-20 10:45:01,757 INFO L187 NwaCegarLoop]: Found error trace [2022-11-20 10:45:01,757 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] [2022-11-20 10:45:01,757 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2022-11-20 10:45:01,758 INFO L420 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 1 more)] === [2022-11-20 10:45:01,758 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-20 10:45:01,758 INFO L85 PathProgramCache]: Analyzing trace with hash -129943250, now seen corresponding path program 1 times [2022-11-20 10:45:01,759 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-20 10:45:01,759 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1869229706] [2022-11-20 10:45:01,759 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-20 10:45:01,760 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-20 10:45:01,772 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-20 10:45:01,841 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2022-11-20 10:45:01,843 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-20 10:45:01,855 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2022-11-20 10:45:01,858 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-20 10:45:01,904 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 17 [2022-11-20 10:45:01,908 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-20 10:45:01,913 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 32 [2022-11-20 10:45:01,916 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-20 10:45:01,919 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 42 [2022-11-20 10:45:01,921 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-20 10:45:01,923 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-11-20 10:45:01,924 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-20 10:45:01,924 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1869229706] [2022-11-20 10:45:01,925 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1869229706] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-20 10:45:01,925 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-20 10:45:01,925 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2022-11-20 10:45:01,926 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [226992747] [2022-11-20 10:45:01,926 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-20 10:45:01,926 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2022-11-20 10:45:01,927 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-20 10:45:01,927 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2022-11-20 10:45:01,928 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2022-11-20 10:45:01,928 INFO L87 Difference]: Start difference. First operand 288 states and 406 transitions. Second operand has 7 states, 7 states have (on average 6.428571428571429) internal successors, (45), 5 states have internal predecessors, (45), 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-11-20 10:45:02,847 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-20 10:45:02,848 INFO L93 Difference]: Finished difference Result 890 states and 1258 transitions. [2022-11-20 10:45:02,848 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2022-11-20 10:45:02,849 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 6.428571428571429) internal successors, (45), 5 states have internal predecessors, (45), 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 55 [2022-11-20 10:45:02,850 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-20 10:45:02,856 INFO L225 Difference]: With dead ends: 890 [2022-11-20 10:45:02,857 INFO L226 Difference]: Without dead ends: 611 [2022-11-20 10:45:02,866 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 30 GetRequests, 15 SyntacticMatches, 0 SemanticMatches, 15 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 46 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=73, Invalid=199, Unknown=0, NotChecked=0, Total=272 [2022-11-20 10:45:02,870 INFO L413 NwaCegarLoop]: 162 mSDtfsCounter, 346 mSDsluCounter, 504 mSDsCounter, 0 mSdLazyCounter, 687 mSolverCounterSat, 48 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 356 SdHoareTripleChecker+Valid, 666 SdHoareTripleChecker+Invalid, 735 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 48 IncrementalHoareTripleChecker+Valid, 687 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.6s IncrementalHoareTripleChecker+Time [2022-11-20 10:45:02,871 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [356 Valid, 666 Invalid, 735 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [48 Valid, 687 Invalid, 0 Unknown, 0 Unchecked, 0.6s Time] [2022-11-20 10:45:02,874 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 611 states. [2022-11-20 10:45:02,941 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 611 to 457. [2022-11-20 10:45:02,943 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 457 states, 366 states have (on average 1.4316939890710383) internal successors, (524), 374 states have internal predecessors, (524), 53 states have call successors, (53), 30 states have call predecessors, (53), 34 states have return successors, (66), 56 states have call predecessors, (66), 53 states have call successors, (66) [2022-11-20 10:45:02,948 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 457 states to 457 states and 643 transitions. [2022-11-20 10:45:02,949 INFO L78 Accepts]: Start accepts. Automaton has 457 states and 643 transitions. Word has length 55 [2022-11-20 10:45:02,949 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-20 10:45:02,949 INFO L495 AbstractCegarLoop]: Abstraction has 457 states and 643 transitions. [2022-11-20 10:45:02,950 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 6.428571428571429) internal successors, (45), 5 states have internal predecessors, (45), 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-11-20 10:45:02,950 INFO L276 IsEmpty]: Start isEmpty. Operand 457 states and 643 transitions. [2022-11-20 10:45:02,961 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 56 [2022-11-20 10:45:02,961 INFO L187 NwaCegarLoop]: Found error trace [2022-11-20 10:45:02,961 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-20 10:45:02,962 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2022-11-20 10:45:02,962 INFO L420 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 1 more)] === [2022-11-20 10:45:02,963 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-20 10:45:02,963 INFO L85 PathProgramCache]: Analyzing trace with hash 118203244, now seen corresponding path program 1 times [2022-11-20 10:45:02,964 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-20 10:45:02,964 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1770055637] [2022-11-20 10:45:02,964 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-20 10:45:02,964 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-20 10:45:02,989 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-20 10:45:03,101 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2022-11-20 10:45:03,102 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-20 10:45:03,114 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2022-11-20 10:45:03,117 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-20 10:45:03,163 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 17 [2022-11-20 10:45:03,168 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-20 10:45:03,177 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 32 [2022-11-20 10:45:03,181 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-20 10:45:03,184 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 42 [2022-11-20 10:45:03,185 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-20 10:45:03,190 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-11-20 10:45:03,191 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-20 10:45:03,191 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1770055637] [2022-11-20 10:45:03,191 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1770055637] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-20 10:45:03,193 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-20 10:45:03,193 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2022-11-20 10:45:03,193 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [843116409] [2022-11-20 10:45:03,194 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-20 10:45:03,195 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2022-11-20 10:45:03,196 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-20 10:45:03,197 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2022-11-20 10:45:03,197 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2022-11-20 10:45:03,197 INFO L87 Difference]: Start difference. First operand 457 states and 643 transitions. Second operand has 7 states, 7 states have (on average 6.428571428571429) internal successors, (45), 5 states have internal predecessors, (45), 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-11-20 10:45:04,123 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-20 10:45:04,124 INFO L93 Difference]: Finished difference Result 1424 states and 2007 transitions. [2022-11-20 10:45:04,124 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2022-11-20 10:45:04,125 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 6.428571428571429) internal successors, (45), 5 states have internal predecessors, (45), 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 55 [2022-11-20 10:45:04,125 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-20 10:45:04,131 INFO L225 Difference]: With dead ends: 1424 [2022-11-20 10:45:04,131 INFO L226 Difference]: Without dead ends: 976 [2022-11-20 10:45:04,133 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 30 GetRequests, 15 SyntacticMatches, 0 SemanticMatches, 15 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 43 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=73, Invalid=199, Unknown=0, NotChecked=0, Total=272 [2022-11-20 10:45:04,135 INFO L413 NwaCegarLoop]: 154 mSDtfsCounter, 286 mSDsluCounter, 486 mSDsCounter, 0 mSdLazyCounter, 733 mSolverCounterSat, 51 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 293 SdHoareTripleChecker+Valid, 640 SdHoareTripleChecker+Invalid, 784 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 51 IncrementalHoareTripleChecker+Valid, 733 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.6s IncrementalHoareTripleChecker+Time [2022-11-20 10:45:04,136 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [293 Valid, 640 Invalid, 784 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [51 Valid, 733 Invalid, 0 Unknown, 0 Unchecked, 0.6s Time] [2022-11-20 10:45:04,137 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 976 states. [2022-11-20 10:45:04,207 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 976 to 758. [2022-11-20 10:45:04,209 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 758 states, 609 states have (on average 1.4220032840722496) internal successors, (866), 621 states have internal predecessors, (866), 85 states have call successors, (85), 52 states have call predecessors, (85), 60 states have return successors, (120), 92 states have call predecessors, (120), 85 states have call successors, (120) [2022-11-20 10:45:04,214 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 758 states to 758 states and 1071 transitions. [2022-11-20 10:45:04,214 INFO L78 Accepts]: Start accepts. Automaton has 758 states and 1071 transitions. Word has length 55 [2022-11-20 10:45:04,215 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-20 10:45:04,215 INFO L495 AbstractCegarLoop]: Abstraction has 758 states and 1071 transitions. [2022-11-20 10:45:04,215 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 6.428571428571429) internal successors, (45), 5 states have internal predecessors, (45), 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-11-20 10:45:04,216 INFO L276 IsEmpty]: Start isEmpty. Operand 758 states and 1071 transitions. [2022-11-20 10:45:04,217 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 56 [2022-11-20 10:45:04,217 INFO L187 NwaCegarLoop]: Found error trace [2022-11-20 10:45:04,218 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] [2022-11-20 10:45:04,218 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2022-11-20 10:45:04,218 INFO L420 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 1 more)] === [2022-11-20 10:45:04,219 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-20 10:45:04,219 INFO L85 PathProgramCache]: Analyzing trace with hash 541849966, now seen corresponding path program 1 times [2022-11-20 10:45:04,219 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-20 10:45:04,220 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1743211462] [2022-11-20 10:45:04,220 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-20 10:45:04,220 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-20 10:45:04,229 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-20 10:45:04,253 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2022-11-20 10:45:04,255 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-20 10:45:04,267 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2022-11-20 10:45:04,269 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-20 10:45:04,280 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 17 [2022-11-20 10:45:04,284 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-20 10:45:04,326 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 32 [2022-11-20 10:45:04,328 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-20 10:45:04,331 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 42 [2022-11-20 10:45:04,333 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-20 10:45:04,335 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-11-20 10:45:04,336 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-20 10:45:04,336 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1743211462] [2022-11-20 10:45:04,337 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1743211462] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-20 10:45:04,337 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-20 10:45:04,337 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2022-11-20 10:45:04,337 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [517128730] [2022-11-20 10:45:04,338 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-20 10:45:04,338 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2022-11-20 10:45:04,338 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-20 10:45:04,339 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2022-11-20 10:45:04,339 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2022-11-20 10:45:04,340 INFO L87 Difference]: Start difference. First operand 758 states and 1071 transitions. Second operand has 6 states, 6 states have (on average 7.5) internal successors, (45), 4 states have internal predecessors, (45), 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-11-20 10:45:05,128 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-20 10:45:05,128 INFO L93 Difference]: Finished difference Result 2117 states and 3003 transitions. [2022-11-20 10:45:05,129 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2022-11-20 10:45:05,129 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 7.5) internal successors, (45), 4 states have internal predecessors, (45), 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 55 [2022-11-20 10:45:05,129 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-20 10:45:05,137 INFO L225 Difference]: With dead ends: 2117 [2022-11-20 10:45:05,137 INFO L226 Difference]: Without dead ends: 1369 [2022-11-20 10:45:05,140 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-11-20 10:45:05,141 INFO L413 NwaCegarLoop]: 180 mSDtfsCounter, 407 mSDsluCounter, 306 mSDsCounter, 0 mSdLazyCounter, 552 mSolverCounterSat, 63 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 430 SdHoareTripleChecker+Valid, 486 SdHoareTripleChecker+Invalid, 615 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 63 IncrementalHoareTripleChecker+Valid, 552 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.6s IncrementalHoareTripleChecker+Time [2022-11-20 10:45:05,142 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [430 Valid, 486 Invalid, 615 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [63 Valid, 552 Invalid, 0 Unknown, 0 Unchecked, 0.6s Time] [2022-11-20 10:45:05,144 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1369 states. [2022-11-20 10:45:05,249 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1369 to 1162. [2022-11-20 10:45:05,251 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1162 states, 930 states have (on average 1.3989247311827957) internal successors, (1301), 951 states have internal predecessors, (1301), 134 states have call successors, (134), 82 states have call predecessors, (134), 94 states have return successors, (179), 136 states have call predecessors, (179), 134 states have call successors, (179) [2022-11-20 10:45:05,258 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1162 states to 1162 states and 1614 transitions. [2022-11-20 10:45:05,259 INFO L78 Accepts]: Start accepts. Automaton has 1162 states and 1614 transitions. Word has length 55 [2022-11-20 10:45:05,259 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-20 10:45:05,259 INFO L495 AbstractCegarLoop]: Abstraction has 1162 states and 1614 transitions. [2022-11-20 10:45:05,259 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 7.5) internal successors, (45), 4 states have internal predecessors, (45), 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-11-20 10:45:05,260 INFO L276 IsEmpty]: Start isEmpty. Operand 1162 states and 1614 transitions. [2022-11-20 10:45:05,261 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 57 [2022-11-20 10:45:05,261 INFO L187 NwaCegarLoop]: Found error trace [2022-11-20 10:45:05,262 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] [2022-11-20 10:45:05,262 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2022-11-20 10:45:05,262 INFO L420 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 1 more)] === [2022-11-20 10:45:05,263 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-20 10:45:05,263 INFO L85 PathProgramCache]: Analyzing trace with hash -2042576822, now seen corresponding path program 1 times [2022-11-20 10:45:05,263 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-20 10:45:05,263 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [304853231] [2022-11-20 10:45:05,264 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-20 10:45:05,264 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-20 10:45:05,302 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-20 10:45:05,333 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2022-11-20 10:45:05,334 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-20 10:45:05,342 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2022-11-20 10:45:05,344 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-20 10:45:05,352 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 17 [2022-11-20 10:45:05,355 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-20 10:45:05,409 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 32 [2022-11-20 10:45:05,411 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-20 10:45:05,414 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 42 [2022-11-20 10:45:05,415 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-20 10:45:05,417 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-11-20 10:45:05,418 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-20 10:45:05,418 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [304853231] [2022-11-20 10:45:05,418 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [304853231] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-20 10:45:05,418 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-20 10:45:05,419 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2022-11-20 10:45:05,419 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [426743735] [2022-11-20 10:45:05,419 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-20 10:45:05,419 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2022-11-20 10:45:05,420 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-20 10:45:05,420 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2022-11-20 10:45:05,420 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2022-11-20 10:45:05,421 INFO L87 Difference]: Start difference. First operand 1162 states and 1614 transitions. Second operand has 7 states, 7 states have (on average 6.571428571428571) internal successors, (46), 5 states have internal predecessors, (46), 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-11-20 10:45:06,075 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-20 10:45:06,075 INFO L93 Difference]: Finished difference Result 2531 states and 3569 transitions. [2022-11-20 10:45:06,076 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2022-11-20 10:45:06,076 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 6.571428571428571) internal successors, (46), 5 states have internal predecessors, (46), 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 56 [2022-11-20 10:45:06,077 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-20 10:45:06,084 INFO L225 Difference]: With dead ends: 2531 [2022-11-20 10:45:06,084 INFO L226 Difference]: Without dead ends: 1379 [2022-11-20 10:45:06,088 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 24 GetRequests, 12 SyntacticMatches, 0 SemanticMatches, 12 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 14 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=60, Invalid=122, Unknown=0, NotChecked=0, Total=182 [2022-11-20 10:45:06,089 INFO L413 NwaCegarLoop]: 106 mSDtfsCounter, 170 mSDsluCounter, 370 mSDsCounter, 0 mSdLazyCounter, 425 mSolverCounterSat, 33 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 170 SdHoareTripleChecker+Valid, 476 SdHoareTripleChecker+Invalid, 458 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 33 IncrementalHoareTripleChecker+Valid, 425 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2022-11-20 10:45:06,089 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [170 Valid, 476 Invalid, 458 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [33 Valid, 425 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time] [2022-11-20 10:45:06,091 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1379 states. [2022-11-20 10:45:06,233 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1379 to 1177. [2022-11-20 10:45:06,235 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1177 states, 945 states have (on average 1.3830687830687831) internal successors, (1307), 966 states have internal predecessors, (1307), 134 states have call successors, (134), 82 states have call predecessors, (134), 94 states have return successors, (179), 136 states have call predecessors, (179), 134 states have call successors, (179) [2022-11-20 10:45:06,241 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1177 states to 1177 states and 1620 transitions. [2022-11-20 10:45:06,242 INFO L78 Accepts]: Start accepts. Automaton has 1177 states and 1620 transitions. Word has length 56 [2022-11-20 10:45:06,244 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-20 10:45:06,245 INFO L495 AbstractCegarLoop]: Abstraction has 1177 states and 1620 transitions. [2022-11-20 10:45:06,245 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 6.571428571428571) internal successors, (46), 5 states have internal predecessors, (46), 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-11-20 10:45:06,245 INFO L276 IsEmpty]: Start isEmpty. Operand 1177 states and 1620 transitions. [2022-11-20 10:45:06,247 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 57 [2022-11-20 10:45:06,248 INFO L187 NwaCegarLoop]: Found error trace [2022-11-20 10:45:06,248 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] [2022-11-20 10:45:06,249 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2022-11-20 10:45:06,249 INFO L420 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 1 more)] === [2022-11-20 10:45:06,249 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-20 10:45:06,250 INFO L85 PathProgramCache]: Analyzing trace with hash -2114963380, now seen corresponding path program 1 times [2022-11-20 10:45:06,250 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-20 10:45:06,250 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1684722449] [2022-11-20 10:45:06,253 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-20 10:45:06,254 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-20 10:45:06,264 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-20 10:45:06,305 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2022-11-20 10:45:06,306 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-20 10:45:06,316 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2022-11-20 10:45:06,317 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-20 10:45:06,326 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 17 [2022-11-20 10:45:06,330 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-20 10:45:06,395 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 32 [2022-11-20 10:45:06,397 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-20 10:45:06,400 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 42 [2022-11-20 10:45:06,401 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-20 10:45:06,403 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-11-20 10:45:06,404 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-20 10:45:06,404 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1684722449] [2022-11-20 10:45:06,404 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1684722449] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-20 10:45:06,404 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-20 10:45:06,405 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2022-11-20 10:45:06,405 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [251838546] [2022-11-20 10:45:06,405 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-20 10:45:06,406 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2022-11-20 10:45:06,406 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-20 10:45:06,406 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2022-11-20 10:45:06,407 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2022-11-20 10:45:06,407 INFO L87 Difference]: Start difference. First operand 1177 states and 1620 transitions. Second operand has 7 states, 7 states have (on average 6.571428571428571) internal successors, (46), 5 states have internal predecessors, (46), 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-11-20 10:45:07,105 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-20 10:45:07,105 INFO L93 Difference]: Finished difference Result 2586 states and 3614 transitions. [2022-11-20 10:45:07,106 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2022-11-20 10:45:07,106 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 6.571428571428571) internal successors, (46), 5 states have internal predecessors, (46), 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 56 [2022-11-20 10:45:07,106 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-20 10:45:07,115 INFO L225 Difference]: With dead ends: 2586 [2022-11-20 10:45:07,116 INFO L226 Difference]: Without dead ends: 1419 [2022-11-20 10:45:07,120 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 26 GetRequests, 12 SyntacticMatches, 0 SemanticMatches, 14 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 29 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=77, Invalid=163, Unknown=0, NotChecked=0, Total=240 [2022-11-20 10:45:07,122 INFO L413 NwaCegarLoop]: 101 mSDtfsCounter, 135 mSDsluCounter, 370 mSDsCounter, 0 mSdLazyCounter, 371 mSolverCounterSat, 34 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 135 SdHoareTripleChecker+Valid, 471 SdHoareTripleChecker+Invalid, 405 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 34 IncrementalHoareTripleChecker+Valid, 371 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2022-11-20 10:45:07,123 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [135 Valid, 471 Invalid, 405 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [34 Valid, 371 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time] [2022-11-20 10:45:07,127 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1419 states. [2022-11-20 10:45:07,267 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1419 to 1219. [2022-11-20 10:45:07,270 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1219 states, 987 states have (on average 1.3667679837892603) internal successors, (1349), 1008 states have internal predecessors, (1349), 134 states have call successors, (134), 82 states have call predecessors, (134), 94 states have return successors, (179), 136 states have call predecessors, (179), 134 states have call successors, (179) [2022-11-20 10:45:07,277 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1219 states to 1219 states and 1662 transitions. [2022-11-20 10:45:07,278 INFO L78 Accepts]: Start accepts. Automaton has 1219 states and 1662 transitions. Word has length 56 [2022-11-20 10:45:07,278 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-20 10:45:07,279 INFO L495 AbstractCegarLoop]: Abstraction has 1219 states and 1662 transitions. [2022-11-20 10:45:07,279 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 6.571428571428571) internal successors, (46), 5 states have internal predecessors, (46), 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-11-20 10:45:07,279 INFO L276 IsEmpty]: Start isEmpty. Operand 1219 states and 1662 transitions. [2022-11-20 10:45:07,280 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 57 [2022-11-20 10:45:07,281 INFO L187 NwaCegarLoop]: Found error trace [2022-11-20 10:45:07,281 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] [2022-11-20 10:45:07,281 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2022-11-20 10:45:07,282 INFO L420 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 1 more)] === [2022-11-20 10:45:07,282 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-20 10:45:07,282 INFO L85 PathProgramCache]: Analyzing trace with hash -191735346, now seen corresponding path program 1 times [2022-11-20 10:45:07,283 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-20 10:45:07,283 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1511095099] [2022-11-20 10:45:07,283 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-20 10:45:07,283 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-20 10:45:07,292 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-20 10:45:07,357 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2022-11-20 10:45:07,358 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-20 10:45:07,372 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2022-11-20 10:45:07,373 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-20 10:45:07,404 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 17 [2022-11-20 10:45:07,407 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-20 10:45:07,419 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 32 [2022-11-20 10:45:07,421 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-20 10:45:07,473 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 42 [2022-11-20 10:45:07,474 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-20 10:45:07,476 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-11-20 10:45:07,476 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-20 10:45:07,477 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1511095099] [2022-11-20 10:45:07,477 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1511095099] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-20 10:45:07,477 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-20 10:45:07,477 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2022-11-20 10:45:07,477 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2005884912] [2022-11-20 10:45:07,478 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-20 10:45:07,478 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2022-11-20 10:45:07,478 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-20 10:45:07,479 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2022-11-20 10:45:07,479 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=14, Invalid=42, Unknown=0, NotChecked=0, Total=56 [2022-11-20 10:45:07,479 INFO L87 Difference]: Start difference. First operand 1219 states and 1662 transitions. Second operand has 8 states, 8 states have (on average 5.75) internal successors, (46), 6 states have internal predecessors, (46), 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-11-20 10:45:08,256 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-20 10:45:08,256 INFO L93 Difference]: Finished difference Result 1767 states and 2410 transitions. [2022-11-20 10:45:08,257 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 16 states. [2022-11-20 10:45:08,257 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 8 states have (on average 5.75) internal successors, (46), 6 states have internal predecessors, (46), 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 56 [2022-11-20 10:45:08,258 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-20 10:45:08,264 INFO L225 Difference]: With dead ends: 1767 [2022-11-20 10:45:08,264 INFO L226 Difference]: Without dead ends: 1048 [2022-11-20 10:45:08,267 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 28 GetRequests, 11 SyntacticMatches, 0 SemanticMatches, 17 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 56 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=96, Invalid=246, Unknown=0, NotChecked=0, Total=342 [2022-11-20 10:45:08,269 INFO L413 NwaCegarLoop]: 106 mSDtfsCounter, 453 mSDsluCounter, 353 mSDsCounter, 0 mSdLazyCounter, 505 mSolverCounterSat, 91 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 463 SdHoareTripleChecker+Valid, 459 SdHoareTripleChecker+Invalid, 596 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 91 IncrementalHoareTripleChecker+Valid, 505 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.5s IncrementalHoareTripleChecker+Time [2022-11-20 10:45:08,271 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [463 Valid, 459 Invalid, 596 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [91 Valid, 505 Invalid, 0 Unknown, 0 Unchecked, 0.5s Time] [2022-11-20 10:45:08,273 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1048 states. [2022-11-20 10:45:08,372 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1048 to 878. [2022-11-20 10:45:08,374 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 878 states, 709 states have (on average 1.3540197461212975) internal successors, (960), 723 states have internal predecessors, (960), 100 states have call successors, (100), 59 states have call predecessors, (100), 65 states have return successors, (115), 99 states have call predecessors, (115), 100 states have call successors, (115) [2022-11-20 10:45:08,383 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 878 states to 878 states and 1175 transitions. [2022-11-20 10:45:08,383 INFO L78 Accepts]: Start accepts. Automaton has 878 states and 1175 transitions. Word has length 56 [2022-11-20 10:45:08,383 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-20 10:45:08,384 INFO L495 AbstractCegarLoop]: Abstraction has 878 states and 1175 transitions. [2022-11-20 10:45:08,384 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 5.75) internal successors, (46), 6 states have internal predecessors, (46), 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-11-20 10:45:08,384 INFO L276 IsEmpty]: Start isEmpty. Operand 878 states and 1175 transitions. [2022-11-20 10:45:08,385 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 57 [2022-11-20 10:45:08,385 INFO L187 NwaCegarLoop]: Found error trace [2022-11-20 10:45:08,385 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] [2022-11-20 10:45:08,386 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2022-11-20 10:45:08,387 INFO L420 AbstractCegarLoop]: === Iteration 9 === Targeting ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 1 more)] === [2022-11-20 10:45:08,389 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-20 10:45:08,389 INFO L85 PathProgramCache]: Analyzing trace with hash 27119372, now seen corresponding path program 1 times [2022-11-20 10:45:08,389 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-20 10:45:08,390 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1610899894] [2022-11-20 10:45:08,390 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-20 10:45:08,390 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-20 10:45:08,404 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-20 10:45:08,493 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2022-11-20 10:45:08,495 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-20 10:45:08,507 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2022-11-20 10:45:08,509 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-20 10:45:08,537 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 17 [2022-11-20 10:45:08,545 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-20 10:45:08,550 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 32 [2022-11-20 10:45:08,552 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-20 10:45:08,580 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 42 [2022-11-20 10:45:08,581 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-20 10:45:08,583 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-11-20 10:45:08,583 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-20 10:45:08,583 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1610899894] [2022-11-20 10:45:08,583 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1610899894] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-20 10:45:08,584 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-20 10:45:08,584 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2022-11-20 10:45:08,584 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2061689805] [2022-11-20 10:45:08,584 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-20 10:45:08,585 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2022-11-20 10:45:08,585 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-20 10:45:08,585 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2022-11-20 10:45:08,586 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=14, Invalid=42, Unknown=0, NotChecked=0, Total=56 [2022-11-20 10:45:08,586 INFO L87 Difference]: Start difference. First operand 878 states and 1175 transitions. Second operand has 8 states, 8 states have (on average 5.75) internal successors, (46), 6 states have internal predecessors, (46), 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-11-20 10:45:09,481 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-20 10:45:09,482 INFO L93 Difference]: Finished difference Result 1710 states and 2296 transitions. [2022-11-20 10:45:09,482 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 17 states. [2022-11-20 10:45:09,482 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 8 states have (on average 5.75) internal successors, (46), 6 states have internal predecessors, (46), 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 56 [2022-11-20 10:45:09,483 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-20 10:45:09,488 INFO L225 Difference]: With dead ends: 1710 [2022-11-20 10:45:09,489 INFO L226 Difference]: Without dead ends: 1076 [2022-11-20 10:45:09,491 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 31 GetRequests, 13 SyntacticMatches, 0 SemanticMatches, 18 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 68 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=104, Invalid=276, Unknown=0, NotChecked=0, Total=380 [2022-11-20 10:45:09,491 INFO L413 NwaCegarLoop]: 107 mSDtfsCounter, 438 mSDsluCounter, 347 mSDsCounter, 0 mSdLazyCounter, 561 mSolverCounterSat, 91 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 446 SdHoareTripleChecker+Valid, 454 SdHoareTripleChecker+Invalid, 652 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 91 IncrementalHoareTripleChecker+Valid, 561 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.6s IncrementalHoareTripleChecker+Time [2022-11-20 10:45:09,492 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [446 Valid, 454 Invalid, 652 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [91 Valid, 561 Invalid, 0 Unknown, 0 Unchecked, 0.6s Time] [2022-11-20 10:45:09,494 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1076 states. [2022-11-20 10:45:09,568 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1076 to 872. [2022-11-20 10:45:09,570 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 872 states, 705 states have (on average 1.348936170212766) internal successors, (951), 717 states have internal predecessors, (951), 100 states have call successors, (100), 59 states have call predecessors, (100), 63 states have return successors, (107), 97 states have call predecessors, (107), 100 states have call successors, (107) [2022-11-20 10:45:09,575 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 872 states to 872 states and 1158 transitions. [2022-11-20 10:45:09,575 INFO L78 Accepts]: Start accepts. Automaton has 872 states and 1158 transitions. Word has length 56 [2022-11-20 10:45:09,576 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-20 10:45:09,576 INFO L495 AbstractCegarLoop]: Abstraction has 872 states and 1158 transitions. [2022-11-20 10:45:09,576 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 5.75) internal successors, (46), 6 states have internal predecessors, (46), 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-11-20 10:45:09,577 INFO L276 IsEmpty]: Start isEmpty. Operand 872 states and 1158 transitions. [2022-11-20 10:45:09,577 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 57 [2022-11-20 10:45:09,578 INFO L187 NwaCegarLoop]: Found error trace [2022-11-20 10:45:09,578 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] [2022-11-20 10:45:09,578 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2022-11-20 10:45:09,578 INFO L420 AbstractCegarLoop]: === Iteration 10 === Targeting ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 1 more)] === [2022-11-20 10:45:09,579 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-20 10:45:09,579 INFO L85 PathProgramCache]: Analyzing trace with hash 449821198, now seen corresponding path program 1 times [2022-11-20 10:45:09,579 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-20 10:45:09,579 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2125680002] [2022-11-20 10:45:09,580 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-20 10:45:09,580 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-20 10:45:09,588 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-20 10:45:09,644 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2022-11-20 10:45:09,645 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-20 10:45:09,655 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2022-11-20 10:45:09,657 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-20 10:45:09,681 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 17 [2022-11-20 10:45:09,684 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-20 10:45:09,689 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 32 [2022-11-20 10:45:09,691 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-20 10:45:09,718 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 42 [2022-11-20 10:45:09,719 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-20 10:45:09,721 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-11-20 10:45:09,721 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-20 10:45:09,722 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2125680002] [2022-11-20 10:45:09,722 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2125680002] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-20 10:45:09,722 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-20 10:45:09,722 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2022-11-20 10:45:09,723 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1024167198] [2022-11-20 10:45:09,723 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-20 10:45:09,723 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2022-11-20 10:45:09,723 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-20 10:45:09,724 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2022-11-20 10:45:09,724 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=14, Invalid=42, Unknown=0, NotChecked=0, Total=56 [2022-11-20 10:45:09,724 INFO L87 Difference]: Start difference. First operand 872 states and 1158 transitions. Second operand has 8 states, 8 states have (on average 5.75) internal successors, (46), 6 states have internal predecessors, (46), 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-11-20 10:45:10,524 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-20 10:45:10,524 INFO L93 Difference]: Finished difference Result 1649 states and 2185 transitions. [2022-11-20 10:45:10,525 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 16 states. [2022-11-20 10:45:10,525 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 8 states have (on average 5.75) internal successors, (46), 6 states have internal predecessors, (46), 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 56 [2022-11-20 10:45:10,526 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-20 10:45:10,531 INFO L225 Difference]: With dead ends: 1649 [2022-11-20 10:45:10,531 INFO L226 Difference]: Without dead ends: 932 [2022-11-20 10:45:10,533 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 29 GetRequests, 12 SyntacticMatches, 0 SemanticMatches, 17 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 58 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=96, Invalid=246, Unknown=0, NotChecked=0, Total=342 [2022-11-20 10:45:10,534 INFO L413 NwaCegarLoop]: 117 mSDtfsCounter, 331 mSDsluCounter, 433 mSDsCounter, 0 mSdLazyCounter, 596 mSolverCounterSat, 52 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 339 SdHoareTripleChecker+Valid, 550 SdHoareTripleChecker+Invalid, 648 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 52 IncrementalHoareTripleChecker+Valid, 596 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.5s IncrementalHoareTripleChecker+Time [2022-11-20 10:45:10,534 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [339 Valid, 550 Invalid, 648 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [52 Valid, 596 Invalid, 0 Unknown, 0 Unchecked, 0.5s Time] [2022-11-20 10:45:10,536 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 932 states. [2022-11-20 10:45:10,623 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 932 to 760. [2022-11-20 10:45:10,625 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 760 states, 618 states have (on average 1.343042071197411) internal successors, (830), 628 states have internal predecessors, (830), 85 states have call successors, (85), 51 states have call predecessors, (85), 53 states have return successors, (87), 81 states have call predecessors, (87), 85 states have call successors, (87) [2022-11-20 10:45:10,629 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 760 states to 760 states and 1002 transitions. [2022-11-20 10:45:10,630 INFO L78 Accepts]: Start accepts. Automaton has 760 states and 1002 transitions. Word has length 56 [2022-11-20 10:45:10,630 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-20 10:45:10,630 INFO L495 AbstractCegarLoop]: Abstraction has 760 states and 1002 transitions. [2022-11-20 10:45:10,631 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 5.75) internal successors, (46), 6 states have internal predecessors, (46), 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-11-20 10:45:10,631 INFO L276 IsEmpty]: Start isEmpty. Operand 760 states and 1002 transitions. [2022-11-20 10:45:10,632 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 57 [2022-11-20 10:45:10,632 INFO L187 NwaCegarLoop]: Found error trace [2022-11-20 10:45:10,632 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] [2022-11-20 10:45:10,632 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9 [2022-11-20 10:45:10,633 INFO L420 AbstractCegarLoop]: === Iteration 11 === Targeting ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 1 more)] === [2022-11-20 10:45:10,633 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-20 10:45:10,633 INFO L85 PathProgramCache]: Analyzing trace with hash -367827252, now seen corresponding path program 1 times [2022-11-20 10:45:10,633 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-20 10:45:10,634 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [594333541] [2022-11-20 10:45:10,634 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-20 10:45:10,634 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-20 10:45:10,642 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-20 10:45:10,670 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2022-11-20 10:45:10,671 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-20 10:45:10,681 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2022-11-20 10:45:10,683 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-20 10:45:10,693 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 17 [2022-11-20 10:45:10,696 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-20 10:45:10,717 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 32 [2022-11-20 10:45:10,719 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-20 10:45:10,722 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 42 [2022-11-20 10:45:10,724 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-20 10:45:10,728 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-11-20 10:45:10,728 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-20 10:45:10,728 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [594333541] [2022-11-20 10:45:10,729 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [594333541] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-20 10:45:10,729 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-20 10:45:10,729 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2022-11-20 10:45:10,729 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1165926913] [2022-11-20 10:45:10,730 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-20 10:45:10,730 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2022-11-20 10:45:10,730 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-20 10:45:10,731 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2022-11-20 10:45:10,731 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2022-11-20 10:45:10,731 INFO L87 Difference]: Start difference. First operand 760 states and 1002 transitions. Second operand has 6 states, 6 states have (on average 7.666666666666667) internal successors, (46), 4 states have internal predecessors, (46), 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-11-20 10:45:11,302 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-20 10:45:11,303 INFO L93 Difference]: Finished difference Result 2370 states and 3182 transitions. [2022-11-20 10:45:11,303 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2022-11-20 10:45:11,304 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 7.666666666666667) internal successors, (46), 4 states have internal predecessors, (46), 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 56 [2022-11-20 10:45:11,305 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-20 10:45:11,314 INFO L225 Difference]: With dead ends: 2370 [2022-11-20 10:45:11,314 INFO L226 Difference]: Without dead ends: 1621 [2022-11-20 10:45:11,318 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-11-20 10:45:11,319 INFO L413 NwaCegarLoop]: 107 mSDtfsCounter, 418 mSDsluCounter, 195 mSDsCounter, 0 mSdLazyCounter, 272 mSolverCounterSat, 109 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 424 SdHoareTripleChecker+Valid, 302 SdHoareTripleChecker+Invalid, 381 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 109 IncrementalHoareTripleChecker+Valid, 272 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2022-11-20 10:45:11,319 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [424 Valid, 302 Invalid, 381 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [109 Valid, 272 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time] [2022-11-20 10:45:11,322 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1621 states. [2022-11-20 10:45:11,493 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1621 to 1447. [2022-11-20 10:45:11,497 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1447 states, 1177 states have (on average 1.3271028037383177) internal successors, (1562), 1194 states have internal predecessors, (1562), 158 states have call successors, (158), 97 states have call predecessors, (158), 108 states have return successors, (201), 157 states have call predecessors, (201), 158 states have call successors, (201) [2022-11-20 10:45:11,506 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1447 states to 1447 states and 1921 transitions. [2022-11-20 10:45:11,507 INFO L78 Accepts]: Start accepts. Automaton has 1447 states and 1921 transitions. Word has length 56 [2022-11-20 10:45:11,507 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-20 10:45:11,508 INFO L495 AbstractCegarLoop]: Abstraction has 1447 states and 1921 transitions. [2022-11-20 10:45:11,508 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 7.666666666666667) internal successors, (46), 4 states have internal predecessors, (46), 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-11-20 10:45:11,508 INFO L276 IsEmpty]: Start isEmpty. Operand 1447 states and 1921 transitions. [2022-11-20 10:45:11,509 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 58 [2022-11-20 10:45:11,509 INFO L187 NwaCegarLoop]: Found error trace [2022-11-20 10:45:11,509 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] [2022-11-20 10:45:11,510 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10 [2022-11-20 10:45:11,510 INFO L420 AbstractCegarLoop]: === Iteration 12 === Targeting ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 1 more)] === [2022-11-20 10:45:11,510 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-20 10:45:11,511 INFO L85 PathProgramCache]: Analyzing trace with hash -1034084368, now seen corresponding path program 1 times [2022-11-20 10:45:11,511 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-20 10:45:11,511 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [412093984] [2022-11-20 10:45:11,511 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-20 10:45:11,512 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-20 10:45:11,523 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-20 10:45:11,553 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2022-11-20 10:45:11,554 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-20 10:45:11,566 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2022-11-20 10:45:11,568 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-20 10:45:11,579 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 17 [2022-11-20 10:45:11,581 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-20 10:45:11,585 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 32 [2022-11-20 10:45:11,587 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-20 10:45:11,590 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 42 [2022-11-20 10:45:11,591 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-20 10:45:11,594 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-11-20 10:45:11,595 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-20 10:45:11,595 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [412093984] [2022-11-20 10:45:11,595 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [412093984] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-20 10:45:11,595 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-20 10:45:11,595 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2022-11-20 10:45:11,596 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [736646359] [2022-11-20 10:45:11,596 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-20 10:45:11,596 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-11-20 10:45:11,597 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-20 10:45:11,597 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-11-20 10:45:11,597 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2022-11-20 10:45:11,598 INFO L87 Difference]: Start difference. First operand 1447 states and 1921 transitions. Second operand has 5 states, 5 states have (on average 9.4) internal successors, (47), 3 states have internal predecessors, (47), 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-11-20 10:45:12,221 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-20 10:45:12,221 INFO L93 Difference]: Finished difference Result 4136 states and 5521 transitions. [2022-11-20 10:45:12,222 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2022-11-20 10:45:12,222 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 9.4) internal successors, (47), 3 states have internal predecessors, (47), 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 57 [2022-11-20 10:45:12,222 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-20 10:45:12,235 INFO L225 Difference]: With dead ends: 4136 [2022-11-20 10:45:12,236 INFO L226 Difference]: Without dead ends: 2703 [2022-11-20 10:45:12,241 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 20 GetRequests, 13 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-11-20 10:45:12,242 INFO L413 NwaCegarLoop]: 137 mSDtfsCounter, 320 mSDsluCounter, 213 mSDsCounter, 0 mSdLazyCounter, 257 mSolverCounterSat, 49 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 329 SdHoareTripleChecker+Valid, 350 SdHoareTripleChecker+Invalid, 306 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 49 IncrementalHoareTripleChecker+Valid, 257 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2022-11-20 10:45:12,242 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [329 Valid, 350 Invalid, 306 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [49 Valid, 257 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2022-11-20 10:45:12,246 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2703 states. [2022-11-20 10:45:12,449 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2703 to 2357. [2022-11-20 10:45:12,454 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 2357 states, 1913 states have (on average 1.311552535284893) internal successors, (2509), 1940 states have internal predecessors, (2509), 258 states have call successors, (258), 164 states have call predecessors, (258), 182 states have return successors, (330), 254 states have call predecessors, (330), 258 states have call successors, (330) [2022-11-20 10:45:12,464 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2357 states to 2357 states and 3097 transitions. [2022-11-20 10:45:12,465 INFO L78 Accepts]: Start accepts. Automaton has 2357 states and 3097 transitions. Word has length 57 [2022-11-20 10:45:12,465 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-20 10:45:12,465 INFO L495 AbstractCegarLoop]: Abstraction has 2357 states and 3097 transitions. [2022-11-20 10:45:12,466 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 9.4) internal successors, (47), 3 states have internal predecessors, (47), 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-11-20 10:45:12,466 INFO L276 IsEmpty]: Start isEmpty. Operand 2357 states and 3097 transitions. [2022-11-20 10:45:12,467 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 75 [2022-11-20 10:45:12,467 INFO L187 NwaCegarLoop]: Found error trace [2022-11-20 10:45:12,467 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] [2022-11-20 10:45:12,468 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable11 [2022-11-20 10:45:12,468 INFO L420 AbstractCegarLoop]: === Iteration 13 === Targeting ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 1 more)] === [2022-11-20 10:45:12,468 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-20 10:45:12,469 INFO L85 PathProgramCache]: Analyzing trace with hash -286197174, now seen corresponding path program 1 times [2022-11-20 10:45:12,469 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-20 10:45:12,469 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [503840829] [2022-11-20 10:45:12,469 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-20 10:45:12,470 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-20 10:45:12,478 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-20 10:45:12,546 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2022-11-20 10:45:12,547 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-20 10:45:12,558 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2022-11-20 10:45:12,559 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-20 10:45:12,569 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 17 [2022-11-20 10:45:12,570 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-20 10:45:12,573 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 32 [2022-11-20 10:45:12,575 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-20 10:45:12,576 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 42 [2022-11-20 10:45:12,577 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-20 10:45:12,579 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 59 [2022-11-20 10:45:12,580 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-20 10:45:12,582 INFO L134 CoverageAnalysis]: Checked inductivity of 14 backedges. 9 proven. 0 refuted. 0 times theorem prover too weak. 5 trivial. 0 not checked. [2022-11-20 10:45:12,583 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-20 10:45:12,583 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [503840829] [2022-11-20 10:45:12,583 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [503840829] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-20 10:45:12,583 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-20 10:45:12,584 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2022-11-20 10:45:12,584 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [731646647] [2022-11-20 10:45:12,584 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-20 10:45:12,585 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2022-11-20 10:45:12,585 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-20 10:45:12,585 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2022-11-20 10:45:12,585 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2022-11-20 10:45:12,586 INFO L87 Difference]: Start difference. First operand 2357 states and 3097 transitions. Second operand has 6 states, 6 states have (on average 9.666666666666666) internal successors, (58), 4 states have internal predecessors, (58), 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-11-20 10:45:13,928 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-20 10:45:13,929 INFO L93 Difference]: Finished difference Result 7472 states and 9914 transitions. [2022-11-20 10:45:13,929 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 17 states. [2022-11-20 10:45:13,930 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 9.666666666666666) internal successors, (58), 4 states have internal predecessors, (58), 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 74 [2022-11-20 10:45:13,930 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-20 10:45:13,958 INFO L225 Difference]: With dead ends: 7472 [2022-11-20 10:45:13,958 INFO L226 Difference]: Without dead ends: 5131 [2022-11-20 10:45:13,966 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 38 GetRequests, 23 SyntacticMatches, 0 SemanticMatches, 15 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 52 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=81, Invalid=191, Unknown=0, NotChecked=0, Total=272 [2022-11-20 10:45:13,969 INFO L413 NwaCegarLoop]: 148 mSDtfsCounter, 703 mSDsluCounter, 336 mSDsCounter, 0 mSdLazyCounter, 535 mSolverCounterSat, 173 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.6s Time, 0 mProtectedPredicate, 0 mProtectedAction, 717 SdHoareTripleChecker+Valid, 484 SdHoareTripleChecker+Invalid, 708 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 173 IncrementalHoareTripleChecker+Valid, 535 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.7s IncrementalHoareTripleChecker+Time [2022-11-20 10:45:13,969 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [717 Valid, 484 Invalid, 708 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [173 Valid, 535 Invalid, 0 Unknown, 0 Unchecked, 0.7s Time] [2022-11-20 10:45:13,975 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 5131 states. [2022-11-20 10:45:14,454 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 5131 to 4605. [2022-11-20 10:45:14,464 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 4605 states, 3722 states have (on average 1.2888232133261688) internal successors, (4797), 3791 states have internal predecessors, (4797), 496 states have call successors, (496), 321 states have call predecessors, (496), 383 states have return successors, (778), 496 states have call predecessors, (778), 496 states have call successors, (778) [2022-11-20 10:45:14,483 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4605 states to 4605 states and 6071 transitions. [2022-11-20 10:45:14,484 INFO L78 Accepts]: Start accepts. Automaton has 4605 states and 6071 transitions. Word has length 74 [2022-11-20 10:45:14,484 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-20 10:45:14,485 INFO L495 AbstractCegarLoop]: Abstraction has 4605 states and 6071 transitions. [2022-11-20 10:45:14,485 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 9.666666666666666) internal successors, (58), 4 states have internal predecessors, (58), 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-11-20 10:45:14,485 INFO L276 IsEmpty]: Start isEmpty. Operand 4605 states and 6071 transitions. [2022-11-20 10:45:14,489 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 91 [2022-11-20 10:45:14,489 INFO L187 NwaCegarLoop]: Found error trace [2022-11-20 10:45:14,489 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-20 10:45:14,490 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable12 [2022-11-20 10:45:14,490 INFO L420 AbstractCegarLoop]: === Iteration 14 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 1 more)] === [2022-11-20 10:45:14,490 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-20 10:45:14,490 INFO L85 PathProgramCache]: Analyzing trace with hash 1327486831, now seen corresponding path program 1 times [2022-11-20 10:45:14,491 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-20 10:45:14,491 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [150744127] [2022-11-20 10:45:14,491 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-20 10:45:14,491 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-20 10:45:14,540 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-20 10:45:14,602 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2022-11-20 10:45:14,603 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-20 10:45:14,616 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2022-11-20 10:45:14,622 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-20 10:45:14,631 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 17 [2022-11-20 10:45:14,634 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-20 10:45:14,649 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 32 [2022-11-20 10:45:14,651 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-20 10:45:14,654 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 42 [2022-11-20 10:45:14,655 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-20 10:45:14,659 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 55 [2022-11-20 10:45:14,662 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-20 10:45:14,751 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-11-20 10:45:14,756 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-20 10:45:14,784 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 77 [2022-11-20 10:45:14,786 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-20 10:45:14,788 INFO L134 CoverageAnalysis]: Checked inductivity of 26 backedges. 7 proven. 0 refuted. 0 times theorem prover too weak. 19 trivial. 0 not checked. [2022-11-20 10:45:14,788 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-20 10:45:14,789 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [150744127] [2022-11-20 10:45:14,789 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [150744127] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-20 10:45:14,789 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-20 10:45:14,789 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2022-11-20 10:45:14,789 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [467203948] [2022-11-20 10:45:14,790 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-20 10:45:14,790 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2022-11-20 10:45:14,790 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-20 10:45:14,791 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2022-11-20 10:45:14,791 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=27, Unknown=0, NotChecked=0, Total=42 [2022-11-20 10:45:14,791 INFO L87 Difference]: Start difference. First operand 4605 states and 6071 transitions. Second operand has 7 states, 7 states have (on average 8.142857142857142) internal successors, (57), 5 states have internal predecessors, (57), 4 states have call successors, (8), 3 states have call predecessors, (8), 3 states have return successors, (8), 4 states have call predecessors, (8), 4 states have call successors, (8) [2022-11-20 10:45:15,746 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-20 10:45:15,746 INFO L93 Difference]: Finished difference Result 8872 states and 11640 transitions. [2022-11-20 10:45:15,746 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2022-11-20 10:45:15,747 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), 4 states have call successors, (8), 3 states have call predecessors, (8), 3 states have return successors, (8), 4 states have call predecessors, (8), 4 states have call successors, (8) Word has length 90 [2022-11-20 10:45:15,747 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-20 10:45:15,775 INFO L225 Difference]: With dead ends: 8872 [2022-11-20 10:45:15,775 INFO L226 Difference]: Without dead ends: 5201 [2022-11-20 10:45:15,786 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 30 GetRequests, 19 SyntacticMatches, 0 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 13 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=58, Invalid=98, Unknown=0, NotChecked=0, Total=156 [2022-11-20 10:45:15,787 INFO L413 NwaCegarLoop]: 118 mSDtfsCounter, 565 mSDsluCounter, 193 mSDsCounter, 0 mSdLazyCounter, 275 mSolverCounterSat, 143 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 572 SdHoareTripleChecker+Valid, 311 SdHoareTripleChecker+Invalid, 418 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 143 IncrementalHoareTripleChecker+Valid, 275 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2022-11-20 10:45:15,787 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [572 Valid, 311 Invalid, 418 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [143 Valid, 275 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time] [2022-11-20 10:45:15,794 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 5201 states. [2022-11-20 10:45:16,389 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 5201 to 4573. [2022-11-20 10:45:16,409 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 4573 states, 3686 states have (on average 1.2769940314704287) internal successors, (4707), 3759 states have internal predecessors, (4707), 496 states have call successors, (496), 321 states have call predecessors, (496), 387 states have return successors, (697), 496 states have call predecessors, (697), 496 states have call successors, (697) [2022-11-20 10:45:16,437 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4573 states to 4573 states and 5900 transitions. [2022-11-20 10:45:16,439 INFO L78 Accepts]: Start accepts. Automaton has 4573 states and 5900 transitions. Word has length 90 [2022-11-20 10:45:16,439 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-20 10:45:16,440 INFO L495 AbstractCegarLoop]: Abstraction has 4573 states and 5900 transitions. [2022-11-20 10:45:16,441 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), 4 states have call successors, (8), 3 states have call predecessors, (8), 3 states have return successors, (8), 4 states have call predecessors, (8), 4 states have call successors, (8) [2022-11-20 10:45:16,441 INFO L276 IsEmpty]: Start isEmpty. Operand 4573 states and 5900 transitions. [2022-11-20 10:45:16,444 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 91 [2022-11-20 10:45:16,444 INFO L187 NwaCegarLoop]: Found error trace [2022-11-20 10:45:16,444 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-20 10:45:16,445 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable13 [2022-11-20 10:45:16,445 INFO L420 AbstractCegarLoop]: === Iteration 15 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 1 more)] === [2022-11-20 10:45:16,445 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-20 10:45:16,445 INFO L85 PathProgramCache]: Analyzing trace with hash -1400722515, now seen corresponding path program 1 times [2022-11-20 10:45:16,446 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-20 10:45:16,446 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1396695198] [2022-11-20 10:45:16,446 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-20 10:45:16,446 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-20 10:45:16,453 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-20 10:45:16,471 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2022-11-20 10:45:16,472 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-20 10:45:16,482 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2022-11-20 10:45:16,484 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-20 10:45:16,492 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 17 [2022-11-20 10:45:16,494 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-20 10:45:16,497 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 32 [2022-11-20 10:45:16,498 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-20 10:45:16,500 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 42 [2022-11-20 10:45:16,501 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-20 10:45:16,503 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 55 [2022-11-20 10:45:16,505 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-20 10:45:16,509 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-11-20 10:45:16,511 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-20 10:45:16,514 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 77 [2022-11-20 10:45:16,515 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-20 10:45:16,517 INFO L134 CoverageAnalysis]: Checked inductivity of 26 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 26 trivial. 0 not checked. [2022-11-20 10:45:16,517 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-20 10:45:16,518 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1396695198] [2022-11-20 10:45:16,518 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1396695198] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-20 10:45:16,518 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-20 10:45:16,518 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2022-11-20 10:45:16,521 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1128873880] [2022-11-20 10:45:16,521 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-20 10:45:16,521 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-11-20 10:45:16,522 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-20 10:45:16,522 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-11-20 10:45:16,522 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2022-11-20 10:45:16,523 INFO L87 Difference]: Start difference. First operand 4573 states and 5900 transitions. Second operand has 5 states, 5 states have (on average 10.4) internal successors, (52), 3 states have internal predecessors, (52), 3 states have call successors, (7), 3 states have call predecessors, (7), 1 states have return successors, (7), 3 states have call predecessors, (7), 3 states have call successors, (7) [2022-11-20 10:45:17,133 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-20 10:45:17,133 INFO L93 Difference]: Finished difference Result 5037 states and 6517 transitions. [2022-11-20 10:45:17,134 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2022-11-20 10:45:17,134 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 10.4) internal successors, (52), 3 states have internal predecessors, (52), 3 states have call successors, (7), 3 states have call predecessors, (7), 1 states have return successors, (7), 3 states have call predecessors, (7), 3 states have call successors, (7) Word has length 90 [2022-11-20 10:45:17,134 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-20 10:45:17,167 INFO L225 Difference]: With dead ends: 5037 [2022-11-20 10:45:17,167 INFO L226 Difference]: Without dead ends: 4141 [2022-11-20 10:45:17,173 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 25 GetRequests, 19 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-11-20 10:45:17,176 INFO L413 NwaCegarLoop]: 98 mSDtfsCounter, 265 mSDsluCounter, 113 mSDsCounter, 0 mSdLazyCounter, 139 mSolverCounterSat, 35 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 283 SdHoareTripleChecker+Valid, 211 SdHoareTripleChecker+Invalid, 174 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 35 IncrementalHoareTripleChecker+Valid, 139 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2022-11-20 10:45:17,176 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [283 Valid, 211 Invalid, 174 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [35 Valid, 139 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2022-11-20 10:45:17,183 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 4141 states. [2022-11-20 10:45:17,584 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 4141 to 3679. [2022-11-20 10:45:17,589 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3679 states, 2972 states have (on average 1.281965006729475) internal successors, (3810), 3033 states have internal predecessors, (3810), 390 states have call successors, (390), 254 states have call predecessors, (390), 313 states have return successors, (562), 393 states have call predecessors, (562), 390 states have call successors, (562) [2022-11-20 10:45:17,605 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3679 states to 3679 states and 4762 transitions. [2022-11-20 10:45:17,606 INFO L78 Accepts]: Start accepts. Automaton has 3679 states and 4762 transitions. Word has length 90 [2022-11-20 10:45:17,606 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-20 10:45:17,606 INFO L495 AbstractCegarLoop]: Abstraction has 3679 states and 4762 transitions. [2022-11-20 10:45:17,606 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 10.4) internal successors, (52), 3 states have internal predecessors, (52), 3 states have call successors, (7), 3 states have call predecessors, (7), 1 states have return successors, (7), 3 states have call predecessors, (7), 3 states have call successors, (7) [2022-11-20 10:45:17,607 INFO L276 IsEmpty]: Start isEmpty. Operand 3679 states and 4762 transitions. [2022-11-20 10:45:17,611 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 92 [2022-11-20 10:45:17,611 INFO L187 NwaCegarLoop]: Found error trace [2022-11-20 10:45:17,612 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-20 10:45:17,612 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable14 [2022-11-20 10:45:17,612 INFO L420 AbstractCegarLoop]: === Iteration 16 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 1 more)] === [2022-11-20 10:45:17,613 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-20 10:45:17,614 INFO L85 PathProgramCache]: Analyzing trace with hash -1500452604, now seen corresponding path program 1 times [2022-11-20 10:45:17,614 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-20 10:45:17,614 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1021183641] [2022-11-20 10:45:17,614 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-20 10:45:17,615 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-20 10:45:17,628 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-20 10:45:17,678 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2022-11-20 10:45:17,679 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-20 10:45:17,689 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2022-11-20 10:45:17,692 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-20 10:45:17,701 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 17 [2022-11-20 10:45:17,702 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-20 10:45:17,707 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 32 [2022-11-20 10:45:17,708 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-20 10:45:17,710 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 42 [2022-11-20 10:45:17,711 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-20 10:45:17,716 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 55 [2022-11-20 10:45:17,718 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-20 10:45:17,721 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-11-20 10:45:17,723 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-20 10:45:17,725 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 78 [2022-11-20 10:45:17,728 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-20 10:45:17,737 INFO L134 CoverageAnalysis]: Checked inductivity of 26 backedges. 10 proven. 0 refuted. 0 times theorem prover too weak. 16 trivial. 0 not checked. [2022-11-20 10:45:17,737 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-20 10:45:17,738 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1021183641] [2022-11-20 10:45:17,740 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1021183641] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-20 10:45:17,740 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-20 10:45:17,741 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2022-11-20 10:45:17,741 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1067120246] [2022-11-20 10:45:17,741 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-20 10:45:17,741 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2022-11-20 10:45:17,742 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-20 10:45:17,742 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2022-11-20 10:45:17,743 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2022-11-20 10:45:17,743 INFO L87 Difference]: Start difference. First operand 3679 states and 4762 transitions. Second operand has 7 states, 7 states have (on average 8.714285714285714) internal successors, (61), 5 states have internal predecessors, (61), 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-11-20 10:45:19,240 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-20 10:45:19,240 INFO L93 Difference]: Finished difference Result 7051 states and 9090 transitions. [2022-11-20 10:45:19,240 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 18 states. [2022-11-20 10:45:19,241 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 8.714285714285714) internal successors, (61), 5 states have internal predecessors, (61), 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 91 [2022-11-20 10:45:19,241 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-20 10:45:19,260 INFO L225 Difference]: With dead ends: 7051 [2022-11-20 10:45:19,260 INFO L226 Difference]: Without dead ends: 4058 [2022-11-20 10:45:19,269 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 49 GetRequests, 30 SyntacticMatches, 0 SemanticMatches, 19 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 85 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=101, Invalid=319, Unknown=0, NotChecked=0, Total=420 [2022-11-20 10:45:19,270 INFO L413 NwaCegarLoop]: 146 mSDtfsCounter, 1025 mSDsluCounter, 419 mSDsCounter, 0 mSdLazyCounter, 714 mSolverCounterSat, 273 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.7s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1039 SdHoareTripleChecker+Valid, 565 SdHoareTripleChecker+Invalid, 987 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 273 IncrementalHoareTripleChecker+Valid, 714 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.9s IncrementalHoareTripleChecker+Time [2022-11-20 10:45:19,271 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [1039 Valid, 565 Invalid, 987 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [273 Valid, 714 Invalid, 0 Unknown, 0 Unchecked, 0.9s Time] [2022-11-20 10:45:19,276 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 4058 states. [2022-11-20 10:45:19,816 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 4058 to 3679. [2022-11-20 10:45:19,822 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3679 states, 2972 states have (on average 1.2671601615074024) internal successors, (3766), 3033 states have internal predecessors, (3766), 390 states have call successors, (390), 254 states have call predecessors, (390), 313 states have return successors, (496), 393 states have call predecessors, (496), 390 states have call successors, (496) [2022-11-20 10:45:19,838 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3679 states to 3679 states and 4652 transitions. [2022-11-20 10:45:19,840 INFO L78 Accepts]: Start accepts. Automaton has 3679 states and 4652 transitions. Word has length 91 [2022-11-20 10:45:19,840 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-20 10:45:19,840 INFO L495 AbstractCegarLoop]: Abstraction has 3679 states and 4652 transitions. [2022-11-20 10:45:19,841 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 8.714285714285714) internal successors, (61), 5 states have internal predecessors, (61), 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-11-20 10:45:19,841 INFO L276 IsEmpty]: Start isEmpty. Operand 3679 states and 4652 transitions. [2022-11-20 10:45:19,843 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 98 [2022-11-20 10:45:19,843 INFO L187 NwaCegarLoop]: Found error trace [2022-11-20 10:45:19,844 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-20 10:45:19,844 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable15 [2022-11-20 10:45:19,844 INFO L420 AbstractCegarLoop]: === Iteration 17 === Targeting ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 1 more)] === [2022-11-20 10:45:19,845 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-20 10:45:19,845 INFO L85 PathProgramCache]: Analyzing trace with hash -78861023, now seen corresponding path program 1 times [2022-11-20 10:45:19,845 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-20 10:45:19,846 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1300757695] [2022-11-20 10:45:19,846 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-20 10:45:19,846 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-20 10:45:19,863 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-11-20 10:45:19,863 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2022-11-20 10:45:19,875 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-11-20 10:45:19,930 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2022-11-20 10:45:19,930 INFO L359 BasicCegarLoop]: Counterexample is feasible [2022-11-20 10:45:19,932 INFO L805 garLoopResultBuilder]: Registering result UNSAFE for location ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (3 of 4 remaining) [2022-11-20 10:45:19,934 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW (2 of 4 remaining) [2022-11-20 10:45:19,934 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW (1 of 4 remaining) [2022-11-20 10:45:19,935 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr3ASSERT_VIOLATIONINTEGER_OVERFLOW (0 of 4 remaining) [2022-11-20 10:45:19,935 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable16 [2022-11-20 10:45:19,939 INFO L444 BasicCegarLoop]: Path program histogram: [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-20 10:45:19,946 INFO L178 ceAbstractionStarter]: Computing trace abstraction results [2022-11-20 10:45:20,104 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 20.11 10:45:20 BoogieIcfgContainer [2022-11-20 10:45:20,104 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2022-11-20 10:45:20,105 INFO L113 PluginConnector]: ------------------------Witness Printer---------------------------- [2022-11-20 10:45:20,105 INFO L271 PluginConnector]: Initializing Witness Printer... [2022-11-20 10:45:20,105 INFO L275 PluginConnector]: Witness Printer initialized [2022-11-20 10:45:20,106 INFO L185 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 20.11 10:44:58" (3/4) ... [2022-11-20 10:45:20,108 INFO L131 WitnessPrinter]: Generating witness for reachability counterexample [2022-11-20 10:45:20,217 INFO L141 WitnessManager]: Wrote witness to /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_881119b7-e16e-4526-b171-3c068aa27f33/bin/uautomizer-ug76WZFUDN/witness.graphml [2022-11-20 10:45:20,218 INFO L132 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2022-11-20 10:45:20,218 INFO L158 Benchmark]: Toolchain (without parser) took 22909.52ms. Allocated memory was 159.4MB in the beginning and 656.4MB in the end (delta: 497.0MB). Free memory was 126.6MB in the beginning and 436.4MB in the end (delta: -309.8MB). Peak memory consumption was 188.9MB. Max. memory is 16.1GB. [2022-11-20 10:45:20,219 INFO L158 Benchmark]: CDTParser took 0.26ms. Allocated memory is still 159.4MB. Free memory is still 101.4MB. There was no memory consumed. Max. memory is 16.1GB. [2022-11-20 10:45:20,219 INFO L158 Benchmark]: CACSL2BoogieTranslator took 312.50ms. Allocated memory is still 159.4MB. Free memory was 126.6MB in the beginning and 113.4MB in the end (delta: 13.2MB). Peak memory consumption was 12.6MB. Max. memory is 16.1GB. [2022-11-20 10:45:20,219 INFO L158 Benchmark]: Boogie Procedure Inliner took 47.83ms. Allocated memory is still 159.4MB. Free memory was 113.4MB in the beginning and 111.9MB in the end (delta: 1.5MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. [2022-11-20 10:45:20,220 INFO L158 Benchmark]: Boogie Preprocessor took 34.45ms. Allocated memory is still 159.4MB. Free memory was 111.9MB in the beginning and 109.8MB in the end (delta: 2.1MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. [2022-11-20 10:45:20,220 INFO L158 Benchmark]: RCFGBuilder took 757.42ms. Allocated memory is still 159.4MB. Free memory was 109.8MB in the beginning and 92.4MB in the end (delta: 17.4MB). Peak memory consumption was 16.8MB. Max. memory is 16.1GB. [2022-11-20 10:45:20,221 INFO L158 Benchmark]: TraceAbstraction took 21636.97ms. Allocated memory was 159.4MB in the beginning and 656.4MB in the end (delta: 497.0MB). Free memory was 91.8MB in the beginning and 446.9MB in the end (delta: -355.1MB). Peak memory consumption was 144.9MB. Max. memory is 16.1GB. [2022-11-20 10:45:20,221 INFO L158 Benchmark]: Witness Printer took 113.32ms. Allocated memory is still 656.4MB. Free memory was 446.9MB in the beginning and 436.4MB in the end (delta: 10.5MB). Peak memory consumption was 10.5MB. Max. memory is 16.1GB. [2022-11-20 10:45:20,223 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.26ms. Allocated memory is still 159.4MB. Free memory is still 101.4MB. There was no memory consumed. Max. memory is 16.1GB. * CACSL2BoogieTranslator took 312.50ms. Allocated memory is still 159.4MB. Free memory was 126.6MB in the beginning and 113.4MB in the end (delta: 13.2MB). Peak memory consumption was 12.6MB. Max. memory is 16.1GB. * Boogie Procedure Inliner took 47.83ms. Allocated memory is still 159.4MB. Free memory was 113.4MB in the beginning and 111.9MB in the end (delta: 1.5MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. * Boogie Preprocessor took 34.45ms. Allocated memory is still 159.4MB. Free memory was 111.9MB in the beginning and 109.8MB in the end (delta: 2.1MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. * RCFGBuilder took 757.42ms. Allocated memory is still 159.4MB. Free memory was 109.8MB in the beginning and 92.4MB in the end (delta: 17.4MB). Peak memory consumption was 16.8MB. Max. memory is 16.1GB. * TraceAbstraction took 21636.97ms. Allocated memory was 159.4MB in the beginning and 656.4MB in the end (delta: 497.0MB). Free memory was 91.8MB in the beginning and 446.9MB in the end (delta: -355.1MB). Peak memory consumption was 144.9MB. Max. memory is 16.1GB. * Witness Printer took 113.32ms. Allocated memory is still 656.4MB. Free memory was 446.9MB in the beginning and 436.4MB 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: 107]: integer overflow possible integer overflow possible We found a FailurePath: [L24] int m_pc = 0; [L25] int t1_pc = 0; [L26] int m_st ; [L27] int t1_st ; [L28] int m_i ; [L29] int t1_i ; [L30] int M_E = 2; [L31] int T1_E = 2; [L32] int E_M = 2; [L33] int E_1 = 2; [L37] int token ; [L39] int local ; VAL [E_1=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, token=0] [L473] int __retres1 ; [L477] CALL init_model() [L388] m_i = 1 [L389] t1_i = 1 VAL [E_1=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, token=0] [L477] RET init_model() [L478] CALL start_simulation() [L414] int kernel_st ; [L415] int tmp ; [L416] int tmp___0 ; [L420] kernel_st = 0 VAL [E_1=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, token=0] [L421] FCALL update_channels() VAL [E_1=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, token=0] [L422] CALL init_threads() [L170] COND TRUE m_i == 1 [L171] m_st = 0 VAL [E_1=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, token=0] [L175] COND TRUE t1_i == 1 [L176] t1_st = 0 VAL [E_1=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, token=0] [L422] RET init_threads() [L423] CALL fire_delta_events() VAL [\old(E_1)=2, \old(E_M)=2, \old(M_E)=2, \old(T1_E)=2, E_1=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, token=0] [L259] COND FALSE !(M_E == 0) VAL [\old(E_1)=2, \old(E_M)=2, \old(M_E)=2, \old(T1_E)=2, E_1=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, token=0] [L264] COND FALSE !(T1_E == 0) VAL [\old(E_1)=2, \old(E_M)=2, \old(M_E)=2, \old(T1_E)=2, E_1=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, token=0] [L269] COND FALSE !(E_M == 0) VAL [\old(E_1)=2, \old(E_M)=2, \old(M_E)=2, \old(T1_E)=2, E_1=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, token=0] [L274] COND FALSE !(E_1 == 0) VAL [\old(E_1)=2, \old(E_M)=2, \old(M_E)=2, \old(T1_E)=2, E_1=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, token=0] [L423] RET fire_delta_events() VAL [E_1=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, token=0] [L424] CALL activate_threads() VAL [\old(m_st)=0, \old(t1_st)=0, E_1=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, token=0] [L312] int tmp ; [L313] int tmp___0 ; [L317] CALL, EXPR is_master_triggered() [L121] int __retres1 ; VAL [\old(m_st)=0, \old(t1_st)=0, E_1=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, token=0] [L124] COND FALSE !(m_pc == 1) VAL [\old(m_st)=0, \old(t1_st)=0, E_1=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, token=0] [L134] __retres1 = 0 VAL [\old(m_st)=0, \old(t1_st)=0, __retres1=0, E_1=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, token=0] [L136] return (__retres1); VAL [\old(m_st)=0, \old(t1_st)=0, \result=0, __retres1=0, E_1=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, token=0] [L317] RET, EXPR is_master_triggered() [L317] tmp = is_master_triggered() [L319] COND FALSE !(\read(tmp)) VAL [\old(m_st)=0, \old(t1_st)=0, E_1=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, tmp=0, token=0] [L325] CALL, EXPR is_transmit1_triggered() [L140] int __retres1 ; VAL [\old(m_st)=0, \old(t1_st)=0, E_1=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, token=0] [L143] COND FALSE !(t1_pc == 1) VAL [\old(m_st)=0, \old(t1_st)=0, E_1=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, token=0] [L153] __retres1 = 0 VAL [\old(m_st)=0, \old(t1_st)=0, __retres1=0, E_1=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, token=0] [L155] return (__retres1); VAL [\old(m_st)=0, \old(t1_st)=0, \result=0, __retres1=0, E_1=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, token=0] [L325] RET, EXPR is_transmit1_triggered() [L325] tmp___0 = is_transmit1_triggered() [L327] COND FALSE !(\read(tmp___0)) VAL [\old(m_st)=0, \old(t1_st)=0, E_1=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, tmp=0, tmp___0=0, token=0] [L424] RET activate_threads() VAL [E_1=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, token=0] [L425] CALL reset_delta_events() VAL [\old(E_1)=2, \old(E_M)=2, \old(M_E)=2, \old(T1_E)=2, E_1=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, token=0] [L287] COND FALSE !(M_E == 1) VAL [\old(E_1)=2, \old(E_M)=2, \old(M_E)=2, \old(T1_E)=2, E_1=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, token=0] [L292] COND FALSE !(T1_E == 1) VAL [\old(E_1)=2, \old(E_M)=2, \old(M_E)=2, \old(T1_E)=2, E_1=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, token=0] [L297] COND FALSE !(E_M == 1) VAL [\old(E_1)=2, \old(E_M)=2, \old(M_E)=2, \old(T1_E)=2, E_1=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, token=0] [L302] COND FALSE !(E_1 == 1) VAL [\old(E_1)=2, \old(E_M)=2, \old(M_E)=2, \old(T1_E)=2, E_1=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, token=0] [L425] RET reset_delta_events() VAL [E_1=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, token=0] [L428] COND TRUE 1 VAL [E_1=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, token=0] [L431] kernel_st = 1 [L432] CALL eval() [L206] int tmp ; VAL [E_1=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, token=0] [L210] COND TRUE 1 VAL [E_1=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, token=0] [L213] CALL, EXPR exists_runnable_thread() VAL [E_1=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, token=0] [L185] int __retres1 ; VAL [E_1=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, token=0] [L188] COND TRUE m_st == 0 [L189] __retres1 = 1 VAL [__retres1=1, E_1=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, token=0] [L201] return (__retres1); VAL [\result=1, __retres1=1, E_1=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, token=0] [L213] RET, EXPR exists_runnable_thread() VAL [E_1=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, token=0] [L213] tmp = exists_runnable_thread() [L215] COND TRUE \read(tmp) VAL [E_1=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, tmp=1, token=0] [L220] COND TRUE m_st == 0 [L221] int tmp_ndt_1; [L222] tmp_ndt_1 = __VERIFIER_nondet_int() [L223] COND FALSE !(\read(tmp_ndt_1)) VAL [E_1=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, tmp=1, tmp_ndt_1=0, token=0] [L234] COND TRUE t1_st == 0 [L235] int tmp_ndt_2; [L236] tmp_ndt_2 = __VERIFIER_nondet_int() [L237] COND TRUE \read(tmp_ndt_2) [L239] t1_st = 1 [L240] CALL transmit1() [L88] COND TRUE t1_pc == 0 VAL [E_1=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, token=0] [L99] COND TRUE 1 VAL [E_1=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, token=0] [L101] t1_pc = 1 [L102] t1_st = 2 VAL [E_1=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, token=0] [L240] RET transmit1() [L210] COND TRUE 1 VAL [E_1=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, tmp=1, tmp_ndt_1=0, tmp_ndt_2=-1, token=0] [L213] CALL, EXPR exists_runnable_thread() VAL [E_1=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, token=0] [L185] int __retres1 ; VAL [E_1=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, token=0] [L188] COND TRUE m_st == 0 [L189] __retres1 = 1 VAL [__retres1=1, E_1=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, token=0] [L201] return (__retres1); VAL [\result=1, __retres1=1, E_1=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, token=0] [L213] RET, EXPR exists_runnable_thread() VAL [E_1=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, tmp=1, tmp_ndt_1=0, tmp_ndt_2=-1, token=0] [L213] tmp = exists_runnable_thread() [L215] COND TRUE \read(tmp) VAL [E_1=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, tmp=1, tmp_ndt_1=0, tmp_ndt_2=-1, token=0] [L220] COND TRUE m_st == 0 [L221] int tmp_ndt_1; [L222] tmp_ndt_1 = __VERIFIER_nondet_int() [L223] COND TRUE \read(tmp_ndt_1) [L225] m_st = 1 [L226] CALL master() [L44] COND TRUE m_pc == 0 VAL [E_1=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, token=0] [L55] COND TRUE 1 VAL [E_1=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, token=0] [L58] token = __VERIFIER_nondet_int() [L59] local = token [L60] E_1 = 1 VAL [E_1=1, 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, token=2147483647] [L61] CALL immediate_notify() VAL [\old(m_st)=1, \old(t1_st)=2, E_1=1, 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, token=2147483647] [L341] CALL activate_threads() VAL [\old(m_st)=1, \old(t1_st)=2, E_1=1, 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, token=2147483647] [L312] int tmp ; [L313] int tmp___0 ; [L317] CALL, EXPR is_master_triggered() [L121] int __retres1 ; VAL [\old(m_st)=1, \old(t1_st)=2, E_1=1, 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, token=2147483647] [L124] COND FALSE !(m_pc == 1) VAL [\old(m_st)=1, \old(t1_st)=2, E_1=1, 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, token=2147483647] [L134] __retres1 = 0 VAL [\old(m_st)=1, \old(t1_st)=2, __retres1=0, E_1=1, 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, token=2147483647] [L136] return (__retres1); VAL [\old(m_st)=1, \old(t1_st)=2, \result=0, __retres1=0, E_1=1, 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, token=2147483647] [L317] RET, EXPR is_master_triggered() [L317] tmp = is_master_triggered() [L319] COND FALSE !(\read(tmp)) VAL [\old(m_st)=1, \old(t1_st)=2, E_1=1, 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, tmp=0, token=2147483647] [L325] CALL, EXPR is_transmit1_triggered() [L140] int __retres1 ; VAL [\old(m_st)=1, \old(t1_st)=2, E_1=1, 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, token=2147483647] [L143] COND TRUE t1_pc == 1 VAL [\old(m_st)=1, \old(t1_st)=2, E_1=1, 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, token=2147483647] [L144] COND TRUE E_1 == 1 [L145] __retres1 = 1 VAL [\old(m_st)=1, \old(t1_st)=2, __retres1=1, E_1=1, 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, token=2147483647] [L155] return (__retres1); VAL [\old(m_st)=1, \old(t1_st)=2, \result=1, __retres1=1, E_1=1, 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, token=2147483647] [L325] RET, EXPR is_transmit1_triggered() [L325] tmp___0 = is_transmit1_triggered() [L327] COND TRUE \read(tmp___0) [L328] t1_st = 0 VAL [\old(m_st)=1, \old(t1_st)=2, E_1=1, 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, tmp=0, tmp___0=1, token=2147483647] [L341] RET activate_threads() VAL [\old(m_st)=1, \old(t1_st)=2, E_1=1, 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, token=2147483647] [L61] RET immediate_notify() VAL [E_1=1, 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, token=2147483647] [L62] E_1 = 2 [L63] m_pc = 1 [L64] m_st = 2 VAL [E_1=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, token=2147483647] [L226] RET master() [L234] COND TRUE t1_st == 0 [L235] int tmp_ndt_2; [L236] tmp_ndt_2 = __VERIFIER_nondet_int() [L237] COND TRUE \read(tmp_ndt_2) [L239] t1_st = 1 [L240] CALL transmit1() [L88] COND FALSE !(t1_pc == 0) VAL [E_1=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, token=2147483647] [L91] COND TRUE t1_pc == 1 VAL [E_1=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, token=2147483647] [L107] token += 1 VAL [E_1=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, token=2147483647] - UnprovableResult [Line: 69]: Unable to prove that integer overflow can never occur Unable to prove that integer overflow can never occur Reason: Not analyzed. - UnprovableResult [Line: 69]: Unable to prove that integer overflow can never occur Unable to prove that integer overflow can never occur Reason: Not analyzed. - UnprovableResult [Line: 107]: 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 7 procedures, 113 locations, 4 error locations. Started 1 CEGAR loops. OverallTime: 21.4s, OverallIterations: 17, TraceHistogramMax: 2, PathProgramHistogramMax: 1, EmptinessCheckTime: 0.1s, AutomataDifference: 14.5s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 0.0s, HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 6610 SdHoareTripleChecker+Valid, 8.5s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 6460 mSDsluCounter, 7529 SdHoareTripleChecker+Invalid, 7.0s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 5455 mSDsCounter, 1350 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 7782 IncrementalHoareTripleChecker+Invalid, 9132 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 1350 mSolverCounterUnsat, 2074 mSDtfsCounter, 7782 mSolverCounterSat, 0.2s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 455 GetRequests, 246 SyntacticMatches, 0 SemanticMatches, 209 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 550 ImplicationChecksByTransitivity, 2.4s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=4605occurred in iteration=13, InterpolantAutomatonStates: 207, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s DumpTime, AutomataMinimizationStatistics: 3.6s AutomataMinimizationTime, 16 MinimizatonAttempts, 4151 StatesRemovedByMinimization, 16 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.1s SsaConstructionTime, 0.2s SatisfiabilityAnalysisTime, 2.6s InterpolantComputationTime, 1110 NumberOfCodeBlocks, 1110 NumberOfCodeBlocksAsserted, 17 NumberOfCheckSat, 997 ConstructedInterpolants, 0 QuantifiedInterpolants, 2264 SizeOfPredicates, 0 NumberOfNonLiveVariables, 0 ConjunctsInSsa, 0 ConjunctsInUnsatCore, 16 InterpolantComputations, 16 PerfectInterpolantSequences, 92/92 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-11-20 10:45:20,249 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_881119b7-e16e-4526-b171-3c068aa27f33/bin/uautomizer-ug76WZFUDN/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)