./Ultimate.py --spec ../../sv-benchmarks/c/properties/no-overflow.prp --file ../../sv-benchmarks/c/systemc/token_ring.02.cil-1.c --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for overflows Using default analysis Version d790fecc Calling Ultimate with: /usr/bin/java -Dosgi.configuration.area=/tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_e4c7f443-ae64-4d73-a924-d6e5ffc60efb/bin/uautomizer-verify-84ZbGMXZE1/data/config -Xmx15G -Xms4m -jar /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_e4c7f443-ae64-4d73-a924-d6e5ffc60efb/bin/uautomizer-verify-84ZbGMXZE1/plugins/org.eclipse.equinox.launcher_1.6.800.v20240513-1750.jar -data @noDefault -ultimatedata /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_e4c7f443-ae64-4d73-a924-d6e5ffc60efb/bin/uautomizer-verify-84ZbGMXZE1/data -tc /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_e4c7f443-ae64-4d73-a924-d6e5ffc60efb/bin/uautomizer-verify-84ZbGMXZE1/config/AutomizerReach.xml -i ../../sv-benchmarks/c/systemc/token_ring.02.cil-1.c -s /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_e4c7f443-ae64-4d73-a924-d6e5ffc60efb/bin/uautomizer-verify-84ZbGMXZE1/config/svcomp-Overflow-32bit-Automizer_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_e4c7f443-ae64-4d73-a924-d6e5ffc60efb/bin/uautomizer-verify-84ZbGMXZE1 --witnessprinter.witness.filename witness --witnessprinter.write.witness.besides.input.file false --witnessprinter.graph.data.specification CHECK( init(main()), LTL(G ! overflow) ) --witnessprinter.graph.data.producer Automizer --witnessprinter.graph.data.architecture 32bit --witnessprinter.graph.data.programhash 44ef362a593e25f5681bc4a034b065cd86559bd3dd750386bca2a1f270891ccd --- Real Ultimate output --- This is Ultimate 0.3.0-dev-d790fec [2024-12-02 11:03:44,992 INFO L188 SettingsManager]: Resetting all preferences to default values... [2024-12-02 11:03:45,044 INFO L114 SettingsManager]: Loading settings from /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_e4c7f443-ae64-4d73-a924-d6e5ffc60efb/bin/uautomizer-verify-84ZbGMXZE1/config/svcomp-Overflow-32bit-Automizer_Default.epf [2024-12-02 11:03:45,049 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2024-12-02 11:03:45,049 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2024-12-02 11:03:45,070 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2024-12-02 11:03:45,071 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2024-12-02 11:03:45,071 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2024-12-02 11:03:45,071 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2024-12-02 11:03:45,071 INFO L153 SettingsManager]: * Use memory slicer=true [2024-12-02 11:03:45,072 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2024-12-02 11:03:45,072 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2024-12-02 11:03:45,072 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2024-12-02 11:03:45,072 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2024-12-02 11:03:45,072 INFO L153 SettingsManager]: * Use SBE=true [2024-12-02 11:03:45,072 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2024-12-02 11:03:45,072 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2024-12-02 11:03:45,072 INFO L153 SettingsManager]: * sizeof long=4 [2024-12-02 11:03:45,073 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2024-12-02 11:03:45,073 INFO L153 SettingsManager]: * sizeof POINTER=4 [2024-12-02 11:03:45,073 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2024-12-02 11:03:45,073 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2024-12-02 11:03:45,073 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2024-12-02 11:03:45,073 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2024-12-02 11:03:45,073 INFO L153 SettingsManager]: * Check absence of signed integer overflows=ASSERTandASSUME [2024-12-02 11:03:45,073 INFO L153 SettingsManager]: * Check unreachability of reach_error function=false [2024-12-02 11:03:45,073 INFO L153 SettingsManager]: * sizeof long double=12 [2024-12-02 11:03:45,073 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2024-12-02 11:03:45,073 INFO L153 SettingsManager]: * Behaviour of calls to undefined functions=OVERAPPROXIMATE_BEHAVIOUR [2024-12-02 11:03:45,073 INFO L153 SettingsManager]: * Use constant arrays=true [2024-12-02 11:03:45,074 INFO L151 SettingsManager]: Preferences of IcfgBuilder differ from their defaults: [2024-12-02 11:03:45,074 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2024-12-02 11:03:45,074 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2024-12-02 11:03:45,074 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2024-12-02 11:03:45,074 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-12-02 11:03:45,074 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2024-12-02 11:03:45,074 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2024-12-02 11:03:45,074 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2024-12-02 11:03:45,074 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2024-12-02 11:03:45,074 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-12-02 11:03:45,074 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2024-12-02 11:03:45,074 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2024-12-02 11:03:45,075 INFO L153 SettingsManager]: * Compute procedure contracts=false [2024-12-02 11:03:45,075 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2024-12-02 11:03:45,075 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2024-12-02 11:03:45,075 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2024-12-02 11:03:45,075 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2024-12-02 11:03:45,075 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2024-12-02 11:03:45,075 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2024-12-02 11:03:45,075 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2024-12-02 11:03:45,075 INFO L153 SettingsManager]: * Looper check in Petri net analysis=SEMANTIC 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_e4c7f443-ae64-4d73-a924-d6e5ffc60efb/bin/uautomizer-verify-84ZbGMXZE1 Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Witness filename -> witness Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Write witness besides input file -> false Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data specification -> CHECK( init(main()), LTL(G ! overflow) ) Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data producer -> 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 -> 44ef362a593e25f5681bc4a034b065cd86559bd3dd750386bca2a1f270891ccd [2024-12-02 11:03:45,294 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2024-12-02 11:03:45,302 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2024-12-02 11:03:45,304 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2024-12-02 11:03:45,305 INFO L270 PluginConnector]: Initializing CDTParser... [2024-12-02 11:03:45,305 INFO L274 PluginConnector]: CDTParser initialized [2024-12-02 11:03:45,307 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_e4c7f443-ae64-4d73-a924-d6e5ffc60efb/bin/uautomizer-verify-84ZbGMXZE1/../../sv-benchmarks/c/systemc/token_ring.02.cil-1.c [2024-12-02 11:03:48,007 INFO L533 CDTParser]: Created temporary CDT project at /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_e4c7f443-ae64-4d73-a924-d6e5ffc60efb/bin/uautomizer-verify-84ZbGMXZE1/data/97f87f09c/7e43fd9fa00a4490b8134315e23d2dee/FLAG31498277c [2024-12-02 11:03:48,236 INFO L384 CDTParser]: Found 1 translation units. [2024-12-02 11:03:48,237 INFO L180 CDTParser]: Scanning /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_e4c7f443-ae64-4d73-a924-d6e5ffc60efb/sv-benchmarks/c/systemc/token_ring.02.cil-1.c [2024-12-02 11:03:48,246 INFO L427 CDTParser]: About to delete temporary CDT project at /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_e4c7f443-ae64-4d73-a924-d6e5ffc60efb/bin/uautomizer-verify-84ZbGMXZE1/data/97f87f09c/7e43fd9fa00a4490b8134315e23d2dee/FLAG31498277c [2024-12-02 11:03:48,588 INFO L435 CDTParser]: Successfully deleted /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_e4c7f443-ae64-4d73-a924-d6e5ffc60efb/bin/uautomizer-verify-84ZbGMXZE1/data/97f87f09c/7e43fd9fa00a4490b8134315e23d2dee [2024-12-02 11:03:48,590 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2024-12-02 11:03:48,591 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2024-12-02 11:03:48,592 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2024-12-02 11:03:48,592 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2024-12-02 11:03:48,595 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2024-12-02 11:03:48,595 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 02.12 11:03:48" (1/1) ... [2024-12-02 11:03:48,596 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@779d3656 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.12 11:03:48, skipping insertion in model container [2024-12-02 11:03:48,596 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 02.12 11:03:48" (1/1) ... [2024-12-02 11:03:48,614 INFO L175 MainTranslator]: Built tables and reachable declarations [2024-12-02 11:03:48,785 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-12-02 11:03:48,795 INFO L200 MainTranslator]: Completed pre-run [2024-12-02 11:03:48,831 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-12-02 11:03:48,844 INFO L204 MainTranslator]: Completed translation [2024-12-02 11:03:48,844 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.12 11:03:48 WrapperNode [2024-12-02 11:03:48,845 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2024-12-02 11:03:48,845 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2024-12-02 11:03:48,845 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2024-12-02 11:03:48,845 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2024-12-02 11:03:48,850 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.12 11:03:48" (1/1) ... [2024-12-02 11:03:48,856 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.12 11:03:48" (1/1) ... [2024-12-02 11:03:48,877 INFO L138 Inliner]: procedures = 32, calls = 38, calls flagged for inlining = 17, calls inlined = 17, statements flattened = 281 [2024-12-02 11:03:48,878 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2024-12-02 11:03:48,878 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2024-12-02 11:03:48,878 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2024-12-02 11:03:48,878 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2024-12-02 11:03:48,885 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.12 11:03:48" (1/1) ... [2024-12-02 11:03:48,885 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.12 11:03:48" (1/1) ... [2024-12-02 11:03:48,887 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.12 11:03:48" (1/1) ... [2024-12-02 11:03:48,897 INFO L175 MemorySlicer]: Split 2 memory accesses to 1 slices as follows [2]. 100 percent of accesses are in the largest equivalence class. The 2 initializations are split as follows [2]. The 0 writes are split as follows [0]. [2024-12-02 11:03:48,897 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.12 11:03:48" (1/1) ... [2024-12-02 11:03:48,898 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.12 11:03:48" (1/1) ... [2024-12-02 11:03:48,902 INFO L184 PluginConnector]: Executing the observer ReplaceArrayAssignments from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.12 11:03:48" (1/1) ... [2024-12-02 11:03:48,903 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.12 11:03:48" (1/1) ... [2024-12-02 11:03:48,907 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.12 11:03:48" (1/1) ... [2024-12-02 11:03:48,908 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.12 11:03:48" (1/1) ... [2024-12-02 11:03:48,909 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.12 11:03:48" (1/1) ... [2024-12-02 11:03:48,911 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2024-12-02 11:03:48,911 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2024-12-02 11:03:48,911 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2024-12-02 11:03:48,911 INFO L274 PluginConnector]: RCFGBuilder initialized [2024-12-02 11:03:48,912 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.12 11:03:48" (1/1) ... [2024-12-02 11:03:48,917 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-12-02 11:03:48,929 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_e4c7f443-ae64-4d73-a924-d6e5ffc60efb/bin/uautomizer-verify-84ZbGMXZE1/z3 [2024-12-02 11:03:48,941 INFO L229 MonitoredProcess]: Starting monitored process 1 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_e4c7f443-ae64-4d73-a924-d6e5ffc60efb/bin/uautomizer-verify-84ZbGMXZE1/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (exit command is (exit), workingDir is null) [2024-12-02 11:03:48,944 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_e4c7f443-ae64-4d73-a924-d6e5ffc60efb/bin/uautomizer-verify-84ZbGMXZE1/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Waiting until timeout for monitored process [2024-12-02 11:03:48,968 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2024-12-02 11:03:48,969 INFO L130 BoogieDeclarations]: Found specification of procedure fire_delta_events [2024-12-02 11:03:48,969 INFO L138 BoogieDeclarations]: Found implementation of procedure fire_delta_events [2024-12-02 11:03:48,969 INFO L130 BoogieDeclarations]: Found specification of procedure activate_threads [2024-12-02 11:03:48,969 INFO L138 BoogieDeclarations]: Found implementation of procedure activate_threads [2024-12-02 11:03:48,969 INFO L130 BoogieDeclarations]: Found specification of procedure immediate_notify [2024-12-02 11:03:48,969 INFO L138 BoogieDeclarations]: Found implementation of procedure immediate_notify [2024-12-02 11:03:48,969 INFO L130 BoogieDeclarations]: Found specification of procedure exists_runnable_thread [2024-12-02 11:03:48,969 INFO L138 BoogieDeclarations]: Found implementation of procedure exists_runnable_thread [2024-12-02 11:03:48,969 INFO L130 BoogieDeclarations]: Found specification of procedure reset_delta_events [2024-12-02 11:03:48,969 INFO L138 BoogieDeclarations]: Found implementation of procedure reset_delta_events [2024-12-02 11:03:48,969 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#0 [2024-12-02 11:03:48,969 INFO L130 BoogieDeclarations]: Found specification of procedure update_channels [2024-12-02 11:03:48,969 INFO L138 BoogieDeclarations]: Found implementation of procedure update_channels [2024-12-02 11:03:48,969 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2024-12-02 11:03:48,970 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2024-12-02 11:03:49,031 INFO L234 CfgBuilder]: Building ICFG [2024-12-02 11:03:49,032 INFO L260 CfgBuilder]: Building CFG for each procedure with an implementation [2024-12-02 11:03:49,335 INFO L? ?]: Removed 37 outVars from TransFormulas that were not future-live. [2024-12-02 11:03:49,335 INFO L283 CfgBuilder]: Performing block encoding [2024-12-02 11:03:49,347 INFO L307 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2024-12-02 11:03:49,347 INFO L312 CfgBuilder]: Removed 10 assume(true) statements. [2024-12-02 11:03:49,347 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 02.12 11:03:49 BoogieIcfgContainer [2024-12-02 11:03:49,347 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2024-12-02 11:03:49,350 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2024-12-02 11:03:49,350 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2024-12-02 11:03:49,354 INFO L274 PluginConnector]: TraceAbstraction initialized [2024-12-02 11:03:49,354 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 02.12 11:03:48" (1/3) ... [2024-12-02 11:03:49,355 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@dba3a and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 02.12 11:03:49, skipping insertion in model container [2024-12-02 11:03:49,355 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.12 11:03:48" (2/3) ... [2024-12-02 11:03:49,355 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@dba3a and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 02.12 11:03:49, skipping insertion in model container [2024-12-02 11:03:49,355 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 02.12 11:03:49" (3/3) ... [2024-12-02 11:03:49,356 INFO L128 eAbstractionObserver]: Analyzing ICFG token_ring.02.cil-1.c [2024-12-02 11:03:49,371 INFO L216 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2024-12-02 11:03:49,373 INFO L151 ceAbstractionStarter]: Applying trace abstraction to ICFG token_ring.02.cil-1.c that has 7 procedures, 140 locations, 1 initial locations, 5 loop locations, and 6 error locations. [2024-12-02 11:03:49,422 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2024-12-02 11:03:49,434 INFO L333 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, mAutomataTypeConcurrency=PETRI_NET, mHoareTripleChecks=INCREMENTAL, mHoareAnnotationPositions=LoopHeads, mDumpOnlyReuseAutomata=false, mLimitTraceHistogram=0, mErrorLocTimeLimit=0, mLimitPathProgramCount=0, mCollectInterpolantStatistics=true, mHeuristicEmptinessCheck=false, mHeuristicEmptinessCheckAStarHeuristic=ZERO, mHeuristicEmptinessCheckAStarHeuristicRandomSeed=1337, mHeuristicEmptinessCheckSmtFeatureScoringMethod=DAGSIZE, mSMTFeatureExtraction=false, mSMTFeatureExtractionDumpPath=., mOverrideInterpolantAutomaton=false, mMcrInterpolantMethod=WP, mPorIndependenceSettings=[Lde.uni_freiburg.informatik.ultimate.lib.tracecheckerutils.partialorder.independence.IndependenceSettings;@7d77f2a7, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2024-12-02 11:03:49,434 INFO L334 AbstractCegarLoop]: Starting to check reachability of 6 error locations. [2024-12-02 11:03:49,438 INFO L276 IsEmpty]: Start isEmpty. Operand has 140 states, 112 states have (on average 1.5803571428571428) internal successors, (177), 118 states have internal predecessors, (177), 16 states have call successors, (16), 6 states have call predecessors, (16), 6 states have return successors, (16), 16 states have call predecessors, (16), 16 states have call successors, (16) [2024-12-02 11:03:49,446 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 65 [2024-12-02 11:03:49,446 INFO L210 NwaCegarLoop]: Found error trace [2024-12-02 11:03:49,447 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-12-02 11:03:49,447 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 3 more)] === [2024-12-02 11:03:49,451 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-12-02 11:03:49,451 INFO L85 PathProgramCache]: Analyzing trace with hash -83635361, now seen corresponding path program 1 times [2024-12-02 11:03:49,456 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-12-02 11:03:49,456 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1526482749] [2024-12-02 11:03:49,457 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-12-02 11:03:49,457 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-12-02 11:03:49,537 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-12-02 11:03:49,673 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-12-02 11:03:49,673 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-12-02 11:03:49,673 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1526482749] [2024-12-02 11:03:49,674 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1526482749] provided 1 perfect and 0 imperfect interpolant sequences [2024-12-02 11:03:49,674 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-12-02 11:03:49,674 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-12-02 11:03:49,675 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1732445223] [2024-12-02 11:03:49,676 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-12-02 11:03:49,680 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-12-02 11:03:49,680 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-12-02 11:03:49,698 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-12-02 11:03:49,698 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-12-02 11:03:49,700 INFO L87 Difference]: Start difference. First operand has 140 states, 112 states have (on average 1.5803571428571428) internal successors, (177), 118 states have internal predecessors, (177), 16 states have call successors, (16), 6 states have call predecessors, (16), 6 states have return successors, (16), 16 states have call predecessors, (16), 16 states have call successors, (16) Second operand has 3 states, 3 states have (on average 18.0) internal successors, (54), 3 states have internal predecessors, (54), 2 states have call successors, (5), 1 states have call predecessors, (5), 1 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) [2024-12-02 11:03:49,745 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-12-02 11:03:49,746 INFO L93 Difference]: Finished difference Result 272 states and 408 transitions. [2024-12-02 11:03:49,747 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-12-02 11:03:49,748 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 18.0) internal successors, (54), 3 states have internal predecessors, (54), 2 states have call successors, (5), 1 states have call predecessors, (5), 1 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) Word has length 64 [2024-12-02 11:03:49,749 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-12-02 11:03:49,757 INFO L225 Difference]: With dead ends: 272 [2024-12-02 11:03:49,757 INFO L226 Difference]: Without dead ends: 133 [2024-12-02 11:03:49,760 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-12-02 11:03:49,763 INFO L435 NwaCegarLoop]: 194 mSDtfsCounter, 190 mSDsluCounter, 0 mSDsCounter, 0 mSdLazyCounter, 2 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 190 SdHoareTripleChecker+Valid, 194 SdHoareTripleChecker+Invalid, 2 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 2 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-12-02 11:03:49,763 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [190 Valid, 194 Invalid, 2 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 2 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-12-02 11:03:49,776 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 133 states. [2024-12-02 11:03:49,800 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 133 to 133. [2024-12-02 11:03:49,802 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 133 states, 105 states have (on average 1.5047619047619047) internal successors, (158), 111 states have internal predecessors, (158), 16 states have call successors, (16), 6 states have call predecessors, (16), 6 states have return successors, (16), 16 states have call predecessors, (16), 16 states have call successors, (16) [2024-12-02 11:03:49,806 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 133 states to 133 states and 190 transitions. [2024-12-02 11:03:49,808 INFO L78 Accepts]: Start accepts. Automaton has 133 states and 190 transitions. Word has length 64 [2024-12-02 11:03:49,809 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-12-02 11:03:49,809 INFO L471 AbstractCegarLoop]: Abstraction has 133 states and 190 transitions. [2024-12-02 11:03:49,809 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 18.0) internal successors, (54), 3 states have internal predecessors, (54), 2 states have call successors, (5), 1 states have call predecessors, (5), 1 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) [2024-12-02 11:03:49,809 INFO L276 IsEmpty]: Start isEmpty. Operand 133 states and 190 transitions. [2024-12-02 11:03:49,811 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 65 [2024-12-02 11:03:49,811 INFO L210 NwaCegarLoop]: Found error trace [2024-12-02 11:03:49,811 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-12-02 11:03:49,812 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2024-12-02 11:03:49,812 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 3 more)] === [2024-12-02 11:03:49,813 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-12-02 11:03:49,813 INFO L85 PathProgramCache]: Analyzing trace with hash -1344552611, now seen corresponding path program 1 times [2024-12-02 11:03:49,813 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-12-02 11:03:49,813 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [938322] [2024-12-02 11:03:49,813 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-12-02 11:03:49,813 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-12-02 11:03:49,837 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-12-02 11:03:49,967 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-12-02 11:03:49,967 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-12-02 11:03:49,967 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [938322] [2024-12-02 11:03:49,968 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [938322] provided 1 perfect and 0 imperfect interpolant sequences [2024-12-02 11:03:49,968 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-12-02 11:03:49,968 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2024-12-02 11:03:49,968 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [800213478] [2024-12-02 11:03:49,968 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-12-02 11:03:49,969 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2024-12-02 11:03:49,969 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-12-02 11:03:49,970 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2024-12-02 11:03:49,970 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2024-12-02 11:03:49,970 INFO L87 Difference]: Start difference. First operand 133 states and 190 transitions. Second operand has 5 states, 5 states have (on average 10.8) internal successors, (54), 4 states have internal predecessors, (54), 2 states have call successors, (5), 2 states have call predecessors, (5), 2 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) [2024-12-02 11:03:50,314 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-12-02 11:03:50,314 INFO L93 Difference]: Finished difference Result 387 states and 560 transitions. [2024-12-02 11:03:50,314 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2024-12-02 11:03:50,314 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 10.8) internal successors, (54), 4 states have internal predecessors, (54), 2 states have call successors, (5), 2 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 64 [2024-12-02 11:03:50,314 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-12-02 11:03:50,318 INFO L225 Difference]: With dead ends: 387 [2024-12-02 11:03:50,318 INFO L226 Difference]: Without dead ends: 264 [2024-12-02 11:03:50,319 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2024-12-02 11:03:50,320 INFO L435 NwaCegarLoop]: 147 mSDtfsCounter, 307 mSDsluCounter, 356 mSDsCounter, 0 mSdLazyCounter, 222 mSolverCounterSat, 36 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 317 SdHoareTripleChecker+Valid, 503 SdHoareTripleChecker+Invalid, 258 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 36 IncrementalHoareTripleChecker+Valid, 222 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2024-12-02 11:03:50,320 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [317 Valid, 503 Invalid, 258 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [36 Valid, 222 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2024-12-02 11:03:50,321 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 264 states. [2024-12-02 11:03:50,344 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 264 to 251. [2024-12-02 11:03:50,345 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 251 states, 205 states have (on average 1.5170731707317073) internal successors, (311), 212 states have internal predecessors, (311), 27 states have call successors, (27), 12 states have call predecessors, (27), 13 states have return successors, (28), 27 states have call predecessors, (28), 27 states have call successors, (28) [2024-12-02 11:03:50,347 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 251 states to 251 states and 366 transitions. [2024-12-02 11:03:50,348 INFO L78 Accepts]: Start accepts. Automaton has 251 states and 366 transitions. Word has length 64 [2024-12-02 11:03:50,348 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-12-02 11:03:50,348 INFO L471 AbstractCegarLoop]: Abstraction has 251 states and 366 transitions. [2024-12-02 11:03:50,348 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 10.8) internal successors, (54), 4 states have internal predecessors, (54), 2 states have call successors, (5), 2 states have call predecessors, (5), 2 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) [2024-12-02 11:03:50,349 INFO L276 IsEmpty]: Start isEmpty. Operand 251 states and 366 transitions. [2024-12-02 11:03:50,350 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 65 [2024-12-02 11:03:50,350 INFO L210 NwaCegarLoop]: Found error trace [2024-12-02 11:03:50,350 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-12-02 11:03:50,350 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2024-12-02 11:03:50,350 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 3 more)] === [2024-12-02 11:03:50,351 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-12-02 11:03:50,351 INFO L85 PathProgramCache]: Analyzing trace with hash 412642137, now seen corresponding path program 1 times [2024-12-02 11:03:50,351 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-12-02 11:03:50,351 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1336618297] [2024-12-02 11:03:50,351 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-12-02 11:03:50,351 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-12-02 11:03:50,366 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-12-02 11:03:50,497 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-12-02 11:03:50,497 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-12-02 11:03:50,498 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1336618297] [2024-12-02 11:03:50,498 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1336618297] provided 1 perfect and 0 imperfect interpolant sequences [2024-12-02 11:03:50,498 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-12-02 11:03:50,498 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2024-12-02 11:03:50,498 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [948530430] [2024-12-02 11:03:50,498 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-12-02 11:03:50,498 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2024-12-02 11:03:50,499 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-12-02 11:03:50,499 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2024-12-02 11:03:50,499 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2024-12-02 11:03:50,500 INFO L87 Difference]: Start difference. First operand 251 states and 366 transitions. Second operand has 6 states, 6 states have (on average 9.0) internal successors, (54), 5 states have internal predecessors, (54), 2 states have call successors, (5), 2 states have call predecessors, (5), 2 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) [2024-12-02 11:03:50,922 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-12-02 11:03:50,922 INFO L93 Difference]: Finished difference Result 640 states and 937 transitions. [2024-12-02 11:03:50,922 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2024-12-02 11:03:50,923 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 9.0) internal successors, (54), 5 states have internal predecessors, (54), 2 states have call successors, (5), 2 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 64 [2024-12-02 11:03:50,923 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-12-02 11:03:50,926 INFO L225 Difference]: With dead ends: 640 [2024-12-02 11:03:50,926 INFO L226 Difference]: Without dead ends: 399 [2024-12-02 11:03:50,927 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=24, Invalid=48, Unknown=0, NotChecked=0, Total=72 [2024-12-02 11:03:50,928 INFO L435 NwaCegarLoop]: 240 mSDtfsCounter, 297 mSDsluCounter, 692 mSDsCounter, 0 mSdLazyCounter, 422 mSolverCounterSat, 22 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 307 SdHoareTripleChecker+Valid, 932 SdHoareTripleChecker+Invalid, 444 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 22 IncrementalHoareTripleChecker+Valid, 422 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2024-12-02 11:03:50,928 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [307 Valid, 932 Invalid, 444 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [22 Valid, 422 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2024-12-02 11:03:50,930 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 399 states. [2024-12-02 11:03:50,957 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 399 to 362. [2024-12-02 11:03:50,958 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 362 states, 298 states have (on average 1.5100671140939597) internal successors, (450), 306 states have internal predecessors, (450), 38 states have call successors, (38), 18 states have call predecessors, (38), 20 states have return successors, (42), 39 states have call predecessors, (42), 38 states have call successors, (42) [2024-12-02 11:03:50,960 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 362 states to 362 states and 530 transitions. [2024-12-02 11:03:50,960 INFO L78 Accepts]: Start accepts. Automaton has 362 states and 530 transitions. Word has length 64 [2024-12-02 11:03:50,961 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-12-02 11:03:50,961 INFO L471 AbstractCegarLoop]: Abstraction has 362 states and 530 transitions. [2024-12-02 11:03:50,961 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 9.0) internal successors, (54), 5 states have internal predecessors, (54), 2 states have call successors, (5), 2 states have call predecessors, (5), 2 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) [2024-12-02 11:03:50,961 INFO L276 IsEmpty]: Start isEmpty. Operand 362 states and 530 transitions. [2024-12-02 11:03:50,962 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 65 [2024-12-02 11:03:50,962 INFO L210 NwaCegarLoop]: Found error trace [2024-12-02 11:03:50,963 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-12-02 11:03:50,963 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2024-12-02 11:03:50,963 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 3 more)] === [2024-12-02 11:03:50,963 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-12-02 11:03:50,963 INFO L85 PathProgramCache]: Analyzing trace with hash -1615943973, now seen corresponding path program 1 times [2024-12-02 11:03:50,963 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-12-02 11:03:50,964 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1237470656] [2024-12-02 11:03:50,964 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-12-02 11:03:50,964 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-12-02 11:03:50,979 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-12-02 11:03:51,100 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-12-02 11:03:51,100 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-12-02 11:03:51,100 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1237470656] [2024-12-02 11:03:51,101 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1237470656] provided 1 perfect and 0 imperfect interpolant sequences [2024-12-02 11:03:51,101 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-12-02 11:03:51,101 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2024-12-02 11:03:51,101 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1960373403] [2024-12-02 11:03:51,101 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-12-02 11:03:51,102 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2024-12-02 11:03:51,102 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-12-02 11:03:51,102 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2024-12-02 11:03:51,102 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2024-12-02 11:03:51,103 INFO L87 Difference]: Start difference. First operand 362 states and 530 transitions. Second operand has 6 states, 6 states have (on average 9.0) internal successors, (54), 5 states have internal predecessors, (54), 2 states have call successors, (5), 2 states have call predecessors, (5), 2 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) [2024-12-02 11:03:51,496 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-12-02 11:03:51,496 INFO L93 Difference]: Finished difference Result 983 states and 1448 transitions. [2024-12-02 11:03:51,497 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2024-12-02 11:03:51,497 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 9.0) internal successors, (54), 5 states have internal predecessors, (54), 2 states have call successors, (5), 2 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 64 [2024-12-02 11:03:51,497 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-12-02 11:03:51,501 INFO L225 Difference]: With dead ends: 983 [2024-12-02 11:03:51,501 INFO L226 Difference]: Without dead ends: 631 [2024-12-02 11:03:51,503 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=24, Invalid=48, Unknown=0, NotChecked=0, Total=72 [2024-12-02 11:03:51,504 INFO L435 NwaCegarLoop]: 149 mSDtfsCounter, 304 mSDsluCounter, 484 mSDsCounter, 0 mSdLazyCounter, 339 mSolverCounterSat, 34 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 314 SdHoareTripleChecker+Valid, 633 SdHoareTripleChecker+Invalid, 373 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 34 IncrementalHoareTripleChecker+Valid, 339 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2024-12-02 11:03:51,504 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [314 Valid, 633 Invalid, 373 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [34 Valid, 339 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2024-12-02 11:03:51,505 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 631 states. [2024-12-02 11:03:51,571 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 631 to 593. [2024-12-02 11:03:51,572 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 593 states, 491 states have (on average 1.505091649694501) internal successors, (739), 503 states have internal predecessors, (739), 60 states have call successors, (60), 30 states have call predecessors, (60), 36 states have return successors, (76), 63 states have call predecessors, (76), 60 states have call successors, (76) [2024-12-02 11:03:51,575 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 593 states to 593 states and 875 transitions. [2024-12-02 11:03:51,576 INFO L78 Accepts]: Start accepts. Automaton has 593 states and 875 transitions. Word has length 64 [2024-12-02 11:03:51,576 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-12-02 11:03:51,576 INFO L471 AbstractCegarLoop]: Abstraction has 593 states and 875 transitions. [2024-12-02 11:03:51,576 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 9.0) internal successors, (54), 5 states have internal predecessors, (54), 2 states have call successors, (5), 2 states have call predecessors, (5), 2 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) [2024-12-02 11:03:51,576 INFO L276 IsEmpty]: Start isEmpty. Operand 593 states and 875 transitions. [2024-12-02 11:03:51,578 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 65 [2024-12-02 11:03:51,578 INFO L210 NwaCegarLoop]: Found error trace [2024-12-02 11:03:51,578 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-12-02 11:03:51,578 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2024-12-02 11:03:51,579 INFO L396 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 3 more)] === [2024-12-02 11:03:51,579 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-12-02 11:03:51,579 INFO L85 PathProgramCache]: Analyzing trace with hash -2097024231, now seen corresponding path program 1 times [2024-12-02 11:03:51,579 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-12-02 11:03:51,579 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [655182637] [2024-12-02 11:03:51,579 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-12-02 11:03:51,579 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-12-02 11:03:51,590 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-12-02 11:03:51,693 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-12-02 11:03:51,693 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-12-02 11:03:51,693 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [655182637] [2024-12-02 11:03:51,693 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [655182637] provided 1 perfect and 0 imperfect interpolant sequences [2024-12-02 11:03:51,693 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-12-02 11:03:51,693 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2024-12-02 11:03:51,693 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [488226917] [2024-12-02 11:03:51,693 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-12-02 11:03:51,694 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2024-12-02 11:03:51,694 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-12-02 11:03:51,694 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2024-12-02 11:03:51,694 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2024-12-02 11:03:51,694 INFO L87 Difference]: Start difference. First operand 593 states and 875 transitions. Second operand has 6 states, 6 states have (on average 9.0) internal successors, (54), 5 states have internal predecessors, (54), 2 states have call successors, (5), 2 states have call predecessors, (5), 2 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) [2024-12-02 11:03:52,143 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-12-02 11:03:52,143 INFO L93 Difference]: Finished difference Result 1728 states and 2568 transitions. [2024-12-02 11:03:52,143 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2024-12-02 11:03:52,144 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 9.0) internal successors, (54), 5 states have internal predecessors, (54), 2 states have call successors, (5), 2 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 64 [2024-12-02 11:03:52,144 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-12-02 11:03:52,150 INFO L225 Difference]: With dead ends: 1728 [2024-12-02 11:03:52,151 INFO L226 Difference]: Without dead ends: 1145 [2024-12-02 11:03:52,153 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 11 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=24, Invalid=48, Unknown=0, NotChecked=0, Total=72 [2024-12-02 11:03:52,153 INFO L435 NwaCegarLoop]: 226 mSDtfsCounter, 296 mSDsluCounter, 647 mSDsCounter, 0 mSdLazyCounter, 475 mSolverCounterSat, 24 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 305 SdHoareTripleChecker+Valid, 873 SdHoareTripleChecker+Invalid, 499 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 24 IncrementalHoareTripleChecker+Valid, 475 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2024-12-02 11:03:52,154 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [305 Valid, 873 Invalid, 499 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [24 Valid, 475 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2024-12-02 11:03:52,156 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1145 states. [2024-12-02 11:03:52,233 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1145 to 1031. [2024-12-02 11:03:52,235 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1031 states, 851 states have (on average 1.4958871915393654) internal successors, (1273), 877 states have internal predecessors, (1273), 100 states have call successors, (100), 54 states have call predecessors, (100), 74 states have return successors, (164), 107 states have call predecessors, (164), 100 states have call successors, (164) [2024-12-02 11:03:52,242 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1031 states to 1031 states and 1537 transitions. [2024-12-02 11:03:52,243 INFO L78 Accepts]: Start accepts. Automaton has 1031 states and 1537 transitions. Word has length 64 [2024-12-02 11:03:52,243 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-12-02 11:03:52,243 INFO L471 AbstractCegarLoop]: Abstraction has 1031 states and 1537 transitions. [2024-12-02 11:03:52,244 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 9.0) internal successors, (54), 5 states have internal predecessors, (54), 2 states have call successors, (5), 2 states have call predecessors, (5), 2 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) [2024-12-02 11:03:52,244 INFO L276 IsEmpty]: Start isEmpty. Operand 1031 states and 1537 transitions. [2024-12-02 11:03:52,245 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 65 [2024-12-02 11:03:52,245 INFO L210 NwaCegarLoop]: Found error trace [2024-12-02 11:03:52,246 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-12-02 11:03:52,246 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2024-12-02 11:03:52,246 INFO L396 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 3 more)] === [2024-12-02 11:03:52,246 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-12-02 11:03:52,246 INFO L85 PathProgramCache]: Analyzing trace with hash -157862185, now seen corresponding path program 1 times [2024-12-02 11:03:52,246 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-12-02 11:03:52,246 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [600117358] [2024-12-02 11:03:52,246 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-12-02 11:03:52,247 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-12-02 11:03:52,256 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-12-02 11:03:52,344 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-12-02 11:03:52,344 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-12-02 11:03:52,344 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [600117358] [2024-12-02 11:03:52,344 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [600117358] provided 1 perfect and 0 imperfect interpolant sequences [2024-12-02 11:03:52,344 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-12-02 11:03:52,344 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2024-12-02 11:03:52,344 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [249810858] [2024-12-02 11:03:52,345 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-12-02 11:03:52,345 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2024-12-02 11:03:52,345 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-12-02 11:03:52,345 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2024-12-02 11:03:52,345 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2024-12-02 11:03:52,346 INFO L87 Difference]: Start difference. First operand 1031 states and 1537 transitions. Second operand has 6 states, 6 states have (on average 9.0) internal successors, (54), 5 states have internal predecessors, (54), 2 states have call successors, (5), 2 states have call predecessors, (5), 2 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) [2024-12-02 11:03:52,806 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-12-02 11:03:52,807 INFO L93 Difference]: Finished difference Result 3066 states and 4636 transitions. [2024-12-02 11:03:52,807 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2024-12-02 11:03:52,807 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 9.0) internal successors, (54), 5 states have internal predecessors, (54), 2 states have call successors, (5), 2 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 64 [2024-12-02 11:03:52,807 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-12-02 11:03:52,819 INFO L225 Difference]: With dead ends: 3066 [2024-12-02 11:03:52,819 INFO L226 Difference]: Without dead ends: 2045 [2024-12-02 11:03:52,822 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 11 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=24, Invalid=48, Unknown=0, NotChecked=0, Total=72 [2024-12-02 11:03:52,823 INFO L435 NwaCegarLoop]: 224 mSDtfsCounter, 293 mSDsluCounter, 641 mSDsCounter, 0 mSdLazyCounter, 425 mSolverCounterSat, 25 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 306 SdHoareTripleChecker+Valid, 865 SdHoareTripleChecker+Invalid, 450 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 25 IncrementalHoareTripleChecker+Valid, 425 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2024-12-02 11:03:52,823 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [306 Valid, 865 Invalid, 450 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [25 Valid, 425 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2024-12-02 11:03:52,825 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2045 states. [2024-12-02 11:03:52,970 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2045 to 1938. [2024-12-02 11:03:52,974 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1938 states, 1588 states have (on average 1.4767002518891688) internal successors, (2345), 1660 states have internal predecessors, (2345), 176 states have call successors, (176), 102 states have call predecessors, (176), 168 states have return successors, (432), 191 states have call predecessors, (432), 176 states have call successors, (432) [2024-12-02 11:03:52,986 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1938 states to 1938 states and 2953 transitions. [2024-12-02 11:03:52,987 INFO L78 Accepts]: Start accepts. Automaton has 1938 states and 2953 transitions. Word has length 64 [2024-12-02 11:03:52,987 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-12-02 11:03:52,987 INFO L471 AbstractCegarLoop]: Abstraction has 1938 states and 2953 transitions. [2024-12-02 11:03:52,988 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 9.0) internal successors, (54), 5 states have internal predecessors, (54), 2 states have call successors, (5), 2 states have call predecessors, (5), 2 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) [2024-12-02 11:03:52,988 INFO L276 IsEmpty]: Start isEmpty. Operand 1938 states and 2953 transitions. [2024-12-02 11:03:52,990 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 65 [2024-12-02 11:03:52,990 INFO L210 NwaCegarLoop]: Found error trace [2024-12-02 11:03:52,990 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-12-02 11:03:52,990 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2024-12-02 11:03:52,990 INFO L396 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 3 more)] === [2024-12-02 11:03:52,990 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-12-02 11:03:52,990 INFO L85 PathProgramCache]: Analyzing trace with hash -510950567, now seen corresponding path program 1 times [2024-12-02 11:03:52,991 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-12-02 11:03:52,991 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [564342510] [2024-12-02 11:03:52,991 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-12-02 11:03:52,991 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-12-02 11:03:52,999 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-12-02 11:03:53,040 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-12-02 11:03:53,040 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-12-02 11:03:53,040 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [564342510] [2024-12-02 11:03:53,040 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [564342510] provided 1 perfect and 0 imperfect interpolant sequences [2024-12-02 11:03:53,040 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-12-02 11:03:53,040 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2024-12-02 11:03:53,040 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [772482950] [2024-12-02 11:03:53,040 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-12-02 11:03:53,041 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-12-02 11:03:53,041 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-12-02 11:03:53,041 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-12-02 11:03:53,041 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-12-02 11:03:53,042 INFO L87 Difference]: Start difference. First operand 1938 states and 2953 transitions. Second operand has 4 states, 4 states have (on average 13.5) internal successors, (54), 4 states have internal predecessors, (54), 2 states have call successors, (5), 1 states have call predecessors, (5), 2 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) [2024-12-02 11:03:53,295 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-12-02 11:03:53,295 INFO L93 Difference]: Finished difference Result 4903 states and 7546 transitions. [2024-12-02 11:03:53,295 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-12-02 11:03:53,295 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 13.5) internal successors, (54), 4 states have internal predecessors, (54), 2 states have call successors, (5), 1 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 64 [2024-12-02 11:03:53,295 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-12-02 11:03:53,310 INFO L225 Difference]: With dead ends: 4903 [2024-12-02 11:03:53,310 INFO L226 Difference]: Without dead ends: 2976 [2024-12-02 11:03:53,317 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-12-02 11:03:53,317 INFO L435 NwaCegarLoop]: 342 mSDtfsCounter, 317 mSDsluCounter, 283 mSDsCounter, 0 mSdLazyCounter, 69 mSolverCounterSat, 7 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 317 SdHoareTripleChecker+Valid, 625 SdHoareTripleChecker+Invalid, 76 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 7 IncrementalHoareTripleChecker+Valid, 69 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-12-02 11:03:53,318 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [317 Valid, 625 Invalid, 76 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [7 Valid, 69 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-12-02 11:03:53,321 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2976 states. [2024-12-02 11:03:53,517 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2976 to 2891. [2024-12-02 11:03:53,522 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 2891 states, 2371 states have (on average 1.4550822437789963) internal successors, (3450), 2472 states have internal predecessors, (3450), 272 states have call successors, (272), 156 states have call predecessors, (272), 242 states have return successors, (585), 278 states have call predecessors, (585), 272 states have call successors, (585) [2024-12-02 11:03:53,537 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2891 states to 2891 states and 4307 transitions. [2024-12-02 11:03:53,539 INFO L78 Accepts]: Start accepts. Automaton has 2891 states and 4307 transitions. Word has length 64 [2024-12-02 11:03:53,539 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-12-02 11:03:53,539 INFO L471 AbstractCegarLoop]: Abstraction has 2891 states and 4307 transitions. [2024-12-02 11:03:53,539 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 13.5) internal successors, (54), 4 states have internal predecessors, (54), 2 states have call successors, (5), 1 states have call predecessors, (5), 2 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) [2024-12-02 11:03:53,539 INFO L276 IsEmpty]: Start isEmpty. Operand 2891 states and 4307 transitions. [2024-12-02 11:03:53,541 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 66 [2024-12-02 11:03:53,541 INFO L210 NwaCegarLoop]: Found error trace [2024-12-02 11:03:53,541 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-12-02 11:03:53,541 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2024-12-02 11:03:53,542 INFO L396 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 3 more)] === [2024-12-02 11:03:53,542 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-12-02 11:03:53,542 INFO L85 PathProgramCache]: Analyzing trace with hash 483198929, now seen corresponding path program 1 times [2024-12-02 11:03:53,542 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-12-02 11:03:53,542 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1494330676] [2024-12-02 11:03:53,542 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-12-02 11:03:53,542 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-12-02 11:03:53,563 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-12-02 11:03:53,620 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-12-02 11:03:53,620 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-12-02 11:03:53,620 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1494330676] [2024-12-02 11:03:53,620 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1494330676] provided 1 perfect and 0 imperfect interpolant sequences [2024-12-02 11:03:53,620 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-12-02 11:03:53,620 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2024-12-02 11:03:53,620 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1076169903] [2024-12-02 11:03:53,620 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-12-02 11:03:53,621 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2024-12-02 11:03:53,621 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-12-02 11:03:53,621 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2024-12-02 11:03:53,621 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2024-12-02 11:03:53,622 INFO L87 Difference]: Start difference. First operand 2891 states and 4307 transitions. Second operand has 5 states, 5 states have (on average 11.0) internal successors, (55), 5 states have internal predecessors, (55), 2 states have call successors, (5), 1 states have call predecessors, (5), 2 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) [2024-12-02 11:03:53,820 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-12-02 11:03:53,821 INFO L93 Difference]: Finished difference Result 5798 states and 8747 transitions. [2024-12-02 11:03:53,821 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-12-02 11:03:53,821 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 11.0) internal successors, (55), 5 states have internal predecessors, (55), 2 states have call successors, (5), 1 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 65 [2024-12-02 11:03:53,821 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-12-02 11:03:53,836 INFO L225 Difference]: With dead ends: 5798 [2024-12-02 11:03:53,836 INFO L226 Difference]: Without dead ends: 2918 [2024-12-02 11:03:53,844 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2024-12-02 11:03:53,844 INFO L435 NwaCegarLoop]: 186 mSDtfsCounter, 0 mSDsluCounter, 552 mSDsCounter, 0 mSdLazyCounter, 17 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 738 SdHoareTripleChecker+Invalid, 17 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 17 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-12-02 11:03:53,844 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 738 Invalid, 17 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 17 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-12-02 11:03:53,848 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2918 states. [2024-12-02 11:03:54,031 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2918 to 2918. [2024-12-02 11:03:54,037 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 2918 states, 2398 states have (on average 1.4428690575479566) internal successors, (3460), 2499 states have internal predecessors, (3460), 272 states have call successors, (272), 156 states have call predecessors, (272), 242 states have return successors, (585), 278 states have call predecessors, (585), 272 states have call successors, (585) [2024-12-02 11:03:54,049 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2918 states to 2918 states and 4317 transitions. [2024-12-02 11:03:54,052 INFO L78 Accepts]: Start accepts. Automaton has 2918 states and 4317 transitions. Word has length 65 [2024-12-02 11:03:54,052 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-12-02 11:03:54,052 INFO L471 AbstractCegarLoop]: Abstraction has 2918 states and 4317 transitions. [2024-12-02 11:03:54,052 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 11.0) internal successors, (55), 5 states have internal predecessors, (55), 2 states have call successors, (5), 1 states have call predecessors, (5), 2 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) [2024-12-02 11:03:54,052 INFO L276 IsEmpty]: Start isEmpty. Operand 2918 states and 4317 transitions. [2024-12-02 11:03:54,054 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 66 [2024-12-02 11:03:54,055 INFO L210 NwaCegarLoop]: Found error trace [2024-12-02 11:03:54,055 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-12-02 11:03:54,055 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2024-12-02 11:03:54,055 INFO L396 AbstractCegarLoop]: === Iteration 9 === Targeting ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 3 more)] === [2024-12-02 11:03:54,055 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-12-02 11:03:54,055 INFO L85 PathProgramCache]: Analyzing trace with hash -1362168237, now seen corresponding path program 1 times [2024-12-02 11:03:54,056 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-12-02 11:03:54,056 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1000681445] [2024-12-02 11:03:54,056 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-12-02 11:03:54,056 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-12-02 11:03:54,064 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-12-02 11:03:54,106 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-12-02 11:03:54,106 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-12-02 11:03:54,106 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1000681445] [2024-12-02 11:03:54,107 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1000681445] provided 1 perfect and 0 imperfect interpolant sequences [2024-12-02 11:03:54,107 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-12-02 11:03:54,107 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2024-12-02 11:03:54,107 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [160360980] [2024-12-02 11:03:54,107 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-12-02 11:03:54,107 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2024-12-02 11:03:54,107 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-12-02 11:03:54,108 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2024-12-02 11:03:54,108 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2024-12-02 11:03:54,108 INFO L87 Difference]: Start difference. First operand 2918 states and 4317 transitions. Second operand has 5 states, 5 states have (on average 11.0) internal successors, (55), 5 states have internal predecessors, (55), 2 states have call successors, (5), 1 states have call predecessors, (5), 2 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) [2024-12-02 11:03:54,270 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-12-02 11:03:54,270 INFO L93 Difference]: Finished difference Result 5903 states and 8835 transitions. [2024-12-02 11:03:54,271 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-12-02 11:03:54,271 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 11.0) internal successors, (55), 5 states have internal predecessors, (55), 2 states have call successors, (5), 1 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 65 [2024-12-02 11:03:54,271 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-12-02 11:03:54,287 INFO L225 Difference]: With dead ends: 5903 [2024-12-02 11:03:54,287 INFO L226 Difference]: Without dead ends: 2996 [2024-12-02 11:03:54,295 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2024-12-02 11:03:54,296 INFO L435 NwaCegarLoop]: 186 mSDtfsCounter, 0 mSDsluCounter, 552 mSDsCounter, 0 mSdLazyCounter, 17 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 738 SdHoareTripleChecker+Invalid, 17 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 17 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-12-02 11:03:54,296 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 738 Invalid, 17 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 17 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-12-02 11:03:54,299 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2996 states. [2024-12-02 11:03:54,488 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2996 to 2996. [2024-12-02 11:03:54,493 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 2996 states, 2476 states have (on average 1.4289176090468498) internal successors, (3538), 2577 states have internal predecessors, (3538), 272 states have call successors, (272), 156 states have call predecessors, (272), 242 states have return successors, (585), 278 states have call predecessors, (585), 272 states have call successors, (585) [2024-12-02 11:03:54,505 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2996 states to 2996 states and 4395 transitions. [2024-12-02 11:03:54,507 INFO L78 Accepts]: Start accepts. Automaton has 2996 states and 4395 transitions. Word has length 65 [2024-12-02 11:03:54,507 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-12-02 11:03:54,508 INFO L471 AbstractCegarLoop]: Abstraction has 2996 states and 4395 transitions. [2024-12-02 11:03:54,508 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 11.0) internal successors, (55), 5 states have internal predecessors, (55), 2 states have call successors, (5), 1 states have call predecessors, (5), 2 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) [2024-12-02 11:03:54,508 INFO L276 IsEmpty]: Start isEmpty. Operand 2996 states and 4395 transitions. [2024-12-02 11:03:54,510 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 66 [2024-12-02 11:03:54,510 INFO L210 NwaCegarLoop]: Found error trace [2024-12-02 11:03:54,510 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-12-02 11:03:54,510 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2024-12-02 11:03:54,510 INFO L396 AbstractCegarLoop]: === Iteration 10 === Targeting ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 3 more)] === [2024-12-02 11:03:54,510 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-12-02 11:03:54,510 INFO L85 PathProgramCache]: Analyzing trace with hash -1434554795, now seen corresponding path program 1 times [2024-12-02 11:03:54,510 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-12-02 11:03:54,510 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1679172440] [2024-12-02 11:03:54,511 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-12-02 11:03:54,511 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-12-02 11:03:54,519 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-12-02 11:03:54,562 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-12-02 11:03:54,563 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-12-02 11:03:54,563 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1679172440] [2024-12-02 11:03:54,563 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1679172440] provided 1 perfect and 0 imperfect interpolant sequences [2024-12-02 11:03:54,563 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-12-02 11:03:54,563 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2024-12-02 11:03:54,563 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [565214222] [2024-12-02 11:03:54,563 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-12-02 11:03:54,563 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2024-12-02 11:03:54,563 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-12-02 11:03:54,564 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2024-12-02 11:03:54,564 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2024-12-02 11:03:54,564 INFO L87 Difference]: Start difference. First operand 2996 states and 4395 transitions. Second operand has 5 states, 5 states have (on average 11.0) internal successors, (55), 5 states have internal predecessors, (55), 2 states have call successors, (5), 1 states have call predecessors, (5), 2 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) [2024-12-02 11:03:55,080 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-12-02 11:03:55,080 INFO L93 Difference]: Finished difference Result 9645 states and 14181 transitions. [2024-12-02 11:03:55,081 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-12-02 11:03:55,081 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 11.0) internal successors, (55), 5 states have internal predecessors, (55), 2 states have call successors, (5), 1 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 65 [2024-12-02 11:03:55,081 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-12-02 11:03:55,102 INFO L225 Difference]: With dead ends: 9645 [2024-12-02 11:03:55,103 INFO L226 Difference]: Without dead ends: 6464 [2024-12-02 11:03:55,109 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=15, Invalid=27, Unknown=0, NotChecked=0, Total=42 [2024-12-02 11:03:55,110 INFO L435 NwaCegarLoop]: 320 mSDtfsCounter, 649 mSDsluCounter, 420 mSDsCounter, 0 mSdLazyCounter, 134 mSolverCounterSat, 119 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 654 SdHoareTripleChecker+Valid, 740 SdHoareTripleChecker+Invalid, 253 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 119 IncrementalHoareTripleChecker+Valid, 134 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2024-12-02 11:03:55,110 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [654 Valid, 740 Invalid, 253 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [119 Valid, 134 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2024-12-02 11:03:55,115 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 6464 states. [2024-12-02 11:03:55,377 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 6464 to 5922. [2024-12-02 11:03:55,382 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 5922 states, 4904 states have (on average 1.4200652528548123) internal successors, (6964), 5106 states have internal predecessors, (6964), 515 states have call successors, (515), 311 states have call predecessors, (515), 497 states have return successors, (1155), 520 states have call predecessors, (1155), 515 states have call successors, (1155) [2024-12-02 11:03:55,395 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5922 states to 5922 states and 8634 transitions. [2024-12-02 11:03:55,398 INFO L78 Accepts]: Start accepts. Automaton has 5922 states and 8634 transitions. Word has length 65 [2024-12-02 11:03:55,398 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-12-02 11:03:55,398 INFO L471 AbstractCegarLoop]: Abstraction has 5922 states and 8634 transitions. [2024-12-02 11:03:55,398 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 11.0) internal successors, (55), 5 states have internal predecessors, (55), 2 states have call successors, (5), 1 states have call predecessors, (5), 2 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) [2024-12-02 11:03:55,398 INFO L276 IsEmpty]: Start isEmpty. Operand 5922 states and 8634 transitions. [2024-12-02 11:03:55,400 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 66 [2024-12-02 11:03:55,400 INFO L210 NwaCegarLoop]: Found error trace [2024-12-02 11:03:55,400 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-12-02 11:03:55,400 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9 [2024-12-02 11:03:55,400 INFO L396 AbstractCegarLoop]: === Iteration 11 === Targeting ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 3 more)] === [2024-12-02 11:03:55,401 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-12-02 11:03:55,401 INFO L85 PathProgramCache]: Analyzing trace with hash 1088941526, now seen corresponding path program 1 times [2024-12-02 11:03:55,401 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-12-02 11:03:55,401 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1451527205] [2024-12-02 11:03:55,401 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-12-02 11:03:55,401 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-12-02 11:03:55,407 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-12-02 11:03:55,441 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-12-02 11:03:55,441 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-12-02 11:03:55,441 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1451527205] [2024-12-02 11:03:55,441 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1451527205] provided 1 perfect and 0 imperfect interpolant sequences [2024-12-02 11:03:55,441 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-12-02 11:03:55,441 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2024-12-02 11:03:55,441 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1869770404] [2024-12-02 11:03:55,441 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-12-02 11:03:55,441 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2024-12-02 11:03:55,442 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-12-02 11:03:55,442 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2024-12-02 11:03:55,442 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2024-12-02 11:03:55,442 INFO L87 Difference]: Start difference. First operand 5922 states and 8634 transitions. Second operand has 5 states, 5 states have (on average 11.0) internal successors, (55), 5 states have internal predecessors, (55), 2 states have call successors, (5), 1 states have call predecessors, (5), 2 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) [2024-12-02 11:03:55,641 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-12-02 11:03:55,641 INFO L93 Difference]: Finished difference Result 11938 states and 17616 transitions. [2024-12-02 11:03:55,641 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-12-02 11:03:55,641 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 11.0) internal successors, (55), 5 states have internal predecessors, (55), 2 states have call successors, (5), 1 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 65 [2024-12-02 11:03:55,642 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-12-02 11:03:55,662 INFO L225 Difference]: With dead ends: 11938 [2024-12-02 11:03:55,662 INFO L226 Difference]: Without dead ends: 6027 [2024-12-02 11:03:55,671 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2024-12-02 11:03:55,671 INFO L435 NwaCegarLoop]: 186 mSDtfsCounter, 0 mSDsluCounter, 552 mSDsCounter, 0 mSdLazyCounter, 17 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 738 SdHoareTripleChecker+Invalid, 17 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 17 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-12-02 11:03:55,672 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 738 Invalid, 17 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 17 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-12-02 11:03:55,676 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 6027 states. [2024-12-02 11:03:56,010 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 6027 to 6027. [2024-12-02 11:03:56,019 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 6027 states, 5009 states have (on average 1.4060690756638052) internal successors, (7043), 5211 states have internal predecessors, (7043), 515 states have call successors, (515), 311 states have call predecessors, (515), 497 states have return successors, (1155), 520 states have call predecessors, (1155), 515 states have call successors, (1155) [2024-12-02 11:03:56,039 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6027 states to 6027 states and 8713 transitions. [2024-12-02 11:03:56,043 INFO L78 Accepts]: Start accepts. Automaton has 6027 states and 8713 transitions. Word has length 65 [2024-12-02 11:03:56,044 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-12-02 11:03:56,044 INFO L471 AbstractCegarLoop]: Abstraction has 6027 states and 8713 transitions. [2024-12-02 11:03:56,044 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 11.0) internal successors, (55), 5 states have internal predecessors, (55), 2 states have call successors, (5), 1 states have call predecessors, (5), 2 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) [2024-12-02 11:03:56,044 INFO L276 IsEmpty]: Start isEmpty. Operand 6027 states and 8713 transitions. [2024-12-02 11:03:56,046 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 66 [2024-12-02 11:03:56,046 INFO L210 NwaCegarLoop]: Found error trace [2024-12-02 11:03:56,046 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-12-02 11:03:56,047 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10 [2024-12-02 11:03:56,047 INFO L396 AbstractCegarLoop]: === Iteration 12 === Targeting ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 3 more)] === [2024-12-02 11:03:56,047 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-12-02 11:03:56,047 INFO L85 PathProgramCache]: Analyzing trace with hash -1282797736, now seen corresponding path program 1 times [2024-12-02 11:03:56,047 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-12-02 11:03:56,047 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1669623987] [2024-12-02 11:03:56,047 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-12-02 11:03:56,047 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-12-02 11:03:56,056 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-12-02 11:03:56,152 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-12-02 11:03:56,152 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-12-02 11:03:56,152 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1669623987] [2024-12-02 11:03:56,152 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1669623987] provided 1 perfect and 0 imperfect interpolant sequences [2024-12-02 11:03:56,153 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-12-02 11:03:56,153 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2024-12-02 11:03:56,153 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [827219894] [2024-12-02 11:03:56,153 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-12-02 11:03:56,153 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2024-12-02 11:03:56,153 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-12-02 11:03:56,154 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2024-12-02 11:03:56,154 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2024-12-02 11:03:56,154 INFO L87 Difference]: Start difference. First operand 6027 states and 8713 transitions. Second operand has 6 states, 6 states have (on average 9.166666666666666) internal successors, (55), 6 states have internal predecessors, (55), 2 states have call successors, (5), 2 states have call predecessors, (5), 3 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) [2024-12-02 11:03:56,731 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-12-02 11:03:56,731 INFO L93 Difference]: Finished difference Result 7363 states and 10628 transitions. [2024-12-02 11:03:56,731 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2024-12-02 11:03:56,731 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 9.166666666666666) internal successors, (55), 6 states have internal predecessors, (55), 2 states have call successors, (5), 2 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 65 [2024-12-02 11:03:56,732 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-12-02 11:03:56,751 INFO L225 Difference]: With dead ends: 7363 [2024-12-02 11:03:56,751 INFO L226 Difference]: Without dead ends: 3914 [2024-12-02 11:03:56,758 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 12 GetRequests, 5 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=24, Invalid=48, Unknown=0, NotChecked=0, Total=72 [2024-12-02 11:03:56,759 INFO L435 NwaCegarLoop]: 150 mSDtfsCounter, 292 mSDsluCounter, 485 mSDsCounter, 0 mSdLazyCounter, 339 mSolverCounterSat, 32 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 301 SdHoareTripleChecker+Valid, 635 SdHoareTripleChecker+Invalid, 371 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 32 IncrementalHoareTripleChecker+Valid, 339 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2024-12-02 11:03:56,759 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [301 Valid, 635 Invalid, 371 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [32 Valid, 339 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2024-12-02 11:03:56,763 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3914 states. [2024-12-02 11:03:56,987 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3914 to 3610. [2024-12-02 11:03:56,993 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3610 states, 3020 states have (on average 1.3913907284768212) internal successors, (4202), 3093 states have internal predecessors, (4202), 328 states have call successors, (328), 194 states have call predecessors, (328), 256 states have return successors, (496), 330 states have call predecessors, (496), 328 states have call successors, (496) [2024-12-02 11:03:57,003 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3610 states to 3610 states and 5026 transitions. [2024-12-02 11:03:57,007 INFO L78 Accepts]: Start accepts. Automaton has 3610 states and 5026 transitions. Word has length 65 [2024-12-02 11:03:57,008 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-12-02 11:03:57,008 INFO L471 AbstractCegarLoop]: Abstraction has 3610 states and 5026 transitions. [2024-12-02 11:03:57,009 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 9.166666666666666) internal successors, (55), 6 states have internal predecessors, (55), 2 states have call successors, (5), 2 states have call predecessors, (5), 3 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) [2024-12-02 11:03:57,009 INFO L276 IsEmpty]: Start isEmpty. Operand 3610 states and 5026 transitions. [2024-12-02 11:03:57,010 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 66 [2024-12-02 11:03:57,010 INFO L210 NwaCegarLoop]: Found error trace [2024-12-02 11:03:57,010 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-12-02 11:03:57,010 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable11 [2024-12-02 11:03:57,011 INFO L396 AbstractCegarLoop]: === Iteration 13 === Targeting ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 3 more)] === [2024-12-02 11:03:57,011 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-12-02 11:03:57,011 INFO L85 PathProgramCache]: Analyzing trace with hash -1063943018, now seen corresponding path program 1 times [2024-12-02 11:03:57,011 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-12-02 11:03:57,011 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [44649978] [2024-12-02 11:03:57,011 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-12-02 11:03:57,011 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-12-02 11:03:57,019 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-12-02 11:03:57,116 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-12-02 11:03:57,116 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-12-02 11:03:57,117 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [44649978] [2024-12-02 11:03:57,117 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [44649978] provided 1 perfect and 0 imperfect interpolant sequences [2024-12-02 11:03:57,117 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-12-02 11:03:57,117 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2024-12-02 11:03:57,117 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1159877830] [2024-12-02 11:03:57,117 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-12-02 11:03:57,117 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2024-12-02 11:03:57,117 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-12-02 11:03:57,118 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2024-12-02 11:03:57,118 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2024-12-02 11:03:57,118 INFO L87 Difference]: Start difference. First operand 3610 states and 5026 transitions. Second operand has 6 states, 6 states have (on average 9.166666666666666) internal successors, (55), 6 states have internal predecessors, (55), 2 states have call successors, (5), 2 states have call predecessors, (5), 3 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) [2024-12-02 11:03:57,803 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-12-02 11:03:57,803 INFO L93 Difference]: Finished difference Result 10459 states and 14787 transitions. [2024-12-02 11:03:57,804 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2024-12-02 11:03:57,804 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 9.166666666666666) internal successors, (55), 6 states have internal predecessors, (55), 2 states have call successors, (5), 2 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 65 [2024-12-02 11:03:57,804 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-12-02 11:03:57,828 INFO L225 Difference]: With dead ends: 10459 [2024-12-02 11:03:57,828 INFO L226 Difference]: Without dead ends: 6861 [2024-12-02 11:03:57,835 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 13 GetRequests, 6 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=24, Invalid=48, Unknown=0, NotChecked=0, Total=72 [2024-12-02 11:03:57,836 INFO L435 NwaCegarLoop]: 148 mSDtfsCounter, 304 mSDsluCounter, 475 mSDsCounter, 0 mSdLazyCounter, 412 mSolverCounterSat, 35 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 312 SdHoareTripleChecker+Valid, 623 SdHoareTripleChecker+Invalid, 447 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 35 IncrementalHoareTripleChecker+Valid, 412 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2024-12-02 11:03:57,836 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [312 Valid, 623 Invalid, 447 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [35 Valid, 412 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2024-12-02 11:03:57,841 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 6861 states. [2024-12-02 11:03:58,213 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 6861 to 6229. [2024-12-02 11:03:58,219 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 6229 states, 5201 states have (on average 1.3724283791578542) internal successors, (7138), 5358 states have internal predecessors, (7138), 547 states have call successors, (547), 335 states have call predecessors, (547), 475 states have return successors, (919), 551 states have call predecessors, (919), 547 states have call successors, (919) [2024-12-02 11:03:58,235 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6229 states to 6229 states and 8604 transitions. [2024-12-02 11:03:58,240 INFO L78 Accepts]: Start accepts. Automaton has 6229 states and 8604 transitions. Word has length 65 [2024-12-02 11:03:58,240 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-12-02 11:03:58,240 INFO L471 AbstractCegarLoop]: Abstraction has 6229 states and 8604 transitions. [2024-12-02 11:03:58,240 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 9.166666666666666) internal successors, (55), 6 states have internal predecessors, (55), 2 states have call successors, (5), 2 states have call predecessors, (5), 3 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) [2024-12-02 11:03:58,241 INFO L276 IsEmpty]: Start isEmpty. Operand 6229 states and 8604 transitions. [2024-12-02 11:03:58,242 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 66 [2024-12-02 11:03:58,242 INFO L210 NwaCegarLoop]: Found error trace [2024-12-02 11:03:58,243 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-12-02 11:03:58,243 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable12 [2024-12-02 11:03:58,243 INFO L396 AbstractCegarLoop]: === Iteration 14 === Targeting ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 3 more)] === [2024-12-02 11:03:58,243 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-12-02 11:03:58,243 INFO L85 PathProgramCache]: Analyzing trace with hash -1881591468, now seen corresponding path program 1 times [2024-12-02 11:03:58,243 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-12-02 11:03:58,244 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [236252100] [2024-12-02 11:03:58,244 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-12-02 11:03:58,244 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-12-02 11:03:58,252 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-12-02 11:03:58,348 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-12-02 11:03:58,348 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-12-02 11:03:58,348 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [236252100] [2024-12-02 11:03:58,348 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [236252100] provided 1 perfect and 0 imperfect interpolant sequences [2024-12-02 11:03:58,348 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-12-02 11:03:58,348 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2024-12-02 11:03:58,349 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1144907069] [2024-12-02 11:03:58,349 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-12-02 11:03:58,349 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2024-12-02 11:03:58,349 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-12-02 11:03:58,349 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2024-12-02 11:03:58,349 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2024-12-02 11:03:58,350 INFO L87 Difference]: Start difference. First operand 6229 states and 8604 transitions. Second operand has 6 states, 6 states have (on average 9.166666666666666) internal successors, (55), 6 states have internal predecessors, (55), 2 states have call successors, (5), 2 states have call predecessors, (5), 3 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) [2024-12-02 11:03:58,915 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-12-02 11:03:58,915 INFO L93 Difference]: Finished difference Result 10173 states and 13895 transitions. [2024-12-02 11:03:58,915 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2024-12-02 11:03:58,915 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 9.166666666666666) internal successors, (55), 6 states have internal predecessors, (55), 2 states have call successors, (5), 2 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 65 [2024-12-02 11:03:58,915 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-12-02 11:03:58,937 INFO L225 Difference]: With dead ends: 10173 [2024-12-02 11:03:58,937 INFO L226 Difference]: Without dead ends: 5524 [2024-12-02 11:03:58,947 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 13 GetRequests, 6 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=24, Invalid=48, Unknown=0, NotChecked=0, Total=72 [2024-12-02 11:03:58,947 INFO L435 NwaCegarLoop]: 145 mSDtfsCounter, 270 mSDsluCounter, 461 mSDsCounter, 0 mSdLazyCounter, 415 mSolverCounterSat, 31 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 278 SdHoareTripleChecker+Valid, 606 SdHoareTripleChecker+Invalid, 446 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 31 IncrementalHoareTripleChecker+Valid, 415 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2024-12-02 11:03:58,948 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [278 Valid, 606 Invalid, 446 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [31 Valid, 415 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2024-12-02 11:03:58,952 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 5524 states. [2024-12-02 11:03:59,330 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 5524 to 5013. [2024-12-02 11:03:59,335 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 5013 states, 4237 states have (on average 1.3495397687042718) internal successors, (5718), 4330 states have internal predecessors, (5718), 423 states have call successors, (423), 271 states have call predecessors, (423), 347 states have return successors, (595), 419 states have call predecessors, (595), 423 states have call successors, (595) [2024-12-02 11:03:59,351 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5013 states to 5013 states and 6736 transitions. [2024-12-02 11:03:59,356 INFO L78 Accepts]: Start accepts. Automaton has 5013 states and 6736 transitions. Word has length 65 [2024-12-02 11:03:59,357 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-12-02 11:03:59,357 INFO L471 AbstractCegarLoop]: Abstraction has 5013 states and 6736 transitions. [2024-12-02 11:03:59,357 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 9.166666666666666) internal successors, (55), 6 states have internal predecessors, (55), 2 states have call successors, (5), 2 states have call predecessors, (5), 3 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) [2024-12-02 11:03:59,357 INFO L276 IsEmpty]: Start isEmpty. Operand 5013 states and 6736 transitions. [2024-12-02 11:03:59,358 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 66 [2024-12-02 11:03:59,359 INFO L210 NwaCegarLoop]: Found error trace [2024-12-02 11:03:59,359 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-12-02 11:03:59,359 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable13 [2024-12-02 11:03:59,359 INFO L396 AbstractCegarLoop]: === Iteration 15 === Targeting ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 3 more)] === [2024-12-02 11:03:59,359 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-12-02 11:03:59,359 INFO L85 PathProgramCache]: Analyzing trace with hash 724432086, now seen corresponding path program 1 times [2024-12-02 11:03:59,359 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-12-02 11:03:59,360 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1274389040] [2024-12-02 11:03:59,360 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-12-02 11:03:59,360 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-12-02 11:03:59,371 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-12-02 11:03:59,489 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-12-02 11:03:59,489 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-12-02 11:03:59,489 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1274389040] [2024-12-02 11:03:59,489 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1274389040] provided 1 perfect and 0 imperfect interpolant sequences [2024-12-02 11:03:59,490 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-12-02 11:03:59,490 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2024-12-02 11:03:59,490 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1949180566] [2024-12-02 11:03:59,490 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-12-02 11:03:59,490 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2024-12-02 11:03:59,490 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-12-02 11:03:59,491 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2024-12-02 11:03:59,491 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2024-12-02 11:03:59,491 INFO L87 Difference]: Start difference. First operand 5013 states and 6736 transitions. Second operand has 6 states, 6 states have (on average 9.166666666666666) internal successors, (55), 6 states have internal predecessors, (55), 2 states have call successors, (5), 2 states have call predecessors, (5), 3 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) [2024-12-02 11:04:00,193 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-12-02 11:04:00,193 INFO L93 Difference]: Finished difference Result 8431 states and 11351 transitions. [2024-12-02 11:04:00,193 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2024-12-02 11:04:00,194 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 9.166666666666666) internal successors, (55), 6 states have internal predecessors, (55), 2 states have call successors, (5), 2 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 65 [2024-12-02 11:04:00,194 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-12-02 11:04:00,207 INFO L225 Difference]: With dead ends: 8431 [2024-12-02 11:04:00,207 INFO L226 Difference]: Without dead ends: 5342 [2024-12-02 11:04:00,212 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 13 GetRequests, 6 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=24, Invalid=48, Unknown=0, NotChecked=0, Total=72 [2024-12-02 11:04:00,213 INFO L435 NwaCegarLoop]: 143 mSDtfsCounter, 274 mSDsluCounter, 455 mSDsCounter, 0 mSdLazyCounter, 382 mSolverCounterSat, 33 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 282 SdHoareTripleChecker+Valid, 598 SdHoareTripleChecker+Invalid, 415 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 33 IncrementalHoareTripleChecker+Valid, 382 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2024-12-02 11:04:00,213 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [282 Valid, 598 Invalid, 415 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [33 Valid, 382 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2024-12-02 11:04:00,216 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 5342 states. [2024-12-02 11:04:00,397 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 5342 to 4983. [2024-12-02 11:04:00,400 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 4983 states, 4227 states have (on average 1.345871776673764) internal successors, (5689), 4296 states have internal predecessors, (5689), 425 states have call successors, (425), 273 states have call predecessors, (425), 325 states have return successors, (529), 417 states have call predecessors, (529), 425 states have call successors, (529) [2024-12-02 11:04:00,406 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4983 states to 4983 states and 6643 transitions. [2024-12-02 11:04:00,409 INFO L78 Accepts]: Start accepts. Automaton has 4983 states and 6643 transitions. Word has length 65 [2024-12-02 11:04:00,410 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-12-02 11:04:00,410 INFO L471 AbstractCegarLoop]: Abstraction has 4983 states and 6643 transitions. [2024-12-02 11:04:00,410 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 9.166666666666666) internal successors, (55), 6 states have internal predecessors, (55), 2 states have call successors, (5), 2 states have call predecessors, (5), 3 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) [2024-12-02 11:04:00,410 INFO L276 IsEmpty]: Start isEmpty. Operand 4983 states and 6643 transitions. [2024-12-02 11:04:00,411 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 66 [2024-12-02 11:04:00,411 INFO L210 NwaCegarLoop]: Found error trace [2024-12-02 11:04:00,411 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-12-02 11:04:00,411 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable14 [2024-12-02 11:04:00,411 INFO L396 AbstractCegarLoop]: === Iteration 16 === Targeting ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 3 more)] === [2024-12-02 11:04:00,411 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-12-02 11:04:00,411 INFO L85 PathProgramCache]: Analyzing trace with hash -1269712620, now seen corresponding path program 1 times [2024-12-02 11:04:00,411 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-12-02 11:04:00,411 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1040882662] [2024-12-02 11:04:00,412 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-12-02 11:04:00,412 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-12-02 11:04:00,418 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-12-02 11:04:00,444 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-12-02 11:04:00,444 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-12-02 11:04:00,444 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1040882662] [2024-12-02 11:04:00,444 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1040882662] provided 1 perfect and 0 imperfect interpolant sequences [2024-12-02 11:04:00,444 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-12-02 11:04:00,444 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2024-12-02 11:04:00,444 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1614365730] [2024-12-02 11:04:00,445 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-12-02 11:04:00,445 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-12-02 11:04:00,445 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-12-02 11:04:00,445 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-12-02 11:04:00,445 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-12-02 11:04:00,445 INFO L87 Difference]: Start difference. First operand 4983 states and 6643 transitions. Second operand has 4 states, 4 states have (on average 13.75) internal successors, (55), 4 states have internal predecessors, (55), 2 states have call successors, (5), 2 states have call predecessors, (5), 2 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) [2024-12-02 11:04:00,894 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-12-02 11:04:00,894 INFO L93 Difference]: Finished difference Result 12799 states and 17224 transitions. [2024-12-02 11:04:00,894 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-12-02 11:04:00,895 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 13.75) internal successors, (55), 4 states have internal predecessors, (55), 2 states have call successors, (5), 2 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 65 [2024-12-02 11:04:00,895 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-12-02 11:04:00,913 INFO L225 Difference]: With dead ends: 12799 [2024-12-02 11:04:00,913 INFO L226 Difference]: Without dead ends: 7830 [2024-12-02 11:04:00,921 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2024-12-02 11:04:00,922 INFO L435 NwaCegarLoop]: 149 mSDtfsCounter, 255 mSDsluCounter, 221 mSDsCounter, 0 mSdLazyCounter, 130 mSolverCounterSat, 41 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 261 SdHoareTripleChecker+Valid, 370 SdHoareTripleChecker+Invalid, 171 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 41 IncrementalHoareTripleChecker+Valid, 130 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2024-12-02 11:04:00,922 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [261 Valid, 370 Invalid, 171 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [41 Valid, 130 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2024-12-02 11:04:00,926 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 7830 states. [2024-12-02 11:04:01,262 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 7830 to 7800. [2024-12-02 11:04:01,268 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 7800 states, 6644 states have (on average 1.327212522576761) internal successors, (8818), 6768 states have internal predecessors, (8818), 612 states have call successors, (612), 402 states have call predecessors, (612), 538 states have return successors, (943), 633 states have call predecessors, (943), 612 states have call successors, (943) [2024-12-02 11:04:01,284 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7800 states to 7800 states and 10373 transitions. [2024-12-02 11:04:01,289 INFO L78 Accepts]: Start accepts. Automaton has 7800 states and 10373 transitions. Word has length 65 [2024-12-02 11:04:01,289 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-12-02 11:04:01,289 INFO L471 AbstractCegarLoop]: Abstraction has 7800 states and 10373 transitions. [2024-12-02 11:04:01,290 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 13.75) internal successors, (55), 4 states have internal predecessors, (55), 2 states have call successors, (5), 2 states have call predecessors, (5), 2 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) [2024-12-02 11:04:01,290 INFO L276 IsEmpty]: Start isEmpty. Operand 7800 states and 10373 transitions. [2024-12-02 11:04:01,291 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 68 [2024-12-02 11:04:01,291 INFO L210 NwaCegarLoop]: Found error trace [2024-12-02 11:04:01,291 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-12-02 11:04:01,291 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable15 [2024-12-02 11:04:01,291 INFO L396 AbstractCegarLoop]: === Iteration 17 === Targeting ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 3 more)] === [2024-12-02 11:04:01,291 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-12-02 11:04:01,291 INFO L85 PathProgramCache]: Analyzing trace with hash 369670246, now seen corresponding path program 1 times [2024-12-02 11:04:01,292 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-12-02 11:04:01,292 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1675028095] [2024-12-02 11:04:01,292 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-12-02 11:04:01,292 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-12-02 11:04:01,301 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-12-02 11:04:01,318 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-12-02 11:04:01,318 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-12-02 11:04:01,318 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1675028095] [2024-12-02 11:04:01,318 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1675028095] provided 1 perfect and 0 imperfect interpolant sequences [2024-12-02 11:04:01,318 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-12-02 11:04:01,318 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-12-02 11:04:01,318 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1374530275] [2024-12-02 11:04:01,318 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-12-02 11:04:01,319 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-12-02 11:04:01,319 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-12-02 11:04:01,319 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-12-02 11:04:01,319 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-12-02 11:04:01,319 INFO L87 Difference]: Start difference. First operand 7800 states and 10373 transitions. Second operand has 3 states, 3 states have (on average 19.0) internal successors, (57), 3 states have internal predecessors, (57), 1 states have call successors, (5), 1 states have call predecessors, (5), 1 states have return successors, (5), 1 states have call predecessors, (5), 1 states have call successors, (5) [2024-12-02 11:04:01,949 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-12-02 11:04:01,950 INFO L93 Difference]: Finished difference Result 19916 states and 26583 transitions. [2024-12-02 11:04:01,950 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-12-02 11:04:01,950 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 19.0) internal successors, (57), 3 states have internal predecessors, (57), 1 states have call successors, (5), 1 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 67 [2024-12-02 11:04:01,950 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-12-02 11:04:01,988 INFO L225 Difference]: With dead ends: 19916 [2024-12-02 11:04:01,988 INFO L226 Difference]: Without dead ends: 12128 [2024-12-02 11:04:02,001 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-12-02 11:04:02,001 INFO L435 NwaCegarLoop]: 188 mSDtfsCounter, 152 mSDsluCounter, 164 mSDsCounter, 0 mSdLazyCounter, 8 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 152 SdHoareTripleChecker+Valid, 352 SdHoareTripleChecker+Invalid, 10 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 8 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-12-02 11:04:02,002 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [152 Valid, 352 Invalid, 10 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 8 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-12-02 11:04:02,010 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 12128 states. [2024-12-02 11:04:02,620 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 12128 to 12048. [2024-12-02 11:04:02,626 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 12048 states, 10254 states have (on average 1.314023795591964) internal successors, (13474), 10446 states have internal predecessors, (13474), 952 states have call successors, (952), 636 states have call predecessors, (952), 836 states have return successors, (1443), 969 states have call predecessors, (1443), 952 states have call successors, (1443) [2024-12-02 11:04:02,650 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 12048 states to 12048 states and 15869 transitions. [2024-12-02 11:04:02,655 INFO L78 Accepts]: Start accepts. Automaton has 12048 states and 15869 transitions. Word has length 67 [2024-12-02 11:04:02,656 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-12-02 11:04:02,656 INFO L471 AbstractCegarLoop]: Abstraction has 12048 states and 15869 transitions. [2024-12-02 11:04:02,656 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 19.0) internal successors, (57), 3 states have internal predecessors, (57), 1 states have call successors, (5), 1 states have call predecessors, (5), 1 states have return successors, (5), 1 states have call predecessors, (5), 1 states have call successors, (5) [2024-12-02 11:04:02,656 INFO L276 IsEmpty]: Start isEmpty. Operand 12048 states and 15869 transitions. [2024-12-02 11:04:02,658 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 86 [2024-12-02 11:04:02,658 INFO L210 NwaCegarLoop]: Found error trace [2024-12-02 11:04:02,658 INFO L218 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-12-02 11:04:02,658 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable16 [2024-12-02 11:04:02,658 INFO L396 AbstractCegarLoop]: === Iteration 18 === Targeting ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 3 more)] === [2024-12-02 11:04:02,658 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-12-02 11:04:02,658 INFO L85 PathProgramCache]: Analyzing trace with hash 2126323961, now seen corresponding path program 1 times [2024-12-02 11:04:02,658 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-12-02 11:04:02,658 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [707987781] [2024-12-02 11:04:02,659 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-12-02 11:04:02,659 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-12-02 11:04:02,671 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-12-02 11:04:02,724 INFO L134 CoverageAnalysis]: Checked inductivity of 14 backedges. 9 proven. 0 refuted. 0 times theorem prover too weak. 5 trivial. 0 not checked. [2024-12-02 11:04:02,724 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-12-02 11:04:02,724 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [707987781] [2024-12-02 11:04:02,724 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [707987781] provided 1 perfect and 0 imperfect interpolant sequences [2024-12-02 11:04:02,724 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-12-02 11:04:02,724 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2024-12-02 11:04:02,725 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [471155402] [2024-12-02 11:04:02,725 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-12-02 11:04:02,725 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-12-02 11:04:02,725 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-12-02 11:04:02,725 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-12-02 11:04:02,725 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-12-02 11:04:02,726 INFO L87 Difference]: Start difference. First operand 12048 states and 15869 transitions. Second operand has 4 states, 4 states have (on average 17.25) internal successors, (69), 4 states have internal predecessors, (69), 3 states have call successors, (6), 2 states have call predecessors, (6), 2 states have return successors, (6), 3 states have call predecessors, (6), 3 states have call successors, (6) [2024-12-02 11:04:03,939 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-12-02 11:04:03,940 INFO L93 Difference]: Finished difference Result 36018 states and 47448 transitions. [2024-12-02 11:04:03,940 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-12-02 11:04:03,940 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 17.25) internal successors, (69), 4 states have internal predecessors, (69), 3 states have call successors, (6), 2 states have call predecessors, (6), 2 states have return successors, (6), 3 states have call predecessors, (6), 3 states have call successors, (6) Word has length 85 [2024-12-02 11:04:03,940 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-12-02 11:04:03,988 INFO L225 Difference]: With dead ends: 36018 [2024-12-02 11:04:03,988 INFO L226 Difference]: Without dead ends: 23984 [2024-12-02 11:04:04,005 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2024-12-02 11:04:04,005 INFO L435 NwaCegarLoop]: 169 mSDtfsCounter, 226 mSDsluCounter, 220 mSDsCounter, 0 mSdLazyCounter, 141 mSolverCounterSat, 45 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 232 SdHoareTripleChecker+Valid, 389 SdHoareTripleChecker+Invalid, 186 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 45 IncrementalHoareTripleChecker+Valid, 141 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2024-12-02 11:04:04,005 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [232 Valid, 389 Invalid, 186 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [45 Valid, 141 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2024-12-02 11:04:04,018 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 23984 states. [2024-12-02 11:04:05,050 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 23984 to 23882. [2024-12-02 11:04:05,059 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 23882 states, 20149 states have (on average 1.295697056925902) internal successors, (26107), 20656 states have internal predecessors, (26107), 1861 states have call successors, (1861), 1260 states have call predecessors, (1861), 1866 states have return successors, (3301), 1973 states have call predecessors, (3301), 1861 states have call successors, (3301) [2024-12-02 11:04:05,092 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 23882 states to 23882 states and 31269 transitions. [2024-12-02 11:04:05,099 INFO L78 Accepts]: Start accepts. Automaton has 23882 states and 31269 transitions. Word has length 85 [2024-12-02 11:04:05,099 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-12-02 11:04:05,099 INFO L471 AbstractCegarLoop]: Abstraction has 23882 states and 31269 transitions. [2024-12-02 11:04:05,099 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 17.25) internal successors, (69), 4 states have internal predecessors, (69), 3 states have call successors, (6), 2 states have call predecessors, (6), 2 states have return successors, (6), 3 states have call predecessors, (6), 3 states have call successors, (6) [2024-12-02 11:04:05,099 INFO L276 IsEmpty]: Start isEmpty. Operand 23882 states and 31269 transitions. [2024-12-02 11:04:05,102 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 86 [2024-12-02 11:04:05,102 INFO L210 NwaCegarLoop]: Found error trace [2024-12-02 11:04:05,102 INFO L218 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-12-02 11:04:05,102 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable17 [2024-12-02 11:04:05,102 INFO L396 AbstractCegarLoop]: === Iteration 19 === Targeting ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 3 more)] === [2024-12-02 11:04:05,102 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-12-02 11:04:05,103 INFO L85 PathProgramCache]: Analyzing trace with hash 48987063, now seen corresponding path program 1 times [2024-12-02 11:04:05,103 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-12-02 11:04:05,103 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1946264094] [2024-12-02 11:04:05,103 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-12-02 11:04:05,103 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-12-02 11:04:05,108 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-12-02 11:04:05,124 INFO L134 CoverageAnalysis]: Checked inductivity of 14 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 14 trivial. 0 not checked. [2024-12-02 11:04:05,125 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-12-02 11:04:05,125 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1946264094] [2024-12-02 11:04:05,125 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1946264094] provided 1 perfect and 0 imperfect interpolant sequences [2024-12-02 11:04:05,125 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-12-02 11:04:05,125 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-12-02 11:04:05,125 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1200242134] [2024-12-02 11:04:05,125 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-12-02 11:04:05,126 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-12-02 11:04:05,126 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-12-02 11:04:05,126 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-12-02 11:04:05,126 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-12-02 11:04:05,126 INFO L87 Difference]: Start difference. First operand 23882 states and 31269 transitions. Second operand has 3 states, 3 states have (on average 20.666666666666668) internal successors, (62), 3 states have internal predecessors, (62), 2 states have call successors, (5), 1 states have call predecessors, (5), 1 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) [2024-12-02 11:04:05,925 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-12-02 11:04:05,925 INFO L93 Difference]: Finished difference Result 41724 states and 54630 transitions. [2024-12-02 11:04:05,926 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-12-02 11:04:05,926 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 20.666666666666668) internal successors, (62), 3 states have internal predecessors, (62), 2 states have call successors, (5), 1 states have call predecessors, (5), 1 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) Word has length 85 [2024-12-02 11:04:05,926 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-12-02 11:04:05,987 INFO L225 Difference]: With dead ends: 41724 [2024-12-02 11:04:05,987 INFO L226 Difference]: Without dead ends: 17856 [2024-12-02 11:04:06,021 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-12-02 11:04:06,022 INFO L435 NwaCegarLoop]: 187 mSDtfsCounter, 181 mSDsluCounter, 0 mSDsCounter, 0 mSdLazyCounter, 2 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 181 SdHoareTripleChecker+Valid, 187 SdHoareTripleChecker+Invalid, 2 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 2 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-12-02 11:04:06,022 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [181 Valid, 187 Invalid, 2 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 2 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-12-02 11:04:06,034 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 17856 states. [2024-12-02 11:04:07,413 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 17856 to 17856. [2024-12-02 11:04:07,424 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 17856 states, 15118 states have (on average 1.2995105172641883) internal successors, (19646), 15464 states have internal predecessors, (19646), 1392 states have call successors, (1392), 940 states have call predecessors, (1392), 1340 states have return successors, (2347), 1455 states have call predecessors, (2347), 1392 states have call successors, (2347) [2024-12-02 11:04:07,449 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 17856 states to 17856 states and 23385 transitions. [2024-12-02 11:04:07,462 INFO L78 Accepts]: Start accepts. Automaton has 17856 states and 23385 transitions. Word has length 85 [2024-12-02 11:04:07,462 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-12-02 11:04:07,462 INFO L471 AbstractCegarLoop]: Abstraction has 17856 states and 23385 transitions. [2024-12-02 11:04:07,463 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 20.666666666666668) internal successors, (62), 3 states have internal predecessors, (62), 2 states have call successors, (5), 1 states have call predecessors, (5), 1 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) [2024-12-02 11:04:07,463 INFO L276 IsEmpty]: Start isEmpty. Operand 17856 states and 23385 transitions. [2024-12-02 11:04:07,464 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 87 [2024-12-02 11:04:07,464 INFO L210 NwaCegarLoop]: Found error trace [2024-12-02 11:04:07,464 INFO L218 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-12-02 11:04:07,465 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable18 [2024-12-02 11:04:07,465 INFO L396 AbstractCegarLoop]: === Iteration 20 === Targeting ULTIMATE.startErr4ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 3 more)] === [2024-12-02 11:04:07,465 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-12-02 11:04:07,465 INFO L85 PathProgramCache]: Analyzing trace with hash 1535696324, now seen corresponding path program 1 times [2024-12-02 11:04:07,465 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-12-02 11:04:07,465 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [751849282] [2024-12-02 11:04:07,465 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-12-02 11:04:07,465 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-12-02 11:04:07,474 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-12-02 11:04:07,509 INFO L134 CoverageAnalysis]: Checked inductivity of 15 backedges. 7 proven. 0 refuted. 0 times theorem prover too weak. 8 trivial. 0 not checked. [2024-12-02 11:04:07,509 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-12-02 11:04:07,509 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [751849282] [2024-12-02 11:04:07,509 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [751849282] provided 1 perfect and 0 imperfect interpolant sequences [2024-12-02 11:04:07,509 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-12-02 11:04:07,509 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2024-12-02 11:04:07,509 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [21477808] [2024-12-02 11:04:07,509 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-12-02 11:04:07,510 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-12-02 11:04:07,510 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-12-02 11:04:07,510 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-12-02 11:04:07,510 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-12-02 11:04:07,510 INFO L87 Difference]: Start difference. First operand 17856 states and 23385 transitions. Second operand has 4 states, 4 states have (on average 17.0) internal successors, (68), 4 states have internal predecessors, (68), 3 states have call successors, (6), 2 states have call predecessors, (6), 2 states have return successors, (6), 3 states have call predecessors, (6), 3 states have call successors, (6) [2024-12-02 11:04:09,061 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-12-02 11:04:09,061 INFO L93 Difference]: Finished difference Result 54993 states and 71964 transitions. [2024-12-02 11:04:09,061 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-12-02 11:04:09,061 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 17.0) internal successors, (68), 4 states have internal predecessors, (68), 3 states have call successors, (6), 2 states have call predecessors, (6), 2 states have return successors, (6), 3 states have call predecessors, (6), 3 states have call successors, (6) Word has length 86 [2024-12-02 11:04:09,062 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-12-02 11:04:09,130 INFO L225 Difference]: With dead ends: 54993 [2024-12-02 11:04:09,131 INFO L226 Difference]: Without dead ends: 37151 [2024-12-02 11:04:09,151 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2024-12-02 11:04:09,152 INFO L435 NwaCegarLoop]: 181 mSDtfsCounter, 237 mSDsluCounter, 241 mSDsCounter, 0 mSdLazyCounter, 141 mSolverCounterSat, 44 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 243 SdHoareTripleChecker+Valid, 422 SdHoareTripleChecker+Invalid, 185 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 44 IncrementalHoareTripleChecker+Valid, 141 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-12-02 11:04:09,152 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [243 Valid, 422 Invalid, 185 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [44 Valid, 141 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-12-02 11:04:09,170 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 37151 states. [2024-12-02 11:04:10,587 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 37151 to 36885. [2024-12-02 11:04:10,604 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 36885 states, 31202 states have (on average 1.28116787385424) internal successors, (39975), 32121 states have internal predecessors, (39975), 2701 states have call successors, (2701), 1852 states have call predecessors, (2701), 2976 states have return successors, (5258), 2919 states have call predecessors, (5258), 2701 states have call successors, (5258) [2024-12-02 11:04:10,661 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 36885 states to 36885 states and 47934 transitions. [2024-12-02 11:04:10,673 INFO L78 Accepts]: Start accepts. Automaton has 36885 states and 47934 transitions. Word has length 86 [2024-12-02 11:04:10,673 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-12-02 11:04:10,673 INFO L471 AbstractCegarLoop]: Abstraction has 36885 states and 47934 transitions. [2024-12-02 11:04:10,673 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 17.0) internal successors, (68), 4 states have internal predecessors, (68), 3 states have call successors, (6), 2 states have call predecessors, (6), 2 states have return successors, (6), 3 states have call predecessors, (6), 3 states have call successors, (6) [2024-12-02 11:04:10,673 INFO L276 IsEmpty]: Start isEmpty. Operand 36885 states and 47934 transitions. [2024-12-02 11:04:10,675 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 87 [2024-12-02 11:04:10,675 INFO L210 NwaCegarLoop]: Found error trace [2024-12-02 11:04:10,675 INFO L218 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-12-02 11:04:10,675 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable19 [2024-12-02 11:04:10,675 INFO L396 AbstractCegarLoop]: === Iteration 21 === Targeting ULTIMATE.startErr4ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 3 more)] === [2024-12-02 11:04:10,676 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-12-02 11:04:10,676 INFO L85 PathProgramCache]: Analyzing trace with hash -1920237310, now seen corresponding path program 1 times [2024-12-02 11:04:10,676 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-12-02 11:04:10,676 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [821495613] [2024-12-02 11:04:10,676 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-12-02 11:04:10,676 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-12-02 11:04:10,681 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-12-02 11:04:10,692 INFO L134 CoverageAnalysis]: Checked inductivity of 15 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 15 trivial. 0 not checked. [2024-12-02 11:04:10,692 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-12-02 11:04:10,692 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [821495613] [2024-12-02 11:04:10,692 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [821495613] provided 1 perfect and 0 imperfect interpolant sequences [2024-12-02 11:04:10,692 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-12-02 11:04:10,692 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-12-02 11:04:10,692 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1504193252] [2024-12-02 11:04:10,692 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-12-02 11:04:10,692 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-12-02 11:04:10,692 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-12-02 11:04:10,693 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-12-02 11:04:10,693 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-12-02 11:04:10,693 INFO L87 Difference]: Start difference. First operand 36885 states and 47934 transitions. Second operand has 3 states, 3 states have (on average 20.666666666666668) internal successors, (62), 3 states have internal predecessors, (62), 2 states have call successors, (5), 1 states have call predecessors, (5), 1 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) [2024-12-02 11:04:11,869 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-12-02 11:04:11,869 INFO L93 Difference]: Finished difference Result 67644 states and 87936 transitions. [2024-12-02 11:04:11,870 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-12-02 11:04:11,870 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 20.666666666666668) internal successors, (62), 3 states have internal predecessors, (62), 2 states have call successors, (5), 1 states have call predecessors, (5), 1 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) Word has length 86 [2024-12-02 11:04:11,870 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-12-02 11:04:11,936 INFO L225 Difference]: With dead ends: 67644 [2024-12-02 11:04:11,937 INFO L226 Difference]: Without dead ends: 30773 [2024-12-02 11:04:11,978 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-12-02 11:04:11,978 INFO L435 NwaCegarLoop]: 186 mSDtfsCounter, 181 mSDsluCounter, 0 mSDsCounter, 0 mSdLazyCounter, 2 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 181 SdHoareTripleChecker+Valid, 186 SdHoareTripleChecker+Invalid, 2 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 2 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-12-02 11:04:11,978 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [181 Valid, 186 Invalid, 2 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 2 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-12-02 11:04:11,994 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 30773 states. [2024-12-02 11:04:14,158 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 30773 to 30773. [2024-12-02 11:04:14,177 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 30773 states, 26065 states have (on average 1.283061576827163) internal successors, (33443), 26858 states have internal predecessors, (33443), 2201 states have call successors, (2201), 1508 states have call predecessors, (2201), 2501 states have return successors, (4381), 2410 states have call predecessors, (4381), 2201 states have call successors, (4381) [2024-12-02 11:04:14,224 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 30773 states to 30773 states and 40025 transitions. [2024-12-02 11:04:14,238 INFO L78 Accepts]: Start accepts. Automaton has 30773 states and 40025 transitions. Word has length 86 [2024-12-02 11:04:14,238 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-12-02 11:04:14,238 INFO L471 AbstractCegarLoop]: Abstraction has 30773 states and 40025 transitions. [2024-12-02 11:04:14,238 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 20.666666666666668) internal successors, (62), 3 states have internal predecessors, (62), 2 states have call successors, (5), 1 states have call predecessors, (5), 1 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) [2024-12-02 11:04:14,239 INFO L276 IsEmpty]: Start isEmpty. Operand 30773 states and 40025 transitions. [2024-12-02 11:04:14,240 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 88 [2024-12-02 11:04:14,240 INFO L210 NwaCegarLoop]: Found error trace [2024-12-02 11:04:14,240 INFO L218 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-12-02 11:04:14,240 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable20 [2024-12-02 11:04:14,241 INFO L396 AbstractCegarLoop]: === Iteration 22 === Targeting ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 3 more)] === [2024-12-02 11:04:14,241 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-12-02 11:04:14,241 INFO L85 PathProgramCache]: Analyzing trace with hash -404458637, now seen corresponding path program 1 times [2024-12-02 11:04:14,241 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-12-02 11:04:14,241 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1865064236] [2024-12-02 11:04:14,241 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-12-02 11:04:14,241 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-12-02 11:04:14,250 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-12-02 11:04:14,302 INFO L134 CoverageAnalysis]: Checked inductivity of 14 backedges. 9 proven. 0 refuted. 0 times theorem prover too weak. 5 trivial. 0 not checked. [2024-12-02 11:04:14,302 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-12-02 11:04:14,302 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1865064236] [2024-12-02 11:04:14,302 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1865064236] provided 1 perfect and 0 imperfect interpolant sequences [2024-12-02 11:04:14,302 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-12-02 11:04:14,302 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2024-12-02 11:04:14,302 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [331867894] [2024-12-02 11:04:14,302 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-12-02 11:04:14,303 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2024-12-02 11:04:14,303 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-12-02 11:04:14,303 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2024-12-02 11:04:14,303 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2024-12-02 11:04:14,303 INFO L87 Difference]: Start difference. First operand 30773 states and 40025 transitions. Second operand has 6 states, 6 states have (on average 11.833333333333334) internal successors, (71), 5 states have internal predecessors, (71), 3 states have call successors, (6), 2 states have call predecessors, (6), 2 states have return successors, (6), 3 states have call predecessors, (6), 3 states have call successors, (6) [2024-12-02 11:04:16,077 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-12-02 11:04:16,077 INFO L93 Difference]: Finished difference Result 56056 states and 73146 transitions. [2024-12-02 11:04:16,077 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2024-12-02 11:04:16,077 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 11.833333333333334) internal successors, (71), 5 states have internal predecessors, (71), 3 states have call successors, (6), 2 states have call predecessors, (6), 2 states have return successors, (6), 3 states have call predecessors, (6), 3 states have call successors, (6) Word has length 87 [2024-12-02 11:04:16,078 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-12-02 11:04:16,147 INFO L225 Difference]: With dead ends: 56056 [2024-12-02 11:04:16,148 INFO L226 Difference]: Without dead ends: 31556 [2024-12-02 11:04:16,178 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 21 GetRequests, 9 SyntacticMatches, 0 SemanticMatches, 12 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 24 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=59, Invalid=123, Unknown=0, NotChecked=0, Total=182 [2024-12-02 11:04:16,179 INFO L435 NwaCegarLoop]: 220 mSDtfsCounter, 668 mSDsluCounter, 713 mSDsCounter, 0 mSdLazyCounter, 467 mSolverCounterSat, 87 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 682 SdHoareTripleChecker+Valid, 933 SdHoareTripleChecker+Invalid, 554 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 87 IncrementalHoareTripleChecker+Valid, 467 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2024-12-02 11:04:16,179 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [682 Valid, 933 Invalid, 554 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [87 Valid, 467 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time] [2024-12-02 11:04:16,193 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 31556 states. [2024-12-02 11:04:17,487 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 31556 to 30773. [2024-12-02 11:04:17,501 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 30773 states, 26065 states have (on average 1.2782275081526953) internal successors, (33317), 26858 states have internal predecessors, (33317), 2201 states have call successors, (2201), 1508 states have call predecessors, (2201), 2501 states have return successors, (4287), 2410 states have call predecessors, (4287), 2201 states have call successors, (4287) [2024-12-02 11:04:17,547 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 30773 states to 30773 states and 39805 transitions. [2024-12-02 11:04:17,562 INFO L78 Accepts]: Start accepts. Automaton has 30773 states and 39805 transitions. Word has length 87 [2024-12-02 11:04:17,563 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-12-02 11:04:17,563 INFO L471 AbstractCegarLoop]: Abstraction has 30773 states and 39805 transitions. [2024-12-02 11:04:17,563 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 11.833333333333334) internal successors, (71), 5 states have internal predecessors, (71), 3 states have call successors, (6), 2 states have call predecessors, (6), 2 states have return successors, (6), 3 states have call predecessors, (6), 3 states have call successors, (6) [2024-12-02 11:04:17,563 INFO L276 IsEmpty]: Start isEmpty. Operand 30773 states and 39805 transitions. [2024-12-02 11:04:17,564 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 91 [2024-12-02 11:04:17,564 INFO L210 NwaCegarLoop]: Found error trace [2024-12-02 11:04:17,564 INFO L218 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-12-02 11:04:17,564 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable21 [2024-12-02 11:04:17,564 INFO L396 AbstractCegarLoop]: === Iteration 23 === Targeting ULTIMATE.startErr4ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 3 more)] === [2024-12-02 11:04:17,564 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-12-02 11:04:17,564 INFO L85 PathProgramCache]: Analyzing trace with hash 1347302416, now seen corresponding path program 1 times [2024-12-02 11:04:17,564 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-12-02 11:04:17,565 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1458991018] [2024-12-02 11:04:17,565 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-12-02 11:04:17,565 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-12-02 11:04:17,571 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-12-02 11:04:17,606 INFO L134 CoverageAnalysis]: Checked inductivity of 17 backedges. 12 proven. 0 refuted. 0 times theorem prover too weak. 5 trivial. 0 not checked. [2024-12-02 11:04:17,606 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-12-02 11:04:17,606 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1458991018] [2024-12-02 11:04:17,606 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1458991018] provided 1 perfect and 0 imperfect interpolant sequences [2024-12-02 11:04:17,606 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-12-02 11:04:17,606 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2024-12-02 11:04:17,607 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [166311882] [2024-12-02 11:04:17,607 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-12-02 11:04:17,607 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2024-12-02 11:04:17,607 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-12-02 11:04:17,607 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2024-12-02 11:04:17,607 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2024-12-02 11:04:17,607 INFO L87 Difference]: Start difference. First operand 30773 states and 39805 transitions. Second operand has 6 states, 6 states have (on average 12.333333333333334) internal successors, (74), 5 states have internal predecessors, (74), 3 states have call successors, (6), 2 states have call predecessors, (6), 2 states have return successors, (6), 3 states have call predecessors, (6), 3 states have call successors, (6) [2024-12-02 11:04:19,391 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-12-02 11:04:19,391 INFO L93 Difference]: Finished difference Result 51832 states and 67223 transitions. [2024-12-02 11:04:19,392 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2024-12-02 11:04:19,392 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 12.333333333333334) internal successors, (74), 5 states have internal predecessors, (74), 3 states have call successors, (6), 2 states have call predecessors, (6), 2 states have return successors, (6), 3 states have call predecessors, (6), 3 states have call successors, (6) Word has length 90 [2024-12-02 11:04:19,392 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-12-02 11:04:19,455 INFO L225 Difference]: With dead ends: 51832 [2024-12-02 11:04:19,455 INFO L226 Difference]: Without dead ends: 31366 [2024-12-02 11:04:19,477 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 21 GetRequests, 9 SyntacticMatches, 0 SemanticMatches, 12 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 24 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=59, Invalid=123, Unknown=0, NotChecked=0, Total=182 [2024-12-02 11:04:19,477 INFO L435 NwaCegarLoop]: 223 mSDtfsCounter, 664 mSDsluCounter, 717 mSDsCounter, 0 mSdLazyCounter, 498 mSolverCounterSat, 86 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 678 SdHoareTripleChecker+Valid, 940 SdHoareTripleChecker+Invalid, 584 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 86 IncrementalHoareTripleChecker+Valid, 498 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2024-12-02 11:04:19,477 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [678 Valid, 940 Invalid, 584 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [86 Valid, 498 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time] [2024-12-02 11:04:19,491 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 31366 states. [2024-12-02 11:04:20,741 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 31366 to 30690. [2024-12-02 11:04:20,760 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 30690 states, 25990 states have (on average 1.2746825702193152) internal successors, (33129), 26783 states have internal predecessors, (33129), 2197 states have call successors, (2197), 1504 states have call predecessors, (2197), 2497 states have return successors, (4250), 2406 states have call predecessors, (4250), 2197 states have call successors, (4250) [2024-12-02 11:04:20,808 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 30690 states to 30690 states and 39576 transitions. [2024-12-02 11:04:20,828 INFO L78 Accepts]: Start accepts. Automaton has 30690 states and 39576 transitions. Word has length 90 [2024-12-02 11:04:20,828 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-12-02 11:04:20,828 INFO L471 AbstractCegarLoop]: Abstraction has 30690 states and 39576 transitions. [2024-12-02 11:04:20,828 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 12.333333333333334) internal successors, (74), 5 states have internal predecessors, (74), 3 states have call successors, (6), 2 states have call predecessors, (6), 2 states have return successors, (6), 3 states have call predecessors, (6), 3 states have call successors, (6) [2024-12-02 11:04:20,828 INFO L276 IsEmpty]: Start isEmpty. Operand 30690 states and 39576 transitions. [2024-12-02 11:04:20,830 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 99 [2024-12-02 11:04:20,830 INFO L210 NwaCegarLoop]: Found error trace [2024-12-02 11:04:20,830 INFO L218 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-12-02 11:04:20,830 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable22 [2024-12-02 11:04:20,830 INFO L396 AbstractCegarLoop]: === Iteration 24 === Targeting ULTIMATE.startErr4ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 3 more)] === [2024-12-02 11:04:20,831 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-12-02 11:04:20,831 INFO L85 PathProgramCache]: Analyzing trace with hash -153825703, now seen corresponding path program 1 times [2024-12-02 11:04:20,831 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-12-02 11:04:20,831 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [337760743] [2024-12-02 11:04:20,831 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-12-02 11:04:20,831 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-12-02 11:04:20,838 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-12-02 11:04:20,852 INFO L134 CoverageAnalysis]: Checked inductivity of 20 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 20 trivial. 0 not checked. [2024-12-02 11:04:20,852 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-12-02 11:04:20,853 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [337760743] [2024-12-02 11:04:20,853 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [337760743] provided 1 perfect and 0 imperfect interpolant sequences [2024-12-02 11:04:20,853 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-12-02 11:04:20,853 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-12-02 11:04:20,853 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [249842796] [2024-12-02 11:04:20,853 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-12-02 11:04:20,853 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-12-02 11:04:20,853 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-12-02 11:04:20,854 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-12-02 11:04:20,854 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-12-02 11:04:20,854 INFO L87 Difference]: Start difference. First operand 30690 states and 39576 transitions. Second operand has 3 states, 3 states have (on average 21.666666666666668) internal successors, (65), 3 states have internal predecessors, (65), 2 states have call successors, (7), 1 states have call predecessors, (7), 1 states have return successors, (7), 2 states have call predecessors, (7), 2 states have call successors, (7) [2024-12-02 11:04:22,266 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-12-02 11:04:22,266 INFO L93 Difference]: Finished difference Result 56568 states and 73388 transitions. [2024-12-02 11:04:22,267 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-12-02 11:04:22,267 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 21.666666666666668) internal successors, (65), 3 states have internal predecessors, (65), 2 states have call successors, (7), 1 states have call predecessors, (7), 1 states have return successors, (7), 2 states have call predecessors, (7), 2 states have call successors, (7) Word has length 98 [2024-12-02 11:04:22,267 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-12-02 11:04:22,345 INFO L225 Difference]: With dead ends: 56568 [2024-12-02 11:04:22,345 INFO L226 Difference]: Without dead ends: 34665 [2024-12-02 11:04:22,379 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-12-02 11:04:22,380 INFO L435 NwaCegarLoop]: 186 mSDtfsCounter, 140 mSDsluCounter, 164 mSDsCounter, 0 mSdLazyCounter, 8 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 140 SdHoareTripleChecker+Valid, 350 SdHoareTripleChecker+Invalid, 10 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 8 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-12-02 11:04:22,380 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [140 Valid, 350 Invalid, 10 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 8 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-12-02 11:04:22,398 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 34665 states. [2024-12-02 11:04:23,758 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 34665 to 28913. [2024-12-02 11:04:23,775 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 28913 states, 24443 states have (on average 1.2654747780550668) internal successors, (30932), 25142 states have internal predecessors, (30932), 2145 states have call successors, (2145), 1464 states have call predecessors, (2145), 2319 states have return successors, (3930), 2310 states have call predecessors, (3930), 2145 states have call successors, (3930) [2024-12-02 11:04:23,819 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 28913 states to 28913 states and 37007 transitions. [2024-12-02 11:04:23,838 INFO L78 Accepts]: Start accepts. Automaton has 28913 states and 37007 transitions. Word has length 98 [2024-12-02 11:04:23,838 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-12-02 11:04:23,838 INFO L471 AbstractCegarLoop]: Abstraction has 28913 states and 37007 transitions. [2024-12-02 11:04:23,838 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 21.666666666666668) internal successors, (65), 3 states have internal predecessors, (65), 2 states have call successors, (7), 1 states have call predecessors, (7), 1 states have return successors, (7), 2 states have call predecessors, (7), 2 states have call successors, (7) [2024-12-02 11:04:23,838 INFO L276 IsEmpty]: Start isEmpty. Operand 28913 states and 37007 transitions. [2024-12-02 11:04:23,841 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 110 [2024-12-02 11:04:23,841 INFO L210 NwaCegarLoop]: Found error trace [2024-12-02 11:04:23,841 INFO L218 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-12-02 11:04:23,841 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable23 [2024-12-02 11:04:23,841 INFO L396 AbstractCegarLoop]: === Iteration 25 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 3 more)] === [2024-12-02 11:04:23,842 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-12-02 11:04:23,842 INFO L85 PathProgramCache]: Analyzing trace with hash 2130130058, now seen corresponding path program 1 times [2024-12-02 11:04:23,842 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-12-02 11:04:23,842 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [859010341] [2024-12-02 11:04:23,842 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-12-02 11:04:23,842 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-12-02 11:04:23,852 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-12-02 11:04:23,896 INFO L134 CoverageAnalysis]: Checked inductivity of 31 backedges. 9 proven. 0 refuted. 0 times theorem prover too weak. 22 trivial. 0 not checked. [2024-12-02 11:04:23,896 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-12-02 11:04:23,896 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [859010341] [2024-12-02 11:04:23,896 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [859010341] provided 1 perfect and 0 imperfect interpolant sequences [2024-12-02 11:04:23,896 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-12-02 11:04:23,896 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2024-12-02 11:04:23,896 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [55375584] [2024-12-02 11:04:23,896 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-12-02 11:04:23,897 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2024-12-02 11:04:23,897 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-12-02 11:04:23,897 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2024-12-02 11:04:23,897 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2024-12-02 11:04:23,897 INFO L87 Difference]: Start difference. First operand 28913 states and 37007 transitions. Second operand has 7 states, 7 states have (on average 10.428571428571429) internal successors, (73), 6 states have internal predecessors, (73), 3 states have call successors, (8), 2 states have call predecessors, (8), 3 states have return successors, (8), 3 states have call predecessors, (8), 3 states have call successors, (8) [2024-12-02 11:04:25,777 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-12-02 11:04:25,777 INFO L93 Difference]: Finished difference Result 47826 states and 61809 transitions. [2024-12-02 11:04:25,778 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2024-12-02 11:04:25,778 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 10.428571428571429) internal successors, (73), 6 states have internal predecessors, (73), 3 states have call successors, (8), 2 states have call predecessors, (8), 3 states have return successors, (8), 3 states have call predecessors, (8), 3 states have call successors, (8) Word has length 109 [2024-12-02 11:04:25,778 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-12-02 11:04:25,841 INFO L225 Difference]: With dead ends: 47826 [2024-12-02 11:04:25,841 INFO L226 Difference]: Without dead ends: 29330 [2024-12-02 11:04:25,865 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 26 GetRequests, 11 SyntacticMatches, 0 SemanticMatches, 15 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 39 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=71, Invalid=201, Unknown=0, NotChecked=0, Total=272 [2024-12-02 11:04:25,865 INFO L435 NwaCegarLoop]: 222 mSDtfsCounter, 1233 mSDsluCounter, 795 mSDsCounter, 0 mSdLazyCounter, 577 mSolverCounterSat, 229 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1245 SdHoareTripleChecker+Valid, 1017 SdHoareTripleChecker+Invalid, 806 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 229 IncrementalHoareTripleChecker+Valid, 577 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2024-12-02 11:04:25,865 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [1245 Valid, 1017 Invalid, 806 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [229 Valid, 577 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time] [2024-12-02 11:04:25,879 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 29330 states. [2024-12-02 11:04:27,218 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 29330 to 28913. [2024-12-02 11:04:27,231 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 28913 states, 24443 states have (on average 1.2590925827435258) internal successors, (30776), 25142 states have internal predecessors, (30776), 2145 states have call successors, (2145), 1464 states have call predecessors, (2145), 2319 states have return successors, (3696), 2310 states have call predecessors, (3696), 2145 states have call successors, (3696) [2024-12-02 11:04:27,272 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 28913 states to 28913 states and 36617 transitions. [2024-12-02 11:04:27,290 INFO L78 Accepts]: Start accepts. Automaton has 28913 states and 36617 transitions. Word has length 109 [2024-12-02 11:04:27,291 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-12-02 11:04:27,291 INFO L471 AbstractCegarLoop]: Abstraction has 28913 states and 36617 transitions. [2024-12-02 11:04:27,291 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 10.428571428571429) internal successors, (73), 6 states have internal predecessors, (73), 3 states have call successors, (8), 2 states have call predecessors, (8), 3 states have return successors, (8), 3 states have call predecessors, (8), 3 states have call successors, (8) [2024-12-02 11:04:27,291 INFO L276 IsEmpty]: Start isEmpty. Operand 28913 states and 36617 transitions. [2024-12-02 11:04:27,293 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 116 [2024-12-02 11:04:27,293 INFO L210 NwaCegarLoop]: Found error trace [2024-12-02 11:04:27,293 INFO L218 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-12-02 11:04:27,294 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable24 [2024-12-02 11:04:27,294 INFO L396 AbstractCegarLoop]: === Iteration 26 === Targeting ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 3 more)] === [2024-12-02 11:04:27,294 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-12-02 11:04:27,294 INFO L85 PathProgramCache]: Analyzing trace with hash -103716298, now seen corresponding path program 1 times [2024-12-02 11:04:27,294 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-12-02 11:04:27,294 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [181759127] [2024-12-02 11:04:27,294 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-12-02 11:04:27,294 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-12-02 11:04:27,302 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-12-02 11:04:27,327 INFO L134 CoverageAnalysis]: Checked inductivity of 33 backedges. 4 proven. 0 refuted. 0 times theorem prover too weak. 29 trivial. 0 not checked. [2024-12-02 11:04:27,328 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-12-02 11:04:27,328 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [181759127] [2024-12-02 11:04:27,328 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [181759127] provided 1 perfect and 0 imperfect interpolant sequences [2024-12-02 11:04:27,328 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-12-02 11:04:27,328 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-12-02 11:04:27,328 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [391790888] [2024-12-02 11:04:27,328 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-12-02 11:04:27,328 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-12-02 11:04:27,328 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-12-02 11:04:27,329 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-12-02 11:04:27,329 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-12-02 11:04:27,329 INFO L87 Difference]: Start difference. First operand 28913 states and 36617 transitions. Second operand has 3 states, 2 states have (on average 38.0) internal successors, (76), 3 states have internal predecessors, (76), 2 states have call successors, (7), 1 states have call predecessors, (7), 1 states have return successors, (7), 2 states have call predecessors, (7), 2 states have call successors, (7) [2024-12-02 11:04:28,924 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-12-02 11:04:28,924 INFO L93 Difference]: Finished difference Result 28913 states and 36617 transitions. [2024-12-02 11:04:28,925 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-12-02 11:04:28,925 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 2 states have (on average 38.0) internal successors, (76), 3 states have internal predecessors, (76), 2 states have call successors, (7), 1 states have call predecessors, (7), 1 states have return successors, (7), 2 states have call predecessors, (7), 2 states have call successors, (7) Word has length 115 [2024-12-02 11:04:28,925 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-12-02 11:04:28,992 INFO L225 Difference]: With dead ends: 28913 [2024-12-02 11:04:28,992 INFO L226 Difference]: Without dead ends: 28911 [2024-12-02 11:04:28,999 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-12-02 11:04:28,999 INFO L435 NwaCegarLoop]: 178 mSDtfsCounter, 173 mSDsluCounter, 0 mSDsCounter, 0 mSdLazyCounter, 7 mSolverCounterSat, 4 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 173 SdHoareTripleChecker+Valid, 178 SdHoareTripleChecker+Invalid, 11 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 4 IncrementalHoareTripleChecker+Valid, 7 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-12-02 11:04:28,999 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [173 Valid, 178 Invalid, 11 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [4 Valid, 7 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-12-02 11:04:29,013 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 28911 states. [2024-12-02 11:04:30,539 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 28911 to 28911. [2024-12-02 11:04:30,557 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 28911 states, 24443 states have (on average 1.2549196088859795) internal successors, (30674), 25140 states have internal predecessors, (30674), 2145 states have call successors, (2145), 1464 states have call predecessors, (2145), 2319 states have return successors, (3696), 2310 states have call predecessors, (3696), 2145 states have call successors, (3696) [2024-12-02 11:04:30,603 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 28911 states to 28911 states and 36515 transitions. [2024-12-02 11:04:30,625 INFO L78 Accepts]: Start accepts. Automaton has 28911 states and 36515 transitions. Word has length 115 [2024-12-02 11:04:30,625 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-12-02 11:04:30,625 INFO L471 AbstractCegarLoop]: Abstraction has 28911 states and 36515 transitions. [2024-12-02 11:04:30,625 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 2 states have (on average 38.0) internal successors, (76), 3 states have internal predecessors, (76), 2 states have call successors, (7), 1 states have call predecessors, (7), 1 states have return successors, (7), 2 states have call predecessors, (7), 2 states have call successors, (7) [2024-12-02 11:04:30,625 INFO L276 IsEmpty]: Start isEmpty. Operand 28911 states and 36515 transitions. [2024-12-02 11:04:30,628 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 117 [2024-12-02 11:04:30,628 INFO L210 NwaCegarLoop]: Found error trace [2024-12-02 11:04:30,628 INFO L218 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-12-02 11:04:30,629 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable25 [2024-12-02 11:04:30,629 INFO L396 AbstractCegarLoop]: === Iteration 27 === Targeting ULTIMATE.startErr3ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 3 more)] === [2024-12-02 11:04:30,629 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-12-02 11:04:30,629 INFO L85 PathProgramCache]: Analyzing trace with hash 1079762394, now seen corresponding path program 1 times [2024-12-02 11:04:30,629 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-12-02 11:04:30,629 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1278733412] [2024-12-02 11:04:30,629 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-12-02 11:04:30,629 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-12-02 11:04:30,638 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-12-02 11:04:30,638 INFO L357 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-12-02 11:04:30,644 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-12-02 11:04:30,683 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2024-12-02 11:04:30,684 INFO L340 BasicCegarLoop]: Counterexample is feasible [2024-12-02 11:04:30,684 INFO L782 garLoopResultBuilder]: Registering result UNSAFE for location ULTIMATE.startErr3ASSERT_VIOLATIONINTEGER_OVERFLOW (5 of 6 remaining) [2024-12-02 11:04:30,686 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW (4 of 6 remaining) [2024-12-02 11:04:30,686 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW (3 of 6 remaining) [2024-12-02 11:04:30,686 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (2 of 6 remaining) [2024-12-02 11:04:30,686 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr4ASSERT_VIOLATIONINTEGER_OVERFLOW (1 of 6 remaining) [2024-12-02 11:04:30,687 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr5ASSERT_VIOLATIONINTEGER_OVERFLOW (0 of 6 remaining) [2024-12-02 11:04:30,687 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable26 [2024-12-02 11:04:30,690 INFO L422 BasicCegarLoop]: Path program histogram: [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-12-02 11:04:30,761 INFO L170 ceAbstractionStarter]: Computing trace abstraction results [2024-12-02 11:04:30,764 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 02.12 11:04:30 BoogieIcfgContainer [2024-12-02 11:04:30,764 INFO L131 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2024-12-02 11:04:30,764 INFO L112 PluginConnector]: ------------------------Witness Printer---------------------------- [2024-12-02 11:04:30,764 INFO L270 PluginConnector]: Initializing Witness Printer... [2024-12-02 11:04:30,765 INFO L274 PluginConnector]: Witness Printer initialized [2024-12-02 11:04:30,765 INFO L184 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 02.12 11:03:49" (3/4) ... [2024-12-02 11:04:30,766 INFO L140 WitnessPrinter]: Generating witness for reachability counterexample [2024-12-02 11:04:30,855 INFO L129 tionWitnessGenerator]: Generated YAML witness of length 84. [2024-12-02 11:04:30,921 INFO L149 WitnessManager]: Wrote witness to /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_e4c7f443-ae64-4d73-a924-d6e5ffc60efb/bin/uautomizer-verify-84ZbGMXZE1/witness.graphml [2024-12-02 11:04:30,921 INFO L149 WitnessManager]: Wrote witness to /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_e4c7f443-ae64-4d73-a924-d6e5ffc60efb/bin/uautomizer-verify-84ZbGMXZE1/witness.yml [2024-12-02 11:04:30,921 INFO L131 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2024-12-02 11:04:30,922 INFO L158 Benchmark]: Toolchain (without parser) took 42330.93ms. Allocated memory was 117.4MB in the beginning and 4.5GB in the end (delta: 4.4GB). Free memory was 93.3MB in the beginning and 2.1GB in the end (delta: -2.0GB). Peak memory consumption was 2.5GB. Max. memory is 16.1GB. [2024-12-02 11:04:30,922 INFO L158 Benchmark]: CDTParser took 0.25ms. Allocated memory is still 117.4MB. Free memory is still 71.9MB. There was no memory consumed. Max. memory is 16.1GB. [2024-12-02 11:04:30,922 INFO L158 Benchmark]: CACSL2BoogieTranslator took 253.21ms. Allocated memory is still 117.4MB. Free memory was 93.0MB in the beginning and 79.6MB in the end (delta: 13.4MB). Peak memory consumption was 16.8MB. Max. memory is 16.1GB. [2024-12-02 11:04:30,923 INFO L158 Benchmark]: Boogie Procedure Inliner took 32.62ms. Allocated memory is still 117.4MB. Free memory was 79.4MB in the beginning and 77.5MB in the end (delta: 1.8MB). There was no memory consumed. Max. memory is 16.1GB. [2024-12-02 11:04:30,923 INFO L158 Benchmark]: Boogie Preprocessor took 32.51ms. Allocated memory is still 117.4MB. Free memory was 77.5MB in the beginning and 75.6MB in the end (delta: 1.9MB). There was no memory consumed. Max. memory is 16.1GB. [2024-12-02 11:04:30,923 INFO L158 Benchmark]: RCFGBuilder took 436.02ms. Allocated memory is still 117.4MB. Free memory was 75.6MB in the beginning and 54.0MB in the end (delta: 21.7MB). Peak memory consumption was 25.2MB. Max. memory is 16.1GB. [2024-12-02 11:04:30,923 INFO L158 Benchmark]: TraceAbstraction took 41414.37ms. Allocated memory was 117.4MB in the beginning and 4.5GB in the end (delta: 4.4GB). Free memory was 53.5MB in the beginning and 2.1GB in the end (delta: -2.0GB). Peak memory consumption was 2.4GB. Max. memory is 16.1GB. [2024-12-02 11:04:30,923 INFO L158 Benchmark]: Witness Printer took 156.81ms. Allocated memory is still 4.5GB. Free memory was 2.1GB in the beginning and 2.1GB in the end (delta: 16.8MB). Peak memory consumption was 16.8MB. Max. memory is 16.1GB. [2024-12-02 11:04:30,925 INFO L338 ainManager$Toolchain]: ####################### End [Toolchain 1] ####################### --- Results --- * Results from de.uni_freiburg.informatik.ultimate.core: - StatisticsResult: Toolchain Benchmarks Benchmark results are: * CDTParser took 0.25ms. Allocated memory is still 117.4MB. Free memory is still 71.9MB. There was no memory consumed. Max. memory is 16.1GB. * CACSL2BoogieTranslator took 253.21ms. Allocated memory is still 117.4MB. Free memory was 93.0MB in the beginning and 79.6MB in the end (delta: 13.4MB). Peak memory consumption was 16.8MB. Max. memory is 16.1GB. * Boogie Procedure Inliner took 32.62ms. Allocated memory is still 117.4MB. Free memory was 79.4MB in the beginning and 77.5MB in the end (delta: 1.8MB). There was no memory consumed. Max. memory is 16.1GB. * Boogie Preprocessor took 32.51ms. Allocated memory is still 117.4MB. Free memory was 77.5MB in the beginning and 75.6MB in the end (delta: 1.9MB). There was no memory consumed. Max. memory is 16.1GB. * RCFGBuilder took 436.02ms. Allocated memory is still 117.4MB. Free memory was 75.6MB in the beginning and 54.0MB in the end (delta: 21.7MB). Peak memory consumption was 25.2MB. Max. memory is 16.1GB. * TraceAbstraction took 41414.37ms. Allocated memory was 117.4MB in the beginning and 4.5GB in the end (delta: 4.4GB). Free memory was 53.5MB in the beginning and 2.1GB in the end (delta: -2.0GB). Peak memory consumption was 2.4GB. Max. memory is 16.1GB. * Witness Printer took 156.81ms. Allocated memory is still 4.5GB. Free memory was 2.1GB in the beginning and 2.1GB in the end (delta: 16.8MB). Peak memory consumption was 16.8MB. 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: 113]: integer overflow possible integer overflow possible We found a FailurePath: [L24] int m_pc = 0; [L25] int t1_pc = 0; [L26] int t2_pc = 0; [L27] int m_st ; [L28] int t1_st ; [L29] int t2_st ; [L30] int m_i ; [L31] int t1_i ; [L32] int t2_i ; [L33] int M_E = 2; [L34] int T1_E = 2; [L35] int T2_E = 2; [L36] int E_M = 2; [L37] int E_1 = 2; [L38] int E_2 = 2; [L43] int token ; [L45] int local ; VAL [E_1=2, E_2=2, E_M=2, M_E=2, T1_E=2, T2_E=2, local=0, m_i=0, m_pc=0, m_st=0, t1_i=0, t1_pc=0, t1_st=0, t2_i=0, t2_pc=0, t2_st=0, token=0] [L598] int __retres1 ; [L602] CALL init_model() [L512] m_i = 1 [L513] t1_i = 1 [L514] t2_i = 1 VAL [E_1=2, E_2=2, E_M=2, M_E=2, T1_E=2, T2_E=2, local=0, m_i=1, m_pc=0, m_st=0, t1_i=1, t1_pc=0, t1_st=0, t2_i=1, t2_pc=0, t2_st=0, token=0] [L602] RET init_model() [L603] CALL start_simulation() [L539] int kernel_st ; [L540] int tmp ; [L541] int tmp___0 ; [L545] kernel_st = 0 VAL [E_1=2, E_2=2, E_M=2, M_E=2, T1_E=2, T2_E=2, local=0, m_i=1, m_pc=0, m_st=0, t1_i=1, t1_pc=0, t1_st=0, t2_i=1, t2_pc=0, t2_st=0, token=0] [L546] FCALL update_channels() VAL [E_1=2, E_2=2, E_M=2, M_E=2, T1_E=2, T2_E=2, local=0, m_i=1, m_pc=0, m_st=0, t1_i=1, t1_pc=0, t1_st=0, t2_i=1, t2_pc=0, t2_st=0, token=0] [L547] CALL init_threads() [L231] COND TRUE m_i == 1 [L232] m_st = 0 VAL [E_1=2, E_2=2, E_M=2, M_E=2, T1_E=2, T2_E=2, local=0, m_i=1, m_pc=0, m_st=0, t1_i=1, t1_pc=0, t1_st=0, t2_i=1, t2_pc=0, t2_st=0, token=0] [L236] COND TRUE t1_i == 1 [L237] t1_st = 0 VAL [E_1=2, E_2=2, E_M=2, M_E=2, T1_E=2, T2_E=2, local=0, m_i=1, m_pc=0, m_st=0, t1_i=1, t1_pc=0, t1_st=0, t2_i=1, t2_pc=0, t2_st=0, token=0] [L241] COND TRUE t2_i == 1 [L242] t2_st = 0 VAL [E_1=2, E_2=2, E_M=2, M_E=2, T1_E=2, T2_E=2, local=0, m_i=1, m_pc=0, m_st=0, t1_i=1, t1_pc=0, t1_st=0, t2_i=1, t2_pc=0, t2_st=0, token=0] [L547] RET init_threads() [L548] CALL fire_delta_events() VAL [E_1=2, E_2=2, E_M=2, M_E=2, T1_E=2, T2_E=2, \old(E_1)=2, \old(E_2)=2, \old(E_M)=2, \old(M_E)=2, \old(T1_E)=2, \old(T2_E)=2, local=0, m_i=1, m_pc=0, m_st=0, t1_i=1, t1_pc=0, t1_st=0, t2_i=1, t2_pc=0, t2_st=0, token=0] [L344] COND FALSE !(M_E == 0) VAL [E_1=2, E_2=2, E_M=2, M_E=2, T1_E=2, T2_E=2, \old(E_1)=2, \old(E_2)=2, \old(E_M)=2, \old(M_E)=2, \old(T1_E)=2, \old(T2_E)=2, local=0, m_i=1, m_pc=0, m_st=0, t1_i=1, t1_pc=0, t1_st=0, t2_i=1, t2_pc=0, t2_st=0, token=0] [L349] COND FALSE !(T1_E == 0) VAL [E_1=2, E_2=2, E_M=2, M_E=2, T1_E=2, T2_E=2, \old(E_1)=2, \old(E_2)=2, \old(E_M)=2, \old(M_E)=2, \old(T1_E)=2, \old(T2_E)=2, local=0, m_i=1, m_pc=0, m_st=0, t1_i=1, t1_pc=0, t1_st=0, t2_i=1, t2_pc=0, t2_st=0, token=0] [L354] COND FALSE !(T2_E == 0) VAL [E_1=2, E_2=2, E_M=2, M_E=2, T1_E=2, T2_E=2, \old(E_1)=2, \old(E_2)=2, \old(E_M)=2, \old(M_E)=2, \old(T1_E)=2, \old(T2_E)=2, local=0, m_i=1, m_pc=0, m_st=0, t1_i=1, t1_pc=0, t1_st=0, t2_i=1, t2_pc=0, t2_st=0, token=0] [L359] COND FALSE !(E_M == 0) VAL [E_1=2, E_2=2, E_M=2, M_E=2, T1_E=2, T2_E=2, \old(E_1)=2, \old(E_2)=2, \old(E_M)=2, \old(M_E)=2, \old(T1_E)=2, \old(T2_E)=2, local=0, m_i=1, m_pc=0, m_st=0, t1_i=1, t1_pc=0, t1_st=0, t2_i=1, t2_pc=0, t2_st=0, token=0] [L364] COND FALSE !(E_1 == 0) VAL [E_1=2, E_2=2, E_M=2, M_E=2, T1_E=2, T2_E=2, \old(E_1)=2, \old(E_2)=2, \old(E_M)=2, \old(M_E)=2, \old(T1_E)=2, \old(T2_E)=2, local=0, m_i=1, m_pc=0, m_st=0, t1_i=1, t1_pc=0, t1_st=0, t2_i=1, t2_pc=0, t2_st=0, token=0] [L369] COND FALSE !(E_2 == 0) VAL [E_1=2, E_2=2, E_M=2, M_E=2, T1_E=2, T2_E=2, \old(E_1)=2, \old(E_2)=2, \old(E_M)=2, \old(M_E)=2, \old(T1_E)=2, \old(T2_E)=2, local=0, m_i=1, m_pc=0, m_st=0, t1_i=1, t1_pc=0, t1_st=0, t2_i=1, t2_pc=0, t2_st=0, token=0] [L548] RET fire_delta_events() VAL [E_1=2, E_2=2, E_M=2, M_E=2, T1_E=2, T2_E=2, local=0, m_i=1, m_pc=0, m_st=0, t1_i=1, t1_pc=0, t1_st=0, t2_i=1, t2_pc=0, t2_st=0, token=0] [L549] CALL activate_threads() VAL [E_1=2, E_2=2, E_M=2, M_E=2, T1_E=2, T2_E=2, \old(m_st)=0, \old(t1_st)=0, \old(t2_st)=0, local=0, m_i=1, m_pc=0, m_st=0, t1_i=1, t1_pc=0, t1_st=0, t2_i=1, t2_pc=0, t2_st=0, token=0] [L417] int tmp ; [L418] int tmp___0 ; [L419] int tmp___1 ; [L423] CALL, EXPR is_master_triggered() [L163] int __retres1 ; VAL [E_1=2, E_2=2, E_M=2, M_E=2, T1_E=2, T2_E=2, \old(m_st)=0, \old(t1_st)=0, \old(t2_st)=0, local=0, m_i=1, m_pc=0, m_st=0, t1_i=1, t1_pc=0, t1_st=0, t2_i=1, t2_pc=0, t2_st=0, token=0] [L166] COND FALSE !(m_pc == 1) VAL [E_1=2, E_2=2, E_M=2, M_E=2, T1_E=2, T2_E=2, \old(m_st)=0, \old(t1_st)=0, \old(t2_st)=0, local=0, m_i=1, m_pc=0, m_st=0, t1_i=1, t1_pc=0, t1_st=0, t2_i=1, t2_pc=0, t2_st=0, token=0] [L176] __retres1 = 0 VAL [E_1=2, E_2=2, E_M=2, M_E=2, T1_E=2, T2_E=2, \old(m_st)=0, \old(t1_st)=0, \old(t2_st)=0, __retres1=0, local=0, m_i=1, m_pc=0, m_st=0, t1_i=1, t1_pc=0, t1_st=0, t2_i=1, t2_pc=0, t2_st=0, token=0] [L178] return (__retres1); VAL [E_1=2, E_2=2, E_M=2, M_E=2, T1_E=2, T2_E=2, \old(m_st)=0, \old(t1_st)=0, \old(t2_st)=0, \result=0, local=0, m_i=1, m_pc=0, m_st=0, t1_i=1, t1_pc=0, t1_st=0, t2_i=1, t2_pc=0, t2_st=0, token=0] [L423] RET, EXPR is_master_triggered() [L423] tmp = is_master_triggered() [L425] COND FALSE !(\read(tmp)) VAL [E_1=2, E_2=2, E_M=2, M_E=2, T1_E=2, T2_E=2, \old(m_st)=0, \old(t1_st)=0, \old(t2_st)=0, local=0, m_i=1, m_pc=0, m_st=0, t1_i=1, t1_pc=0, t1_st=0, t2_i=1, t2_pc=0, t2_st=0, token=0] [L431] CALL, EXPR is_transmit1_triggered() [L182] int __retres1 ; VAL [E_1=2, E_2=2, E_M=2, M_E=2, T1_E=2, T2_E=2, \old(m_st)=0, \old(t1_st)=0, \old(t2_st)=0, local=0, m_i=1, m_pc=0, m_st=0, t1_i=1, t1_pc=0, t1_st=0, t2_i=1, t2_pc=0, t2_st=0, token=0] [L185] COND FALSE !(t1_pc == 1) VAL [E_1=2, E_2=2, E_M=2, M_E=2, T1_E=2, T2_E=2, \old(m_st)=0, \old(t1_st)=0, \old(t2_st)=0, local=0, m_i=1, m_pc=0, m_st=0, t1_i=1, t1_pc=0, t1_st=0, t2_i=1, t2_pc=0, t2_st=0, token=0] [L195] __retres1 = 0 VAL [E_1=2, E_2=2, E_M=2, M_E=2, T1_E=2, T2_E=2, \old(m_st)=0, \old(t1_st)=0, \old(t2_st)=0, __retres1=0, local=0, m_i=1, m_pc=0, m_st=0, t1_i=1, t1_pc=0, t1_st=0, t2_i=1, t2_pc=0, t2_st=0, token=0] [L197] return (__retres1); VAL [E_1=2, E_2=2, E_M=2, M_E=2, T1_E=2, T2_E=2, \old(m_st)=0, \old(t1_st)=0, \old(t2_st)=0, \result=0, local=0, m_i=1, m_pc=0, m_st=0, t1_i=1, t1_pc=0, t1_st=0, t2_i=1, t2_pc=0, t2_st=0, token=0] [L431] RET, EXPR is_transmit1_triggered() [L431] tmp___0 = is_transmit1_triggered() [L433] COND FALSE !(\read(tmp___0)) VAL [E_1=2, E_2=2, E_M=2, M_E=2, T1_E=2, T2_E=2, \old(m_st)=0, \old(t1_st)=0, \old(t2_st)=0, local=0, m_i=1, m_pc=0, m_st=0, t1_i=1, t1_pc=0, t1_st=0, t2_i=1, t2_pc=0, t2_st=0, token=0] [L439] CALL, EXPR is_transmit2_triggered() [L201] int __retres1 ; VAL [E_1=2, E_2=2, E_M=2, M_E=2, T1_E=2, T2_E=2, \old(m_st)=0, \old(t1_st)=0, \old(t2_st)=0, local=0, m_i=1, m_pc=0, m_st=0, t1_i=1, t1_pc=0, t1_st=0, t2_i=1, t2_pc=0, t2_st=0, token=0] [L204] COND FALSE !(t2_pc == 1) VAL [E_1=2, E_2=2, E_M=2, M_E=2, T1_E=2, T2_E=2, \old(m_st)=0, \old(t1_st)=0, \old(t2_st)=0, local=0, m_i=1, m_pc=0, m_st=0, t1_i=1, t1_pc=0, t1_st=0, t2_i=1, t2_pc=0, t2_st=0, token=0] [L214] __retres1 = 0 VAL [E_1=2, E_2=2, E_M=2, M_E=2, T1_E=2, T2_E=2, \old(m_st)=0, \old(t1_st)=0, \old(t2_st)=0, __retres1=0, local=0, m_i=1, m_pc=0, m_st=0, t1_i=1, t1_pc=0, t1_st=0, t2_i=1, t2_pc=0, t2_st=0, token=0] [L216] return (__retres1); VAL [E_1=2, E_2=2, E_M=2, M_E=2, T1_E=2, T2_E=2, \old(m_st)=0, \old(t1_st)=0, \old(t2_st)=0, \result=0, local=0, m_i=1, m_pc=0, m_st=0, t1_i=1, t1_pc=0, t1_st=0, t2_i=1, t2_pc=0, t2_st=0, token=0] [L439] RET, EXPR is_transmit2_triggered() [L439] tmp___1 = is_transmit2_triggered() [L441] COND FALSE !(\read(tmp___1)) VAL [E_1=2, E_2=2, E_M=2, M_E=2, T1_E=2, T2_E=2, \old(m_st)=0, \old(t1_st)=0, \old(t2_st)=0, local=0, m_i=1, m_pc=0, m_st=0, t1_i=1, t1_pc=0, t1_st=0, t2_i=1, t2_pc=0, t2_st=0, token=0] [L549] RET activate_threads() VAL [E_1=2, E_2=2, E_M=2, M_E=2, T1_E=2, T2_E=2, local=0, m_i=1, m_pc=0, m_st=0, t1_i=1, t1_pc=0, t1_st=0, t2_i=1, t2_pc=0, t2_st=0, token=0] [L550] CALL reset_delta_events() VAL [E_1=2, E_2=2, E_M=2, M_E=2, T1_E=2, T2_E=2, \old(E_1)=2, \old(E_2)=2, \old(E_M)=2, \old(M_E)=2, \old(T1_E)=2, \old(T2_E)=2, local=0, m_i=1, m_pc=0, m_st=0, t1_i=1, t1_pc=0, t1_st=0, t2_i=1, t2_pc=0, t2_st=0, token=0] [L382] COND FALSE !(M_E == 1) VAL [E_1=2, E_2=2, E_M=2, M_E=2, T1_E=2, T2_E=2, \old(E_1)=2, \old(E_2)=2, \old(E_M)=2, \old(M_E)=2, \old(T1_E)=2, \old(T2_E)=2, local=0, m_i=1, m_pc=0, m_st=0, t1_i=1, t1_pc=0, t1_st=0, t2_i=1, t2_pc=0, t2_st=0, token=0] [L387] COND FALSE !(T1_E == 1) VAL [E_1=2, E_2=2, E_M=2, M_E=2, T1_E=2, T2_E=2, \old(E_1)=2, \old(E_2)=2, \old(E_M)=2, \old(M_E)=2, \old(T1_E)=2, \old(T2_E)=2, local=0, m_i=1, m_pc=0, m_st=0, t1_i=1, t1_pc=0, t1_st=0, t2_i=1, t2_pc=0, t2_st=0, token=0] [L392] COND FALSE !(T2_E == 1) VAL [E_1=2, E_2=2, E_M=2, M_E=2, T1_E=2, T2_E=2, \old(E_1)=2, \old(E_2)=2, \old(E_M)=2, \old(M_E)=2, \old(T1_E)=2, \old(T2_E)=2, local=0, m_i=1, m_pc=0, m_st=0, t1_i=1, t1_pc=0, t1_st=0, t2_i=1, t2_pc=0, t2_st=0, token=0] [L397] COND FALSE !(E_M == 1) VAL [E_1=2, E_2=2, E_M=2, M_E=2, T1_E=2, T2_E=2, \old(E_1)=2, \old(E_2)=2, \old(E_M)=2, \old(M_E)=2, \old(T1_E)=2, \old(T2_E)=2, local=0, m_i=1, m_pc=0, m_st=0, t1_i=1, t1_pc=0, t1_st=0, t2_i=1, t2_pc=0, t2_st=0, token=0] [L402] COND FALSE !(E_1 == 1) VAL [E_1=2, E_2=2, E_M=2, M_E=2, T1_E=2, T2_E=2, \old(E_1)=2, \old(E_2)=2, \old(E_M)=2, \old(M_E)=2, \old(T1_E)=2, \old(T2_E)=2, local=0, m_i=1, m_pc=0, m_st=0, t1_i=1, t1_pc=0, t1_st=0, t2_i=1, t2_pc=0, t2_st=0, token=0] [L407] COND FALSE !(E_2 == 1) VAL [E_1=2, E_2=2, E_M=2, M_E=2, T1_E=2, T2_E=2, \old(E_1)=2, \old(E_2)=2, \old(E_M)=2, \old(M_E)=2, \old(T1_E)=2, \old(T2_E)=2, local=0, m_i=1, m_pc=0, m_st=0, t1_i=1, t1_pc=0, t1_st=0, t2_i=1, t2_pc=0, t2_st=0, token=0] [L550] RET reset_delta_events() VAL [E_1=2, E_2=2, E_M=2, M_E=2, T1_E=2, T2_E=2, local=0, m_i=1, m_pc=0, m_st=0, t1_i=1, t1_pc=0, t1_st=0, t2_i=1, t2_pc=0, t2_st=0, token=0] [L556] kernel_st = 1 [L557] CALL eval() [L277] int tmp ; VAL [E_1=2, E_2=2, E_M=2, M_E=2, T1_E=2, T2_E=2, local=0, m_i=1, m_pc=0, m_st=0, t1_i=1, t1_pc=0, t1_st=0, t2_i=1, t2_pc=0, t2_st=0, token=0] [L284] CALL, EXPR exists_runnable_thread() VAL [E_1=2, E_2=2, E_M=2, M_E=2, T1_E=2, T2_E=2, local=0, m_i=1, m_pc=0, m_st=0, t1_i=1, t1_pc=0, t1_st=0, t2_i=1, t2_pc=0, t2_st=0, token=0] [L251] int __retres1 ; VAL [E_1=2, E_2=2, E_M=2, M_E=2, T1_E=2, T2_E=2, local=0, m_i=1, m_pc=0, m_st=0, t1_i=1, t1_pc=0, t1_st=0, t2_i=1, t2_pc=0, t2_st=0, token=0] [L254] COND TRUE m_st == 0 [L255] __retres1 = 1 VAL [E_1=2, E_2=2, E_M=2, M_E=2, T1_E=2, T2_E=2, __retres1=1, local=0, m_i=1, m_pc=0, m_st=0, t1_i=1, t1_pc=0, t1_st=0, t2_i=1, t2_pc=0, t2_st=0, token=0] [L272] return (__retres1); VAL [E_1=2, E_2=2, E_M=2, M_E=2, T1_E=2, T2_E=2, \result=1, local=0, m_i=1, m_pc=0, m_st=0, t1_i=1, t1_pc=0, t1_st=0, t2_i=1, t2_pc=0, t2_st=0, token=0] [L284] RET, EXPR exists_runnable_thread() VAL [E_1=2, E_2=2, E_M=2, M_E=2, T1_E=2, T2_E=2, local=0, m_i=1, m_pc=0, m_st=0, t1_i=1, t1_pc=0, t1_st=0, t2_i=1, t2_pc=0, t2_st=0, token=0] [L284] tmp = exists_runnable_thread() [L286] COND TRUE \read(tmp) VAL [E_1=2, E_2=2, E_M=2, M_E=2, T1_E=2, T2_E=2, local=0, m_i=1, m_pc=0, m_st=0, t1_i=1, t1_pc=0, t1_st=0, t2_i=1, t2_pc=0, t2_st=0, token=0] [L291] COND TRUE m_st == 0 [L292] int tmp_ndt_1; [L293] tmp_ndt_1 = __VERIFIER_nondet_int() [L294] COND FALSE !(\read(tmp_ndt_1)) VAL [E_1=2, E_2=2, E_M=2, M_E=2, T1_E=2, T2_E=2, local=0, m_i=1, m_pc=0, m_st=0, t1_i=1, t1_pc=0, t1_st=0, t2_i=1, t2_pc=0, t2_st=0, token=0] [L305] COND TRUE t1_st == 0 [L306] int tmp_ndt_2; [L307] tmp_ndt_2 = __VERIFIER_nondet_int() [L308] COND TRUE \read(tmp_ndt_2) [L310] t1_st = 1 [L311] CALL transmit1() [L94] COND TRUE t1_pc == 0 VAL [E_1=2, E_2=2, E_M=2, M_E=2, T1_E=2, T2_E=2, local=0, m_i=1, m_pc=0, m_st=0, t1_i=1, t1_pc=0, t1_st=1, t2_i=1, t2_pc=0, t2_st=0, token=0] [L107] t1_pc = 1 [L108] t1_st = 2 VAL [E_1=2, E_2=2, E_M=2, M_E=2, T1_E=2, T2_E=2, local=0, m_i=1, m_pc=0, m_st=0, t1_i=1, t1_pc=1, t1_st=2, t2_i=1, t2_pc=0, t2_st=0, token=0] [L311] RET transmit1() [L319] COND TRUE t2_st == 0 [L320] int tmp_ndt_3; [L321] tmp_ndt_3 = __VERIFIER_nondet_int() [L322] COND FALSE !(\read(tmp_ndt_3)) VAL [E_1=2, E_2=2, E_M=2, M_E=2, T1_E=2, T2_E=2, local=0, m_i=1, m_pc=0, m_st=0, t1_i=1, t1_pc=1, t1_st=2, t2_i=1, t2_pc=0, t2_st=0, token=0] [L284] CALL, EXPR exists_runnable_thread() VAL [E_1=2, E_2=2, E_M=2, M_E=2, T1_E=2, T2_E=2, local=0, m_i=1, m_pc=0, m_st=0, t1_i=1, t1_pc=1, t1_st=2, t2_i=1, t2_pc=0, t2_st=0, token=0] [L251] int __retres1 ; VAL [E_1=2, E_2=2, E_M=2, M_E=2, T1_E=2, T2_E=2, local=0, m_i=1, m_pc=0, m_st=0, t1_i=1, t1_pc=1, t1_st=2, t2_i=1, t2_pc=0, t2_st=0, token=0] [L254] COND TRUE m_st == 0 [L255] __retres1 = 1 VAL [E_1=2, E_2=2, E_M=2, M_E=2, T1_E=2, T2_E=2, __retres1=1, local=0, m_i=1, m_pc=0, m_st=0, t1_i=1, t1_pc=1, t1_st=2, t2_i=1, t2_pc=0, t2_st=0, token=0] [L272] return (__retres1); VAL [E_1=2, E_2=2, E_M=2, M_E=2, T1_E=2, T2_E=2, \result=1, local=0, m_i=1, m_pc=0, m_st=0, t1_i=1, t1_pc=1, t1_st=2, t2_i=1, t2_pc=0, t2_st=0, token=0] [L284] RET, EXPR exists_runnable_thread() VAL [E_1=2, E_2=2, E_M=2, M_E=2, T1_E=2, T2_E=2, local=0, m_i=1, m_pc=0, m_st=0, t1_i=1, t1_pc=1, t1_st=2, t2_i=1, t2_pc=0, t2_st=0, token=0] [L284] tmp = exists_runnable_thread() [L286] COND TRUE \read(tmp) VAL [E_1=2, E_2=2, E_M=2, M_E=2, T1_E=2, T2_E=2, local=0, m_i=1, m_pc=0, m_st=0, t1_i=1, t1_pc=1, t1_st=2, t2_i=1, t2_pc=0, t2_st=0, token=0] [L291] COND TRUE m_st == 0 [L292] int tmp_ndt_1; [L293] tmp_ndt_1 = __VERIFIER_nondet_int() [L294] COND TRUE \read(tmp_ndt_1) [L296] m_st = 1 [L297] CALL master() [L50] COND TRUE m_pc == 0 VAL [E_1=2, E_2=2, E_M=2, M_E=2, T1_E=2, T2_E=2, local=0, m_i=1, m_pc=0, m_st=1, t1_i=1, t1_pc=1, t1_st=2, t2_i=1, t2_pc=0, t2_st=0, token=0] [L64] token = __VERIFIER_nondet_int() [L65] local = token [L66] E_1 = 1 VAL [E_1=1, E_2=2, E_M=2, M_E=2, T1_E=2, T2_E=2, local=2147483647, m_i=1, m_pc=0, m_st=1, t1_i=1, t1_pc=1, t1_st=2, t2_i=1, t2_pc=0, t2_st=0, token=2147483647] [L67] CALL immediate_notify() VAL [E_1=1, E_2=2, E_M=2, M_E=2, T1_E=2, T2_E=2, \old(m_st)=1, \old(t1_st)=2, \old(t2_st)=0, local=2147483647, m_i=1, m_pc=0, m_st=1, t1_i=1, t1_pc=1, t1_st=2, t2_i=1, t2_pc=0, t2_st=0, token=2147483647] [L455] CALL activate_threads() VAL [E_1=1, E_2=2, E_M=2, M_E=2, T1_E=2, T2_E=2, \old(m_st)=1, \old(t1_st)=2, \old(t2_st)=0, local=2147483647, m_i=1, m_pc=0, m_st=1, t1_i=1, t1_pc=1, t1_st=2, t2_i=1, t2_pc=0, t2_st=0, token=2147483647] [L417] int tmp ; [L418] int tmp___0 ; [L419] int tmp___1 ; [L423] CALL, EXPR is_master_triggered() [L163] int __retres1 ; VAL [E_1=1, E_2=2, E_M=2, M_E=2, T1_E=2, T2_E=2, \old(m_st)=1, \old(t1_st)=2, \old(t2_st)=0, local=2147483647, m_i=1, m_pc=0, m_st=1, t1_i=1, t1_pc=1, t1_st=2, t2_i=1, t2_pc=0, t2_st=0, token=2147483647] [L166] COND FALSE !(m_pc == 1) VAL [E_1=1, E_2=2, E_M=2, M_E=2, T1_E=2, T2_E=2, \old(m_st)=1, \old(t1_st)=2, \old(t2_st)=0, local=2147483647, m_i=1, m_pc=0, m_st=1, t1_i=1, t1_pc=1, t1_st=2, t2_i=1, t2_pc=0, t2_st=0, token=2147483647] [L176] __retres1 = 0 VAL [E_1=1, E_2=2, E_M=2, M_E=2, T1_E=2, T2_E=2, \old(m_st)=1, \old(t1_st)=2, \old(t2_st)=0, __retres1=0, local=2147483647, m_i=1, m_pc=0, m_st=1, t1_i=1, t1_pc=1, t1_st=2, t2_i=1, t2_pc=0, t2_st=0, token=2147483647] [L178] return (__retres1); VAL [E_1=1, E_2=2, E_M=2, M_E=2, T1_E=2, T2_E=2, \old(m_st)=1, \old(t1_st)=2, \old(t2_st)=0, \result=0, local=2147483647, m_i=1, m_pc=0, m_st=1, t1_i=1, t1_pc=1, t1_st=2, t2_i=1, t2_pc=0, t2_st=0, token=2147483647] [L423] RET, EXPR is_master_triggered() [L423] tmp = is_master_triggered() [L425] COND FALSE !(\read(tmp)) VAL [E_1=1, E_2=2, E_M=2, M_E=2, T1_E=2, T2_E=2, \old(m_st)=1, \old(t1_st)=2, \old(t2_st)=0, local=2147483647, m_i=1, m_pc=0, m_st=1, t1_i=1, t1_pc=1, t1_st=2, t2_i=1, t2_pc=0, t2_st=0, token=2147483647] [L431] CALL, EXPR is_transmit1_triggered() [L182] int __retres1 ; VAL [E_1=1, E_2=2, E_M=2, M_E=2, T1_E=2, T2_E=2, \old(m_st)=1, \old(t1_st)=2, \old(t2_st)=0, local=2147483647, m_i=1, m_pc=0, m_st=1, t1_i=1, t1_pc=1, t1_st=2, t2_i=1, t2_pc=0, t2_st=0, token=2147483647] [L185] COND TRUE t1_pc == 1 VAL [E_1=1, E_2=2, E_M=2, M_E=2, T1_E=2, T2_E=2, \old(m_st)=1, \old(t1_st)=2, \old(t2_st)=0, local=2147483647, m_i=1, m_pc=0, m_st=1, t1_i=1, t1_pc=1, t1_st=2, t2_i=1, t2_pc=0, t2_st=0, token=2147483647] [L186] COND TRUE E_1 == 1 [L187] __retres1 = 1 VAL [E_1=1, E_2=2, E_M=2, M_E=2, T1_E=2, T2_E=2, \old(m_st)=1, \old(t1_st)=2, \old(t2_st)=0, __retres1=1, local=2147483647, m_i=1, m_pc=0, m_st=1, t1_i=1, t1_pc=1, t1_st=2, t2_i=1, t2_pc=0, t2_st=0, token=2147483647] [L197] return (__retres1); VAL [E_1=1, E_2=2, E_M=2, M_E=2, T1_E=2, T2_E=2, \old(m_st)=1, \old(t1_st)=2, \old(t2_st)=0, \result=1, local=2147483647, m_i=1, m_pc=0, m_st=1, t1_i=1, t1_pc=1, t1_st=2, t2_i=1, t2_pc=0, t2_st=0, token=2147483647] [L431] RET, EXPR is_transmit1_triggered() [L431] tmp___0 = is_transmit1_triggered() [L433] COND TRUE \read(tmp___0) [L434] t1_st = 0 VAL [E_1=1, E_2=2, E_M=2, M_E=2, T1_E=2, T2_E=2, \old(m_st)=1, \old(t1_st)=2, \old(t2_st)=0, local=2147483647, m_i=1, m_pc=0, m_st=1, t1_i=1, t1_pc=1, t1_st=0, t2_i=1, t2_pc=0, t2_st=0, token=2147483647] [L439] CALL, EXPR is_transmit2_triggered() [L201] int __retres1 ; VAL [E_1=1, E_2=2, E_M=2, M_E=2, T1_E=2, T2_E=2, \old(m_st)=1, \old(t1_st)=2, \old(t2_st)=0, local=2147483647, m_i=1, m_pc=0, m_st=1, t1_i=1, t1_pc=1, t1_st=0, t2_i=1, t2_pc=0, t2_st=0, token=2147483647] [L204] COND FALSE !(t2_pc == 1) VAL [E_1=1, E_2=2, E_M=2, M_E=2, T1_E=2, T2_E=2, \old(m_st)=1, \old(t1_st)=2, \old(t2_st)=0, local=2147483647, m_i=1, m_pc=0, m_st=1, t1_i=1, t1_pc=1, t1_st=0, t2_i=1, t2_pc=0, t2_st=0, token=2147483647] [L214] __retres1 = 0 VAL [E_1=1, E_2=2, E_M=2, M_E=2, T1_E=2, T2_E=2, \old(m_st)=1, \old(t1_st)=2, \old(t2_st)=0, __retres1=0, local=2147483647, m_i=1, m_pc=0, m_st=1, t1_i=1, t1_pc=1, t1_st=0, t2_i=1, t2_pc=0, t2_st=0, token=2147483647] [L216] return (__retres1); VAL [E_1=1, E_2=2, E_M=2, M_E=2, T1_E=2, T2_E=2, \old(m_st)=1, \old(t1_st)=2, \old(t2_st)=0, \result=0, local=2147483647, m_i=1, m_pc=0, m_st=1, t1_i=1, t1_pc=1, t1_st=0, t2_i=1, t2_pc=0, t2_st=0, token=2147483647] [L439] RET, EXPR is_transmit2_triggered() [L439] tmp___1 = is_transmit2_triggered() [L441] COND FALSE !(\read(tmp___1)) VAL [E_1=1, E_2=2, E_M=2, M_E=2, T1_E=2, T2_E=2, \old(m_st)=1, \old(t1_st)=2, \old(t2_st)=0, local=2147483647, m_i=1, m_pc=0, m_st=1, t1_i=1, t1_pc=1, t1_st=0, t2_i=1, t2_pc=0, t2_st=0, token=2147483647] [L455] RET activate_threads() VAL [E_1=1, E_2=2, E_M=2, M_E=2, T1_E=2, T2_E=2, \old(m_st)=1, \old(t1_st)=2, \old(t2_st)=0, local=2147483647, m_i=1, m_pc=0, m_st=1, t1_i=1, t1_pc=1, t1_st=0, t2_i=1, t2_pc=0, t2_st=0, token=2147483647] [L67] RET immediate_notify() VAL [E_1=1, E_2=2, E_M=2, M_E=2, T1_E=2, T2_E=2, local=2147483647, m_i=1, m_pc=0, m_st=1, t1_i=1, t1_pc=1, t1_st=0, t2_i=1, t2_pc=0, t2_st=0, token=2147483647] [L68] E_1 = 2 [L69] m_pc = 1 [L70] m_st = 2 VAL [E_1=2, E_2=2, E_M=2, M_E=2, T1_E=2, T2_E=2, local=2147483647, m_i=1, m_pc=1, m_st=2, t1_i=1, t1_pc=1, t1_st=0, t2_i=1, t2_pc=0, t2_st=0, token=2147483647] [L297] RET master() [L305] COND TRUE t1_st == 0 [L306] int tmp_ndt_2; [L307] tmp_ndt_2 = __VERIFIER_nondet_int() [L308] COND TRUE \read(tmp_ndt_2) [L310] t1_st = 1 [L311] CALL transmit1() [L94] COND FALSE !(t1_pc == 0) VAL [E_1=2, E_2=2, E_M=2, M_E=2, T1_E=2, T2_E=2, local=2147483647, m_i=1, m_pc=1, m_st=2, t1_i=1, t1_pc=1, t1_st=1, t2_i=1, t2_pc=0, t2_st=0, token=2147483647] [L97] COND TRUE t1_pc == 1 VAL [E_1=2, E_2=2, E_M=2, M_E=2, T1_E=2, T2_E=2, local=2147483647, m_i=1, m_pc=1, m_st=2, t1_i=1, t1_pc=1, t1_st=1, t2_i=1, t2_pc=0, t2_st=0, token=2147483647] [L113] token += 1 VAL [E_1=2, E_2=2, E_M=2, M_E=2, T1_E=2, T2_E=2, local=2147483647, m_i=1, m_pc=1, m_st=2, t1_i=1, t1_pc=1, t1_st=1, t2_i=1, t2_pc=0, t2_st=0, token=2147483647] - UnprovableResult [Line: 75]: Unable to prove that integer overflow can never occur Unable to prove that integer overflow can never occur Reason: Not analyzed. - UnprovableResult [Line: 75]: Unable to prove that integer overflow can never occur Unable to prove that integer overflow can never occur Reason: Not analyzed. - UnprovableResult [Line: 113]: Unable to prove that integer overflow can never occur Unable to prove that integer overflow can never occur Reason: Not analyzed. - UnprovableResult [Line: 149]: Unable to prove that integer overflow can never occur Unable to prove that integer overflow can never occur Reason: Not analyzed. - UnprovableResult [Line: 149]: 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, 140 locations, 6 error locations. Started 1 CEGAR loops. OverallTime: 41.3s, OverallIterations: 27, TraceHistogramMax: 2, PathProgramHistogramMax: 1, EmptinessCheckTime: 0.1s, AutomataDifference: 21.5s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 0.0s, HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 8051 SdHoareTripleChecker+Valid, 4.5s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 7903 mSDsluCounter, 15365 SdHoareTripleChecker+Invalid, 3.6s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 10290 mSDsCounter, 938 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 5668 IncrementalHoareTripleChecker+Invalid, 6606 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 938 mSolverCounterUnsat, 5075 mSDtfsCounter, 5668 mSolverCounterSat, 0.1s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 234 GetRequests, 104 SyntacticMatches, 0 SemanticMatches, 130 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 104 ImplicationChecksByTransitivity, 0.6s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=36885occurred in iteration=20, InterpolantAutomatonStates: 175, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s DumpTime, AutomataMinimizationStatistics: 17.4s AutomataMinimizationTime, 26 MinimizatonAttempts, 10848 StatesRemovedByMinimization, 19 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.1s SsaConstructionTime, 0.1s SatisfiabilityAnalysisTime, 1.6s InterpolantComputationTime, 2057 NumberOfCodeBlocks, 2057 NumberOfCodeBlocksAsserted, 27 NumberOfCheckSat, 1915 ConstructedInterpolants, 0 QuantifiedInterpolants, 3363 SizeOfPredicates, 0 NumberOfNonLiveVariables, 0 ConjunctsInSsa, 0 ConjunctsInUnsatCore, 26 InterpolantComputations, 26 PerfectInterpolantSequences, 173/173 InterpolantCoveringCapability, INVARIANT_SYNTHESIS: No data available, INTERPOLANT_CONSOLIDATION: No data available, ABSTRACT_INTERPRETATION: No data available, PDR: No data available, ACCELERATED_INTERPOLATION: No data available, SIFA: No data available, ReuseStatistics: No data available, ConComCheckerStatistics: No data available RESULT: Ultimate proved your program to be incorrect! [2024-12-02 11:04:30,942 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_e4c7f443-ae64-4d73-a924-d6e5ffc60efb/bin/uautomizer-verify-84ZbGMXZE1/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Ended with 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)