./Ultimate.py --spec ../sv-benchmarks/c/properties/unreach-call.prp --file ../sv-benchmarks/c/bitvector/byte_add_2-2.i --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for ERROR reachability Using default analysis Version a31fd051 Calling Ultimate with: /usr/bin/java -Dosgi.configuration.area=/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/config -Xmx15G -Xms4m -jar /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/plugins/org.eclipse.equinox.launcher_1.5.800.v20200727-1323.jar -data @noDefault -ultimatedata /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data -tc /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/AutomizerReach.xml -i ../sv-benchmarks/c/bitvector/byte_add_2-2.i -s /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux --witnessprinter.witness.filename witness.graphml --witnessprinter.write.witness.besides.input.file false --witnessprinter.graph.data.specification CHECK( init(main()), LTL(G ! call(reach_error())) ) --witnessprinter.graph.data.producer Automizer --witnessprinter.graph.data.architecture 32bit --witnessprinter.graph.data.programhash de6decccd91c37b79cf607a5f07869bb0707e08de203e3ce6759a25f4e6e01ba --- Real Ultimate output --- This is Ultimate 0.2.2-?-a31fd05 [2023-02-15 10:17:59,012 INFO L177 SettingsManager]: Resetting all preferences to default values... [2023-02-15 10:17:59,015 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2023-02-15 10:17:59,054 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2023-02-15 10:17:59,055 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2023-02-15 10:17:59,058 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2023-02-15 10:17:59,062 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2023-02-15 10:17:59,065 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2023-02-15 10:17:59,067 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2023-02-15 10:17:59,072 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2023-02-15 10:17:59,073 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2023-02-15 10:17:59,076 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2023-02-15 10:17:59,076 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2023-02-15 10:17:59,078 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2023-02-15 10:17:59,080 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2023-02-15 10:17:59,081 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2023-02-15 10:17:59,082 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2023-02-15 10:17:59,084 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2023-02-15 10:17:59,085 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2023-02-15 10:17:59,090 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2023-02-15 10:17:59,107 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2023-02-15 10:17:59,108 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2023-02-15 10:17:59,109 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2023-02-15 10:17:59,110 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2023-02-15 10:17:59,116 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2023-02-15 10:17:59,117 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2023-02-15 10:17:59,117 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2023-02-15 10:17:59,119 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2023-02-15 10:17:59,119 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2023-02-15 10:17:59,120 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2023-02-15 10:17:59,120 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2023-02-15 10:17:59,121 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2023-02-15 10:17:59,122 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2023-02-15 10:17:59,123 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2023-02-15 10:17:59,124 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2023-02-15 10:17:59,125 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2023-02-15 10:17:59,125 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2023-02-15 10:17:59,126 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2023-02-15 10:17:59,126 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2023-02-15 10:17:59,134 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2023-02-15 10:17:59,135 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2023-02-15 10:17:59,136 INFO L101 SettingsManager]: Beginning loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Default.epf [2023-02-15 10:17:59,178 INFO L113 SettingsManager]: Loading preferences was successful [2023-02-15 10:17:59,178 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2023-02-15 10:17:59,179 INFO L136 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2023-02-15 10:17:59,179 INFO L138 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2023-02-15 10:17:59,180 INFO L136 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2023-02-15 10:17:59,180 INFO L138 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2023-02-15 10:17:59,181 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2023-02-15 10:17:59,181 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2023-02-15 10:17:59,181 INFO L138 SettingsManager]: * Use SBE=true [2023-02-15 10:17:59,181 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2023-02-15 10:17:59,182 INFO L138 SettingsManager]: * sizeof long=4 [2023-02-15 10:17:59,182 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2023-02-15 10:17:59,182 INFO L138 SettingsManager]: * sizeof POINTER=4 [2023-02-15 10:17:59,182 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2023-02-15 10:17:59,183 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2023-02-15 10:17:59,183 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2023-02-15 10:17:59,183 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2023-02-15 10:17:59,183 INFO L138 SettingsManager]: * sizeof long double=12 [2023-02-15 10:17:59,183 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2023-02-15 10:17:59,183 INFO L138 SettingsManager]: * Use constant arrays=true [2023-02-15 10:17:59,184 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2023-02-15 10:17:59,184 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2023-02-15 10:17:59,184 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2023-02-15 10:17:59,184 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2023-02-15 10:17:59,184 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2023-02-15 10:17:59,185 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2023-02-15 10:17:59,185 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2023-02-15 10:17:59,185 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2023-02-15 10:17:59,185 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2023-02-15 10:17:59,185 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2023-02-15 10:17:59,186 INFO L138 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2023-02-15 10:17:59,186 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2023-02-15 10:17:59,186 INFO L138 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2023-02-15 10:17:59,186 INFO L138 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2023-02-15 10:17:59,186 INFO L138 SettingsManager]: * Independence relation used for large block encoding in concurrent analysis=SYNTACTIC [2023-02-15 10:17:59,186 INFO L138 SettingsManager]: * Looper check in Petri net analysis=SEMANTIC WARNING: An illegal reflective access operation has occurred WARNING: Illegal reflective access by com.sun.xml.bind.v2.runtime.reflect.opt.Injector$1 (file:/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/plugins/com.sun.xml.bind_2.2.0.v201505121915.jar) to method java.lang.ClassLoader.defineClass(java.lang.String,byte[],int,int) WARNING: Please consider reporting this to the maintainers of com.sun.xml.bind.v2.runtime.reflect.opt.Injector$1 WARNING: Use --illegal-access=warn to enable warnings of further illegal reflective access operations WARNING: All illegal access operations will be denied in a future release Applying setting for plugin de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator: Entry function -> main Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Witness directory -> /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Witness filename -> witness.graphml Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Write witness besides input file -> false Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data specification -> CHECK( init(main()), LTL(G ! call(reach_error())) ) 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 -> de6decccd91c37b79cf607a5f07869bb0707e08de203e3ce6759a25f4e6e01ba [2023-02-15 10:17:59,392 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2023-02-15 10:17:59,451 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2023-02-15 10:17:59,453 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2023-02-15 10:17:59,454 INFO L271 PluginConnector]: Initializing CDTParser... [2023-02-15 10:17:59,454 INFO L275 PluginConnector]: CDTParser initialized [2023-02-15 10:17:59,456 INFO L432 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/bitvector/byte_add_2-2.i [2023-02-15 10:18:00,546 INFO L500 CDTParser]: Created temporary CDT project at NULL [2023-02-15 10:18:00,741 INFO L351 CDTParser]: Found 1 translation units. [2023-02-15 10:18:00,745 INFO L172 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/bitvector/byte_add_2-2.i [2023-02-15 10:18:00,752 INFO L394 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/60feae602/874c94f133794db1bbbb56a3db57869e/FLAGaf089a544 [2023-02-15 10:18:00,765 INFO L402 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/60feae602/874c94f133794db1bbbb56a3db57869e [2023-02-15 10:18:00,768 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2023-02-15 10:18:00,769 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2023-02-15 10:18:00,771 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2023-02-15 10:18:00,771 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2023-02-15 10:18:00,774 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2023-02-15 10:18:00,775 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 15.02 10:18:00" (1/1) ... [2023-02-15 10:18:00,776 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@2c0d5854 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.02 10:18:00, skipping insertion in model container [2023-02-15 10:18:00,776 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 15.02 10:18:00" (1/1) ... [2023-02-15 10:18:00,782 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2023-02-15 10:18:00,801 INFO L178 MainTranslator]: Built tables and reachable declarations [2023-02-15 10:18:00,918 WARN L237 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/bitvector/byte_add_2-2.i[1168,1181] [2023-02-15 10:18:00,949 INFO L210 PostProcessor]: Analyzing one entry point: main [2023-02-15 10:18:00,958 INFO L203 MainTranslator]: Completed pre-run [2023-02-15 10:18:00,968 WARN L237 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/bitvector/byte_add_2-2.i[1168,1181] [2023-02-15 10:18:01,017 INFO L210 PostProcessor]: Analyzing one entry point: main [2023-02-15 10:18:01,044 INFO L208 MainTranslator]: Completed translation [2023-02-15 10:18:01,045 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.02 10:18:01 WrapperNode [2023-02-15 10:18:01,045 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2023-02-15 10:18:01,047 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2023-02-15 10:18:01,047 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2023-02-15 10:18:01,047 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2023-02-15 10:18:01,055 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.02 10:18:01" (1/1) ... [2023-02-15 10:18:01,061 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.02 10:18:01" (1/1) ... [2023-02-15 10:18:01,094 INFO L138 Inliner]: procedures = 16, calls = 8, calls flagged for inlining = 4, calls inlined = 4, statements flattened = 141 [2023-02-15 10:18:01,095 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2023-02-15 10:18:01,095 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2023-02-15 10:18:01,096 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2023-02-15 10:18:01,096 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2023-02-15 10:18:01,104 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.02 10:18:01" (1/1) ... [2023-02-15 10:18:01,105 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.02 10:18:01" (1/1) ... [2023-02-15 10:18:01,107 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.02 10:18:01" (1/1) ... [2023-02-15 10:18:01,108 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.02 10:18:01" (1/1) ... [2023-02-15 10:18:01,116 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.02 10:18:01" (1/1) ... [2023-02-15 10:18:01,120 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.02 10:18:01" (1/1) ... [2023-02-15 10:18:01,123 INFO L185 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.02 10:18:01" (1/1) ... [2023-02-15 10:18:01,125 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.02 10:18:01" (1/1) ... [2023-02-15 10:18:01,129 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2023-02-15 10:18:01,130 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2023-02-15 10:18:01,130 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2023-02-15 10:18:01,130 INFO L275 PluginConnector]: RCFGBuilder initialized [2023-02-15 10:18:01,131 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.02 10:18:01" (1/1) ... [2023-02-15 10:18:01,149 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2023-02-15 10:18:01,166 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-02-15 10:18:01,184 INFO L229 MonitoredProcess]: Starting monitored process 1 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (exit command is (exit), workingDir is null) [2023-02-15 10:18:01,186 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (1)] Waiting until timeout for monitored process [2023-02-15 10:18:01,217 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2023-02-15 10:18:01,218 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2023-02-15 10:18:01,218 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2023-02-15 10:18:01,218 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2023-02-15 10:18:01,290 INFO L235 CfgBuilder]: Building ICFG [2023-02-15 10:18:01,296 INFO L261 CfgBuilder]: Building CFG for each procedure with an implementation [2023-02-15 10:18:01,727 INFO L276 CfgBuilder]: Performing block encoding [2023-02-15 10:18:01,732 INFO L295 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2023-02-15 10:18:01,733 INFO L300 CfgBuilder]: Removed 2 assume(true) statements. [2023-02-15 10:18:01,735 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 15.02 10:18:01 BoogieIcfgContainer [2023-02-15 10:18:01,735 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2023-02-15 10:18:01,737 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2023-02-15 10:18:01,737 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2023-02-15 10:18:01,740 INFO L275 PluginConnector]: TraceAbstraction initialized [2023-02-15 10:18:01,741 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 15.02 10:18:00" (1/3) ... [2023-02-15 10:18:01,741 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@1f22df19 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 15.02 10:18:01, skipping insertion in model container [2023-02-15 10:18:01,742 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.02 10:18:01" (2/3) ... [2023-02-15 10:18:01,742 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@1f22df19 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 15.02 10:18:01, skipping insertion in model container [2023-02-15 10:18:01,742 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 15.02 10:18:01" (3/3) ... [2023-02-15 10:18:01,743 INFO L112 eAbstractionObserver]: Analyzing ICFG byte_add_2-2.i [2023-02-15 10:18:01,761 INFO L203 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2023-02-15 10:18:01,761 INFO L162 ceAbstractionStarter]: Applying trace abstraction to program that has 1 error locations. [2023-02-15 10:18:01,828 INFO L356 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2023-02-15 10:18:01,835 INFO L357 AbstractCegarLoop]: Settings: SEPARATE_VIOLATION_CHECK=true, mInterprocedural=true, mMaxIterations=1000000, mWatchIteration=1000000, mArtifact=RCFG, mInterpolation=FPandBP, mInterpolantAutomaton=STRAIGHT_LINE, mDumpAutomata=false, mAutomataFormat=ATS_NUMERATE, mDumpPath=., mDeterminiation=PREDICATE_ABSTRACTION, mMinimize=MINIMIZE_SEVPA, mHoare=true, mAutomataTypeConcurrency=PETRI_NET, mHoareTripleChecks=INCREMENTAL, mHoareAnnotationPositions=LoopsAndPotentialCycles, mDumpOnlyReuseAutomata=false, mLimitTraceHistogram=0, mErrorLocTimeLimit=0, mLimitPathProgramCount=0, mCollectInterpolantStatistics=true, mHeuristicEmptinessCheck=false, mHeuristicEmptinessCheckAStarHeuristic=ZERO, mHeuristicEmptinessCheckAStarHeuristicRandomSeed=1337, mHeuristicEmptinessCheckSmtFeatureScoringMethod=DAGSIZE, mSMTFeatureExtraction=false, mSMTFeatureExtractionDumpPath=., mOverrideInterpolantAutomaton=false, mMcrInterpolantMethod=WP, mPorIndependenceSettings=[Lde.uni_freiburg.informatik.ultimate.lib.tracecheckerutils.partialorder.independence.IndependenceSettings;@6d49d7a1, mLbeIndependenceSettings=[IndependenceType=SYNTACTIC, AbstractionType=NONE, UseConditional=, UseSemiCommutativity=, Solver=, SolverTimeout=] [2023-02-15 10:18:01,835 INFO L358 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2023-02-15 10:18:01,839 INFO L276 IsEmpty]: Start isEmpty. Operand has 47 states, 45 states have (on average 1.7777777777777777) internal successors, (80), 46 states have internal predecessors, (80), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-02-15 10:18:01,845 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 14 [2023-02-15 10:18:01,846 INFO L187 NwaCegarLoop]: Found error trace [2023-02-15 10:18:01,846 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-02-15 10:18:01,847 INFO L420 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-02-15 10:18:01,852 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2023-02-15 10:18:01,852 INFO L85 PathProgramCache]: Analyzing trace with hash 903950584, now seen corresponding path program 1 times [2023-02-15 10:18:01,860 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-02-15 10:18:01,860 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [327165658] [2023-02-15 10:18:01,861 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-02-15 10:18:01,861 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-02-15 10:18:01,950 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-15 10:18:02,037 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-02-15 10:18:02,038 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-02-15 10:18:02,039 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [327165658] [2023-02-15 10:18:02,039 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [327165658] provided 1 perfect and 0 imperfect interpolant sequences [2023-02-15 10:18:02,040 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-02-15 10:18:02,040 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2023-02-15 10:18:02,041 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1855932204] [2023-02-15 10:18:02,042 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-02-15 10:18:02,047 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2023-02-15 10:18:02,048 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-02-15 10:18:02,074 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2023-02-15 10:18:02,075 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2023-02-15 10:18:02,077 INFO L87 Difference]: Start difference. First operand has 47 states, 45 states have (on average 1.7777777777777777) internal successors, (80), 46 states have internal predecessors, (80), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Second operand has 2 states, 2 states have (on average 6.5) internal successors, (13), 2 states have internal predecessors, (13), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-02-15 10:18:02,100 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-02-15 10:18:02,101 INFO L93 Difference]: Finished difference Result 64 states and 105 transitions. [2023-02-15 10:18:02,102 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2023-02-15 10:18:02,103 INFO L78 Accepts]: Start accepts. Automaton has has 2 states, 2 states have (on average 6.5) internal successors, (13), 2 states have internal predecessors, (13), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 13 [2023-02-15 10:18:02,103 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-02-15 10:18:02,118 INFO L225 Difference]: With dead ends: 64 [2023-02-15 10:18:02,118 INFO L226 Difference]: Without dead ends: 43 [2023-02-15 10:18:02,121 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 0 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2023-02-15 10:18:02,127 INFO L413 NwaCegarLoop]: 77 mSDtfsCounter, 0 mSDsluCounter, 0 mSDsCounter, 0 mSdLazyCounter, 0 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 77 SdHoareTripleChecker+Invalid, 0 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 0 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2023-02-15 10:18:02,129 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 77 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 0 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2023-02-15 10:18:02,144 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 43 states. [2023-02-15 10:18:02,161 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 43 to 43. [2023-02-15 10:18:02,163 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 43 states, 42 states have (on average 1.7380952380952381) internal successors, (73), 42 states have internal predecessors, (73), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-02-15 10:18:02,167 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 43 states to 43 states and 73 transitions. [2023-02-15 10:18:02,170 INFO L78 Accepts]: Start accepts. Automaton has 43 states and 73 transitions. Word has length 13 [2023-02-15 10:18:02,170 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-02-15 10:18:02,170 INFO L495 AbstractCegarLoop]: Abstraction has 43 states and 73 transitions. [2023-02-15 10:18:02,171 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 2 states, 2 states have (on average 6.5) internal successors, (13), 2 states have internal predecessors, (13), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-02-15 10:18:02,171 INFO L276 IsEmpty]: Start isEmpty. Operand 43 states and 73 transitions. [2023-02-15 10:18:02,172 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 14 [2023-02-15 10:18:02,172 INFO L187 NwaCegarLoop]: Found error trace [2023-02-15 10:18:02,172 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-02-15 10:18:02,173 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2023-02-15 10:18:02,173 INFO L420 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-02-15 10:18:02,174 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2023-02-15 10:18:02,174 INFO L85 PathProgramCache]: Analyzing trace with hash 430337229, now seen corresponding path program 1 times [2023-02-15 10:18:02,174 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-02-15 10:18:02,174 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1426912564] [2023-02-15 10:18:02,174 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-02-15 10:18:02,174 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-02-15 10:18:02,263 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-15 10:18:02,454 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-02-15 10:18:02,455 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-02-15 10:18:02,456 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1426912564] [2023-02-15 10:18:02,456 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1426912564] provided 1 perfect and 0 imperfect interpolant sequences [2023-02-15 10:18:02,456 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-02-15 10:18:02,456 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2023-02-15 10:18:02,457 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [973076504] [2023-02-15 10:18:02,457 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-02-15 10:18:02,458 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2023-02-15 10:18:02,458 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-02-15 10:18:02,459 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2023-02-15 10:18:02,460 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2023-02-15 10:18:02,461 INFO L87 Difference]: Start difference. First operand 43 states and 73 transitions. Second operand has 3 states, 3 states have (on average 4.333333333333333) internal successors, (13), 3 states have internal predecessors, (13), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-02-15 10:18:02,616 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-02-15 10:18:02,616 INFO L93 Difference]: Finished difference Result 102 states and 179 transitions. [2023-02-15 10:18:02,617 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2023-02-15 10:18:02,617 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 4.333333333333333) internal successors, (13), 3 states have internal predecessors, (13), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 13 [2023-02-15 10:18:02,617 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-02-15 10:18:02,618 INFO L225 Difference]: With dead ends: 102 [2023-02-15 10:18:02,618 INFO L226 Difference]: Without dead ends: 69 [2023-02-15 10:18:02,619 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2023-02-15 10:18:02,620 INFO L413 NwaCegarLoop]: 48 mSDtfsCounter, 29 mSDsluCounter, 29 mSDsCounter, 0 mSdLazyCounter, 68 mSolverCounterSat, 16 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 29 SdHoareTripleChecker+Valid, 77 SdHoareTripleChecker+Invalid, 84 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 16 IncrementalHoareTripleChecker+Valid, 68 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2023-02-15 10:18:02,621 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [29 Valid, 77 Invalid, 84 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [16 Valid, 68 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2023-02-15 10:18:02,622 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 69 states. [2023-02-15 10:18:02,627 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 69 to 67. [2023-02-15 10:18:02,627 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 67 states, 66 states have (on average 1.5606060606060606) internal successors, (103), 66 states have internal predecessors, (103), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-02-15 10:18:02,628 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 67 states to 67 states and 103 transitions. [2023-02-15 10:18:02,629 INFO L78 Accepts]: Start accepts. Automaton has 67 states and 103 transitions. Word has length 13 [2023-02-15 10:18:02,629 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-02-15 10:18:02,629 INFO L495 AbstractCegarLoop]: Abstraction has 67 states and 103 transitions. [2023-02-15 10:18:02,629 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 4.333333333333333) internal successors, (13), 3 states have internal predecessors, (13), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-02-15 10:18:02,647 INFO L276 IsEmpty]: Start isEmpty. Operand 67 states and 103 transitions. [2023-02-15 10:18:02,648 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 20 [2023-02-15 10:18:02,648 INFO L187 NwaCegarLoop]: Found error trace [2023-02-15 10:18:02,648 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-02-15 10:18:02,648 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2023-02-15 10:18:02,649 INFO L420 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-02-15 10:18:02,661 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2023-02-15 10:18:02,661 INFO L85 PathProgramCache]: Analyzing trace with hash -2037878536, now seen corresponding path program 1 times [2023-02-15 10:18:02,661 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-02-15 10:18:02,661 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1916870492] [2023-02-15 10:18:02,661 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-02-15 10:18:02,662 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-02-15 10:18:02,709 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-15 10:18:02,933 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 1 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-02-15 10:18:02,934 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-02-15 10:18:02,934 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1916870492] [2023-02-15 10:18:02,934 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1916870492] provided 1 perfect and 0 imperfect interpolant sequences [2023-02-15 10:18:02,934 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-02-15 10:18:02,934 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2023-02-15 10:18:02,934 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1858873045] [2023-02-15 10:18:02,935 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-02-15 10:18:02,935 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2023-02-15 10:18:02,935 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-02-15 10:18:02,936 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2023-02-15 10:18:02,936 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2023-02-15 10:18:02,936 INFO L87 Difference]: Start difference. First operand 67 states and 103 transitions. Second operand has 4 states, 4 states have (on average 4.75) internal successors, (19), 4 states have internal predecessors, (19), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-02-15 10:18:03,191 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-02-15 10:18:03,191 INFO L93 Difference]: Finished difference Result 168 states and 287 transitions. [2023-02-15 10:18:03,192 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2023-02-15 10:18:03,192 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 4.75) internal successors, (19), 4 states have internal predecessors, (19), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 19 [2023-02-15 10:18:03,192 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-02-15 10:18:03,194 INFO L225 Difference]: With dead ends: 168 [2023-02-15 10:18:03,194 INFO L226 Difference]: Without dead ends: 135 [2023-02-15 10:18:03,195 INFO L412 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 [2023-02-15 10:18:03,196 INFO L413 NwaCegarLoop]: 40 mSDtfsCounter, 112 mSDsluCounter, 65 mSDsCounter, 0 mSdLazyCounter, 119 mSolverCounterSat, 50 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 112 SdHoareTripleChecker+Valid, 105 SdHoareTripleChecker+Invalid, 169 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 50 IncrementalHoareTripleChecker+Valid, 119 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2023-02-15 10:18:03,196 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [112 Valid, 105 Invalid, 169 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [50 Valid, 119 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2023-02-15 10:18:03,197 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 135 states. [2023-02-15 10:18:03,205 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 135 to 93. [2023-02-15 10:18:03,206 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 93 states, 92 states have (on average 1.5543478260869565) internal successors, (143), 92 states have internal predecessors, (143), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-02-15 10:18:03,207 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 93 states to 93 states and 143 transitions. [2023-02-15 10:18:03,207 INFO L78 Accepts]: Start accepts. Automaton has 93 states and 143 transitions. Word has length 19 [2023-02-15 10:18:03,208 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-02-15 10:18:03,208 INFO L495 AbstractCegarLoop]: Abstraction has 93 states and 143 transitions. [2023-02-15 10:18:03,208 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 4.75) internal successors, (19), 4 states have internal predecessors, (19), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-02-15 10:18:03,208 INFO L276 IsEmpty]: Start isEmpty. Operand 93 states and 143 transitions. [2023-02-15 10:18:03,217 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2023-02-15 10:18:03,218 INFO L187 NwaCegarLoop]: Found error trace [2023-02-15 10:18:03,218 INFO L195 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-02-15 10:18:03,218 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2023-02-15 10:18:03,218 INFO L420 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-02-15 10:18:03,219 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2023-02-15 10:18:03,225 INFO L85 PathProgramCache]: Analyzing trace with hash -21369817, now seen corresponding path program 1 times [2023-02-15 10:18:03,226 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-02-15 10:18:03,226 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [255176325] [2023-02-15 10:18:03,226 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-02-15 10:18:03,226 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-02-15 10:18:03,252 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-15 10:18:03,425 INFO L134 CoverageAnalysis]: Checked inductivity of 8 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 8 trivial. 0 not checked. [2023-02-15 10:18:03,426 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-02-15 10:18:03,426 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [255176325] [2023-02-15 10:18:03,426 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [255176325] provided 1 perfect and 0 imperfect interpolant sequences [2023-02-15 10:18:03,427 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-02-15 10:18:03,427 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2023-02-15 10:18:03,427 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1774763297] [2023-02-15 10:18:03,428 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-02-15 10:18:03,428 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2023-02-15 10:18:03,429 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-02-15 10:18:03,429 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2023-02-15 10:18:03,430 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2023-02-15 10:18:03,430 INFO L87 Difference]: Start difference. First operand 93 states and 143 transitions. Second operand has 4 states, 4 states have (on average 5.25) internal successors, (21), 4 states have internal predecessors, (21), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-02-15 10:18:03,596 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-02-15 10:18:03,598 INFO L93 Difference]: Finished difference Result 272 states and 412 transitions. [2023-02-15 10:18:03,598 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2023-02-15 10:18:03,598 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 5.25) internal successors, (21), 4 states have internal predecessors, (21), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 25 [2023-02-15 10:18:03,599 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-02-15 10:18:03,606 INFO L225 Difference]: With dead ends: 272 [2023-02-15 10:18:03,606 INFO L226 Difference]: Without dead ends: 192 [2023-02-15 10:18:03,607 INFO L412 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 [2023-02-15 10:18:03,614 INFO L413 NwaCegarLoop]: 98 mSDtfsCounter, 105 mSDsluCounter, 103 mSDsCounter, 0 mSdLazyCounter, 118 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 105 SdHoareTripleChecker+Valid, 201 SdHoareTripleChecker+Invalid, 119 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 118 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2023-02-15 10:18:03,617 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [105 Valid, 201 Invalid, 119 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 118 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2023-02-15 10:18:03,619 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 192 states. [2023-02-15 10:18:03,629 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 192 to 101. [2023-02-15 10:18:03,634 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 101 states, 100 states have (on average 1.52) internal successors, (152), 100 states have internal predecessors, (152), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-02-15 10:18:03,637 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 101 states to 101 states and 152 transitions. [2023-02-15 10:18:03,639 INFO L78 Accepts]: Start accepts. Automaton has 101 states and 152 transitions. Word has length 25 [2023-02-15 10:18:03,639 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-02-15 10:18:03,640 INFO L495 AbstractCegarLoop]: Abstraction has 101 states and 152 transitions. [2023-02-15 10:18:03,640 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 5.25) internal successors, (21), 4 states have internal predecessors, (21), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-02-15 10:18:03,640 INFO L276 IsEmpty]: Start isEmpty. Operand 101 states and 152 transitions. [2023-02-15 10:18:03,641 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 27 [2023-02-15 10:18:03,642 INFO L187 NwaCegarLoop]: Found error trace [2023-02-15 10:18:03,643 INFO L195 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-02-15 10:18:03,643 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2023-02-15 10:18:03,643 INFO L420 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-02-15 10:18:03,644 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2023-02-15 10:18:03,645 INFO L85 PathProgramCache]: Analyzing trace with hash -53067146, now seen corresponding path program 1 times [2023-02-15 10:18:03,645 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-02-15 10:18:03,645 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1667637680] [2023-02-15 10:18:03,646 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-02-15 10:18:03,646 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-02-15 10:18:03,666 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-15 10:18:03,824 INFO L134 CoverageAnalysis]: Checked inductivity of 8 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 8 trivial. 0 not checked. [2023-02-15 10:18:03,824 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-02-15 10:18:03,825 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1667637680] [2023-02-15 10:18:03,825 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1667637680] provided 1 perfect and 0 imperfect interpolant sequences [2023-02-15 10:18:03,825 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-02-15 10:18:03,825 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2023-02-15 10:18:03,826 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1455765268] [2023-02-15 10:18:03,827 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-02-15 10:18:03,827 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2023-02-15 10:18:03,828 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-02-15 10:18:03,829 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2023-02-15 10:18:03,829 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2023-02-15 10:18:03,829 INFO L87 Difference]: Start difference. First operand 101 states and 152 transitions. Second operand has 3 states, 3 states have (on average 7.333333333333333) internal successors, (22), 3 states have internal predecessors, (22), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-02-15 10:18:03,840 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-02-15 10:18:03,841 INFO L93 Difference]: Finished difference Result 179 states and 272 transitions. [2023-02-15 10:18:03,841 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2023-02-15 10:18:03,841 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 7.333333333333333) internal successors, (22), 3 states have internal predecessors, (22), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 26 [2023-02-15 10:18:03,842 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-02-15 10:18:03,842 INFO L225 Difference]: With dead ends: 179 [2023-02-15 10:18:03,842 INFO L226 Difference]: Without dead ends: 93 [2023-02-15 10:18:03,844 INFO L412 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 [2023-02-15 10:18:03,846 INFO L413 NwaCegarLoop]: 66 mSDtfsCounter, 64 mSDsluCounter, 1 mSDsCounter, 0 mSdLazyCounter, 2 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 64 SdHoareTripleChecker+Valid, 67 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 [2023-02-15 10:18:03,847 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [64 Valid, 67 Invalid, 2 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 2 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2023-02-15 10:18:03,848 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 93 states. [2023-02-15 10:18:03,866 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 93 to 93. [2023-02-15 10:18:03,868 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 93 states, 92 states have (on average 1.5108695652173914) internal successors, (139), 92 states have internal predecessors, (139), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-02-15 10:18:03,869 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 93 states to 93 states and 139 transitions. [2023-02-15 10:18:03,871 INFO L78 Accepts]: Start accepts. Automaton has 93 states and 139 transitions. Word has length 26 [2023-02-15 10:18:03,871 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-02-15 10:18:03,873 INFO L495 AbstractCegarLoop]: Abstraction has 93 states and 139 transitions. [2023-02-15 10:18:03,874 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 7.333333333333333) internal successors, (22), 3 states have internal predecessors, (22), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-02-15 10:18:03,874 INFO L276 IsEmpty]: Start isEmpty. Operand 93 states and 139 transitions. [2023-02-15 10:18:03,875 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 33 [2023-02-15 10:18:03,876 INFO L187 NwaCegarLoop]: Found error trace [2023-02-15 10:18:03,876 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-02-15 10:18:03,877 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2023-02-15 10:18:03,877 INFO L420 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-02-15 10:18:03,877 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2023-02-15 10:18:03,880 INFO L85 PathProgramCache]: Analyzing trace with hash -350554629, now seen corresponding path program 1 times [2023-02-15 10:18:03,881 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-02-15 10:18:03,881 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [59927962] [2023-02-15 10:18:03,881 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-02-15 10:18:03,881 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-02-15 10:18:03,917 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-15 10:18:04,079 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 1 proven. 0 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2023-02-15 10:18:04,079 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-02-15 10:18:04,079 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [59927962] [2023-02-15 10:18:04,080 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [59927962] provided 1 perfect and 0 imperfect interpolant sequences [2023-02-15 10:18:04,080 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-02-15 10:18:04,080 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2023-02-15 10:18:04,081 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [879614078] [2023-02-15 10:18:04,081 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-02-15 10:18:04,081 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2023-02-15 10:18:04,081 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-02-15 10:18:04,082 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2023-02-15 10:18:04,082 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2023-02-15 10:18:04,083 INFO L87 Difference]: Start difference. First operand 93 states and 139 transitions. Second operand has 4 states, 4 states have (on average 8.0) internal successors, (32), 4 states have internal predecessors, (32), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-02-15 10:18:04,233 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-02-15 10:18:04,234 INFO L93 Difference]: Finished difference Result 273 states and 407 transitions. [2023-02-15 10:18:04,234 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2023-02-15 10:18:04,234 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 8.0) internal successors, (32), 4 states have internal predecessors, (32), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 32 [2023-02-15 10:18:04,235 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-02-15 10:18:04,235 INFO L225 Difference]: With dead ends: 273 [2023-02-15 10:18:04,236 INFO L226 Difference]: Without dead ends: 194 [2023-02-15 10:18:04,238 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 4 SyntacticMatches, 1 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2023-02-15 10:18:04,239 INFO L413 NwaCegarLoop]: 100 mSDtfsCounter, 102 mSDsluCounter, 95 mSDsCounter, 0 mSdLazyCounter, 115 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 102 SdHoareTripleChecker+Valid, 195 SdHoareTripleChecker+Invalid, 115 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 115 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2023-02-15 10:18:04,240 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [102 Valid, 195 Invalid, 115 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 115 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2023-02-15 10:18:04,242 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 194 states. [2023-02-15 10:18:04,250 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 194 to 98. [2023-02-15 10:18:04,250 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 98 states, 97 states have (on average 1.4845360824742269) internal successors, (144), 97 states have internal predecessors, (144), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-02-15 10:18:04,251 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 98 states to 98 states and 144 transitions. [2023-02-15 10:18:04,251 INFO L78 Accepts]: Start accepts. Automaton has 98 states and 144 transitions. Word has length 32 [2023-02-15 10:18:04,251 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-02-15 10:18:04,251 INFO L495 AbstractCegarLoop]: Abstraction has 98 states and 144 transitions. [2023-02-15 10:18:04,251 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 8.0) internal successors, (32), 4 states have internal predecessors, (32), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-02-15 10:18:04,252 INFO L276 IsEmpty]: Start isEmpty. Operand 98 states and 144 transitions. [2023-02-15 10:18:04,255 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 34 [2023-02-15 10:18:04,255 INFO L187 NwaCegarLoop]: Found error trace [2023-02-15 10:18:04,256 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-02-15 10:18:04,256 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2023-02-15 10:18:04,256 INFO L420 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-02-15 10:18:04,257 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2023-02-15 10:18:04,257 INFO L85 PathProgramCache]: Analyzing trace with hash -143141955, now seen corresponding path program 1 times [2023-02-15 10:18:04,257 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-02-15 10:18:04,257 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [446551931] [2023-02-15 10:18:04,257 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-02-15 10:18:04,257 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-02-15 10:18:04,293 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-15 10:18:04,387 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 1 proven. 0 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2023-02-15 10:18:04,387 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-02-15 10:18:04,387 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [446551931] [2023-02-15 10:18:04,388 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [446551931] provided 1 perfect and 0 imperfect interpolant sequences [2023-02-15 10:18:04,388 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-02-15 10:18:04,388 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2023-02-15 10:18:04,388 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2073207960] [2023-02-15 10:18:04,388 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-02-15 10:18:04,389 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2023-02-15 10:18:04,389 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-02-15 10:18:04,390 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2023-02-15 10:18:04,390 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2023-02-15 10:18:04,390 INFO L87 Difference]: Start difference. First operand 98 states and 144 transitions. Second operand has 4 states, 4 states have (on average 8.25) internal successors, (33), 4 states have internal predecessors, (33), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-02-15 10:18:04,571 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-02-15 10:18:04,572 INFO L93 Difference]: Finished difference Result 274 states and 429 transitions. [2023-02-15 10:18:04,572 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2023-02-15 10:18:04,572 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 8.25) internal successors, (33), 4 states have internal predecessors, (33), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 33 [2023-02-15 10:18:04,573 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-02-15 10:18:04,573 INFO L225 Difference]: With dead ends: 274 [2023-02-15 10:18:04,574 INFO L226 Difference]: Without dead ends: 196 [2023-02-15 10:18:04,575 INFO L412 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 [2023-02-15 10:18:04,576 INFO L413 NwaCegarLoop]: 31 mSDtfsCounter, 116 mSDsluCounter, 55 mSDsCounter, 0 mSdLazyCounter, 128 mSolverCounterSat, 42 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 116 SdHoareTripleChecker+Valid, 86 SdHoareTripleChecker+Invalid, 170 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 42 IncrementalHoareTripleChecker+Valid, 128 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2023-02-15 10:18:04,576 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [116 Valid, 86 Invalid, 170 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [42 Valid, 128 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2023-02-15 10:18:04,578 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 196 states. [2023-02-15 10:18:04,590 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 196 to 137. [2023-02-15 10:18:04,590 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 137 states, 136 states have (on average 1.536764705882353) internal successors, (209), 136 states have internal predecessors, (209), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-02-15 10:18:04,592 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 137 states to 137 states and 209 transitions. [2023-02-15 10:18:04,592 INFO L78 Accepts]: Start accepts. Automaton has 137 states and 209 transitions. Word has length 33 [2023-02-15 10:18:04,593 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-02-15 10:18:04,593 INFO L495 AbstractCegarLoop]: Abstraction has 137 states and 209 transitions. [2023-02-15 10:18:04,593 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 8.25) internal successors, (33), 4 states have internal predecessors, (33), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-02-15 10:18:04,593 INFO L276 IsEmpty]: Start isEmpty. Operand 137 states and 209 transitions. [2023-02-15 10:18:04,595 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 40 [2023-02-15 10:18:04,596 INFO L187 NwaCegarLoop]: Found error trace [2023-02-15 10:18:04,596 INFO L195 NwaCegarLoop]: trace histogram [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] [2023-02-15 10:18:04,596 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2023-02-15 10:18:04,597 INFO L420 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-02-15 10:18:04,597 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2023-02-15 10:18:04,597 INFO L85 PathProgramCache]: Analyzing trace with hash 1481468776, now seen corresponding path program 1 times [2023-02-15 10:18:04,598 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-02-15 10:18:04,598 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [972893073] [2023-02-15 10:18:04,598 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-02-15 10:18:04,598 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-02-15 10:18:04,646 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-15 10:18:04,832 INFO L134 CoverageAnalysis]: Checked inductivity of 9 backedges. 4 proven. 1 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2023-02-15 10:18:04,832 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-02-15 10:18:04,833 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [972893073] [2023-02-15 10:18:04,833 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [972893073] provided 0 perfect and 1 imperfect interpolant sequences [2023-02-15 10:18:04,833 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [221859666] [2023-02-15 10:18:04,833 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-02-15 10:18:04,833 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-02-15 10:18:04,834 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-02-15 10:18:04,837 INFO L229 MonitoredProcess]: Starting monitored process 2 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2023-02-15 10:18:04,851 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Waiting until timeout for monitored process [2023-02-15 10:18:04,910 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-15 10:18:04,912 INFO L263 TraceCheckSpWp]: Trace formula consists of 126 conjuncts, 6 conjunts are in the unsatisfiable core [2023-02-15 10:18:04,916 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2023-02-15 10:18:05,090 INFO L134 CoverageAnalysis]: Checked inductivity of 9 backedges. 4 proven. 0 refuted. 0 times theorem prover too weak. 5 trivial. 0 not checked. [2023-02-15 10:18:05,091 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2023-02-15 10:18:05,091 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [221859666] provided 1 perfect and 0 imperfect interpolant sequences [2023-02-15 10:18:05,091 INFO L184 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2023-02-15 10:18:05,092 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [6] total 7 [2023-02-15 10:18:05,092 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [3168234] [2023-02-15 10:18:05,092 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-02-15 10:18:05,092 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2023-02-15 10:18:05,093 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-02-15 10:18:05,093 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2023-02-15 10:18:05,094 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=27, Unknown=0, NotChecked=0, Total=42 [2023-02-15 10:18:05,094 INFO L87 Difference]: Start difference. First operand 137 states and 209 transitions. Second operand has 5 states, 5 states have (on average 7.4) internal successors, (37), 5 states have internal predecessors, (37), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-02-15 10:18:05,175 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-02-15 10:18:05,176 INFO L93 Difference]: Finished difference Result 284 states and 447 transitions. [2023-02-15 10:18:05,176 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2023-02-15 10:18:05,176 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 7.4) internal successors, (37), 5 states have internal predecessors, (37), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 39 [2023-02-15 10:18:05,178 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-02-15 10:18:05,179 INFO L225 Difference]: With dead ends: 284 [2023-02-15 10:18:05,179 INFO L226 Difference]: Without dead ends: 160 [2023-02-15 10:18:05,179 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 47 GetRequests, 37 SyntacticMatches, 4 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=20, Invalid=36, Unknown=0, NotChecked=0, Total=56 [2023-02-15 10:18:05,180 INFO L413 NwaCegarLoop]: 36 mSDtfsCounter, 74 mSDsluCounter, 46 mSDsCounter, 0 mSdLazyCounter, 85 mSolverCounterSat, 12 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 74 SdHoareTripleChecker+Valid, 82 SdHoareTripleChecker+Invalid, 97 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 12 IncrementalHoareTripleChecker+Valid, 85 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2023-02-15 10:18:05,183 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [74 Valid, 82 Invalid, 97 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [12 Valid, 85 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2023-02-15 10:18:05,184 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 160 states. [2023-02-15 10:18:05,187 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 160 to 137. [2023-02-15 10:18:05,188 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 137 states, 136 states have (on average 1.5147058823529411) internal successors, (206), 136 states have internal predecessors, (206), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-02-15 10:18:05,188 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 137 states to 137 states and 206 transitions. [2023-02-15 10:18:05,189 INFO L78 Accepts]: Start accepts. Automaton has 137 states and 206 transitions. Word has length 39 [2023-02-15 10:18:05,189 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-02-15 10:18:05,189 INFO L495 AbstractCegarLoop]: Abstraction has 137 states and 206 transitions. [2023-02-15 10:18:05,189 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 7.4) internal successors, (37), 5 states have internal predecessors, (37), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-02-15 10:18:05,189 INFO L276 IsEmpty]: Start isEmpty. Operand 137 states and 206 transitions. [2023-02-15 10:18:05,190 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 54 [2023-02-15 10:18:05,190 INFO L187 NwaCegarLoop]: Found error trace [2023-02-15 10:18:05,190 INFO L195 NwaCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 3, 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] [2023-02-15 10:18:05,199 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Forceful destruction successful, exit code 0 [2023-02-15 10:18:05,396 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7,2 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-02-15 10:18:05,397 INFO L420 AbstractCegarLoop]: === Iteration 9 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-02-15 10:18:05,397 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2023-02-15 10:18:05,397 INFO L85 PathProgramCache]: Analyzing trace with hash -115920210, now seen corresponding path program 1 times [2023-02-15 10:18:05,398 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-02-15 10:18:05,398 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1823026851] [2023-02-15 10:18:05,398 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-02-15 10:18:05,398 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-02-15 10:18:05,446 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-15 10:18:05,575 INFO L134 CoverageAnalysis]: Checked inductivity of 42 backedges. 17 proven. 0 refuted. 0 times theorem prover too weak. 25 trivial. 0 not checked. [2023-02-15 10:18:05,575 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-02-15 10:18:05,575 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1823026851] [2023-02-15 10:18:05,575 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1823026851] provided 1 perfect and 0 imperfect interpolant sequences [2023-02-15 10:18:05,576 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-02-15 10:18:05,576 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2023-02-15 10:18:05,576 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [280611967] [2023-02-15 10:18:05,576 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-02-15 10:18:05,576 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2023-02-15 10:18:05,577 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-02-15 10:18:05,577 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2023-02-15 10:18:05,578 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2023-02-15 10:18:05,578 INFO L87 Difference]: Start difference. First operand 137 states and 206 transitions. Second operand has 4 states, 4 states have (on average 9.75) internal successors, (39), 4 states have internal predecessors, (39), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-02-15 10:18:05,695 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-02-15 10:18:05,695 INFO L93 Difference]: Finished difference Result 380 states and 580 transitions. [2023-02-15 10:18:05,695 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2023-02-15 10:18:05,696 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 9.75) internal successors, (39), 4 states have internal predecessors, (39), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 53 [2023-02-15 10:18:05,696 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-02-15 10:18:05,697 INFO L225 Difference]: With dead ends: 380 [2023-02-15 10:18:05,697 INFO L226 Difference]: Without dead ends: 258 [2023-02-15 10:18:05,706 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 4 SyntacticMatches, 1 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2023-02-15 10:18:05,708 INFO L413 NwaCegarLoop]: 27 mSDtfsCounter, 99 mSDsluCounter, 55 mSDsCounter, 0 mSdLazyCounter, 102 mSolverCounterSat, 27 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 99 SdHoareTripleChecker+Valid, 82 SdHoareTripleChecker+Invalid, 129 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 27 IncrementalHoareTripleChecker+Valid, 102 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2023-02-15 10:18:05,709 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [99 Valid, 82 Invalid, 129 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [27 Valid, 102 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2023-02-15 10:18:05,709 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 258 states. [2023-02-15 10:18:05,715 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 258 to 179. [2023-02-15 10:18:05,715 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 179 states, 178 states have (on average 1.5561797752808988) internal successors, (277), 178 states have internal predecessors, (277), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-02-15 10:18:05,716 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 179 states to 179 states and 277 transitions. [2023-02-15 10:18:05,716 INFO L78 Accepts]: Start accepts. Automaton has 179 states and 277 transitions. Word has length 53 [2023-02-15 10:18:05,717 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-02-15 10:18:05,717 INFO L495 AbstractCegarLoop]: Abstraction has 179 states and 277 transitions. [2023-02-15 10:18:05,717 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 9.75) internal successors, (39), 4 states have internal predecessors, (39), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-02-15 10:18:05,718 INFO L276 IsEmpty]: Start isEmpty. Operand 179 states and 277 transitions. [2023-02-15 10:18:05,719 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 67 [2023-02-15 10:18:05,719 INFO L187 NwaCegarLoop]: Found error trace [2023-02-15 10:18:05,719 INFO L195 NwaCegarLoop]: trace histogram [4, 4, 4, 4, 4, 3, 3, 3, 3, 3, 3, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-02-15 10:18:05,720 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2023-02-15 10:18:05,720 INFO L420 AbstractCegarLoop]: === Iteration 10 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-02-15 10:18:05,720 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2023-02-15 10:18:05,720 INFO L85 PathProgramCache]: Analyzing trace with hash 380800779, now seen corresponding path program 1 times [2023-02-15 10:18:05,721 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-02-15 10:18:05,721 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [959799807] [2023-02-15 10:18:05,721 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-02-15 10:18:05,721 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-02-15 10:18:05,760 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-15 10:18:05,904 INFO L134 CoverageAnalysis]: Checked inductivity of 82 backedges. 7 proven. 0 refuted. 0 times theorem prover too weak. 75 trivial. 0 not checked. [2023-02-15 10:18:05,904 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-02-15 10:18:05,904 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [959799807] [2023-02-15 10:18:05,904 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [959799807] provided 1 perfect and 0 imperfect interpolant sequences [2023-02-15 10:18:05,905 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-02-15 10:18:05,905 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2023-02-15 10:18:05,905 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1010569120] [2023-02-15 10:18:05,905 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-02-15 10:18:05,906 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2023-02-15 10:18:05,907 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-02-15 10:18:05,907 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2023-02-15 10:18:05,907 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2023-02-15 10:18:05,907 INFO L87 Difference]: Start difference. First operand 179 states and 277 transitions. Second operand has 5 states, 5 states have (on average 7.4) internal successors, (37), 5 states have internal predecessors, (37), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-02-15 10:18:06,127 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-02-15 10:18:06,128 INFO L93 Difference]: Finished difference Result 709 states and 1096 transitions. [2023-02-15 10:18:06,128 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2023-02-15 10:18:06,128 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 7.4) internal successors, (37), 5 states have internal predecessors, (37), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 66 [2023-02-15 10:18:06,128 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-02-15 10:18:06,130 INFO L225 Difference]: With dead ends: 709 [2023-02-15 10:18:06,131 INFO L226 Difference]: Without dead ends: 546 [2023-02-15 10:18:06,131 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 5 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=15, Invalid=27, Unknown=0, NotChecked=0, Total=42 [2023-02-15 10:18:06,131 INFO L413 NwaCegarLoop]: 111 mSDtfsCounter, 187 mSDsluCounter, 201 mSDsCounter, 0 mSdLazyCounter, 185 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 187 SdHoareTripleChecker+Valid, 312 SdHoareTripleChecker+Invalid, 186 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 185 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2023-02-15 10:18:06,132 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [187 Valid, 312 Invalid, 186 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 185 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2023-02-15 10:18:06,133 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 546 states. [2023-02-15 10:18:06,140 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 546 to 179. [2023-02-15 10:18:06,140 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 179 states, 178 states have (on average 1.5561797752808988) internal successors, (277), 178 states have internal predecessors, (277), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-02-15 10:18:06,141 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 179 states to 179 states and 277 transitions. [2023-02-15 10:18:06,141 INFO L78 Accepts]: Start accepts. Automaton has 179 states and 277 transitions. Word has length 66 [2023-02-15 10:18:06,142 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-02-15 10:18:06,142 INFO L495 AbstractCegarLoop]: Abstraction has 179 states and 277 transitions. [2023-02-15 10:18:06,142 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 7.4) internal successors, (37), 5 states have internal predecessors, (37), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-02-15 10:18:06,142 INFO L276 IsEmpty]: Start isEmpty. Operand 179 states and 277 transitions. [2023-02-15 10:18:06,143 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 68 [2023-02-15 10:18:06,143 INFO L187 NwaCegarLoop]: Found error trace [2023-02-15 10:18:06,143 INFO L195 NwaCegarLoop]: trace histogram [4, 4, 4, 4, 4, 3, 3, 3, 3, 3, 3, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-02-15 10:18:06,143 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9 [2023-02-15 10:18:06,143 INFO L420 AbstractCegarLoop]: === Iteration 11 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-02-15 10:18:06,144 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2023-02-15 10:18:06,144 INFO L85 PathProgramCache]: Analyzing trace with hash 1313996354, now seen corresponding path program 1 times [2023-02-15 10:18:06,144 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-02-15 10:18:06,144 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1601042435] [2023-02-15 10:18:06,144 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-02-15 10:18:06,145 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-02-15 10:18:06,182 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-15 10:18:06,358 INFO L134 CoverageAnalysis]: Checked inductivity of 82 backedges. 7 proven. 0 refuted. 0 times theorem prover too weak. 75 trivial. 0 not checked. [2023-02-15 10:18:06,358 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-02-15 10:18:06,358 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1601042435] [2023-02-15 10:18:06,358 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1601042435] provided 1 perfect and 0 imperfect interpolant sequences [2023-02-15 10:18:06,359 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-02-15 10:18:06,359 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2023-02-15 10:18:06,359 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1480813141] [2023-02-15 10:18:06,359 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-02-15 10:18:06,359 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2023-02-15 10:18:06,360 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-02-15 10:18:06,360 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2023-02-15 10:18:06,360 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2023-02-15 10:18:06,360 INFO L87 Difference]: Start difference. First operand 179 states and 277 transitions. Second operand has 7 states, 7 states have (on average 5.428571428571429) internal successors, (38), 7 states have internal predecessors, (38), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-02-15 10:18:06,797 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-02-15 10:18:06,797 INFO L93 Difference]: Finished difference Result 912 states and 1399 transitions. [2023-02-15 10:18:06,798 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2023-02-15 10:18:06,798 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 5.428571428571429) internal successors, (38), 7 states have internal predecessors, (38), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 67 [2023-02-15 10:18:06,798 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-02-15 10:18:06,801 INFO L225 Difference]: With dead ends: 912 [2023-02-15 10:18:06,801 INFO L226 Difference]: Without dead ends: 749 [2023-02-15 10:18:06,802 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 14 GetRequests, 5 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=27, Invalid=83, Unknown=0, NotChecked=0, Total=110 [2023-02-15 10:18:06,802 INFO L413 NwaCegarLoop]: 133 mSDtfsCounter, 377 mSDsluCounter, 469 mSDsCounter, 0 mSdLazyCounter, 435 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 377 SdHoareTripleChecker+Valid, 602 SdHoareTripleChecker+Invalid, 438 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 435 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2023-02-15 10:18:06,803 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [377 Valid, 602 Invalid, 438 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 435 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2023-02-15 10:18:06,803 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 749 states. [2023-02-15 10:18:06,812 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 749 to 174. [2023-02-15 10:18:06,813 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 174 states, 173 states have (on average 1.5664739884393064) internal successors, (271), 173 states have internal predecessors, (271), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-02-15 10:18:06,814 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 174 states to 174 states and 271 transitions. [2023-02-15 10:18:06,814 INFO L78 Accepts]: Start accepts. Automaton has 174 states and 271 transitions. Word has length 67 [2023-02-15 10:18:06,814 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-02-15 10:18:06,814 INFO L495 AbstractCegarLoop]: Abstraction has 174 states and 271 transitions. [2023-02-15 10:18:06,814 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 5.428571428571429) internal successors, (38), 7 states have internal predecessors, (38), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-02-15 10:18:06,814 INFO L276 IsEmpty]: Start isEmpty. Operand 174 states and 271 transitions. [2023-02-15 10:18:06,815 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 70 [2023-02-15 10:18:06,815 INFO L187 NwaCegarLoop]: Found error trace [2023-02-15 10:18:06,815 INFO L195 NwaCegarLoop]: trace histogram [4, 4, 4, 4, 3, 3, 3, 3, 3, 3, 3, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-02-15 10:18:06,815 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10 [2023-02-15 10:18:06,816 INFO L420 AbstractCegarLoop]: === Iteration 12 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-02-15 10:18:06,816 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2023-02-15 10:18:06,816 INFO L85 PathProgramCache]: Analyzing trace with hash -725391719, now seen corresponding path program 1 times [2023-02-15 10:18:06,816 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-02-15 10:18:06,816 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [972908333] [2023-02-15 10:18:06,817 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-02-15 10:18:06,817 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-02-15 10:18:06,837 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-15 10:18:06,974 INFO L134 CoverageAnalysis]: Checked inductivity of 82 backedges. 47 proven. 3 refuted. 0 times theorem prover too weak. 32 trivial. 0 not checked. [2023-02-15 10:18:06,974 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-02-15 10:18:06,974 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [972908333] [2023-02-15 10:18:06,974 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [972908333] provided 0 perfect and 1 imperfect interpolant sequences [2023-02-15 10:18:06,974 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1260514025] [2023-02-15 10:18:06,975 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-02-15 10:18:06,975 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-02-15 10:18:06,975 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-02-15 10:18:06,976 INFO L229 MonitoredProcess]: Starting monitored process 3 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2023-02-15 10:18:06,993 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Waiting until timeout for monitored process [2023-02-15 10:18:07,057 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-15 10:18:07,059 INFO L263 TraceCheckSpWp]: Trace formula consists of 181 conjuncts, 9 conjunts are in the unsatisfiable core [2023-02-15 10:18:07,063 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2023-02-15 10:18:07,139 INFO L134 CoverageAnalysis]: Checked inductivity of 82 backedges. 46 proven. 3 refuted. 0 times theorem prover too weak. 33 trivial. 0 not checked. [2023-02-15 10:18:07,139 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2023-02-15 10:18:07,241 INFO L134 CoverageAnalysis]: Checked inductivity of 82 backedges. 38 proven. 25 refuted. 0 times theorem prover too weak. 19 trivial. 0 not checked. [2023-02-15 10:18:07,242 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1260514025] provided 0 perfect and 2 imperfect interpolant sequences [2023-02-15 10:18:07,242 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2023-02-15 10:18:07,242 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [5, 4, 6] total 11 [2023-02-15 10:18:07,242 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [120808807] [2023-02-15 10:18:07,242 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2023-02-15 10:18:07,243 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 11 states [2023-02-15 10:18:07,243 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-02-15 10:18:07,243 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2023-02-15 10:18:07,244 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=27, Invalid=83, Unknown=0, NotChecked=0, Total=110 [2023-02-15 10:18:07,244 INFO L87 Difference]: Start difference. First operand 174 states and 271 transitions. Second operand has 11 states, 11 states have (on average 10.363636363636363) internal successors, (114), 11 states have internal predecessors, (114), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-02-15 10:18:07,910 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-02-15 10:18:07,911 INFO L93 Difference]: Finished difference Result 950 states and 1502 transitions. [2023-02-15 10:18:07,911 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 22 states. [2023-02-15 10:18:07,911 INFO L78 Accepts]: Start accepts. Automaton has has 11 states, 11 states have (on average 10.363636363636363) internal successors, (114), 11 states have internal predecessors, (114), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 69 [2023-02-15 10:18:07,911 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-02-15 10:18:07,914 INFO L225 Difference]: With dead ends: 950 [2023-02-15 10:18:07,914 INFO L226 Difference]: Without dead ends: 711 [2023-02-15 10:18:07,915 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 158 GetRequests, 134 SyntacticMatches, 0 SemanticMatches, 24 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 122 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=159, Invalid=491, Unknown=0, NotChecked=0, Total=650 [2023-02-15 10:18:07,915 INFO L413 NwaCegarLoop]: 68 mSDtfsCounter, 504 mSDsluCounter, 273 mSDsCounter, 0 mSdLazyCounter, 632 mSolverCounterSat, 101 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 504 SdHoareTripleChecker+Valid, 341 SdHoareTripleChecker+Invalid, 733 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 101 IncrementalHoareTripleChecker+Valid, 632 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.5s IncrementalHoareTripleChecker+Time [2023-02-15 10:18:07,916 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [504 Valid, 341 Invalid, 733 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [101 Valid, 632 Invalid, 0 Unknown, 0 Unchecked, 0.5s Time] [2023-02-15 10:18:07,916 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 711 states. [2023-02-15 10:18:07,939 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 711 to 493. [2023-02-15 10:18:07,941 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 493 states, 492 states have (on average 1.4634146341463414) internal successors, (720), 492 states have internal predecessors, (720), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-02-15 10:18:07,942 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 493 states to 493 states and 720 transitions. [2023-02-15 10:18:07,942 INFO L78 Accepts]: Start accepts. Automaton has 493 states and 720 transitions. Word has length 69 [2023-02-15 10:18:07,942 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-02-15 10:18:07,943 INFO L495 AbstractCegarLoop]: Abstraction has 493 states and 720 transitions. [2023-02-15 10:18:07,943 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 11 states, 11 states have (on average 10.363636363636363) internal successors, (114), 11 states have internal predecessors, (114), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-02-15 10:18:07,943 INFO L276 IsEmpty]: Start isEmpty. Operand 493 states and 720 transitions. [2023-02-15 10:18:07,944 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 72 [2023-02-15 10:18:07,944 INFO L187 NwaCegarLoop]: Found error trace [2023-02-15 10:18:07,944 INFO L195 NwaCegarLoop]: trace histogram [4, 4, 4, 4, 3, 3, 3, 3, 3, 3, 3, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-02-15 10:18:07,953 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Forceful destruction successful, exit code 0 [2023-02-15 10:18:08,153 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 3 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable11 [2023-02-15 10:18:08,153 INFO L420 AbstractCegarLoop]: === Iteration 13 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-02-15 10:18:08,154 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2023-02-15 10:18:08,154 INFO L85 PathProgramCache]: Analyzing trace with hash 319706574, now seen corresponding path program 1 times [2023-02-15 10:18:08,154 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-02-15 10:18:08,154 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1637199610] [2023-02-15 10:18:08,154 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-02-15 10:18:08,154 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-02-15 10:18:08,227 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2023-02-15 10:18:08,228 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2023-02-15 10:18:08,278 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2023-02-15 10:18:08,300 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2023-02-15 10:18:08,300 INFO L360 BasicCegarLoop]: Counterexample is feasible [2023-02-15 10:18:08,301 INFO L805 garLoopResultBuilder]: Registering result UNSAFE for location ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION (0 of 1 remaining) [2023-02-15 10:18:08,302 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable12 [2023-02-15 10:18:08,305 INFO L445 BasicCegarLoop]: Path program histogram: [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-02-15 10:18:08,308 INFO L178 ceAbstractionStarter]: Computing trace abstraction results [2023-02-15 10:18:08,376 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 15.02 10:18:08 BoogieIcfgContainer [2023-02-15 10:18:08,378 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2023-02-15 10:18:08,378 INFO L113 PluginConnector]: ------------------------Witness Printer---------------------------- [2023-02-15 10:18:08,378 INFO L271 PluginConnector]: Initializing Witness Printer... [2023-02-15 10:18:08,379 INFO L275 PluginConnector]: Witness Printer initialized [2023-02-15 10:18:08,379 INFO L185 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 15.02 10:18:01" (3/4) ... [2023-02-15 10:18:08,382 INFO L140 WitnessPrinter]: No result that supports witness generation found [2023-02-15 10:18:08,382 INFO L132 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2023-02-15 10:18:08,382 INFO L158 Benchmark]: Toolchain (without parser) took 7613.41ms. Allocated memory was 169.9MB in the beginning and 205.5MB in the end (delta: 35.7MB). Free memory was 103.6MB in the beginning and 154.6MB in the end (delta: -51.0MB). There was no memory consumed. Max. memory is 16.1GB. [2023-02-15 10:18:08,382 INFO L158 Benchmark]: CDTParser took 0.18ms. Allocated memory is still 169.9MB. Free memory is still 144.7MB. There was no memory consumed. Max. memory is 16.1GB. [2023-02-15 10:18:08,383 INFO L158 Benchmark]: CACSL2BoogieTranslator took 275.19ms. Allocated memory is still 169.9MB. Free memory was 103.4MB in the beginning and 141.6MB in the end (delta: -38.2MB). Peak memory consumption was 16.8MB. Max. memory is 16.1GB. [2023-02-15 10:18:08,383 INFO L158 Benchmark]: Boogie Procedure Inliner took 48.18ms. Allocated memory is still 169.9MB. Free memory was 141.2MB in the beginning and 138.2MB in the end (delta: 3.0MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. [2023-02-15 10:18:08,383 INFO L158 Benchmark]: Boogie Preprocessor took 34.14ms. Allocated memory is still 169.9MB. Free memory was 138.2MB in the beginning and 136.5MB in the end (delta: 1.6MB). There was no memory consumed. Max. memory is 16.1GB. [2023-02-15 10:18:08,384 INFO L158 Benchmark]: RCFGBuilder took 604.96ms. Allocated memory is still 169.9MB. Free memory was 136.5MB in the beginning and 116.3MB in the end (delta: 20.3MB). Peak memory consumption was 21.0MB. Max. memory is 16.1GB. [2023-02-15 10:18:08,384 INFO L158 Benchmark]: TraceAbstraction took 6640.94ms. Allocated memory was 169.9MB in the beginning and 205.5MB in the end (delta: 35.7MB). Free memory was 115.8MB in the beginning and 154.6MB in the end (delta: -38.8MB). Peak memory consumption was 97.3MB. Max. memory is 16.1GB. [2023-02-15 10:18:08,385 INFO L158 Benchmark]: Witness Printer took 3.53ms. Allocated memory is still 205.5MB. Free memory is still 154.6MB. There was no memory consumed. Max. memory is 16.1GB. [2023-02-15 10:18:08,387 INFO L339 ainManager$Toolchain]: ####################### End [Toolchain 1] ####################### --- Results --- * Results from de.uni_freiburg.informatik.ultimate.core: - StatisticsResult: Toolchain Benchmarks Benchmark results are: * CDTParser took 0.18ms. Allocated memory is still 169.9MB. Free memory is still 144.7MB. There was no memory consumed. Max. memory is 16.1GB. * CACSL2BoogieTranslator took 275.19ms. Allocated memory is still 169.9MB. Free memory was 103.4MB in the beginning and 141.6MB in the end (delta: -38.2MB). Peak memory consumption was 16.8MB. Max. memory is 16.1GB. * Boogie Procedure Inliner took 48.18ms. Allocated memory is still 169.9MB. Free memory was 141.2MB in the beginning and 138.2MB in the end (delta: 3.0MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. * Boogie Preprocessor took 34.14ms. Allocated memory is still 169.9MB. Free memory was 138.2MB in the beginning and 136.5MB in the end (delta: 1.6MB). There was no memory consumed. Max. memory is 16.1GB. * RCFGBuilder took 604.96ms. Allocated memory is still 169.9MB. Free memory was 136.5MB in the beginning and 116.3MB in the end (delta: 20.3MB). Peak memory consumption was 21.0MB. Max. memory is 16.1GB. * TraceAbstraction took 6640.94ms. Allocated memory was 169.9MB in the beginning and 205.5MB in the end (delta: 35.7MB). Free memory was 115.8MB in the beginning and 154.6MB in the end (delta: -38.8MB). Peak memory consumption was 97.3MB. Max. memory is 16.1GB. * Witness Printer took 3.53ms. Allocated memory is still 205.5MB. Free memory is still 154.6MB. There was no memory consumed. 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 - UnprovableResult [Line: 25]: Unable to prove that call to reach_error is unreachable Unable to prove that call to reach_error is unreachable Reason: overapproximation of bitwiseOr at line 116. Possible FailurePath: [L124] unsigned int a, b, r; [L125] a = __VERIFIER_nondet_uint() [L127] b = 234770789 [L129] CALL, EXPR mp_add(a, b) [L42] unsigned char a0, a1, a2, a3; [L43] unsigned char b0, b1, b2, b3; [L44] unsigned char r0, r1, r2, r3; [L45] unsigned short carry; [L46] unsigned short partial_sum; [L47] unsigned int r; [L48] unsigned char i; [L49] unsigned char na, nb; [L50] a0 = a [L51] a1 = a >> 8 [L52] a2 = a >> 16U [L53] a3 = a >> 24U [L54] b0 = b [L55] b1 = b >> 8U [L56] b2 = b >> 16U [L57] b3 = b >> 24U [L58] na = (unsigned char)4 VAL [\old(a)=154, \old(b)=234770789, a=154, a0=-4294967142, a1=-16777216, a2=-65536, a3=-256, b=234770789, b0=234770789, b1=917073, b2=3582, b3=13, na=4] [L59] COND TRUE a3 == (unsigned char)0 [L60] na = na - 1 VAL [\old(a)=154, \old(b)=234770789, a=154, a0=-4294967142, a1=-16777216, a2=-65536, a3=-256, b=234770789, b0=234770789, b1=917073, b2=3582, b3=13, na=3] [L61] COND TRUE a2 == (unsigned char)0 [L62] na = na - 1 VAL [\old(a)=154, \old(b)=234770789, a=154, a0=-4294967142, a1=-16777216, a2=-65536, a3=-256, b=234770789, b0=234770789, b1=917073, b2=3582, b3=13, na=2] [L63] COND TRUE a1 == (unsigned char)0 [L64] na = na - 1 VAL [\old(a)=154, \old(b)=234770789, a=154, a0=-4294967142, a1=-16777216, a2=-65536, a3=-256, b=234770789, b0=234770789, b1=917073, b2=3582, b3=13, na=1] [L68] nb = (unsigned char)4 VAL [\old(a)=154, \old(b)=234770789, a=154, a0=-4294967142, a1=-16777216, a2=-65536, a3=-256, b=234770789, b0=234770789, b1=917073, b2=3582, b3=13, na=1, nb=4] [L69] COND FALSE !(b3 == (unsigned char)0) VAL [\old(a)=154, \old(b)=234770789, a=154, a0=-4294967142, a1=-16777216, a2=-65536, a3=-256, b=234770789, b0=234770789, b1=917073, b2=3582, b3=13, na=1, nb=4] [L78] carry = (unsigned short)0 [L79] i = (unsigned char)0 VAL [\old(a)=154, \old(b)=234770789, a=154, a0=-4294967142, a1=-16777216, a2=-65536, a3=-256, b=234770789, b0=234770789, b1=917073, b2=3582, b3=13, carry=0, i=0, na=1, nb=4] [L80] COND TRUE (i < na) || (i < nb) || (carry != (unsigned short)0) [L81] partial_sum = carry [L82] carry = (unsigned short)0 VAL [\old(a)=154, \old(b)=234770789, a=154, a0=-4294967142, a1=-16777216, a2=-65536, a3=-256, b=234770789, b0=234770789, b1=917073, b2=3582, b3=13, carry=0, i=0, na=1, nb=4, partial_sum=0] [L83] COND TRUE i < na VAL [\old(a)=154, \old(b)=234770789, a=154, a0=-4294967142, a1=-16777216, a2=-65536, a3=-256, b=234770789, b0=234770789, b1=917073, b2=3582, b3=13, carry=0, i=0, na=1, nb=4, partial_sum=0] [L84] COND TRUE i == (unsigned char)0 [L84] partial_sum = partial_sum + a0 VAL [\old(a)=154, \old(b)=234770789, a=154, a0=-4294967142, a1=-16777216, a2=-65536, a3=-256, b=234770789, b0=234770789, b1=917073, b2=3582, b3=13, carry=0, i=0, na=1, nb=4, partial_sum=154] [L85] COND FALSE !(i == (unsigned char)1) VAL [\old(a)=154, \old(b)=234770789, a=154, a0=-4294967142, a1=-16777216, a2=-65536, a3=-256, b=234770789, b0=234770789, b1=917073, b2=3582, b3=13, carry=0, i=0, na=1, nb=4, partial_sum=154] [L86] COND FALSE !(i == (unsigned char)2) VAL [\old(a)=154, \old(b)=234770789, a=154, a0=-4294967142, a1=-16777216, a2=-65536, a3=-256, b=234770789, b0=234770789, b1=917073, b2=3582, b3=13, carry=0, i=0, na=1, nb=4, partial_sum=154] [L87] COND FALSE !(i == (unsigned char)3) VAL [\old(a)=154, \old(b)=234770789, a=154, a0=-4294967142, a1=-16777216, a2=-65536, a3=-256, b=234770789, b0=234770789, b1=917073, b2=3582, b3=13, carry=0, i=0, na=1, nb=4, partial_sum=154] [L89] COND TRUE i < nb VAL [\old(a)=154, \old(b)=234770789, a=154, a0=-4294967142, a1=-16777216, a2=-65536, a3=-256, b=234770789, b0=234770789, b1=917073, b2=3582, b3=13, carry=0, i=0, na=1, nb=4, partial_sum=154] [L90] COND TRUE i == (unsigned char)0 [L90] partial_sum = partial_sum + b0 VAL [\old(a)=154, \old(b)=234770789, a=154, a0=-4294967142, a1=-16777216, a2=-65536, a3=-256, b=234770789, b0=234770789, b1=917073, b2=3582, b3=13, carry=0, i=0, na=1, nb=4, partial_sum=255] [L91] COND FALSE !(i == (unsigned char)1) VAL [\old(a)=154, \old(b)=234770789, a=154, a0=-4294967142, a1=-16777216, a2=-65536, a3=-256, b=234770789, b0=234770789, b1=917073, b2=3582, b3=13, carry=0, i=0, na=1, nb=4, partial_sum=255] [L92] COND FALSE !(i == (unsigned char)2) VAL [\old(a)=154, \old(b)=234770789, a=154, a0=-4294967142, a1=-16777216, a2=-65536, a3=-256, b=234770789, b0=234770789, b1=917073, b2=3582, b3=13, carry=0, i=0, na=1, nb=4, partial_sum=255] [L93] COND FALSE !(i == (unsigned char)3) VAL [\old(a)=154, \old(b)=234770789, a=154, a0=-4294967142, a1=-16777216, a2=-65536, a3=-256, b=234770789, b0=234770789, b1=917073, b2=3582, b3=13, carry=0, i=0, na=1, nb=4, partial_sum=255] [L95] COND FALSE !(partial_sum > ((unsigned char)255)) VAL [\old(a)=154, \old(b)=234770789, a=154, a0=-4294967142, a1=-16777216, a2=-65536, a3=-256, b=234770789, b0=234770789, b1=917073, b2=3582, b3=13, carry=0, i=0, na=1, nb=4, partial_sum=255] [L99] COND TRUE i == (unsigned char)0 [L99] r0 = (unsigned char)partial_sum VAL [\old(a)=154, \old(b)=234770789, a=154, a0=-4294967142, a1=-16777216, a2=-65536, a3=-256, b=234770789, b0=234770789, b1=917073, b2=3582, b3=13, carry=0, i=0, na=1, nb=4, partial_sum=255, r0=255] [L100] COND FALSE !(i == (unsigned char)1) VAL [\old(a)=154, \old(b)=234770789, a=154, a0=-4294967142, a1=-16777216, a2=-65536, a3=-256, b=234770789, b0=234770789, b1=917073, b2=3582, b3=13, carry=0, i=0, na=1, nb=4, partial_sum=255, r0=255] [L101] COND FALSE !(i == (unsigned char)2) VAL [\old(a)=154, \old(b)=234770789, a=154, a0=-4294967142, a1=-16777216, a2=-65536, a3=-256, b=234770789, b0=234770789, b1=917073, b2=3582, b3=13, carry=0, i=0, na=1, nb=4, partial_sum=255, r0=255] [L102] COND FALSE !(i == (unsigned char)3) VAL [\old(a)=154, \old(b)=234770789, a=154, a0=-4294967142, a1=-16777216, a2=-65536, a3=-256, b=234770789, b0=234770789, b1=917073, b2=3582, b3=13, carry=0, i=0, na=1, nb=4, partial_sum=255, r0=255] [L104] i = i + (unsigned char)1 VAL [\old(a)=154, \old(b)=234770789, a=154, a0=-4294967142, a1=-16777216, a2=-65536, a3=-256, b=234770789, b0=234770789, b1=917073, b2=3582, b3=13, carry=0, i=1, na=1, nb=4, partial_sum=255, r0=255] [L80] COND TRUE (i < na) || (i < nb) || (carry != (unsigned short)0) [L81] partial_sum = carry [L82] carry = (unsigned short)0 VAL [\old(a)=154, \old(b)=234770789, a=154, a0=-4294967142, a1=-16777216, a2=-65536, a3=-256, b=234770789, b0=234770789, b1=917073, b2=3582, b3=13, carry=0, i=1, na=1, nb=4, partial_sum=0, r0=255] [L83] COND FALSE !(i < na) VAL [\old(a)=154, \old(b)=234770789, a=154, a0=-4294967142, a1=-16777216, a2=-65536, a3=-256, b=234770789, b0=234770789, b1=917073, b2=3582, b3=13, carry=0, i=1, na=1, nb=4, partial_sum=0, r0=255] [L89] COND TRUE i < nb VAL [\old(a)=154, \old(b)=234770789, a=154, a0=-4294967142, a1=-16777216, a2=-65536, a3=-256, b=234770789, b0=234770789, b1=917073, b2=3582, b3=13, carry=0, i=1, na=1, nb=4, partial_sum=0, r0=255] [L90] COND FALSE !(i == (unsigned char)0) VAL [\old(a)=154, \old(b)=234770789, a=154, a0=-4294967142, a1=-16777216, a2=-65536, a3=-256, b=234770789, b0=234770789, b1=917073, b2=3582, b3=13, carry=0, i=1, na=1, nb=4, partial_sum=0, r0=255] [L91] COND TRUE i == (unsigned char)1 [L91] partial_sum = partial_sum + b1 VAL [\old(a)=154, \old(b)=234770789, a=154, a0=-4294967142, a1=-16777216, a2=-65536, a3=-256, b=234770789, b0=234770789, b1=917073, b2=3582, b3=13, carry=0, i=1, na=1, nb=4, partial_sum=81, r0=255] [L92] COND FALSE !(i == (unsigned char)2) VAL [\old(a)=154, \old(b)=234770789, a=154, a0=-4294967142, a1=-16777216, a2=-65536, a3=-256, b=234770789, b0=234770789, b1=917073, b2=3582, b3=13, carry=0, i=1, na=1, nb=4, partial_sum=81, r0=255] [L93] COND FALSE !(i == (unsigned char)3) VAL [\old(a)=154, \old(b)=234770789, a=154, a0=-4294967142, a1=-16777216, a2=-65536, a3=-256, b=234770789, b0=234770789, b1=917073, b2=3582, b3=13, carry=0, i=1, na=1, nb=4, partial_sum=81, r0=255] [L95] COND FALSE !(partial_sum > ((unsigned char)255)) VAL [\old(a)=154, \old(b)=234770789, a=154, a0=-4294967142, a1=-16777216, a2=-65536, a3=-256, b=234770789, b0=234770789, b1=917073, b2=3582, b3=13, carry=0, i=1, na=1, nb=4, partial_sum=81, r0=255] [L99] COND FALSE !(i == (unsigned char)0) VAL [\old(a)=154, \old(b)=234770789, a=154, a0=-4294967142, a1=-16777216, a2=-65536, a3=-256, b=234770789, b0=234770789, b1=917073, b2=3582, b3=13, carry=0, i=1, na=1, nb=4, partial_sum=81, r0=255] [L100] COND TRUE i == (unsigned char)1 [L100] r1 = (unsigned char)partial_sum VAL [\old(a)=154, \old(b)=234770789, a=154, a0=-4294967142, a1=-16777216, a2=-65536, a3=-256, b=234770789, b0=234770789, b1=917073, b2=3582, b3=13, carry=0, i=1, na=1, nb=4, partial_sum=81, r0=255, r1=81] [L101] COND FALSE !(i == (unsigned char)2) VAL [\old(a)=154, \old(b)=234770789, a=154, a0=-4294967142, a1=-16777216, a2=-65536, a3=-256, b=234770789, b0=234770789, b1=917073, b2=3582, b3=13, carry=0, i=1, na=1, nb=4, partial_sum=81, r0=255, r1=81] [L102] COND FALSE !(i == (unsigned char)3) VAL [\old(a)=154, \old(b)=234770789, a=154, a0=-4294967142, a1=-16777216, a2=-65536, a3=-256, b=234770789, b0=234770789, b1=917073, b2=3582, b3=13, carry=0, i=1, na=1, nb=4, partial_sum=81, r0=255, r1=81] [L104] i = i + (unsigned char)1 VAL [\old(a)=154, \old(b)=234770789, a=154, a0=-4294967142, a1=-16777216, a2=-65536, a3=-256, b=234770789, b0=234770789, b1=917073, b2=3582, b3=13, carry=0, i=2, na=1, nb=4, partial_sum=81, r0=255, r1=81] [L80] COND TRUE (i < na) || (i < nb) || (carry != (unsigned short)0) [L81] partial_sum = carry [L82] carry = (unsigned short)0 VAL [\old(a)=154, \old(b)=234770789, a=154, a0=-4294967142, a1=-16777216, a2=-65536, a3=-256, b=234770789, b0=234770789, b1=917073, b2=3582, b3=13, carry=0, i=2, na=1, nb=4, partial_sum=0, r0=255, r1=81] [L83] COND FALSE !(i < na) VAL [\old(a)=154, \old(b)=234770789, a=154, a0=-4294967142, a1=-16777216, a2=-65536, a3=-256, b=234770789, b0=234770789, b1=917073, b2=3582, b3=13, carry=0, i=2, na=1, nb=4, partial_sum=0, r0=255, r1=81] [L89] COND TRUE i < nb VAL [\old(a)=154, \old(b)=234770789, a=154, a0=-4294967142, a1=-16777216, a2=-65536, a3=-256, b=234770789, b0=234770789, b1=917073, b2=3582, b3=13, carry=0, i=2, na=1, nb=4, partial_sum=0, r0=255, r1=81] [L90] COND FALSE !(i == (unsigned char)0) VAL [\old(a)=154, \old(b)=234770789, a=154, a0=-4294967142, a1=-16777216, a2=-65536, a3=-256, b=234770789, b0=234770789, b1=917073, b2=3582, b3=13, carry=0, i=2, na=1, nb=4, partial_sum=0, r0=255, r1=81] [L91] COND FALSE !(i == (unsigned char)1) VAL [\old(a)=154, \old(b)=234770789, a=154, a0=-4294967142, a1=-16777216, a2=-65536, a3=-256, b=234770789, b0=234770789, b1=917073, b2=3582, b3=13, carry=0, i=2, na=1, nb=4, partial_sum=0, r0=255, r1=81] [L92] COND TRUE i == (unsigned char)2 [L92] partial_sum = partial_sum + b2 VAL [\old(a)=154, \old(b)=234770789, a=154, a0=-4294967142, a1=-16777216, a2=-65536, a3=-256, b=234770789, b0=234770789, b1=917073, b2=3582, b3=13, carry=0, i=2, na=1, nb=4, partial_sum=254, r0=255, r1=81] [L93] COND FALSE !(i == (unsigned char)3) VAL [\old(a)=154, \old(b)=234770789, a=154, a0=-4294967142, a1=-16777216, a2=-65536, a3=-256, b=234770789, b0=234770789, b1=917073, b2=3582, b3=13, carry=0, i=2, na=1, nb=4, partial_sum=254, r0=255, r1=81] [L95] COND FALSE !(partial_sum > ((unsigned char)255)) VAL [\old(a)=154, \old(b)=234770789, a=154, a0=-4294967142, a1=-16777216, a2=-65536, a3=-256, b=234770789, b0=234770789, b1=917073, b2=3582, b3=13, carry=0, i=2, na=1, nb=4, partial_sum=254, r0=255, r1=81] [L99] COND FALSE !(i == (unsigned char)0) VAL [\old(a)=154, \old(b)=234770789, a=154, a0=-4294967142, a1=-16777216, a2=-65536, a3=-256, b=234770789, b0=234770789, b1=917073, b2=3582, b3=13, carry=0, i=2, na=1, nb=4, partial_sum=254, r0=255, r1=81] [L100] COND FALSE !(i == (unsigned char)1) VAL [\old(a)=154, \old(b)=234770789, a=154, a0=-4294967142, a1=-16777216, a2=-65536, a3=-256, b=234770789, b0=234770789, b1=917073, b2=3582, b3=13, carry=0, i=2, na=1, nb=4, partial_sum=254, r0=255, r1=81] [L101] COND TRUE i == (unsigned char)2 [L101] r2 = (unsigned char)partial_sum VAL [\old(a)=154, \old(b)=234770789, a=154, a0=-4294967142, a1=-16777216, a2=-65536, a3=-256, b=234770789, b0=234770789, b1=917073, b2=3582, b3=13, carry=0, i=2, na=1, nb=4, partial_sum=254, r0=255, r1=81, r2=254] [L102] COND FALSE !(i == (unsigned char)3) VAL [\old(a)=154, \old(b)=234770789, a=154, a0=-4294967142, a1=-16777216, a2=-65536, a3=-256, b=234770789, b0=234770789, b1=917073, b2=3582, b3=13, carry=0, i=2, na=1, nb=4, partial_sum=254, r0=255, r1=81, r2=254] [L104] i = i + (unsigned char)1 VAL [\old(a)=154, \old(b)=234770789, a=154, a0=-4294967142, a1=-16777216, a2=-65536, a3=-256, b=234770789, b0=234770789, b1=917073, b2=3582, b3=13, carry=0, i=3, na=1, nb=4, partial_sum=254, r0=255, r1=81, r2=254] [L80] COND TRUE (i < na) || (i < nb) || (carry != (unsigned short)0) [L81] partial_sum = carry [L82] carry = (unsigned short)0 VAL [\old(a)=154, \old(b)=234770789, a=154, a0=-4294967142, a1=-16777216, a2=-65536, a3=-256, b=234770789, b0=234770789, b1=917073, b2=3582, b3=13, carry=0, i=3, na=1, nb=4, partial_sum=0, r0=255, r1=81, r2=254] [L83] COND FALSE !(i < na) VAL [\old(a)=154, \old(b)=234770789, a=154, a0=-4294967142, a1=-16777216, a2=-65536, a3=-256, b=234770789, b0=234770789, b1=917073, b2=3582, b3=13, carry=0, i=3, na=1, nb=4, partial_sum=0, r0=255, r1=81, r2=254] [L89] COND TRUE i < nb VAL [\old(a)=154, \old(b)=234770789, a=154, a0=-4294967142, a1=-16777216, a2=-65536, a3=-256, b=234770789, b0=234770789, b1=917073, b2=3582, b3=13, carry=0, i=3, na=1, nb=4, partial_sum=0, r0=255, r1=81, r2=254] [L90] COND FALSE !(i == (unsigned char)0) VAL [\old(a)=154, \old(b)=234770789, a=154, a0=-4294967142, a1=-16777216, a2=-65536, a3=-256, b=234770789, b0=234770789, b1=917073, b2=3582, b3=13, carry=0, i=3, na=1, nb=4, partial_sum=0, r0=255, r1=81, r2=254] [L91] COND FALSE !(i == (unsigned char)1) VAL [\old(a)=154, \old(b)=234770789, a=154, a0=-4294967142, a1=-16777216, a2=-65536, a3=-256, b=234770789, b0=234770789, b1=917073, b2=3582, b3=13, carry=0, i=3, na=1, nb=4, partial_sum=0, r0=255, r1=81, r2=254] [L92] COND FALSE !(i == (unsigned char)2) VAL [\old(a)=154, \old(b)=234770789, a=154, a0=-4294967142, a1=-16777216, a2=-65536, a3=-256, b=234770789, b0=234770789, b1=917073, b2=3582, b3=13, carry=0, i=3, na=1, nb=4, partial_sum=0, r0=255, r1=81, r2=254] [L93] COND TRUE i == (unsigned char)3 [L93] partial_sum = partial_sum + b3 VAL [\old(a)=154, \old(b)=234770789, a=154, a0=-4294967142, a1=-16777216, a2=-65536, a3=-256, b=234770789, b0=234770789, b1=917073, b2=3582, b3=13, carry=0, i=3, na=1, nb=4, partial_sum=13, r0=255, r1=81, r2=254] [L95] COND FALSE !(partial_sum > ((unsigned char)255)) VAL [\old(a)=154, \old(b)=234770789, a=154, a0=-4294967142, a1=-16777216, a2=-65536, a3=-256, b=234770789, b0=234770789, b1=917073, b2=3582, b3=13, carry=0, i=3, na=1, nb=4, partial_sum=13, r0=255, r1=81, r2=254] [L99] COND FALSE !(i == (unsigned char)0) VAL [\old(a)=154, \old(b)=234770789, a=154, a0=-4294967142, a1=-16777216, a2=-65536, a3=-256, b=234770789, b0=234770789, b1=917073, b2=3582, b3=13, carry=0, i=3, na=1, nb=4, partial_sum=13, r0=255, r1=81, r2=254] [L100] COND FALSE !(i == (unsigned char)1) VAL [\old(a)=154, \old(b)=234770789, a=154, a0=-4294967142, a1=-16777216, a2=-65536, a3=-256, b=234770789, b0=234770789, b1=917073, b2=3582, b3=13, carry=0, i=3, na=1, nb=4, partial_sum=13, r0=255, r1=81, r2=254] [L101] COND FALSE !(i == (unsigned char)2) VAL [\old(a)=154, \old(b)=234770789, a=154, a0=-4294967142, a1=-16777216, a2=-65536, a3=-256, b=234770789, b0=234770789, b1=917073, b2=3582, b3=13, carry=0, i=3, na=1, nb=4, partial_sum=13, r0=255, r1=81, r2=254] [L102] COND TRUE i == (unsigned char)3 [L102] r3 = (unsigned char)partial_sum VAL [\old(a)=154, \old(b)=234770789, a=154, a0=-4294967142, a1=-16777216, a2=-65536, a3=-256, b=234770789, b0=234770789, b1=917073, b2=3582, b3=13, carry=0, i=3, na=1, nb=4, partial_sum=13, r0=255, r1=81, r2=254, r3=13] [L104] i = i + (unsigned char)1 VAL [\old(a)=154, \old(b)=234770789, a=154, a0=-4294967142, a1=-16777216, a2=-65536, a3=-256, b=234770789, b0=234770789, b1=917073, b2=3582, b3=13, carry=0, i=4, na=1, nb=4, partial_sum=13, r0=255, r1=81, r2=254, r3=13] [L80] COND FALSE !((i < na) || (i < nb) || (carry != (unsigned short)0)) VAL [\old(a)=154, \old(b)=234770789, a=154, a0=-4294967142, a1=-16777216, a2=-65536, a3=-256, b=234770789, b0=234770789, b1=917073, b2=3582, b3=13, carry=0, i=4, na=1, nb=4, partial_sum=13, r0=255, r1=81, r2=254, r3=13] [L107] COND FALSE !(i < (unsigned char)4) VAL [\old(a)=154, \old(b)=234770789, a=154, a0=-4294967142, a1=-16777216, a2=-65536, a3=-256, b=234770789, b0=234770789, b1=917073, b2=3582, b3=13, carry=0, i=4, na=1, nb=4, partial_sum=13, r0=255, r1=81, r2=254, r3=13] [L116] r = r0 | (r1 << 8U) | (r2 << 16U) | ((unsigned int)r3 << 24U) [L118] return r; VAL [\old(a)=154, \old(b)=234770789, \result=218103808, a=154, a0=-4294967142, a1=-16777216, a2=-65536, a3=-256, b=234770789, b0=234770789, b1=917073, b2=3582, b3=13, carry=0, i=4, na=1, nb=4, partial_sum=13, r=218103808, r0=255, r1=81, r2=254, r3=13] [L129] RET, EXPR mp_add(a, b) [L129] r = mp_add(a, b) [L131] CALL __VERIFIER_assert(r == a + b) [L24] COND TRUE !(cond) VAL [\old(cond)=0, cond=0] [L25] reach_error() VAL [\old(cond)=0, cond=0] - StatisticsResult: Ultimate Automizer benchmark data CFG has 1 procedures, 47 locations, 1 error locations. Started 1 CEGAR loops. OverallTime: 6.5s, OverallIterations: 13, TraceHistogramMax: 4, PathProgramHistogramMax: 1, EmptinessCheckTime: 0.0s, AutomataDifference: 2.6s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 0.0s, HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 1769 SdHoareTripleChecker+Valid, 1.9s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 1769 mSDsluCounter, 2227 SdHoareTripleChecker+Invalid, 1.5s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 1392 mSDsCounter, 253 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 1989 IncrementalHoareTripleChecker+Invalid, 2242 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 253 mSolverCounterUnsat, 835 mSDtfsCounter, 1989 mSolverCounterSat, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 275 GetRequests, 208 SyntacticMatches, 6 SemanticMatches, 61 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 135 ImplicationChecksByTransitivity, 0.5s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=493occurred in iteration=12, InterpolantAutomatonStates: 74, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s DumpTime, AutomataMinimizationStatistics: 0.2s AutomataMinimizationTime, 12 MinimizatonAttempts, 1552 StatesRemovedByMinimization, 10 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.0s SsaConstructionTime, 0.5s SatisfiabilityAnalysisTime, 2.2s InterpolantComputationTime, 634 NumberOfCodeBlocks, 634 NumberOfCodeBlocksAsserted, 15 NumberOfCheckSat, 617 ConstructedInterpolants, 0 QuantifiedInterpolants, 1898 SizeOfPredicates, 7 NumberOfNonLiveVariables, 307 ConjunctsInSsa, 15 ConjunctsInUnsatCore, 15 InterpolantComputations, 11 PerfectInterpolantSequences, 459/491 InterpolantCoveringCapability, INVARIANT_SYNTHESIS: No data available, INTERPOLANT_CONSOLIDATION: No data available, ABSTRACT_INTERPRETATION: No data available, PDR: No data available, ACCELERATED_INTERPOLATION: No data available, SIFA: No data available, ReuseStatistics: No data available RESULT: Ultimate could not prove your program: unable to determine feasibility of some traces [2023-02-15 10:18:08,418 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (1)] Forceful destruction successful, exit code 0 Received shutdown request... --- End real Ultimate output --- Execution finished normally Using bit-precise analysis Retrying with bit-precise analysis ### Bit-precise run ### Calling Ultimate with: /usr/bin/java -Dosgi.configuration.area=/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/config -Xmx15G -Xms4m -jar /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/plugins/org.eclipse.equinox.launcher_1.5.800.v20200727-1323.jar -data @noDefault -ultimatedata /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data -tc /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/AutomizerReach.xml -i ../sv-benchmarks/c/bitvector/byte_add_2-2.i -s /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Bitvector.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux --witnessprinter.witness.filename witness.graphml --witnessprinter.write.witness.besides.input.file false --witnessprinter.graph.data.specification CHECK( init(main()), LTL(G ! call(reach_error())) ) --witnessprinter.graph.data.producer Automizer --witnessprinter.graph.data.architecture 32bit --witnessprinter.graph.data.programhash de6decccd91c37b79cf607a5f07869bb0707e08de203e3ce6759a25f4e6e01ba --- Real Ultimate output --- This is Ultimate 0.2.2-?-a31fd05 [2023-02-15 10:18:10,525 INFO L177 SettingsManager]: Resetting all preferences to default values... [2023-02-15 10:18:10,527 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2023-02-15 10:18:10,561 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2023-02-15 10:18:10,563 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2023-02-15 10:18:10,567 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2023-02-15 10:18:10,571 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2023-02-15 10:18:10,574 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2023-02-15 10:18:10,578 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2023-02-15 10:18:10,581 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2023-02-15 10:18:10,583 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2023-02-15 10:18:10,585 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2023-02-15 10:18:10,585 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2023-02-15 10:18:10,591 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2023-02-15 10:18:10,592 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2023-02-15 10:18:10,594 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2023-02-15 10:18:10,595 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2023-02-15 10:18:10,596 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2023-02-15 10:18:10,598 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2023-02-15 10:18:10,600 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2023-02-15 10:18:10,604 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2023-02-15 10:18:10,605 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2023-02-15 10:18:10,606 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2023-02-15 10:18:10,606 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2023-02-15 10:18:10,611 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2023-02-15 10:18:10,611 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2023-02-15 10:18:10,611 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2023-02-15 10:18:10,613 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2023-02-15 10:18:10,613 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2023-02-15 10:18:10,619 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2023-02-15 10:18:10,620 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2023-02-15 10:18:10,622 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2023-02-15 10:18:10,623 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2023-02-15 10:18:10,624 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2023-02-15 10:18:10,625 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2023-02-15 10:18:10,625 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2023-02-15 10:18:10,626 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2023-02-15 10:18:10,626 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2023-02-15 10:18:10,626 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2023-02-15 10:18:10,627 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2023-02-15 10:18:10,627 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2023-02-15 10:18:10,628 INFO L101 SettingsManager]: Beginning loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Bitvector.epf [2023-02-15 10:18:10,668 INFO L113 SettingsManager]: Loading preferences was successful [2023-02-15 10:18:10,668 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2023-02-15 10:18:10,669 INFO L136 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2023-02-15 10:18:10,669 INFO L138 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2023-02-15 10:18:10,670 INFO L136 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2023-02-15 10:18:10,670 INFO L138 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2023-02-15 10:18:10,671 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2023-02-15 10:18:10,671 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2023-02-15 10:18:10,671 INFO L138 SettingsManager]: * Use SBE=true [2023-02-15 10:18:10,671 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2023-02-15 10:18:10,672 INFO L138 SettingsManager]: * sizeof long=4 [2023-02-15 10:18:10,672 INFO L138 SettingsManager]: * sizeof POINTER=4 [2023-02-15 10:18:10,672 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2023-02-15 10:18:10,673 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2023-02-15 10:18:10,673 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2023-02-15 10:18:10,673 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2023-02-15 10:18:10,673 INFO L138 SettingsManager]: * Adapt memory model on pointer casts if necessary=true [2023-02-15 10:18:10,673 INFO L138 SettingsManager]: * Use bitvectors instead of ints=true [2023-02-15 10:18:10,673 INFO L138 SettingsManager]: * Memory model=HoenickeLindenmann_4ByteResolution [2023-02-15 10:18:10,674 INFO L138 SettingsManager]: * sizeof long double=12 [2023-02-15 10:18:10,674 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2023-02-15 10:18:10,674 INFO L138 SettingsManager]: * Use constant arrays=true [2023-02-15 10:18:10,674 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2023-02-15 10:18:10,674 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2023-02-15 10:18:10,675 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2023-02-15 10:18:10,675 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2023-02-15 10:18:10,675 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2023-02-15 10:18:10,675 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2023-02-15 10:18:10,675 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2023-02-15 10:18:10,675 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2023-02-15 10:18:10,676 INFO L138 SettingsManager]: * Trace refinement strategy=WOLF [2023-02-15 10:18:10,676 INFO L138 SettingsManager]: * Command for external solver=cvc4 --incremental --print-success --lang smt [2023-02-15 10:18:10,676 INFO L138 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2023-02-15 10:18:10,676 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2023-02-15 10:18:10,676 INFO L138 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2023-02-15 10:18:10,677 INFO L138 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2023-02-15 10:18:10,677 INFO L138 SettingsManager]: * Logic for external solver=AUFBV [2023-02-15 10:18:10,677 INFO L138 SettingsManager]: * Independence relation used for large block encoding in concurrent analysis=SYNTACTIC [2023-02-15 10:18:10,677 INFO L138 SettingsManager]: * Looper check in Petri net analysis=SEMANTIC WARNING: An illegal reflective access operation has occurred WARNING: Illegal reflective access by com.sun.xml.bind.v2.runtime.reflect.opt.Injector$1 (file:/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/plugins/com.sun.xml.bind_2.2.0.v201505121915.jar) to method java.lang.ClassLoader.defineClass(java.lang.String,byte[],int,int) WARNING: Please consider reporting this to the maintainers of com.sun.xml.bind.v2.runtime.reflect.opt.Injector$1 WARNING: Use --illegal-access=warn to enable warnings of further illegal reflective access operations WARNING: All illegal access operations will be denied in a future release Applying setting for plugin de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator: Entry function -> main Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Witness directory -> /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Witness filename -> witness.graphml Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Write witness besides input file -> false Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data specification -> CHECK( init(main()), LTL(G ! call(reach_error())) ) 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 -> de6decccd91c37b79cf607a5f07869bb0707e08de203e3ce6759a25f4e6e01ba [2023-02-15 10:18:10,997 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2023-02-15 10:18:11,013 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2023-02-15 10:18:11,016 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2023-02-15 10:18:11,017 INFO L271 PluginConnector]: Initializing CDTParser... [2023-02-15 10:18:11,017 INFO L275 PluginConnector]: CDTParser initialized [2023-02-15 10:18:11,018 INFO L432 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/bitvector/byte_add_2-2.i [2023-02-15 10:18:12,190 INFO L500 CDTParser]: Created temporary CDT project at NULL [2023-02-15 10:18:12,422 INFO L351 CDTParser]: Found 1 translation units. [2023-02-15 10:18:12,423 INFO L172 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/bitvector/byte_add_2-2.i [2023-02-15 10:18:12,429 INFO L394 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/351369719/6fef8e99571343a8a170f74db4117ef5/FLAGf374c03d9 [2023-02-15 10:18:12,446 INFO L402 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/351369719/6fef8e99571343a8a170f74db4117ef5 [2023-02-15 10:18:12,449 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2023-02-15 10:18:12,450 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2023-02-15 10:18:12,451 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2023-02-15 10:18:12,451 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2023-02-15 10:18:12,454 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2023-02-15 10:18:12,455 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 15.02 10:18:12" (1/1) ... [2023-02-15 10:18:12,458 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@6dc790db and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.02 10:18:12, skipping insertion in model container [2023-02-15 10:18:12,458 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 15.02 10:18:12" (1/1) ... [2023-02-15 10:18:12,465 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2023-02-15 10:18:12,501 INFO L178 MainTranslator]: Built tables and reachable declarations [2023-02-15 10:18:12,641 WARN L237 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/bitvector/byte_add_2-2.i[1168,1181] [2023-02-15 10:18:12,696 INFO L210 PostProcessor]: Analyzing one entry point: main [2023-02-15 10:18:12,712 INFO L203 MainTranslator]: Completed pre-run [2023-02-15 10:18:12,727 WARN L237 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/bitvector/byte_add_2-2.i[1168,1181] [2023-02-15 10:18:12,752 INFO L210 PostProcessor]: Analyzing one entry point: main [2023-02-15 10:18:12,774 INFO L208 MainTranslator]: Completed translation [2023-02-15 10:18:12,775 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.02 10:18:12 WrapperNode [2023-02-15 10:18:12,775 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2023-02-15 10:18:12,776 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2023-02-15 10:18:12,776 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2023-02-15 10:18:12,776 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2023-02-15 10:18:12,782 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.02 10:18:12" (1/1) ... [2023-02-15 10:18:12,799 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.02 10:18:12" (1/1) ... [2023-02-15 10:18:12,827 INFO L138 Inliner]: procedures = 16, calls = 8, calls flagged for inlining = 4, calls inlined = 4, statements flattened = 123 [2023-02-15 10:18:12,827 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2023-02-15 10:18:12,828 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2023-02-15 10:18:12,828 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2023-02-15 10:18:12,829 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2023-02-15 10:18:12,835 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.02 10:18:12" (1/1) ... [2023-02-15 10:18:12,836 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.02 10:18:12" (1/1) ... [2023-02-15 10:18:12,849 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.02 10:18:12" (1/1) ... [2023-02-15 10:18:12,850 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.02 10:18:12" (1/1) ... [2023-02-15 10:18:12,859 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.02 10:18:12" (1/1) ... [2023-02-15 10:18:12,869 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.02 10:18:12" (1/1) ... [2023-02-15 10:18:12,871 INFO L185 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.02 10:18:12" (1/1) ... [2023-02-15 10:18:12,876 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.02 10:18:12" (1/1) ... [2023-02-15 10:18:12,878 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2023-02-15 10:18:12,879 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2023-02-15 10:18:12,879 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2023-02-15 10:18:12,879 INFO L275 PluginConnector]: RCFGBuilder initialized [2023-02-15 10:18:12,880 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.02 10:18:12" (1/1) ... [2023-02-15 10:18:12,885 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2023-02-15 10:18:12,898 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-02-15 10:18:12,914 INFO L229 MonitoredProcess]: Starting monitored process 1 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (exit command is (exit), workingDir is null) [2023-02-15 10:18:12,939 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (1)] Waiting until timeout for monitored process [2023-02-15 10:18:12,956 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2023-02-15 10:18:12,956 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE1 [2023-02-15 10:18:12,956 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2023-02-15 10:18:12,956 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2023-02-15 10:18:13,024 INFO L235 CfgBuilder]: Building ICFG [2023-02-15 10:18:13,028 INFO L261 CfgBuilder]: Building CFG for each procedure with an implementation [2023-02-15 10:18:13,305 INFO L276 CfgBuilder]: Performing block encoding [2023-02-15 10:18:13,310 INFO L295 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2023-02-15 10:18:13,310 INFO L300 CfgBuilder]: Removed 2 assume(true) statements. [2023-02-15 10:18:13,312 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 15.02 10:18:13 BoogieIcfgContainer [2023-02-15 10:18:13,312 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2023-02-15 10:18:13,314 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2023-02-15 10:18:13,314 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2023-02-15 10:18:13,317 INFO L275 PluginConnector]: TraceAbstraction initialized [2023-02-15 10:18:13,317 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 15.02 10:18:12" (1/3) ... [2023-02-15 10:18:13,318 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@4e26adea and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 15.02 10:18:13, skipping insertion in model container [2023-02-15 10:18:13,318 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.02 10:18:12" (2/3) ... [2023-02-15 10:18:13,318 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@4e26adea and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 15.02 10:18:13, skipping insertion in model container [2023-02-15 10:18:13,318 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 15.02 10:18:13" (3/3) ... [2023-02-15 10:18:13,319 INFO L112 eAbstractionObserver]: Analyzing ICFG byte_add_2-2.i [2023-02-15 10:18:13,335 INFO L203 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2023-02-15 10:18:13,335 INFO L162 ceAbstractionStarter]: Applying trace abstraction to program that has 1 error locations. [2023-02-15 10:18:13,373 INFO L356 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2023-02-15 10:18:13,390 INFO L357 AbstractCegarLoop]: Settings: SEPARATE_VIOLATION_CHECK=true, mInterprocedural=true, mMaxIterations=1000000, mWatchIteration=1000000, mArtifact=RCFG, mInterpolation=FPandBP, mInterpolantAutomaton=STRAIGHT_LINE, mDumpAutomata=false, mAutomataFormat=ATS_NUMERATE, mDumpPath=., mDeterminiation=PREDICATE_ABSTRACTION, mMinimize=MINIMIZE_SEVPA, mHoare=true, mAutomataTypeConcurrency=PETRI_NET, mHoareTripleChecks=INCREMENTAL, mHoareAnnotationPositions=LoopsAndPotentialCycles, mDumpOnlyReuseAutomata=false, mLimitTraceHistogram=0, mErrorLocTimeLimit=0, mLimitPathProgramCount=0, mCollectInterpolantStatistics=true, mHeuristicEmptinessCheck=false, mHeuristicEmptinessCheckAStarHeuristic=ZERO, mHeuristicEmptinessCheckAStarHeuristicRandomSeed=1337, mHeuristicEmptinessCheckSmtFeatureScoringMethod=DAGSIZE, mSMTFeatureExtraction=false, mSMTFeatureExtractionDumpPath=., mOverrideInterpolantAutomaton=false, mMcrInterpolantMethod=WP, mPorIndependenceSettings=[Lde.uni_freiburg.informatik.ultimate.lib.tracecheckerutils.partialorder.independence.IndependenceSettings;@acff82e, mLbeIndependenceSettings=[IndependenceType=SYNTACTIC, AbstractionType=NONE, UseConditional=, UseSemiCommutativity=, Solver=, SolverTimeout=] [2023-02-15 10:18:13,390 INFO L358 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2023-02-15 10:18:13,395 INFO L276 IsEmpty]: Start isEmpty. Operand has 42 states, 40 states have (on average 1.775) internal successors, (71), 41 states have internal predecessors, (71), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-02-15 10:18:13,403 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 13 [2023-02-15 10:18:13,404 INFO L187 NwaCegarLoop]: Found error trace [2023-02-15 10:18:13,404 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-02-15 10:18:13,405 INFO L420 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-02-15 10:18:13,415 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2023-02-15 10:18:13,416 INFO L85 PathProgramCache]: Analyzing trace with hash 255061167, now seen corresponding path program 1 times [2023-02-15 10:18:13,427 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2023-02-15 10:18:13,428 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [267113423] [2023-02-15 10:18:13,428 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-02-15 10:18:13,429 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2023-02-15 10:18:13,429 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2023-02-15 10:18:13,430 INFO L229 MonitoredProcess]: Starting monitored process 2 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2023-02-15 10:18:13,470 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (2)] Waiting until timeout for monitored process [2023-02-15 10:18:13,558 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-15 10:18:13,561 INFO L263 TraceCheckSpWp]: Trace formula consists of 40 conjuncts, 1 conjunts are in the unsatisfiable core [2023-02-15 10:18:13,564 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2023-02-15 10:18:13,585 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-02-15 10:18:13,586 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2023-02-15 10:18:13,586 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2023-02-15 10:18:13,587 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [267113423] [2023-02-15 10:18:13,587 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleMathsat [267113423] provided 1 perfect and 0 imperfect interpolant sequences [2023-02-15 10:18:13,587 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-02-15 10:18:13,588 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2023-02-15 10:18:13,590 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1129302967] [2023-02-15 10:18:13,591 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-02-15 10:18:13,594 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2023-02-15 10:18:13,594 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2023-02-15 10:18:13,621 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2023-02-15 10:18:13,622 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2023-02-15 10:18:13,625 INFO L87 Difference]: Start difference. First operand has 42 states, 40 states have (on average 1.775) internal successors, (71), 41 states have internal predecessors, (71), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Second operand has 2 states, 2 states have (on average 6.0) internal successors, (12), 2 states have internal predecessors, (12), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-02-15 10:18:13,650 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-02-15 10:18:13,651 INFO L93 Difference]: Finished difference Result 57 states and 92 transitions. [2023-02-15 10:18:13,652 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2023-02-15 10:18:13,653 INFO L78 Accepts]: Start accepts. Automaton has has 2 states, 2 states have (on average 6.0) internal successors, (12), 2 states have internal predecessors, (12), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 12 [2023-02-15 10:18:13,653 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-02-15 10:18:13,660 INFO L225 Difference]: With dead ends: 57 [2023-02-15 10:18:13,661 INFO L226 Difference]: Without dead ends: 38 [2023-02-15 10:18:13,664 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 11 GetRequests, 11 SyntacticMatches, 0 SemanticMatches, 0 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2023-02-15 10:18:13,670 INFO L413 NwaCegarLoop]: 68 mSDtfsCounter, 0 mSDsluCounter, 0 mSDsCounter, 0 mSdLazyCounter, 0 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 68 SdHoareTripleChecker+Invalid, 0 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 0 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2023-02-15 10:18:13,672 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 68 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 0 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2023-02-15 10:18:13,686 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 38 states. [2023-02-15 10:18:13,702 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 38 to 38. [2023-02-15 10:18:13,703 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 38 states, 37 states have (on average 1.7297297297297298) internal successors, (64), 37 states have internal predecessors, (64), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-02-15 10:18:13,706 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 38 states to 38 states and 64 transitions. [2023-02-15 10:18:13,707 INFO L78 Accepts]: Start accepts. Automaton has 38 states and 64 transitions. Word has length 12 [2023-02-15 10:18:13,707 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-02-15 10:18:13,707 INFO L495 AbstractCegarLoop]: Abstraction has 38 states and 64 transitions. [2023-02-15 10:18:13,708 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 2 states, 2 states have (on average 6.0) internal successors, (12), 2 states have internal predecessors, (12), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-02-15 10:18:13,708 INFO L276 IsEmpty]: Start isEmpty. Operand 38 states and 64 transitions. [2023-02-15 10:18:13,709 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 13 [2023-02-15 10:18:13,710 INFO L187 NwaCegarLoop]: Found error trace [2023-02-15 10:18:13,710 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-02-15 10:18:13,722 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (2)] Forceful destruction successful, exit code 0 [2023-02-15 10:18:13,919 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 2 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2023-02-15 10:18:13,919 INFO L420 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-02-15 10:18:13,920 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2023-02-15 10:18:13,920 INFO L85 PathProgramCache]: Analyzing trace with hash 1803477009, now seen corresponding path program 1 times [2023-02-15 10:18:13,921 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2023-02-15 10:18:13,921 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1661950214] [2023-02-15 10:18:13,921 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-02-15 10:18:13,921 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2023-02-15 10:18:13,921 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2023-02-15 10:18:13,925 INFO L229 MonitoredProcess]: Starting monitored process 3 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2023-02-15 10:18:13,927 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (3)] Waiting until timeout for monitored process [2023-02-15 10:18:13,961 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-15 10:18:13,963 INFO L263 TraceCheckSpWp]: Trace formula consists of 42 conjuncts, 3 conjunts are in the unsatisfiable core [2023-02-15 10:18:13,964 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2023-02-15 10:18:14,017 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-02-15 10:18:14,017 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2023-02-15 10:18:14,017 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2023-02-15 10:18:14,018 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1661950214] [2023-02-15 10:18:14,018 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1661950214] provided 1 perfect and 0 imperfect interpolant sequences [2023-02-15 10:18:14,018 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-02-15 10:18:14,018 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2023-02-15 10:18:14,018 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [504274773] [2023-02-15 10:18:14,019 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-02-15 10:18:14,020 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2023-02-15 10:18:14,020 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2023-02-15 10:18:14,020 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2023-02-15 10:18:14,021 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2023-02-15 10:18:14,021 INFO L87 Difference]: Start difference. First operand 38 states and 64 transitions. Second operand has 4 states, 4 states have (on average 3.0) internal successors, (12), 4 states have internal predecessors, (12), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-02-15 10:18:14,151 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-02-15 10:18:14,151 INFO L93 Difference]: Finished difference Result 116 states and 201 transitions. [2023-02-15 10:18:14,152 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2023-02-15 10:18:14,152 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 3.0) internal successors, (12), 4 states have internal predecessors, (12), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 12 [2023-02-15 10:18:14,152 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-02-15 10:18:14,153 INFO L225 Difference]: With dead ends: 116 [2023-02-15 10:18:14,153 INFO L226 Difference]: Without dead ends: 88 [2023-02-15 10:18:14,154 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 11 GetRequests, 9 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2023-02-15 10:18:14,155 INFO L413 NwaCegarLoop]: 76 mSDtfsCounter, 92 mSDsluCounter, 61 mSDsCounter, 0 mSdLazyCounter, 71 mSolverCounterSat, 20 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 92 SdHoareTripleChecker+Valid, 137 SdHoareTripleChecker+Invalid, 91 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 20 IncrementalHoareTripleChecker+Valid, 71 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2023-02-15 10:18:14,155 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [92 Valid, 137 Invalid, 91 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [20 Valid, 71 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2023-02-15 10:18:14,156 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 88 states. [2023-02-15 10:18:14,163 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 88 to 81. [2023-02-15 10:18:14,164 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 81 states, 80 states have (on average 1.625) internal successors, (130), 80 states have internal predecessors, (130), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-02-15 10:18:14,165 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 81 states to 81 states and 130 transitions. [2023-02-15 10:18:14,166 INFO L78 Accepts]: Start accepts. Automaton has 81 states and 130 transitions. Word has length 12 [2023-02-15 10:18:14,166 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-02-15 10:18:14,166 INFO L495 AbstractCegarLoop]: Abstraction has 81 states and 130 transitions. [2023-02-15 10:18:14,166 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 3.0) internal successors, (12), 4 states have internal predecessors, (12), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-02-15 10:18:14,167 INFO L276 IsEmpty]: Start isEmpty. Operand 81 states and 130 transitions. [2023-02-15 10:18:14,167 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 14 [2023-02-15 10:18:14,167 INFO L187 NwaCegarLoop]: Found error trace [2023-02-15 10:18:14,167 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-02-15 10:18:14,179 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (3)] Forceful destruction successful, exit code 0 [2023-02-15 10:18:14,376 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 3 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2023-02-15 10:18:14,377 INFO L420 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-02-15 10:18:14,377 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2023-02-15 10:18:14,378 INFO L85 PathProgramCache]: Analyzing trace with hash -1087802014, now seen corresponding path program 1 times [2023-02-15 10:18:14,378 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2023-02-15 10:18:14,378 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1445980851] [2023-02-15 10:18:14,378 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-02-15 10:18:14,379 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2023-02-15 10:18:14,379 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2023-02-15 10:18:14,380 INFO L229 MonitoredProcess]: Starting monitored process 4 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2023-02-15 10:18:14,382 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (4)] Waiting until timeout for monitored process [2023-02-15 10:18:14,436 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-15 10:18:14,437 INFO L263 TraceCheckSpWp]: Trace formula consists of 44 conjuncts, 5 conjunts are in the unsatisfiable core [2023-02-15 10:18:14,438 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2023-02-15 10:18:14,454 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-02-15 10:18:14,454 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2023-02-15 10:18:14,455 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2023-02-15 10:18:14,455 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1445980851] [2023-02-15 10:18:14,455 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1445980851] provided 1 perfect and 0 imperfect interpolant sequences [2023-02-15 10:18:14,455 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-02-15 10:18:14,455 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2023-02-15 10:18:14,456 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1753376662] [2023-02-15 10:18:14,456 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-02-15 10:18:14,456 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2023-02-15 10:18:14,456 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2023-02-15 10:18:14,460 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2023-02-15 10:18:14,460 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2023-02-15 10:18:14,460 INFO L87 Difference]: Start difference. First operand 81 states and 130 transitions. Second operand has 3 states, 3 states have (on average 4.333333333333333) internal successors, (13), 3 states have internal predecessors, (13), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-02-15 10:18:14,470 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-02-15 10:18:14,471 INFO L93 Difference]: Finished difference Result 86 states and 134 transitions. [2023-02-15 10:18:14,471 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2023-02-15 10:18:14,471 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 4.333333333333333) internal successors, (13), 3 states have internal predecessors, (13), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 13 [2023-02-15 10:18:14,472 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-02-15 10:18:14,472 INFO L225 Difference]: With dead ends: 86 [2023-02-15 10:18:14,473 INFO L226 Difference]: Without dead ends: 55 [2023-02-15 10:18:14,473 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 12 GetRequests, 11 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2023-02-15 10:18:14,475 INFO L413 NwaCegarLoop]: 57 mSDtfsCounter, 55 mSDsluCounter, 1 mSDsCounter, 0 mSdLazyCounter, 2 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 55 SdHoareTripleChecker+Valid, 58 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 [2023-02-15 10:18:14,475 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [55 Valid, 58 Invalid, 2 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 2 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2023-02-15 10:18:14,476 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 55 states. [2023-02-15 10:18:14,480 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 55 to 55. [2023-02-15 10:18:14,481 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 55 states, 54 states have (on average 1.4814814814814814) internal successors, (80), 54 states have internal predecessors, (80), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-02-15 10:18:14,482 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 55 states to 55 states and 80 transitions. [2023-02-15 10:18:14,482 INFO L78 Accepts]: Start accepts. Automaton has 55 states and 80 transitions. Word has length 13 [2023-02-15 10:18:14,482 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-02-15 10:18:14,482 INFO L495 AbstractCegarLoop]: Abstraction has 55 states and 80 transitions. [2023-02-15 10:18:14,482 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 4.333333333333333) internal successors, (13), 3 states have internal predecessors, (13), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-02-15 10:18:14,482 INFO L276 IsEmpty]: Start isEmpty. Operand 55 states and 80 transitions. [2023-02-15 10:18:14,483 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2023-02-15 10:18:14,483 INFO L187 NwaCegarLoop]: Found error trace [2023-02-15 10:18:14,483 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-02-15 10:18:14,493 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (4)] Forceful destruction successful, exit code 0 [2023-02-15 10:18:14,692 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 4 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2023-02-15 10:18:14,693 INFO L420 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-02-15 10:18:14,693 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2023-02-15 10:18:14,693 INFO L85 PathProgramCache]: Analyzing trace with hash 1480128500, now seen corresponding path program 1 times [2023-02-15 10:18:14,694 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2023-02-15 10:18:14,694 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1835238028] [2023-02-15 10:18:14,694 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-02-15 10:18:14,694 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2023-02-15 10:18:14,695 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2023-02-15 10:18:14,696 INFO L229 MonitoredProcess]: Starting monitored process 5 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2023-02-15 10:18:14,699 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (5)] Waiting until timeout for monitored process [2023-02-15 10:18:14,734 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-15 10:18:14,735 INFO L263 TraceCheckSpWp]: Trace formula consists of 61 conjuncts, 3 conjunts are in the unsatisfiable core [2023-02-15 10:18:14,736 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2023-02-15 10:18:14,762 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 1 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-02-15 10:18:14,762 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2023-02-15 10:18:14,762 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2023-02-15 10:18:14,763 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1835238028] [2023-02-15 10:18:14,763 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1835238028] provided 1 perfect and 0 imperfect interpolant sequences [2023-02-15 10:18:14,763 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-02-15 10:18:14,763 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2023-02-15 10:18:14,763 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [167182082] [2023-02-15 10:18:14,764 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-02-15 10:18:14,764 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2023-02-15 10:18:14,764 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2023-02-15 10:18:14,765 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2023-02-15 10:18:14,765 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2023-02-15 10:18:14,765 INFO L87 Difference]: Start difference. First operand 55 states and 80 transitions. Second operand has 4 states, 4 states have (on average 6.25) internal successors, (25), 4 states have internal predecessors, (25), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-02-15 10:18:14,951 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-02-15 10:18:14,951 INFO L93 Difference]: Finished difference Result 151 states and 219 transitions. [2023-02-15 10:18:14,952 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2023-02-15 10:18:14,952 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 6.25) internal successors, (25), 4 states have internal predecessors, (25), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 25 [2023-02-15 10:18:14,952 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-02-15 10:18:14,953 INFO L225 Difference]: With dead ends: 151 [2023-02-15 10:18:14,953 INFO L226 Difference]: Without dead ends: 107 [2023-02-15 10:18:14,954 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 24 GetRequests, 22 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2023-02-15 10:18:14,955 INFO L413 NwaCegarLoop]: 78 mSDtfsCounter, 65 mSDsluCounter, 68 mSDsCounter, 0 mSdLazyCounter, 115 mSolverCounterSat, 4 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 65 SdHoareTripleChecker+Valid, 146 SdHoareTripleChecker+Invalid, 119 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 4 IncrementalHoareTripleChecker+Valid, 115 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2023-02-15 10:18:14,955 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [65 Valid, 146 Invalid, 119 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [4 Valid, 115 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2023-02-15 10:18:14,956 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 107 states. [2023-02-15 10:18:14,962 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 107 to 60. [2023-02-15 10:18:14,963 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 60 states, 59 states have (on average 1.4406779661016949) internal successors, (85), 59 states have internal predecessors, (85), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-02-15 10:18:14,964 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 60 states to 60 states and 85 transitions. [2023-02-15 10:18:14,964 INFO L78 Accepts]: Start accepts. Automaton has 60 states and 85 transitions. Word has length 25 [2023-02-15 10:18:14,964 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-02-15 10:18:14,964 INFO L495 AbstractCegarLoop]: Abstraction has 60 states and 85 transitions. [2023-02-15 10:18:14,965 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 6.25) internal successors, (25), 4 states have internal predecessors, (25), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-02-15 10:18:14,965 INFO L276 IsEmpty]: Start isEmpty. Operand 60 states and 85 transitions. [2023-02-15 10:18:14,966 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 27 [2023-02-15 10:18:14,966 INFO L187 NwaCegarLoop]: Found error trace [2023-02-15 10:18:14,966 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-02-15 10:18:14,977 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (5)] Forceful destruction successful, exit code 0 [2023-02-15 10:18:15,175 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 5 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2023-02-15 10:18:15,175 INFO L420 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-02-15 10:18:15,176 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2023-02-15 10:18:15,176 INFO L85 PathProgramCache]: Analyzing trace with hash -1384042382, now seen corresponding path program 1 times [2023-02-15 10:18:15,176 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2023-02-15 10:18:15,176 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [2066011158] [2023-02-15 10:18:15,177 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-02-15 10:18:15,177 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2023-02-15 10:18:15,177 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2023-02-15 10:18:15,179 INFO L229 MonitoredProcess]: Starting monitored process 6 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2023-02-15 10:18:15,180 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (6)] Waiting until timeout for monitored process [2023-02-15 10:18:15,231 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-15 10:18:15,232 INFO L263 TraceCheckSpWp]: Trace formula consists of 63 conjuncts, 4 conjunts are in the unsatisfiable core [2023-02-15 10:18:15,234 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2023-02-15 10:18:15,266 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 1 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-02-15 10:18:15,267 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2023-02-15 10:18:15,267 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2023-02-15 10:18:15,267 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [2066011158] [2023-02-15 10:18:15,267 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleMathsat [2066011158] provided 1 perfect and 0 imperfect interpolant sequences [2023-02-15 10:18:15,268 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-02-15 10:18:15,268 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2023-02-15 10:18:15,268 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [221469810] [2023-02-15 10:18:15,268 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-02-15 10:18:15,268 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2023-02-15 10:18:15,269 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2023-02-15 10:18:15,269 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2023-02-15 10:18:15,269 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2023-02-15 10:18:15,270 INFO L87 Difference]: Start difference. First operand 60 states and 85 transitions. Second operand has 5 states, 5 states have (on average 5.2) internal successors, (26), 5 states have internal predecessors, (26), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-02-15 10:18:15,475 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-02-15 10:18:15,475 INFO L93 Difference]: Finished difference Result 201 states and 290 transitions. [2023-02-15 10:18:15,476 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2023-02-15 10:18:15,476 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 5.2) internal successors, (26), 5 states have internal predecessors, (26), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 26 [2023-02-15 10:18:15,476 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-02-15 10:18:15,480 INFO L225 Difference]: With dead ends: 201 [2023-02-15 10:18:15,480 INFO L226 Difference]: Without dead ends: 157 [2023-02-15 10:18:15,481 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 25 GetRequests, 22 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2023-02-15 10:18:15,486 INFO L413 NwaCegarLoop]: 124 mSDtfsCounter, 117 mSDsluCounter, 188 mSDsCounter, 0 mSdLazyCounter, 185 mSolverCounterSat, 4 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 117 SdHoareTripleChecker+Valid, 312 SdHoareTripleChecker+Invalid, 189 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 4 IncrementalHoareTripleChecker+Valid, 185 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2023-02-15 10:18:15,487 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [117 Valid, 312 Invalid, 189 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [4 Valid, 185 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2023-02-15 10:18:15,491 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 157 states. [2023-02-15 10:18:15,508 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 157 to 60. [2023-02-15 10:18:15,510 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 60 states, 59 states have (on average 1.4406779661016949) internal successors, (85), 59 states have internal predecessors, (85), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-02-15 10:18:15,513 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 60 states to 60 states and 85 transitions. [2023-02-15 10:18:15,514 INFO L78 Accepts]: Start accepts. Automaton has 60 states and 85 transitions. Word has length 26 [2023-02-15 10:18:15,514 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-02-15 10:18:15,515 INFO L495 AbstractCegarLoop]: Abstraction has 60 states and 85 transitions. [2023-02-15 10:18:15,515 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 5.2) internal successors, (26), 5 states have internal predecessors, (26), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-02-15 10:18:15,515 INFO L276 IsEmpty]: Start isEmpty. Operand 60 states and 85 transitions. [2023-02-15 10:18:15,516 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 28 [2023-02-15 10:18:15,517 INFO L187 NwaCegarLoop]: Found error trace [2023-02-15 10:18:15,517 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-02-15 10:18:15,531 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (6)] Forceful destruction successful, exit code 0 [2023-02-15 10:18:15,726 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 6 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2023-02-15 10:18:15,727 INFO L420 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-02-15 10:18:15,728 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2023-02-15 10:18:15,728 INFO L85 PathProgramCache]: Analyzing trace with hash 1985045161, now seen corresponding path program 1 times [2023-02-15 10:18:15,728 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2023-02-15 10:18:15,729 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1253748023] [2023-02-15 10:18:15,729 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-02-15 10:18:15,729 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2023-02-15 10:18:15,729 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2023-02-15 10:18:15,730 INFO L229 MonitoredProcess]: Starting monitored process 7 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2023-02-15 10:18:15,731 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (7)] Waiting until timeout for monitored process [2023-02-15 10:18:15,787 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-15 10:18:15,792 INFO L263 TraceCheckSpWp]: Trace formula consists of 66 conjuncts, 6 conjunts are in the unsatisfiable core [2023-02-15 10:18:15,793 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2023-02-15 10:18:15,849 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 1 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-02-15 10:18:15,849 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2023-02-15 10:18:15,849 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2023-02-15 10:18:15,850 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1253748023] [2023-02-15 10:18:15,850 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1253748023] provided 1 perfect and 0 imperfect interpolant sequences [2023-02-15 10:18:15,850 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-02-15 10:18:15,850 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2023-02-15 10:18:15,850 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1306618995] [2023-02-15 10:18:15,851 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-02-15 10:18:15,851 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2023-02-15 10:18:15,851 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2023-02-15 10:18:15,852 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2023-02-15 10:18:15,852 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2023-02-15 10:18:15,852 INFO L87 Difference]: Start difference. First operand 60 states and 85 transitions. Second operand has 7 states, 7 states have (on average 3.857142857142857) internal successors, (27), 7 states have internal predecessors, (27), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-02-15 10:18:16,314 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-02-15 10:18:16,314 INFO L93 Difference]: Finished difference Result 269 states and 387 transitions. [2023-02-15 10:18:16,317 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2023-02-15 10:18:16,317 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 3.857142857142857) internal successors, (27), 7 states have internal predecessors, (27), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 27 [2023-02-15 10:18:16,317 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-02-15 10:18:16,318 INFO L225 Difference]: With dead ends: 269 [2023-02-15 10:18:16,318 INFO L226 Difference]: Without dead ends: 221 [2023-02-15 10:18:16,319 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 30 GetRequests, 21 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=27, Invalid=83, Unknown=0, NotChecked=0, Total=110 [2023-02-15 10:18:16,320 INFO L413 NwaCegarLoop]: 111 mSDtfsCounter, 361 mSDsluCounter, 351 mSDsCounter, 0 mSdLazyCounter, 707 mSolverCounterSat, 27 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 361 SdHoareTripleChecker+Valid, 462 SdHoareTripleChecker+Invalid, 734 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 27 IncrementalHoareTripleChecker+Valid, 707 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2023-02-15 10:18:16,320 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [361 Valid, 462 Invalid, 734 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [27 Valid, 707 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time] [2023-02-15 10:18:16,320 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 221 states. [2023-02-15 10:18:16,326 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 221 to 57. [2023-02-15 10:18:16,326 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 57 states, 56 states have (on average 1.4285714285714286) internal successors, (80), 56 states have internal predecessors, (80), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-02-15 10:18:16,327 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 57 states to 57 states and 80 transitions. [2023-02-15 10:18:16,327 INFO L78 Accepts]: Start accepts. Automaton has 57 states and 80 transitions. Word has length 27 [2023-02-15 10:18:16,327 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-02-15 10:18:16,327 INFO L495 AbstractCegarLoop]: Abstraction has 57 states and 80 transitions. [2023-02-15 10:18:16,327 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 3.857142857142857) internal successors, (27), 7 states have internal predecessors, (27), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-02-15 10:18:16,327 INFO L276 IsEmpty]: Start isEmpty. Operand 57 states and 80 transitions. [2023-02-15 10:18:16,328 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 30 [2023-02-15 10:18:16,328 INFO L187 NwaCegarLoop]: Found error trace [2023-02-15 10:18:16,328 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-02-15 10:18:16,348 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (7)] Forceful destruction successful, exit code 0 [2023-02-15 10:18:16,549 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 7 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2023-02-15 10:18:16,549 INFO L420 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-02-15 10:18:16,550 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2023-02-15 10:18:16,550 INFO L85 PathProgramCache]: Analyzing trace with hash 221982208, now seen corresponding path program 1 times [2023-02-15 10:18:16,551 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2023-02-15 10:18:16,553 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [636729507] [2023-02-15 10:18:16,553 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-02-15 10:18:16,553 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2023-02-15 10:18:16,553 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2023-02-15 10:18:16,554 INFO L229 MonitoredProcess]: Starting monitored process 8 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2023-02-15 10:18:16,556 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (8)] Waiting until timeout for monitored process [2023-02-15 10:18:16,592 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-15 10:18:16,594 INFO L263 TraceCheckSpWp]: Trace formula consists of 66 conjuncts, 4 conjunts are in the unsatisfiable core [2023-02-15 10:18:16,596 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2023-02-15 10:18:16,693 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 1 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-02-15 10:18:16,693 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2023-02-15 10:18:16,693 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2023-02-15 10:18:16,693 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [636729507] [2023-02-15 10:18:16,694 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleMathsat [636729507] provided 1 perfect and 0 imperfect interpolant sequences [2023-02-15 10:18:16,694 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-02-15 10:18:16,694 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2023-02-15 10:18:16,694 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [726544413] [2023-02-15 10:18:16,694 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-02-15 10:18:16,695 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2023-02-15 10:18:16,695 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2023-02-15 10:18:16,695 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2023-02-15 10:18:16,695 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2023-02-15 10:18:16,696 INFO L87 Difference]: Start difference. First operand 57 states and 80 transitions. Second operand has 5 states, 5 states have (on average 5.8) internal successors, (29), 5 states have internal predecessors, (29), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-02-15 10:18:16,852 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-02-15 10:18:16,852 INFO L93 Difference]: Finished difference Result 128 states and 190 transitions. [2023-02-15 10:18:16,852 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2023-02-15 10:18:16,852 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 5.8) internal successors, (29), 5 states have internal predecessors, (29), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 29 [2023-02-15 10:18:16,853 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-02-15 10:18:16,856 INFO L225 Difference]: With dead ends: 128 [2023-02-15 10:18:16,857 INFO L226 Difference]: Without dead ends: 82 [2023-02-15 10:18:16,858 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 28 GetRequests, 25 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2023-02-15 10:18:16,860 INFO L413 NwaCegarLoop]: 33 mSDtfsCounter, 88 mSDsluCounter, 21 mSDsCounter, 0 mSdLazyCounter, 133 mSolverCounterSat, 24 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 88 SdHoareTripleChecker+Valid, 54 SdHoareTripleChecker+Invalid, 157 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 24 IncrementalHoareTripleChecker+Valid, 133 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2023-02-15 10:18:16,860 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [88 Valid, 54 Invalid, 157 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [24 Valid, 133 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2023-02-15 10:18:16,861 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 82 states. [2023-02-15 10:18:16,870 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 82 to 80. [2023-02-15 10:18:16,873 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 80 states, 79 states have (on average 1.3291139240506329) internal successors, (105), 79 states have internal predecessors, (105), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-02-15 10:18:16,874 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 80 states to 80 states and 105 transitions. [2023-02-15 10:18:16,876 INFO L78 Accepts]: Start accepts. Automaton has 80 states and 105 transitions. Word has length 29 [2023-02-15 10:18:16,876 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-02-15 10:18:16,876 INFO L495 AbstractCegarLoop]: Abstraction has 80 states and 105 transitions. [2023-02-15 10:18:16,876 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 5.8) internal successors, (29), 5 states have internal predecessors, (29), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-02-15 10:18:16,877 INFO L276 IsEmpty]: Start isEmpty. Operand 80 states and 105 transitions. [2023-02-15 10:18:16,877 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 43 [2023-02-15 10:18:16,879 INFO L187 NwaCegarLoop]: Found error trace [2023-02-15 10:18:16,880 INFO L195 NwaCegarLoop]: trace histogram [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] [2023-02-15 10:18:16,889 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (8)] Forceful destruction successful, exit code 0 [2023-02-15 10:18:17,088 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 8 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2023-02-15 10:18:17,089 INFO L420 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-02-15 10:18:17,090 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2023-02-15 10:18:17,091 INFO L85 PathProgramCache]: Analyzing trace with hash 1280602341, now seen corresponding path program 1 times [2023-02-15 10:18:17,091 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2023-02-15 10:18:17,091 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1205126776] [2023-02-15 10:18:17,091 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-02-15 10:18:17,091 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2023-02-15 10:18:17,092 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2023-02-15 10:18:17,093 INFO L229 MonitoredProcess]: Starting monitored process 9 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2023-02-15 10:18:17,095 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (9)] Waiting until timeout for monitored process [2023-02-15 10:18:17,141 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-15 10:18:17,142 INFO L263 TraceCheckSpWp]: Trace formula consists of 85 conjuncts, 4 conjunts are in the unsatisfiable core [2023-02-15 10:18:17,144 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2023-02-15 10:18:17,210 INFO L134 CoverageAnalysis]: Checked inductivity of 15 backedges. 15 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-02-15 10:18:17,210 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2023-02-15 10:18:17,211 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2023-02-15 10:18:17,211 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1205126776] [2023-02-15 10:18:17,211 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1205126776] provided 1 perfect and 0 imperfect interpolant sequences [2023-02-15 10:18:17,211 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-02-15 10:18:17,211 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2023-02-15 10:18:17,211 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1130822669] [2023-02-15 10:18:17,212 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-02-15 10:18:17,212 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2023-02-15 10:18:17,212 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2023-02-15 10:18:17,213 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2023-02-15 10:18:17,213 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2023-02-15 10:18:17,213 INFO L87 Difference]: Start difference. First operand 80 states and 105 transitions. Second operand has 5 states, 5 states have (on average 8.4) internal successors, (42), 5 states have internal predecessors, (42), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-02-15 10:18:17,355 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-02-15 10:18:17,356 INFO L93 Difference]: Finished difference Result 226 states and 295 transitions. [2023-02-15 10:18:17,356 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2023-02-15 10:18:17,356 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 8.4) internal successors, (42), 5 states have internal predecessors, (42), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 42 [2023-02-15 10:18:17,356 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-02-15 10:18:17,357 INFO L225 Difference]: With dead ends: 226 [2023-02-15 10:18:17,357 INFO L226 Difference]: Without dead ends: 157 [2023-02-15 10:18:17,358 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 41 GetRequests, 38 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2023-02-15 10:18:17,358 INFO L413 NwaCegarLoop]: 61 mSDtfsCounter, 85 mSDsluCounter, 68 mSDsCounter, 0 mSdLazyCounter, 139 mSolverCounterSat, 8 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 85 SdHoareTripleChecker+Valid, 129 SdHoareTripleChecker+Invalid, 147 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 8 IncrementalHoareTripleChecker+Valid, 139 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2023-02-15 10:18:17,358 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [85 Valid, 129 Invalid, 147 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [8 Valid, 139 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2023-02-15 10:18:17,359 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 157 states. [2023-02-15 10:18:17,375 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 157 to 133. [2023-02-15 10:18:17,383 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 133 states, 132 states have (on average 1.3181818181818181) internal successors, (174), 132 states have internal predecessors, (174), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-02-15 10:18:17,384 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 133 states to 133 states and 174 transitions. [2023-02-15 10:18:17,384 INFO L78 Accepts]: Start accepts. Automaton has 133 states and 174 transitions. Word has length 42 [2023-02-15 10:18:17,384 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-02-15 10:18:17,384 INFO L495 AbstractCegarLoop]: Abstraction has 133 states and 174 transitions. [2023-02-15 10:18:17,384 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 8.4) internal successors, (42), 5 states have internal predecessors, (42), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-02-15 10:18:17,385 INFO L276 IsEmpty]: Start isEmpty. Operand 133 states and 174 transitions. [2023-02-15 10:18:17,385 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 44 [2023-02-15 10:18:17,386 INFO L187 NwaCegarLoop]: Found error trace [2023-02-15 10:18:17,386 INFO L195 NwaCegarLoop]: trace histogram [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] [2023-02-15 10:18:17,400 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (9)] Forceful destruction successful, exit code 0 [2023-02-15 10:18:17,596 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 9 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2023-02-15 10:18:17,596 INFO L420 AbstractCegarLoop]: === Iteration 9 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-02-15 10:18:17,597 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2023-02-15 10:18:17,597 INFO L85 PathProgramCache]: Analyzing trace with hash -649034713, now seen corresponding path program 1 times [2023-02-15 10:18:17,597 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2023-02-15 10:18:17,597 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1987939842] [2023-02-15 10:18:17,597 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-02-15 10:18:17,598 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2023-02-15 10:18:17,598 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2023-02-15 10:18:17,599 INFO L229 MonitoredProcess]: Starting monitored process 10 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2023-02-15 10:18:17,601 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (10)] Waiting until timeout for monitored process [2023-02-15 10:18:17,639 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-15 10:18:17,640 INFO L263 TraceCheckSpWp]: Trace formula consists of 87 conjuncts, 5 conjunts are in the unsatisfiable core [2023-02-15 10:18:17,642 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2023-02-15 10:18:17,730 INFO L134 CoverageAnalysis]: Checked inductivity of 15 backedges. 15 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-02-15 10:18:17,730 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2023-02-15 10:18:17,730 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2023-02-15 10:18:17,730 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1987939842] [2023-02-15 10:18:17,730 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1987939842] provided 1 perfect and 0 imperfect interpolant sequences [2023-02-15 10:18:17,730 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-02-15 10:18:17,730 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2023-02-15 10:18:17,730 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1842525072] [2023-02-15 10:18:17,731 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-02-15 10:18:17,731 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2023-02-15 10:18:17,731 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2023-02-15 10:18:17,731 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2023-02-15 10:18:17,731 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2023-02-15 10:18:17,732 INFO L87 Difference]: Start difference. First operand 133 states and 174 transitions. Second operand has 6 states, 6 states have (on average 7.166666666666667) internal successors, (43), 6 states have internal predecessors, (43), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-02-15 10:18:17,960 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-02-15 10:18:17,961 INFO L93 Difference]: Finished difference Result 301 states and 391 transitions. [2023-02-15 10:18:17,961 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2023-02-15 10:18:17,961 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 7.166666666666667) internal successors, (43), 6 states have internal predecessors, (43), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 43 [2023-02-15 10:18:17,961 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-02-15 10:18:17,962 INFO L225 Difference]: With dead ends: 301 [2023-02-15 10:18:17,962 INFO L226 Difference]: Without dead ends: 232 [2023-02-15 10:18:17,966 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 42 GetRequests, 38 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2023-02-15 10:18:17,966 INFO L413 NwaCegarLoop]: 107 mSDtfsCounter, 122 mSDsluCounter, 164 mSDsCounter, 0 mSdLazyCounter, 265 mSolverCounterSat, 8 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 122 SdHoareTripleChecker+Valid, 271 SdHoareTripleChecker+Invalid, 273 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 8 IncrementalHoareTripleChecker+Valid, 265 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2023-02-15 10:18:17,967 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [122 Valid, 271 Invalid, 273 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [8 Valid, 265 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2023-02-15 10:18:17,967 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 232 states. [2023-02-15 10:18:17,976 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 232 to 133. [2023-02-15 10:18:17,976 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 133 states, 132 states have (on average 1.3181818181818181) internal successors, (174), 132 states have internal predecessors, (174), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-02-15 10:18:17,977 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 133 states to 133 states and 174 transitions. [2023-02-15 10:18:17,977 INFO L78 Accepts]: Start accepts. Automaton has 133 states and 174 transitions. Word has length 43 [2023-02-15 10:18:17,977 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-02-15 10:18:17,977 INFO L495 AbstractCegarLoop]: Abstraction has 133 states and 174 transitions. [2023-02-15 10:18:17,977 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 7.166666666666667) internal successors, (43), 6 states have internal predecessors, (43), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-02-15 10:18:17,977 INFO L276 IsEmpty]: Start isEmpty. Operand 133 states and 174 transitions. [2023-02-15 10:18:17,978 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 45 [2023-02-15 10:18:17,978 INFO L187 NwaCegarLoop]: Found error trace [2023-02-15 10:18:17,978 INFO L195 NwaCegarLoop]: trace histogram [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] [2023-02-15 10:18:17,989 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (10)] Forceful destruction successful, exit code 0 [2023-02-15 10:18:18,186 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 10 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2023-02-15 10:18:18,187 INFO L420 AbstractCegarLoop]: === Iteration 10 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-02-15 10:18:18,187 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2023-02-15 10:18:18,187 INFO L85 PathProgramCache]: Analyzing trace with hash -2080233776, now seen corresponding path program 1 times [2023-02-15 10:18:18,187 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2023-02-15 10:18:18,188 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1867387409] [2023-02-15 10:18:18,188 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-02-15 10:18:18,188 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2023-02-15 10:18:18,188 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2023-02-15 10:18:18,189 INFO L229 MonitoredProcess]: Starting monitored process 11 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2023-02-15 10:18:18,200 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (11)] Waiting until timeout for monitored process [2023-02-15 10:18:18,239 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-15 10:18:18,240 INFO L263 TraceCheckSpWp]: Trace formula consists of 90 conjuncts, 8 conjunts are in the unsatisfiable core [2023-02-15 10:18:18,247 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2023-02-15 10:18:18,335 INFO L134 CoverageAnalysis]: Checked inductivity of 15 backedges. 12 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-02-15 10:18:18,335 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2023-02-15 10:18:18,423 INFO L134 CoverageAnalysis]: Checked inductivity of 15 backedges. 7 proven. 8 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-02-15 10:18:18,423 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2023-02-15 10:18:18,423 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1867387409] [2023-02-15 10:18:18,424 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1867387409] provided 0 perfect and 2 imperfect interpolant sequences [2023-02-15 10:18:18,424 INFO L184 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2023-02-15 10:18:18,424 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [6, 6] total 10 [2023-02-15 10:18:18,424 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1063517121] [2023-02-15 10:18:18,424 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2023-02-15 10:18:18,424 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2023-02-15 10:18:18,424 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2023-02-15 10:18:18,425 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2023-02-15 10:18:18,425 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=26, Invalid=64, Unknown=0, NotChecked=0, Total=90 [2023-02-15 10:18:18,425 INFO L87 Difference]: Start difference. First operand 133 states and 174 transitions. Second operand has 10 states, 10 states have (on average 7.6) internal successors, (76), 10 states have internal predecessors, (76), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-02-15 10:18:18,660 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-02-15 10:18:18,661 INFO L93 Difference]: Finished difference Result 451 states and 608 transitions. [2023-02-15 10:18:18,661 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2023-02-15 10:18:18,661 INFO L78 Accepts]: Start accepts. Automaton has has 10 states, 10 states have (on average 7.6) internal successors, (76), 10 states have internal predecessors, (76), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 44 [2023-02-15 10:18:18,662 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-02-15 10:18:18,663 INFO L225 Difference]: With dead ends: 451 [2023-02-15 10:18:18,663 INFO L226 Difference]: Without dead ends: 335 [2023-02-15 10:18:18,664 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 93 GetRequests, 78 SyntacticMatches, 0 SemanticMatches, 15 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 25 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=89, Invalid=183, Unknown=0, NotChecked=0, Total=272 [2023-02-15 10:18:18,664 INFO L413 NwaCegarLoop]: 88 mSDtfsCounter, 296 mSDsluCounter, 288 mSDsCounter, 0 mSdLazyCounter, 153 mSolverCounterSat, 6 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 296 SdHoareTripleChecker+Valid, 376 SdHoareTripleChecker+Invalid, 159 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 6 IncrementalHoareTripleChecker+Valid, 153 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2023-02-15 10:18:18,664 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [296 Valid, 376 Invalid, 159 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [6 Valid, 153 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2023-02-15 10:18:18,665 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 335 states. [2023-02-15 10:18:18,676 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 335 to 192. [2023-02-15 10:18:18,677 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 192 states, 191 states have (on average 1.3769633507853403) internal successors, (263), 191 states have internal predecessors, (263), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-02-15 10:18:18,677 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 192 states to 192 states and 263 transitions. [2023-02-15 10:18:18,677 INFO L78 Accepts]: Start accepts. Automaton has 192 states and 263 transitions. Word has length 44 [2023-02-15 10:18:18,678 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-02-15 10:18:18,678 INFO L495 AbstractCegarLoop]: Abstraction has 192 states and 263 transitions. [2023-02-15 10:18:18,678 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 10 states have (on average 7.6) internal successors, (76), 10 states have internal predecessors, (76), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-02-15 10:18:18,678 INFO L276 IsEmpty]: Start isEmpty. Operand 192 states and 263 transitions. [2023-02-15 10:18:18,679 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 45 [2023-02-15 10:18:18,679 INFO L187 NwaCegarLoop]: Found error trace [2023-02-15 10:18:18,679 INFO L195 NwaCegarLoop]: trace histogram [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] [2023-02-15 10:18:18,688 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (11)] Forceful destruction successful, exit code 0 [2023-02-15 10:18:18,887 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 11 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2023-02-15 10:18:18,888 INFO L420 AbstractCegarLoop]: === Iteration 11 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-02-15 10:18:18,888 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2023-02-15 10:18:18,888 INFO L85 PathProgramCache]: Analyzing trace with hash -1822068338, now seen corresponding path program 1 times [2023-02-15 10:18:18,889 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2023-02-15 10:18:18,889 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [744530254] [2023-02-15 10:18:18,889 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-02-15 10:18:18,889 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2023-02-15 10:18:18,889 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2023-02-15 10:18:18,890 INFO L229 MonitoredProcess]: Starting monitored process 12 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2023-02-15 10:18:18,890 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (12)] Waiting until timeout for monitored process [2023-02-15 10:18:18,924 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-15 10:18:18,925 INFO L263 TraceCheckSpWp]: Trace formula consists of 88 conjuncts, 5 conjunts are in the unsatisfiable core [2023-02-15 10:18:18,926 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2023-02-15 10:18:19,041 INFO L134 CoverageAnalysis]: Checked inductivity of 15 backedges. 0 proven. 15 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-02-15 10:18:19,041 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2023-02-15 10:18:19,135 INFO L134 CoverageAnalysis]: Checked inductivity of 15 backedges. 0 proven. 15 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-02-15 10:18:19,135 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2023-02-15 10:18:19,135 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [744530254] [2023-02-15 10:18:19,135 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleMathsat [744530254] provided 0 perfect and 2 imperfect interpolant sequences [2023-02-15 10:18:19,135 INFO L184 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2023-02-15 10:18:19,135 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [6, 6] total 10 [2023-02-15 10:18:19,136 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1033999717] [2023-02-15 10:18:19,136 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2023-02-15 10:18:19,136 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2023-02-15 10:18:19,136 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2023-02-15 10:18:19,136 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2023-02-15 10:18:19,137 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=32, Invalid=58, Unknown=0, NotChecked=0, Total=90 [2023-02-15 10:18:19,137 INFO L87 Difference]: Start difference. First operand 192 states and 263 transitions. Second operand has 10 states, 10 states have (on average 7.8) internal successors, (78), 10 states have internal predecessors, (78), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-02-15 10:18:19,404 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-02-15 10:18:19,405 INFO L93 Difference]: Finished difference Result 592 states and 893 transitions. [2023-02-15 10:18:19,405 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2023-02-15 10:18:19,405 INFO L78 Accepts]: Start accepts. Automaton has has 10 states, 10 states have (on average 7.8) internal successors, (78), 10 states have internal predecessors, (78), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 44 [2023-02-15 10:18:19,405 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-02-15 10:18:19,407 INFO L225 Difference]: With dead ends: 592 [2023-02-15 10:18:19,407 INFO L226 Difference]: Without dead ends: 417 [2023-02-15 10:18:19,407 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 89 GetRequests, 78 SyntacticMatches, 0 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 17 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=61, Invalid=95, Unknown=0, NotChecked=0, Total=156 [2023-02-15 10:18:19,408 INFO L413 NwaCegarLoop]: 23 mSDtfsCounter, 230 mSDsluCounter, 69 mSDsCounter, 0 mSdLazyCounter, 272 mSolverCounterSat, 72 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 230 SdHoareTripleChecker+Valid, 92 SdHoareTripleChecker+Invalid, 344 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 72 IncrementalHoareTripleChecker+Valid, 272 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2023-02-15 10:18:19,408 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [230 Valid, 92 Invalid, 344 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [72 Valid, 272 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2023-02-15 10:18:19,409 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 417 states. [2023-02-15 10:18:19,428 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 417 to 341. [2023-02-15 10:18:19,429 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 341 states, 340 states have (on average 1.3941176470588235) internal successors, (474), 340 states have internal predecessors, (474), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-02-15 10:18:19,430 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 341 states to 341 states and 474 transitions. [2023-02-15 10:18:19,430 INFO L78 Accepts]: Start accepts. Automaton has 341 states and 474 transitions. Word has length 44 [2023-02-15 10:18:19,430 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-02-15 10:18:19,430 INFO L495 AbstractCegarLoop]: Abstraction has 341 states and 474 transitions. [2023-02-15 10:18:19,431 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 10 states have (on average 7.8) internal successors, (78), 10 states have internal predecessors, (78), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-02-15 10:18:19,431 INFO L276 IsEmpty]: Start isEmpty. Operand 341 states and 474 transitions. [2023-02-15 10:18:19,431 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 71 [2023-02-15 10:18:19,432 INFO L187 NwaCegarLoop]: Found error trace [2023-02-15 10:18:19,432 INFO L195 NwaCegarLoop]: trace histogram [4, 4, 4, 3, 3, 3, 3, 3, 3, 3, 3, 3, 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] [2023-02-15 10:18:19,442 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (12)] Forceful destruction successful, exit code 0 [2023-02-15 10:18:19,640 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 12 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2023-02-15 10:18:19,640 INFO L420 AbstractCegarLoop]: === Iteration 12 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-02-15 10:18:19,641 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2023-02-15 10:18:19,641 INFO L85 PathProgramCache]: Analyzing trace with hash 343661932, now seen corresponding path program 1 times [2023-02-15 10:18:19,641 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2023-02-15 10:18:19,641 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [887722747] [2023-02-15 10:18:19,641 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-02-15 10:18:19,642 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2023-02-15 10:18:19,642 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2023-02-15 10:18:19,643 INFO L229 MonitoredProcess]: Starting monitored process 13 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2023-02-15 10:18:19,651 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (13)] Waiting until timeout for monitored process [2023-02-15 10:18:19,695 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-15 10:18:19,697 INFO L263 TraceCheckSpWp]: Trace formula consists of 124 conjuncts, 8 conjunts are in the unsatisfiable core [2023-02-15 10:18:19,699 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2023-02-15 10:18:19,789 INFO L134 CoverageAnalysis]: Checked inductivity of 82 backedges. 66 proven. 9 refuted. 0 times theorem prover too weak. 7 trivial. 0 not checked. [2023-02-15 10:18:19,790 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2023-02-15 10:18:19,848 INFO L134 CoverageAnalysis]: Checked inductivity of 82 backedges. 68 proven. 7 refuted. 0 times theorem prover too weak. 7 trivial. 0 not checked. [2023-02-15 10:18:19,848 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2023-02-15 10:18:19,848 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [887722747] [2023-02-15 10:18:19,848 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleMathsat [887722747] provided 0 perfect and 2 imperfect interpolant sequences [2023-02-15 10:18:19,849 INFO L184 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2023-02-15 10:18:19,849 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [6, 5] total 9 [2023-02-15 10:18:19,849 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2034581251] [2023-02-15 10:18:19,849 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2023-02-15 10:18:19,849 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2023-02-15 10:18:19,849 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2023-02-15 10:18:19,850 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2023-02-15 10:18:19,850 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=21, Invalid=51, Unknown=0, NotChecked=0, Total=72 [2023-02-15 10:18:19,850 INFO L87 Difference]: Start difference. First operand 341 states and 474 transitions. Second operand has 9 states, 9 states have (on average 12.444444444444445) internal successors, (112), 9 states have internal predecessors, (112), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-02-15 10:18:20,039 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-02-15 10:18:20,040 INFO L93 Difference]: Finished difference Result 945 states and 1261 transitions. [2023-02-15 10:18:20,040 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2023-02-15 10:18:20,040 INFO L78 Accepts]: Start accepts. Automaton has has 9 states, 9 states have (on average 12.444444444444445) internal successors, (112), 9 states have internal predecessors, (112), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 70 [2023-02-15 10:18:20,040 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-02-15 10:18:20,042 INFO L225 Difference]: With dead ends: 945 [2023-02-15 10:18:20,043 INFO L226 Difference]: Without dead ends: 621 [2023-02-15 10:18:20,043 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 150 GetRequests, 137 SyntacticMatches, 0 SemanticMatches, 13 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 23 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=70, Invalid=140, Unknown=0, NotChecked=0, Total=210 [2023-02-15 10:18:20,044 INFO L413 NwaCegarLoop]: 87 mSDtfsCounter, 205 mSDsluCounter, 201 mSDsCounter, 0 mSdLazyCounter, 104 mSolverCounterSat, 10 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 205 SdHoareTripleChecker+Valid, 288 SdHoareTripleChecker+Invalid, 114 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 10 IncrementalHoareTripleChecker+Valid, 104 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2023-02-15 10:18:20,044 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [205 Valid, 288 Invalid, 114 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [10 Valid, 104 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2023-02-15 10:18:20,045 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 621 states. [2023-02-15 10:18:20,066 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 621 to 341. [2023-02-15 10:18:20,066 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 341 states, 340 states have (on average 1.3764705882352941) internal successors, (468), 340 states have internal predecessors, (468), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-02-15 10:18:20,067 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 341 states to 341 states and 468 transitions. [2023-02-15 10:18:20,067 INFO L78 Accepts]: Start accepts. Automaton has 341 states and 468 transitions. Word has length 70 [2023-02-15 10:18:20,067 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-02-15 10:18:20,067 INFO L495 AbstractCegarLoop]: Abstraction has 341 states and 468 transitions. [2023-02-15 10:18:20,068 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 9 states have (on average 12.444444444444445) internal successors, (112), 9 states have internal predecessors, (112), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-02-15 10:18:20,068 INFO L276 IsEmpty]: Start isEmpty. Operand 341 states and 468 transitions. [2023-02-15 10:18:20,068 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 71 [2023-02-15 10:18:20,068 INFO L187 NwaCegarLoop]: Found error trace [2023-02-15 10:18:20,069 INFO L195 NwaCegarLoop]: trace histogram [4, 4, 4, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-02-15 10:18:20,084 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (13)] Forceful destruction successful, exit code 0 [2023-02-15 10:18:20,277 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 13 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2023-02-15 10:18:20,277 INFO L420 AbstractCegarLoop]: === Iteration 13 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-02-15 10:18:20,277 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2023-02-15 10:18:20,278 INFO L85 PathProgramCache]: Analyzing trace with hash 484210542, now seen corresponding path program 2 times [2023-02-15 10:18:20,278 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2023-02-15 10:18:20,278 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [495293927] [2023-02-15 10:18:20,278 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2023-02-15 10:18:20,278 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2023-02-15 10:18:20,278 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2023-02-15 10:18:20,281 INFO L229 MonitoredProcess]: Starting monitored process 14 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2023-02-15 10:18:20,283 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (14)] Waiting until timeout for monitored process [2023-02-15 10:18:20,328 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2023-02-15 10:18:20,328 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2023-02-15 10:18:20,330 INFO L263 TraceCheckSpWp]: Trace formula consists of 122 conjuncts, 41 conjunts are in the unsatisfiable core [2023-02-15 10:18:20,333 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2023-02-15 10:18:22,867 INFO L134 CoverageAnalysis]: Checked inductivity of 82 backedges. 0 proven. 82 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-02-15 10:18:22,867 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2023-02-15 10:18:25,162 INFO L134 CoverageAnalysis]: Checked inductivity of 82 backedges. 0 proven. 82 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-02-15 10:18:25,163 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2023-02-15 10:18:25,163 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [495293927] [2023-02-15 10:18:25,163 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleMathsat [495293927] provided 0 perfect and 2 imperfect interpolant sequences [2023-02-15 10:18:25,163 INFO L184 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2023-02-15 10:18:25,163 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [23, 23] total 44 [2023-02-15 10:18:25,164 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1400951897] [2023-02-15 10:18:25,164 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2023-02-15 10:18:25,164 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 44 states [2023-02-15 10:18:25,164 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2023-02-15 10:18:25,165 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 44 interpolants. [2023-02-15 10:18:25,166 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=142, Invalid=1750, Unknown=0, NotChecked=0, Total=1892 [2023-02-15 10:18:25,166 INFO L87 Difference]: Start difference. First operand 341 states and 468 transitions. Second operand has 44 states, 44 states have (on average 3.1363636363636362) internal successors, (138), 44 states have internal predecessors, (138), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-02-15 10:18:36,684 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-02-15 10:18:36,684 INFO L93 Difference]: Finished difference Result 2188 states and 2902 transitions. [2023-02-15 10:18:36,684 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 74 states. [2023-02-15 10:18:36,685 INFO L78 Accepts]: Start accepts. Automaton has has 44 states, 44 states have (on average 3.1363636363636362) internal successors, (138), 44 states have internal predecessors, (138), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 70 [2023-02-15 10:18:36,685 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-02-15 10:18:36,691 INFO L225 Difference]: With dead ends: 2188 [2023-02-15 10:18:36,692 INFO L226 Difference]: Without dead ends: 1999 [2023-02-15 10:18:36,696 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 209 GetRequests, 96 SyntacticMatches, 0 SemanticMatches, 113 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2481 ImplicationChecksByTransitivity, 10.8s TimeCoverageRelationStatistics Valid=2223, Invalid=10887, Unknown=0, NotChecked=0, Total=13110 [2023-02-15 10:18:36,697 INFO L413 NwaCegarLoop]: 395 mSDtfsCounter, 2582 mSDsluCounter, 6871 mSDsCounter, 0 mSdLazyCounter, 3858 mSolverCounterSat, 138 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 2.8s Time, 0 mProtectedPredicate, 0 mProtectedAction, 2582 SdHoareTripleChecker+Valid, 7266 SdHoareTripleChecker+Invalid, 3996 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 138 IncrementalHoareTripleChecker+Valid, 3858 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 3.1s IncrementalHoareTripleChecker+Time [2023-02-15 10:18:36,697 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [2582 Valid, 7266 Invalid, 3996 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [138 Valid, 3858 Invalid, 0 Unknown, 0 Unchecked, 3.1s Time] [2023-02-15 10:18:36,699 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1999 states. [2023-02-15 10:18:36,767 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1999 to 893. [2023-02-15 10:18:36,768 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 893 states, 892 states have (on average 1.4002242152466369) internal successors, (1249), 892 states have internal predecessors, (1249), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-02-15 10:18:36,770 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 893 states to 893 states and 1249 transitions. [2023-02-15 10:18:36,771 INFO L78 Accepts]: Start accepts. Automaton has 893 states and 1249 transitions. Word has length 70 [2023-02-15 10:18:36,771 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-02-15 10:18:36,771 INFO L495 AbstractCegarLoop]: Abstraction has 893 states and 1249 transitions. [2023-02-15 10:18:36,771 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 44 states, 44 states have (on average 3.1363636363636362) internal successors, (138), 44 states have internal predecessors, (138), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-02-15 10:18:36,771 INFO L276 IsEmpty]: Start isEmpty. Operand 893 states and 1249 transitions. [2023-02-15 10:18:36,772 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 71 [2023-02-15 10:18:36,772 INFO L187 NwaCegarLoop]: Found error trace [2023-02-15 10:18:36,773 INFO L195 NwaCegarLoop]: trace histogram [4, 4, 4, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-02-15 10:18:36,781 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (14)] Forceful destruction successful, exit code 0 [2023-02-15 10:18:36,981 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 14 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2023-02-15 10:18:36,981 INFO L420 AbstractCegarLoop]: === Iteration 14 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-02-15 10:18:36,981 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2023-02-15 10:18:36,981 INFO L85 PathProgramCache]: Analyzing trace with hash -247756884, now seen corresponding path program 1 times [2023-02-15 10:18:36,982 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2023-02-15 10:18:36,982 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [99729193] [2023-02-15 10:18:36,982 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-02-15 10:18:36,982 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2023-02-15 10:18:36,982 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2023-02-15 10:18:36,983 INFO L229 MonitoredProcess]: Starting monitored process 15 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2023-02-15 10:18:36,987 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (15)] Waiting until timeout for monitored process [2023-02-15 10:18:37,026 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-15 10:18:37,028 INFO L263 TraceCheckSpWp]: Trace formula consists of 121 conjuncts, 6 conjunts are in the unsatisfiable core [2023-02-15 10:18:37,029 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2023-02-15 10:18:37,102 INFO L134 CoverageAnalysis]: Checked inductivity of 82 backedges. 45 proven. 0 refuted. 0 times theorem prover too weak. 37 trivial. 0 not checked. [2023-02-15 10:18:37,102 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2023-02-15 10:18:37,102 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2023-02-15 10:18:37,102 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [99729193] [2023-02-15 10:18:37,103 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleMathsat [99729193] provided 1 perfect and 0 imperfect interpolant sequences [2023-02-15 10:18:37,103 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-02-15 10:18:37,103 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2023-02-15 10:18:37,103 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1136983577] [2023-02-15 10:18:37,103 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-02-15 10:18:37,103 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2023-02-15 10:18:37,103 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2023-02-15 10:18:37,104 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2023-02-15 10:18:37,104 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=29, Unknown=0, NotChecked=0, Total=42 [2023-02-15 10:18:37,104 INFO L87 Difference]: Start difference. First operand 893 states and 1249 transitions. Second operand has 7 states, 7 states have (on average 7.428571428571429) internal successors, (52), 7 states have internal predecessors, (52), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-02-15 10:18:37,413 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-02-15 10:18:37,413 INFO L93 Difference]: Finished difference Result 1317 states and 1812 transitions. [2023-02-15 10:18:37,414 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2023-02-15 10:18:37,414 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 7.428571428571429) internal successors, (52), 7 states have internal predecessors, (52), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 70 [2023-02-15 10:18:37,414 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-02-15 10:18:37,417 INFO L225 Difference]: With dead ends: 1317 [2023-02-15 10:18:37,417 INFO L226 Difference]: Without dead ends: 1140 [2023-02-15 10:18:37,418 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 69 GetRequests, 64 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=13, Invalid=29, Unknown=0, NotChecked=0, Total=42 [2023-02-15 10:18:37,418 INFO L413 NwaCegarLoop]: 148 mSDtfsCounter, 173 mSDsluCounter, 349 mSDsCounter, 0 mSdLazyCounter, 373 mSolverCounterSat, 8 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 173 SdHoareTripleChecker+Valid, 497 SdHoareTripleChecker+Invalid, 381 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 8 IncrementalHoareTripleChecker+Valid, 373 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2023-02-15 10:18:37,419 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [173 Valid, 497 Invalid, 381 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [8 Valid, 373 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2023-02-15 10:18:37,420 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1140 states. [2023-02-15 10:18:37,474 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1140 to 740. [2023-02-15 10:18:37,475 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 740 states, 739 states have (on average 1.401894451962111) internal successors, (1036), 739 states have internal predecessors, (1036), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-02-15 10:18:37,477 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 740 states to 740 states and 1036 transitions. [2023-02-15 10:18:37,477 INFO L78 Accepts]: Start accepts. Automaton has 740 states and 1036 transitions. Word has length 70 [2023-02-15 10:18:37,477 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-02-15 10:18:37,478 INFO L495 AbstractCegarLoop]: Abstraction has 740 states and 1036 transitions. [2023-02-15 10:18:37,478 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 7.428571428571429) internal successors, (52), 7 states have internal predecessors, (52), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-02-15 10:18:37,478 INFO L276 IsEmpty]: Start isEmpty. Operand 740 states and 1036 transitions. [2023-02-15 10:18:37,479 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 73 [2023-02-15 10:18:37,479 INFO L187 NwaCegarLoop]: Found error trace [2023-02-15 10:18:37,479 INFO L195 NwaCegarLoop]: trace histogram [4, 4, 4, 3, 3, 3, 3, 3, 3, 3, 3, 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] [2023-02-15 10:18:37,489 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (15)] Forceful destruction successful, exit code 0 [2023-02-15 10:18:37,687 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 15 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2023-02-15 10:18:37,687 INFO L420 AbstractCegarLoop]: === Iteration 15 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-02-15 10:18:37,688 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2023-02-15 10:18:37,688 INFO L85 PathProgramCache]: Analyzing trace with hash 946149333, now seen corresponding path program 1 times [2023-02-15 10:18:37,688 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2023-02-15 10:18:37,688 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [508046051] [2023-02-15 10:18:37,688 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-02-15 10:18:37,689 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2023-02-15 10:18:37,689 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2023-02-15 10:18:37,690 INFO L229 MonitoredProcess]: Starting monitored process 16 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2023-02-15 10:18:37,693 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (16)] Waiting until timeout for monitored process [2023-02-15 10:18:37,726 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-15 10:18:37,727 INFO L263 TraceCheckSpWp]: Trace formula consists of 124 conjuncts, 5 conjunts are in the unsatisfiable core [2023-02-15 10:18:37,728 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2023-02-15 10:18:37,901 INFO L134 CoverageAnalysis]: Checked inductivity of 86 backedges. 63 proven. 11 refuted. 0 times theorem prover too weak. 12 trivial. 0 not checked. [2023-02-15 10:18:37,902 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2023-02-15 10:18:38,022 INFO L134 CoverageAnalysis]: Checked inductivity of 86 backedges. 53 proven. 21 refuted. 0 times theorem prover too weak. 12 trivial. 0 not checked. [2023-02-15 10:18:38,022 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2023-02-15 10:18:38,022 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [508046051] [2023-02-15 10:18:38,023 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleMathsat [508046051] provided 0 perfect and 2 imperfect interpolant sequences [2023-02-15 10:18:38,023 INFO L184 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2023-02-15 10:18:38,023 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [6, 6] total 10 [2023-02-15 10:18:38,023 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1645141723] [2023-02-15 10:18:38,023 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2023-02-15 10:18:38,024 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2023-02-15 10:18:38,024 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2023-02-15 10:18:38,024 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2023-02-15 10:18:38,024 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=32, Invalid=58, Unknown=0, NotChecked=0, Total=90 [2023-02-15 10:18:38,024 INFO L87 Difference]: Start difference. First operand 740 states and 1036 transitions. Second operand has 10 states, 10 states have (on average 10.6) internal successors, (106), 10 states have internal predecessors, (106), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-02-15 10:18:38,761 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-02-15 10:18:38,762 INFO L93 Difference]: Finished difference Result 2675 states and 3771 transitions. [2023-02-15 10:18:38,762 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2023-02-15 10:18:38,762 INFO L78 Accepts]: Start accepts. Automaton has has 10 states, 10 states have (on average 10.6) internal successors, (106), 10 states have internal predecessors, (106), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 72 [2023-02-15 10:18:38,762 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-02-15 10:18:38,768 INFO L225 Difference]: With dead ends: 2675 [2023-02-15 10:18:38,768 INFO L226 Difference]: Without dead ends: 1952 [2023-02-15 10:18:38,770 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 148 GetRequests, 134 SyntacticMatches, 0 SemanticMatches, 14 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 35 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=93, Invalid=147, Unknown=0, NotChecked=0, Total=240 [2023-02-15 10:18:38,770 INFO L413 NwaCegarLoop]: 63 mSDtfsCounter, 279 mSDsluCounter, 134 mSDsCounter, 0 mSdLazyCounter, 652 mSolverCounterSat, 73 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 279 SdHoareTripleChecker+Valid, 197 SdHoareTripleChecker+Invalid, 725 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 73 IncrementalHoareTripleChecker+Valid, 652 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.5s IncrementalHoareTripleChecker+Time [2023-02-15 10:18:38,770 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [279 Valid, 197 Invalid, 725 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [73 Valid, 652 Invalid, 0 Unknown, 0 Unchecked, 0.5s Time] [2023-02-15 10:18:38,772 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1952 states. [2023-02-15 10:18:38,886 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1952 to 1532. [2023-02-15 10:18:38,888 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1532 states, 1531 states have (on average 1.4225996080992815) internal successors, (2178), 1531 states have internal predecessors, (2178), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-02-15 10:18:38,891 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1532 states to 1532 states and 2178 transitions. [2023-02-15 10:18:38,891 INFO L78 Accepts]: Start accepts. Automaton has 1532 states and 2178 transitions. Word has length 72 [2023-02-15 10:18:38,892 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-02-15 10:18:38,892 INFO L495 AbstractCegarLoop]: Abstraction has 1532 states and 2178 transitions. [2023-02-15 10:18:38,892 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 10 states have (on average 10.6) internal successors, (106), 10 states have internal predecessors, (106), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-02-15 10:18:38,892 INFO L276 IsEmpty]: Start isEmpty. Operand 1532 states and 2178 transitions. [2023-02-15 10:18:38,898 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 75 [2023-02-15 10:18:38,898 INFO L187 NwaCegarLoop]: Found error trace [2023-02-15 10:18:38,898 INFO L195 NwaCegarLoop]: trace histogram [4, 4, 4, 3, 3, 3, 3, 3, 3, 3, 3, 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] [2023-02-15 10:18:38,911 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (16)] Forceful destruction successful, exit code 0 [2023-02-15 10:18:39,107 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 16 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2023-02-15 10:18:39,107 INFO L420 AbstractCegarLoop]: === Iteration 16 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-02-15 10:18:39,107 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2023-02-15 10:18:39,107 INFO L85 PathProgramCache]: Analyzing trace with hash -1135042114, now seen corresponding path program 1 times [2023-02-15 10:18:39,108 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2023-02-15 10:18:39,108 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [329361339] [2023-02-15 10:18:39,108 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-02-15 10:18:39,108 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2023-02-15 10:18:39,108 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2023-02-15 10:18:39,109 INFO L229 MonitoredProcess]: Starting monitored process 17 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2023-02-15 10:18:39,109 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (17)] Waiting until timeout for monitored process [2023-02-15 10:18:39,150 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-15 10:18:39,152 INFO L263 TraceCheckSpWp]: Trace formula consists of 128 conjuncts, 43 conjunts are in the unsatisfiable core [2023-02-15 10:18:39,154 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2023-02-15 10:18:41,594 INFO L134 CoverageAnalysis]: Checked inductivity of 86 backedges. 0 proven. 86 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-02-15 10:18:41,594 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2023-02-15 10:18:44,177 INFO L134 CoverageAnalysis]: Checked inductivity of 86 backedges. 0 proven. 86 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-02-15 10:18:44,178 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2023-02-15 10:18:44,178 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [329361339] [2023-02-15 10:18:44,178 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleMathsat [329361339] provided 0 perfect and 2 imperfect interpolant sequences [2023-02-15 10:18:44,178 INFO L184 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2023-02-15 10:18:44,178 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [24, 24] total 46 [2023-02-15 10:18:44,178 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1978166415] [2023-02-15 10:18:44,178 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2023-02-15 10:18:44,179 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 46 states [2023-02-15 10:18:44,179 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2023-02-15 10:18:44,179 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 46 interpolants. [2023-02-15 10:18:44,180 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=149, Invalid=1921, Unknown=0, NotChecked=0, Total=2070 [2023-02-15 10:18:44,180 INFO L87 Difference]: Start difference. First operand 1532 states and 2178 transitions. Second operand has 46 states, 46 states have (on average 3.1739130434782608) internal successors, (146), 46 states have internal predecessors, (146), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-02-15 10:19:27,208 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-02-15 10:19:27,208 INFO L93 Difference]: Finished difference Result 8647 states and 11483 transitions. [2023-02-15 10:19:27,209 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 200 states. [2023-02-15 10:19:27,209 INFO L78 Accepts]: Start accepts. Automaton has has 46 states, 46 states have (on average 3.1739130434782608) internal successors, (146), 46 states have internal predecessors, (146), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 74 [2023-02-15 10:19:27,209 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-02-15 10:19:27,229 INFO L225 Difference]: With dead ends: 8647 [2023-02-15 10:19:27,229 INFO L226 Difference]: Without dead ends: 7760 [2023-02-15 10:19:27,242 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 343 GetRequests, 102 SyntacticMatches, 0 SemanticMatches, 241 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 18480 ImplicationChecksByTransitivity, 37.6s TimeCoverageRelationStatistics Valid=7680, Invalid=51126, Unknown=0, NotChecked=0, Total=58806 [2023-02-15 10:19:27,242 INFO L413 NwaCegarLoop]: 717 mSDtfsCounter, 2986 mSDsluCounter, 15452 mSDsCounter, 0 mSdLazyCounter, 9091 mSolverCounterSat, 314 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 6.6s Time, 0 mProtectedPredicate, 0 mProtectedAction, 2986 SdHoareTripleChecker+Valid, 16169 SdHoareTripleChecker+Invalid, 9405 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.1s SdHoareTripleChecker+Time, 314 IncrementalHoareTripleChecker+Valid, 9091 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 7.3s IncrementalHoareTripleChecker+Time [2023-02-15 10:19:27,242 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [2986 Valid, 16169 Invalid, 9405 Unknown, 0 Unchecked, 0.1s Time], IncrementalHoareTripleChecker [314 Valid, 9091 Invalid, 0 Unknown, 0 Unchecked, 7.3s Time] [2023-02-15 10:19:27,248 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 7760 states. [2023-02-15 10:19:27,571 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 7760 to 4199. [2023-02-15 10:19:27,576 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 4199 states, 4198 states have (on average 1.4204383039542638) internal successors, (5963), 4198 states have internal predecessors, (5963), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-02-15 10:19:27,584 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4199 states to 4199 states and 5963 transitions. [2023-02-15 10:19:27,585 INFO L78 Accepts]: Start accepts. Automaton has 4199 states and 5963 transitions. Word has length 74 [2023-02-15 10:19:27,585 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-02-15 10:19:27,585 INFO L495 AbstractCegarLoop]: Abstraction has 4199 states and 5963 transitions. [2023-02-15 10:19:27,585 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 46 states, 46 states have (on average 3.1739130434782608) internal successors, (146), 46 states have internal predecessors, (146), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-02-15 10:19:27,586 INFO L276 IsEmpty]: Start isEmpty. Operand 4199 states and 5963 transitions. [2023-02-15 10:19:27,589 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 75 [2023-02-15 10:19:27,590 INFO L187 NwaCegarLoop]: Found error trace [2023-02-15 10:19:27,590 INFO L195 NwaCegarLoop]: trace histogram [4, 4, 4, 4, 3, 3, 3, 3, 3, 3, 3, 3, 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] [2023-02-15 10:19:27,599 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (17)] Forceful destruction successful, exit code 0 [2023-02-15 10:19:27,799 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 17 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2023-02-15 10:19:27,799 INFO L420 AbstractCegarLoop]: === Iteration 17 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-02-15 10:19:27,800 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2023-02-15 10:19:27,800 INFO L85 PathProgramCache]: Analyzing trace with hash -777616002, now seen corresponding path program 1 times [2023-02-15 10:19:27,800 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2023-02-15 10:19:27,800 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [354329345] [2023-02-15 10:19:27,800 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-02-15 10:19:27,800 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2023-02-15 10:19:27,800 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2023-02-15 10:19:27,801 INFO L229 MonitoredProcess]: Starting monitored process 18 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2023-02-15 10:19:27,802 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (18)] Waiting until timeout for monitored process [2023-02-15 10:19:27,839 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-15 10:19:27,841 INFO L263 TraceCheckSpWp]: Trace formula consists of 124 conjuncts, 41 conjunts are in the unsatisfiable core [2023-02-15 10:19:27,843 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2023-02-15 10:19:30,187 INFO L134 CoverageAnalysis]: Checked inductivity of 86 backedges. 0 proven. 86 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-02-15 10:19:30,187 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2023-02-15 10:19:32,456 INFO L134 CoverageAnalysis]: Checked inductivity of 86 backedges. 0 proven. 86 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-02-15 10:19:32,456 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2023-02-15 10:19:32,456 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [354329345] [2023-02-15 10:19:32,456 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleMathsat [354329345] provided 0 perfect and 2 imperfect interpolant sequences [2023-02-15 10:19:32,456 INFO L184 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2023-02-15 10:19:32,457 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [24, 24] total 46 [2023-02-15 10:19:32,457 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [665408132] [2023-02-15 10:19:32,457 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2023-02-15 10:19:32,457 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 46 states [2023-02-15 10:19:32,458 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2023-02-15 10:19:32,458 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 46 interpolants. [2023-02-15 10:19:32,458 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=137, Invalid=1933, Unknown=0, NotChecked=0, Total=2070 [2023-02-15 10:19:32,459 INFO L87 Difference]: Start difference. First operand 4199 states and 5963 transitions. Second operand has 46 states, 46 states have (on average 3.1739130434782608) internal successors, (146), 46 states have internal predecessors, (146), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-02-15 10:19:53,941 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-02-15 10:19:53,941 INFO L93 Difference]: Finished difference Result 10135 states and 13775 transitions. [2023-02-15 10:19:53,942 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 104 states. [2023-02-15 10:19:53,943 INFO L78 Accepts]: Start accepts. Automaton has has 46 states, 46 states have (on average 3.1739130434782608) internal successors, (146), 46 states have internal predecessors, (146), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 74 [2023-02-15 10:19:53,943 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-02-15 10:19:53,963 INFO L225 Difference]: With dead ends: 10135 [2023-02-15 10:19:53,964 INFO L226 Difference]: Without dead ends: 8300 [2023-02-15 10:19:53,967 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 247 GetRequests, 102 SyntacticMatches, 0 SemanticMatches, 145 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5270 ImplicationChecksByTransitivity, 18.3s TimeCoverageRelationStatistics Valid=2685, Invalid=18777, Unknown=0, NotChecked=0, Total=21462 [2023-02-15 10:19:53,968 INFO L413 NwaCegarLoop]: 486 mSDtfsCounter, 1654 mSDsluCounter, 9368 mSDsCounter, 0 mSdLazyCounter, 5411 mSolverCounterSat, 109 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 4.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1654 SdHoareTripleChecker+Valid, 9854 SdHoareTripleChecker+Invalid, 5520 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 109 IncrementalHoareTripleChecker+Valid, 5411 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 4.9s IncrementalHoareTripleChecker+Time [2023-02-15 10:19:53,968 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [1654 Valid, 9854 Invalid, 5520 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [109 Valid, 5411 Invalid, 0 Unknown, 0 Unchecked, 4.9s Time] [2023-02-15 10:19:53,973 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 8300 states. [2023-02-15 10:19:54,354 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 8300 to 4683. [2023-02-15 10:19:54,362 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 4683 states, 4682 states have (on average 1.4235369500213584) internal successors, (6665), 4682 states have internal predecessors, (6665), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-02-15 10:19:54,371 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4683 states to 4683 states and 6665 transitions. [2023-02-15 10:19:54,371 INFO L78 Accepts]: Start accepts. Automaton has 4683 states and 6665 transitions. Word has length 74 [2023-02-15 10:19:54,372 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-02-15 10:19:54,372 INFO L495 AbstractCegarLoop]: Abstraction has 4683 states and 6665 transitions. [2023-02-15 10:19:54,372 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 46 states, 46 states have (on average 3.1739130434782608) internal successors, (146), 46 states have internal predecessors, (146), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-02-15 10:19:54,372 INFO L276 IsEmpty]: Start isEmpty. Operand 4683 states and 6665 transitions. [2023-02-15 10:19:54,376 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 77 [2023-02-15 10:19:54,377 INFO L187 NwaCegarLoop]: Found error trace [2023-02-15 10:19:54,377 INFO L195 NwaCegarLoop]: trace histogram [4, 4, 4, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-02-15 10:19:54,386 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (18)] Forceful destruction successful, exit code 0 [2023-02-15 10:19:54,585 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 18 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2023-02-15 10:19:54,586 INFO L420 AbstractCegarLoop]: === Iteration 18 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-02-15 10:19:54,586 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2023-02-15 10:19:54,586 INFO L85 PathProgramCache]: Analyzing trace with hash -1420916641, now seen corresponding path program 1 times [2023-02-15 10:19:54,586 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2023-02-15 10:19:54,586 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [465104951] [2023-02-15 10:19:54,586 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-02-15 10:19:54,586 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2023-02-15 10:19:54,587 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2023-02-15 10:19:54,587 INFO L229 MonitoredProcess]: Starting monitored process 19 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2023-02-15 10:19:54,588 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (19)] Waiting until timeout for monitored process [2023-02-15 10:19:54,624 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-15 10:19:54,626 INFO L263 TraceCheckSpWp]: Trace formula consists of 129 conjuncts, 6 conjunts are in the unsatisfiable core [2023-02-15 10:19:54,626 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2023-02-15 10:19:54,808 INFO L134 CoverageAnalysis]: Checked inductivity of 83 backedges. 14 proven. 69 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-02-15 10:19:54,808 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2023-02-15 10:19:54,910 INFO L134 CoverageAnalysis]: Checked inductivity of 83 backedges. 14 proven. 69 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-02-15 10:19:54,910 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2023-02-15 10:19:54,910 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [465104951] [2023-02-15 10:19:54,910 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleMathsat [465104951] provided 0 perfect and 2 imperfect interpolant sequences [2023-02-15 10:19:54,910 INFO L184 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2023-02-15 10:19:54,911 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 7] total 12 [2023-02-15 10:19:54,911 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2055944143] [2023-02-15 10:19:54,911 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2023-02-15 10:19:54,911 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 12 states [2023-02-15 10:19:54,911 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2023-02-15 10:19:54,912 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2023-02-15 10:19:54,912 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=36, Invalid=96, Unknown=0, NotChecked=0, Total=132 [2023-02-15 10:19:54,912 INFO L87 Difference]: Start difference. First operand 4683 states and 6665 transitions. Second operand has 12 states, 12 states have (on average 10.583333333333334) internal successors, (127), 12 states have internal predecessors, (127), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-02-15 10:19:56,209 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-02-15 10:19:56,209 INFO L93 Difference]: Finished difference Result 18051 states and 27684 transitions. [2023-02-15 10:19:56,210 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 16 states. [2023-02-15 10:19:56,210 INFO L78 Accepts]: Start accepts. Automaton has has 12 states, 12 states have (on average 10.583333333333334) internal successors, (127), 12 states have internal predecessors, (127), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 76 [2023-02-15 10:19:56,210 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-02-15 10:19:56,232 INFO L225 Difference]: With dead ends: 18051 [2023-02-15 10:19:56,232 INFO L226 Difference]: Without dead ends: 9100 [2023-02-15 10:19:56,240 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 161 GetRequests, 144 SyntacticMatches, 0 SemanticMatches, 17 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 18 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=98, Invalid=244, Unknown=0, NotChecked=0, Total=342 [2023-02-15 10:19:56,241 INFO L413 NwaCegarLoop]: 25 mSDtfsCounter, 417 mSDsluCounter, 148 mSDsCounter, 0 mSdLazyCounter, 742 mSolverCounterSat, 119 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 417 SdHoareTripleChecker+Valid, 173 SdHoareTripleChecker+Invalid, 861 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 119 IncrementalHoareTripleChecker+Valid, 742 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.5s IncrementalHoareTripleChecker+Time [2023-02-15 10:19:56,241 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [417 Valid, 173 Invalid, 861 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [119 Valid, 742 Invalid, 0 Unknown, 0 Unchecked, 0.5s Time] [2023-02-15 10:19:56,248 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 9100 states. [2023-02-15 10:19:56,759 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 9100 to 6200. [2023-02-15 10:19:56,765 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 6200 states, 6199 states have (on average 1.2282626230037104) internal successors, (7614), 6199 states have internal predecessors, (7614), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-02-15 10:19:56,775 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6200 states to 6200 states and 7614 transitions. [2023-02-15 10:19:56,775 INFO L78 Accepts]: Start accepts. Automaton has 6200 states and 7614 transitions. Word has length 76 [2023-02-15 10:19:56,775 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-02-15 10:19:56,776 INFO L495 AbstractCegarLoop]: Abstraction has 6200 states and 7614 transitions. [2023-02-15 10:19:56,776 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 12 states, 12 states have (on average 10.583333333333334) internal successors, (127), 12 states have internal predecessors, (127), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-02-15 10:19:56,776 INFO L276 IsEmpty]: Start isEmpty. Operand 6200 states and 7614 transitions. [2023-02-15 10:19:56,778 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 78 [2023-02-15 10:19:56,778 INFO L187 NwaCegarLoop]: Found error trace [2023-02-15 10:19:56,778 INFO L195 NwaCegarLoop]: trace histogram [4, 4, 4, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 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] [2023-02-15 10:19:56,791 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (19)] Ended with exit code 0 [2023-02-15 10:19:56,991 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 19 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2023-02-15 10:19:56,991 INFO L420 AbstractCegarLoop]: === Iteration 19 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-02-15 10:19:56,991 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2023-02-15 10:19:56,992 INFO L85 PathProgramCache]: Analyzing trace with hash 881251465, now seen corresponding path program 1 times [2023-02-15 10:19:56,992 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2023-02-15 10:19:56,992 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [868847201] [2023-02-15 10:19:56,992 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-02-15 10:19:56,992 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2023-02-15 10:19:56,992 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2023-02-15 10:19:56,993 INFO L229 MonitoredProcess]: Starting monitored process 20 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2023-02-15 10:19:56,996 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (20)] Waiting until timeout for monitored process [2023-02-15 10:19:57,029 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-15 10:19:57,031 INFO L263 TraceCheckSpWp]: Trace formula consists of 133 conjuncts, 46 conjunts are in the unsatisfiable core [2023-02-15 10:19:57,032 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2023-02-15 10:20:00,119 INFO L134 CoverageAnalysis]: Checked inductivity of 94 backedges. 0 proven. 94 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-02-15 10:20:00,119 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2023-02-15 10:20:03,701 INFO L134 CoverageAnalysis]: Checked inductivity of 94 backedges. 0 proven. 94 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-02-15 10:20:03,701 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2023-02-15 10:20:03,701 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [868847201] [2023-02-15 10:20:03,701 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleMathsat [868847201] provided 0 perfect and 2 imperfect interpolant sequences [2023-02-15 10:20:03,701 INFO L184 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2023-02-15 10:20:03,701 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [26, 26] total 50 [2023-02-15 10:20:03,702 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1772884573] [2023-02-15 10:20:03,702 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2023-02-15 10:20:03,702 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 50 states [2023-02-15 10:20:03,702 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2023-02-15 10:20:03,703 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 50 interpolants. [2023-02-15 10:20:03,703 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=173, Invalid=2277, Unknown=0, NotChecked=0, Total=2450 [2023-02-15 10:20:03,703 INFO L87 Difference]: Start difference. First operand 6200 states and 7614 transitions. Second operand has 50 states, 50 states have (on average 3.04) internal successors, (152), 50 states have internal predecessors, (152), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-02-15 10:20:39,226 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-02-15 10:20:39,226 INFO L93 Difference]: Finished difference Result 7925 states and 9591 transitions. [2023-02-15 10:20:39,227 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 143 states. [2023-02-15 10:20:39,227 INFO L78 Accepts]: Start accepts. Automaton has has 50 states, 50 states have (on average 3.04) internal successors, (152), 50 states have internal predecessors, (152), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 77 [2023-02-15 10:20:39,227 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-02-15 10:20:39,237 INFO L225 Difference]: With dead ends: 7925 [2023-02-15 10:20:39,237 INFO L226 Difference]: Without dead ends: 7682 [2023-02-15 10:20:39,240 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 292 GetRequests, 104 SyntacticMatches, 0 SemanticMatches, 188 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 9565 ImplicationChecksByTransitivity, 33.8s TimeCoverageRelationStatistics Valid=4344, Invalid=31566, Unknown=0, NotChecked=0, Total=35910 [2023-02-15 10:20:39,240 INFO L413 NwaCegarLoop]: 282 mSDtfsCounter, 2724 mSDsluCounter, 7757 mSDsCounter, 0 mSdLazyCounter, 4485 mSolverCounterSat, 232 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 4.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 2724 SdHoareTripleChecker+Valid, 8039 SdHoareTripleChecker+Invalid, 4717 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 232 IncrementalHoareTripleChecker+Valid, 4485 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 4.8s IncrementalHoareTripleChecker+Time [2023-02-15 10:20:39,240 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [2724 Valid, 8039 Invalid, 4717 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [232 Valid, 4485 Invalid, 0 Unknown, 0 Unchecked, 4.8s Time] [2023-02-15 10:20:39,245 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 7682 states. [2023-02-15 10:20:39,804 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 7682 to 6826. [2023-02-15 10:20:39,810 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 6826 states, 6825 states have (on average 1.2246153846153847) internal successors, (8358), 6825 states have internal predecessors, (8358), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-02-15 10:20:39,837 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6826 states to 6826 states and 8358 transitions. [2023-02-15 10:20:39,837 INFO L78 Accepts]: Start accepts. Automaton has 6826 states and 8358 transitions. Word has length 77 [2023-02-15 10:20:39,838 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-02-15 10:20:39,838 INFO L495 AbstractCegarLoop]: Abstraction has 6826 states and 8358 transitions. [2023-02-15 10:20:39,838 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 50 states, 50 states have (on average 3.04) internal successors, (152), 50 states have internal predecessors, (152), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-02-15 10:20:39,838 INFO L276 IsEmpty]: Start isEmpty. Operand 6826 states and 8358 transitions. [2023-02-15 10:20:39,839 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 78 [2023-02-15 10:20:39,839 INFO L187 NwaCegarLoop]: Found error trace [2023-02-15 10:20:39,840 INFO L195 NwaCegarLoop]: trace histogram [4, 4, 4, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 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] [2023-02-15 10:20:39,846 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (20)] Forceful destruction successful, exit code 0 [2023-02-15 10:20:40,040 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 20 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2023-02-15 10:20:40,040 INFO L420 AbstractCegarLoop]: === Iteration 20 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-02-15 10:20:40,040 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2023-02-15 10:20:40,041 INFO L85 PathProgramCache]: Analyzing trace with hash 1269946569, now seen corresponding path program 2 times [2023-02-15 10:20:40,041 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2023-02-15 10:20:40,041 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1247619678] [2023-02-15 10:20:40,041 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2023-02-15 10:20:40,041 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2023-02-15 10:20:40,041 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2023-02-15 10:20:40,042 INFO L229 MonitoredProcess]: Starting monitored process 21 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2023-02-15 10:20:40,044 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (21)] Waiting until timeout for monitored process [2023-02-15 10:20:40,079 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2023-02-15 10:20:40,080 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2023-02-15 10:20:40,081 INFO L263 TraceCheckSpWp]: Trace formula consists of 129 conjuncts, 44 conjunts are in the unsatisfiable core [2023-02-15 10:20:40,082 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2023-02-15 10:20:43,277 INFO L134 CoverageAnalysis]: Checked inductivity of 94 backedges. 0 proven. 94 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-02-15 10:20:43,277 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2023-02-15 10:20:46,321 INFO L134 CoverageAnalysis]: Checked inductivity of 94 backedges. 0 proven. 94 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-02-15 10:20:46,321 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2023-02-15 10:20:46,321 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1247619678] [2023-02-15 10:20:46,321 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1247619678] provided 0 perfect and 2 imperfect interpolant sequences [2023-02-15 10:20:46,321 INFO L184 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2023-02-15 10:20:46,321 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [26, 26] total 50 [2023-02-15 10:20:46,321 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1833445792] [2023-02-15 10:20:46,321 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2023-02-15 10:20:46,322 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 50 states [2023-02-15 10:20:46,322 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2023-02-15 10:20:46,322 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 50 interpolants. [2023-02-15 10:20:46,323 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=183, Invalid=2267, Unknown=0, NotChecked=0, Total=2450 [2023-02-15 10:20:46,323 INFO L87 Difference]: Start difference. First operand 6826 states and 8358 transitions. Second operand has 50 states, 50 states have (on average 3.04) internal successors, (152), 50 states have internal predecessors, (152), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-02-15 10:21:51,516 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-02-15 10:21:51,517 INFO L93 Difference]: Finished difference Result 10719 states and 12903 transitions. [2023-02-15 10:21:51,517 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 224 states. [2023-02-15 10:21:51,517 INFO L78 Accepts]: Start accepts. Automaton has has 50 states, 50 states have (on average 3.04) internal successors, (152), 50 states have internal predecessors, (152), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 77 [2023-02-15 10:21:51,518 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-02-15 10:21:51,533 INFO L225 Difference]: With dead ends: 10719 [2023-02-15 10:21:51,533 INFO L226 Difference]: Without dead ends: 9845 [2023-02-15 10:21:51,539 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 373 GetRequests, 104 SyntacticMatches, 0 SemanticMatches, 269 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 24583 ImplicationChecksByTransitivity, 60.9s TimeCoverageRelationStatistics Valid=8391, Invalid=64779, Unknown=0, NotChecked=0, Total=73170 [2023-02-15 10:21:51,540 INFO L413 NwaCegarLoop]: 465 mSDtfsCounter, 3034 mSDsluCounter, 10628 mSDsCounter, 0 mSdLazyCounter, 5848 mSolverCounterSat, 329 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 5.7s Time, 0 mProtectedPredicate, 0 mProtectedAction, 3034 SdHoareTripleChecker+Valid, 11093 SdHoareTripleChecker+Invalid, 6177 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 329 IncrementalHoareTripleChecker+Valid, 5848 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 6.3s IncrementalHoareTripleChecker+Time [2023-02-15 10:21:51,540 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [3034 Valid, 11093 Invalid, 6177 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [329 Valid, 5848 Invalid, 0 Unknown, 0 Unchecked, 6.3s Time] [2023-02-15 10:21:51,547 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 9845 states. [2023-02-15 10:21:52,332 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 9845 to 8035. [2023-02-15 10:21:52,339 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 8035 states, 8034 states have (on average 1.2230520288772715) internal successors, (9826), 8034 states have internal predecessors, (9826), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-02-15 10:21:52,348 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8035 states to 8035 states and 9826 transitions. [2023-02-15 10:21:52,348 INFO L78 Accepts]: Start accepts. Automaton has 8035 states and 9826 transitions. Word has length 77 [2023-02-15 10:21:52,348 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-02-15 10:21:52,349 INFO L495 AbstractCegarLoop]: Abstraction has 8035 states and 9826 transitions. [2023-02-15 10:21:52,349 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 50 states, 50 states have (on average 3.04) internal successors, (152), 50 states have internal predecessors, (152), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-02-15 10:21:52,349 INFO L276 IsEmpty]: Start isEmpty. Operand 8035 states and 9826 transitions. [2023-02-15 10:21:52,350 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 78 [2023-02-15 10:21:52,351 INFO L187 NwaCegarLoop]: Found error trace [2023-02-15 10:21:52,351 INFO L195 NwaCegarLoop]: trace histogram [4, 4, 4, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 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] [2023-02-15 10:21:52,361 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (21)] Forceful destruction successful, exit code 0 [2023-02-15 10:21:52,562 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 21 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2023-02-15 10:21:52,562 INFO L420 AbstractCegarLoop]: === Iteration 21 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-02-15 10:21:52,563 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2023-02-15 10:21:52,563 INFO L85 PathProgramCache]: Analyzing trace with hash 1690097737, now seen corresponding path program 3 times [2023-02-15 10:21:52,563 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2023-02-15 10:21:52,563 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1181623179] [2023-02-15 10:21:52,563 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2023-02-15 10:21:52,564 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2023-02-15 10:21:52,564 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2023-02-15 10:21:52,565 INFO L229 MonitoredProcess]: Starting monitored process 22 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2023-02-15 10:21:52,567 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (22)] Waiting until timeout for monitored process [2023-02-15 10:21:52,620 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 5 check-sat command(s) [2023-02-15 10:21:52,621 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2023-02-15 10:21:52,622 INFO L263 TraceCheckSpWp]: Trace formula consists of 129 conjuncts, 44 conjunts are in the unsatisfiable core [2023-02-15 10:21:52,625 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2023-02-15 10:21:55,692 INFO L134 CoverageAnalysis]: Checked inductivity of 94 backedges. 0 proven. 94 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-02-15 10:21:55,692 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2023-02-15 10:21:58,825 INFO L134 CoverageAnalysis]: Checked inductivity of 94 backedges. 0 proven. 94 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-02-15 10:21:58,826 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2023-02-15 10:21:58,826 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1181623179] [2023-02-15 10:21:58,826 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1181623179] provided 0 perfect and 2 imperfect interpolant sequences [2023-02-15 10:21:58,826 INFO L184 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2023-02-15 10:21:58,826 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [26, 25] total 49 [2023-02-15 10:21:58,826 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [538889026] [2023-02-15 10:21:58,826 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2023-02-15 10:21:58,826 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 49 states [2023-02-15 10:21:58,827 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2023-02-15 10:21:58,827 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 49 interpolants. [2023-02-15 10:21:58,827 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=155, Invalid=2197, Unknown=0, NotChecked=0, Total=2352 [2023-02-15 10:21:58,828 INFO L87 Difference]: Start difference. First operand 8035 states and 9826 transitions. Second operand has 49 states, 49 states have (on average 3.1020408163265305) internal successors, (152), 49 states have internal predecessors, (152), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)