./Ultimate.py --spec ../sv-benchmarks/c/properties/unreach-call.prp --file ../sv-benchmarks/c/nla-digbench/prodbin-ll.c --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for ERROR reachability Using default analysis Version 574ddb4e 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/nla-digbench/prodbin-ll.c -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 77bbfba272f7904e5efe099569a5ed86d54de3fd07a8ce9d48301467c5048e30 --- Real Ultimate output --- This is Ultimate 0.2.2-?-574ddb4 [2023-02-17 06:49:57,212 INFO L177 SettingsManager]: Resetting all preferences to default values... [2023-02-17 06:49:57,213 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2023-02-17 06:49:57,245 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2023-02-17 06:49:57,245 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2023-02-17 06:49:57,248 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2023-02-17 06:49:57,249 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2023-02-17 06:49:57,251 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2023-02-17 06:49:57,252 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2023-02-17 06:49:57,255 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2023-02-17 06:49:57,256 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2023-02-17 06:49:57,258 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2023-02-17 06:49:57,258 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2023-02-17 06:49:57,260 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2023-02-17 06:49:57,261 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2023-02-17 06:49:57,262 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2023-02-17 06:49:57,262 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2023-02-17 06:49:57,264 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2023-02-17 06:49:57,264 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2023-02-17 06:49:57,268 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2023-02-17 06:49:57,269 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2023-02-17 06:49:57,270 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2023-02-17 06:49:57,270 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2023-02-17 06:49:57,271 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2023-02-17 06:49:57,277 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2023-02-17 06:49:57,277 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2023-02-17 06:49:57,277 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2023-02-17 06:49:57,278 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2023-02-17 06:49:57,279 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2023-02-17 06:49:57,279 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2023-02-17 06:49:57,280 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2023-02-17 06:49:57,281 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2023-02-17 06:49:57,282 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2023-02-17 06:49:57,282 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2023-02-17 06:49:57,283 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2023-02-17 06:49:57,283 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2023-02-17 06:49:57,283 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2023-02-17 06:49:57,283 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2023-02-17 06:49:57,284 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2023-02-17 06:49:57,285 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2023-02-17 06:49:57,286 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2023-02-17 06:49:57,286 INFO L101 SettingsManager]: Beginning loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Default.epf [2023-02-17 06:49:57,308 INFO L113 SettingsManager]: Loading preferences was successful [2023-02-17 06:49:57,308 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2023-02-17 06:49:57,309 INFO L136 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2023-02-17 06:49:57,309 INFO L138 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2023-02-17 06:49:57,310 INFO L136 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2023-02-17 06:49:57,310 INFO L138 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2023-02-17 06:49:57,310 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2023-02-17 06:49:57,310 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2023-02-17 06:49:57,310 INFO L138 SettingsManager]: * Use SBE=true [2023-02-17 06:49:57,311 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2023-02-17 06:49:57,311 INFO L138 SettingsManager]: * sizeof long=4 [2023-02-17 06:49:57,311 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2023-02-17 06:49:57,312 INFO L138 SettingsManager]: * sizeof POINTER=4 [2023-02-17 06:49:57,312 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2023-02-17 06:49:57,312 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2023-02-17 06:49:57,312 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2023-02-17 06:49:57,312 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2023-02-17 06:49:57,312 INFO L138 SettingsManager]: * sizeof long double=12 [2023-02-17 06:49:57,312 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2023-02-17 06:49:57,313 INFO L138 SettingsManager]: * Use constant arrays=true [2023-02-17 06:49:57,313 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2023-02-17 06:49:57,313 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2023-02-17 06:49:57,313 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2023-02-17 06:49:57,313 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2023-02-17 06:49:57,313 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2023-02-17 06:49:57,314 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2023-02-17 06:49:57,314 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2023-02-17 06:49:57,314 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2023-02-17 06:49:57,314 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2023-02-17 06:49:57,314 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2023-02-17 06:49:57,314 INFO L138 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2023-02-17 06:49:57,315 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2023-02-17 06:49:57,315 INFO L138 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2023-02-17 06:49:57,315 INFO L138 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2023-02-17 06:49:57,315 INFO L138 SettingsManager]: * Independence relation used for large block encoding in concurrent analysis=SYNTACTIC [2023-02-17 06:49:57,315 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 -> 77bbfba272f7904e5efe099569a5ed86d54de3fd07a8ce9d48301467c5048e30 [2023-02-17 06:49:57,514 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2023-02-17 06:49:57,534 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2023-02-17 06:49:57,536 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2023-02-17 06:49:57,537 INFO L271 PluginConnector]: Initializing CDTParser... [2023-02-17 06:49:57,537 INFO L275 PluginConnector]: CDTParser initialized [2023-02-17 06:49:57,538 INFO L432 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/nla-digbench/prodbin-ll.c [2023-02-17 06:49:58,489 INFO L500 CDTParser]: Created temporary CDT project at NULL [2023-02-17 06:49:58,648 INFO L351 CDTParser]: Found 1 translation units. [2023-02-17 06:49:58,648 INFO L172 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/nla-digbench/prodbin-ll.c [2023-02-17 06:49:58,653 INFO L394 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/ab49c65e8/39b7f9eb835b4c3e8720395be8984dd2/FLAG575ddfd3d [2023-02-17 06:49:58,669 INFO L402 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/ab49c65e8/39b7f9eb835b4c3e8720395be8984dd2 [2023-02-17 06:49:58,671 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2023-02-17 06:49:58,672 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2023-02-17 06:49:58,674 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2023-02-17 06:49:58,674 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2023-02-17 06:49:58,677 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2023-02-17 06:49:58,677 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 17.02 06:49:58" (1/1) ... [2023-02-17 06:49:58,678 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@340780e4 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.02 06:49:58, skipping insertion in model container [2023-02-17 06:49:58,678 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 17.02 06:49:58" (1/1) ... [2023-02-17 06:49:58,683 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2023-02-17 06:49:58,694 INFO L178 MainTranslator]: Built tables and reachable declarations [2023-02-17 06:49:58,806 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/nla-digbench/prodbin-ll.c[537,550] [2023-02-17 06:49:58,819 INFO L210 PostProcessor]: Analyzing one entry point: main [2023-02-17 06:49:58,828 INFO L203 MainTranslator]: Completed pre-run [2023-02-17 06:49:58,837 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/nla-digbench/prodbin-ll.c[537,550] [2023-02-17 06:49:58,841 INFO L210 PostProcessor]: Analyzing one entry point: main [2023-02-17 06:49:58,852 INFO L208 MainTranslator]: Completed translation [2023-02-17 06:49:58,853 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.02 06:49:58 WrapperNode [2023-02-17 06:49:58,853 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2023-02-17 06:49:58,854 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2023-02-17 06:49:58,854 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2023-02-17 06:49:58,854 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2023-02-17 06:49:58,859 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.02 06:49:58" (1/1) ... [2023-02-17 06:49:58,863 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.02 06:49:58" (1/1) ... [2023-02-17 06:49:58,875 INFO L138 Inliner]: procedures = 14, calls = 10, calls flagged for inlining = 3, calls inlined = 3, statements flattened = 43 [2023-02-17 06:49:58,876 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2023-02-17 06:49:58,876 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2023-02-17 06:49:58,876 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2023-02-17 06:49:58,876 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2023-02-17 06:49:58,882 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.02 06:49:58" (1/1) ... [2023-02-17 06:49:58,882 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.02 06:49:58" (1/1) ... [2023-02-17 06:49:58,883 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.02 06:49:58" (1/1) ... [2023-02-17 06:49:58,884 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.02 06:49:58" (1/1) ... [2023-02-17 06:49:58,885 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.02 06:49:58" (1/1) ... [2023-02-17 06:49:58,887 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.02 06:49:58" (1/1) ... [2023-02-17 06:49:58,888 INFO L185 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.02 06:49:58" (1/1) ... [2023-02-17 06:49:58,888 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.02 06:49:58" (1/1) ... [2023-02-17 06:49:58,889 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2023-02-17 06:49:58,890 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2023-02-17 06:49:58,890 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2023-02-17 06:49:58,890 INFO L275 PluginConnector]: RCFGBuilder initialized [2023-02-17 06:49:58,890 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.02 06:49:58" (1/1) ... [2023-02-17 06:49:58,895 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2023-02-17 06:49:58,903 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-02-17 06:49:58,914 INFO L229 MonitoredProcess]: Starting monitored process 1 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (exit command is (exit), workingDir is null) [2023-02-17 06:49:58,918 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-17 06:49:58,940 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2023-02-17 06:49:58,941 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2023-02-17 06:49:58,941 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2023-02-17 06:49:58,941 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2023-02-17 06:49:58,941 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_assert [2023-02-17 06:49:58,941 INFO L138 BoogieDeclarations]: Found implementation of procedure __VERIFIER_assert [2023-02-17 06:49:58,988 INFO L235 CfgBuilder]: Building ICFG [2023-02-17 06:49:58,990 INFO L261 CfgBuilder]: Building CFG for each procedure with an implementation [2023-02-17 06:49:59,066 INFO L276 CfgBuilder]: Performing block encoding [2023-02-17 06:49:59,069 INFO L295 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2023-02-17 06:49:59,069 INFO L300 CfgBuilder]: Removed 1 assume(true) statements. [2023-02-17 06:49:59,071 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 17.02 06:49:59 BoogieIcfgContainer [2023-02-17 06:49:59,071 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2023-02-17 06:49:59,072 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2023-02-17 06:49:59,072 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2023-02-17 06:49:59,074 INFO L275 PluginConnector]: TraceAbstraction initialized [2023-02-17 06:49:59,074 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 17.02 06:49:58" (1/3) ... [2023-02-17 06:49:59,075 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@18d2387b and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 17.02 06:49:59, skipping insertion in model container [2023-02-17 06:49:59,075 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.02 06:49:58" (2/3) ... [2023-02-17 06:49:59,075 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@18d2387b and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 17.02 06:49:59, skipping insertion in model container [2023-02-17 06:49:59,075 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 17.02 06:49:59" (3/3) ... [2023-02-17 06:49:59,076 INFO L112 eAbstractionObserver]: Analyzing ICFG prodbin-ll.c [2023-02-17 06:49:59,087 INFO L203 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2023-02-17 06:49:59,087 INFO L162 ceAbstractionStarter]: Applying trace abstraction to program that has 1 error locations. [2023-02-17 06:49:59,114 INFO L356 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2023-02-17 06:49:59,118 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;@6018cb02, mLbeIndependenceSettings=[IndependenceType=SYNTACTIC, AbstractionType=NONE, UseConditional=, UseSemiCommutativity=, Solver=, SolverTimeout=] [2023-02-17 06:49:59,118 INFO L358 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2023-02-17 06:49:59,121 INFO L276 IsEmpty]: Start isEmpty. Operand has 20 states, 15 states have (on average 1.4666666666666666) internal successors, (22), 16 states have internal predecessors, (22), 2 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2023-02-17 06:49:59,125 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 10 [2023-02-17 06:49:59,125 INFO L187 NwaCegarLoop]: Found error trace [2023-02-17 06:49:59,125 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-02-17 06:49:59,126 INFO L420 AbstractCegarLoop]: === Iteration 1 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-02-17 06:49:59,129 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2023-02-17 06:49:59,129 INFO L85 PathProgramCache]: Analyzing trace with hash -589251586, now seen corresponding path program 1 times [2023-02-17 06:49:59,135 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-02-17 06:49:59,135 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [619764324] [2023-02-17 06:49:59,135 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-02-17 06:49:59,135 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-02-17 06:49:59,209 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-17 06:49:59,231 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-02-17 06:49:59,231 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [619764324] [2023-02-17 06:49:59,232 WARN L310 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: Unsupported non-linear arithmetic [2023-02-17 06:49:59,232 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1106397520] [2023-02-17 06:49:59,232 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-02-17 06:49:59,232 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-02-17 06:49:59,233 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-02-17 06:49:59,235 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-17 06:49:59,236 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-17 06:49:59,286 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-17 06:49:59,289 INFO L263 TraceCheckSpWp]: Trace formula consists of 50 conjuncts, 1 conjunts are in the unsatisfiable core [2023-02-17 06:49:59,292 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2023-02-17 06:49:59,307 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-17 06:49:59,308 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2023-02-17 06:49:59,309 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1106397520] provided 1 perfect and 0 imperfect interpolant sequences [2023-02-17 06:49:59,309 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-02-17 06:49:59,310 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2023-02-17 06:49:59,311 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1564870108] [2023-02-17 06:49:59,311 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-02-17 06:49:59,314 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2023-02-17 06:49:59,314 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-02-17 06:49:59,338 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2023-02-17 06:49:59,338 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2023-02-17 06:49:59,340 INFO L87 Difference]: Start difference. First operand has 20 states, 15 states have (on average 1.4666666666666666) internal successors, (22), 16 states have internal predecessors, (22), 2 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) Second operand has 2 states, 2 states have (on average 4.0) internal successors, (8), 2 states have internal predecessors, (8), 1 states have call successors, (1), 1 states have call predecessors, (1), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-02-17 06:49:59,352 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-02-17 06:49:59,353 INFO L93 Difference]: Finished difference Result 37 states and 50 transitions. [2023-02-17 06:49:59,353 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2023-02-17 06:49:59,354 INFO L78 Accepts]: Start accepts. Automaton has has 2 states, 2 states have (on average 4.0) internal successors, (8), 2 states have internal predecessors, (8), 1 states have call successors, (1), 1 states have call predecessors, (1), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 9 [2023-02-17 06:49:59,354 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-02-17 06:49:59,358 INFO L225 Difference]: With dead ends: 37 [2023-02-17 06:49:59,358 INFO L226 Difference]: Without dead ends: 16 [2023-02-17 06:49:59,360 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 8 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-17 06:49:59,362 INFO L413 NwaCegarLoop]: 22 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, 22 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-17 06:49:59,373 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 22 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 0 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2023-02-17 06:49:59,384 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 16 states. [2023-02-17 06:49:59,401 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 16 to 16. [2023-02-17 06:49:59,402 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 16 states, 12 states have (on average 1.25) internal successors, (15), 13 states have internal predecessors, (15), 2 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2023-02-17 06:49:59,403 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 16 states to 16 states and 18 transitions. [2023-02-17 06:49:59,404 INFO L78 Accepts]: Start accepts. Automaton has 16 states and 18 transitions. Word has length 9 [2023-02-17 06:49:59,405 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-02-17 06:49:59,405 INFO L495 AbstractCegarLoop]: Abstraction has 16 states and 18 transitions. [2023-02-17 06:49:59,405 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 2 states, 2 states have (on average 4.0) internal successors, (8), 2 states have internal predecessors, (8), 1 states have call successors, (1), 1 states have call predecessors, (1), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-02-17 06:49:59,406 INFO L276 IsEmpty]: Start isEmpty. Operand 16 states and 18 transitions. [2023-02-17 06:49:59,407 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 10 [2023-02-17 06:49:59,407 INFO L187 NwaCegarLoop]: Found error trace [2023-02-17 06:49:59,407 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-02-17 06:49:59,426 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-17 06:49:59,614 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 2 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable0 [2023-02-17 06:49:59,615 INFO L420 AbstractCegarLoop]: === Iteration 2 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-02-17 06:49:59,617 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2023-02-17 06:49:59,617 INFO L85 PathProgramCache]: Analyzing trace with hash 1187543236, now seen corresponding path program 1 times [2023-02-17 06:49:59,617 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-02-17 06:49:59,617 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [457626445] [2023-02-17 06:49:59,618 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-02-17 06:49:59,618 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-02-17 06:49:59,641 ERROR L245 FreeRefinementEngine]: Caught known exception: Unsupported non-linear arithmetic [2023-02-17 06:49:59,642 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [1256505389] [2023-02-17 06:49:59,642 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-02-17 06:49:59,642 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-02-17 06:49:59,642 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-02-17 06:49:59,664 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-17 06:49:59,667 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-17 06:49:59,724 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-17 06:49:59,725 INFO L263 TraceCheckSpWp]: Trace formula consists of 50 conjuncts, 12 conjunts are in the unsatisfiable core [2023-02-17 06:49:59,726 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2023-02-17 06:49:59,750 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-17 06:49:59,750 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2023-02-17 06:49:59,751 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-02-17 06:49:59,751 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [457626445] [2023-02-17 06:49:59,751 WARN L310 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2023-02-17 06:49:59,751 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1256505389] [2023-02-17 06:49:59,751 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1256505389] provided 1 perfect and 0 imperfect interpolant sequences [2023-02-17 06:49:59,752 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-02-17 06:49:59,752 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2023-02-17 06:49:59,752 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2134619884] [2023-02-17 06:49:59,752 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-02-17 06:49:59,753 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2023-02-17 06:49:59,753 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-02-17 06:49:59,753 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2023-02-17 06:49:59,754 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2023-02-17 06:49:59,754 INFO L87 Difference]: Start difference. First operand 16 states and 18 transitions. Second operand has 5 states, 5 states have (on average 1.6) internal successors, (8), 4 states have internal predecessors, (8), 1 states have call successors, (1), 1 states have call predecessors, (1), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-02-17 06:49:59,806 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-02-17 06:49:59,806 INFO L93 Difference]: Finished difference Result 28 states and 32 transitions. [2023-02-17 06:49:59,807 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2023-02-17 06:49:59,807 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 1.6) internal successors, (8), 4 states have internal predecessors, (8), 1 states have call successors, (1), 1 states have call predecessors, (1), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 9 [2023-02-17 06:49:59,807 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-02-17 06:49:59,807 INFO L225 Difference]: With dead ends: 28 [2023-02-17 06:49:59,808 INFO L226 Difference]: Without dead ends: 26 [2023-02-17 06:49:59,808 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 5 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-17 06:49:59,809 INFO L413 NwaCegarLoop]: 12 mSDtfsCounter, 8 mSDsluCounter, 27 mSDsCounter, 0 mSdLazyCounter, 39 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 9 SdHoareTripleChecker+Valid, 39 SdHoareTripleChecker+Invalid, 39 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 39 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2023-02-17 06:49:59,809 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [9 Valid, 39 Invalid, 39 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 39 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2023-02-17 06:49:59,810 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 26 states. [2023-02-17 06:49:59,817 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 26 to 22. [2023-02-17 06:49:59,818 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 22 states, 16 states have (on average 1.1875) internal successors, (19), 18 states have internal predecessors, (19), 3 states have call successors, (3), 2 states have call predecessors, (3), 2 states have return successors, (2), 1 states have call predecessors, (2), 2 states have call successors, (2) [2023-02-17 06:49:59,818 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 22 states to 22 states and 24 transitions. [2023-02-17 06:49:59,818 INFO L78 Accepts]: Start accepts. Automaton has 22 states and 24 transitions. Word has length 9 [2023-02-17 06:49:59,819 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-02-17 06:49:59,819 INFO L495 AbstractCegarLoop]: Abstraction has 22 states and 24 transitions. [2023-02-17 06:49:59,819 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 1.6) internal successors, (8), 4 states have internal predecessors, (8), 1 states have call successors, (1), 1 states have call predecessors, (1), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-02-17 06:49:59,819 INFO L276 IsEmpty]: Start isEmpty. Operand 22 states and 24 transitions. [2023-02-17 06:49:59,819 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 16 [2023-02-17 06:49:59,820 INFO L187 NwaCegarLoop]: Found error trace [2023-02-17 06:49:59,821 INFO L195 NwaCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-02-17 06:49:59,839 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-17 06:50:00,021 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,SelfDestructingSolverStorable1 [2023-02-17 06:50:00,022 INFO L420 AbstractCegarLoop]: === Iteration 3 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-02-17 06:50:00,022 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2023-02-17 06:50:00,022 INFO L85 PathProgramCache]: Analyzing trace with hash -423389445, now seen corresponding path program 1 times [2023-02-17 06:50:00,023 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-02-17 06:50:00,023 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [598484863] [2023-02-17 06:50:00,023 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-02-17 06:50:00,023 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-02-17 06:50:00,030 ERROR L245 FreeRefinementEngine]: Caught known exception: Unsupported non-linear arithmetic [2023-02-17 06:50:00,030 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [2134515693] [2023-02-17 06:50:00,030 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-02-17 06:50:00,030 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-02-17 06:50:00,030 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-02-17 06:50:00,046 INFO L229 MonitoredProcess]: Starting monitored process 4 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2023-02-17 06:50:00,047 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Waiting until timeout for monitored process [2023-02-17 06:50:00,075 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-17 06:50:00,076 INFO L263 TraceCheckSpWp]: Trace formula consists of 61 conjuncts, 7 conjunts are in the unsatisfiable core [2023-02-17 06:50:00,077 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2023-02-17 06:50:00,105 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 2 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-02-17 06:50:00,105 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2023-02-17 06:50:00,105 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-02-17 06:50:00,106 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [598484863] [2023-02-17 06:50:00,106 WARN L310 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2023-02-17 06:50:00,106 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [2134515693] [2023-02-17 06:50:00,106 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [2134515693] provided 1 perfect and 0 imperfect interpolant sequences [2023-02-17 06:50:00,106 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-02-17 06:50:00,106 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2023-02-17 06:50:00,107 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1609711694] [2023-02-17 06:50:00,107 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-02-17 06:50:00,107 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2023-02-17 06:50:00,107 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-02-17 06:50:00,108 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2023-02-17 06:50:00,108 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2023-02-17 06:50:00,108 INFO L87 Difference]: Start difference. First operand 22 states and 24 transitions. Second operand has 5 states, 5 states have (on average 2.4) internal successors, (12), 5 states have internal predecessors, (12), 2 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2023-02-17 06:50:00,153 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-02-17 06:50:00,153 INFO L93 Difference]: Finished difference Result 32 states and 35 transitions. [2023-02-17 06:50:00,154 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2023-02-17 06:50:00,154 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 2.4) internal successors, (12), 5 states have internal predecessors, (12), 2 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 15 [2023-02-17 06:50:00,154 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-02-17 06:50:00,157 INFO L225 Difference]: With dead ends: 32 [2023-02-17 06:50:00,157 INFO L226 Difference]: Without dead ends: 25 [2023-02-17 06:50:00,157 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 16 GetRequests, 11 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=17, Invalid=25, Unknown=0, NotChecked=0, Total=42 [2023-02-17 06:50:00,158 INFO L413 NwaCegarLoop]: 14 mSDtfsCounter, 25 mSDsluCounter, 20 mSDsCounter, 0 mSdLazyCounter, 21 mSolverCounterSat, 4 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 25 SdHoareTripleChecker+Valid, 34 SdHoareTripleChecker+Invalid, 25 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 4 IncrementalHoareTripleChecker+Valid, 21 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2023-02-17 06:50:00,158 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [25 Valid, 34 Invalid, 25 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [4 Valid, 21 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2023-02-17 06:50:00,159 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 25 states. [2023-02-17 06:50:00,163 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 25 to 23. [2023-02-17 06:50:00,165 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 23 states, 17 states have (on average 1.1764705882352942) internal successors, (20), 18 states have internal predecessors, (20), 3 states have call successors, (3), 2 states have call predecessors, (3), 2 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2023-02-17 06:50:00,165 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 23 states to 23 states and 25 transitions. [2023-02-17 06:50:00,166 INFO L78 Accepts]: Start accepts. Automaton has 23 states and 25 transitions. Word has length 15 [2023-02-17 06:50:00,166 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-02-17 06:50:00,166 INFO L495 AbstractCegarLoop]: Abstraction has 23 states and 25 transitions. [2023-02-17 06:50:00,166 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 2.4) internal successors, (12), 5 states have internal predecessors, (12), 2 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2023-02-17 06:50:00,166 INFO L276 IsEmpty]: Start isEmpty. Operand 23 states and 25 transitions. [2023-02-17 06:50:00,167 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 19 [2023-02-17 06:50:00,167 INFO L187 NwaCegarLoop]: Found error trace [2023-02-17 06:50:00,167 INFO L195 NwaCegarLoop]: trace histogram [2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-02-17 06:50:00,174 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Forceful destruction successful, exit code 0 [2023-02-17 06:50:00,372 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2,4 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-02-17 06:50:00,372 INFO L420 AbstractCegarLoop]: === Iteration 4 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-02-17 06:50:00,373 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2023-02-17 06:50:00,373 INFO L85 PathProgramCache]: Analyzing trace with hash -1566145315, now seen corresponding path program 1 times [2023-02-17 06:50:00,373 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-02-17 06:50:00,373 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [870557632] [2023-02-17 06:50:00,373 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-02-17 06:50:00,373 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-02-17 06:50:00,380 ERROR L245 FreeRefinementEngine]: Caught known exception: Unsupported non-linear arithmetic [2023-02-17 06:50:00,380 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [1510290340] [2023-02-17 06:50:00,381 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-02-17 06:50:00,381 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-02-17 06:50:00,381 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-02-17 06:50:00,382 INFO L229 MonitoredProcess]: Starting monitored process 5 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2023-02-17 06:50:00,384 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Waiting until timeout for monitored process [2023-02-17 06:50:00,419 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-17 06:50:00,420 INFO L263 TraceCheckSpWp]: Trace formula consists of 71 conjuncts, 32 conjunts are in the unsatisfiable core [2023-02-17 06:50:00,422 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2023-02-17 06:50:00,576 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 1 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-02-17 06:50:00,576 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2023-02-17 06:50:03,939 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 3 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-02-17 06:50:03,939 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-02-17 06:50:03,939 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [870557632] [2023-02-17 06:50:03,939 WARN L310 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2023-02-17 06:50:03,939 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1510290340] [2023-02-17 06:50:03,940 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1510290340] provided 0 perfect and 2 imperfect interpolant sequences [2023-02-17 06:50:03,940 INFO L184 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2023-02-17 06:50:03,940 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [11, 8] total 16 [2023-02-17 06:50:03,940 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [222858340] [2023-02-17 06:50:03,940 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2023-02-17 06:50:03,941 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 16 states [2023-02-17 06:50:03,941 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-02-17 06:50:03,941 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 16 interpolants. [2023-02-17 06:50:03,942 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=45, Invalid=195, Unknown=0, NotChecked=0, Total=240 [2023-02-17 06:50:03,942 INFO L87 Difference]: Start difference. First operand 23 states and 25 transitions. Second operand has 16 states, 16 states have (on average 1.6875) internal successors, (27), 15 states have internal predecessors, (27), 4 states have call successors, (4), 3 states have call predecessors, (4), 1 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2023-02-17 06:50:08,316 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-02-17 06:50:08,317 INFO L93 Difference]: Finished difference Result 41 states and 47 transitions. [2023-02-17 06:50:08,317 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2023-02-17 06:50:08,318 INFO L78 Accepts]: Start accepts. Automaton has has 16 states, 16 states have (on average 1.6875) internal successors, (27), 15 states have internal predecessors, (27), 4 states have call successors, (4), 3 states have call predecessors, (4), 1 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) Word has length 18 [2023-02-17 06:50:08,318 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-02-17 06:50:08,319 INFO L225 Difference]: With dead ends: 41 [2023-02-17 06:50:08,320 INFO L226 Difference]: Without dead ends: 39 [2023-02-17 06:50:08,320 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 48 GetRequests, 21 SyntacticMatches, 3 SemanticMatches, 24 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 93 ImplicationChecksByTransitivity, 5.5s TimeCoverageRelationStatistics Valid=132, Invalid=517, Unknown=1, NotChecked=0, Total=650 [2023-02-17 06:50:08,321 INFO L413 NwaCegarLoop]: 9 mSDtfsCounter, 58 mSDsluCounter, 38 mSDsCounter, 0 mSdLazyCounter, 170 mSolverCounterSat, 23 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 2.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 58 SdHoareTripleChecker+Valid, 47 SdHoareTripleChecker+Invalid, 193 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 23 IncrementalHoareTripleChecker+Valid, 170 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 2.2s IncrementalHoareTripleChecker+Time [2023-02-17 06:50:08,321 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [58 Valid, 47 Invalid, 193 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [23 Valid, 170 Invalid, 0 Unknown, 0 Unchecked, 2.2s Time] [2023-02-17 06:50:08,322 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 39 states. [2023-02-17 06:50:08,327 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 39 to 36. [2023-02-17 06:50:08,327 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 36 states, 27 states have (on average 1.2222222222222223) internal successors, (33), 29 states have internal predecessors, (33), 5 states have call successors, (5), 3 states have call predecessors, (5), 3 states have return successors, (4), 3 states have call predecessors, (4), 4 states have call successors, (4) [2023-02-17 06:50:08,328 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 36 states to 36 states and 42 transitions. [2023-02-17 06:50:08,328 INFO L78 Accepts]: Start accepts. Automaton has 36 states and 42 transitions. Word has length 18 [2023-02-17 06:50:08,328 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-02-17 06:50:08,328 INFO L495 AbstractCegarLoop]: Abstraction has 36 states and 42 transitions. [2023-02-17 06:50:08,328 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 16 states, 16 states have (on average 1.6875) internal successors, (27), 15 states have internal predecessors, (27), 4 states have call successors, (4), 3 states have call predecessors, (4), 1 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2023-02-17 06:50:08,328 INFO L276 IsEmpty]: Start isEmpty. Operand 36 states and 42 transitions. [2023-02-17 06:50:08,329 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 25 [2023-02-17 06:50:08,329 INFO L187 NwaCegarLoop]: Found error trace [2023-02-17 06:50:08,329 INFO L195 NwaCegarLoop]: trace histogram [3, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-02-17 06:50:08,336 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Forceful destruction successful, exit code 0 [2023-02-17 06:50:08,530 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3,5 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-02-17 06:50:08,530 INFO L420 AbstractCegarLoop]: === Iteration 5 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-02-17 06:50:08,530 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2023-02-17 06:50:08,530 INFO L85 PathProgramCache]: Analyzing trace with hash 1499753556, now seen corresponding path program 1 times [2023-02-17 06:50:08,531 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-02-17 06:50:08,531 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [94086132] [2023-02-17 06:50:08,531 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-02-17 06:50:08,531 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-02-17 06:50:08,537 ERROR L245 FreeRefinementEngine]: Caught known exception: Unsupported non-linear arithmetic [2023-02-17 06:50:08,537 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [618112674] [2023-02-17 06:50:08,537 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-02-17 06:50:08,537 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-02-17 06:50:08,537 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-02-17 06:50:08,545 INFO L229 MonitoredProcess]: Starting monitored process 6 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2023-02-17 06:50:08,548 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (6)] Waiting until timeout for monitored process [2023-02-17 06:50:08,580 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-17 06:50:08,581 INFO L263 TraceCheckSpWp]: Trace formula consists of 82 conjuncts, 13 conjunts are in the unsatisfiable core [2023-02-17 06:50:08,582 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2023-02-17 06:50:08,620 INFO L134 CoverageAnalysis]: Checked inductivity of 11 backedges. 7 proven. 1 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2023-02-17 06:50:08,620 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2023-02-17 06:50:08,659 INFO L134 CoverageAnalysis]: Checked inductivity of 11 backedges. 7 proven. 1 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2023-02-17 06:50:08,660 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-02-17 06:50:08,660 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [94086132] [2023-02-17 06:50:08,660 WARN L310 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2023-02-17 06:50:08,660 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [618112674] [2023-02-17 06:50:08,660 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [618112674] provided 0 perfect and 2 imperfect interpolant sequences [2023-02-17 06:50:08,661 INFO L184 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2023-02-17 06:50:08,661 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [8, 7] total 12 [2023-02-17 06:50:08,661 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1775691585] [2023-02-17 06:50:08,661 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2023-02-17 06:50:08,661 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 12 states [2023-02-17 06:50:08,661 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-02-17 06:50:08,662 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2023-02-17 06:50:08,662 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=33, Invalid=99, Unknown=0, NotChecked=0, Total=132 [2023-02-17 06:50:08,662 INFO L87 Difference]: Start difference. First operand 36 states and 42 transitions. Second operand has 12 states, 10 states have (on average 2.3) internal successors, (23), 9 states have internal predecessors, (23), 3 states have call successors, (3), 3 states have call predecessors, (3), 2 states have return successors, (3), 3 states have call predecessors, (3), 1 states have call successors, (3) [2023-02-17 06:50:09,497 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-02-17 06:50:09,498 INFO L93 Difference]: Finished difference Result 43 states and 48 transitions. [2023-02-17 06:50:09,498 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2023-02-17 06:50:09,498 INFO L78 Accepts]: Start accepts. Automaton has has 12 states, 10 states have (on average 2.3) internal successors, (23), 9 states have internal predecessors, (23), 3 states have call successors, (3), 3 states have call predecessors, (3), 2 states have return successors, (3), 3 states have call predecessors, (3), 1 states have call successors, (3) Word has length 24 [2023-02-17 06:50:09,499 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-02-17 06:50:09,499 INFO L225 Difference]: With dead ends: 43 [2023-02-17 06:50:09,499 INFO L226 Difference]: Without dead ends: 36 [2023-02-17 06:50:09,499 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 49 GetRequests, 35 SyntacticMatches, 2 SemanticMatches, 12 ConstructedPredicates, 0 IntricatePredicates, 1 DeprecatedPredicates, 28 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=48, Invalid=134, Unknown=0, NotChecked=0, Total=182 [2023-02-17 06:50:09,500 INFO L413 NwaCegarLoop]: 12 mSDtfsCounter, 16 mSDsluCounter, 44 mSDsCounter, 0 mSdLazyCounter, 78 mSolverCounterSat, 2 mSolverCounterUnsat, 1 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.8s Time, 0 mProtectedPredicate, 0 mProtectedAction, 16 SdHoareTripleChecker+Valid, 56 SdHoareTripleChecker+Invalid, 81 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 78 IncrementalHoareTripleChecker+Invalid, 1 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.8s IncrementalHoareTripleChecker+Time [2023-02-17 06:50:09,500 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [16 Valid, 56 Invalid, 81 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 78 Invalid, 1 Unknown, 0 Unchecked, 0.8s Time] [2023-02-17 06:50:09,501 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 36 states. [2023-02-17 06:50:09,505 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 36 to 35. [2023-02-17 06:50:09,505 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 35 states, 27 states have (on average 1.1481481481481481) internal successors, (31), 28 states have internal predecessors, (31), 4 states have call successors, (4), 3 states have call predecessors, (4), 3 states have return successors, (4), 3 states have call predecessors, (4), 4 states have call successors, (4) [2023-02-17 06:50:09,506 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 35 states to 35 states and 39 transitions. [2023-02-17 06:50:09,506 INFO L78 Accepts]: Start accepts. Automaton has 35 states and 39 transitions. Word has length 24 [2023-02-17 06:50:09,506 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-02-17 06:50:09,506 INFO L495 AbstractCegarLoop]: Abstraction has 35 states and 39 transitions. [2023-02-17 06:50:09,506 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 12 states, 10 states have (on average 2.3) internal successors, (23), 9 states have internal predecessors, (23), 3 states have call successors, (3), 3 states have call predecessors, (3), 2 states have return successors, (3), 3 states have call predecessors, (3), 1 states have call successors, (3) [2023-02-17 06:50:09,506 INFO L276 IsEmpty]: Start isEmpty. Operand 35 states and 39 transitions. [2023-02-17 06:50:09,507 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 28 [2023-02-17 06:50:09,507 INFO L187 NwaCegarLoop]: Found error trace [2023-02-17 06:50:09,507 INFO L195 NwaCegarLoop]: trace histogram [3, 3, 3, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1] [2023-02-17 06:50:09,525 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (6)] Forceful destruction successful, exit code 0 [2023-02-17 06:50:09,712 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4,6 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-02-17 06:50:09,712 INFO L420 AbstractCegarLoop]: === Iteration 6 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-02-17 06:50:09,713 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2023-02-17 06:50:09,713 INFO L85 PathProgramCache]: Analyzing trace with hash 972175140, now seen corresponding path program 1 times [2023-02-17 06:50:09,713 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-02-17 06:50:09,713 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [736191708] [2023-02-17 06:50:09,713 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-02-17 06:50:09,713 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-02-17 06:50:09,719 ERROR L245 FreeRefinementEngine]: Caught known exception: Unsupported non-linear arithmetic [2023-02-17 06:50:09,719 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [1757380568] [2023-02-17 06:50:09,719 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-02-17 06:50:09,720 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-02-17 06:50:09,720 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-02-17 06:50:09,721 INFO L229 MonitoredProcess]: Starting monitored process 7 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2023-02-17 06:50:09,723 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (7)] Waiting until timeout for monitored process [2023-02-17 06:50:09,753 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-17 06:50:09,754 INFO L263 TraceCheckSpWp]: Trace formula consists of 82 conjuncts, 32 conjunts are in the unsatisfiable core [2023-02-17 06:50:09,755 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2023-02-17 06:50:10,726 INFO L134 CoverageAnalysis]: Checked inductivity of 17 backedges. 3 proven. 13 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2023-02-17 06:50:10,727 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2023-02-17 06:50:43,187 INFO L134 CoverageAnalysis]: Checked inductivity of 17 backedges. 3 proven. 13 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2023-02-17 06:50:43,188 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-02-17 06:50:43,188 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [736191708] [2023-02-17 06:50:43,188 WARN L310 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2023-02-17 06:50:43,188 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1757380568] [2023-02-17 06:50:43,188 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1757380568] provided 0 perfect and 2 imperfect interpolant sequences [2023-02-17 06:50:43,188 INFO L184 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2023-02-17 06:50:43,188 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [13, 13] total 23 [2023-02-17 06:50:43,188 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1985583089] [2023-02-17 06:50:43,188 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2023-02-17 06:50:43,189 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 23 states [2023-02-17 06:50:43,189 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-02-17 06:50:43,189 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 23 interpolants. [2023-02-17 06:50:43,190 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=93, Invalid=409, Unknown=4, NotChecked=0, Total=506 [2023-02-17 06:50:43,190 INFO L87 Difference]: Start difference. First operand 35 states and 39 transitions. Second operand has 23 states, 23 states have (on average 1.6521739130434783) internal successors, (38), 22 states have internal predecessors, (38), 6 states have call successors, (6), 3 states have call predecessors, (6), 2 states have return successors, (4), 4 states have call predecessors, (4), 4 states have call successors, (4) [2023-02-17 06:50:48,976 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=true, quantifiers [1] [2023-02-17 06:50:51,525 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.89s for a HTC check with result VALID. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=true, quantifiers [] [2023-02-17 06:50:55,373 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.28s for a HTC check with result INVALID. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=true, quantifiers [1] [2023-02-17 06:50:56,585 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.17s for a HTC check with result VALID. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=true, quantifiers [1] [2023-02-17 06:51:02,574 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=true, quantifiers [] [2023-02-17 06:51:06,832 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=true, quantifiers [1] [2023-02-17 06:51:12,429 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.87s for a HTC check with result VALID. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=true, quantifiers [] [2023-02-17 06:51:19,707 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=true, quantifiers [1] [2023-02-17 06:51:24,924 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=true, quantifiers [] [2023-02-17 06:51:28,258 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.09s for a HTC check with result INVALID. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=true, quantifiers [1] [2023-02-17 06:51:29,426 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.16s for a HTC check with result INVALID. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=true, quantifiers [1] [2023-02-17 06:51:30,462 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-02-17 06:51:30,462 INFO L93 Difference]: Finished difference Result 70 states and 84 transitions. [2023-02-17 06:51:30,463 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 22 states. [2023-02-17 06:51:30,463 INFO L78 Accepts]: Start accepts. Automaton has has 23 states, 23 states have (on average 1.6521739130434783) internal successors, (38), 22 states have internal predecessors, (38), 6 states have call successors, (6), 3 states have call predecessors, (6), 2 states have return successors, (4), 4 states have call predecessors, (4), 4 states have call successors, (4) Word has length 27 [2023-02-17 06:51:30,463 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-02-17 06:51:30,464 INFO L225 Difference]: With dead ends: 70 [2023-02-17 06:51:30,464 INFO L226 Difference]: Without dead ends: 68 [2023-02-17 06:51:30,464 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 73 GetRequests, 30 SyntacticMatches, 5 SemanticMatches, 38 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 400 ImplicationChecksByTransitivity, 40.1s TimeCoverageRelationStatistics Valid=317, Invalid=1238, Unknown=5, NotChecked=0, Total=1560 [2023-02-17 06:51:30,465 INFO L413 NwaCegarLoop]: 10 mSDtfsCounter, 74 mSDsluCounter, 62 mSDsCounter, 0 mSdLazyCounter, 236 mSolverCounterSat, 50 mSolverCounterUnsat, 5 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 33.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 75 SdHoareTripleChecker+Valid, 72 SdHoareTripleChecker+Invalid, 291 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 50 IncrementalHoareTripleChecker+Valid, 236 IncrementalHoareTripleChecker+Invalid, 5 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 33.1s IncrementalHoareTripleChecker+Time [2023-02-17 06:51:30,465 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [75 Valid, 72 Invalid, 291 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [50 Valid, 236 Invalid, 5 Unknown, 0 Unchecked, 33.1s Time] [2023-02-17 06:51:30,466 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 68 states. [2023-02-17 06:51:30,474 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 68 to 60. [2023-02-17 06:51:30,474 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 60 states, 46 states have (on average 1.1521739130434783) internal successors, (53), 49 states have internal predecessors, (53), 9 states have call successors, (9), 4 states have call predecessors, (9), 4 states have return successors, (9), 6 states have call predecessors, (9), 9 states have call successors, (9) [2023-02-17 06:51:30,475 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 60 states to 60 states and 71 transitions. [2023-02-17 06:51:30,477 INFO L78 Accepts]: Start accepts. Automaton has 60 states and 71 transitions. Word has length 27 [2023-02-17 06:51:30,477 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-02-17 06:51:30,477 INFO L495 AbstractCegarLoop]: Abstraction has 60 states and 71 transitions. [2023-02-17 06:51:30,478 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 23 states, 23 states have (on average 1.6521739130434783) internal successors, (38), 22 states have internal predecessors, (38), 6 states have call successors, (6), 3 states have call predecessors, (6), 2 states have return successors, (4), 4 states have call predecessors, (4), 4 states have call successors, (4) [2023-02-17 06:51:30,478 INFO L276 IsEmpty]: Start isEmpty. Operand 60 states and 71 transitions. [2023-02-17 06:51:30,479 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 37 [2023-02-17 06:51:30,479 INFO L187 NwaCegarLoop]: Found error trace [2023-02-17 06:51:30,479 INFO L195 NwaCegarLoop]: trace histogram [4, 4, 4, 3, 3, 3, 3, 3, 2, 1, 1, 1, 1, 1, 1, 1] [2023-02-17 06:51:30,489 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (7)] Forceful destruction successful, exit code 0 [2023-02-17 06:51:30,680 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5,7 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-02-17 06:51:30,681 INFO L420 AbstractCegarLoop]: === Iteration 7 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-02-17 06:51:30,681 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2023-02-17 06:51:30,681 INFO L85 PathProgramCache]: Analyzing trace with hash -1400320259, now seen corresponding path program 1 times [2023-02-17 06:51:30,681 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-02-17 06:51:30,683 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [348903238] [2023-02-17 06:51:30,683 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-02-17 06:51:30,683 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-02-17 06:51:30,696 ERROR L245 FreeRefinementEngine]: Caught known exception: Unsupported non-linear arithmetic [2023-02-17 06:51:30,698 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [2037355944] [2023-02-17 06:51:30,698 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-02-17 06:51:30,698 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-02-17 06:51:30,698 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-02-17 06:51:30,701 INFO L229 MonitoredProcess]: Starting monitored process 8 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2023-02-17 06:51:30,705 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (8)] Waiting until timeout for monitored process [2023-02-17 06:51:30,742 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-17 06:51:30,744 INFO L263 TraceCheckSpWp]: Trace formula consists of 103 conjuncts, 43 conjunts are in the unsatisfiable core [2023-02-17 06:51:30,746 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2023-02-17 06:51:33,478 INFO L134 CoverageAnalysis]: Checked inductivity of 39 backedges. 10 proven. 23 refuted. 0 times theorem prover too weak. 6 trivial. 0 not checked. [2023-02-17 06:51:33,478 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2023-02-17 06:52:58,723 WARN L859 $PredicateComparison]: unable to prove that (let ((.cse0 (mod |c_ULTIMATE.start_main_~y~0#1| 2))) (or (and (< |c_ULTIMATE.start_main_~y~0#1| 0) (not (= 0 .cse0))) (not (= 1 .cse0)) (let ((.cse22 (* 2 |c_ULTIMATE.start_main_~x~0#1|))) (let ((.cse5 (* 2 .cse22)) (.cse13 (+ |c_ULTIMATE.start_main_~y~0#1| (- 1)))) (let ((.cse23 (= 0 (mod (+ |c_ULTIMATE.start_main_~y~0#1| 1) 2))) (.cse24 (< .cse13 0)) (.cse10 (* 2 .cse5)) (.cse7 (* |c_ULTIMATE.start_main_~a~0#1| |c_ULTIMATE.start_main_~b~0#1|)) (.cse21 (div .cse13 2))) (and (or (let ((.cse9 (= 0 (mod .cse21 2))) (.cse8 (< .cse21 0)) (.cse4 (+ (* (- 1) .cse21 .cse22) .cse7)) (.cse6 (div .cse13 4))) (and (let ((.cse3 (mod .cse6 2)) (.cse12 (< .cse6 0))) (let ((.cse1 (not .cse12)) (.cse2 (= 0 .cse3))) (or (and (or .cse1 .cse2) (= 1 .cse3)) (not (= (+ .cse4 (* .cse5 .cse6)) .cse7)) (and .cse8 (not .cse9)) (let ((.cse11 (div .cse13 8))) (and (or (= (+ .cse4 (* .cse10 .cse11)) .cse7) (and .cse12 (not .cse2))) (or (= (+ .cse4 (* .cse10 (+ 1 .cse11))) .cse7) .cse1 .cse2)))))) (let ((.cse17 (+ 1 .cse6)) (.cse20 (+ .cse6 1))) (let ((.cse14 (mod .cse20 2)) (.cse18 (< .cse17 0))) (let ((.cse15 (not .cse18)) (.cse16 (= 0 .cse14))) (or .cse9 (and (= 1 .cse14) (or .cse15 .cse16)) (not .cse8) (not (= (+ .cse4 (* .cse5 .cse17)) .cse7)) (let ((.cse19 (div .cse20 2))) (and (or (and .cse18 (not .cse16)) (= (+ .cse4 (* .cse10 .cse19)) .cse7)) (or .cse15 .cse16 (= (+ .cse4 (* .cse10 (+ 1 .cse19))) .cse7)))))))))) (and (not .cse23) .cse24)) (or .cse23 (not .cse24) (let ((.cse40 (+ .cse21 1)) (.cse42 (+ 1 .cse21))) (let ((.cse34 (< .cse42 0)) (.cse32 (= 0 (mod .cse40 2))) (.cse25 (+ (* (- 1) .cse42 .cse22) .cse7)) (.cse35 (div .cse40 2))) (and (let ((.cse31 (+ .cse35 1)) (.cse26 (+ 1 .cse35))) (let ((.cse28 (< .cse26 0)) (.cse33 (mod .cse31 2))) (let ((.cse27 (= 0 .cse33)) (.cse30 (not .cse28))) (or (not (= (+ .cse25 (* .cse5 .cse26)) .cse7)) (let ((.cse29 (div .cse31 2))) (and (or (and (not .cse27) .cse28) (= (+ .cse25 (* .cse10 .cse29)) .cse7)) (or .cse27 .cse30 (= (+ .cse25 (* .cse10 (+ 1 .cse29))) .cse7)))) .cse32 (and (or .cse27 .cse30) (= 1 .cse33)) (not .cse34))))) (let ((.cse41 (mod .cse35 2)) (.cse39 (< .cse35 0))) (let ((.cse36 (not .cse39)) (.cse37 (= 0 .cse41))) (or (let ((.cse38 (div .cse40 4))) (and (or .cse36 .cse37 (= (+ .cse25 (* .cse10 (+ 1 .cse38))) .cse7)) (or (and .cse39 (not .cse37)) (= (+ .cse25 (* .cse10 .cse38)) .cse7)))) (and .cse34 (not .cse32)) (and (or .cse36 .cse37) (= 1 .cse41)) (not (= (+ .cse25 (* .cse5 .cse35)) .cse7))))))))))))))) is different from true [2023-02-17 06:53:00,847 WARN L859 $PredicateComparison]: unable to prove that (let ((.cse0 (mod |c_ULTIMATE.start_main_~b~0#1| 2))) (or (and (< |c_ULTIMATE.start_main_~b~0#1| 0) (not (= 0 .cse0))) (not (= 1 .cse0)) (let ((.cse67 (+ |c_ULTIMATE.start_main_~b~0#1| (- 1)))) (let ((.cse35 (= 0 (mod (+ |c_ULTIMATE.start_main_~b~0#1| 1) 2))) (.cse36 (< .cse67 0)) (.cse34 (div .cse67 2))) (and (or (let ((.cse18 (+ .cse34 1)) (.cse12 (+ 1 .cse34))) (let ((.cse2 (< .cse12 0)) (.cse1 (= 0 (mod .cse18 2))) (.cse10 (div .cse18 2))) (and (let ((.cse3 (mod .cse10 2)) (.cse13 (< .cse10 0))) (let ((.cse4 (not .cse13)) (.cse5 (= 0 .cse3))) (or (and (not .cse1) .cse2) (and (= 1 .cse3) (or .cse4 .cse5)) (let ((.cse8 (div .cse18 4))) (and (or (forall ((|ULTIMATE.start_main_~a~0#1| Int)) (let ((.cse11 (* 2 |ULTIMATE.start_main_~a~0#1|)) (.cse9 (* |ULTIMATE.start_main_~a~0#1| |c_ULTIMATE.start_main_~b~0#1|))) (let ((.cse6 (+ (* (- 1) .cse12 .cse11) .cse9)) (.cse7 (* 2 .cse11))) (or (= (+ .cse6 (* (* 2 .cse7) .cse8)) .cse9) (not (= (+ .cse6 (* .cse7 .cse10)) .cse9)))))) (and .cse13 (not .cse5))) (or (forall ((|ULTIMATE.start_main_~a~0#1| Int)) (let ((.cse17 (* 2 |ULTIMATE.start_main_~a~0#1|)) (.cse16 (* |ULTIMATE.start_main_~a~0#1| |c_ULTIMATE.start_main_~b~0#1|))) (let ((.cse14 (+ (* (- 1) .cse12 .cse17) .cse16)) (.cse15 (* 2 .cse17))) (or (not (= (+ .cse14 (* .cse15 .cse10)) .cse16)) (= (+ .cse14 (* (* 2 .cse15) (+ 1 .cse8))) .cse16))))) .cse4 .cse5)))))) (let ((.cse32 (+ .cse10 1)) (.cse21 (+ 1 .cse10))) (let ((.cse31 (< .cse21 0)) (.cse33 (mod .cse32 2))) (let ((.cse25 (= 0 .cse33)) (.cse26 (not .cse31))) (or (let ((.cse23 (div .cse32 2))) (and (or (forall ((|ULTIMATE.start_main_~a~0#1| Int)) (let ((.cse24 (* 2 |ULTIMATE.start_main_~a~0#1|)) (.cse22 (* |ULTIMATE.start_main_~a~0#1| |c_ULTIMATE.start_main_~b~0#1|))) (let ((.cse19 (+ (* (- 1) .cse12 .cse24) .cse22)) (.cse20 (* 2 .cse24))) (or (not (= (+ .cse19 (* .cse20 .cse21)) .cse22)) (= (+ .cse19 (* (* 2 .cse20) (+ 1 .cse23))) .cse22))))) .cse25 .cse26) (or (forall ((|ULTIMATE.start_main_~a~0#1| Int)) (let ((.cse30 (* 2 |ULTIMATE.start_main_~a~0#1|)) (.cse29 (* |ULTIMATE.start_main_~a~0#1| |c_ULTIMATE.start_main_~b~0#1|))) (let ((.cse27 (+ (* (- 1) .cse12 .cse30) .cse29)) (.cse28 (* 2 .cse30))) (or (not (= (+ .cse27 (* .cse28 .cse21)) .cse29)) (= (+ .cse27 (* (* 2 .cse28) .cse23)) .cse29))))) (and .cse31 (not .cse25))))) (and (= 1 .cse33) (or .cse25 .cse26)) (not .cse2) .cse1))))))) .cse35 (not .cse36)) (or (and (not .cse35) .cse36) (let ((.cse52 (< .cse34 0)) (.cse51 (= 0 (mod .cse34 2))) (.cse54 (div .cse67 4))) (and (let ((.cse41 (+ 1 .cse54)) (.cse50 (+ .cse54 1))) (let ((.cse53 (mod .cse50 2)) (.cse43 (< .cse41 0))) (let ((.cse45 (not .cse43)) (.cse44 (= 0 .cse53))) (or (let ((.cse39 (div .cse50 2))) (and (or (forall ((|ULTIMATE.start_main_~a~0#1| Int)) (let ((.cse42 (* 2 |ULTIMATE.start_main_~a~0#1|)) (.cse40 (* |ULTIMATE.start_main_~a~0#1| |c_ULTIMATE.start_main_~b~0#1|))) (let ((.cse37 (+ (* (- 1) .cse34 .cse42) .cse40)) (.cse38 (* 2 .cse42))) (or (= (+ .cse37 (* (* 2 .cse38) .cse39)) .cse40) (not (= (+ .cse37 (* .cse38 .cse41)) .cse40)))))) (and .cse43 (not .cse44))) (or .cse45 (forall ((|ULTIMATE.start_main_~a~0#1| Int)) (let ((.cse49 (* 2 |ULTIMATE.start_main_~a~0#1|)) (.cse48 (* |ULTIMATE.start_main_~a~0#1| |c_ULTIMATE.start_main_~b~0#1|))) (let ((.cse46 (+ (* (- 1) .cse34 .cse49) .cse48)) (.cse47 (* 2 .cse49))) (or (= (+ .cse46 (* (* 2 .cse47) (+ 1 .cse39))) .cse48) (not (= (+ .cse46 (* .cse47 .cse41)) .cse48)))))) .cse44))) .cse51 (not .cse52) (and (= 1 .cse53) (or .cse45 .cse44)))))) (let ((.cse68 (mod .cse54 2)) (.cse60 (< .cse54 0))) (let ((.cse66 (not .cse60)) (.cse61 (= 0 .cse68))) (or (and .cse52 (not .cse51)) (let ((.cse57 (div .cse67 8))) (and (or (forall ((|ULTIMATE.start_main_~a~0#1| Int)) (let ((.cse59 (* 2 |ULTIMATE.start_main_~a~0#1|)) (.cse58 (* |ULTIMATE.start_main_~a~0#1| |c_ULTIMATE.start_main_~b~0#1|))) (let ((.cse55 (+ (* (- 1) .cse34 .cse59) .cse58)) (.cse56 (* 2 .cse59))) (or (= (+ .cse55 (* (* 2 .cse56) .cse57)) .cse58) (not (= (+ .cse55 (* .cse56 .cse54)) .cse58)))))) (and .cse60 (not .cse61))) (or (forall ((|ULTIMATE.start_main_~a~0#1| Int)) (let ((.cse65 (* 2 |ULTIMATE.start_main_~a~0#1|)) (.cse64 (* |ULTIMATE.start_main_~a~0#1| |c_ULTIMATE.start_main_~b~0#1|))) (let ((.cse62 (+ (* (- 1) .cse34 .cse65) .cse64)) (.cse63 (* 2 .cse65))) (or (= (+ .cse62 (* (* 2 .cse63) (+ 1 .cse57))) .cse64) (not (= (+ .cse62 (* .cse63 .cse54)) .cse64)))))) .cse66 .cse61))) (and (or .cse66 .cse61) (= 1 .cse68))))))))))))) is different from true [2023-02-17 06:53:02,902 WARN L859 $PredicateComparison]: unable to prove that (let ((.cse0 (mod |c_ULTIMATE.start_main_~b~0#1| 2))) (or (= 0 |c_ULTIMATE.start_assume_abort_if_not_~cond#1|) (and (< |c_ULTIMATE.start_main_~b~0#1| 0) (not (= 0 .cse0))) (not (= 1 .cse0)) (let ((.cse67 (+ |c_ULTIMATE.start_main_~b~0#1| (- 1)))) (let ((.cse35 (= 0 (mod (+ |c_ULTIMATE.start_main_~b~0#1| 1) 2))) (.cse36 (< .cse67 0)) (.cse34 (div .cse67 2))) (and (or (let ((.cse18 (+ .cse34 1)) (.cse12 (+ 1 .cse34))) (let ((.cse2 (< .cse12 0)) (.cse1 (= 0 (mod .cse18 2))) (.cse10 (div .cse18 2))) (and (let ((.cse3 (mod .cse10 2)) (.cse13 (< .cse10 0))) (let ((.cse4 (not .cse13)) (.cse5 (= 0 .cse3))) (or (and (not .cse1) .cse2) (and (= 1 .cse3) (or .cse4 .cse5)) (let ((.cse8 (div .cse18 4))) (and (or (forall ((|ULTIMATE.start_main_~a~0#1| Int)) (let ((.cse11 (* 2 |ULTIMATE.start_main_~a~0#1|)) (.cse9 (* |ULTIMATE.start_main_~a~0#1| |c_ULTIMATE.start_main_~b~0#1|))) (let ((.cse6 (+ (* (- 1) .cse12 .cse11) .cse9)) (.cse7 (* 2 .cse11))) (or (= (+ .cse6 (* (* 2 .cse7) .cse8)) .cse9) (not (= (+ .cse6 (* .cse7 .cse10)) .cse9)))))) (and .cse13 (not .cse5))) (or (forall ((|ULTIMATE.start_main_~a~0#1| Int)) (let ((.cse17 (* 2 |ULTIMATE.start_main_~a~0#1|)) (.cse16 (* |ULTIMATE.start_main_~a~0#1| |c_ULTIMATE.start_main_~b~0#1|))) (let ((.cse14 (+ (* (- 1) .cse12 .cse17) .cse16)) (.cse15 (* 2 .cse17))) (or (not (= (+ .cse14 (* .cse15 .cse10)) .cse16)) (= (+ .cse14 (* (* 2 .cse15) (+ 1 .cse8))) .cse16))))) .cse4 .cse5)))))) (let ((.cse32 (+ .cse10 1)) (.cse21 (+ 1 .cse10))) (let ((.cse31 (< .cse21 0)) (.cse33 (mod .cse32 2))) (let ((.cse25 (= 0 .cse33)) (.cse26 (not .cse31))) (or (let ((.cse23 (div .cse32 2))) (and (or (forall ((|ULTIMATE.start_main_~a~0#1| Int)) (let ((.cse24 (* 2 |ULTIMATE.start_main_~a~0#1|)) (.cse22 (* |ULTIMATE.start_main_~a~0#1| |c_ULTIMATE.start_main_~b~0#1|))) (let ((.cse19 (+ (* (- 1) .cse12 .cse24) .cse22)) (.cse20 (* 2 .cse24))) (or (not (= (+ .cse19 (* .cse20 .cse21)) .cse22)) (= (+ .cse19 (* (* 2 .cse20) (+ 1 .cse23))) .cse22))))) .cse25 .cse26) (or (forall ((|ULTIMATE.start_main_~a~0#1| Int)) (let ((.cse30 (* 2 |ULTIMATE.start_main_~a~0#1|)) (.cse29 (* |ULTIMATE.start_main_~a~0#1| |c_ULTIMATE.start_main_~b~0#1|))) (let ((.cse27 (+ (* (- 1) .cse12 .cse30) .cse29)) (.cse28 (* 2 .cse30))) (or (not (= (+ .cse27 (* .cse28 .cse21)) .cse29)) (= (+ .cse27 (* (* 2 .cse28) .cse23)) .cse29))))) (and .cse31 (not .cse25))))) (and (= 1 .cse33) (or .cse25 .cse26)) (not .cse2) .cse1))))))) .cse35 (not .cse36)) (or (and (not .cse35) .cse36) (let ((.cse52 (< .cse34 0)) (.cse51 (= 0 (mod .cse34 2))) (.cse54 (div .cse67 4))) (and (let ((.cse41 (+ 1 .cse54)) (.cse50 (+ .cse54 1))) (let ((.cse53 (mod .cse50 2)) (.cse43 (< .cse41 0))) (let ((.cse45 (not .cse43)) (.cse44 (= 0 .cse53))) (or (let ((.cse39 (div .cse50 2))) (and (or (forall ((|ULTIMATE.start_main_~a~0#1| Int)) (let ((.cse42 (* 2 |ULTIMATE.start_main_~a~0#1|)) (.cse40 (* |ULTIMATE.start_main_~a~0#1| |c_ULTIMATE.start_main_~b~0#1|))) (let ((.cse37 (+ (* (- 1) .cse34 .cse42) .cse40)) (.cse38 (* 2 .cse42))) (or (= (+ .cse37 (* (* 2 .cse38) .cse39)) .cse40) (not (= (+ .cse37 (* .cse38 .cse41)) .cse40)))))) (and .cse43 (not .cse44))) (or .cse45 (forall ((|ULTIMATE.start_main_~a~0#1| Int)) (let ((.cse49 (* 2 |ULTIMATE.start_main_~a~0#1|)) (.cse48 (* |ULTIMATE.start_main_~a~0#1| |c_ULTIMATE.start_main_~b~0#1|))) (let ((.cse46 (+ (* (- 1) .cse34 .cse49) .cse48)) (.cse47 (* 2 .cse49))) (or (= (+ .cse46 (* (* 2 .cse47) (+ 1 .cse39))) .cse48) (not (= (+ .cse46 (* .cse47 .cse41)) .cse48)))))) .cse44))) .cse51 (not .cse52) (and (= 1 .cse53) (or .cse45 .cse44)))))) (let ((.cse68 (mod .cse54 2)) (.cse60 (< .cse54 0))) (let ((.cse66 (not .cse60)) (.cse61 (= 0 .cse68))) (or (and .cse52 (not .cse51)) (let ((.cse57 (div .cse67 8))) (and (or (forall ((|ULTIMATE.start_main_~a~0#1| Int)) (let ((.cse59 (* 2 |ULTIMATE.start_main_~a~0#1|)) (.cse58 (* |ULTIMATE.start_main_~a~0#1| |c_ULTIMATE.start_main_~b~0#1|))) (let ((.cse55 (+ (* (- 1) .cse34 .cse59) .cse58)) (.cse56 (* 2 .cse59))) (or (= (+ .cse55 (* (* 2 .cse56) .cse57)) .cse58) (not (= (+ .cse55 (* .cse56 .cse54)) .cse58)))))) (and .cse60 (not .cse61))) (or (forall ((|ULTIMATE.start_main_~a~0#1| Int)) (let ((.cse65 (* 2 |ULTIMATE.start_main_~a~0#1|)) (.cse64 (* |ULTIMATE.start_main_~a~0#1| |c_ULTIMATE.start_main_~b~0#1|))) (let ((.cse62 (+ (* (- 1) .cse34 .cse65) .cse64)) (.cse63 (* 2 .cse65))) (or (= (+ .cse62 (* (* 2 .cse63) (+ 1 .cse57))) .cse64) (not (= (+ .cse62 (* .cse63 .cse54)) .cse64)))))) .cse66 .cse61))) (and (or .cse66 .cse61) (= 1 .cse68))))))))))))) is different from true [2023-02-17 06:53:04,256 INFO L134 CoverageAnalysis]: Checked inductivity of 39 backedges. 10 proven. 13 refuted. 0 times theorem prover too weak. 6 trivial. 10 not checked. [2023-02-17 06:53:04,256 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-02-17 06:53:04,256 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [348903238] [2023-02-17 06:53:04,256 WARN L310 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2023-02-17 06:53:04,256 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [2037355944] [2023-02-17 06:53:04,256 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [2037355944] provided 0 perfect and 2 imperfect interpolant sequences [2023-02-17 06:53:04,257 INFO L184 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2023-02-17 06:53:04,257 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [17, 15] total 29 [2023-02-17 06:53:04,257 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [461614598] [2023-02-17 06:53:04,257 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2023-02-17 06:53:04,257 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 29 states [2023-02-17 06:53:04,257 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-02-17 06:53:04,258 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 29 interpolants. [2023-02-17 06:53:04,258 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=113, Invalid=530, Unknown=19, NotChecked=150, Total=812 [2023-02-17 06:53:04,258 INFO L87 Difference]: Start difference. First operand 60 states and 71 transitions. Second operand has 29 states, 29 states have (on average 1.5862068965517242) internal successors, (46), 28 states have internal predecessors, (46), 8 states have call successors, (8), 3 states have call predecessors, (8), 2 states have return successors, (6), 6 states have call predecessors, (6), 6 states have call successors, (6) [2023-02-17 06:53:09,775 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.61s for a HTC check with result VALID. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=true, quantifiers [1] [2023-02-17 06:53:15,919 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.62s for a HTC check with result INVALID. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=true, quantifiers [] [2023-02-17 06:53:18,490 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=true, quantifiers [] [2023-02-17 06:53:22,187 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.51s for a HTC check with result VALID. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=true, quantifiers [] [2023-02-17 06:53:32,138 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=true, quantifiers [] [2023-02-17 06:53:41,552 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=true, quantifiers [] [2023-02-17 06:53:43,353 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.78s for a HTC check with result VALID. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=true, quantifiers [] [2023-02-17 06:53:48,964 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.37s for a HTC check with result VALID. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=true, quantifiers [] [2023-02-17 06:54:01,624 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.90s for a HTC check with result VALID. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=true, quantifiers [] [2023-02-17 06:54:03,071 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.11s for a HTC check with result VALID. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=true, quantifiers [] [2023-02-17 06:54:05,082 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=true, quantifiers [] [2023-02-17 06:54:22,413 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=true, quantifiers [] [2023-02-17 06:54:36,029 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.46s for a HTC check with result INVALID. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=true, quantifiers [] [2023-02-17 06:54:37,265 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.21s for a HTC check with result VALID. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=true, quantifiers []