./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 b5317dae 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-?-b5317da-m [2023-02-16 00:38:50,003 INFO L177 SettingsManager]: Resetting all preferences to default values... [2023-02-16 00:38:50,004 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2023-02-16 00:38:50,024 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2023-02-16 00:38:50,024 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2023-02-16 00:38:50,025 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2023-02-16 00:38:50,026 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2023-02-16 00:38:50,027 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2023-02-16 00:38:50,028 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2023-02-16 00:38:50,028 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2023-02-16 00:38:50,029 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2023-02-16 00:38:50,030 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2023-02-16 00:38:50,030 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2023-02-16 00:38:50,031 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2023-02-16 00:38:50,031 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2023-02-16 00:38:50,032 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2023-02-16 00:38:50,033 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2023-02-16 00:38:50,033 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2023-02-16 00:38:50,034 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2023-02-16 00:38:50,035 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2023-02-16 00:38:50,036 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2023-02-16 00:38:50,037 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2023-02-16 00:38:50,038 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2023-02-16 00:38:50,038 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2023-02-16 00:38:50,040 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2023-02-16 00:38:50,041 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2023-02-16 00:38:50,041 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2023-02-16 00:38:50,041 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2023-02-16 00:38:50,042 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2023-02-16 00:38:50,042 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2023-02-16 00:38:50,043 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2023-02-16 00:38:50,043 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2023-02-16 00:38:50,044 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2023-02-16 00:38:50,044 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2023-02-16 00:38:50,045 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2023-02-16 00:38:50,045 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2023-02-16 00:38:50,045 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2023-02-16 00:38:50,046 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2023-02-16 00:38:50,046 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2023-02-16 00:38:50,047 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2023-02-16 00:38:50,047 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2023-02-16 00:38:50,048 INFO L101 SettingsManager]: Beginning loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Default.epf [2023-02-16 00:38:50,061 INFO L113 SettingsManager]: Loading preferences was successful [2023-02-16 00:38:50,061 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2023-02-16 00:38:50,062 INFO L136 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2023-02-16 00:38:50,062 INFO L138 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2023-02-16 00:38:50,062 INFO L136 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2023-02-16 00:38:50,062 INFO L138 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2023-02-16 00:38:50,063 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2023-02-16 00:38:50,063 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2023-02-16 00:38:50,063 INFO L138 SettingsManager]: * Use SBE=true [2023-02-16 00:38:50,063 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2023-02-16 00:38:50,063 INFO L138 SettingsManager]: * sizeof long=4 [2023-02-16 00:38:50,064 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2023-02-16 00:38:50,064 INFO L138 SettingsManager]: * sizeof POINTER=4 [2023-02-16 00:38:50,064 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2023-02-16 00:38:50,064 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2023-02-16 00:38:50,064 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2023-02-16 00:38:50,064 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2023-02-16 00:38:50,064 INFO L138 SettingsManager]: * sizeof long double=12 [2023-02-16 00:38:50,065 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2023-02-16 00:38:50,065 INFO L138 SettingsManager]: * Use constant arrays=true [2023-02-16 00:38:50,065 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2023-02-16 00:38:50,065 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2023-02-16 00:38:50,065 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2023-02-16 00:38:50,065 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2023-02-16 00:38:50,065 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2023-02-16 00:38:50,066 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2023-02-16 00:38:50,066 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2023-02-16 00:38:50,066 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2023-02-16 00:38:50,066 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2023-02-16 00:38:50,066 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2023-02-16 00:38:50,066 INFO L138 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2023-02-16 00:38:50,066 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2023-02-16 00:38:50,067 INFO L138 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2023-02-16 00:38:50,067 INFO L138 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2023-02-16 00:38:50,067 INFO L138 SettingsManager]: * Independence relation used for large block encoding in concurrent analysis=SYNTACTIC [2023-02-16 00:38:50,067 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-16 00:38:50,255 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2023-02-16 00:38:50,273 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2023-02-16 00:38:50,275 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2023-02-16 00:38:50,276 INFO L271 PluginConnector]: Initializing CDTParser... [2023-02-16 00:38:50,276 INFO L275 PluginConnector]: CDTParser initialized [2023-02-16 00:38:50,277 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-16 00:38:51,213 INFO L500 CDTParser]: Created temporary CDT project at NULL [2023-02-16 00:38:51,348 INFO L351 CDTParser]: Found 1 translation units. [2023-02-16 00:38:51,349 INFO L172 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/bitvector/byte_add_2-2.i [2023-02-16 00:38:51,353 INFO L394 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/ebcbe1df8/4d9d1687b6524597b9cff79b9d7d5f65/FLAG5978357c6 [2023-02-16 00:38:51,361 INFO L402 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/ebcbe1df8/4d9d1687b6524597b9cff79b9d7d5f65 [2023-02-16 00:38:51,363 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2023-02-16 00:38:51,364 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2023-02-16 00:38:51,364 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2023-02-16 00:38:51,364 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2023-02-16 00:38:51,366 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2023-02-16 00:38:51,367 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 16.02 12:38:51" (1/1) ... [2023-02-16 00:38:51,367 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@56acf6fc and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.02 12:38:51, skipping insertion in model container [2023-02-16 00:38:51,369 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 16.02 12:38:51" (1/1) ... [2023-02-16 00:38:51,373 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2023-02-16 00:38:51,385 INFO L178 MainTranslator]: Built tables and reachable declarations [2023-02-16 00:38:51,473 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-16 00:38:51,519 INFO L210 PostProcessor]: Analyzing one entry point: main [2023-02-16 00:38:51,531 INFO L203 MainTranslator]: Completed pre-run [2023-02-16 00:38:51,542 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-16 00:38:51,564 INFO L210 PostProcessor]: Analyzing one entry point: main [2023-02-16 00:38:51,572 INFO L208 MainTranslator]: Completed translation [2023-02-16 00:38:51,573 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.02 12:38:51 WrapperNode [2023-02-16 00:38:51,573 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2023-02-16 00:38:51,574 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2023-02-16 00:38:51,574 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2023-02-16 00:38:51,574 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2023-02-16 00:38:51,578 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.02 12:38:51" (1/1) ... [2023-02-16 00:38:51,590 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.02 12:38:51" (1/1) ... [2023-02-16 00:38:51,613 INFO L138 Inliner]: procedures = 16, calls = 8, calls flagged for inlining = 4, calls inlined = 4, statements flattened = 141 [2023-02-16 00:38:51,613 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2023-02-16 00:38:51,614 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2023-02-16 00:38:51,614 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2023-02-16 00:38:51,614 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2023-02-16 00:38:51,623 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.02 12:38:51" (1/1) ... [2023-02-16 00:38:51,624 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.02 12:38:51" (1/1) ... [2023-02-16 00:38:51,626 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.02 12:38:51" (1/1) ... [2023-02-16 00:38:51,629 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.02 12:38:51" (1/1) ... [2023-02-16 00:38:51,635 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.02 12:38:51" (1/1) ... [2023-02-16 00:38:51,638 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.02 12:38:51" (1/1) ... [2023-02-16 00:38:51,639 INFO L185 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.02 12:38:51" (1/1) ... [2023-02-16 00:38:51,640 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.02 12:38:51" (1/1) ... [2023-02-16 00:38:51,644 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2023-02-16 00:38:51,645 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2023-02-16 00:38:51,645 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2023-02-16 00:38:51,645 INFO L275 PluginConnector]: RCFGBuilder initialized [2023-02-16 00:38:51,646 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.02 12:38:51" (1/1) ... [2023-02-16 00:38:51,650 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2023-02-16 00:38:51,658 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-02-16 00:38:51,667 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-16 00:38:51,674 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-16 00:38:51,694 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2023-02-16 00:38:51,694 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2023-02-16 00:38:51,694 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2023-02-16 00:38:51,694 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2023-02-16 00:38:51,749 INFO L235 CfgBuilder]: Building ICFG [2023-02-16 00:38:51,756 INFO L261 CfgBuilder]: Building CFG for each procedure with an implementation [2023-02-16 00:38:52,039 INFO L276 CfgBuilder]: Performing block encoding [2023-02-16 00:38:52,043 INFO L295 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2023-02-16 00:38:52,043 INFO L300 CfgBuilder]: Removed 2 assume(true) statements. [2023-02-16 00:38:52,044 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 16.02 12:38:52 BoogieIcfgContainer [2023-02-16 00:38:52,044 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2023-02-16 00:38:52,046 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2023-02-16 00:38:52,046 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2023-02-16 00:38:52,051 INFO L275 PluginConnector]: TraceAbstraction initialized [2023-02-16 00:38:52,051 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 16.02 12:38:51" (1/3) ... [2023-02-16 00:38:52,052 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@ebf1f13 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 16.02 12:38:52, skipping insertion in model container [2023-02-16 00:38:52,052 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.02 12:38:51" (2/3) ... [2023-02-16 00:38:52,052 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@ebf1f13 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 16.02 12:38:52, skipping insertion in model container [2023-02-16 00:38:52,052 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 16.02 12:38:52" (3/3) ... [2023-02-16 00:38:52,053 INFO L112 eAbstractionObserver]: Analyzing ICFG byte_add_2-2.i [2023-02-16 00:38:52,064 INFO L203 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2023-02-16 00:38:52,064 INFO L162 ceAbstractionStarter]: Applying trace abstraction to program that has 1 error locations. [2023-02-16 00:38:52,092 INFO L356 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2023-02-16 00:38:52,096 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;@5a32d375, mLbeIndependenceSettings=[IndependenceType=SYNTACTIC, AbstractionType=NONE, UseConditional=, UseSemiCommutativity=, Solver=, SolverTimeout=] [2023-02-16 00:38:52,096 INFO L358 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2023-02-16 00:38:52,099 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-16 00:38:52,103 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 14 [2023-02-16 00:38:52,103 INFO L187 NwaCegarLoop]: Found error trace [2023-02-16 00:38:52,103 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-02-16 00:38:52,103 INFO L420 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-02-16 00:38:52,106 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2023-02-16 00:38:52,107 INFO L85 PathProgramCache]: Analyzing trace with hash 903950584, now seen corresponding path program 1 times [2023-02-16 00:38:52,112 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-02-16 00:38:52,112 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1523755150] [2023-02-16 00:38:52,112 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-02-16 00:38:52,113 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-02-16 00:38:52,199 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-16 00:38:52,290 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-16 00:38:52,291 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-02-16 00:38:52,291 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1523755150] [2023-02-16 00:38:52,292 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1523755150] provided 1 perfect and 0 imperfect interpolant sequences [2023-02-16 00:38:52,292 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-02-16 00:38:52,292 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2023-02-16 00:38:52,293 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [274077308] [2023-02-16 00:38:52,294 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-02-16 00:38:52,312 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2023-02-16 00:38:52,313 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-02-16 00:38:52,344 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2023-02-16 00:38:52,345 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2023-02-16 00:38:52,347 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-16 00:38:52,365 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-02-16 00:38:52,365 INFO L93 Difference]: Finished difference Result 64 states and 105 transitions. [2023-02-16 00:38:52,366 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2023-02-16 00:38:52,367 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-16 00:38:52,367 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-02-16 00:38:52,373 INFO L225 Difference]: With dead ends: 64 [2023-02-16 00:38:52,373 INFO L226 Difference]: Without dead ends: 43 [2023-02-16 00:38:52,375 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-16 00:38:52,378 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-16 00:38:52,378 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-16 00:38:52,389 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 43 states. [2023-02-16 00:38:52,397 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 43 to 43. [2023-02-16 00:38:52,398 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-16 00:38:52,399 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 43 states to 43 states and 73 transitions. [2023-02-16 00:38:52,400 INFO L78 Accepts]: Start accepts. Automaton has 43 states and 73 transitions. Word has length 13 [2023-02-16 00:38:52,400 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-02-16 00:38:52,400 INFO L495 AbstractCegarLoop]: Abstraction has 43 states and 73 transitions. [2023-02-16 00:38:52,400 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-16 00:38:52,400 INFO L276 IsEmpty]: Start isEmpty. Operand 43 states and 73 transitions. [2023-02-16 00:38:52,401 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 14 [2023-02-16 00:38:52,402 INFO L187 NwaCegarLoop]: Found error trace [2023-02-16 00:38:52,402 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-02-16 00:38:52,402 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2023-02-16 00:38:52,402 INFO L420 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-02-16 00:38:52,403 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2023-02-16 00:38:52,403 INFO L85 PathProgramCache]: Analyzing trace with hash 430337229, now seen corresponding path program 1 times [2023-02-16 00:38:52,403 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-02-16 00:38:52,403 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1220034894] [2023-02-16 00:38:52,404 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-02-16 00:38:52,404 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-02-16 00:38:52,443 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-16 00:38:52,525 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-16 00:38:52,525 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-02-16 00:38:52,525 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1220034894] [2023-02-16 00:38:52,525 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1220034894] provided 1 perfect and 0 imperfect interpolant sequences [2023-02-16 00:38:52,526 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-02-16 00:38:52,526 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2023-02-16 00:38:52,526 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [165317660] [2023-02-16 00:38:52,526 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-02-16 00:38:52,527 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2023-02-16 00:38:52,527 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-02-16 00:38:52,528 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2023-02-16 00:38:52,528 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2023-02-16 00:38:52,528 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-16 00:38:52,619 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-02-16 00:38:52,619 INFO L93 Difference]: Finished difference Result 102 states and 179 transitions. [2023-02-16 00:38:52,620 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2023-02-16 00:38:52,620 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-16 00:38:52,622 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-02-16 00:38:52,623 INFO L225 Difference]: With dead ends: 102 [2023-02-16 00:38:52,623 INFO L226 Difference]: Without dead ends: 69 [2023-02-16 00:38:52,623 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-16 00:38:52,624 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-16 00:38:52,625 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-16 00:38:52,625 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 69 states. [2023-02-16 00:38:52,629 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 69 to 67. [2023-02-16 00:38:52,630 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-16 00:38:52,630 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 67 states to 67 states and 103 transitions. [2023-02-16 00:38:52,631 INFO L78 Accepts]: Start accepts. Automaton has 67 states and 103 transitions. Word has length 13 [2023-02-16 00:38:52,631 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-02-16 00:38:52,631 INFO L495 AbstractCegarLoop]: Abstraction has 67 states and 103 transitions. [2023-02-16 00:38:52,631 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-16 00:38:52,631 INFO L276 IsEmpty]: Start isEmpty. Operand 67 states and 103 transitions. [2023-02-16 00:38:52,632 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 20 [2023-02-16 00:38:52,632 INFO L187 NwaCegarLoop]: Found error trace [2023-02-16 00:38:52,632 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-02-16 00:38:52,632 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2023-02-16 00:38:52,633 INFO L420 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-02-16 00:38:52,633 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2023-02-16 00:38:52,633 INFO L85 PathProgramCache]: Analyzing trace with hash -2037878536, now seen corresponding path program 1 times [2023-02-16 00:38:52,633 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-02-16 00:38:52,633 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [134105212] [2023-02-16 00:38:52,634 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-02-16 00:38:52,634 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-02-16 00:38:52,657 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-16 00:38:52,757 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-16 00:38:52,759 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-02-16 00:38:52,759 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [134105212] [2023-02-16 00:38:52,759 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [134105212] provided 1 perfect and 0 imperfect interpolant sequences [2023-02-16 00:38:52,759 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-02-16 00:38:52,760 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2023-02-16 00:38:52,760 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1274614561] [2023-02-16 00:38:52,760 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-02-16 00:38:52,760 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2023-02-16 00:38:52,761 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-02-16 00:38:52,762 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2023-02-16 00:38:52,762 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2023-02-16 00:38:52,763 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-16 00:38:52,948 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-02-16 00:38:52,948 INFO L93 Difference]: Finished difference Result 168 states and 287 transitions. [2023-02-16 00:38:52,948 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2023-02-16 00:38:52,949 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-16 00:38:52,949 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-02-16 00:38:52,954 INFO L225 Difference]: With dead ends: 168 [2023-02-16 00:38:52,954 INFO L226 Difference]: Without dead ends: 135 [2023-02-16 00:38:52,957 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-16 00:38:52,960 INFO L413 NwaCegarLoop]: 40 mSDtfsCounter, 112 mSDsluCounter, 65 mSDsCounter, 0 mSdLazyCounter, 119 mSolverCounterSat, 50 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s 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-16 00:38:52,960 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-16 00:38:52,963 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 135 states. [2023-02-16 00:38:52,972 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 135 to 93. [2023-02-16 00:38:52,973 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-16 00:38:52,975 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 93 states to 93 states and 143 transitions. [2023-02-16 00:38:52,975 INFO L78 Accepts]: Start accepts. Automaton has 93 states and 143 transitions. Word has length 19 [2023-02-16 00:38:52,975 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-02-16 00:38:52,975 INFO L495 AbstractCegarLoop]: Abstraction has 93 states and 143 transitions. [2023-02-16 00:38:52,976 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-16 00:38:52,976 INFO L276 IsEmpty]: Start isEmpty. Operand 93 states and 143 transitions. [2023-02-16 00:38:52,976 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2023-02-16 00:38:52,976 INFO L187 NwaCegarLoop]: Found error trace [2023-02-16 00:38:52,977 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-16 00:38:52,977 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2023-02-16 00:38:52,977 INFO L420 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-02-16 00:38:52,978 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2023-02-16 00:38:52,978 INFO L85 PathProgramCache]: Analyzing trace with hash -21369817, now seen corresponding path program 1 times [2023-02-16 00:38:52,978 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-02-16 00:38:52,978 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2046288299] [2023-02-16 00:38:52,978 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-02-16 00:38:52,978 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-02-16 00:38:53,018 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-16 00:38:53,132 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-16 00:38:53,132 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-02-16 00:38:53,132 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2046288299] [2023-02-16 00:38:53,132 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2046288299] provided 1 perfect and 0 imperfect interpolant sequences [2023-02-16 00:38:53,133 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-02-16 00:38:53,133 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2023-02-16 00:38:53,133 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [731862664] [2023-02-16 00:38:53,133 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-02-16 00:38:53,133 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2023-02-16 00:38:53,133 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-02-16 00:38:53,134 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2023-02-16 00:38:53,134 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2023-02-16 00:38:53,134 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-16 00:38:53,284 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-02-16 00:38:53,284 INFO L93 Difference]: Finished difference Result 272 states and 412 transitions. [2023-02-16 00:38:53,285 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2023-02-16 00:38:53,285 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-16 00:38:53,285 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-02-16 00:38:53,287 INFO L225 Difference]: With dead ends: 272 [2023-02-16 00:38:53,287 INFO L226 Difference]: Without dead ends: 192 [2023-02-16 00:38:53,288 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-16 00:38:53,294 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-16 00:38:53,295 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-16 00:38:53,295 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 192 states. [2023-02-16 00:38:53,300 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 192 to 101. [2023-02-16 00:38:53,304 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-16 00:38:53,304 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 101 states to 101 states and 152 transitions. [2023-02-16 00:38:53,305 INFO L78 Accepts]: Start accepts. Automaton has 101 states and 152 transitions. Word has length 25 [2023-02-16 00:38:53,305 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-02-16 00:38:53,305 INFO L495 AbstractCegarLoop]: Abstraction has 101 states and 152 transitions. [2023-02-16 00:38:53,305 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-16 00:38:53,305 INFO L276 IsEmpty]: Start isEmpty. Operand 101 states and 152 transitions. [2023-02-16 00:38:53,305 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 27 [2023-02-16 00:38:53,306 INFO L187 NwaCegarLoop]: Found error trace [2023-02-16 00:38:53,306 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-16 00:38:53,306 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2023-02-16 00:38:53,306 INFO L420 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-02-16 00:38:53,306 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2023-02-16 00:38:53,306 INFO L85 PathProgramCache]: Analyzing trace with hash -53067146, now seen corresponding path program 1 times [2023-02-16 00:38:53,306 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-02-16 00:38:53,306 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [654712018] [2023-02-16 00:38:53,307 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-02-16 00:38:53,307 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-02-16 00:38:53,317 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-16 00:38:53,367 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-16 00:38:53,368 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-02-16 00:38:53,368 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [654712018] [2023-02-16 00:38:53,368 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [654712018] provided 1 perfect and 0 imperfect interpolant sequences [2023-02-16 00:38:53,368 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-02-16 00:38:53,368 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2023-02-16 00:38:53,368 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1359168512] [2023-02-16 00:38:53,368 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-02-16 00:38:53,368 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2023-02-16 00:38:53,368 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-02-16 00:38:53,369 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2023-02-16 00:38:53,369 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2023-02-16 00:38:53,369 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-16 00:38:53,373 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-02-16 00:38:53,374 INFO L93 Difference]: Finished difference Result 179 states and 272 transitions. [2023-02-16 00:38:53,374 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2023-02-16 00:38:53,374 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-16 00:38:53,374 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-02-16 00:38:53,374 INFO L225 Difference]: With dead ends: 179 [2023-02-16 00:38:53,374 INFO L226 Difference]: Without dead ends: 93 [2023-02-16 00:38:53,375 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-16 00:38:53,375 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-16 00:38:53,375 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-16 00:38:53,376 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 93 states. [2023-02-16 00:38:53,379 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 93 to 93. [2023-02-16 00:38:53,380 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-16 00:38:53,380 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 93 states to 93 states and 139 transitions. [2023-02-16 00:38:53,380 INFO L78 Accepts]: Start accepts. Automaton has 93 states and 139 transitions. Word has length 26 [2023-02-16 00:38:53,380 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-02-16 00:38:53,380 INFO L495 AbstractCegarLoop]: Abstraction has 93 states and 139 transitions. [2023-02-16 00:38:53,381 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-16 00:38:53,381 INFO L276 IsEmpty]: Start isEmpty. Operand 93 states and 139 transitions. [2023-02-16 00:38:53,381 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 33 [2023-02-16 00:38:53,381 INFO L187 NwaCegarLoop]: Found error trace [2023-02-16 00:38:53,381 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-16 00:38:53,381 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2023-02-16 00:38:53,382 INFO L420 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-02-16 00:38:53,382 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2023-02-16 00:38:53,382 INFO L85 PathProgramCache]: Analyzing trace with hash -350554629, now seen corresponding path program 1 times [2023-02-16 00:38:53,382 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-02-16 00:38:53,382 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1652527959] [2023-02-16 00:38:53,382 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-02-16 00:38:53,382 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-02-16 00:38:53,397 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-16 00:38:53,481 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-16 00:38:53,482 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-02-16 00:38:53,482 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1652527959] [2023-02-16 00:38:53,482 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1652527959] provided 1 perfect and 0 imperfect interpolant sequences [2023-02-16 00:38:53,482 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-02-16 00:38:53,482 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2023-02-16 00:38:53,483 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [670937760] [2023-02-16 00:38:53,483 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-02-16 00:38:53,483 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2023-02-16 00:38:53,483 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-02-16 00:38:53,483 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2023-02-16 00:38:53,484 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2023-02-16 00:38:53,484 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-16 00:38:53,602 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-02-16 00:38:53,603 INFO L93 Difference]: Finished difference Result 273 states and 407 transitions. [2023-02-16 00:38:53,603 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2023-02-16 00:38:53,603 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-16 00:38:53,603 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-02-16 00:38:53,604 INFO L225 Difference]: With dead ends: 273 [2023-02-16 00:38:53,604 INFO L226 Difference]: Without dead ends: 194 [2023-02-16 00:38:53,606 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-16 00:38:53,607 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-16 00:38:53,608 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-16 00:38:53,609 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 194 states. [2023-02-16 00:38:53,622 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 194 to 98. [2023-02-16 00:38:53,623 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-16 00:38:53,623 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 98 states to 98 states and 144 transitions. [2023-02-16 00:38:53,623 INFO L78 Accepts]: Start accepts. Automaton has 98 states and 144 transitions. Word has length 32 [2023-02-16 00:38:53,624 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-02-16 00:38:53,624 INFO L495 AbstractCegarLoop]: Abstraction has 98 states and 144 transitions. [2023-02-16 00:38:53,624 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-16 00:38:53,624 INFO L276 IsEmpty]: Start isEmpty. Operand 98 states and 144 transitions. [2023-02-16 00:38:53,626 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 34 [2023-02-16 00:38:53,627 INFO L187 NwaCegarLoop]: Found error trace [2023-02-16 00:38:53,627 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-16 00:38:53,627 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2023-02-16 00:38:53,627 INFO L420 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-02-16 00:38:53,628 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2023-02-16 00:38:53,628 INFO L85 PathProgramCache]: Analyzing trace with hash -143141955, now seen corresponding path program 1 times [2023-02-16 00:38:53,629 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-02-16 00:38:53,629 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [401088245] [2023-02-16 00:38:53,629 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-02-16 00:38:53,629 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-02-16 00:38:53,659 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-16 00:38:53,741 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-16 00:38:53,741 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-02-16 00:38:53,741 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [401088245] [2023-02-16 00:38:53,741 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [401088245] provided 1 perfect and 0 imperfect interpolant sequences [2023-02-16 00:38:53,741 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-02-16 00:38:53,742 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2023-02-16 00:38:53,742 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1857822423] [2023-02-16 00:38:53,742 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-02-16 00:38:53,742 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2023-02-16 00:38:53,742 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-02-16 00:38:53,743 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2023-02-16 00:38:53,743 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2023-02-16 00:38:53,744 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-16 00:38:53,882 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-02-16 00:38:53,883 INFO L93 Difference]: Finished difference Result 274 states and 429 transitions. [2023-02-16 00:38:53,883 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2023-02-16 00:38:53,883 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-16 00:38:53,884 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-02-16 00:38:53,884 INFO L225 Difference]: With dead ends: 274 [2023-02-16 00:38:53,884 INFO L226 Difference]: Without dead ends: 196 [2023-02-16 00:38:53,885 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-16 00:38:53,886 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.1s IncrementalHoareTripleChecker+Time [2023-02-16 00:38:53,886 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.1s Time] [2023-02-16 00:38:53,888 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 196 states. [2023-02-16 00:38:53,904 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 196 to 137. [2023-02-16 00:38:53,905 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-16 00:38:53,906 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 137 states to 137 states and 209 transitions. [2023-02-16 00:38:53,908 INFO L78 Accepts]: Start accepts. Automaton has 137 states and 209 transitions. Word has length 33 [2023-02-16 00:38:53,908 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-02-16 00:38:53,909 INFO L495 AbstractCegarLoop]: Abstraction has 137 states and 209 transitions. [2023-02-16 00:38:53,909 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-16 00:38:53,909 INFO L276 IsEmpty]: Start isEmpty. Operand 137 states and 209 transitions. [2023-02-16 00:38:53,910 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 40 [2023-02-16 00:38:53,912 INFO L187 NwaCegarLoop]: Found error trace [2023-02-16 00:38:53,912 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-16 00:38:53,912 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2023-02-16 00:38:53,913 INFO L420 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-02-16 00:38:53,913 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2023-02-16 00:38:53,914 INFO L85 PathProgramCache]: Analyzing trace with hash 1481468776, now seen corresponding path program 1 times [2023-02-16 00:38:53,914 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-02-16 00:38:53,914 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1191779116] [2023-02-16 00:38:53,914 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-02-16 00:38:53,914 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-02-16 00:38:53,935 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-16 00:38:54,065 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-16 00:38:54,066 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-02-16 00:38:54,066 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1191779116] [2023-02-16 00:38:54,066 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1191779116] provided 0 perfect and 1 imperfect interpolant sequences [2023-02-16 00:38:54,066 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [715817005] [2023-02-16 00:38:54,066 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-02-16 00:38:54,067 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-02-16 00:38:54,067 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-02-16 00:38:54,069 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-16 00:38:54,070 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-16 00:38:54,132 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-16 00:38:54,133 INFO L263 TraceCheckSpWp]: Trace formula consists of 126 conjuncts, 6 conjunts are in the unsatisfiable core [2023-02-16 00:38:54,136 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2023-02-16 00:38:54,238 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-16 00:38:54,238 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2023-02-16 00:38:54,238 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [715817005] provided 1 perfect and 0 imperfect interpolant sequences [2023-02-16 00:38:54,239 INFO L184 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2023-02-16 00:38:54,239 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [6] total 6 [2023-02-16 00:38:54,239 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2102128199] [2023-02-16 00:38:54,239 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-02-16 00:38:54,239 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2023-02-16 00:38:54,239 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-02-16 00:38:54,240 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2023-02-16 00:38:54,240 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2023-02-16 00:38:54,240 INFO L87 Difference]: Start difference. First operand 137 states and 209 transitions. Second operand has 4 states, 4 states have (on average 9.25) internal successors, (37), 4 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-16 00:38:54,283 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-02-16 00:38:54,283 INFO L93 Difference]: Finished difference Result 275 states and 432 transitions. [2023-02-16 00:38:54,283 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2023-02-16 00:38:54,284 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 9.25) internal successors, (37), 4 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-16 00:38:54,284 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-02-16 00:38:54,284 INFO L225 Difference]: With dead ends: 275 [2023-02-16 00:38:54,284 INFO L226 Difference]: Without dead ends: 151 [2023-02-16 00:38:54,285 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 47 GetRequests, 38 SyntacticMatches, 4 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=16, Invalid=26, Unknown=0, NotChecked=0, Total=42 [2023-02-16 00:38:54,285 INFO L413 NwaCegarLoop]: 59 mSDtfsCounter, 55 mSDsluCounter, 23 mSDsCounter, 0 mSdLazyCounter, 43 mSolverCounterSat, 6 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 55 SdHoareTripleChecker+Valid, 82 SdHoareTripleChecker+Invalid, 49 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 6 IncrementalHoareTripleChecker+Valid, 43 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2023-02-16 00:38:54,286 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [55 Valid, 82 Invalid, 49 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [6 Valid, 43 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2023-02-16 00:38:54,286 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 151 states. [2023-02-16 00:38:54,289 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 151 to 131. [2023-02-16 00:38:54,289 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 131 states, 130 states have (on average 1.5307692307692307) internal successors, (199), 130 states have internal predecessors, (199), 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-16 00:38:54,289 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 131 states to 131 states and 199 transitions. [2023-02-16 00:38:54,290 INFO L78 Accepts]: Start accepts. Automaton has 131 states and 199 transitions. Word has length 39 [2023-02-16 00:38:54,290 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-02-16 00:38:54,290 INFO L495 AbstractCegarLoop]: Abstraction has 131 states and 199 transitions. [2023-02-16 00:38:54,290 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 9.25) internal successors, (37), 4 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-16 00:38:54,290 INFO L276 IsEmpty]: Start isEmpty. Operand 131 states and 199 transitions. [2023-02-16 00:38:54,291 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 54 [2023-02-16 00:38:54,291 INFO L187 NwaCegarLoop]: Found error trace [2023-02-16 00:38:54,291 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-16 00:38:54,304 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-16 00:38:54,504 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-16 00:38:54,504 INFO L420 AbstractCegarLoop]: === Iteration 9 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-02-16 00:38:54,505 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2023-02-16 00:38:54,505 INFO L85 PathProgramCache]: Analyzing trace with hash -115920210, now seen corresponding path program 1 times [2023-02-16 00:38:54,505 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-02-16 00:38:54,505 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1828690756] [2023-02-16 00:38:54,505 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-02-16 00:38:54,505 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-02-16 00:38:54,524 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-16 00:38:54,601 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-16 00:38:54,601 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-02-16 00:38:54,602 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1828690756] [2023-02-16 00:38:54,602 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1828690756] provided 1 perfect and 0 imperfect interpolant sequences [2023-02-16 00:38:54,602 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-02-16 00:38:54,602 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2023-02-16 00:38:54,602 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [805012773] [2023-02-16 00:38:54,602 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-02-16 00:38:54,603 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2023-02-16 00:38:54,603 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-02-16 00:38:54,603 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2023-02-16 00:38:54,603 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2023-02-16 00:38:54,604 INFO L87 Difference]: Start difference. First operand 131 states and 199 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-16 00:38:54,700 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-02-16 00:38:54,700 INFO L93 Difference]: Finished difference Result 389 states and 601 transitions. [2023-02-16 00:38:54,701 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2023-02-16 00:38:54,701 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-16 00:38:54,701 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-02-16 00:38:54,702 INFO L225 Difference]: With dead ends: 389 [2023-02-16 00:38:54,702 INFO L226 Difference]: Without dead ends: 273 [2023-02-16 00:38:54,703 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 5 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-16 00:38:54,704 INFO L413 NwaCegarLoop]: 27 mSDtfsCounter, 100 mSDsluCounter, 55 mSDsCounter, 0 mSdLazyCounter, 103 mSolverCounterSat, 27 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 100 SdHoareTripleChecker+Valid, 82 SdHoareTripleChecker+Invalid, 130 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 27 IncrementalHoareTripleChecker+Valid, 103 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2023-02-16 00:38:54,704 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [100 Valid, 82 Invalid, 130 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [27 Valid, 103 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2023-02-16 00:38:54,705 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 273 states. [2023-02-16 00:38:54,709 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 273 to 172. [2023-02-16 00:38:54,710 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 172 states, 171 states have (on average 1.5789473684210527) internal successors, (270), 171 states have internal predecessors, (270), 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-16 00:38:54,710 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 172 states to 172 states and 270 transitions. [2023-02-16 00:38:54,710 INFO L78 Accepts]: Start accepts. Automaton has 172 states and 270 transitions. Word has length 53 [2023-02-16 00:38:54,712 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-02-16 00:38:54,712 INFO L495 AbstractCegarLoop]: Abstraction has 172 states and 270 transitions. [2023-02-16 00:38:54,712 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-16 00:38:54,712 INFO L276 IsEmpty]: Start isEmpty. Operand 172 states and 270 transitions. [2023-02-16 00:38:54,714 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 67 [2023-02-16 00:38:54,714 INFO L187 NwaCegarLoop]: Found error trace [2023-02-16 00:38:54,714 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-16 00:38:54,714 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2023-02-16 00:38:54,714 INFO L420 AbstractCegarLoop]: === Iteration 10 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-02-16 00:38:54,715 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2023-02-16 00:38:54,715 INFO L85 PathProgramCache]: Analyzing trace with hash 380800779, now seen corresponding path program 1 times [2023-02-16 00:38:54,715 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-02-16 00:38:54,715 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [316272461] [2023-02-16 00:38:54,715 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-02-16 00:38:54,715 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-02-16 00:38:54,751 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-16 00:38:54,897 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-16 00:38:54,897 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-02-16 00:38:54,897 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [316272461] [2023-02-16 00:38:54,897 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [316272461] provided 1 perfect and 0 imperfect interpolant sequences [2023-02-16 00:38:54,898 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-02-16 00:38:54,898 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2023-02-16 00:38:54,898 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1846428723] [2023-02-16 00:38:54,898 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-02-16 00:38:54,899 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2023-02-16 00:38:54,899 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-02-16 00:38:54,899 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2023-02-16 00:38:54,900 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2023-02-16 00:38:54,900 INFO L87 Difference]: Start difference. First operand 172 states and 270 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-16 00:38:55,063 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-02-16 00:38:55,063 INFO L93 Difference]: Finished difference Result 681 states and 1068 transitions. [2023-02-16 00:38:55,064 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2023-02-16 00:38:55,064 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-16 00:38:55,065 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-02-16 00:38:55,066 INFO L225 Difference]: With dead ends: 681 [2023-02-16 00:38:55,066 INFO L226 Difference]: Without dead ends: 525 [2023-02-16 00:38:55,066 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-16 00:38:55,067 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.1s IncrementalHoareTripleChecker+Time [2023-02-16 00:38:55,067 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.1s Time] [2023-02-16 00:38:55,067 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 525 states. [2023-02-16 00:38:55,073 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 525 to 172. [2023-02-16 00:38:55,074 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 172 states, 171 states have (on average 1.5789473684210527) internal successors, (270), 171 states have internal predecessors, (270), 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-16 00:38:55,074 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 172 states to 172 states and 270 transitions. [2023-02-16 00:38:55,074 INFO L78 Accepts]: Start accepts. Automaton has 172 states and 270 transitions. Word has length 66 [2023-02-16 00:38:55,074 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-02-16 00:38:55,074 INFO L495 AbstractCegarLoop]: Abstraction has 172 states and 270 transitions. [2023-02-16 00:38:55,075 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-16 00:38:55,075 INFO L276 IsEmpty]: Start isEmpty. Operand 172 states and 270 transitions. [2023-02-16 00:38:55,075 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 68 [2023-02-16 00:38:55,076 INFO L187 NwaCegarLoop]: Found error trace [2023-02-16 00:38:55,076 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-16 00:38:55,076 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9 [2023-02-16 00:38:55,076 INFO L420 AbstractCegarLoop]: === Iteration 11 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-02-16 00:38:55,076 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2023-02-16 00:38:55,077 INFO L85 PathProgramCache]: Analyzing trace with hash 1313996354, now seen corresponding path program 1 times [2023-02-16 00:38:55,077 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-02-16 00:38:55,077 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1978538623] [2023-02-16 00:38:55,077 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-02-16 00:38:55,077 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-02-16 00:38:55,112 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-16 00:38:55,241 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-16 00:38:55,241 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-02-16 00:38:55,241 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1978538623] [2023-02-16 00:38:55,241 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1978538623] provided 1 perfect and 0 imperfect interpolant sequences [2023-02-16 00:38:55,241 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-02-16 00:38:55,242 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2023-02-16 00:38:55,242 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [979943807] [2023-02-16 00:38:55,242 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-02-16 00:38:55,244 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2023-02-16 00:38:55,244 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-02-16 00:38:55,244 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2023-02-16 00:38:55,245 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2023-02-16 00:38:55,245 INFO L87 Difference]: Start difference. First operand 172 states and 270 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-16 00:38:55,574 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-02-16 00:38:55,574 INFO L93 Difference]: Finished difference Result 877 states and 1364 transitions. [2023-02-16 00:38:55,575 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2023-02-16 00:38:55,575 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-16 00:38:55,575 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-02-16 00:38:55,577 INFO L225 Difference]: With dead ends: 877 [2023-02-16 00:38:55,577 INFO L226 Difference]: Without dead ends: 721 [2023-02-16 00:38:55,577 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 14 GetRequests, 4 SyntacticMatches, 1 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=27, Invalid=83, Unknown=0, NotChecked=0, Total=110 [2023-02-16 00:38:55,578 INFO L413 NwaCegarLoop]: 133 mSDtfsCounter, 377 mSDsluCounter, 469 mSDsCounter, 0 mSdLazyCounter, 435 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s 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-16 00:38:55,578 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-16 00:38:55,578 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 721 states. [2023-02-16 00:38:55,585 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 721 to 167. [2023-02-16 00:38:55,585 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 167 states, 166 states have (on average 1.5903614457831325) internal successors, (264), 166 states have internal predecessors, (264), 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-16 00:38:55,586 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 167 states to 167 states and 264 transitions. [2023-02-16 00:38:55,586 INFO L78 Accepts]: Start accepts. Automaton has 167 states and 264 transitions. Word has length 67 [2023-02-16 00:38:55,586 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-02-16 00:38:55,586 INFO L495 AbstractCegarLoop]: Abstraction has 167 states and 264 transitions. [2023-02-16 00:38:55,586 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-16 00:38:55,586 INFO L276 IsEmpty]: Start isEmpty. Operand 167 states and 264 transitions. [2023-02-16 00:38:55,587 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 70 [2023-02-16 00:38:55,587 INFO L187 NwaCegarLoop]: Found error trace [2023-02-16 00:38:55,587 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-16 00:38:55,587 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10 [2023-02-16 00:38:55,587 INFO L420 AbstractCegarLoop]: === Iteration 12 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-02-16 00:38:55,587 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2023-02-16 00:38:55,588 INFO L85 PathProgramCache]: Analyzing trace with hash -725391719, now seen corresponding path program 1 times [2023-02-16 00:38:55,588 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-02-16 00:38:55,588 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [869765823] [2023-02-16 00:38:55,588 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-02-16 00:38:55,588 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-02-16 00:38:55,603 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-16 00:38:55,693 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-16 00:38:55,693 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-02-16 00:38:55,693 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [869765823] [2023-02-16 00:38:55,693 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [869765823] provided 0 perfect and 1 imperfect interpolant sequences [2023-02-16 00:38:55,693 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1106435728] [2023-02-16 00:38:55,693 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-02-16 00:38:55,694 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-02-16 00:38:55,694 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-02-16 00:38:55,701 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-16 00:38:55,703 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-16 00:38:55,753 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-16 00:38:55,754 INFO L263 TraceCheckSpWp]: Trace formula consists of 181 conjuncts, 9 conjunts are in the unsatisfiable core [2023-02-16 00:38:55,756 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2023-02-16 00:38:55,805 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-16 00:38:55,805 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2023-02-16 00:38:55,879 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-16 00:38:55,879 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1106435728] provided 0 perfect and 2 imperfect interpolant sequences [2023-02-16 00:38:55,879 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2023-02-16 00:38:55,879 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [5, 4, 6] total 11 [2023-02-16 00:38:55,879 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [178223633] [2023-02-16 00:38:55,880 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2023-02-16 00:38:55,880 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 11 states [2023-02-16 00:38:55,880 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-02-16 00:38:55,880 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2023-02-16 00:38:55,881 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=27, Invalid=83, Unknown=0, NotChecked=0, Total=110 [2023-02-16 00:38:55,881 INFO L87 Difference]: Start difference. First operand 167 states and 264 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-16 00:38:56,372 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-02-16 00:38:56,372 INFO L93 Difference]: Finished difference Result 987 states and 1572 transitions. [2023-02-16 00:38:56,372 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 22 states. [2023-02-16 00:38:56,372 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-16 00:38:56,372 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-02-16 00:38:56,374 INFO L225 Difference]: With dead ends: 987 [2023-02-16 00:38:56,374 INFO L226 Difference]: Without dead ends: 734 [2023-02-16 00:38:56,375 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-16 00:38:56,375 INFO L413 NwaCegarLoop]: 68 mSDtfsCounter, 579 mSDsluCounter, 239 mSDsCounter, 0 mSdLazyCounter, 513 mSolverCounterSat, 103 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 579 SdHoareTripleChecker+Valid, 307 SdHoareTripleChecker+Invalid, 616 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 103 IncrementalHoareTripleChecker+Valid, 513 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2023-02-16 00:38:56,376 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [579 Valid, 307 Invalid, 616 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [103 Valid, 513 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2023-02-16 00:38:56,376 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 734 states. [2023-02-16 00:38:56,393 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 734 to 501. [2023-02-16 00:38:56,394 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 501 states, 500 states have (on average 1.48) internal successors, (740), 500 states have internal predecessors, (740), 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-16 00:38:56,395 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 501 states to 501 states and 740 transitions. [2023-02-16 00:38:56,395 INFO L78 Accepts]: Start accepts. Automaton has 501 states and 740 transitions. Word has length 69 [2023-02-16 00:38:56,396 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-02-16 00:38:56,396 INFO L495 AbstractCegarLoop]: Abstraction has 501 states and 740 transitions. [2023-02-16 00:38:56,396 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-16 00:38:56,396 INFO L276 IsEmpty]: Start isEmpty. Operand 501 states and 740 transitions. [2023-02-16 00:38:56,397 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 72 [2023-02-16 00:38:56,397 INFO L187 NwaCegarLoop]: Found error trace [2023-02-16 00:38:56,397 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-16 00:38:56,405 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-16 00:38:56,602 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-16 00:38:56,603 INFO L420 AbstractCegarLoop]: === Iteration 13 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-02-16 00:38:56,603 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2023-02-16 00:38:56,603 INFO L85 PathProgramCache]: Analyzing trace with hash 319706574, now seen corresponding path program 1 times [2023-02-16 00:38:56,603 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-02-16 00:38:56,603 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1119771694] [2023-02-16 00:38:56,604 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-02-16 00:38:56,604 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-02-16 00:38:56,647 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2023-02-16 00:38:56,648 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2023-02-16 00:38:56,678 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2023-02-16 00:38:56,692 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2023-02-16 00:38:56,693 INFO L360 BasicCegarLoop]: Counterexample is feasible [2023-02-16 00:38:56,693 INFO L805 garLoopResultBuilder]: Registering result UNSAFE for location ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION (0 of 1 remaining) [2023-02-16 00:38:56,695 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable12 [2023-02-16 00:38:56,697 INFO L445 BasicCegarLoop]: Path program histogram: [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-02-16 00:38:56,699 INFO L178 ceAbstractionStarter]: Computing trace abstraction results [2023-02-16 00:38:56,763 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 16.02 12:38:56 BoogieIcfgContainer [2023-02-16 00:38:56,763 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2023-02-16 00:38:56,764 INFO L113 PluginConnector]: ------------------------Witness Printer---------------------------- [2023-02-16 00:38:56,764 INFO L271 PluginConnector]: Initializing Witness Printer... [2023-02-16 00:38:56,764 INFO L275 PluginConnector]: Witness Printer initialized [2023-02-16 00:38:56,764 INFO L185 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 16.02 12:38:52" (3/4) ... [2023-02-16 00:38:56,766 INFO L140 WitnessPrinter]: No result that supports witness generation found [2023-02-16 00:38:56,766 INFO L132 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2023-02-16 00:38:56,766 INFO L158 Benchmark]: Toolchain (without parser) took 5402.82ms. Allocated memory was 144.7MB in the beginning and 203.4MB in the end (delta: 58.7MB). Free memory was 107.8MB in the beginning and 58.8MB in the end (delta: 49.0MB). Peak memory consumption was 110.6MB. Max. memory is 16.1GB. [2023-02-16 00:38:56,767 INFO L158 Benchmark]: CDTParser took 0.16ms. Allocated memory is still 144.7MB. Free memory is still 117.2MB. There was no memory consumed. Max. memory is 16.1GB. [2023-02-16 00:38:56,767 INFO L158 Benchmark]: CACSL2BoogieTranslator took 208.67ms. Allocated memory is still 144.7MB. Free memory was 107.8MB in the beginning and 95.2MB in the end (delta: 12.6MB). Peak memory consumption was 12.6MB. Max. memory is 16.1GB. [2023-02-16 00:38:56,767 INFO L158 Benchmark]: Boogie Procedure Inliner took 39.80ms. Allocated memory is still 144.7MB. Free memory was 95.2MB in the beginning and 92.4MB in the end (delta: 2.8MB). Peak memory consumption was 4.2MB. Max. memory is 16.1GB. [2023-02-16 00:38:56,767 INFO L158 Benchmark]: Boogie Preprocessor took 30.86ms. Allocated memory is still 144.7MB. Free memory was 92.4MB in the beginning and 90.3MB in the end (delta: 2.1MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. [2023-02-16 00:38:56,768 INFO L158 Benchmark]: RCFGBuilder took 399.22ms. Allocated memory is still 144.7MB. Free memory was 90.3MB in the beginning and 70.5MB in the end (delta: 19.8MB). Peak memory consumption was 18.9MB. Max. memory is 16.1GB. [2023-02-16 00:38:56,768 INFO L158 Benchmark]: TraceAbstraction took 4717.42ms. Allocated memory was 144.7MB in the beginning and 203.4MB in the end (delta: 58.7MB). Free memory was 70.0MB in the beginning and 58.8MB in the end (delta: 11.2MB). Peak memory consumption was 72.9MB. Max. memory is 16.1GB. [2023-02-16 00:38:56,768 INFO L158 Benchmark]: Witness Printer took 2.62ms. Allocated memory is still 203.4MB. Free memory is still 58.8MB. There was no memory consumed. Max. memory is 16.1GB. [2023-02-16 00:38:56,770 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.16ms. Allocated memory is still 144.7MB. Free memory is still 117.2MB. There was no memory consumed. Max. memory is 16.1GB. * CACSL2BoogieTranslator took 208.67ms. Allocated memory is still 144.7MB. Free memory was 107.8MB in the beginning and 95.2MB in the end (delta: 12.6MB). Peak memory consumption was 12.6MB. Max. memory is 16.1GB. * Boogie Procedure Inliner took 39.80ms. Allocated memory is still 144.7MB. Free memory was 95.2MB in the beginning and 92.4MB in the end (delta: 2.8MB). Peak memory consumption was 4.2MB. Max. memory is 16.1GB. * Boogie Preprocessor took 30.86ms. Allocated memory is still 144.7MB. Free memory was 92.4MB in the beginning and 90.3MB in the end (delta: 2.1MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. * RCFGBuilder took 399.22ms. Allocated memory is still 144.7MB. Free memory was 90.3MB in the beginning and 70.5MB in the end (delta: 19.8MB). Peak memory consumption was 18.9MB. Max. memory is 16.1GB. * TraceAbstraction took 4717.42ms. Allocated memory was 144.7MB in the beginning and 203.4MB in the end (delta: 58.7MB). Free memory was 70.0MB in the beginning and 58.8MB in the end (delta: 11.2MB). Peak memory consumption was 72.9MB. Max. memory is 16.1GB. * Witness Printer took 2.62ms. Allocated memory is still 203.4MB. Free memory is still 58.8MB. 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)=0, \old(b)=234770789, a=0, a0=0, a1=0, a2=0, a3=0, 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)=0, \old(b)=234770789, a=0, a0=0, a1=0, a2=0, a3=0, 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)=0, \old(b)=234770789, a=0, a0=0, a1=0, a2=0, a3=0, 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)=0, \old(b)=234770789, a=0, a0=0, a1=0, a2=0, a3=0, b=234770789, b0=234770789, b1=917073, b2=3582, b3=13, na=1] [L68] nb = (unsigned char)4 VAL [\old(a)=0, \old(b)=234770789, a=0, a0=0, a1=0, a2=0, a3=0, b=234770789, b0=234770789, b1=917073, b2=3582, b3=13, na=1, nb=4] [L69] COND FALSE !(b3 == (unsigned char)0) VAL [\old(a)=0, \old(b)=234770789, a=0, a0=0, a1=0, a2=0, a3=0, 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)=0, \old(b)=234770789, a=0, a0=0, a1=0, a2=0, a3=0, 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)=0, \old(b)=234770789, a=0, a0=0, a1=0, a2=0, a3=0, 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)=0, \old(b)=234770789, a=0, a0=0, a1=0, a2=0, a3=0, 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)=0, \old(b)=234770789, a=0, a0=0, a1=0, a2=0, a3=0, b=234770789, b0=234770789, b1=917073, b2=3582, b3=13, carry=0, i=0, na=1, nb=4, partial_sum=0] [L85] COND FALSE !(i == (unsigned char)1) VAL [\old(a)=0, \old(b)=234770789, a=0, a0=0, a1=0, a2=0, a3=0, b=234770789, b0=234770789, b1=917073, b2=3582, b3=13, carry=0, i=0, na=1, nb=4, partial_sum=0] [L86] COND FALSE !(i == (unsigned char)2) VAL [\old(a)=0, \old(b)=234770789, a=0, a0=0, a1=0, a2=0, a3=0, b=234770789, b0=234770789, b1=917073, b2=3582, b3=13, carry=0, i=0, na=1, nb=4, partial_sum=0] [L87] COND FALSE !(i == (unsigned char)3) VAL [\old(a)=0, \old(b)=234770789, a=0, a0=0, a1=0, a2=0, a3=0, b=234770789, b0=234770789, b1=917073, b2=3582, b3=13, carry=0, i=0, na=1, nb=4, partial_sum=0] [L89] COND TRUE i < nb VAL [\old(a)=0, \old(b)=234770789, a=0, a0=0, a1=0, a2=0, a3=0, b=234770789, b0=234770789, b1=917073, b2=3582, b3=13, carry=0, i=0, na=1, nb=4, partial_sum=0] [L90] COND TRUE i == (unsigned char)0 [L90] partial_sum = partial_sum + b0 VAL [\old(a)=0, \old(b)=234770789, a=0, a0=0, a1=0, a2=0, a3=0, b=234770789, b0=234770789, b1=917073, b2=3582, b3=13, carry=0, i=0, na=1, nb=4, partial_sum=101] [L91] COND FALSE !(i == (unsigned char)1) VAL [\old(a)=0, \old(b)=234770789, a=0, a0=0, a1=0, a2=0, a3=0, b=234770789, b0=234770789, b1=917073, b2=3582, b3=13, carry=0, i=0, na=1, nb=4, partial_sum=101] [L92] COND FALSE !(i == (unsigned char)2) VAL [\old(a)=0, \old(b)=234770789, a=0, a0=0, a1=0, a2=0, a3=0, b=234770789, b0=234770789, b1=917073, b2=3582, b3=13, carry=0, i=0, na=1, nb=4, partial_sum=101] [L93] COND FALSE !(i == (unsigned char)3) VAL [\old(a)=0, \old(b)=234770789, a=0, a0=0, a1=0, a2=0, a3=0, b=234770789, b0=234770789, b1=917073, b2=3582, b3=13, carry=0, i=0, na=1, nb=4, partial_sum=101] [L95] COND FALSE !(partial_sum > ((unsigned char)255)) VAL [\old(a)=0, \old(b)=234770789, a=0, a0=0, a1=0, a2=0, a3=0, b=234770789, b0=234770789, b1=917073, b2=3582, b3=13, carry=0, i=0, na=1, nb=4, partial_sum=101] [L99] COND TRUE i == (unsigned char)0 [L99] r0 = (unsigned char)partial_sum VAL [\old(a)=0, \old(b)=234770789, a=0, a0=0, a1=0, a2=0, a3=0, b=234770789, b0=234770789, b1=917073, b2=3582, b3=13, carry=0, i=0, na=1, nb=4, partial_sum=101, r0=101] [L100] COND FALSE !(i == (unsigned char)1) VAL [\old(a)=0, \old(b)=234770789, a=0, a0=0, a1=0, a2=0, a3=0, b=234770789, b0=234770789, b1=917073, b2=3582, b3=13, carry=0, i=0, na=1, nb=4, partial_sum=101, r0=101] [L101] COND FALSE !(i == (unsigned char)2) VAL [\old(a)=0, \old(b)=234770789, a=0, a0=0, a1=0, a2=0, a3=0, b=234770789, b0=234770789, b1=917073, b2=3582, b3=13, carry=0, i=0, na=1, nb=4, partial_sum=101, r0=101] [L102] COND FALSE !(i == (unsigned char)3) VAL [\old(a)=0, \old(b)=234770789, a=0, a0=0, a1=0, a2=0, a3=0, b=234770789, b0=234770789, b1=917073, b2=3582, b3=13, carry=0, i=0, na=1, nb=4, partial_sum=101, r0=101] [L104] i = i + (unsigned char)1 VAL [\old(a)=0, \old(b)=234770789, a=0, a0=0, a1=0, a2=0, a3=0, b=234770789, b0=234770789, b1=917073, b2=3582, b3=13, carry=0, i=1, na=1, nb=4, partial_sum=101, r0=101] [L80] COND TRUE (i < na) || (i < nb) || (carry != (unsigned short)0) [L81] partial_sum = carry [L82] carry = (unsigned short)0 VAL [\old(a)=0, \old(b)=234770789, a=0, a0=0, a1=0, a2=0, a3=0, b=234770789, b0=234770789, b1=917073, b2=3582, b3=13, carry=0, i=1, na=1, nb=4, partial_sum=0, r0=101] [L83] COND FALSE !(i < na) VAL [\old(a)=0, \old(b)=234770789, a=0, a0=0, a1=0, a2=0, a3=0, b=234770789, b0=234770789, b1=917073, b2=3582, b3=13, carry=0, i=1, na=1, nb=4, partial_sum=0, r0=101] [L89] COND TRUE i < nb VAL [\old(a)=0, \old(b)=234770789, a=0, a0=0, a1=0, a2=0, a3=0, b=234770789, b0=234770789, b1=917073, b2=3582, b3=13, carry=0, i=1, na=1, nb=4, partial_sum=0, r0=101] [L90] COND FALSE !(i == (unsigned char)0) VAL [\old(a)=0, \old(b)=234770789, a=0, a0=0, a1=0, a2=0, a3=0, b=234770789, b0=234770789, b1=917073, b2=3582, b3=13, carry=0, i=1, na=1, nb=4, partial_sum=0, r0=101] [L91] COND TRUE i == (unsigned char)1 [L91] partial_sum = partial_sum + b1 VAL [\old(a)=0, \old(b)=234770789, a=0, a0=0, a1=0, a2=0, a3=0, b=234770789, b0=234770789, b1=917073, b2=3582, b3=13, carry=0, i=1, na=1, nb=4, partial_sum=81, r0=101] [L92] COND FALSE !(i == (unsigned char)2) VAL [\old(a)=0, \old(b)=234770789, a=0, a0=0, a1=0, a2=0, a3=0, b=234770789, b0=234770789, b1=917073, b2=3582, b3=13, carry=0, i=1, na=1, nb=4, partial_sum=81, r0=101] [L93] COND FALSE !(i == (unsigned char)3) VAL [\old(a)=0, \old(b)=234770789, a=0, a0=0, a1=0, a2=0, a3=0, b=234770789, b0=234770789, b1=917073, b2=3582, b3=13, carry=0, i=1, na=1, nb=4, partial_sum=81, r0=101] [L95] COND FALSE !(partial_sum > ((unsigned char)255)) VAL [\old(a)=0, \old(b)=234770789, a=0, a0=0, a1=0, a2=0, a3=0, b=234770789, b0=234770789, b1=917073, b2=3582, b3=13, carry=0, i=1, na=1, nb=4, partial_sum=81, r0=101] [L99] COND FALSE !(i == (unsigned char)0) VAL [\old(a)=0, \old(b)=234770789, a=0, a0=0, a1=0, a2=0, a3=0, b=234770789, b0=234770789, b1=917073, b2=3582, b3=13, carry=0, i=1, na=1, nb=4, partial_sum=81, r0=101] [L100] COND TRUE i == (unsigned char)1 [L100] r1 = (unsigned char)partial_sum VAL [\old(a)=0, \old(b)=234770789, a=0, a0=0, a1=0, a2=0, a3=0, b=234770789, b0=234770789, b1=917073, b2=3582, b3=13, carry=0, i=1, na=1, nb=4, partial_sum=81, r0=101, r1=81] [L101] COND FALSE !(i == (unsigned char)2) VAL [\old(a)=0, \old(b)=234770789, a=0, a0=0, a1=0, a2=0, a3=0, b=234770789, b0=234770789, b1=917073, b2=3582, b3=13, carry=0, i=1, na=1, nb=4, partial_sum=81, r0=101, r1=81] [L102] COND FALSE !(i == (unsigned char)3) VAL [\old(a)=0, \old(b)=234770789, a=0, a0=0, a1=0, a2=0, a3=0, b=234770789, b0=234770789, b1=917073, b2=3582, b3=13, carry=0, i=1, na=1, nb=4, partial_sum=81, r0=101, r1=81] [L104] i = i + (unsigned char)1 VAL [\old(a)=0, \old(b)=234770789, a=0, a0=0, a1=0, a2=0, a3=0, b=234770789, b0=234770789, b1=917073, b2=3582, b3=13, carry=0, i=2, na=1, nb=4, partial_sum=81, r0=101, 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)=0, \old(b)=234770789, a=0, a0=0, a1=0, a2=0, a3=0, b=234770789, b0=234770789, b1=917073, b2=3582, b3=13, carry=0, i=2, na=1, nb=4, partial_sum=0, r0=101, r1=81] [L83] COND FALSE !(i < na) VAL [\old(a)=0, \old(b)=234770789, a=0, a0=0, a1=0, a2=0, a3=0, b=234770789, b0=234770789, b1=917073, b2=3582, b3=13, carry=0, i=2, na=1, nb=4, partial_sum=0, r0=101, r1=81] [L89] COND TRUE i < nb VAL [\old(a)=0, \old(b)=234770789, a=0, a0=0, a1=0, a2=0, a3=0, b=234770789, b0=234770789, b1=917073, b2=3582, b3=13, carry=0, i=2, na=1, nb=4, partial_sum=0, r0=101, r1=81] [L90] COND FALSE !(i == (unsigned char)0) VAL [\old(a)=0, \old(b)=234770789, a=0, a0=0, a1=0, a2=0, a3=0, b=234770789, b0=234770789, b1=917073, b2=3582, b3=13, carry=0, i=2, na=1, nb=4, partial_sum=0, r0=101, r1=81] [L91] COND FALSE !(i == (unsigned char)1) VAL [\old(a)=0, \old(b)=234770789, a=0, a0=0, a1=0, a2=0, a3=0, b=234770789, b0=234770789, b1=917073, b2=3582, b3=13, carry=0, i=2, na=1, nb=4, partial_sum=0, r0=101, r1=81] [L92] COND TRUE i == (unsigned char)2 [L92] partial_sum = partial_sum + b2 VAL [\old(a)=0, \old(b)=234770789, a=0, a0=0, a1=0, a2=0, a3=0, b=234770789, b0=234770789, b1=917073, b2=3582, b3=13, carry=0, i=2, na=1, nb=4, partial_sum=254, r0=101, r1=81] [L93] COND FALSE !(i == (unsigned char)3) VAL [\old(a)=0, \old(b)=234770789, a=0, a0=0, a1=0, a2=0, a3=0, b=234770789, b0=234770789, b1=917073, b2=3582, b3=13, carry=0, i=2, na=1, nb=4, partial_sum=254, r0=101, r1=81] [L95] COND FALSE !(partial_sum > ((unsigned char)255)) VAL [\old(a)=0, \old(b)=234770789, a=0, a0=0, a1=0, a2=0, a3=0, b=234770789, b0=234770789, b1=917073, b2=3582, b3=13, carry=0, i=2, na=1, nb=4, partial_sum=254, r0=101, r1=81] [L99] COND FALSE !(i == (unsigned char)0) VAL [\old(a)=0, \old(b)=234770789, a=0, a0=0, a1=0, a2=0, a3=0, b=234770789, b0=234770789, b1=917073, b2=3582, b3=13, carry=0, i=2, na=1, nb=4, partial_sum=254, r0=101, r1=81] [L100] COND FALSE !(i == (unsigned char)1) VAL [\old(a)=0, \old(b)=234770789, a=0, a0=0, a1=0, a2=0, a3=0, b=234770789, b0=234770789, b1=917073, b2=3582, b3=13, carry=0, i=2, na=1, nb=4, partial_sum=254, r0=101, r1=81] [L101] COND TRUE i == (unsigned char)2 [L101] r2 = (unsigned char)partial_sum VAL [\old(a)=0, \old(b)=234770789, a=0, a0=0, a1=0, a2=0, a3=0, b=234770789, b0=234770789, b1=917073, b2=3582, b3=13, carry=0, i=2, na=1, nb=4, partial_sum=254, r0=101, r1=81, r2=254] [L102] COND FALSE !(i == (unsigned char)3) VAL [\old(a)=0, \old(b)=234770789, a=0, a0=0, a1=0, a2=0, a3=0, b=234770789, b0=234770789, b1=917073, b2=3582, b3=13, carry=0, i=2, na=1, nb=4, partial_sum=254, r0=101, r1=81, r2=254] [L104] i = i + (unsigned char)1 VAL [\old(a)=0, \old(b)=234770789, a=0, a0=0, a1=0, a2=0, a3=0, b=234770789, b0=234770789, b1=917073, b2=3582, b3=13, carry=0, i=3, na=1, nb=4, partial_sum=254, r0=101, 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)=0, \old(b)=234770789, a=0, a0=0, a1=0, a2=0, a3=0, b=234770789, b0=234770789, b1=917073, b2=3582, b3=13, carry=0, i=3, na=1, nb=4, partial_sum=0, r0=101, r1=81, r2=254] [L83] COND FALSE !(i < na) VAL [\old(a)=0, \old(b)=234770789, a=0, a0=0, a1=0, a2=0, a3=0, b=234770789, b0=234770789, b1=917073, b2=3582, b3=13, carry=0, i=3, na=1, nb=4, partial_sum=0, r0=101, r1=81, r2=254] [L89] COND TRUE i < nb VAL [\old(a)=0, \old(b)=234770789, a=0, a0=0, a1=0, a2=0, a3=0, b=234770789, b0=234770789, b1=917073, b2=3582, b3=13, carry=0, i=3, na=1, nb=4, partial_sum=0, r0=101, r1=81, r2=254] [L90] COND FALSE !(i == (unsigned char)0) VAL [\old(a)=0, \old(b)=234770789, a=0, a0=0, a1=0, a2=0, a3=0, b=234770789, b0=234770789, b1=917073, b2=3582, b3=13, carry=0, i=3, na=1, nb=4, partial_sum=0, r0=101, r1=81, r2=254] [L91] COND FALSE !(i == (unsigned char)1) VAL [\old(a)=0, \old(b)=234770789, a=0, a0=0, a1=0, a2=0, a3=0, b=234770789, b0=234770789, b1=917073, b2=3582, b3=13, carry=0, i=3, na=1, nb=4, partial_sum=0, r0=101, r1=81, r2=254] [L92] COND FALSE !(i == (unsigned char)2) VAL [\old(a)=0, \old(b)=234770789, a=0, a0=0, a1=0, a2=0, a3=0, b=234770789, b0=234770789, b1=917073, b2=3582, b3=13, carry=0, i=3, na=1, nb=4, partial_sum=0, r0=101, r1=81, r2=254] [L93] COND TRUE i == (unsigned char)3 [L93] partial_sum = partial_sum + b3 VAL [\old(a)=0, \old(b)=234770789, a=0, a0=0, a1=0, a2=0, a3=0, b=234770789, b0=234770789, b1=917073, b2=3582, b3=13, carry=0, i=3, na=1, nb=4, partial_sum=13, r0=101, r1=81, r2=254] [L95] COND FALSE !(partial_sum > ((unsigned char)255)) VAL [\old(a)=0, \old(b)=234770789, a=0, a0=0, a1=0, a2=0, a3=0, b=234770789, b0=234770789, b1=917073, b2=3582, b3=13, carry=0, i=3, na=1, nb=4, partial_sum=13, r0=101, r1=81, r2=254] [L99] COND FALSE !(i == (unsigned char)0) VAL [\old(a)=0, \old(b)=234770789, a=0, a0=0, a1=0, a2=0, a3=0, b=234770789, b0=234770789, b1=917073, b2=3582, b3=13, carry=0, i=3, na=1, nb=4, partial_sum=13, r0=101, r1=81, r2=254] [L100] COND FALSE !(i == (unsigned char)1) VAL [\old(a)=0, \old(b)=234770789, a=0, a0=0, a1=0, a2=0, a3=0, b=234770789, b0=234770789, b1=917073, b2=3582, b3=13, carry=0, i=3, na=1, nb=4, partial_sum=13, r0=101, r1=81, r2=254] [L101] COND FALSE !(i == (unsigned char)2) VAL [\old(a)=0, \old(b)=234770789, a=0, a0=0, a1=0, a2=0, a3=0, b=234770789, b0=234770789, b1=917073, b2=3582, b3=13, carry=0, i=3, na=1, nb=4, partial_sum=13, r0=101, r1=81, r2=254] [L102] COND TRUE i == (unsigned char)3 [L102] r3 = (unsigned char)partial_sum VAL [\old(a)=0, \old(b)=234770789, a=0, a0=0, a1=0, a2=0, a3=0, b=234770789, b0=234770789, b1=917073, b2=3582, b3=13, carry=0, i=3, na=1, nb=4, partial_sum=13, r0=101, r1=81, r2=254, r3=13] [L104] i = i + (unsigned char)1 VAL [\old(a)=0, \old(b)=234770789, a=0, a0=0, a1=0, a2=0, a3=0, b=234770789, b0=234770789, b1=917073, b2=3582, b3=13, carry=0, i=4, na=1, nb=4, partial_sum=13, r0=101, r1=81, r2=254, r3=13] [L80] COND FALSE !((i < na) || (i < nb) || (carry != (unsigned short)0)) VAL [\old(a)=0, \old(b)=234770789, a=0, a0=0, a1=0, a2=0, a3=0, b=234770789, b0=234770789, b1=917073, b2=3582, b3=13, carry=0, i=4, na=1, nb=4, partial_sum=13, r0=101, r1=81, r2=254, r3=13] [L107] COND FALSE !(i < (unsigned char)4) VAL [\old(a)=0, \old(b)=234770789, a=0, a0=0, a1=0, a2=0, a3=0, b=234770789, b0=234770789, b1=917073, b2=3582, b3=13, carry=0, i=4, na=1, nb=4, partial_sum=13, r0=101, r1=81, r2=254, r3=13] [L116] r = r0 | (r1 << 8U) | (r2 << 16U) | ((unsigned int)r3 << 24U) [L118] return r; VAL [\old(a)=0, \old(b)=234770789, \result=218103808, a=0, a0=0, a1=0, a2=0, a3=0, b=234770789, b0=234770789, b1=917073, b2=3582, b3=13, carry=0, i=4, na=1, nb=4, partial_sum=13, r=218103808, r0=101, 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: 4.6s, OverallIterations: 13, TraceHistogramMax: 4, PathProgramHistogramMax: 1, EmptinessCheckTime: 0.0s, AutomataDifference: 2.0s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 0.0s, HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 1826 SdHoareTripleChecker+Valid, 1.4s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 1826 mSDsluCounter, 2193 SdHoareTripleChecker+Invalid, 1.1s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 1335 mSDsCounter, 249 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 1829 IncrementalHoareTripleChecker+Invalid, 2078 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 249 mSolverCounterUnsat, 858 mSDtfsCounter, 1829 mSolverCounterSat, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 275 GetRequests, 209 SyntacticMatches, 6 SemanticMatches, 60 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 132 ImplicationChecksByTransitivity, 0.4s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=501occurred in iteration=12, InterpolantAutomatonStates: 73, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s DumpTime, AutomataMinimizationStatistics: 0.1s AutomataMinimizationTime, 12 MinimizatonAttempts, 1551 StatesRemovedByMinimization, 10 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.0s SsaConstructionTime, 0.3s SatisfiabilityAnalysisTime, 1.4s InterpolantComputationTime, 634 NumberOfCodeBlocks, 634 NumberOfCodeBlocksAsserted, 15 NumberOfCheckSat, 617 ConstructedInterpolants, 0 QuantifiedInterpolants, 1900 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-16 00:38:56,796 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-?-b5317da-m [2023-02-16 00:38:58,386 INFO L177 SettingsManager]: Resetting all preferences to default values... [2023-02-16 00:38:58,388 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2023-02-16 00:38:58,417 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2023-02-16 00:38:58,419 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2023-02-16 00:38:58,421 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2023-02-16 00:38:58,423 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2023-02-16 00:38:58,425 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2023-02-16 00:38:58,428 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2023-02-16 00:38:58,431 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2023-02-16 00:38:58,432 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2023-02-16 00:38:58,433 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2023-02-16 00:38:58,434 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2023-02-16 00:38:58,435 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2023-02-16 00:38:58,445 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2023-02-16 00:38:58,447 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2023-02-16 00:38:58,448 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2023-02-16 00:38:58,449 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2023-02-16 00:38:58,450 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2023-02-16 00:38:58,453 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2023-02-16 00:38:58,454 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2023-02-16 00:38:58,454 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2023-02-16 00:38:58,455 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2023-02-16 00:38:58,456 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2023-02-16 00:38:58,459 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2023-02-16 00:38:58,459 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2023-02-16 00:38:58,459 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2023-02-16 00:38:58,461 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2023-02-16 00:38:58,461 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2023-02-16 00:38:58,461 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2023-02-16 00:38:58,462 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2023-02-16 00:38:58,465 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2023-02-16 00:38:58,466 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2023-02-16 00:38:58,467 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2023-02-16 00:38:58,468 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2023-02-16 00:38:58,468 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2023-02-16 00:38:58,468 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2023-02-16 00:38:58,468 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2023-02-16 00:38:58,469 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2023-02-16 00:38:58,469 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2023-02-16 00:38:58,470 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2023-02-16 00:38:58,470 INFO L101 SettingsManager]: Beginning loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Bitvector.epf [2023-02-16 00:38:58,493 INFO L113 SettingsManager]: Loading preferences was successful [2023-02-16 00:38:58,493 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2023-02-16 00:38:58,494 INFO L136 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2023-02-16 00:38:58,494 INFO L138 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2023-02-16 00:38:58,495 INFO L136 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2023-02-16 00:38:58,495 INFO L138 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2023-02-16 00:38:58,496 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2023-02-16 00:38:58,496 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2023-02-16 00:38:58,496 INFO L138 SettingsManager]: * Use SBE=true [2023-02-16 00:38:58,496 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2023-02-16 00:38:58,497 INFO L138 SettingsManager]: * sizeof long=4 [2023-02-16 00:38:58,497 INFO L138 SettingsManager]: * sizeof POINTER=4 [2023-02-16 00:38:58,497 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2023-02-16 00:38:58,497 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2023-02-16 00:38:58,497 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2023-02-16 00:38:58,497 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2023-02-16 00:38:58,497 INFO L138 SettingsManager]: * Adapt memory model on pointer casts if necessary=true [2023-02-16 00:38:58,498 INFO L138 SettingsManager]: * Use bitvectors instead of ints=true [2023-02-16 00:38:58,498 INFO L138 SettingsManager]: * Memory model=HoenickeLindenmann_4ByteResolution [2023-02-16 00:38:58,498 INFO L138 SettingsManager]: * sizeof long double=12 [2023-02-16 00:38:58,498 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2023-02-16 00:38:58,498 INFO L138 SettingsManager]: * Use constant arrays=true [2023-02-16 00:38:58,498 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2023-02-16 00:38:58,498 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2023-02-16 00:38:58,499 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2023-02-16 00:38:58,499 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2023-02-16 00:38:58,499 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2023-02-16 00:38:58,499 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2023-02-16 00:38:58,499 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2023-02-16 00:38:58,499 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2023-02-16 00:38:58,499 INFO L138 SettingsManager]: * Trace refinement strategy=WOLF [2023-02-16 00:38:58,499 INFO L138 SettingsManager]: * Command for external solver=cvc4 --incremental --print-success --lang smt [2023-02-16 00:38:58,500 INFO L138 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2023-02-16 00:38:58,500 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2023-02-16 00:38:58,500 INFO L138 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2023-02-16 00:38:58,500 INFO L138 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2023-02-16 00:38:58,500 INFO L138 SettingsManager]: * Logic for external solver=AUFBV [2023-02-16 00:38:58,500 INFO L138 SettingsManager]: * Independence relation used for large block encoding in concurrent analysis=SYNTACTIC [2023-02-16 00:38:58,500 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-16 00:38:58,739 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2023-02-16 00:38:58,753 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2023-02-16 00:38:58,755 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2023-02-16 00:38:58,756 INFO L271 PluginConnector]: Initializing CDTParser... [2023-02-16 00:38:58,756 INFO L275 PluginConnector]: CDTParser initialized [2023-02-16 00:38:58,757 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-16 00:38:59,639 INFO L500 CDTParser]: Created temporary CDT project at NULL [2023-02-16 00:38:59,802 INFO L351 CDTParser]: Found 1 translation units. [2023-02-16 00:38:59,803 INFO L172 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/bitvector/byte_add_2-2.i [2023-02-16 00:38:59,809 INFO L394 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/5a0a2c589/88e176cb659448a59328080060b4175c/FLAG909a5c4ba [2023-02-16 00:38:59,817 INFO L402 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/5a0a2c589/88e176cb659448a59328080060b4175c [2023-02-16 00:38:59,819 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2023-02-16 00:38:59,820 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2023-02-16 00:38:59,820 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2023-02-16 00:38:59,821 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2023-02-16 00:38:59,829 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2023-02-16 00:38:59,829 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 16.02 12:38:59" (1/1) ... [2023-02-16 00:38:59,830 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@49c27942 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.02 12:38:59, skipping insertion in model container [2023-02-16 00:38:59,830 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 16.02 12:38:59" (1/1) ... [2023-02-16 00:38:59,834 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2023-02-16 00:38:59,853 INFO L178 MainTranslator]: Built tables and reachable declarations [2023-02-16 00:38:59,969 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-16 00:39:00,011 INFO L210 PostProcessor]: Analyzing one entry point: main [2023-02-16 00:39:00,024 INFO L203 MainTranslator]: Completed pre-run [2023-02-16 00:39:00,037 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-16 00:39:00,059 INFO L210 PostProcessor]: Analyzing one entry point: main [2023-02-16 00:39:00,074 INFO L208 MainTranslator]: Completed translation [2023-02-16 00:39:00,074 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.02 12:39:00 WrapperNode [2023-02-16 00:39:00,074 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2023-02-16 00:39:00,075 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2023-02-16 00:39:00,075 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2023-02-16 00:39:00,075 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2023-02-16 00:39:00,080 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.02 12:39:00" (1/1) ... [2023-02-16 00:39:00,093 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.02 12:39:00" (1/1) ... [2023-02-16 00:39:00,115 INFO L138 Inliner]: procedures = 16, calls = 8, calls flagged for inlining = 4, calls inlined = 4, statements flattened = 123 [2023-02-16 00:39:00,116 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2023-02-16 00:39:00,117 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2023-02-16 00:39:00,117 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2023-02-16 00:39:00,117 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2023-02-16 00:39:00,122 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.02 12:39:00" (1/1) ... [2023-02-16 00:39:00,123 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.02 12:39:00" (1/1) ... [2023-02-16 00:39:00,133 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.02 12:39:00" (1/1) ... [2023-02-16 00:39:00,133 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.02 12:39:00" (1/1) ... [2023-02-16 00:39:00,143 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.02 12:39:00" (1/1) ... [2023-02-16 00:39:00,149 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.02 12:39:00" (1/1) ... [2023-02-16 00:39:00,151 INFO L185 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.02 12:39:00" (1/1) ... [2023-02-16 00:39:00,154 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.02 12:39:00" (1/1) ... [2023-02-16 00:39:00,156 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2023-02-16 00:39:00,161 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2023-02-16 00:39:00,161 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2023-02-16 00:39:00,161 INFO L275 PluginConnector]: RCFGBuilder initialized [2023-02-16 00:39:00,162 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.02 12:39:00" (1/1) ... [2023-02-16 00:39:00,165 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2023-02-16 00:39:00,175 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-02-16 00:39:00,189 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-16 00:39:00,203 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-16 00:39:00,224 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2023-02-16 00:39:00,224 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE1 [2023-02-16 00:39:00,224 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2023-02-16 00:39:00,225 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2023-02-16 00:39:00,268 INFO L235 CfgBuilder]: Building ICFG [2023-02-16 00:39:00,270 INFO L261 CfgBuilder]: Building CFG for each procedure with an implementation [2023-02-16 00:39:00,410 INFO L276 CfgBuilder]: Performing block encoding [2023-02-16 00:39:00,414 INFO L295 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2023-02-16 00:39:00,414 INFO L300 CfgBuilder]: Removed 2 assume(true) statements. [2023-02-16 00:39:00,415 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 16.02 12:39:00 BoogieIcfgContainer [2023-02-16 00:39:00,415 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2023-02-16 00:39:00,416 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2023-02-16 00:39:00,417 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2023-02-16 00:39:00,418 INFO L275 PluginConnector]: TraceAbstraction initialized [2023-02-16 00:39:00,418 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 16.02 12:38:59" (1/3) ... [2023-02-16 00:39:00,419 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@d48a675 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 16.02 12:39:00, skipping insertion in model container [2023-02-16 00:39:00,419 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.02 12:39:00" (2/3) ... [2023-02-16 00:39:00,419 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@d48a675 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 16.02 12:39:00, skipping insertion in model container [2023-02-16 00:39:00,419 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 16.02 12:39:00" (3/3) ... [2023-02-16 00:39:00,420 INFO L112 eAbstractionObserver]: Analyzing ICFG byte_add_2-2.i [2023-02-16 00:39:00,430 INFO L203 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2023-02-16 00:39:00,431 INFO L162 ceAbstractionStarter]: Applying trace abstraction to program that has 1 error locations. [2023-02-16 00:39:00,458 INFO L356 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2023-02-16 00:39:00,462 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;@3f4de2ff, mLbeIndependenceSettings=[IndependenceType=SYNTACTIC, AbstractionType=NONE, UseConditional=, UseSemiCommutativity=, Solver=, SolverTimeout=] [2023-02-16 00:39:00,462 INFO L358 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2023-02-16 00:39:00,465 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-16 00:39:00,468 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 13 [2023-02-16 00:39:00,469 INFO L187 NwaCegarLoop]: Found error trace [2023-02-16 00:39:00,469 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-02-16 00:39:00,469 INFO L420 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-02-16 00:39:00,472 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2023-02-16 00:39:00,473 INFO L85 PathProgramCache]: Analyzing trace with hash 255061167, now seen corresponding path program 1 times [2023-02-16 00:39:00,480 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2023-02-16 00:39:00,480 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1823895226] [2023-02-16 00:39:00,480 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-02-16 00:39:00,480 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-16 00:39:00,480 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2023-02-16 00:39:00,521 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-16 00:39:00,522 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-16 00:39:00,594 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-16 00:39:00,596 INFO L263 TraceCheckSpWp]: Trace formula consists of 40 conjuncts, 1 conjunts are in the unsatisfiable core [2023-02-16 00:39:00,598 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2023-02-16 00:39:00,623 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-16 00:39:00,623 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2023-02-16 00:39:00,624 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2023-02-16 00:39:00,624 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1823895226] [2023-02-16 00:39:00,624 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1823895226] provided 1 perfect and 0 imperfect interpolant sequences [2023-02-16 00:39:00,625 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-02-16 00:39:00,625 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2023-02-16 00:39:00,626 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1184787078] [2023-02-16 00:39:00,626 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-02-16 00:39:00,629 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2023-02-16 00:39:00,629 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2023-02-16 00:39:00,644 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2023-02-16 00:39:00,645 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2023-02-16 00:39:00,646 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-16 00:39:00,657 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-02-16 00:39:00,658 INFO L93 Difference]: Finished difference Result 57 states and 92 transitions. [2023-02-16 00:39:00,658 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2023-02-16 00:39:00,659 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-16 00:39:00,659 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-02-16 00:39:00,664 INFO L225 Difference]: With dead ends: 57 [2023-02-16 00:39:00,664 INFO L226 Difference]: Without dead ends: 38 [2023-02-16 00:39:00,666 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-16 00:39:00,668 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-16 00:39:00,669 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-16 00:39:00,679 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 38 states. [2023-02-16 00:39:00,688 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 38 to 38. [2023-02-16 00:39:00,689 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-16 00:39:00,701 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 38 states to 38 states and 64 transitions. [2023-02-16 00:39:00,702 INFO L78 Accepts]: Start accepts. Automaton has 38 states and 64 transitions. Word has length 12 [2023-02-16 00:39:00,702 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-02-16 00:39:00,702 INFO L495 AbstractCegarLoop]: Abstraction has 38 states and 64 transitions. [2023-02-16 00:39:00,703 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-16 00:39:00,703 INFO L276 IsEmpty]: Start isEmpty. Operand 38 states and 64 transitions. [2023-02-16 00:39:00,704 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 13 [2023-02-16 00:39:00,704 INFO L187 NwaCegarLoop]: Found error trace [2023-02-16 00:39:00,704 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-02-16 00:39:00,713 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-16 00:39:00,909 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-16 00:39:00,909 INFO L420 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-02-16 00:39:00,910 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2023-02-16 00:39:00,910 INFO L85 PathProgramCache]: Analyzing trace with hash 1803477009, now seen corresponding path program 1 times [2023-02-16 00:39:00,910 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2023-02-16 00:39:00,911 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1660064813] [2023-02-16 00:39:00,911 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-02-16 00:39:00,911 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-16 00:39:00,911 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2023-02-16 00:39:00,912 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-16 00:39:00,914 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-16 00:39:00,943 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-16 00:39:00,944 INFO L263 TraceCheckSpWp]: Trace formula consists of 42 conjuncts, 3 conjunts are in the unsatisfiable core [2023-02-16 00:39:00,945 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2023-02-16 00:39:00,977 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-16 00:39:00,978 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2023-02-16 00:39:00,978 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2023-02-16 00:39:00,978 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1660064813] [2023-02-16 00:39:00,979 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1660064813] provided 1 perfect and 0 imperfect interpolant sequences [2023-02-16 00:39:00,979 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-02-16 00:39:00,979 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2023-02-16 00:39:00,981 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2015532700] [2023-02-16 00:39:00,982 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-02-16 00:39:00,982 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2023-02-16 00:39:00,983 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2023-02-16 00:39:00,984 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2023-02-16 00:39:00,984 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2023-02-16 00:39:00,985 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-16 00:39:01,113 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-02-16 00:39:01,114 INFO L93 Difference]: Finished difference Result 116 states and 201 transitions. [2023-02-16 00:39:01,114 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2023-02-16 00:39:01,115 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-16 00:39:01,117 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-02-16 00:39:01,120 INFO L225 Difference]: With dead ends: 116 [2023-02-16 00:39:01,120 INFO L226 Difference]: Without dead ends: 88 [2023-02-16 00:39:01,121 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-16 00:39:01,123 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-16 00:39:01,124 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-16 00:39:01,126 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 88 states. [2023-02-16 00:39:01,140 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 88 to 81. [2023-02-16 00:39:01,144 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-16 00:39:01,145 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 81 states to 81 states and 130 transitions. [2023-02-16 00:39:01,146 INFO L78 Accepts]: Start accepts. Automaton has 81 states and 130 transitions. Word has length 12 [2023-02-16 00:39:01,146 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-02-16 00:39:01,147 INFO L495 AbstractCegarLoop]: Abstraction has 81 states and 130 transitions. [2023-02-16 00:39:01,147 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-16 00:39:01,147 INFO L276 IsEmpty]: Start isEmpty. Operand 81 states and 130 transitions. [2023-02-16 00:39:01,147 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 14 [2023-02-16 00:39:01,148 INFO L187 NwaCegarLoop]: Found error trace [2023-02-16 00:39:01,148 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-02-16 00:39:01,155 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-16 00:39:01,349 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-16 00:39:01,349 INFO L420 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-02-16 00:39:01,349 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2023-02-16 00:39:01,350 INFO L85 PathProgramCache]: Analyzing trace with hash -1087802014, now seen corresponding path program 1 times [2023-02-16 00:39:01,350 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2023-02-16 00:39:01,350 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [279757398] [2023-02-16 00:39:01,350 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-02-16 00:39:01,350 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-16 00:39:01,350 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2023-02-16 00:39:01,351 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-16 00:39:01,353 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-16 00:39:01,392 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-16 00:39:01,397 INFO L263 TraceCheckSpWp]: Trace formula consists of 44 conjuncts, 5 conjunts are in the unsatisfiable core [2023-02-16 00:39:01,398 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2023-02-16 00:39:01,421 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-16 00:39:01,422 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2023-02-16 00:39:01,422 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2023-02-16 00:39:01,422 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [279757398] [2023-02-16 00:39:01,422 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleMathsat [279757398] provided 1 perfect and 0 imperfect interpolant sequences [2023-02-16 00:39:01,424 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-02-16 00:39:01,424 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2023-02-16 00:39:01,424 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1009763891] [2023-02-16 00:39:01,424 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-02-16 00:39:01,424 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2023-02-16 00:39:01,425 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2023-02-16 00:39:01,425 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2023-02-16 00:39:01,428 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2023-02-16 00:39:01,428 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-16 00:39:01,435 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-02-16 00:39:01,436 INFO L93 Difference]: Finished difference Result 86 states and 134 transitions. [2023-02-16 00:39:01,437 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2023-02-16 00:39:01,437 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-16 00:39:01,437 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-02-16 00:39:01,437 INFO L225 Difference]: With dead ends: 86 [2023-02-16 00:39:01,437 INFO L226 Difference]: Without dead ends: 55 [2023-02-16 00:39:01,438 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-16 00:39:01,438 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-16 00:39:01,439 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-16 00:39:01,439 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 55 states. [2023-02-16 00:39:01,442 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 55 to 55. [2023-02-16 00:39:01,442 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-16 00:39:01,443 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 55 states to 55 states and 80 transitions. [2023-02-16 00:39:01,443 INFO L78 Accepts]: Start accepts. Automaton has 55 states and 80 transitions. Word has length 13 [2023-02-16 00:39:01,443 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-02-16 00:39:01,443 INFO L495 AbstractCegarLoop]: Abstraction has 55 states and 80 transitions. [2023-02-16 00:39:01,443 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-16 00:39:01,443 INFO L276 IsEmpty]: Start isEmpty. Operand 55 states and 80 transitions. [2023-02-16 00:39:01,444 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2023-02-16 00:39:01,444 INFO L187 NwaCegarLoop]: Found error trace [2023-02-16 00:39:01,444 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-16 00:39:01,450 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-16 00:39:01,650 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-16 00:39:01,650 INFO L420 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-02-16 00:39:01,651 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2023-02-16 00:39:01,651 INFO L85 PathProgramCache]: Analyzing trace with hash 1480128500, now seen corresponding path program 1 times [2023-02-16 00:39:01,651 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2023-02-16 00:39:01,651 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [402579183] [2023-02-16 00:39:01,651 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-02-16 00:39:01,652 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-16 00:39:01,652 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2023-02-16 00:39:01,653 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-16 00:39:01,655 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-16 00:39:01,699 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-16 00:39:01,700 INFO L263 TraceCheckSpWp]: Trace formula consists of 61 conjuncts, 3 conjunts are in the unsatisfiable core [2023-02-16 00:39:01,703 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2023-02-16 00:39:01,738 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-16 00:39:01,738 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2023-02-16 00:39:01,738 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2023-02-16 00:39:01,738 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [402579183] [2023-02-16 00:39:01,738 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleMathsat [402579183] provided 1 perfect and 0 imperfect interpolant sequences [2023-02-16 00:39:01,738 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-02-16 00:39:01,739 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2023-02-16 00:39:01,739 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [810873452] [2023-02-16 00:39:01,739 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-02-16 00:39:01,740 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2023-02-16 00:39:01,740 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2023-02-16 00:39:01,741 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2023-02-16 00:39:01,743 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2023-02-16 00:39:01,743 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-16 00:39:01,864 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-02-16 00:39:01,864 INFO L93 Difference]: Finished difference Result 151 states and 219 transitions. [2023-02-16 00:39:01,864 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2023-02-16 00:39:01,864 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-16 00:39:01,864 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-02-16 00:39:01,866 INFO L225 Difference]: With dead ends: 151 [2023-02-16 00:39:01,866 INFO L226 Difference]: Without dead ends: 107 [2023-02-16 00:39:01,867 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-16 00:39:01,871 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.1s IncrementalHoareTripleChecker+Time [2023-02-16 00:39:01,871 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.1s Time] [2023-02-16 00:39:01,873 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 107 states. [2023-02-16 00:39:01,882 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 107 to 60. [2023-02-16 00:39:01,882 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-16 00:39:01,883 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 60 states to 60 states and 85 transitions. [2023-02-16 00:39:01,883 INFO L78 Accepts]: Start accepts. Automaton has 60 states and 85 transitions. Word has length 25 [2023-02-16 00:39:01,883 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-02-16 00:39:01,883 INFO L495 AbstractCegarLoop]: Abstraction has 60 states and 85 transitions. [2023-02-16 00:39:01,883 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-16 00:39:01,883 INFO L276 IsEmpty]: Start isEmpty. Operand 60 states and 85 transitions. [2023-02-16 00:39:01,884 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 27 [2023-02-16 00:39:01,884 INFO L187 NwaCegarLoop]: Found error trace [2023-02-16 00:39:01,884 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-16 00:39:01,892 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-16 00:39:02,089 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-16 00:39:02,089 INFO L420 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-02-16 00:39:02,090 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2023-02-16 00:39:02,090 INFO L85 PathProgramCache]: Analyzing trace with hash -1384042382, now seen corresponding path program 1 times [2023-02-16 00:39:02,090 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2023-02-16 00:39:02,091 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [685884041] [2023-02-16 00:39:02,093 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-02-16 00:39:02,093 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-16 00:39:02,094 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2023-02-16 00:39:02,094 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-16 00:39:02,097 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-16 00:39:02,128 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-16 00:39:02,129 INFO L263 TraceCheckSpWp]: Trace formula consists of 63 conjuncts, 4 conjunts are in the unsatisfiable core [2023-02-16 00:39:02,130 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2023-02-16 00:39:02,183 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-16 00:39:02,183 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2023-02-16 00:39:02,183 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2023-02-16 00:39:02,183 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [685884041] [2023-02-16 00:39:02,183 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleMathsat [685884041] provided 1 perfect and 0 imperfect interpolant sequences [2023-02-16 00:39:02,183 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-02-16 00:39:02,183 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2023-02-16 00:39:02,183 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1219849163] [2023-02-16 00:39:02,183 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-02-16 00:39:02,183 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2023-02-16 00:39:02,184 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2023-02-16 00:39:02,184 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2023-02-16 00:39:02,184 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2023-02-16 00:39:02,184 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-16 00:39:02,327 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-02-16 00:39:02,327 INFO L93 Difference]: Finished difference Result 201 states and 290 transitions. [2023-02-16 00:39:02,328 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2023-02-16 00:39:02,328 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-16 00:39:02,328 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-02-16 00:39:02,328 INFO L225 Difference]: With dead ends: 201 [2023-02-16 00:39:02,328 INFO L226 Difference]: Without dead ends: 157 [2023-02-16 00:39:02,329 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-16 00:39:02,329 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.1s IncrementalHoareTripleChecker+Time [2023-02-16 00:39:02,329 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.1s Time] [2023-02-16 00:39:02,344 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 157 states. [2023-02-16 00:39:02,347 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 157 to 60. [2023-02-16 00:39:02,348 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-16 00:39:02,348 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 60 states to 60 states and 85 transitions. [2023-02-16 00:39:02,348 INFO L78 Accepts]: Start accepts. Automaton has 60 states and 85 transitions. Word has length 26 [2023-02-16 00:39:02,348 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-02-16 00:39:02,348 INFO L495 AbstractCegarLoop]: Abstraction has 60 states and 85 transitions. [2023-02-16 00:39:02,348 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-16 00:39:02,348 INFO L276 IsEmpty]: Start isEmpty. Operand 60 states and 85 transitions. [2023-02-16 00:39:02,349 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 28 [2023-02-16 00:39:02,349 INFO L187 NwaCegarLoop]: Found error trace [2023-02-16 00:39:02,349 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-16 00:39:02,357 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-16 00:39:02,549 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-16 00:39:02,550 INFO L420 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-02-16 00:39:02,550 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2023-02-16 00:39:02,550 INFO L85 PathProgramCache]: Analyzing trace with hash 1985045161, now seen corresponding path program 1 times [2023-02-16 00:39:02,551 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2023-02-16 00:39:02,551 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1064925230] [2023-02-16 00:39:02,551 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-02-16 00:39:02,551 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-16 00:39:02,551 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2023-02-16 00:39:02,552 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-16 00:39:02,554 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-16 00:39:02,584 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-16 00:39:02,585 INFO L263 TraceCheckSpWp]: Trace formula consists of 66 conjuncts, 6 conjunts are in the unsatisfiable core [2023-02-16 00:39:02,586 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2023-02-16 00:39:02,615 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-16 00:39:02,615 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2023-02-16 00:39:02,616 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2023-02-16 00:39:02,616 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1064925230] [2023-02-16 00:39:02,616 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1064925230] provided 1 perfect and 0 imperfect interpolant sequences [2023-02-16 00:39:02,616 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-02-16 00:39:02,616 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2023-02-16 00:39:02,616 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [139795181] [2023-02-16 00:39:02,616 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-02-16 00:39:02,617 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2023-02-16 00:39:02,617 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2023-02-16 00:39:02,617 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2023-02-16 00:39:02,617 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=30, Unknown=0, NotChecked=0, Total=42 [2023-02-16 00:39:02,617 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-16 00:39:02,815 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-02-16 00:39:02,815 INFO L93 Difference]: Finished difference Result 248 states and 355 transitions. [2023-02-16 00:39:02,815 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2023-02-16 00:39:02,815 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-16 00:39:02,816 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-02-16 00:39:02,816 INFO L225 Difference]: With dead ends: 248 [2023-02-16 00:39:02,816 INFO L226 Difference]: Without dead ends: 204 [2023-02-16 00:39:02,817 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 26 GetRequests, 21 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=12, Invalid=30, Unknown=0, NotChecked=0, Total=42 [2023-02-16 00:39:02,817 INFO L413 NwaCegarLoop]: 171 mSDtfsCounter, 213 mSDsluCounter, 547 mSDsCounter, 0 mSdLazyCounter, 314 mSolverCounterSat, 5 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 213 SdHoareTripleChecker+Valid, 718 SdHoareTripleChecker+Invalid, 319 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 5 IncrementalHoareTripleChecker+Valid, 314 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2023-02-16 00:39:02,817 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [213 Valid, 718 Invalid, 319 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [5 Valid, 314 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2023-02-16 00:39:02,818 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 204 states. [2023-02-16 00:39:02,822 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 204 to 92. [2023-02-16 00:39:02,822 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 92 states, 91 states have (on average 1.4285714285714286) internal successors, (130), 91 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-16 00:39:02,823 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 92 states to 92 states and 130 transitions. [2023-02-16 00:39:02,823 INFO L78 Accepts]: Start accepts. Automaton has 92 states and 130 transitions. Word has length 27 [2023-02-16 00:39:02,823 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-02-16 00:39:02,823 INFO L495 AbstractCegarLoop]: Abstraction has 92 states and 130 transitions. [2023-02-16 00:39:02,823 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-16 00:39:02,823 INFO L276 IsEmpty]: Start isEmpty. Operand 92 states and 130 transitions. [2023-02-16 00:39:02,824 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 28 [2023-02-16 00:39:02,824 INFO L187 NwaCegarLoop]: Found error trace [2023-02-16 00:39:02,824 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-16 00:39:02,833 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-16 00:39:03,040 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-16 00:39:03,040 INFO L420 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-02-16 00:39:03,041 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2023-02-16 00:39:03,041 INFO L85 PathProgramCache]: Analyzing trace with hash 179606827, now seen corresponding path program 1 times [2023-02-16 00:39:03,041 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2023-02-16 00:39:03,041 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1915903219] [2023-02-16 00:39:03,041 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-02-16 00:39:03,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-16 00:39:03,041 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2023-02-16 00:39:03,042 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-16 00:39:03,043 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-16 00:39:03,068 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-16 00:39:03,069 INFO L263 TraceCheckSpWp]: Trace formula consists of 65 conjuncts, 5 conjunts are in the unsatisfiable core [2023-02-16 00:39:03,070 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2023-02-16 00:39:03,098 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-16 00:39:03,098 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2023-02-16 00:39:03,098 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2023-02-16 00:39:03,098 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1915903219] [2023-02-16 00:39:03,099 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1915903219] provided 1 perfect and 0 imperfect interpolant sequences [2023-02-16 00:39:03,099 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-02-16 00:39:03,099 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2023-02-16 00:39:03,099 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [293589840] [2023-02-16 00:39:03,099 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-02-16 00:39:03,099 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2023-02-16 00:39:03,103 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2023-02-16 00:39:03,103 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2023-02-16 00:39:03,104 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2023-02-16 00:39:03,104 INFO L87 Difference]: Start difference. First operand 92 states and 130 transitions. Second operand has 6 states, 6 states have (on average 4.5) internal successors, (27), 6 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-16 00:39:03,181 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-02-16 00:39:03,181 INFO L93 Difference]: Finished difference Result 247 states and 352 transitions. [2023-02-16 00:39:03,181 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2023-02-16 00:39:03,181 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 4.5) internal successors, (27), 6 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-16 00:39:03,182 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-02-16 00:39:03,182 INFO L225 Difference]: With dead ends: 247 [2023-02-16 00:39:03,182 INFO L226 Difference]: Without dead ends: 203 [2023-02-16 00:39:03,183 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 26 GetRequests, 22 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2023-02-16 00:39:03,183 INFO L413 NwaCegarLoop]: 128 mSDtfsCounter, 192 mSDsluCounter, 264 mSDsCounter, 0 mSdLazyCounter, 141 mSolverCounterSat, 4 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 192 SdHoareTripleChecker+Valid, 392 SdHoareTripleChecker+Invalid, 145 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 4 IncrementalHoareTripleChecker+Valid, 141 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2023-02-16 00:39:03,183 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [192 Valid, 392 Invalid, 145 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [4 Valid, 141 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2023-02-16 00:39:03,184 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 203 states. [2023-02-16 00:39:03,187 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 203 to 87. [2023-02-16 00:39:03,187 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 87 states, 86 states have (on average 1.441860465116279) internal successors, (124), 86 states have internal predecessors, (124), 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-16 00:39:03,188 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 87 states to 87 states and 124 transitions. [2023-02-16 00:39:03,188 INFO L78 Accepts]: Start accepts. Automaton has 87 states and 124 transitions. Word has length 27 [2023-02-16 00:39:03,188 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-02-16 00:39:03,188 INFO L495 AbstractCegarLoop]: Abstraction has 87 states and 124 transitions. [2023-02-16 00:39:03,189 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 4.5) internal successors, (27), 6 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-16 00:39:03,189 INFO L276 IsEmpty]: Start isEmpty. Operand 87 states and 124 transitions. [2023-02-16 00:39:03,189 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 30 [2023-02-16 00:39:03,189 INFO L187 NwaCegarLoop]: Found error trace [2023-02-16 00:39:03,189 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-16 00:39:03,208 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-16 00:39:03,396 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-16 00:39:03,396 INFO L420 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-02-16 00:39:03,397 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2023-02-16 00:39:03,397 INFO L85 PathProgramCache]: Analyzing trace with hash 221982208, now seen corresponding path program 1 times [2023-02-16 00:39:03,397 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2023-02-16 00:39:03,397 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1598229367] [2023-02-16 00:39:03,397 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-02-16 00:39:03,397 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-16 00:39:03,397 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2023-02-16 00:39:03,398 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-16 00:39:03,399 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-16 00:39:03,423 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-16 00:39:03,424 INFO L263 TraceCheckSpWp]: Trace formula consists of 66 conjuncts, 2 conjunts are in the unsatisfiable core [2023-02-16 00:39:03,425 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2023-02-16 00:39:03,438 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-16 00:39:03,438 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2023-02-16 00:39:03,438 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2023-02-16 00:39:03,438 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1598229367] [2023-02-16 00:39:03,438 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1598229367] provided 1 perfect and 0 imperfect interpolant sequences [2023-02-16 00:39:03,438 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-02-16 00:39:03,438 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2023-02-16 00:39:03,439 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1821746348] [2023-02-16 00:39:03,439 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-02-16 00:39:03,439 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2023-02-16 00:39:03,439 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2023-02-16 00:39:03,439 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2023-02-16 00:39:03,440 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2023-02-16 00:39:03,440 INFO L87 Difference]: Start difference. First operand 87 states and 124 transitions. Second operand has 3 states, 3 states have (on average 9.666666666666666) internal successors, (29), 3 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-16 00:39:03,447 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-02-16 00:39:03,447 INFO L93 Difference]: Finished difference Result 121 states and 172 transitions. [2023-02-16 00:39:03,447 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2023-02-16 00:39:03,447 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 9.666666666666666) internal successors, (29), 3 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-16 00:39:03,447 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-02-16 00:39:03,448 INFO L225 Difference]: With dead ends: 121 [2023-02-16 00:39:03,448 INFO L226 Difference]: Without dead ends: 107 [2023-02-16 00:39:03,448 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 28 GetRequests, 27 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-16 00:39:03,449 INFO L413 NwaCegarLoop]: 59 mSDtfsCounter, 4 mSDsluCounter, 54 mSDsCounter, 0 mSdLazyCounter, 6 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 4 SdHoareTripleChecker+Valid, 113 SdHoareTripleChecker+Invalid, 6 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 6 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2023-02-16 00:39:03,449 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [4 Valid, 113 Invalid, 6 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 6 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2023-02-16 00:39:03,449 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 107 states. [2023-02-16 00:39:03,452 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 107 to 107. [2023-02-16 00:39:03,453 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 107 states, 106 states have (on average 1.4339622641509433) internal successors, (152), 106 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-16 00:39:03,453 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 107 states to 107 states and 152 transitions. [2023-02-16 00:39:03,453 INFO L78 Accepts]: Start accepts. Automaton has 107 states and 152 transitions. Word has length 29 [2023-02-16 00:39:03,453 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-02-16 00:39:03,454 INFO L495 AbstractCegarLoop]: Abstraction has 107 states and 152 transitions. [2023-02-16 00:39:03,454 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 9.666666666666666) internal successors, (29), 3 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-16 00:39:03,454 INFO L276 IsEmpty]: Start isEmpty. Operand 107 states and 152 transitions. [2023-02-16 00:39:03,454 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 30 [2023-02-16 00:39:03,454 INFO L187 NwaCegarLoop]: Found error trace [2023-02-16 00:39:03,455 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-16 00:39:03,463 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-16 00:39:03,663 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-16 00:39:03,664 INFO L420 AbstractCegarLoop]: === Iteration 9 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-02-16 00:39:03,664 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2023-02-16 00:39:03,664 INFO L85 PathProgramCache]: Analyzing trace with hash 480147646, now seen corresponding path program 1 times [2023-02-16 00:39:03,664 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2023-02-16 00:39:03,665 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1145784316] [2023-02-16 00:39:03,665 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-02-16 00:39:03,665 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-16 00:39:03,665 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2023-02-16 00:39:03,666 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-16 00:39:03,668 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-16 00:39:03,691 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-16 00:39:03,692 INFO L263 TraceCheckSpWp]: Trace formula consists of 64 conjuncts, 4 conjunts are in the unsatisfiable core [2023-02-16 00:39:03,693 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2023-02-16 00:39:03,757 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-16 00:39:03,757 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2023-02-16 00:39:03,757 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2023-02-16 00:39:03,757 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1145784316] [2023-02-16 00:39:03,757 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1145784316] provided 1 perfect and 0 imperfect interpolant sequences [2023-02-16 00:39:03,757 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-02-16 00:39:03,758 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2023-02-16 00:39:03,758 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [439048908] [2023-02-16 00:39:03,758 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-02-16 00:39:03,758 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2023-02-16 00:39:03,758 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2023-02-16 00:39:03,759 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2023-02-16 00:39:03,759 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2023-02-16 00:39:03,759 INFO L87 Difference]: Start difference. First operand 107 states and 152 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-16 00:39:03,880 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-02-16 00:39:03,880 INFO L93 Difference]: Finished difference Result 253 states and 381 transitions. [2023-02-16 00:39:03,880 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2023-02-16 00:39:03,881 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-16 00:39:03,882 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-02-16 00:39:03,882 INFO L225 Difference]: With dead ends: 253 [2023-02-16 00:39:03,882 INFO L226 Difference]: Without dead ends: 161 [2023-02-16 00:39:03,883 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-16 00:39:03,884 INFO L413 NwaCegarLoop]: 32 mSDtfsCounter, 70 mSDsluCounter, 35 mSDsCounter, 0 mSdLazyCounter, 132 mSolverCounterSat, 27 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 70 SdHoareTripleChecker+Valid, 67 SdHoareTripleChecker+Invalid, 159 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 27 IncrementalHoareTripleChecker+Valid, 132 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2023-02-16 00:39:03,885 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [70 Valid, 67 Invalid, 159 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [27 Valid, 132 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2023-02-16 00:39:03,885 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 161 states. [2023-02-16 00:39:03,891 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 161 to 143. [2023-02-16 00:39:03,891 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 143 states, 142 states have (on average 1.3450704225352113) internal successors, (191), 142 states have internal predecessors, (191), 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-16 00:39:03,891 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 143 states to 143 states and 191 transitions. [2023-02-16 00:39:03,892 INFO L78 Accepts]: Start accepts. Automaton has 143 states and 191 transitions. Word has length 29 [2023-02-16 00:39:03,892 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-02-16 00:39:03,892 INFO L495 AbstractCegarLoop]: Abstraction has 143 states and 191 transitions. [2023-02-16 00:39:03,892 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-16 00:39:03,892 INFO L276 IsEmpty]: Start isEmpty. Operand 143 states and 191 transitions. [2023-02-16 00:39:03,895 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 43 [2023-02-16 00:39:03,895 INFO L187 NwaCegarLoop]: Found error trace [2023-02-16 00:39:03,896 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] [2023-02-16 00:39:03,905 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-16 00:39:04,102 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-16 00:39:04,102 INFO L420 AbstractCegarLoop]: === Iteration 10 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-02-16 00:39:04,103 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2023-02-16 00:39:04,103 INFO L85 PathProgramCache]: Analyzing trace with hash 1538767779, now seen corresponding path program 1 times [2023-02-16 00:39:04,103 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2023-02-16 00:39:04,104 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1650325403] [2023-02-16 00:39:04,104 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-02-16 00:39:04,104 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-16 00:39:04,104 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2023-02-16 00:39:04,105 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-16 00:39:04,106 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-16 00:39:04,143 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-16 00:39:04,144 INFO L263 TraceCheckSpWp]: Trace formula consists of 83 conjuncts, 4 conjunts are in the unsatisfiable core [2023-02-16 00:39:04,145 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2023-02-16 00:39:04,204 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-16 00:39:04,204 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2023-02-16 00:39:04,204 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2023-02-16 00:39:04,204 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1650325403] [2023-02-16 00:39:04,204 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1650325403] provided 1 perfect and 0 imperfect interpolant sequences [2023-02-16 00:39:04,205 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-02-16 00:39:04,205 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2023-02-16 00:39:04,205 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [853744245] [2023-02-16 00:39:04,205 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-02-16 00:39:04,205 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2023-02-16 00:39:04,205 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2023-02-16 00:39:04,206 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2023-02-16 00:39:04,206 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2023-02-16 00:39:04,206 INFO L87 Difference]: Start difference. First operand 143 states and 191 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-16 00:39:04,318 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-02-16 00:39:04,318 INFO L93 Difference]: Finished difference Result 306 states and 408 transitions. [2023-02-16 00:39:04,318 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2023-02-16 00:39:04,318 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-16 00:39:04,319 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-02-16 00:39:04,319 INFO L225 Difference]: With dead ends: 306 [2023-02-16 00:39:04,319 INFO L226 Difference]: Without dead ends: 229 [2023-02-16 00:39:04,321 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-16 00:39:04,321 INFO L413 NwaCegarLoop]: 60 mSDtfsCounter, 89 mSDsluCounter, 68 mSDsCounter, 0 mSdLazyCounter, 136 mSolverCounterSat, 9 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 89 SdHoareTripleChecker+Valid, 128 SdHoareTripleChecker+Invalid, 145 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 9 IncrementalHoareTripleChecker+Valid, 136 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2023-02-16 00:39:04,322 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [89 Valid, 128 Invalid, 145 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [9 Valid, 136 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2023-02-16 00:39:04,323 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 229 states. [2023-02-16 00:39:04,332 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 229 to 206. [2023-02-16 00:39:04,332 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 206 states, 205 states have (on average 1.3463414634146342) internal successors, (276), 205 states have internal predecessors, (276), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-02-16 00:39:04,333 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 206 states to 206 states and 276 transitions. [2023-02-16 00:39:04,333 INFO L78 Accepts]: Start accepts. Automaton has 206 states and 276 transitions. Word has length 42 [2023-02-16 00:39:04,333 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-02-16 00:39:04,333 INFO L495 AbstractCegarLoop]: Abstraction has 206 states and 276 transitions. [2023-02-16 00:39:04,333 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-16 00:39:04,333 INFO L276 IsEmpty]: Start isEmpty. Operand 206 states and 276 transitions. [2023-02-16 00:39:04,334 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 44 [2023-02-16 00:39:04,334 INFO L187 NwaCegarLoop]: Found error trace [2023-02-16 00:39:04,335 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] [2023-02-16 00:39:04,347 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-16 00:39:04,541 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-16 00:39:04,541 INFO L420 AbstractCegarLoop]: === Iteration 11 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-02-16 00:39:04,541 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2023-02-16 00:39:04,541 INFO L85 PathProgramCache]: Analyzing trace with hash -390869275, now seen corresponding path program 1 times [2023-02-16 00:39:04,542 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2023-02-16 00:39:04,542 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [2133386956] [2023-02-16 00:39:04,542 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-02-16 00:39:04,542 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-16 00:39:04,542 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2023-02-16 00:39:04,543 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-16 00:39:04,544 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-16 00:39:04,572 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-16 00:39:04,573 INFO L263 TraceCheckSpWp]: Trace formula consists of 85 conjuncts, 5 conjunts are in the unsatisfiable core [2023-02-16 00:39:04,574 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2023-02-16 00:39:04,629 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-16 00:39:04,630 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2023-02-16 00:39:04,630 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2023-02-16 00:39:04,630 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [2133386956] [2023-02-16 00:39:04,630 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleMathsat [2133386956] provided 1 perfect and 0 imperfect interpolant sequences [2023-02-16 00:39:04,630 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-02-16 00:39:04,630 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2023-02-16 00:39:04,630 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1311292300] [2023-02-16 00:39:04,630 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-02-16 00:39:04,630 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2023-02-16 00:39:04,630 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2023-02-16 00:39:04,630 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2023-02-16 00:39:04,631 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2023-02-16 00:39:04,631 INFO L87 Difference]: Start difference. First operand 206 states and 276 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-16 00:39:04,798 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-02-16 00:39:04,799 INFO L93 Difference]: Finished difference Result 389 states and 517 transitions. [2023-02-16 00:39:04,799 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2023-02-16 00:39:04,799 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-16 00:39:04,799 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-02-16 00:39:04,800 INFO L225 Difference]: With dead ends: 389 [2023-02-16 00:39:04,800 INFO L226 Difference]: Without dead ends: 312 [2023-02-16 00:39:04,800 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-16 00:39:04,801 INFO L413 NwaCegarLoop]: 106 mSDtfsCounter, 136 mSDsluCounter, 163 mSDsCounter, 0 mSdLazyCounter, 262 mSolverCounterSat, 9 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 136 SdHoareTripleChecker+Valid, 269 SdHoareTripleChecker+Invalid, 271 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 9 IncrementalHoareTripleChecker+Valid, 262 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2023-02-16 00:39:04,801 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [136 Valid, 269 Invalid, 271 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [9 Valid, 262 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2023-02-16 00:39:04,801 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 312 states. [2023-02-16 00:39:04,817 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 312 to 206. [2023-02-16 00:39:04,818 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 206 states, 205 states have (on average 1.3463414634146342) internal successors, (276), 205 states have internal predecessors, (276), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-02-16 00:39:04,818 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 206 states to 206 states and 276 transitions. [2023-02-16 00:39:04,818 INFO L78 Accepts]: Start accepts. Automaton has 206 states and 276 transitions. Word has length 43 [2023-02-16 00:39:04,819 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-02-16 00:39:04,819 INFO L495 AbstractCegarLoop]: Abstraction has 206 states and 276 transitions. [2023-02-16 00:39:04,819 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-16 00:39:04,820 INFO L276 IsEmpty]: Start isEmpty. Operand 206 states and 276 transitions. [2023-02-16 00:39:04,820 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 45 [2023-02-16 00:39:04,820 INFO L187 NwaCegarLoop]: Found error trace [2023-02-16 00:39:04,820 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-16 00:39:04,829 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-16 00:39:05,026 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-16 00:39:05,027 INFO L420 AbstractCegarLoop]: === Iteration 12 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-02-16 00:39:05,027 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2023-02-16 00:39:05,027 INFO L85 PathProgramCache]: Analyzing trace with hash -1822068338, now seen corresponding path program 1 times [2023-02-16 00:39:05,027 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2023-02-16 00:39:05,028 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1874788473] [2023-02-16 00:39:05,028 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-02-16 00:39:05,028 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-16 00:39:05,028 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2023-02-16 00:39:05,029 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-16 00:39:05,029 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-16 00:39:05,064 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-16 00:39:05,065 INFO L263 TraceCheckSpWp]: Trace formula consists of 88 conjuncts, 5 conjunts are in the unsatisfiable core [2023-02-16 00:39:05,066 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2023-02-16 00:39:05,149 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-16 00:39:05,149 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2023-02-16 00:39:05,216 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-16 00:39:05,217 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2023-02-16 00:39:05,217 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1874788473] [2023-02-16 00:39:05,217 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1874788473] provided 0 perfect and 2 imperfect interpolant sequences [2023-02-16 00:39:05,217 INFO L184 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2023-02-16 00:39:05,217 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [6, 6] total 10 [2023-02-16 00:39:05,217 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [243980986] [2023-02-16 00:39:05,217 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2023-02-16 00:39:05,217 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2023-02-16 00:39:05,217 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2023-02-16 00:39:05,218 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2023-02-16 00:39:05,218 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=32, Invalid=58, Unknown=0, NotChecked=0, Total=90 [2023-02-16 00:39:05,218 INFO L87 Difference]: Start difference. First operand 206 states and 276 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-16 00:39:05,430 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-02-16 00:39:05,430 INFO L93 Difference]: Finished difference Result 619 states and 939 transitions. [2023-02-16 00:39:05,430 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2023-02-16 00:39:05,430 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-16 00:39:05,430 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-02-16 00:39:05,432 INFO L225 Difference]: With dead ends: 619 [2023-02-16 00:39:05,432 INFO L226 Difference]: Without dead ends: 434 [2023-02-16 00:39:05,432 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-16 00:39:05,432 INFO L413 NwaCegarLoop]: 23 mSDtfsCounter, 182 mSDsluCounter, 76 mSDsCounter, 0 mSdLazyCounter, 270 mSolverCounterSat, 78 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 182 SdHoareTripleChecker+Valid, 99 SdHoareTripleChecker+Invalid, 348 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 78 IncrementalHoareTripleChecker+Valid, 270 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2023-02-16 00:39:05,432 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [182 Valid, 99 Invalid, 348 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [78 Valid, 270 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2023-02-16 00:39:05,433 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 434 states. [2023-02-16 00:39:05,444 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 434 to 353. [2023-02-16 00:39:05,445 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 353 states, 352 states have (on average 1.4318181818181819) internal successors, (504), 352 states have internal predecessors, (504), 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-16 00:39:05,446 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 353 states to 353 states and 504 transitions. [2023-02-16 00:39:05,446 INFO L78 Accepts]: Start accepts. Automaton has 353 states and 504 transitions. Word has length 44 [2023-02-16 00:39:05,446 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-02-16 00:39:05,446 INFO L495 AbstractCegarLoop]: Abstraction has 353 states and 504 transitions. [2023-02-16 00:39:05,446 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-16 00:39:05,446 INFO L276 IsEmpty]: Start isEmpty. Operand 353 states and 504 transitions. [2023-02-16 00:39:05,447 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 71 [2023-02-16 00:39:05,447 INFO L187 NwaCegarLoop]: Found error trace [2023-02-16 00:39:05,447 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-16 00:39:05,456 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-16 00:39:05,653 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-16 00:39:05,654 INFO L420 AbstractCegarLoop]: === Iteration 13 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-02-16 00:39:05,654 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2023-02-16 00:39:05,654 INFO L85 PathProgramCache]: Analyzing trace with hash 1373021230, now seen corresponding path program 1 times [2023-02-16 00:39:05,655 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2023-02-16 00:39:05,655 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [62251663] [2023-02-16 00:39:05,655 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-02-16 00:39:05,655 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-16 00:39:05,655 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2023-02-16 00:39:05,656 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-16 00:39:05,658 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-16 00:39:05,692 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-16 00:39:05,693 INFO L263 TraceCheckSpWp]: Trace formula consists of 126 conjuncts, 8 conjunts are in the unsatisfiable core [2023-02-16 00:39:05,697 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2023-02-16 00:39:05,755 INFO L134 CoverageAnalysis]: Checked inductivity of 82 backedges. 54 proven. 3 refuted. 0 times theorem prover too weak. 25 trivial. 0 not checked. [2023-02-16 00:39:05,755 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2023-02-16 00:39:05,821 INFO L134 CoverageAnalysis]: Checked inductivity of 82 backedges. 49 proven. 8 refuted. 0 times theorem prover too weak. 25 trivial. 0 not checked. [2023-02-16 00:39:05,821 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2023-02-16 00:39:05,821 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [62251663] [2023-02-16 00:39:05,821 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleMathsat [62251663] provided 0 perfect and 2 imperfect interpolant sequences [2023-02-16 00:39:05,822 INFO L184 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2023-02-16 00:39:05,822 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [6, 6] total 10 [2023-02-16 00:39:05,822 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [248206053] [2023-02-16 00:39:05,822 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2023-02-16 00:39:05,823 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2023-02-16 00:39:05,823 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2023-02-16 00:39:05,824 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2023-02-16 00:39:05,824 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=26, Invalid=64, Unknown=0, NotChecked=0, Total=90 [2023-02-16 00:39:05,824 INFO L87 Difference]: Start difference. First operand 353 states and 504 transitions. Second operand has 10 states, 10 states have (on average 9.0) internal successors, (90), 10 states have internal predecessors, (90), 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-16 00:39:06,006 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-02-16 00:39:06,007 INFO L93 Difference]: Finished difference Result 1121 states and 1560 transitions. [2023-02-16 00:39:06,007 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2023-02-16 00:39:06,007 INFO L78 Accepts]: Start accepts. Automaton has has 10 states, 10 states have (on average 9.0) internal successors, (90), 10 states have internal predecessors, (90), 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-16 00:39:06,007 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-02-16 00:39:06,009 INFO L225 Difference]: With dead ends: 1121 [2023-02-16 00:39:06,010 INFO L226 Difference]: Without dead ends: 790 [2023-02-16 00:39:06,010 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 145 GetRequests, 130 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-16 00:39:06,010 INFO L413 NwaCegarLoop]: 82 mSDtfsCounter, 235 mSDsluCounter, 256 mSDsCounter, 0 mSdLazyCounter, 132 mSolverCounterSat, 5 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 235 SdHoareTripleChecker+Valid, 338 SdHoareTripleChecker+Invalid, 137 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 5 IncrementalHoareTripleChecker+Valid, 132 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2023-02-16 00:39:06,011 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [235 Valid, 338 Invalid, 137 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [5 Valid, 132 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2023-02-16 00:39:06,011 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 790 states. [2023-02-16 00:39:06,031 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 790 to 472. [2023-02-16 00:39:06,031 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 472 states, 471 states have (on average 1.4522292993630572) internal successors, (684), 471 states have internal predecessors, (684), 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-16 00:39:06,032 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 472 states to 472 states and 684 transitions. [2023-02-16 00:39:06,033 INFO L78 Accepts]: Start accepts. Automaton has 472 states and 684 transitions. Word has length 70 [2023-02-16 00:39:06,033 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-02-16 00:39:06,033 INFO L495 AbstractCegarLoop]: Abstraction has 472 states and 684 transitions. [2023-02-16 00:39:06,033 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 10 states have (on average 9.0) internal successors, (90), 10 states have internal predecessors, (90), 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-16 00:39:06,033 INFO L276 IsEmpty]: Start isEmpty. Operand 472 states and 684 transitions. [2023-02-16 00:39:06,034 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 71 [2023-02-16 00:39:06,034 INFO L187 NwaCegarLoop]: Found error trace [2023-02-16 00:39:06,034 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-16 00:39:06,042 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-16 00:39:06,240 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-16 00:39:06,241 INFO L420 AbstractCegarLoop]: === Iteration 14 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-02-16 00:39:06,241 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2023-02-16 00:39:06,241 INFO L85 PathProgramCache]: Analyzing trace with hash 343661932, now seen corresponding path program 2 times [2023-02-16 00:39:06,241 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2023-02-16 00:39:06,241 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [437132796] [2023-02-16 00:39:06,241 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2023-02-16 00:39:06,241 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-16 00:39:06,241 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2023-02-16 00:39:06,242 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-16 00:39:06,243 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-16 00:39:06,280 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2023-02-16 00:39:06,280 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2023-02-16 00:39:06,281 INFO L263 TraceCheckSpWp]: Trace formula consists of 124 conjuncts, 8 conjunts are in the unsatisfiable core [2023-02-16 00:39:06,282 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2023-02-16 00:39:06,361 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-16 00:39:06,361 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2023-02-16 00:39:06,404 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-16 00:39:06,405 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2023-02-16 00:39:06,405 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [437132796] [2023-02-16 00:39:06,405 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleMathsat [437132796] provided 0 perfect and 2 imperfect interpolant sequences [2023-02-16 00:39:06,405 INFO L184 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2023-02-16 00:39:06,405 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [6, 5] total 9 [2023-02-16 00:39:06,405 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2053617326] [2023-02-16 00:39:06,405 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2023-02-16 00:39:06,406 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2023-02-16 00:39:06,406 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2023-02-16 00:39:06,406 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2023-02-16 00:39:06,406 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=21, Invalid=51, Unknown=0, NotChecked=0, Total=72 [2023-02-16 00:39:06,406 INFO L87 Difference]: Start difference. First operand 472 states and 684 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-16 00:39:06,569 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-02-16 00:39:06,569 INFO L93 Difference]: Finished difference Result 1214 states and 1676 transitions. [2023-02-16 00:39:06,569 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2023-02-16 00:39:06,570 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-16 00:39:06,570 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-02-16 00:39:06,572 INFO L225 Difference]: With dead ends: 1214 [2023-02-16 00:39:06,572 INFO L226 Difference]: Without dead ends: 764 [2023-02-16 00:39:06,572 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-16 00:39:06,573 INFO L413 NwaCegarLoop]: 87 mSDtfsCounter, 260 mSDsluCounter, 175 mSDsCounter, 0 mSdLazyCounter, 104 mSolverCounterSat, 12 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 260 SdHoareTripleChecker+Valid, 262 SdHoareTripleChecker+Invalid, 116 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 12 IncrementalHoareTripleChecker+Valid, 104 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2023-02-16 00:39:06,573 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [260 Valid, 262 Invalid, 116 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [12 Valid, 104 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2023-02-16 00:39:06,574 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 764 states. [2023-02-16 00:39:06,594 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 764 to 465. [2023-02-16 00:39:06,594 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 465 states, 464 states have (on average 1.4051724137931034) internal successors, (652), 464 states have internal predecessors, (652), 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-16 00:39:06,595 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 465 states to 465 states and 652 transitions. [2023-02-16 00:39:06,595 INFO L78 Accepts]: Start accepts. Automaton has 465 states and 652 transitions. Word has length 70 [2023-02-16 00:39:06,596 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-02-16 00:39:06,596 INFO L495 AbstractCegarLoop]: Abstraction has 465 states and 652 transitions. [2023-02-16 00:39:06,596 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-16 00:39:06,596 INFO L276 IsEmpty]: Start isEmpty. Operand 465 states and 652 transitions. [2023-02-16 00:39:06,597 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 71 [2023-02-16 00:39:06,597 INFO L187 NwaCegarLoop]: Found error trace [2023-02-16 00:39:06,597 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-16 00:39:06,604 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-16 00:39:06,803 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-16 00:39:06,804 INFO L420 AbstractCegarLoop]: === Iteration 15 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-02-16 00:39:06,804 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2023-02-16 00:39:06,804 INFO L85 PathProgramCache]: Analyzing trace with hash 484210542, now seen corresponding path program 3 times [2023-02-16 00:39:06,804 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2023-02-16 00:39:06,805 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1791749270] [2023-02-16 00:39:06,805 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2023-02-16 00:39:06,805 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-16 00:39:06,805 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2023-02-16 00:39:06,806 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-16 00:39:06,808 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-16 00:39:06,843 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 5 check-sat command(s) [2023-02-16 00:39:06,843 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2023-02-16 00:39:06,844 INFO L263 TraceCheckSpWp]: Trace formula consists of 122 conjuncts, 42 conjunts are in the unsatisfiable core [2023-02-16 00:39:06,847 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2023-02-16 00:39:08,801 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-16 00:39:08,801 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2023-02-16 00:39:10,782 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-16 00:39:10,783 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2023-02-16 00:39:10,783 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1791749270] [2023-02-16 00:39:10,783 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1791749270] provided 0 perfect and 2 imperfect interpolant sequences [2023-02-16 00:39:10,783 INFO L184 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2023-02-16 00:39:10,783 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [23, 24] total 45 [2023-02-16 00:39:10,783 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2034647342] [2023-02-16 00:39:10,783 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2023-02-16 00:39:10,783 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 45 states [2023-02-16 00:39:10,783 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2023-02-16 00:39:10,784 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 45 interpolants. [2023-02-16 00:39:10,784 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=148, Invalid=1832, Unknown=0, NotChecked=0, Total=1980 [2023-02-16 00:39:10,785 INFO L87 Difference]: Start difference. First operand 465 states and 652 transitions. Second operand has 45 states, 45 states have (on average 3.066666666666667) internal successors, (138), 45 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-16 00:39:22,880 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-02-16 00:39:22,880 INFO L93 Difference]: Finished difference Result 1736 states and 2294 transitions. [2023-02-16 00:39:22,881 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 77 states. [2023-02-16 00:39:22,881 INFO L78 Accepts]: Start accepts. Automaton has has 45 states, 45 states have (on average 3.066666666666667) internal successors, (138), 45 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-16 00:39:22,881 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-02-16 00:39:22,885 INFO L225 Difference]: With dead ends: 1736 [2023-02-16 00:39:22,885 INFO L226 Difference]: Without dead ends: 1615 [2023-02-16 00:39:22,889 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 212 GetRequests, 95 SyntacticMatches, 0 SemanticMatches, 117 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2659 ImplicationChecksByTransitivity, 11.1s TimeCoverageRelationStatistics Valid=2355, Invalid=11687, Unknown=0, NotChecked=0, Total=14042 [2023-02-16 00:39:22,889 INFO L413 NwaCegarLoop]: 366 mSDtfsCounter, 3185 mSDsluCounter, 7369 mSDsCounter, 0 mSdLazyCounter, 4205 mSolverCounterSat, 124 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 2.6s Time, 0 mProtectedPredicate, 0 mProtectedAction, 3185 SdHoareTripleChecker+Valid, 7735 SdHoareTripleChecker+Invalid, 4329 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 124 IncrementalHoareTripleChecker+Valid, 4205 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 3.0s IncrementalHoareTripleChecker+Time [2023-02-16 00:39:22,890 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [3185 Valid, 7735 Invalid, 4329 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [124 Valid, 4205 Invalid, 0 Unknown, 0 Unchecked, 3.0s Time] [2023-02-16 00:39:22,891 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1615 states. [2023-02-16 00:39:22,946 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1615 to 730. [2023-02-16 00:39:22,946 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 730 states, 729 states have (on average 1.4170096021947873) internal successors, (1033), 729 states have internal predecessors, (1033), 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-16 00:39:22,948 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 730 states to 730 states and 1033 transitions. [2023-02-16 00:39:22,948 INFO L78 Accepts]: Start accepts. Automaton has 730 states and 1033 transitions. Word has length 70 [2023-02-16 00:39:22,948 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-02-16 00:39:22,948 INFO L495 AbstractCegarLoop]: Abstraction has 730 states and 1033 transitions. [2023-02-16 00:39:22,948 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 45 states, 45 states have (on average 3.066666666666667) internal successors, (138), 45 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-16 00:39:22,949 INFO L276 IsEmpty]: Start isEmpty. Operand 730 states and 1033 transitions. [2023-02-16 00:39:22,949 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 71 [2023-02-16 00:39:22,949 INFO L187 NwaCegarLoop]: Found error trace [2023-02-16 00:39:22,950 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-16 00:39:22,964 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-16 00:39:23,156 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-16 00:39:23,156 INFO L420 AbstractCegarLoop]: === Iteration 16 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-02-16 00:39:23,157 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2023-02-16 00:39:23,157 INFO L85 PathProgramCache]: Analyzing trace with hash -247756884, now seen corresponding path program 1 times [2023-02-16 00:39:23,157 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2023-02-16 00:39:23,157 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [736044322] [2023-02-16 00:39:23,157 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-02-16 00:39:23,158 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-16 00:39:23,158 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2023-02-16 00:39:23,159 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-16 00:39:23,160 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-16 00:39:23,193 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-16 00:39:23,194 INFO L263 TraceCheckSpWp]: Trace formula consists of 121 conjuncts, 6 conjunts are in the unsatisfiable core [2023-02-16 00:39:23,195 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2023-02-16 00:39:23,246 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-16 00:39:23,246 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2023-02-16 00:39:23,246 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2023-02-16 00:39:23,246 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [736044322] [2023-02-16 00:39:23,246 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleMathsat [736044322] provided 1 perfect and 0 imperfect interpolant sequences [2023-02-16 00:39:23,246 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-02-16 00:39:23,246 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2023-02-16 00:39:23,247 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1332297338] [2023-02-16 00:39:23,247 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-02-16 00:39:23,247 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2023-02-16 00:39:23,247 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2023-02-16 00:39:23,247 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2023-02-16 00:39:23,247 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=29, Unknown=0, NotChecked=0, Total=42 [2023-02-16 00:39:23,248 INFO L87 Difference]: Start difference. First operand 730 states and 1033 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-16 00:39:23,431 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-02-16 00:39:23,431 INFO L93 Difference]: Finished difference Result 1181 states and 1655 transitions. [2023-02-16 00:39:23,432 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2023-02-16 00:39:23,432 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-16 00:39:23,432 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-02-16 00:39:23,434 INFO L225 Difference]: With dead ends: 1181 [2023-02-16 00:39:23,434 INFO L226 Difference]: Without dead ends: 985 [2023-02-16 00:39:23,435 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-16 00:39:23,435 INFO L413 NwaCegarLoop]: 145 mSDtfsCounter, 193 mSDsluCounter, 322 mSDsCounter, 0 mSdLazyCounter, 258 mSolverCounterSat, 9 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 193 SdHoareTripleChecker+Valid, 467 SdHoareTripleChecker+Invalid, 267 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 9 IncrementalHoareTripleChecker+Valid, 258 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2023-02-16 00:39:23,435 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [193 Valid, 467 Invalid, 267 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [9 Valid, 258 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2023-02-16 00:39:23,436 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 985 states. [2023-02-16 00:39:23,470 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 985 to 556. [2023-02-16 00:39:23,470 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 556 states, 555 states have (on average 1.4072072072072073) internal successors, (781), 555 states have internal predecessors, (781), 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-16 00:39:23,471 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 556 states to 556 states and 781 transitions. [2023-02-16 00:39:23,471 INFO L78 Accepts]: Start accepts. Automaton has 556 states and 781 transitions. Word has length 70 [2023-02-16 00:39:23,471 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-02-16 00:39:23,471 INFO L495 AbstractCegarLoop]: Abstraction has 556 states and 781 transitions. [2023-02-16 00:39:23,472 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-16 00:39:23,472 INFO L276 IsEmpty]: Start isEmpty. Operand 556 states and 781 transitions. [2023-02-16 00:39:23,472 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 73 [2023-02-16 00:39:23,472 INFO L187 NwaCegarLoop]: Found error trace [2023-02-16 00:39:23,473 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-16 00:39:23,481 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-16 00:39:23,678 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-16 00:39:23,679 INFO L420 AbstractCegarLoop]: === Iteration 17 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-02-16 00:39:23,679 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2023-02-16 00:39:23,679 INFO L85 PathProgramCache]: Analyzing trace with hash 946149333, now seen corresponding path program 1 times [2023-02-16 00:39:23,679 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2023-02-16 00:39:23,679 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1970943071] [2023-02-16 00:39:23,679 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-02-16 00:39:23,680 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-16 00:39:23,680 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2023-02-16 00:39:23,681 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-16 00:39:23,682 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-16 00:39:23,716 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-16 00:39:23,717 INFO L263 TraceCheckSpWp]: Trace formula consists of 124 conjuncts, 5 conjunts are in the unsatisfiable core [2023-02-16 00:39:23,718 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2023-02-16 00:39:23,872 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-16 00:39:23,872 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2023-02-16 00:39:23,980 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-16 00:39:23,981 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2023-02-16 00:39:23,981 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1970943071] [2023-02-16 00:39:23,981 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1970943071] provided 0 perfect and 2 imperfect interpolant sequences [2023-02-16 00:39:23,981 INFO L184 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2023-02-16 00:39:23,981 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [6, 6] total 10 [2023-02-16 00:39:23,981 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1790767688] [2023-02-16 00:39:23,981 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2023-02-16 00:39:23,982 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2023-02-16 00:39:23,982 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2023-02-16 00:39:23,982 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2023-02-16 00:39:23,982 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=32, Invalid=58, Unknown=0, NotChecked=0, Total=90 [2023-02-16 00:39:23,983 INFO L87 Difference]: Start difference. First operand 556 states and 781 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-16 00:39:24,675 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-02-16 00:39:24,675 INFO L93 Difference]: Finished difference Result 1226 states and 1743 transitions. [2023-02-16 00:39:24,675 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2023-02-16 00:39:24,675 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-16 00:39:24,676 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-02-16 00:39:24,678 INFO L225 Difference]: With dead ends: 1226 [2023-02-16 00:39:24,678 INFO L226 Difference]: Without dead ends: 1032 [2023-02-16 00:39:24,678 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 148 GetRequests, 134 SyntacticMatches, 0 SemanticMatches, 14 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 35 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=93, Invalid=147, Unknown=0, NotChecked=0, Total=240 [2023-02-16 00:39:24,679 INFO L413 NwaCegarLoop]: 62 mSDtfsCounter, 266 mSDsluCounter, 215 mSDsCounter, 0 mSdLazyCounter, 836 mSolverCounterSat, 71 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 266 SdHoareTripleChecker+Valid, 277 SdHoareTripleChecker+Invalid, 907 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 71 IncrementalHoareTripleChecker+Valid, 836 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.5s IncrementalHoareTripleChecker+Time [2023-02-16 00:39:24,679 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [266 Valid, 277 Invalid, 907 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [71 Valid, 836 Invalid, 0 Unknown, 0 Unchecked, 0.5s Time] [2023-02-16 00:39:24,679 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1032 states. [2023-02-16 00:39:24,725 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1032 to 868. [2023-02-16 00:39:24,726 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 868 states, 867 states have (on average 1.4209919261822377) internal successors, (1232), 867 states have internal predecessors, (1232), 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-16 00:39:24,727 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 868 states to 868 states and 1232 transitions. [2023-02-16 00:39:24,727 INFO L78 Accepts]: Start accepts. Automaton has 868 states and 1232 transitions. Word has length 72 [2023-02-16 00:39:24,727 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-02-16 00:39:24,727 INFO L495 AbstractCegarLoop]: Abstraction has 868 states and 1232 transitions. [2023-02-16 00:39:24,728 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-16 00:39:24,728 INFO L276 IsEmpty]: Start isEmpty. Operand 868 states and 1232 transitions. [2023-02-16 00:39:24,729 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 75 [2023-02-16 00:39:24,729 INFO L187 NwaCegarLoop]: Found error trace [2023-02-16 00:39:24,729 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-16 00:39:24,735 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-16 00:39:24,933 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-16 00:39:24,933 INFO L420 AbstractCegarLoop]: === Iteration 18 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-02-16 00:39:24,933 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2023-02-16 00:39:24,933 INFO L85 PathProgramCache]: Analyzing trace with hash -1135042114, now seen corresponding path program 1 times [2023-02-16 00:39:24,933 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2023-02-16 00:39:24,933 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [665408132] [2023-02-16 00:39:24,933 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-02-16 00:39:24,934 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-16 00:39:24,934 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2023-02-16 00:39:24,934 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-16 00:39:24,935 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-16 00:39:24,984 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-16 00:39:24,985 INFO L263 TraceCheckSpWp]: Trace formula consists of 128 conjuncts, 43 conjunts are in the unsatisfiable core [2023-02-16 00:39:24,987 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2023-02-16 00:39:27,083 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-16 00:39:27,083 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2023-02-16 00:39:29,483 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-16 00:39:29,483 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2023-02-16 00:39:29,483 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [665408132] [2023-02-16 00:39:29,483 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleMathsat [665408132] provided 0 perfect and 2 imperfect interpolant sequences [2023-02-16 00:39:29,483 INFO L184 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2023-02-16 00:39:29,483 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [24, 24] total 46 [2023-02-16 00:39:29,483 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [807978702] [2023-02-16 00:39:29,483 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2023-02-16 00:39:29,484 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 46 states [2023-02-16 00:39:29,484 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2023-02-16 00:39:29,484 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 46 interpolants. [2023-02-16 00:39:29,485 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=149, Invalid=1921, Unknown=0, NotChecked=0, Total=2070 [2023-02-16 00:39:29,485 INFO L87 Difference]: Start difference. First operand 868 states and 1232 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-16 00:40:09,516 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-02-16 00:40:09,517 INFO L93 Difference]: Finished difference Result 5167 states and 6948 transitions. [2023-02-16 00:40:09,517 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 199 states. [2023-02-16 00:40:09,517 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-16 00:40:09,517 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-02-16 00:40:09,527 INFO L225 Difference]: With dead ends: 5167 [2023-02-16 00:40:09,527 INFO L226 Difference]: Without dead ends: 4833 [2023-02-16 00:40:09,536 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 342 GetRequests, 102 SyntacticMatches, 0 SemanticMatches, 240 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 18245 ImplicationChecksByTransitivity, 35.3s TimeCoverageRelationStatistics Valid=7625, Invalid=50697, Unknown=0, NotChecked=0, Total=58322 [2023-02-16 00:40:09,536 INFO L413 NwaCegarLoop]: 715 mSDtfsCounter, 3334 mSDsluCounter, 14363 mSDsCounter, 0 mSdLazyCounter, 9030 mSolverCounterSat, 414 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 6.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 3334 SdHoareTripleChecker+Valid, 15078 SdHoareTripleChecker+Invalid, 9444 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 414 IncrementalHoareTripleChecker+Valid, 9030 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 6.6s IncrementalHoareTripleChecker+Time [2023-02-16 00:40:09,536 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [3334 Valid, 15078 Invalid, 9444 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [414 Valid, 9030 Invalid, 0 Unknown, 0 Unchecked, 6.6s Time] [2023-02-16 00:40:09,539 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 4833 states. [2023-02-16 00:40:09,715 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 4833 to 2640. [2023-02-16 00:40:09,717 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 2640 states, 2639 states have (on average 1.4369079196665404) internal successors, (3792), 2639 states have internal predecessors, (3792), 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-16 00:40:09,720 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2640 states to 2640 states and 3792 transitions. [2023-02-16 00:40:09,721 INFO L78 Accepts]: Start accepts. Automaton has 2640 states and 3792 transitions. Word has length 74 [2023-02-16 00:40:09,721 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-02-16 00:40:09,721 INFO L495 AbstractCegarLoop]: Abstraction has 2640 states and 3792 transitions. [2023-02-16 00:40:09,721 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-16 00:40:09,721 INFO L276 IsEmpty]: Start isEmpty. Operand 2640 states and 3792 transitions. [2023-02-16 00:40:09,723 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 75 [2023-02-16 00:40:09,723 INFO L187 NwaCegarLoop]: Found error trace [2023-02-16 00:40:09,723 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-16 00:40:09,735 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 (19)] Forceful destruction successful, exit code 0 [2023-02-16 00:40:09,930 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-16 00:40:09,930 INFO L420 AbstractCegarLoop]: === Iteration 19 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-02-16 00:40:09,930 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2023-02-16 00:40:09,930 INFO L85 PathProgramCache]: Analyzing trace with hash -777616002, now seen corresponding path program 1 times [2023-02-16 00:40:09,930 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2023-02-16 00:40:09,930 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [2055944143] [2023-02-16 00:40:09,930 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-02-16 00:40:09,931 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-16 00:40:09,931 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2023-02-16 00:40:09,932 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-16 00:40:09,935 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-16 00:40:09,966 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-16 00:40:09,967 INFO L263 TraceCheckSpWp]: Trace formula consists of 124 conjuncts, 41 conjunts are in the unsatisfiable core [2023-02-16 00:40:09,970 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2023-02-16 00:40:11,968 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-16 00:40:11,968 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2023-02-16 00:40:14,063 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-16 00:40:14,063 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2023-02-16 00:40:14,063 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [2055944143] [2023-02-16 00:40:14,064 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleMathsat [2055944143] provided 0 perfect and 2 imperfect interpolant sequences [2023-02-16 00:40:14,064 INFO L184 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2023-02-16 00:40:14,064 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [24, 24] total 46 [2023-02-16 00:40:14,064 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [219920756] [2023-02-16 00:40:14,064 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2023-02-16 00:40:14,064 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 46 states [2023-02-16 00:40:14,064 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2023-02-16 00:40:14,065 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 46 interpolants. [2023-02-16 00:40:14,065 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=137, Invalid=1933, Unknown=0, NotChecked=0, Total=2070 [2023-02-16 00:40:14,065 INFO L87 Difference]: Start difference. First operand 2640 states and 3792 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-16 00:40:34,676 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-02-16 00:40:34,676 INFO L93 Difference]: Finished difference Result 7390 states and 10334 transitions. [2023-02-16 00:40:34,677 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 104 states. [2023-02-16 00:40:34,677 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-16 00:40:34,677 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-02-16 00:40:34,688 INFO L225 Difference]: With dead ends: 7390 [2023-02-16 00:40:34,688 INFO L226 Difference]: Without dead ends: 5464 [2023-02-16 00:40:34,691 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 247 GetRequests, 102 SyntacticMatches, 0 SemanticMatches, 145 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5251 ImplicationChecksByTransitivity, 17.5s TimeCoverageRelationStatistics Valid=2685, Invalid=18777, Unknown=0, NotChecked=0, Total=21462 [2023-02-16 00:40:34,691 INFO L413 NwaCegarLoop]: 490 mSDtfsCounter, 1767 mSDsluCounter, 10149 mSDsCounter, 0 mSdLazyCounter, 6113 mSolverCounterSat, 110 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 4.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1767 SdHoareTripleChecker+Valid, 10639 SdHoareTripleChecker+Invalid, 6223 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 110 IncrementalHoareTripleChecker+Valid, 6113 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 4.8s IncrementalHoareTripleChecker+Time [2023-02-16 00:40:34,691 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [1767 Valid, 10639 Invalid, 6223 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [110 Valid, 6113 Invalid, 0 Unknown, 0 Unchecked, 4.8s Time] [2023-02-16 00:40:34,693 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 5464 states. [2023-02-16 00:40:34,915 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 5464 to 3148. [2023-02-16 00:40:34,917 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3148 states, 3147 states have (on average 1.4496345726088338) internal successors, (4562), 3147 states have internal predecessors, (4562), 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-16 00:40:34,921 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3148 states to 3148 states and 4562 transitions. [2023-02-16 00:40:34,921 INFO L78 Accepts]: Start accepts. Automaton has 3148 states and 4562 transitions. Word has length 74 [2023-02-16 00:40:34,922 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-02-16 00:40:34,922 INFO L495 AbstractCegarLoop]: Abstraction has 3148 states and 4562 transitions. [2023-02-16 00:40:34,922 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-16 00:40:34,922 INFO L276 IsEmpty]: Start isEmpty. Operand 3148 states and 4562 transitions. [2023-02-16 00:40:34,924 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 77 [2023-02-16 00:40:34,924 INFO L187 NwaCegarLoop]: Found error trace [2023-02-16 00:40:34,924 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-16 00:40:34,930 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-16 00:40:35,130 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-16 00:40:35,131 INFO L420 AbstractCegarLoop]: === Iteration 20 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-02-16 00:40:35,131 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2023-02-16 00:40:35,131 INFO L85 PathProgramCache]: Analyzing trace with hash -1420916641, now seen corresponding path program 1 times [2023-02-16 00:40:35,131 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2023-02-16 00:40:35,131 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [485304610] [2023-02-16 00:40:35,131 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-02-16 00:40:35,131 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-16 00:40:35,131 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2023-02-16 00:40:35,132 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-16 00:40:35,133 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-16 00:40:35,168 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-16 00:40:35,169 INFO L263 TraceCheckSpWp]: Trace formula consists of 129 conjuncts, 6 conjunts are in the unsatisfiable core [2023-02-16 00:40:35,170 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2023-02-16 00:40:35,299 INFO L134 CoverageAnalysis]: Checked inductivity of 83 backedges. 29 proven. 54 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-02-16 00:40:35,300 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2023-02-16 00:40:35,391 INFO L134 CoverageAnalysis]: Checked inductivity of 83 backedges. 29 proven. 54 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-02-16 00:40:35,391 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2023-02-16 00:40:35,391 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [485304610] [2023-02-16 00:40:35,391 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleMathsat [485304610] provided 0 perfect and 2 imperfect interpolant sequences [2023-02-16 00:40:35,391 INFO L184 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2023-02-16 00:40:35,391 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 7] total 12 [2023-02-16 00:40:35,391 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [214334045] [2023-02-16 00:40:35,391 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2023-02-16 00:40:35,392 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 12 states [2023-02-16 00:40:35,392 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2023-02-16 00:40:35,392 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2023-02-16 00:40:35,392 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=36, Invalid=96, Unknown=0, NotChecked=0, Total=132 [2023-02-16 00:40:35,392 INFO L87 Difference]: Start difference. First operand 3148 states and 4562 transitions. Second operand has 12 states, 12 states have (on average 10.166666666666666) internal successors, (122), 12 states have internal predecessors, (122), 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-16 00:40:36,556 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-02-16 00:40:36,556 INFO L93 Difference]: Finished difference Result 11929 states and 19086 transitions. [2023-02-16 00:40:36,561 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 16 states. [2023-02-16 00:40:36,561 INFO L78 Accepts]: Start accepts. Automaton has has 12 states, 12 states have (on average 10.166666666666666) internal successors, (122), 12 states have internal predecessors, (122), 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-16 00:40:36,561 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-02-16 00:40:36,572 INFO L225 Difference]: With dead ends: 11929 [2023-02-16 00:40:36,572 INFO L226 Difference]: Without dead ends: 5906 [2023-02-16 00:40:36,575 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 161 GetRequests, 140 SyntacticMatches, 4 SemanticMatches, 17 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 24 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=98, Invalid=244, Unknown=0, NotChecked=0, Total=342 [2023-02-16 00:40:36,576 INFO L413 NwaCegarLoop]: 25 mSDtfsCounter, 415 mSDsluCounter, 146 mSDsCounter, 0 mSdLazyCounter, 769 mSolverCounterSat, 128 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 415 SdHoareTripleChecker+Valid, 171 SdHoareTripleChecker+Invalid, 897 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 128 IncrementalHoareTripleChecker+Valid, 769 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2023-02-16 00:40:36,576 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [415 Valid, 171 Invalid, 897 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [128 Valid, 769 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time] [2023-02-16 00:40:36,579 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 5906 states. [2023-02-16 00:40:37,019 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 5906 to 4982. [2023-02-16 00:40:37,023 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 4982 states, 4981 states have (on average 1.2379040353342703) internal successors, (6166), 4981 states have internal predecessors, (6166), 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-16 00:40:37,029 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4982 states to 4982 states and 6166 transitions. [2023-02-16 00:40:37,029 INFO L78 Accepts]: Start accepts. Automaton has 4982 states and 6166 transitions. Word has length 76 [2023-02-16 00:40:37,029 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-02-16 00:40:37,029 INFO L495 AbstractCegarLoop]: Abstraction has 4982 states and 6166 transitions. [2023-02-16 00:40:37,029 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 12 states, 12 states have (on average 10.166666666666666) internal successors, (122), 12 states have internal predecessors, (122), 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-16 00:40:37,029 INFO L276 IsEmpty]: Start isEmpty. Operand 4982 states and 6166 transitions. [2023-02-16 00:40:37,030 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 78 [2023-02-16 00:40:37,030 INFO L187 NwaCegarLoop]: Found error trace [2023-02-16 00:40:37,030 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-16 00:40:37,044 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-16 00:40:37,240 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-16 00:40:37,241 INFO L420 AbstractCegarLoop]: === Iteration 21 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-02-16 00:40:37,241 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2023-02-16 00:40:37,241 INFO L85 PathProgramCache]: Analyzing trace with hash 881251465, now seen corresponding path program 1 times [2023-02-16 00:40:37,241 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2023-02-16 00:40:37,241 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [645543672] [2023-02-16 00:40:37,241 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-02-16 00:40:37,241 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-16 00:40:37,242 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2023-02-16 00:40:37,242 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-16 00:40:37,245 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-16 00:40:37,276 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-16 00:40:37,277 INFO L263 TraceCheckSpWp]: Trace formula consists of 133 conjuncts, 46 conjunts are in the unsatisfiable core [2023-02-16 00:40:37,279 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2023-02-16 00:40:39,811 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-16 00:40:39,811 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2023-02-16 00:40:43,163 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-16 00:40:43,164 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2023-02-16 00:40:43,164 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [645543672] [2023-02-16 00:40:43,164 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleMathsat [645543672] provided 0 perfect and 2 imperfect interpolant sequences [2023-02-16 00:40:43,164 INFO L184 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2023-02-16 00:40:43,164 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [26, 26] total 50 [2023-02-16 00:40:43,164 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1521290000] [2023-02-16 00:40:43,164 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2023-02-16 00:40:43,164 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 50 states [2023-02-16 00:40:43,164 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2023-02-16 00:40:43,165 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 50 interpolants. [2023-02-16 00:40:43,165 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=173, Invalid=2277, Unknown=0, NotChecked=0, Total=2450 [2023-02-16 00:40:43,165 INFO L87 Difference]: Start difference. First operand 4982 states and 6166 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-16 00:41:17,951 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-02-16 00:41:17,951 INFO L93 Difference]: Finished difference Result 6726 states and 8193 transitions. [2023-02-16 00:41:17,952 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 145 states. [2023-02-16 00:41:17,952 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-16 00:41:17,952 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-02-16 00:41:17,964 INFO L225 Difference]: With dead ends: 6726 [2023-02-16 00:41:17,964 INFO L226 Difference]: Without dead ends: 6469 [2023-02-16 00:41:17,966 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 294 GetRequests, 104 SyntacticMatches, 0 SemanticMatches, 190 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 9932 ImplicationChecksByTransitivity, 33.1s TimeCoverageRelationStatistics Valid=4517, Invalid=32155, Unknown=0, NotChecked=0, Total=36672 [2023-02-16 00:41:17,966 INFO L413 NwaCegarLoop]: 286 mSDtfsCounter, 2636 mSDsluCounter, 7306 mSDsCounter, 0 mSdLazyCounter, 4453 mSolverCounterSat, 262 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 4.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 2636 SdHoareTripleChecker+Valid, 7592 SdHoareTripleChecker+Invalid, 4715 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 262 IncrementalHoareTripleChecker+Valid, 4453 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 4.6s IncrementalHoareTripleChecker+Time [2023-02-16 00:41:17,967 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [2636 Valid, 7592 Invalid, 4715 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [262 Valid, 4453 Invalid, 0 Unknown, 0 Unchecked, 4.6s Time] [2023-02-16 00:41:17,969 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 6469 states. [2023-02-16 00:41:18,479 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 6469 to 5620. [2023-02-16 00:41:18,483 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 5620 states, 5619 states have (on average 1.2343833422317139) internal successors, (6936), 5619 states have internal predecessors, (6936), 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-16 00:41:18,489 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5620 states to 5620 states and 6936 transitions. [2023-02-16 00:41:18,489 INFO L78 Accepts]: Start accepts. Automaton has 5620 states and 6936 transitions. Word has length 77 [2023-02-16 00:41:18,489 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-02-16 00:41:18,489 INFO L495 AbstractCegarLoop]: Abstraction has 5620 states and 6936 transitions. [2023-02-16 00:41:18,489 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-16 00:41:18,489 INFO L276 IsEmpty]: Start isEmpty. Operand 5620 states and 6936 transitions. [2023-02-16 00:41:18,491 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 78 [2023-02-16 00:41:18,491 INFO L187 NwaCegarLoop]: Found error trace [2023-02-16 00:41:18,491 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-16 00:41:18,499 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 (22)] Forceful destruction successful, exit code 0 [2023-02-16 00:41:18,692 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 22 /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-16 00:41:18,693 INFO L420 AbstractCegarLoop]: === Iteration 22 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-02-16 00:41:18,693 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2023-02-16 00:41:18,693 INFO L85 PathProgramCache]: Analyzing trace with hash 1269946569, now seen corresponding path program 2 times [2023-02-16 00:41:18,693 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2023-02-16 00:41:18,693 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [137210708] [2023-02-16 00:41:18,693 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2023-02-16 00:41:18,693 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-16 00:41:18,694 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2023-02-16 00:41:18,694 INFO L229 MonitoredProcess]: Starting monitored process 23 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-16 00:41:18,695 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 (23)] Waiting until timeout for monitored process [2023-02-16 00:41:18,731 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2023-02-16 00:41:18,731 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2023-02-16 00:41:18,732 INFO L263 TraceCheckSpWp]: Trace formula consists of 129 conjuncts, 44 conjunts are in the unsatisfiable core [2023-02-16 00:41:18,733 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2023-02-16 00:41:21,309 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-16 00:41:21,309 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2023-02-16 00:41:24,267 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-16 00:41:24,267 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2023-02-16 00:41:24,267 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [137210708] [2023-02-16 00:41:24,267 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleMathsat [137210708] provided 0 perfect and 2 imperfect interpolant sequences [2023-02-16 00:41:24,267 INFO L184 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2023-02-16 00:41:24,267 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [26, 26] total 50 [2023-02-16 00:41:24,267 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1279289367] [2023-02-16 00:41:24,268 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2023-02-16 00:41:24,268 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 50 states [2023-02-16 00:41:24,268 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2023-02-16 00:41:24,268 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 50 interpolants. [2023-02-16 00:41:24,269 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=183, Invalid=2267, Unknown=0, NotChecked=0, Total=2450 [2023-02-16 00:41:24,269 INFO L87 Difference]: Start difference. First operand 5620 states and 6936 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-16 00:42:25,070 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-02-16 00:42:25,070 INFO L93 Difference]: Finished difference Result 9354 states and 11391 transitions. [2023-02-16 00:42:25,070 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 224 states. [2023-02-16 00:42:25,071 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-16 00:42:25,071 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-02-16 00:42:25,081 INFO L225 Difference]: With dead ends: 9354 [2023-02-16 00:42:25,081 INFO L226 Difference]: Without dead ends: 8454 [2023-02-16 00:42:25,085 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 373 GetRequests, 104 SyntacticMatches, 0 SemanticMatches, 269 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 24617 ImplicationChecksByTransitivity, 56.1s TimeCoverageRelationStatistics Valid=8391, Invalid=64779, Unknown=0, NotChecked=0, Total=73170 [2023-02-16 00:42:25,085 INFO L413 NwaCegarLoop]: 471 mSDtfsCounter, 3159 mSDsluCounter, 12042 mSDsCounter, 0 mSdLazyCounter, 7037 mSolverCounterSat, 317 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 6.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 3159 SdHoareTripleChecker+Valid, 12513 SdHoareTripleChecker+Invalid, 7354 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 317 IncrementalHoareTripleChecker+Valid, 7037 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 6.6s IncrementalHoareTripleChecker+Time [2023-02-16 00:42:25,085 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [3159 Valid, 12513 Invalid, 7354 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [317 Valid, 7037 Invalid, 0 Unknown, 0 Unchecked, 6.6s Time] [2023-02-16 00:42:25,090 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 8454 states. [2023-02-16 00:42:25,785 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 8454 to 6832. [2023-02-16 00:42:25,790 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 6832 states, 6831 states have (on average 1.2349582784365394) internal successors, (8436), 6831 states have internal predecessors, (8436), 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-16 00:42:25,795 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6832 states to 6832 states and 8436 transitions. [2023-02-16 00:42:25,795 INFO L78 Accepts]: Start accepts. Automaton has 6832 states and 8436 transitions. Word has length 77 [2023-02-16 00:42:25,795 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-02-16 00:42:25,795 INFO L495 AbstractCegarLoop]: Abstraction has 6832 states and 8436 transitions. [2023-02-16 00:42:25,795 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-16 00:42:25,795 INFO L276 IsEmpty]: Start isEmpty. Operand 6832 states and 8436 transitions. [2023-02-16 00:42:25,797 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 78 [2023-02-16 00:42:25,797 INFO L187 NwaCegarLoop]: Found error trace [2023-02-16 00:42:25,797 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-16 00:42:25,803 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 (23)] Forceful destruction successful, exit code 0 [2023-02-16 00:42:26,003 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 23 /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-16 00:42:26,004 INFO L420 AbstractCegarLoop]: === Iteration 23 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-02-16 00:42:26,004 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2023-02-16 00:42:26,004 INFO L85 PathProgramCache]: Analyzing trace with hash 1690097737, now seen corresponding path program 3 times [2023-02-16 00:42:26,004 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2023-02-16 00:42:26,004 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1508480428] [2023-02-16 00:42:26,004 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2023-02-16 00:42:26,004 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-16 00:42:26,004 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2023-02-16 00:42:26,005 INFO L229 MonitoredProcess]: Starting monitored process 24 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-16 00:42:26,006 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 (24)] Waiting until timeout for monitored process [2023-02-16 00:42:26,046 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 5 check-sat command(s) [2023-02-16 00:42:26,046 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2023-02-16 00:42:26,047 INFO L263 TraceCheckSpWp]: Trace formula consists of 129 conjuncts, 44 conjunts are in the unsatisfiable core [2023-02-16 00:42:26,049 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2023-02-16 00:42:28,686 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-16 00:42:28,686 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2023-02-16 00:42:31,650 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-16 00:42:31,650 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2023-02-16 00:42:31,650 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1508480428] [2023-02-16 00:42:31,650 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1508480428] provided 0 perfect and 2 imperfect interpolant sequences [2023-02-16 00:42:31,650 INFO L184 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2023-02-16 00:42:31,650 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [26, 25] total 49 [2023-02-16 00:42:31,650 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1550111700] [2023-02-16 00:42:31,650 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2023-02-16 00:42:31,650 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 49 states [2023-02-16 00:42:31,650 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2023-02-16 00:42:31,651 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 49 interpolants. [2023-02-16 00:42:31,651 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=155, Invalid=2197, Unknown=0, NotChecked=0, Total=2352 [2023-02-16 00:42:31,651 INFO L87 Difference]: Start difference. First operand 6832 states and 8436 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)