./Ultimate.py --spec ../sv-benchmarks/c/properties/unreach-call.prp --file ../sv-benchmarks/c/nla-digbench/cohencu-ll.c --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for ERROR reachability Using default analysis Version f4b24e32 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/cohencu-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 bf57d72e341b105161cbeacf29e58db93d2b67f8e0e097e4dbed74551cbdcfff --- Real Ultimate output --- This is Ultimate 0.2.2-?-f4b24e3 [2022-07-13 15:57:01,831 INFO L177 SettingsManager]: Resetting all preferences to default values... [2022-07-13 15:57:01,833 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2022-07-13 15:57:01,874 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2022-07-13 15:57:01,875 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2022-07-13 15:57:01,876 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2022-07-13 15:57:01,877 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2022-07-13 15:57:01,880 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2022-07-13 15:57:01,881 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2022-07-13 15:57:01,885 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2022-07-13 15:57:01,886 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2022-07-13 15:57:01,888 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2022-07-13 15:57:01,888 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2022-07-13 15:57:01,891 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2022-07-13 15:57:01,891 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2022-07-13 15:57:01,894 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2022-07-13 15:57:01,895 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2022-07-13 15:57:01,896 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2022-07-13 15:57:01,898 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2022-07-13 15:57:01,903 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2022-07-13 15:57:01,904 INFO L181 SettingsManager]: Resetting HornVerifier preferences to default values [2022-07-13 15:57:01,905 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2022-07-13 15:57:01,906 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2022-07-13 15:57:01,907 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2022-07-13 15:57:01,908 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2022-07-13 15:57:01,914 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2022-07-13 15:57:01,915 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2022-07-13 15:57:01,915 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2022-07-13 15:57:01,916 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2022-07-13 15:57:01,916 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2022-07-13 15:57:01,917 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2022-07-13 15:57:01,917 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2022-07-13 15:57:01,919 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2022-07-13 15:57:01,919 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2022-07-13 15:57:01,920 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2022-07-13 15:57:01,921 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2022-07-13 15:57:01,922 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2022-07-13 15:57:01,922 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2022-07-13 15:57:01,923 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2022-07-13 15:57:01,923 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2022-07-13 15:57:01,924 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2022-07-13 15:57:01,925 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2022-07-13 15:57:01,926 INFO L101 SettingsManager]: Beginning loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Default.epf [2022-07-13 15:57:01,954 INFO L113 SettingsManager]: Loading preferences was successful [2022-07-13 15:57:01,954 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2022-07-13 15:57:01,955 INFO L136 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2022-07-13 15:57:01,955 INFO L138 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2022-07-13 15:57:01,956 INFO L136 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2022-07-13 15:57:01,956 INFO L138 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2022-07-13 15:57:01,956 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2022-07-13 15:57:01,957 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2022-07-13 15:57:01,957 INFO L138 SettingsManager]: * Use SBE=true [2022-07-13 15:57:01,958 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2022-07-13 15:57:01,958 INFO L138 SettingsManager]: * sizeof long=4 [2022-07-13 15:57:01,958 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2022-07-13 15:57:01,958 INFO L138 SettingsManager]: * sizeof POINTER=4 [2022-07-13 15:57:01,959 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2022-07-13 15:57:01,959 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2022-07-13 15:57:01,959 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2022-07-13 15:57:01,959 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2022-07-13 15:57:01,959 INFO L138 SettingsManager]: * sizeof long double=12 [2022-07-13 15:57:01,960 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2022-07-13 15:57:01,960 INFO L138 SettingsManager]: * Use constant arrays=true [2022-07-13 15:57:01,960 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2022-07-13 15:57:01,960 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2022-07-13 15:57:01,960 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2022-07-13 15:57:01,961 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2022-07-13 15:57:01,961 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-07-13 15:57:01,961 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2022-07-13 15:57:01,961 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2022-07-13 15:57:01,962 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2022-07-13 15:57:01,962 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2022-07-13 15:57:01,962 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2022-07-13 15:57:01,963 INFO L138 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2022-07-13 15:57:01,963 INFO L138 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2022-07-13 15:57:01,963 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2022-07-13 15:57:01,963 INFO L138 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode WARNING: An illegal reflective access operation has occurred WARNING: Illegal reflective access by com.sun.xml.bind.v2.runtime.reflect.opt.Injector$1 (file:/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 -> bf57d72e341b105161cbeacf29e58db93d2b67f8e0e097e4dbed74551cbdcfff [2022-07-13 15:57:02,161 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2022-07-13 15:57:02,188 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2022-07-13 15:57:02,191 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2022-07-13 15:57:02,192 INFO L271 PluginConnector]: Initializing CDTParser... [2022-07-13 15:57:02,193 INFO L275 PluginConnector]: CDTParser initialized [2022-07-13 15:57:02,194 INFO L432 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/nla-digbench/cohencu-ll.c [2022-07-13 15:57:02,247 INFO L220 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/cba74dd6a/aa769f2fcadf40f09857fa0c9871a695/FLAG0db32398f [2022-07-13 15:57:02,626 INFO L306 CDTParser]: Found 1 translation units. [2022-07-13 15:57:02,626 INFO L160 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/nla-digbench/cohencu-ll.c [2022-07-13 15:57:02,632 INFO L349 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/cba74dd6a/aa769f2fcadf40f09857fa0c9871a695/FLAG0db32398f [2022-07-13 15:57:02,642 INFO L357 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/cba74dd6a/aa769f2fcadf40f09857fa0c9871a695 [2022-07-13 15:57:02,644 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2022-07-13 15:57:02,645 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2022-07-13 15:57:02,651 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2022-07-13 15:57:02,651 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2022-07-13 15:57:02,657 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2022-07-13 15:57:02,657 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 13.07 03:57:02" (1/1) ... [2022-07-13 15:57:02,658 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@575a38e7 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.07 03:57:02, skipping insertion in model container [2022-07-13 15:57:02,658 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 13.07 03:57:02" (1/1) ... [2022-07-13 15:57:02,664 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2022-07-13 15:57:02,675 INFO L178 MainTranslator]: Built tables and reachable declarations [2022-07-13 15:57:02,811 WARN L230 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/cohencu-ll.c[588,601] [2022-07-13 15:57:02,846 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-07-13 15:57:02,854 INFO L203 MainTranslator]: Completed pre-run [2022-07-13 15:57:02,862 WARN L230 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/cohencu-ll.c[588,601] [2022-07-13 15:57:02,870 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-07-13 15:57:02,884 INFO L208 MainTranslator]: Completed translation [2022-07-13 15:57:02,884 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.07 03:57:02 WrapperNode [2022-07-13 15:57:02,884 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2022-07-13 15:57:02,886 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2022-07-13 15:57:02,886 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2022-07-13 15:57:02,886 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2022-07-13 15:57:02,892 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.07 03:57:02" (1/1) ... [2022-07-13 15:57:02,899 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.07 03:57:02" (1/1) ... [2022-07-13 15:57:02,919 INFO L137 Inliner]: procedures = 14, calls = 18, calls flagged for inlining = 2, calls inlined = 2, statements flattened = 44 [2022-07-13 15:57:02,919 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2022-07-13 15:57:02,920 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2022-07-13 15:57:02,920 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2022-07-13 15:57:02,920 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2022-07-13 15:57:02,927 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.07 03:57:02" (1/1) ... [2022-07-13 15:57:02,927 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.07 03:57:02" (1/1) ... [2022-07-13 15:57:02,928 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.07 03:57:02" (1/1) ... [2022-07-13 15:57:02,929 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.07 03:57:02" (1/1) ... [2022-07-13 15:57:02,931 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.07 03:57:02" (1/1) ... [2022-07-13 15:57:02,934 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.07 03:57:02" (1/1) ... [2022-07-13 15:57:02,934 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.07 03:57:02" (1/1) ... [2022-07-13 15:57:02,935 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2022-07-13 15:57:02,936 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2022-07-13 15:57:02,936 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2022-07-13 15:57:02,936 INFO L275 PluginConnector]: RCFGBuilder initialized [2022-07-13 15:57:02,937 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.07 03:57:02" (1/1) ... [2022-07-13 15:57:02,943 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-07-13 15:57:02,952 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-13 15:57:02,963 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) [2022-07-13 15:57:02,984 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 [2022-07-13 15:57:03,004 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2022-07-13 15:57:03,004 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2022-07-13 15:57:03,005 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2022-07-13 15:57:03,005 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2022-07-13 15:57:03,005 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_assert [2022-07-13 15:57:03,005 INFO L138 BoogieDeclarations]: Found implementation of procedure __VERIFIER_assert [2022-07-13 15:57:03,044 INFO L234 CfgBuilder]: Building ICFG [2022-07-13 15:57:03,045 INFO L260 CfgBuilder]: Building CFG for each procedure with an implementation [2022-07-13 15:57:03,142 INFO L275 CfgBuilder]: Performing block encoding [2022-07-13 15:57:03,147 INFO L294 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2022-07-13 15:57:03,147 INFO L299 CfgBuilder]: Removed 1 assume(true) statements. [2022-07-13 15:57:03,148 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 13.07 03:57:03 BoogieIcfgContainer [2022-07-13 15:57:03,149 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2022-07-13 15:57:03,150 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2022-07-13 15:57:03,150 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2022-07-13 15:57:03,153 INFO L275 PluginConnector]: TraceAbstraction initialized [2022-07-13 15:57:03,153 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 13.07 03:57:02" (1/3) ... [2022-07-13 15:57:03,154 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@b58d31e and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 13.07 03:57:03, skipping insertion in model container [2022-07-13 15:57:03,154 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.07 03:57:02" (2/3) ... [2022-07-13 15:57:03,154 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@b58d31e and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 13.07 03:57:03, skipping insertion in model container [2022-07-13 15:57:03,154 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 13.07 03:57:03" (3/3) ... [2022-07-13 15:57:03,155 INFO L111 eAbstractionObserver]: Analyzing ICFG cohencu-ll.c [2022-07-13 15:57:03,167 INFO L201 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2022-07-13 15:57:03,167 INFO L160 ceAbstractionStarter]: Applying trace abstraction to program that has 1 error locations. [2022-07-13 15:57:03,204 INFO L356 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2022-07-13 15:57:03,209 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=de.uni_freiburg.informatik.ultimate.lib.tracecheckerutils.partialorder.independence.IndependenceSettings@3513bd86, mLbeIndependenceSettings=de.uni_freiburg.informatik.ultimate.lib.tracecheckerutils.partialorder.independence.IndependenceSettings@1750cc4 [2022-07-13 15:57:03,210 INFO L358 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2022-07-13 15:57:03,214 INFO L276 IsEmpty]: Start isEmpty. Operand has 25 states, 11 states have (on average 1.4545454545454546) internal successors, (16), 12 states have internal predecessors, (16), 11 states have call successors, (11), 1 states have call predecessors, (11), 1 states have return successors, (11), 11 states have call predecessors, (11), 11 states have call successors, (11) [2022-07-13 15:57:03,219 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 8 [2022-07-13 15:57:03,219 INFO L187 NwaCegarLoop]: Found error trace [2022-07-13 15:57:03,220 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1] [2022-07-13 15:57:03,220 INFO L420 AbstractCegarLoop]: === Iteration 1 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-07-13 15:57:03,224 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-13 15:57:03,224 INFO L85 PathProgramCache]: Analyzing trace with hash 1823012769, now seen corresponding path program 1 times [2022-07-13 15:57:03,231 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-13 15:57:03,239 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2035400715] [2022-07-13 15:57:03,239 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-13 15:57:03,240 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-13 15:57:03,366 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 15:57:03,411 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-07-13 15:57:03,412 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-13 15:57:03,413 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2035400715] [2022-07-13 15:57:03,415 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2035400715] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-13 15:57:03,415 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-13 15:57:03,415 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2022-07-13 15:57:03,425 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1475890644] [2022-07-13 15:57:03,427 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-13 15:57:03,432 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2022-07-13 15:57:03,433 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-13 15:57:03,466 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2022-07-13 15:57:03,468 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2022-07-13 15:57:03,470 INFO L87 Difference]: Start difference. First operand has 25 states, 11 states have (on average 1.4545454545454546) internal successors, (16), 12 states have internal predecessors, (16), 11 states have call successors, (11), 1 states have call predecessors, (11), 1 states have return successors, (11), 11 states have call predecessors, (11), 11 states have call successors, (11) Second operand has 2 states, 2 states have (on average 3.0) internal successors, (6), 2 states have internal predecessors, (6), 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) [2022-07-13 15:57:03,498 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-13 15:57:03,498 INFO L93 Difference]: Finished difference Result 48 states and 85 transitions. [2022-07-13 15:57:03,500 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2022-07-13 15:57:03,501 INFO L78 Accepts]: Start accepts. Automaton has has 2 states, 2 states have (on average 3.0) internal successors, (6), 2 states have internal predecessors, (6), 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 7 [2022-07-13 15:57:03,501 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-13 15:57:03,509 INFO L225 Difference]: With dead ends: 48 [2022-07-13 15:57:03,510 INFO L226 Difference]: Without dead ends: 21 [2022-07-13 15:57:03,514 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 0 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2022-07-13 15:57:03,518 INFO L413 NwaCegarLoop]: 35 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, 35 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 [2022-07-13 15:57:03,520 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 35 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 0 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-07-13 15:57:03,536 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 21 states. [2022-07-13 15:57:03,559 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 21 to 21. [2022-07-13 15:57:03,563 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 21 states, 8 states have (on average 1.25) internal successors, (10), 9 states have internal predecessors, (10), 11 states have call successors, (11), 1 states have call predecessors, (11), 1 states have return successors, (10), 10 states have call predecessors, (10), 10 states have call successors, (10) [2022-07-13 15:57:03,566 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 21 states to 21 states and 31 transitions. [2022-07-13 15:57:03,568 INFO L78 Accepts]: Start accepts. Automaton has 21 states and 31 transitions. Word has length 7 [2022-07-13 15:57:03,568 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-13 15:57:03,568 INFO L495 AbstractCegarLoop]: Abstraction has 21 states and 31 transitions. [2022-07-13 15:57:03,569 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 2 states, 2 states have (on average 3.0) internal successors, (6), 2 states have internal predecessors, (6), 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) [2022-07-13 15:57:03,569 INFO L276 IsEmpty]: Start isEmpty. Operand 21 states and 31 transitions. [2022-07-13 15:57:03,570 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 8 [2022-07-13 15:57:03,570 INFO L187 NwaCegarLoop]: Found error trace [2022-07-13 15:57:03,570 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1] [2022-07-13 15:57:03,570 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2022-07-13 15:57:03,571 INFO L420 AbstractCegarLoop]: === Iteration 2 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-07-13 15:57:03,573 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-13 15:57:03,573 INFO L85 PathProgramCache]: Analyzing trace with hash 1811632607, now seen corresponding path program 1 times [2022-07-13 15:57:03,573 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-13 15:57:03,574 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [440662730] [2022-07-13 15:57:03,574 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-13 15:57:03,574 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-13 15:57:03,609 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 15:57:03,713 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-07-13 15:57:03,714 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-13 15:57:03,714 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [440662730] [2022-07-13 15:57:03,714 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [440662730] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-13 15:57:03,714 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-13 15:57:03,715 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2022-07-13 15:57:03,715 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1205715241] [2022-07-13 15:57:03,715 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-13 15:57:03,718 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-07-13 15:57:03,718 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-13 15:57:03,718 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-07-13 15:57:03,719 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2022-07-13 15:57:03,719 INFO L87 Difference]: Start difference. First operand 21 states and 31 transitions. Second operand has 5 states, 5 states have (on average 1.2) internal successors, (6), 4 states have internal predecessors, (6), 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) [2022-07-13 15:57:03,803 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-13 15:57:03,803 INFO L93 Difference]: Finished difference Result 27 states and 36 transitions. [2022-07-13 15:57:03,804 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2022-07-13 15:57:03,804 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 1.2) internal successors, (6), 4 states have internal predecessors, (6), 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 7 [2022-07-13 15:57:03,804 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-13 15:57:03,805 INFO L225 Difference]: With dead ends: 27 [2022-07-13 15:57:03,805 INFO L226 Difference]: Without dead ends: 25 [2022-07-13 15:57:03,805 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2022-07-13 15:57:03,807 INFO L413 NwaCegarLoop]: 25 mSDtfsCounter, 7 mSDsluCounter, 31 mSDsCounter, 0 mSdLazyCounter, 50 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 17 SdHoareTripleChecker+Valid, 56 SdHoareTripleChecker+Invalid, 53 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 50 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-07-13 15:57:03,807 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [17 Valid, 56 Invalid, 53 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 50 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-07-13 15:57:03,808 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 25 states. [2022-07-13 15:57:03,816 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 25 to 25. [2022-07-13 15:57:03,817 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 25 states, 11 states have (on average 1.1818181818181819) internal successors, (13), 12 states have internal predecessors, (13), 11 states have call successors, (11), 2 states have call predecessors, (11), 2 states have return successors, (10), 10 states have call predecessors, (10), 10 states have call successors, (10) [2022-07-13 15:57:03,818 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 25 states to 25 states and 34 transitions. [2022-07-13 15:57:03,818 INFO L78 Accepts]: Start accepts. Automaton has 25 states and 34 transitions. Word has length 7 [2022-07-13 15:57:03,819 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-13 15:57:03,819 INFO L495 AbstractCegarLoop]: Abstraction has 25 states and 34 transitions. [2022-07-13 15:57:03,819 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 1.2) internal successors, (6), 4 states have internal predecessors, (6), 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) [2022-07-13 15:57:03,819 INFO L276 IsEmpty]: Start isEmpty. Operand 25 states and 34 transitions. [2022-07-13 15:57:03,820 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 13 [2022-07-13 15:57:03,820 INFO L187 NwaCegarLoop]: Found error trace [2022-07-13 15:57:03,820 INFO L195 NwaCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-07-13 15:57:03,820 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2022-07-13 15:57:03,821 INFO L420 AbstractCegarLoop]: === Iteration 3 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-07-13 15:57:03,821 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-13 15:57:03,821 INFO L85 PathProgramCache]: Analyzing trace with hash -1582559355, now seen corresponding path program 1 times [2022-07-13 15:57:03,822 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-13 15:57:03,822 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1489670600] [2022-07-13 15:57:03,822 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-13 15:57:03,827 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-13 15:57:03,842 ERROR L245 FreeRefinementEngine]: Caught known exception: Unsupported non-linear arithmetic [2022-07-13 15:57:03,845 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [975877660] [2022-07-13 15:57:03,845 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-13 15:57:03,846 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-07-13 15:57:03,846 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-13 15:57:03,848 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) [2022-07-13 15:57:03,849 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Waiting until timeout for monitored process [2022-07-13 15:57:03,902 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 15:57:03,904 INFO L263 TraceCheckSpWp]: Trace formula consists of 54 conjuncts, 7 conjunts are in the unsatisfiable core [2022-07-13 15:57:03,908 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-07-13 15:57:03,991 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 2 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-07-13 15:57:03,992 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-07-13 15:57:03,992 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-13 15:57:03,992 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1489670600] [2022-07-13 15:57:03,993 WARN L310 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2022-07-13 15:57:03,993 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [975877660] [2022-07-13 15:57:03,993 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [975877660] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-13 15:57:03,993 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-13 15:57:03,993 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2022-07-13 15:57:03,994 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [993589752] [2022-07-13 15:57:03,994 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-13 15:57:03,994 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-07-13 15:57:03,995 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-13 15:57:03,995 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-07-13 15:57:03,995 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2022-07-13 15:57:03,996 INFO L87 Difference]: Start difference. First operand 25 states and 34 transitions. Second operand has 5 states, 5 states have (on average 1.8) internal successors, (9), 4 states have internal predecessors, (9), 1 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) [2022-07-13 15:57:04,056 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-13 15:57:04,058 INFO L93 Difference]: Finished difference Result 44 states and 63 transitions. [2022-07-13 15:57:04,058 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-07-13 15:57:04,058 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 1.8) internal successors, (9), 4 states have internal predecessors, (9), 1 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 12 [2022-07-13 15:57:04,059 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-13 15:57:04,059 INFO L225 Difference]: With dead ends: 44 [2022-07-13 15:57:04,061 INFO L226 Difference]: Without dead ends: 42 [2022-07-13 15:57:04,061 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 12 GetRequests, 8 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2022-07-13 15:57:04,063 INFO L413 NwaCegarLoop]: 39 mSDtfsCounter, 6 mSDsluCounter, 70 mSDsCounter, 0 mSdLazyCounter, 50 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 15 SdHoareTripleChecker+Valid, 109 SdHoareTripleChecker+Invalid, 50 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 50 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-07-13 15:57:04,065 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [15 Valid, 109 Invalid, 50 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 50 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-07-13 15:57:04,066 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 42 states. [2022-07-13 15:57:04,076 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 42 to 32. [2022-07-13 15:57:04,079 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 32 states, 15 states have (on average 1.1333333333333333) internal successors, (17), 17 states have internal predecessors, (17), 13 states have call successors, (13), 3 states have call predecessors, (13), 3 states have return successors, (12), 11 states have call predecessors, (12), 12 states have call successors, (12) [2022-07-13 15:57:04,083 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 32 states to 32 states and 42 transitions. [2022-07-13 15:57:04,084 INFO L78 Accepts]: Start accepts. Automaton has 32 states and 42 transitions. Word has length 12 [2022-07-13 15:57:04,084 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-13 15:57:04,084 INFO L495 AbstractCegarLoop]: Abstraction has 32 states and 42 transitions. [2022-07-13 15:57:04,084 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 1.8) internal successors, (9), 4 states have internal predecessors, (9), 1 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) [2022-07-13 15:57:04,085 INFO L276 IsEmpty]: Start isEmpty. Operand 32 states and 42 transitions. [2022-07-13 15:57:04,085 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 18 [2022-07-13 15:57:04,085 INFO L187 NwaCegarLoop]: Found error trace [2022-07-13 15:57:04,086 INFO L195 NwaCegarLoop]: trace histogram [3, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-07-13 15:57:04,109 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Ended with exit code 0 [2022-07-13 15:57:04,301 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2,2 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-07-13 15:57:04,301 INFO L420 AbstractCegarLoop]: === Iteration 4 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-07-13 15:57:04,302 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-13 15:57:04,302 INFO L85 PathProgramCache]: Analyzing trace with hash 424345951, now seen corresponding path program 1 times [2022-07-13 15:57:04,302 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-13 15:57:04,302 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [463829877] [2022-07-13 15:57:04,302 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-13 15:57:04,302 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-13 15:57:04,313 ERROR L245 FreeRefinementEngine]: Caught known exception: Unsupported non-linear arithmetic [2022-07-13 15:57:04,314 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [1373134408] [2022-07-13 15:57:04,314 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-13 15:57:04,314 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-07-13 15:57:04,314 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-13 15:57:04,316 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) [2022-07-13 15:57:04,330 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Waiting until timeout for monitored process [2022-07-13 15:57:04,354 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 15:57:04,355 INFO L263 TraceCheckSpWp]: Trace formula consists of 63 conjuncts, 7 conjunts are in the unsatisfiable core [2022-07-13 15:57:04,357 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-07-13 15:57:04,438 INFO L134 CoverageAnalysis]: Checked inductivity of 8 backedges. 4 proven. 0 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2022-07-13 15:57:04,439 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-07-13 15:57:04,439 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-13 15:57:04,439 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [463829877] [2022-07-13 15:57:04,439 WARN L310 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2022-07-13 15:57:04,440 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1373134408] [2022-07-13 15:57:04,440 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1373134408] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-13 15:57:04,440 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-13 15:57:04,440 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2022-07-13 15:57:04,440 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [667827141] [2022-07-13 15:57:04,441 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-13 15:57:04,441 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-07-13 15:57:04,441 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-13 15:57:04,445 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-07-13 15:57:04,446 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2022-07-13 15:57:04,446 INFO L87 Difference]: Start difference. First operand 32 states and 42 transitions. Second operand has 5 states, 5 states have (on average 1.8) internal successors, (9), 4 states have internal predecessors, (9), 1 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) [2022-07-13 15:57:04,528 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-13 15:57:04,528 INFO L93 Difference]: Finished difference Result 48 states and 66 transitions. [2022-07-13 15:57:04,529 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-07-13 15:57:04,529 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 1.8) internal successors, (9), 4 states have internal predecessors, (9), 1 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) Word has length 17 [2022-07-13 15:57:04,529 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-13 15:57:04,530 INFO L225 Difference]: With dead ends: 48 [2022-07-13 15:57:04,530 INFO L226 Difference]: Without dead ends: 46 [2022-07-13 15:57:04,530 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 17 GetRequests, 13 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2022-07-13 15:57:04,531 INFO L413 NwaCegarLoop]: 38 mSDtfsCounter, 6 mSDsluCounter, 72 mSDsCounter, 0 mSdLazyCounter, 49 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 14 SdHoareTripleChecker+Valid, 110 SdHoareTripleChecker+Invalid, 50 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 49 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-07-13 15:57:04,532 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [14 Valid, 110 Invalid, 50 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 49 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-07-13 15:57:04,533 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 46 states. [2022-07-13 15:57:04,542 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 46 to 42. [2022-07-13 15:57:04,542 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 42 states, 19 states have (on average 1.1578947368421053) internal successors, (22), 21 states have internal predecessors, (22), 18 states have call successors, (18), 4 states have call predecessors, (18), 4 states have return successors, (17), 16 states have call predecessors, (17), 17 states have call successors, (17) [2022-07-13 15:57:04,543 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 42 states to 42 states and 57 transitions. [2022-07-13 15:57:04,544 INFO L78 Accepts]: Start accepts. Automaton has 42 states and 57 transitions. Word has length 17 [2022-07-13 15:57:04,544 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-13 15:57:04,544 INFO L495 AbstractCegarLoop]: Abstraction has 42 states and 57 transitions. [2022-07-13 15:57:04,544 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 1.8) internal successors, (9), 4 states have internal predecessors, (9), 1 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) [2022-07-13 15:57:04,544 INFO L276 IsEmpty]: Start isEmpty. Operand 42 states and 57 transitions. [2022-07-13 15:57:04,545 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2022-07-13 15:57:04,545 INFO L187 NwaCegarLoop]: Found error trace [2022-07-13 15:57:04,545 INFO L195 NwaCegarLoop]: trace histogram [4, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-07-13 15:57:04,570 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Forceful destruction successful, exit code 0 [2022-07-13 15:57:04,767 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,SelfDestructingSolverStorable3 [2022-07-13 15:57:04,768 INFO L420 AbstractCegarLoop]: === Iteration 5 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-07-13 15:57:04,769 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-13 15:57:04,769 INFO L85 PathProgramCache]: Analyzing trace with hash 1752711045, now seen corresponding path program 1 times [2022-07-13 15:57:04,769 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-13 15:57:04,769 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [544015285] [2022-07-13 15:57:04,769 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-13 15:57:04,769 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-13 15:57:04,777 ERROR L245 FreeRefinementEngine]: Caught known exception: Unsupported non-linear arithmetic [2022-07-13 15:57:04,778 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [406800072] [2022-07-13 15:57:04,778 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-13 15:57:04,778 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-07-13 15:57:04,778 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-13 15:57:04,782 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) [2022-07-13 15:57:04,783 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Waiting until timeout for monitored process [2022-07-13 15:57:04,811 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 15:57:04,812 INFO L263 TraceCheckSpWp]: Trace formula consists of 72 conjuncts, 9 conjunts are in the unsatisfiable core [2022-07-13 15:57:04,814 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-07-13 15:57:04,867 INFO L134 CoverageAnalysis]: Checked inductivity of 18 backedges. 6 proven. 0 refuted. 0 times theorem prover too weak. 12 trivial. 0 not checked. [2022-07-13 15:57:04,867 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-07-13 15:57:04,868 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-13 15:57:04,868 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [544015285] [2022-07-13 15:57:04,868 WARN L310 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2022-07-13 15:57:04,868 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [406800072] [2022-07-13 15:57:04,868 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [406800072] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-13 15:57:04,869 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-13 15:57:04,869 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2022-07-13 15:57:04,869 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1781451924] [2022-07-13 15:57:04,869 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-13 15:57:04,869 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-07-13 15:57:04,870 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-13 15:57:04,870 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-07-13 15:57:04,870 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2022-07-13 15:57:04,870 INFO L87 Difference]: Start difference. First operand 42 states and 57 transitions. Second operand has 5 states, 5 states have (on average 1.8) internal successors, (9), 4 states have internal predecessors, (9), 1 states have call successors, (4), 2 states have call predecessors, (4), 1 states have return successors, (3), 1 states have call predecessors, (3), 1 states have call successors, (3) [2022-07-13 15:57:04,945 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-13 15:57:04,946 INFO L93 Difference]: Finished difference Result 56 states and 72 transitions. [2022-07-13 15:57:04,946 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-07-13 15:57:04,946 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 1.8) internal successors, (9), 4 states have internal predecessors, (9), 1 states have call successors, (4), 2 states have call predecessors, (4), 1 states have return successors, (3), 1 states have call predecessors, (3), 1 states have call successors, (3) Word has length 22 [2022-07-13 15:57:04,947 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-13 15:57:04,947 INFO L225 Difference]: With dead ends: 56 [2022-07-13 15:57:04,948 INFO L226 Difference]: Without dead ends: 44 [2022-07-13 15:57:04,948 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 22 GetRequests, 18 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2022-07-13 15:57:04,949 INFO L413 NwaCegarLoop]: 35 mSDtfsCounter, 6 mSDsluCounter, 61 mSDsCounter, 0 mSdLazyCounter, 63 mSolverCounterSat, 6 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 13 SdHoareTripleChecker+Valid, 96 SdHoareTripleChecker+Invalid, 69 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 6 IncrementalHoareTripleChecker+Valid, 63 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-07-13 15:57:04,949 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [13 Valid, 96 Invalid, 69 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [6 Valid, 63 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-07-13 15:57:04,950 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 44 states. [2022-07-13 15:57:04,957 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 44 to 44. [2022-07-13 15:57:04,957 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 44 states, 22 states have (on average 1.0909090909090908) internal successors, (24), 23 states have internal predecessors, (24), 16 states have call successors, (16), 5 states have call predecessors, (16), 5 states have return successors, (15), 15 states have call predecessors, (15), 15 states have call successors, (15) [2022-07-13 15:57:04,958 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 44 states to 44 states and 55 transitions. [2022-07-13 15:57:04,958 INFO L78 Accepts]: Start accepts. Automaton has 44 states and 55 transitions. Word has length 22 [2022-07-13 15:57:04,958 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-13 15:57:04,959 INFO L495 AbstractCegarLoop]: Abstraction has 44 states and 55 transitions. [2022-07-13 15:57:04,959 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 1.8) internal successors, (9), 4 states have internal predecessors, (9), 1 states have call successors, (4), 2 states have call predecessors, (4), 1 states have return successors, (3), 1 states have call predecessors, (3), 1 states have call successors, (3) [2022-07-13 15:57:04,959 INFO L276 IsEmpty]: Start isEmpty. Operand 44 states and 55 transitions. [2022-07-13 15:57:04,960 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 40 [2022-07-13 15:57:04,960 INFO L187 NwaCegarLoop]: Found error trace [2022-07-13 15:57:04,960 INFO L195 NwaCegarLoop]: trace histogram [7, 6, 6, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-07-13 15:57:04,987 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Forceful destruction successful, exit code 0 [2022-07-13 15:57:05,182 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4,4 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-07-13 15:57:05,183 INFO L420 AbstractCegarLoop]: === Iteration 6 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-07-13 15:57:05,184 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-13 15:57:05,184 INFO L85 PathProgramCache]: Analyzing trace with hash 1303023551, now seen corresponding path program 1 times [2022-07-13 15:57:05,184 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-13 15:57:05,184 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1450297489] [2022-07-13 15:57:05,184 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-13 15:57:05,184 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-13 15:57:05,194 ERROR L245 FreeRefinementEngine]: Caught known exception: Unsupported non-linear arithmetic [2022-07-13 15:57:05,194 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [1404287191] [2022-07-13 15:57:05,194 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-13 15:57:05,194 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-07-13 15:57:05,195 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-13 15:57:05,196 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) [2022-07-13 15:57:05,197 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Waiting until timeout for monitored process [2022-07-13 15:57:05,240 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 15:57:05,241 INFO L263 TraceCheckSpWp]: Trace formula consists of 109 conjuncts, 13 conjunts are in the unsatisfiable core [2022-07-13 15:57:05,243 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-07-13 15:57:05,327 INFO L134 CoverageAnalysis]: Checked inductivity of 75 backedges. 12 proven. 3 refuted. 0 times theorem prover too weak. 60 trivial. 0 not checked. [2022-07-13 15:57:05,327 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-07-13 15:57:05,420 INFO L134 CoverageAnalysis]: Checked inductivity of 75 backedges. 12 proven. 3 refuted. 0 times theorem prover too weak. 60 trivial. 0 not checked. [2022-07-13 15:57:05,420 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-13 15:57:05,420 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1450297489] [2022-07-13 15:57:05,421 WARN L310 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2022-07-13 15:57:05,421 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1404287191] [2022-07-13 15:57:05,421 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1404287191] provided 0 perfect and 2 imperfect interpolant sequences [2022-07-13 15:57:05,421 INFO L184 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2022-07-13 15:57:05,421 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [6, 6] total 8 [2022-07-13 15:57:05,423 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2066304021] [2022-07-13 15:57:05,423 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2022-07-13 15:57:05,424 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2022-07-13 15:57:05,424 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-13 15:57:05,424 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2022-07-13 15:57:05,425 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=16, Invalid=40, Unknown=0, NotChecked=0, Total=56 [2022-07-13 15:57:05,425 INFO L87 Difference]: Start difference. First operand 44 states and 55 transitions. Second operand has 8 states, 8 states have (on average 1.875) internal successors, (15), 7 states have internal predecessors, (15), 4 states have call successors, (14), 2 states have call predecessors, (14), 1 states have return successors, (12), 4 states have call predecessors, (12), 4 states have call successors, (12) [2022-07-13 15:57:05,803 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-13 15:57:05,803 INFO L93 Difference]: Finished difference Result 67 states and 87 transitions. [2022-07-13 15:57:05,804 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2022-07-13 15:57:05,804 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 8 states have (on average 1.875) internal successors, (15), 7 states have internal predecessors, (15), 4 states have call successors, (14), 2 states have call predecessors, (14), 1 states have return successors, (12), 4 states have call predecessors, (12), 4 states have call successors, (12) Word has length 39 [2022-07-13 15:57:05,804 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-13 15:57:05,805 INFO L225 Difference]: With dead ends: 67 [2022-07-13 15:57:05,805 INFO L226 Difference]: Without dead ends: 65 [2022-07-13 15:57:05,805 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 79 GetRequests, 69 SyntacticMatches, 1 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=31, Invalid=79, Unknown=0, NotChecked=0, Total=110 [2022-07-13 15:57:05,806 INFO L413 NwaCegarLoop]: 35 mSDtfsCounter, 9 mSDsluCounter, 52 mSDsCounter, 0 mSdLazyCounter, 173 mSolverCounterSat, 46 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 9 SdHoareTripleChecker+Valid, 87 SdHoareTripleChecker+Invalid, 219 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 46 IncrementalHoareTripleChecker+Valid, 173 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2022-07-13 15:57:05,806 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [9 Valid, 87 Invalid, 219 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [46 Valid, 173 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2022-07-13 15:57:05,806 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 65 states. [2022-07-13 15:57:05,823 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 65 to 52. [2022-07-13 15:57:05,824 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 52 states, 28 states have (on average 1.0714285714285714) internal successors, (30), 29 states have internal predecessors, (30), 16 states have call successors, (16), 7 states have call predecessors, (16), 7 states have return successors, (15), 15 states have call predecessors, (15), 15 states have call successors, (15) [2022-07-13 15:57:05,824 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 52 states to 52 states and 61 transitions. [2022-07-13 15:57:05,825 INFO L78 Accepts]: Start accepts. Automaton has 52 states and 61 transitions. Word has length 39 [2022-07-13 15:57:05,825 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-13 15:57:05,825 INFO L495 AbstractCegarLoop]: Abstraction has 52 states and 61 transitions. [2022-07-13 15:57:05,825 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 1.875) internal successors, (15), 7 states have internal predecessors, (15), 4 states have call successors, (14), 2 states have call predecessors, (14), 1 states have return successors, (12), 4 states have call predecessors, (12), 4 states have call successors, (12) [2022-07-13 15:57:05,826 INFO L276 IsEmpty]: Start isEmpty. Operand 52 states and 61 transitions. [2022-07-13 15:57:05,826 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 45 [2022-07-13 15:57:05,827 INFO L187 NwaCegarLoop]: Found error trace [2022-07-13 15:57:05,827 INFO L195 NwaCegarLoop]: trace histogram [8, 7, 7, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-07-13 15:57:05,853 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Forceful destruction successful, exit code 0 [2022-07-13 15:57:06,043 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5,5 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-07-13 15:57:06,044 INFO L420 AbstractCegarLoop]: === Iteration 7 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-07-13 15:57:06,044 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-13 15:57:06,044 INFO L85 PathProgramCache]: Analyzing trace with hash 190158181, now seen corresponding path program 2 times [2022-07-13 15:57:06,044 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-13 15:57:06,044 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [756317623] [2022-07-13 15:57:06,044 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-13 15:57:06,045 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-13 15:57:06,054 ERROR L245 FreeRefinementEngine]: Caught known exception: Unsupported non-linear arithmetic [2022-07-13 15:57:06,059 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [1884630450] [2022-07-13 15:57:06,059 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2022-07-13 15:57:06,059 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-07-13 15:57:06,060 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-13 15:57:06,061 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) [2022-07-13 15:57:06,062 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (6)] Waiting until timeout for monitored process [2022-07-13 15:57:06,108 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2022-07-13 15:57:06,108 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-07-13 15:57:06,109 INFO L263 TraceCheckSpWp]: Trace formula consists of 118 conjuncts, 17 conjunts are in the unsatisfiable core [2022-07-13 15:57:06,111 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-07-13 15:57:06,217 INFO L134 CoverageAnalysis]: Checked inductivity of 102 backedges. 14 proven. 4 refuted. 0 times theorem prover too weak. 84 trivial. 0 not checked. [2022-07-13 15:57:06,217 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-07-13 15:57:06,296 INFO L134 CoverageAnalysis]: Checked inductivity of 102 backedges. 14 proven. 4 refuted. 0 times theorem prover too weak. 84 trivial. 0 not checked. [2022-07-13 15:57:06,297 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-13 15:57:06,297 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [756317623] [2022-07-13 15:57:06,297 WARN L310 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2022-07-13 15:57:06,297 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1884630450] [2022-07-13 15:57:06,298 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1884630450] provided 0 perfect and 2 imperfect interpolant sequences [2022-07-13 15:57:06,298 INFO L184 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2022-07-13 15:57:06,298 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [6, 6] total 8 [2022-07-13 15:57:06,298 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [259830394] [2022-07-13 15:57:06,298 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2022-07-13 15:57:06,299 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2022-07-13 15:57:06,299 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-13 15:57:06,299 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2022-07-13 15:57:06,299 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=16, Invalid=40, Unknown=0, NotChecked=0, Total=56 [2022-07-13 15:57:06,300 INFO L87 Difference]: Start difference. First operand 52 states and 61 transitions. Second operand has 8 states, 8 states have (on average 1.875) internal successors, (15), 7 states have internal predecessors, (15), 4 states have call successors, (16), 2 states have call predecessors, (16), 1 states have return successors, (14), 4 states have call predecessors, (14), 4 states have call successors, (14) [2022-07-13 15:57:06,496 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-13 15:57:06,496 INFO L93 Difference]: Finished difference Result 92 states and 120 transitions. [2022-07-13 15:57:06,496 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2022-07-13 15:57:06,497 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 8 states have (on average 1.875) internal successors, (15), 7 states have internal predecessors, (15), 4 states have call successors, (16), 2 states have call predecessors, (16), 1 states have return successors, (14), 4 states have call predecessors, (14), 4 states have call successors, (14) Word has length 44 [2022-07-13 15:57:06,497 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-13 15:57:06,498 INFO L225 Difference]: With dead ends: 92 [2022-07-13 15:57:06,498 INFO L226 Difference]: Without dead ends: 90 [2022-07-13 15:57:06,498 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 88 GetRequests, 79 SyntacticMatches, 1 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=25, Invalid=65, Unknown=0, NotChecked=0, Total=90 [2022-07-13 15:57:06,499 INFO L413 NwaCegarLoop]: 49 mSDtfsCounter, 9 mSDsluCounter, 98 mSDsCounter, 0 mSdLazyCounter, 149 mSolverCounterSat, 32 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 17 SdHoareTripleChecker+Valid, 147 SdHoareTripleChecker+Invalid, 181 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 32 IncrementalHoareTripleChecker+Valid, 149 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2022-07-13 15:57:06,499 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [17 Valid, 147 Invalid, 181 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [32 Valid, 149 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2022-07-13 15:57:06,499 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 90 states. [2022-07-13 15:57:06,519 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 90 to 79. [2022-07-13 15:57:06,521 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 79 states, 40 states have (on average 1.075) internal successors, (43), 43 states have internal predecessors, (43), 28 states have call successors, (28), 10 states have call predecessors, (28), 10 states have return successors, (27), 25 states have call predecessors, (27), 27 states have call successors, (27) [2022-07-13 15:57:06,523 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 79 states to 79 states and 98 transitions. [2022-07-13 15:57:06,523 INFO L78 Accepts]: Start accepts. Automaton has 79 states and 98 transitions. Word has length 44 [2022-07-13 15:57:06,525 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-13 15:57:06,525 INFO L495 AbstractCegarLoop]: Abstraction has 79 states and 98 transitions. [2022-07-13 15:57:06,526 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 1.875) internal successors, (15), 7 states have internal predecessors, (15), 4 states have call successors, (16), 2 states have call predecessors, (16), 1 states have return successors, (14), 4 states have call predecessors, (14), 4 states have call successors, (14) [2022-07-13 15:57:06,526 INFO L276 IsEmpty]: Start isEmpty. Operand 79 states and 98 transitions. [2022-07-13 15:57:06,526 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 50 [2022-07-13 15:57:06,527 INFO L187 NwaCegarLoop]: Found error trace [2022-07-13 15:57:06,527 INFO L195 NwaCegarLoop]: trace histogram [9, 8, 8, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1] [2022-07-13 15:57:06,552 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (6)] Forceful destruction successful, exit code 0 [2022-07-13 15:57:06,749 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6,6 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-07-13 15:57:06,750 INFO L420 AbstractCegarLoop]: === Iteration 8 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-07-13 15:57:06,750 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-13 15:57:06,750 INFO L85 PathProgramCache]: Analyzing trace with hash -1004060865, now seen corresponding path program 3 times [2022-07-13 15:57:06,750 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-13 15:57:06,750 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1298089896] [2022-07-13 15:57:06,750 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-13 15:57:06,750 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-13 15:57:06,759 ERROR L245 FreeRefinementEngine]: Caught known exception: Unsupported non-linear arithmetic [2022-07-13 15:57:06,760 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [1819032611] [2022-07-13 15:57:06,760 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2022-07-13 15:57:06,760 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-07-13 15:57:06,760 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-13 15:57:06,761 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) [2022-07-13 15:57:06,762 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (7)] Waiting until timeout for monitored process [2022-07-13 15:57:06,797 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 2 check-sat command(s) [2022-07-13 15:57:06,797 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-07-13 15:57:06,798 INFO L263 TraceCheckSpWp]: Trace formula consists of 73 conjuncts, 19 conjunts are in the unsatisfiable core [2022-07-13 15:57:06,800 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-07-13 15:57:06,917 INFO L134 CoverageAnalysis]: Checked inductivity of 133 backedges. 16 proven. 5 refuted. 0 times theorem prover too weak. 112 trivial. 0 not checked. [2022-07-13 15:57:06,918 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-07-13 15:57:07,071 INFO L134 CoverageAnalysis]: Checked inductivity of 133 backedges. 16 proven. 5 refuted. 0 times theorem prover too weak. 112 trivial. 0 not checked. [2022-07-13 15:57:07,071 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-13 15:57:07,071 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1298089896] [2022-07-13 15:57:07,071 WARN L310 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2022-07-13 15:57:07,071 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1819032611] [2022-07-13 15:57:07,071 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1819032611] provided 0 perfect and 2 imperfect interpolant sequences [2022-07-13 15:57:07,072 INFO L184 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2022-07-13 15:57:07,072 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [6, 6] total 8 [2022-07-13 15:57:07,072 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [140227250] [2022-07-13 15:57:07,072 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2022-07-13 15:57:07,072 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2022-07-13 15:57:07,072 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-13 15:57:07,073 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2022-07-13 15:57:07,073 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=39, Unknown=0, NotChecked=0, Total=56 [2022-07-13 15:57:07,073 INFO L87 Difference]: Start difference. First operand 79 states and 98 transitions. Second operand has 8 states, 8 states have (on average 1.875) internal successors, (15), 7 states have internal predecessors, (15), 4 states have call successors, (18), 2 states have call predecessors, (18), 1 states have return successors, (16), 4 states have call predecessors, (16), 4 states have call successors, (16) [2022-07-13 15:57:07,373 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-13 15:57:07,373 INFO L93 Difference]: Finished difference Result 95 states and 112 transitions. [2022-07-13 15:57:07,373 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2022-07-13 15:57:07,374 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 8 states have (on average 1.875) internal successors, (15), 7 states have internal predecessors, (15), 4 states have call successors, (18), 2 states have call predecessors, (18), 1 states have return successors, (16), 4 states have call predecessors, (16), 4 states have call successors, (16) Word has length 49 [2022-07-13 15:57:07,374 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-13 15:57:07,376 INFO L225 Difference]: With dead ends: 95 [2022-07-13 15:57:07,376 INFO L226 Difference]: Without dead ends: 83 [2022-07-13 15:57:07,376 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 98 GetRequests, 89 SyntacticMatches, 1 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=27, Invalid=63, Unknown=0, NotChecked=0, Total=90 [2022-07-13 15:57:07,377 INFO L413 NwaCegarLoop]: 36 mSDtfsCounter, 8 mSDsluCounter, 55 mSDsCounter, 0 mSdLazyCounter, 167 mSolverCounterSat, 30 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 15 SdHoareTripleChecker+Valid, 91 SdHoareTripleChecker+Invalid, 197 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 30 IncrementalHoareTripleChecker+Valid, 167 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2022-07-13 15:57:07,377 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [15 Valid, 91 Invalid, 197 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [30 Valid, 167 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2022-07-13 15:57:07,377 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 83 states. [2022-07-13 15:57:07,401 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 83 to 80. [2022-07-13 15:57:07,401 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 80 states, 46 states have (on average 1.065217391304348) internal successors, (49), 48 states have internal predecessors, (49), 21 states have call successors, (21), 12 states have call predecessors, (21), 12 states have return successors, (20), 19 states have call predecessors, (20), 20 states have call successors, (20) [2022-07-13 15:57:07,403 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 80 states to 80 states and 90 transitions. [2022-07-13 15:57:07,403 INFO L78 Accepts]: Start accepts. Automaton has 80 states and 90 transitions. Word has length 49 [2022-07-13 15:57:07,403 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-13 15:57:07,403 INFO L495 AbstractCegarLoop]: Abstraction has 80 states and 90 transitions. [2022-07-13 15:57:07,403 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 1.875) internal successors, (15), 7 states have internal predecessors, (15), 4 states have call successors, (18), 2 states have call predecessors, (18), 1 states have return successors, (16), 4 states have call predecessors, (16), 4 states have call successors, (16) [2022-07-13 15:57:07,403 INFO L276 IsEmpty]: Start isEmpty. Operand 80 states and 90 transitions. [2022-07-13 15:57:07,404 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 66 [2022-07-13 15:57:07,404 INFO L187 NwaCegarLoop]: Found error trace [2022-07-13 15:57:07,404 INFO L195 NwaCegarLoop]: trace histogram [12, 11, 11, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-07-13 15:57:07,430 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (7)] Forceful destruction successful, exit code 0 [2022-07-13 15:57:07,605 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7,7 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-07-13 15:57:07,605 INFO L420 AbstractCegarLoop]: === Iteration 9 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-07-13 15:57:07,606 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-13 15:57:07,606 INFO L85 PathProgramCache]: Analyzing trace with hash -1898506858, now seen corresponding path program 1 times [2022-07-13 15:57:07,606 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-13 15:57:07,606 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1454771840] [2022-07-13 15:57:07,606 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-13 15:57:07,606 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-13 15:57:07,615 ERROR L245 FreeRefinementEngine]: Caught known exception: Unsupported non-linear arithmetic [2022-07-13 15:57:07,615 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [2074077482] [2022-07-13 15:57:07,615 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-13 15:57:07,616 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-07-13 15:57:07,616 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-13 15:57:07,618 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) [2022-07-13 15:57:07,619 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (8)] Waiting until timeout for monitored process [2022-07-13 15:57:07,663 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 15:57:07,664 INFO L263 TraceCheckSpWp]: Trace formula consists of 155 conjuncts, 18 conjunts are in the unsatisfiable core [2022-07-13 15:57:07,666 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-07-13 15:57:07,823 INFO L134 CoverageAnalysis]: Checked inductivity of 249 backedges. 22 proven. 7 refuted. 0 times theorem prover too weak. 220 trivial. 0 not checked. [2022-07-13 15:57:07,824 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-07-13 15:57:08,018 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-13 15:57:08,018 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1454771840] [2022-07-13 15:57:08,019 WARN L310 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2022-07-13 15:57:08,019 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [2074077482] [2022-07-13 15:57:08,019 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [2074077482] provided 0 perfect and 1 imperfect interpolant sequences [2022-07-13 15:57:08,019 INFO L184 FreeRefinementEngine]: Found 0 perfect and 1 imperfect interpolant sequences. [2022-07-13 15:57:08,019 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [7] total 7 [2022-07-13 15:57:08,019 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1634867018] [2022-07-13 15:57:08,020 INFO L85 oduleStraightlineAll]: Using 1 imperfect interpolants to construct interpolant automaton [2022-07-13 15:57:08,020 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2022-07-13 15:57:08,020 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-13 15:57:08,021 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2022-07-13 15:57:08,021 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=24, Invalid=66, Unknown=0, NotChecked=0, Total=90 [2022-07-13 15:57:08,021 INFO L87 Difference]: Start difference. First operand 80 states and 90 transitions. Second operand has 7 states, 6 states have (on average 2.0) internal successors, (12), 6 states have internal predecessors, (12), 3 states have call successors, (12), 2 states have call predecessors, (12), 1 states have return successors, (11), 3 states have call predecessors, (11), 3 states have call successors, (11) [2022-07-13 15:57:08,145 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-13 15:57:08,145 INFO L93 Difference]: Finished difference Result 93 states and 103 transitions. [2022-07-13 15:57:08,146 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2022-07-13 15:57:08,146 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 6 states have (on average 2.0) internal successors, (12), 6 states have internal predecessors, (12), 3 states have call successors, (12), 2 states have call predecessors, (12), 1 states have return successors, (11), 3 states have call predecessors, (11), 3 states have call successors, (11) Word has length 65 [2022-07-13 15:57:08,146 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-13 15:57:08,147 INFO L225 Difference]: With dead ends: 93 [2022-07-13 15:57:08,147 INFO L226 Difference]: Without dead ends: 91 [2022-07-13 15:57:08,148 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 104 GetRequests, 93 SyntacticMatches, 1 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=34, Invalid=98, Unknown=0, NotChecked=0, Total=132 [2022-07-13 15:57:08,148 INFO L413 NwaCegarLoop]: 32 mSDtfsCounter, 6 mSDsluCounter, 75 mSDsCounter, 0 mSdLazyCounter, 134 mSolverCounterSat, 9 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 6 SdHoareTripleChecker+Valid, 107 SdHoareTripleChecker+Invalid, 143 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 9 IncrementalHoareTripleChecker+Valid, 134 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-07-13 15:57:08,148 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [6 Valid, 107 Invalid, 143 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [9 Valid, 134 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-07-13 15:57:08,149 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 91 states. [2022-07-13 15:57:08,164 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 91 to 90. [2022-07-13 15:57:08,164 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 90 states, 52 states have (on average 1.0576923076923077) internal successors, (55), 55 states have internal predecessors, (55), 23 states have call successors, (23), 14 states have call predecessors, (23), 14 states have return successors, (22), 20 states have call predecessors, (22), 22 states have call successors, (22) [2022-07-13 15:57:08,165 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 90 states to 90 states and 100 transitions. [2022-07-13 15:57:08,165 INFO L78 Accepts]: Start accepts. Automaton has 90 states and 100 transitions. Word has length 65 [2022-07-13 15:57:08,165 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-13 15:57:08,165 INFO L495 AbstractCegarLoop]: Abstraction has 90 states and 100 transitions. [2022-07-13 15:57:08,166 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 6 states have (on average 2.0) internal successors, (12), 6 states have internal predecessors, (12), 3 states have call successors, (12), 2 states have call predecessors, (12), 1 states have return successors, (11), 3 states have call predecessors, (11), 3 states have call successors, (11) [2022-07-13 15:57:08,166 INFO L276 IsEmpty]: Start isEmpty. Operand 90 states and 100 transitions. [2022-07-13 15:57:08,167 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 71 [2022-07-13 15:57:08,167 INFO L187 NwaCegarLoop]: Found error trace [2022-07-13 15:57:08,167 INFO L195 NwaCegarLoop]: trace histogram [13, 12, 12, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-07-13 15:57:08,192 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (8)] Forceful destruction successful, exit code 0 [2022-07-13 15:57:08,392 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8,8 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-07-13 15:57:08,393 INFO L420 AbstractCegarLoop]: === Iteration 10 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-07-13 15:57:08,393 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-13 15:57:08,393 INFO L85 PathProgramCache]: Analyzing trace with hash 161977518, now seen corresponding path program 1 times [2022-07-13 15:57:08,394 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-13 15:57:08,394 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1164846110] [2022-07-13 15:57:08,394 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-13 15:57:08,394 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-13 15:57:08,412 ERROR L245 FreeRefinementEngine]: Caught known exception: Unsupported non-linear arithmetic [2022-07-13 15:57:08,412 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [2139952822] [2022-07-13 15:57:08,412 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-13 15:57:08,412 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-07-13 15:57:08,413 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-13 15:57:08,414 INFO L229 MonitoredProcess]: Starting monitored process 9 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-07-13 15:57:08,415 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (9)] Waiting until timeout for monitored process [2022-07-13 15:57:08,458 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 15:57:08,460 INFO L263 TraceCheckSpWp]: Trace formula consists of 164 conjuncts, 17 conjunts are in the unsatisfiable core [2022-07-13 15:57:08,462 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-07-13 15:57:08,610 INFO L134 CoverageAnalysis]: Checked inductivity of 295 backedges. 24 proven. 7 refuted. 0 times theorem prover too weak. 264 trivial. 0 not checked. [2022-07-13 15:57:08,610 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-07-13 15:57:08,865 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-13 15:57:08,866 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1164846110] [2022-07-13 15:57:08,866 WARN L310 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2022-07-13 15:57:08,866 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [2139952822] [2022-07-13 15:57:08,866 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [2139952822] provided 0 perfect and 1 imperfect interpolant sequences [2022-07-13 15:57:08,866 INFO L184 FreeRefinementEngine]: Found 0 perfect and 1 imperfect interpolant sequences. [2022-07-13 15:57:08,867 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [7] total 7 [2022-07-13 15:57:08,868 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [493291002] [2022-07-13 15:57:08,869 INFO L85 oduleStraightlineAll]: Using 1 imperfect interpolants to construct interpolant automaton [2022-07-13 15:57:08,869 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2022-07-13 15:57:08,869 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-13 15:57:08,869 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2022-07-13 15:57:08,870 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=25, Invalid=65, Unknown=0, NotChecked=0, Total=90 [2022-07-13 15:57:08,870 INFO L87 Difference]: Start difference. First operand 90 states and 100 transitions. Second operand has 7 states, 6 states have (on average 2.0) internal successors, (12), 6 states have internal predecessors, (12), 3 states have call successors, (13), 2 states have call predecessors, (13), 1 states have return successors, (12), 3 states have call predecessors, (12), 3 states have call successors, (12) [2022-07-13 15:57:09,008 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-13 15:57:09,009 INFO L93 Difference]: Finished difference Result 105 states and 112 transitions. [2022-07-13 15:57:09,009 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2022-07-13 15:57:09,009 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 6 states have (on average 2.0) internal successors, (12), 6 states have internal predecessors, (12), 3 states have call successors, (13), 2 states have call predecessors, (13), 1 states have return successors, (12), 3 states have call predecessors, (12), 3 states have call successors, (12) Word has length 70 [2022-07-13 15:57:09,010 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-13 15:57:09,012 INFO L225 Difference]: With dead ends: 105 [2022-07-13 15:57:09,012 INFO L226 Difference]: Without dead ends: 92 [2022-07-13 15:57:09,013 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 114 GetRequests, 103 SyntacticMatches, 1 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=36, Invalid=96, Unknown=0, NotChecked=0, Total=132 [2022-07-13 15:57:09,014 INFO L413 NwaCegarLoop]: 31 mSDtfsCounter, 6 mSDsluCounter, 73 mSDsCounter, 0 mSdLazyCounter, 139 mSolverCounterSat, 10 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 6 SdHoareTripleChecker+Valid, 104 SdHoareTripleChecker+Invalid, 149 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 10 IncrementalHoareTripleChecker+Valid, 139 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-07-13 15:57:09,014 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [6 Valid, 104 Invalid, 149 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [10 Valid, 139 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-07-13 15:57:09,015 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 92 states. [2022-07-13 15:57:09,036 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 92 to 92. [2022-07-13 15:57:09,037 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 92 states, 55 states have (on average 1.0363636363636364) internal successors, (57), 57 states have internal predecessors, (57), 21 states have call successors, (21), 15 states have call predecessors, (21), 15 states have return successors, (20), 19 states have call predecessors, (20), 20 states have call successors, (20) [2022-07-13 15:57:09,037 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 92 states to 92 states and 98 transitions. [2022-07-13 15:57:09,037 INFO L78 Accepts]: Start accepts. Automaton has 92 states and 98 transitions. Word has length 70 [2022-07-13 15:57:09,038 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-13 15:57:09,038 INFO L495 AbstractCegarLoop]: Abstraction has 92 states and 98 transitions. [2022-07-13 15:57:09,038 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 6 states have (on average 2.0) internal successors, (12), 6 states have internal predecessors, (12), 3 states have call successors, (13), 2 states have call predecessors, (13), 1 states have return successors, (12), 3 states have call predecessors, (12), 3 states have call successors, (12) [2022-07-13 15:57:09,038 INFO L276 IsEmpty]: Start isEmpty. Operand 92 states and 98 transitions. [2022-07-13 15:57:09,039 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 93 [2022-07-13 15:57:09,039 INFO L187 NwaCegarLoop]: Found error trace [2022-07-13 15:57:09,040 INFO L195 NwaCegarLoop]: trace histogram [17, 16, 16, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 1, 1, 1, 1, 1, 1, 1, 1] [2022-07-13 15:57:09,065 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (9)] Forceful destruction successful, exit code 0 [2022-07-13 15:57:09,263 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 9 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable9 [2022-07-13 15:57:09,263 INFO L420 AbstractCegarLoop]: === Iteration 11 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-07-13 15:57:09,264 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-13 15:57:09,264 INFO L85 PathProgramCache]: Analyzing trace with hash 253969820, now seen corresponding path program 2 times [2022-07-13 15:57:09,264 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-13 15:57:09,264 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1717966380] [2022-07-13 15:57:09,264 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-13 15:57:09,264 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-13 15:57:09,272 ERROR L245 FreeRefinementEngine]: Caught known exception: Unsupported non-linear arithmetic [2022-07-13 15:57:09,273 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [1215575262] [2022-07-13 15:57:09,273 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2022-07-13 15:57:09,273 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-07-13 15:57:09,273 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-13 15:57:09,274 INFO L229 MonitoredProcess]: Starting monitored process 10 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-07-13 15:57:09,278 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (10)] Waiting until timeout for monitored process [2022-07-13 15:57:09,333 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2022-07-13 15:57:09,334 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-07-13 15:57:09,335 INFO L263 TraceCheckSpWp]: Trace formula consists of 210 conjuncts, 26 conjunts are in the unsatisfiable core [2022-07-13 15:57:09,337 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-07-13 15:57:09,564 INFO L134 CoverageAnalysis]: Checked inductivity of 533 backedges. 32 proven. 21 refuted. 0 times theorem prover too weak. 480 trivial. 0 not checked. [2022-07-13 15:57:09,564 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-07-13 15:57:09,701 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-13 15:57:09,702 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1717966380] [2022-07-13 15:57:09,702 WARN L310 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2022-07-13 15:57:09,702 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1215575262] [2022-07-13 15:57:09,702 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1215575262] provided 0 perfect and 1 imperfect interpolant sequences [2022-07-13 15:57:09,702 INFO L184 FreeRefinementEngine]: Found 0 perfect and 1 imperfect interpolant sequences. [2022-07-13 15:57:09,703 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [8] total 8 [2022-07-13 15:57:09,703 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [518389621] [2022-07-13 15:57:09,703 INFO L85 oduleStraightlineAll]: Using 1 imperfect interpolants to construct interpolant automaton [2022-07-13 15:57:09,704 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2022-07-13 15:57:09,704 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-13 15:57:09,705 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2022-07-13 15:57:09,705 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=27, Invalid=83, Unknown=0, NotChecked=0, Total=110 [2022-07-13 15:57:09,706 INFO L87 Difference]: Start difference. First operand 92 states and 98 transitions. Second operand has 8 states, 7 states have (on average 2.0) internal successors, (14), 7 states have internal predecessors, (14), 4 states have call successors, (17), 2 states have call predecessors, (17), 1 states have return successors, (16), 4 states have call predecessors, (16), 4 states have call successors, (16) [2022-07-13 15:57:09,893 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-13 15:57:09,893 INFO L93 Difference]: Finished difference Result 108 states and 117 transitions. [2022-07-13 15:57:09,893 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2022-07-13 15:57:09,894 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 7 states have (on average 2.0) internal successors, (14), 7 states have internal predecessors, (14), 4 states have call successors, (17), 2 states have call predecessors, (17), 1 states have return successors, (16), 4 states have call predecessors, (16), 4 states have call successors, (16) Word has length 92 [2022-07-13 15:57:09,894 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-13 15:57:09,895 INFO L225 Difference]: With dead ends: 108 [2022-07-13 15:57:09,895 INFO L226 Difference]: Without dead ends: 106 [2022-07-13 15:57:09,895 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 131 GetRequests, 119 SyntacticMatches, 1 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=37, Invalid=119, Unknown=0, NotChecked=0, Total=156 [2022-07-13 15:57:09,896 INFO L413 NwaCegarLoop]: 39 mSDtfsCounter, 6 mSDsluCounter, 95 mSDsCounter, 0 mSdLazyCounter, 223 mSolverCounterSat, 13 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 6 SdHoareTripleChecker+Valid, 134 SdHoareTripleChecker+Invalid, 236 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 13 IncrementalHoareTripleChecker+Valid, 223 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2022-07-13 15:57:09,896 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [6 Valid, 134 Invalid, 236 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [13 Valid, 223 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2022-07-13 15:57:09,896 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 106 states. [2022-07-13 15:57:09,909 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 106 to 105. [2022-07-13 15:57:09,909 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 105 states, 62 states have (on average 1.0483870967741935) internal successors, (65), 64 states have internal predecessors, (65), 25 states have call successors, (25), 17 states have call predecessors, (25), 17 states have return successors, (24), 23 states have call predecessors, (24), 24 states have call successors, (24) [2022-07-13 15:57:09,910 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 105 states to 105 states and 114 transitions. [2022-07-13 15:57:09,910 INFO L78 Accepts]: Start accepts. Automaton has 105 states and 114 transitions. Word has length 92 [2022-07-13 15:57:09,910 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-13 15:57:09,910 INFO L495 AbstractCegarLoop]: Abstraction has 105 states and 114 transitions. [2022-07-13 15:57:09,911 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 7 states have (on average 2.0) internal successors, (14), 7 states have internal predecessors, (14), 4 states have call successors, (17), 2 states have call predecessors, (17), 1 states have return successors, (16), 4 states have call predecessors, (16), 4 states have call successors, (16) [2022-07-13 15:57:09,911 INFO L276 IsEmpty]: Start isEmpty. Operand 105 states and 114 transitions. [2022-07-13 15:57:09,912 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 98 [2022-07-13 15:57:09,912 INFO L187 NwaCegarLoop]: Found error trace [2022-07-13 15:57:09,912 INFO L195 NwaCegarLoop]: trace histogram [18, 17, 17, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-07-13 15:57:09,935 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (10)] Forceful destruction successful, exit code 0 [2022-07-13 15:57:10,135 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10,10 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-07-13 15:57:10,135 INFO L420 AbstractCegarLoop]: === Iteration 12 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-07-13 15:57:10,136 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-13 15:57:10,136 INFO L85 PathProgramCache]: Analyzing trace with hash -877234072, now seen corresponding path program 2 times [2022-07-13 15:57:10,136 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-13 15:57:10,136 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1715754916] [2022-07-13 15:57:10,136 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-13 15:57:10,136 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-13 15:57:10,153 ERROR L245 FreeRefinementEngine]: Caught known exception: Unsupported non-linear arithmetic [2022-07-13 15:57:10,157 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [995181720] [2022-07-13 15:57:10,157 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2022-07-13 15:57:10,157 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-07-13 15:57:10,157 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-13 15:57:10,158 INFO L229 MonitoredProcess]: Starting monitored process 11 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-07-13 15:57:10,166 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (11)] Waiting until timeout for monitored process [2022-07-13 15:57:10,218 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2022-07-13 15:57:10,218 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-07-13 15:57:10,219 INFO L263 TraceCheckSpWp]: Trace formula consists of 219 conjuncts, 23 conjunts are in the unsatisfiable core [2022-07-13 15:57:10,221 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-07-13 15:57:10,430 INFO L134 CoverageAnalysis]: Checked inductivity of 599 backedges. 34 proven. 21 refuted. 0 times theorem prover too weak. 544 trivial. 0 not checked. [2022-07-13 15:57:10,431 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-07-13 15:57:10,566 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-13 15:57:10,566 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1715754916] [2022-07-13 15:57:10,566 WARN L310 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2022-07-13 15:57:10,566 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [995181720] [2022-07-13 15:57:10,566 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [995181720] provided 0 perfect and 1 imperfect interpolant sequences [2022-07-13 15:57:10,567 INFO L184 FreeRefinementEngine]: Found 0 perfect and 1 imperfect interpolant sequences. [2022-07-13 15:57:10,567 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [8] total 8 [2022-07-13 15:57:10,567 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1209471370] [2022-07-13 15:57:10,567 INFO L85 oduleStraightlineAll]: Using 1 imperfect interpolants to construct interpolant automaton [2022-07-13 15:57:10,567 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2022-07-13 15:57:10,568 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-13 15:57:10,568 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2022-07-13 15:57:10,568 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=28, Invalid=82, Unknown=0, NotChecked=0, Total=110 [2022-07-13 15:57:10,568 INFO L87 Difference]: Start difference. First operand 105 states and 114 transitions. Second operand has 8 states, 7 states have (on average 2.0) internal successors, (14), 7 states have internal predecessors, (14), 4 states have call successors, (18), 2 states have call predecessors, (18), 1 states have return successors, (17), 4 states have call predecessors, (17), 4 states have call successors, (17) [2022-07-13 15:57:10,764 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-13 15:57:10,764 INFO L93 Difference]: Finished difference Result 124 states and 129 transitions. [2022-07-13 15:57:10,764 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2022-07-13 15:57:10,765 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 7 states have (on average 2.0) internal successors, (14), 7 states have internal predecessors, (14), 4 states have call successors, (18), 2 states have call predecessors, (18), 1 states have return successors, (17), 4 states have call predecessors, (17), 4 states have call successors, (17) Word has length 97 [2022-07-13 15:57:10,765 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-13 15:57:10,766 INFO L225 Difference]: With dead ends: 124 [2022-07-13 15:57:10,766 INFO L226 Difference]: Without dead ends: 111 [2022-07-13 15:57:10,766 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 141 GetRequests, 129 SyntacticMatches, 1 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=39, Invalid=117, Unknown=0, NotChecked=0, Total=156 [2022-07-13 15:57:10,766 INFO L413 NwaCegarLoop]: 39 mSDtfsCounter, 6 mSDsluCounter, 95 mSDsCounter, 0 mSdLazyCounter, 227 mSolverCounterSat, 13 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 6 SdHoareTripleChecker+Valid, 134 SdHoareTripleChecker+Invalid, 240 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 13 IncrementalHoareTripleChecker+Valid, 227 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2022-07-13 15:57:10,767 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [6 Valid, 134 Invalid, 240 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [13 Valid, 227 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2022-07-13 15:57:10,767 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 111 states. [2022-07-13 15:57:10,778 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 111 to 111. [2022-07-13 15:57:10,779 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 111 states, 68 states have (on average 1.0294117647058822) internal successors, (70), 69 states have internal predecessors, (70), 23 states have call successors, (23), 19 states have call predecessors, (23), 19 states have return successors, (22), 22 states have call predecessors, (22), 22 states have call successors, (22) [2022-07-13 15:57:10,779 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 111 states to 111 states and 115 transitions. [2022-07-13 15:57:10,780 INFO L78 Accepts]: Start accepts. Automaton has 111 states and 115 transitions. Word has length 97 [2022-07-13 15:57:10,780 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-13 15:57:10,780 INFO L495 AbstractCegarLoop]: Abstraction has 111 states and 115 transitions. [2022-07-13 15:57:10,780 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 7 states have (on average 2.0) internal successors, (14), 7 states have internal predecessors, (14), 4 states have call successors, (18), 2 states have call predecessors, (18), 1 states have return successors, (17), 4 states have call predecessors, (17), 4 states have call successors, (17) [2022-07-13 15:57:10,780 INFO L276 IsEmpty]: Start isEmpty. Operand 111 states and 115 transitions. [2022-07-13 15:57:10,781 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 99 [2022-07-13 15:57:10,781 INFO L187 NwaCegarLoop]: Found error trace [2022-07-13 15:57:10,782 INFO L195 NwaCegarLoop]: trace histogram [18, 17, 17, 4, 4, 4, 4, 4, 4, 3, 3, 3, 3, 3, 3, 1, 1, 1, 1] [2022-07-13 15:57:10,811 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (11)] Forceful destruction successful, exit code 0 [2022-07-13 15:57:10,999 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 11 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable11 [2022-07-13 15:57:10,999 INFO L420 AbstractCegarLoop]: === Iteration 13 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-07-13 15:57:11,000 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-13 15:57:11,000 INFO L85 PathProgramCache]: Analyzing trace with hash 537018661, now seen corresponding path program 4 times [2022-07-13 15:57:11,000 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-13 15:57:11,000 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2124824798] [2022-07-13 15:57:11,000 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-13 15:57:11,000 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-13 15:57:11,009 ERROR L245 FreeRefinementEngine]: Caught known exception: Unsupported non-linear arithmetic [2022-07-13 15:57:11,009 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [200454228] [2022-07-13 15:57:11,009 INFO L93 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST [2022-07-13 15:57:11,009 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-07-13 15:57:11,010 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-13 15:57:11,011 INFO L229 MonitoredProcess]: Starting monitored process 12 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-07-13 15:57:11,017 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (12)] Waiting until timeout for monitored process [2022-07-13 15:57:12,141 INFO L228 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2022-07-13 15:57:12,141 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-07-13 15:57:12,143 INFO L263 TraceCheckSpWp]: Trace formula consists of 183 conjuncts, 72 conjunts are in the unsatisfiable core [2022-07-13 15:57:12,145 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-07-13 15:57:12,512 INFO L134 CoverageAnalysis]: Checked inductivity of 611 backedges. 188 proven. 89 refuted. 0 times theorem prover too weak. 334 trivial. 0 not checked. [2022-07-13 15:57:12,512 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-07-13 15:57:12,940 INFO L134 CoverageAnalysis]: Checked inductivity of 611 backedges. 170 proven. 6 refuted. 0 times theorem prover too weak. 435 trivial. 0 not checked. [2022-07-13 15:57:12,941 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-13 15:57:12,941 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2124824798] [2022-07-13 15:57:12,941 WARN L310 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2022-07-13 15:57:12,941 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [200454228] [2022-07-13 15:57:12,941 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [200454228] provided 0 perfect and 2 imperfect interpolant sequences [2022-07-13 15:57:12,941 INFO L184 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2022-07-13 15:57:12,941 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [11, 9] total 14 [2022-07-13 15:57:12,941 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1076733880] [2022-07-13 15:57:12,942 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2022-07-13 15:57:12,942 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 14 states [2022-07-13 15:57:12,942 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-13 15:57:12,942 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 14 interpolants. [2022-07-13 15:57:12,943 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=45, Invalid=137, Unknown=0, NotChecked=0, Total=182 [2022-07-13 15:57:12,943 INFO L87 Difference]: Start difference. First operand 111 states and 115 transitions. Second operand has 14 states, 11 states have (on average 1.9090909090909092) internal successors, (21), 9 states have internal predecessors, (21), 8 states have call successors, (20), 2 states have call predecessors, (20), 2 states have return successors, (23), 8 states have call predecessors, (23), 7 states have call successors, (23) [2022-07-13 15:57:13,114 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-13 15:57:13,114 INFO L93 Difference]: Finished difference Result 117 states and 120 transitions. [2022-07-13 15:57:13,115 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2022-07-13 15:57:13,115 INFO L78 Accepts]: Start accepts. Automaton has has 14 states, 11 states have (on average 1.9090909090909092) internal successors, (21), 9 states have internal predecessors, (21), 8 states have call successors, (20), 2 states have call predecessors, (20), 2 states have return successors, (23), 8 states have call predecessors, (23), 7 states have call successors, (23) Word has length 98 [2022-07-13 15:57:13,115 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-13 15:57:13,116 INFO L225 Difference]: With dead ends: 117 [2022-07-13 15:57:13,116 INFO L226 Difference]: Without dead ends: 115 [2022-07-13 15:57:13,116 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 196 GetRequests, 174 SyntacticMatches, 8 SemanticMatches, 14 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 40 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=58, Invalid=182, Unknown=0, NotChecked=0, Total=240 [2022-07-13 15:57:13,117 INFO L413 NwaCegarLoop]: 13 mSDtfsCounter, 15 mSDsluCounter, 25 mSDsCounter, 0 mSdLazyCounter, 107 mSolverCounterSat, 31 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 17 SdHoareTripleChecker+Valid, 38 SdHoareTripleChecker+Invalid, 138 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 31 IncrementalHoareTripleChecker+Valid, 107 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-07-13 15:57:13,117 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [17 Valid, 38 Invalid, 138 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [31 Valid, 107 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-07-13 15:57:13,117 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 115 states. [2022-07-13 15:57:13,130 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 115 to 115. [2022-07-13 15:57:13,131 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 115 states, 71 states have (on average 1.028169014084507) internal successors, (73), 72 states have internal predecessors, (73), 23 states have call successors, (23), 20 states have call predecessors, (23), 20 states have return successors, (22), 22 states have call predecessors, (22), 22 states have call successors, (22) [2022-07-13 15:57:13,131 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 115 states to 115 states and 118 transitions. [2022-07-13 15:57:13,132 INFO L78 Accepts]: Start accepts. Automaton has 115 states and 118 transitions. Word has length 98 [2022-07-13 15:57:13,132 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-13 15:57:13,132 INFO L495 AbstractCegarLoop]: Abstraction has 115 states and 118 transitions. [2022-07-13 15:57:13,132 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 14 states, 11 states have (on average 1.9090909090909092) internal successors, (21), 9 states have internal predecessors, (21), 8 states have call successors, (20), 2 states have call predecessors, (20), 2 states have return successors, (23), 8 states have call predecessors, (23), 7 states have call successors, (23) [2022-07-13 15:57:13,132 INFO L276 IsEmpty]: Start isEmpty. Operand 115 states and 118 transitions. [2022-07-13 15:57:13,133 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 120 [2022-07-13 15:57:13,133 INFO L187 NwaCegarLoop]: Found error trace [2022-07-13 15:57:13,133 INFO L195 NwaCegarLoop]: trace histogram [22, 21, 21, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 3, 1, 1, 1, 1, 1, 1, 1, 1] [2022-07-13 15:57:13,143 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (12)] Forceful destruction successful, exit code 0 [2022-07-13 15:57:13,341 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 12 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable12 [2022-07-13 15:57:13,341 INFO L420 AbstractCegarLoop]: === Iteration 14 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-07-13 15:57:13,341 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-13 15:57:13,342 INFO L85 PathProgramCache]: Analyzing trace with hash -1784725034, now seen corresponding path program 3 times [2022-07-13 15:57:13,342 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-13 15:57:13,342 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [593792238] [2022-07-13 15:57:13,342 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-13 15:57:13,343 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-13 15:57:13,361 ERROR L245 FreeRefinementEngine]: Caught known exception: Unsupported non-linear arithmetic [2022-07-13 15:57:13,361 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [2088461992] [2022-07-13 15:57:13,361 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2022-07-13 15:57:13,361 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-07-13 15:57:13,361 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-13 15:57:13,363 INFO L229 MonitoredProcess]: Starting monitored process 13 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-07-13 15:57:13,364 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (13)] Waiting until timeout for monitored process [2022-07-13 15:57:13,728 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 3 check-sat command(s) [2022-07-13 15:57:13,729 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-07-13 15:57:13,730 INFO L263 TraceCheckSpWp]: Trace formula consists of 111 conjuncts, 13 conjunts are in the unsatisfiable core [2022-07-13 15:57:13,732 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-07-13 15:57:13,874 INFO L134 CoverageAnalysis]: Checked inductivity of 924 backedges. 107 proven. 16 refuted. 0 times theorem prover too weak. 801 trivial. 0 not checked. [2022-07-13 15:57:13,874 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-07-13 15:57:14,485 INFO L134 CoverageAnalysis]: Checked inductivity of 924 backedges. 107 proven. 16 refuted. 0 times theorem prover too weak. 801 trivial. 0 not checked. [2022-07-13 15:57:14,486 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-13 15:57:14,486 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [593792238] [2022-07-13 15:57:14,486 WARN L310 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2022-07-13 15:57:14,486 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [2088461992] [2022-07-13 15:57:14,486 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [2088461992] provided 0 perfect and 2 imperfect interpolant sequences [2022-07-13 15:57:14,487 INFO L184 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2022-07-13 15:57:14,487 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [9, 9] total 12 [2022-07-13 15:57:14,487 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [402578382] [2022-07-13 15:57:14,487 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2022-07-13 15:57:14,488 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 12 states [2022-07-13 15:57:14,488 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-13 15:57:14,488 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2022-07-13 15:57:14,488 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=32, Invalid=100, Unknown=0, NotChecked=0, Total=132 [2022-07-13 15:57:14,488 INFO L87 Difference]: Start difference. First operand 115 states and 118 transitions. Second operand has 12 states, 11 states have (on average 1.9090909090909092) internal successors, (21), 9 states have internal predecessors, (21), 6 states have call successors, (17), 2 states have call predecessors, (17), 2 states have return successors, (16), 4 states have call predecessors, (16), 6 states have call successors, (16) [2022-07-13 15:57:16,554 WARN L534 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [] [2022-07-13 15:57:18,769 WARN L534 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=true, quantifiers [] [2022-07-13 15:57:20,600 WARN L534 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.36s for a HTC check with result INVALID. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=true, quantifiers [] [2022-07-13 15:57:21,618 WARN L534 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.02s for a HTC check with result VALID. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=true, quantifiers [] [2022-07-13 15:57:23,404 WARN L534 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.79s for a HTC check with result INVALID. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=true, quantifiers [] [2022-07-13 15:57:23,418 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-13 15:57:23,418 INFO L93 Difference]: Finished difference Result 121 states and 123 transitions. [2022-07-13 15:57:23,418 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2022-07-13 15:57:23,419 INFO L78 Accepts]: Start accepts. Automaton has has 12 states, 11 states have (on average 1.9090909090909092) internal successors, (21), 9 states have internal predecessors, (21), 6 states have call successors, (17), 2 states have call predecessors, (17), 2 states have return successors, (16), 4 states have call predecessors, (16), 6 states have call successors, (16) Word has length 119 [2022-07-13 15:57:23,419 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-13 15:57:23,419 INFO L225 Difference]: With dead ends: 121 [2022-07-13 15:57:23,420 INFO L226 Difference]: Without dead ends: 117 [2022-07-13 15:57:23,420 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 239 GetRequests, 224 SyntacticMatches, 2 SemanticMatches, 13 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 23 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=52, Invalid=158, Unknown=0, NotChecked=0, Total=210 [2022-07-13 15:57:23,420 INFO L413 NwaCegarLoop]: 24 mSDtfsCounter, 18 mSDsluCounter, 41 mSDsCounter, 0 mSdLazyCounter, 159 mSolverCounterSat, 23 mSolverCounterUnsat, 2 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 8.8s Time, 0 mProtectedPredicate, 0 mProtectedAction, 19 SdHoareTripleChecker+Valid, 65 SdHoareTripleChecker+Invalid, 184 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 23 IncrementalHoareTripleChecker+Valid, 159 IncrementalHoareTripleChecker+Invalid, 2 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 8.9s IncrementalHoareTripleChecker+Time [2022-07-13 15:57:23,421 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [19 Valid, 65 Invalid, 184 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [23 Valid, 159 Invalid, 2 Unknown, 0 Unchecked, 8.9s Time] [2022-07-13 15:57:23,421 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 117 states. [2022-07-13 15:57:23,434 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 117 to 117. [2022-07-13 15:57:23,435 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 117 states, 73 states have (on average 1.0136986301369864) internal successors, (74), 73 states have internal predecessors, (74), 23 states have call successors, (23), 21 states have call predecessors, (23), 20 states have return successors, (22), 22 states have call predecessors, (22), 22 states have call successors, (22) [2022-07-13 15:57:23,436 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 117 states to 117 states and 119 transitions. [2022-07-13 15:57:23,436 INFO L78 Accepts]: Start accepts. Automaton has 117 states and 119 transitions. Word has length 119 [2022-07-13 15:57:23,436 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-13 15:57:23,436 INFO L495 AbstractCegarLoop]: Abstraction has 117 states and 119 transitions. [2022-07-13 15:57:23,436 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 12 states, 11 states have (on average 1.9090909090909092) internal successors, (21), 9 states have internal predecessors, (21), 6 states have call successors, (17), 2 states have call predecessors, (17), 2 states have return successors, (16), 4 states have call predecessors, (16), 6 states have call successors, (16) [2022-07-13 15:57:23,437 INFO L276 IsEmpty]: Start isEmpty. Operand 117 states and 119 transitions. [2022-07-13 15:57:23,437 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 125 [2022-07-13 15:57:23,438 INFO L187 NwaCegarLoop]: Found error trace [2022-07-13 15:57:23,438 INFO L195 NwaCegarLoop]: trace histogram [23, 22, 22, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-07-13 15:57:23,455 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (13)] Forceful destruction successful, exit code 0 [2022-07-13 15:57:23,644 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 13 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable13 [2022-07-13 15:57:23,644 INFO L420 AbstractCegarLoop]: === Iteration 15 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-07-13 15:57:23,644 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-13 15:57:23,644 INFO L85 PathProgramCache]: Analyzing trace with hash -2108616594, now seen corresponding path program 3 times [2022-07-13 15:57:23,644 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-13 15:57:23,645 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [639731221] [2022-07-13 15:57:23,645 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-13 15:57:23,645 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-13 15:57:23,653 ERROR L245 FreeRefinementEngine]: Caught known exception: Unsupported non-linear arithmetic [2022-07-13 15:57:23,661 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [1954244714] [2022-07-13 15:57:23,661 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2022-07-13 15:57:23,661 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-07-13 15:57:23,661 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-13 15:57:23,675 INFO L229 MonitoredProcess]: Starting monitored process 14 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-07-13 15:57:23,681 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (14)] Waiting until timeout for monitored process [2022-07-13 15:57:24,266 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 4 check-sat command(s) [2022-07-13 15:57:24,267 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-07-13 15:57:24,270 INFO L263 TraceCheckSpWp]: Trace formula consists of 138 conjuncts, 23 conjunts are in the unsatisfiable core [2022-07-13 15:57:24,272 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-07-13 15:57:33,777 INFO L134 CoverageAnalysis]: Checked inductivity of 1010 backedges. 149 proven. 38 refuted. 0 times theorem prover too weak. 823 trivial. 0 not checked. [2022-07-13 15:57:33,777 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-07-13 15:57:42,352 INFO L134 CoverageAnalysis]: Checked inductivity of 1010 backedges. 148 proven. 39 refuted. 0 times theorem prover too weak. 823 trivial. 0 not checked. [2022-07-13 15:57:42,352 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-13 15:57:42,352 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [639731221] [2022-07-13 15:57:42,352 WARN L310 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2022-07-13 15:57:42,353 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1954244714] [2022-07-13 15:57:42,353 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1954244714] provided 0 perfect and 2 imperfect interpolant sequences [2022-07-13 15:57:42,353 INFO L184 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2022-07-13 15:57:42,353 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [11, 10] total 16 [2022-07-13 15:57:42,353 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1702399045] [2022-07-13 15:57:42,353 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2022-07-13 15:57:42,354 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 16 states [2022-07-13 15:57:42,354 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-13 15:57:42,354 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 16 interpolants. [2022-07-13 15:57:42,354 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=51, Invalid=186, Unknown=3, NotChecked=0, Total=240 [2022-07-13 15:57:42,355 INFO L87 Difference]: Start difference. First operand 117 states and 119 transitions. Second operand has 16 states, 14 states have (on average 1.7142857142857142) internal successors, (24), 11 states have internal predecessors, (24), 8 states have call successors, (26), 2 states have call predecessors, (26), 2 states have return successors, (26), 8 states have call predecessors, (26), 8 states have call successors, (26) [2022-07-13 15:57:44,364 WARN L833 $PredicateComparison]: unable to prove that (let ((.cse2 (* |c_ULTIMATE.start_main_~y~0#1| 2)) (.cse3 (* |c_ULTIMATE.start_main_~a~0#1| 6)) (.cse1 (* 2 |c_ULTIMATE.start_main_~z~0#1|))) (and (= (+ (* |c_ULTIMATE.start_main_~z~0#1| |c_ULTIMATE.start_main_~z~0#1|) 12) (+ (* |c_ULTIMATE.start_main_~y~0#1| 12) (* 6 |c_ULTIMATE.start_main_~z~0#1|))) (let ((.cse0 (div (+ (* (- 1) |c_ULTIMATE.start_main_~z~0#1|) 6) (- 6)))) (or (<= (+ .cse0 1) |c_ULTIMATE.start_main_~a~0#1|) (not (= (mod (* 5 |c_ULTIMATE.start_main_~z~0#1|) 6) 0)) (= (+ (* |c_ULTIMATE.start_main_~a~0#1| (+ 6 |c_ULTIMATE.start_main_~z~0#1|)) 12 .cse1) (+ .cse2 .cse1 .cse3 10)) (not (<= .cse0 |c_ULTIMATE.start_main_~a~0#1|)))) (let ((.cse4 (<= (mod |c_ULTIMATE.start_main_~a~0#1| 65536) 32767))) (or (and (<= 0 |c_ULTIMATE.start_main_~a~0#1|) (< |c_ULTIMATE.start_main_~a~0#1| 65536) .cse4) (and (<= 0 (+ 65536 |c_ULTIMATE.start_main_~a~0#1|)) (not .cse4) (< |c_ULTIMATE.start_main_~a~0#1| 0)))) (= (+ .cse2 .cse3 10) (+ (* |c_ULTIMATE.start_main_~a~0#1| |c_ULTIMATE.start_main_~z~0#1|) .cse1)))) is different from false [2022-07-13 15:58:08,606 WARN L233 SmtUtils]: Spent 8.28s on a formula simplification. DAG size of input: 59 DAG size of output: 38 (called from [L 360] de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.predicates.PredicateUnifier.getOrConstructPredicate) [2022-07-13 15:58:11,405 WARN L833 $PredicateComparison]: unable to prove that (and (let ((.cse0 (div (+ (* (- 1) |c_ULTIMATE.start_main_~z~0#1|) 6) (- 6)))) (or (<= (+ .cse0 1) |c_ULTIMATE.start_main_~a~0#1|) (not (= (mod (* 5 |c_ULTIMATE.start_main_~z~0#1|) 6) 0)) (let ((.cse1 (* 2 |c_ULTIMATE.start_main_~z~0#1|))) (= (+ (* |c_ULTIMATE.start_main_~a~0#1| (+ 6 |c_ULTIMATE.start_main_~z~0#1|)) 12 .cse1) (+ (* |c_ULTIMATE.start_main_~y~0#1| 2) .cse1 (* |c_ULTIMATE.start_main_~a~0#1| 6) 10))) (not (<= .cse0 |c_ULTIMATE.start_main_~a~0#1|)))) (= (+ 12 (let ((.cse2 (+ |c_ULTIMATE.start_main_~z~0#1| (- 6)))) (* .cse2 .cse2))) (+ (* |c_ULTIMATE.start_main_~z~0#1| (- 6)) (* |c_ULTIMATE.start_main_~y~0#1| 12) 36)) (<= |c_ULTIMATE.start_main_~n~0#1| (+ |c_ULTIMATE.start_main_~a~0#1| 1)) (let ((.cse3 (<= (mod |c_ULTIMATE.start_main_~a~0#1| 65536) 32767))) (or (and (<= 0 |c_ULTIMATE.start_main_~a~0#1|) (< |c_ULTIMATE.start_main_~a~0#1| 65536) .cse3) (and (<= 0 (+ 65536 |c_ULTIMATE.start_main_~a~0#1|)) (not .cse3) (< |c_ULTIMATE.start_main_~a~0#1| 0))))) is different from false [2022-07-13 15:58:12,638 WARN L534 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.22s for a HTC check with result VALID. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=true, quantifiers [] [2022-07-13 15:58:14,116 WARN L534 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.40s for a HTC check with result VALID. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=true, quantifiers [] [2022-07-13 15:58:16,877 WARN L534 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.29s for a HTC check with result VALID. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=true, quantifiers [] [2022-07-13 15:58:18,927 WARN L534 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=true, quantifiers [] [2022-07-13 15:58:21,007 WARN L534 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.24s for a HTC check with result VALID. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=true, quantifiers [] [2022-07-13 15:58:23,009 WARN L534 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=true, quantifiers [] [2022-07-13 15:58:28,072 WARN L534 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=true, quantifiers [] [2022-07-13 15:58:29,027 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-13 15:58:29,027 INFO L93 Difference]: Finished difference Result 117 states and 119 transitions. [2022-07-13 15:58:29,028 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 16 states. [2022-07-13 15:58:29,028 INFO L78 Accepts]: Start accepts. Automaton has has 16 states, 14 states have (on average 1.7142857142857142) internal successors, (24), 11 states have internal predecessors, (24), 8 states have call successors, (26), 2 states have call predecessors, (26), 2 states have return successors, (26), 8 states have call predecessors, (26), 8 states have call successors, (26) Word has length 124 [2022-07-13 15:58:29,028 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-13 15:58:29,028 INFO L225 Difference]: With dead ends: 117 [2022-07-13 15:58:29,028 INFO L226 Difference]: Without dead ends: 0 [2022-07-13 15:58:29,029 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 255 GetRequests, 231 SyntacticMatches, 1 SemanticMatches, 23 ConstructedPredicates, 2 IntricatePredicates, 0 DeprecatedPredicates, 78 ImplicationChecksByTransitivity, 40.9s TimeCoverageRelationStatistics Valid=119, Invalid=383, Unknown=12, NotChecked=86, Total=600 [2022-07-13 15:58:29,030 INFO L413 NwaCegarLoop]: 20 mSDtfsCounter, 18 mSDsluCounter, 36 mSDsCounter, 0 mSdLazyCounter, 253 mSolverCounterSat, 47 mSolverCounterUnsat, 3 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 16.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 19 SdHoareTripleChecker+Valid, 56 SdHoareTripleChecker+Invalid, 305 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 47 IncrementalHoareTripleChecker+Valid, 253 IncrementalHoareTripleChecker+Invalid, 3 IncrementalHoareTripleChecker+Unknown, 2 IncrementalHoareTripleChecker+Unchecked, 16.2s IncrementalHoareTripleChecker+Time [2022-07-13 15:58:29,030 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [19 Valid, 56 Invalid, 305 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [47 Valid, 253 Invalid, 3 Unknown, 2 Unchecked, 16.2s Time] [2022-07-13 15:58:29,030 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 0 states. [2022-07-13 15:58:29,030 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 0 to 0. [2022-07-13 15:58:29,031 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 0 states, 0 states have (on average 0.0) internal successors, (0), 0 states have internal predecessors, (0), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-13 15:58:29,031 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 0 states to 0 states and 0 transitions. [2022-07-13 15:58:29,031 INFO L78 Accepts]: Start accepts. Automaton has 0 states and 0 transitions. Word has length 124 [2022-07-13 15:58:29,031 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-13 15:58:29,031 INFO L495 AbstractCegarLoop]: Abstraction has 0 states and 0 transitions. [2022-07-13 15:58:29,031 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 16 states, 14 states have (on average 1.7142857142857142) internal successors, (24), 11 states have internal predecessors, (24), 8 states have call successors, (26), 2 states have call predecessors, (26), 2 states have return successors, (26), 8 states have call predecessors, (26), 8 states have call successors, (26) [2022-07-13 15:58:29,031 INFO L276 IsEmpty]: Start isEmpty. Operand 0 states and 0 transitions. [2022-07-13 15:58:29,032 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-07-13 15:58:29,034 INFO L805 garLoopResultBuilder]: Registering result SAFE for location __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION (0 of 1 remaining) [2022-07-13 15:58:29,046 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (14)] Forceful destruction successful, exit code 0 [2022-07-13 15:58:29,240 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 14 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable14 [2022-07-13 15:58:29,242 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends 0 states and 0 transitions. [2022-07-13 15:58:44,250 INFO L895 garLoopResultBuilder]: At program point L33(line 33) the Hoare annotation is: (let ((.cse1 (* 3 |ULTIMATE.start_main_~n~0#1|)) (.cse2 (* 3 (* |ULTIMATE.start_main_~n~0#1| |ULTIMATE.start_main_~n~0#1|))) (.cse0 (let ((.cse3 (<= (mod |ULTIMATE.start_main_~a~0#1| 65536) 32767))) (or (and (< |ULTIMATE.start_main_~a~0#1| 65536) .cse3 (<= 0 |ULTIMATE.start_main_~a~0#1|)) (and (<= 0 (+ 65536 |ULTIMATE.start_main_~a~0#1|)) (< |ULTIMATE.start_main_~a~0#1| 0) (not .cse3)))))) (or (and .cse0 (= (+ .cse1 5 |ULTIMATE.start_main_~y~0#1|) (+ .cse2 |ULTIMATE.start_main_~z~0#1|)) (= |ULTIMATE.start_main_~n~0#1| 0) (= |ULTIMATE.start_main_~x~0#1| 0) (= 6 |ULTIMATE.start_main_~z~0#1|)) (and (= |ULTIMATE.start_main_~y~0#1| (+ .cse1 .cse2 1)) (= (+ (* |ULTIMATE.start_main_~y~0#1| |ULTIMATE.start_main_~z~0#1|) 6 (* |ULTIMATE.start_main_~z~0#1| |ULTIMATE.start_main_~z~0#1|)) (+ (* |ULTIMATE.start_main_~z~0#1| 4) (* |ULTIMATE.start_main_~x~0#1| 18) (* |ULTIMATE.start_main_~y~0#1| 24))) (= |ULTIMATE.start_main_~z~0#1| (+ 6 (* 6 |ULTIMATE.start_main_~n~0#1|))) (<= |ULTIMATE.start_main_~n~0#1| (+ |ULTIMATE.start_main_~a~0#1| 1)) .cse0))) [2022-07-13 15:58:44,251 INFO L899 garLoopResultBuilder]: For program point ULTIMATE.startEXIT(line -1) no Hoare annotation was computed. [2022-07-13 15:58:44,251 INFO L895 garLoopResultBuilder]: At program point L33-1(line 33) the Hoare annotation is: (let ((.cse1 (* 3 |ULTIMATE.start_main_~n~0#1|)) (.cse2 (* 3 (* |ULTIMATE.start_main_~n~0#1| |ULTIMATE.start_main_~n~0#1|))) (.cse0 (let ((.cse3 (<= (mod |ULTIMATE.start_main_~a~0#1| 65536) 32767))) (or (and (< |ULTIMATE.start_main_~a~0#1| 65536) .cse3 (<= 0 |ULTIMATE.start_main_~a~0#1|)) (and (<= 0 (+ 65536 |ULTIMATE.start_main_~a~0#1|)) (< |ULTIMATE.start_main_~a~0#1| 0) (not .cse3)))))) (or (and .cse0 (= (+ .cse1 5 |ULTIMATE.start_main_~y~0#1|) (+ .cse2 |ULTIMATE.start_main_~z~0#1|)) (= |ULTIMATE.start_main_~n~0#1| 0) (= |ULTIMATE.start_main_~x~0#1| 0) (= 6 |ULTIMATE.start_main_~z~0#1|)) (and (= |ULTIMATE.start_main_~y~0#1| (+ .cse1 .cse2 1)) (= (+ (* |ULTIMATE.start_main_~y~0#1| |ULTIMATE.start_main_~z~0#1|) 6 (* |ULTIMATE.start_main_~z~0#1| |ULTIMATE.start_main_~z~0#1|)) (+ (* |ULTIMATE.start_main_~z~0#1| 4) (* |ULTIMATE.start_main_~x~0#1| 18) (* |ULTIMATE.start_main_~y~0#1| 24))) (= |ULTIMATE.start_main_~z~0#1| (+ 6 (* 6 |ULTIMATE.start_main_~n~0#1|))) (<= |ULTIMATE.start_main_~n~0#1| (+ |ULTIMATE.start_main_~a~0#1| 1)) .cse0))) [2022-07-13 15:58:44,251 INFO L902 garLoopResultBuilder]: At program point L54(lines 22 55) the Hoare annotation is: true [2022-07-13 15:58:44,251 INFO L899 garLoopResultBuilder]: For program point L52(line 52) no Hoare annotation was computed. [2022-07-13 15:58:44,251 INFO L895 garLoopResultBuilder]: At program point L50(line 50) the Hoare annotation is: (and (= |ULTIMATE.start_main_~y~0#1| (+ (* 3 |ULTIMATE.start_main_~n~0#1|) (* 3 (* |ULTIMATE.start_main_~n~0#1| |ULTIMATE.start_main_~n~0#1|)) 1)) (= (+ (* |ULTIMATE.start_main_~y~0#1| |ULTIMATE.start_main_~z~0#1|) 6 (* |ULTIMATE.start_main_~z~0#1| |ULTIMATE.start_main_~z~0#1|)) (+ (* |ULTIMATE.start_main_~z~0#1| 4) (* |ULTIMATE.start_main_~x~0#1| 18) (* |ULTIMATE.start_main_~y~0#1| 24))) (= |ULTIMATE.start_main_~z~0#1| (+ 6 (* 6 |ULTIMATE.start_main_~n~0#1|)))) [2022-07-13 15:58:44,251 INFO L895 garLoopResultBuilder]: At program point L48(line 48) the Hoare annotation is: (let ((.cse0 (= |ULTIMATE.start_main_~z~0#1| (+ 6 (* 6 |ULTIMATE.start_main_~n~0#1|))))) (or (and .cse0 (= |ULTIMATE.start_main_~y~0#1| 1) (= |ULTIMATE.start_main_~x~0#1| 0) (= 6 |ULTIMATE.start_main_~z~0#1|)) (and (= |ULTIMATE.start_main_~y~0#1| (+ (* 3 |ULTIMATE.start_main_~n~0#1|) (* 3 (* |ULTIMATE.start_main_~n~0#1| |ULTIMATE.start_main_~n~0#1|)) 1)) (= (+ (* |ULTIMATE.start_main_~y~0#1| |ULTIMATE.start_main_~z~0#1|) 6 (* |ULTIMATE.start_main_~z~0#1| |ULTIMATE.start_main_~z~0#1|)) (+ (* |ULTIMATE.start_main_~z~0#1| 4) (* |ULTIMATE.start_main_~x~0#1| 18) (* |ULTIMATE.start_main_~y~0#1| 24))) .cse0 (let ((.cse1 (<= (mod |ULTIMATE.start_main_~a~0#1| 65536) 32767))) (or (and (< |ULTIMATE.start_main_~a~0#1| 65536) .cse1 (<= 0 |ULTIMATE.start_main_~a~0#1|)) (and (<= 0 (+ 65536 |ULTIMATE.start_main_~a~0#1|)) (< |ULTIMATE.start_main_~a~0#1| 0) (not .cse1)))) (= (+ (* 2 |ULTIMATE.start_main_~y~0#1|) (* 6 |ULTIMATE.start_main_~a~0#1|) 10) (+ (* |ULTIMATE.start_main_~a~0#1| |ULTIMATE.start_main_~z~0#1|) (* 2 |ULTIMATE.start_main_~z~0#1|)))))) [2022-07-13 15:58:44,251 INFO L895 garLoopResultBuilder]: At program point L36(line 36) the Hoare annotation is: (let ((.cse0 (let ((.cse2 (<= (mod |ULTIMATE.start_main_~a~0#1| 65536) 32767))) (or (and (< |ULTIMATE.start_main_~a~0#1| 65536) .cse2 (<= 0 |ULTIMATE.start_main_~a~0#1|)) (and (<= 0 (+ 65536 |ULTIMATE.start_main_~a~0#1|)) (< |ULTIMATE.start_main_~a~0#1| 0) (not .cse2))))) (.cse1 (= (+ (* 3 |ULTIMATE.start_main_~n~0#1|) 5 |ULTIMATE.start_main_~y~0#1|) (+ (* 3 (* |ULTIMATE.start_main_~n~0#1| |ULTIMATE.start_main_~n~0#1|)) |ULTIMATE.start_main_~z~0#1|)))) (or (and .cse0 .cse1 (= |ULTIMATE.start_main_~n~0#1| 0) (= |ULTIMATE.start_main_~x~0#1| 0) (= 6 |ULTIMATE.start_main_~z~0#1|)) (and (= (+ (* |ULTIMATE.start_main_~y~0#1| |ULTIMATE.start_main_~z~0#1|) 6 (* |ULTIMATE.start_main_~z~0#1| |ULTIMATE.start_main_~z~0#1|)) (+ (* |ULTIMATE.start_main_~z~0#1| 4) (* |ULTIMATE.start_main_~x~0#1| 18) (* |ULTIMATE.start_main_~y~0#1| 24))) (= |ULTIMATE.start_main_~z~0#1| (+ 6 (* 6 |ULTIMATE.start_main_~n~0#1|))) (<= |ULTIMATE.start_main_~n~0#1| (+ |ULTIMATE.start_main_~a~0#1| 1)) .cse0 .cse1))) [2022-07-13 15:58:44,251 INFO L895 garLoopResultBuilder]: At program point L34(line 34) the Hoare annotation is: (let ((.cse1 (* 3 |ULTIMATE.start_main_~n~0#1|)) (.cse2 (* 3 (* |ULTIMATE.start_main_~n~0#1| |ULTIMATE.start_main_~n~0#1|))) (.cse0 (let ((.cse3 (<= (mod |ULTIMATE.start_main_~a~0#1| 65536) 32767))) (or (and (< |ULTIMATE.start_main_~a~0#1| 65536) .cse3 (<= 0 |ULTIMATE.start_main_~a~0#1|)) (and (<= 0 (+ 65536 |ULTIMATE.start_main_~a~0#1|)) (< |ULTIMATE.start_main_~a~0#1| 0) (not .cse3)))))) (or (and .cse0 (= (+ .cse1 5 |ULTIMATE.start_main_~y~0#1|) (+ .cse2 |ULTIMATE.start_main_~z~0#1|)) (= |ULTIMATE.start_main_~n~0#1| 0) (= |ULTIMATE.start_main_~x~0#1| 0) (= 6 |ULTIMATE.start_main_~z~0#1|)) (and (= |ULTIMATE.start_main_~y~0#1| (+ .cse1 .cse2 1)) (= (+ (* |ULTIMATE.start_main_~y~0#1| |ULTIMATE.start_main_~z~0#1|) 6 (* |ULTIMATE.start_main_~z~0#1| |ULTIMATE.start_main_~z~0#1|)) (+ (* |ULTIMATE.start_main_~z~0#1| 4) (* |ULTIMATE.start_main_~x~0#1| 18) (* |ULTIMATE.start_main_~y~0#1| 24))) (= |ULTIMATE.start_main_~z~0#1| (+ 6 (* 6 |ULTIMATE.start_main_~n~0#1|))) (<= |ULTIMATE.start_main_~n~0#1| (+ |ULTIMATE.start_main_~a~0#1| 1)) .cse0))) [2022-07-13 15:58:44,252 INFO L899 garLoopResultBuilder]: For program point L-1(line -1) no Hoare annotation was computed. [2022-07-13 15:58:44,252 INFO L895 garLoopResultBuilder]: At program point L32-2(lines 32 45) the Hoare annotation is: (let ((.cse0 (let ((.cse1 (<= (mod |ULTIMATE.start_main_~a~0#1| 65536) 32767))) (or (and (< |ULTIMATE.start_main_~a~0#1| 65536) .cse1 (<= 0 |ULTIMATE.start_main_~a~0#1|)) (and (<= 0 (+ 65536 |ULTIMATE.start_main_~a~0#1|)) (< |ULTIMATE.start_main_~a~0#1| 0) (not .cse1)))))) (or (and (= |ULTIMATE.start_main_~y~0#1| (+ (* 3 |ULTIMATE.start_main_~n~0#1|) (* 3 (* |ULTIMATE.start_main_~n~0#1| |ULTIMATE.start_main_~n~0#1|)) 1)) (= (+ (* |ULTIMATE.start_main_~y~0#1| |ULTIMATE.start_main_~z~0#1|) 6 (* |ULTIMATE.start_main_~z~0#1| |ULTIMATE.start_main_~z~0#1|)) (+ (* |ULTIMATE.start_main_~z~0#1| 4) (* |ULTIMATE.start_main_~x~0#1| 18) (* |ULTIMATE.start_main_~y~0#1| 24))) (= |ULTIMATE.start_main_~z~0#1| (+ 6 (* 6 |ULTIMATE.start_main_~n~0#1|))) (<= |ULTIMATE.start_main_~n~0#1| (+ |ULTIMATE.start_main_~a~0#1| 1)) .cse0) (and .cse0 (= |ULTIMATE.start_main_~n~0#1| 0) (= (+ (* 2 |ULTIMATE.start_main_~y~0#1|) (* 6 |ULTIMATE.start_main_~a~0#1|) 10) (+ (* |ULTIMATE.start_main_~a~0#1| |ULTIMATE.start_main_~z~0#1|) (* 2 |ULTIMATE.start_main_~z~0#1|))) (= |ULTIMATE.start_main_~x~0#1| 0) (= 6 |ULTIMATE.start_main_~z~0#1|)))) [2022-07-13 15:58:44,252 INFO L899 garLoopResultBuilder]: For program point ULTIMATE.startENTRY(line -1) no Hoare annotation was computed. [2022-07-13 15:58:44,252 INFO L895 garLoopResultBuilder]: At program point L32-3(lines 32 45) the Hoare annotation is: (or (and (= |ULTIMATE.start_main_~y~0#1| (+ (* 3 |ULTIMATE.start_main_~n~0#1|) (* 3 (* |ULTIMATE.start_main_~n~0#1| |ULTIMATE.start_main_~n~0#1|)) 1)) (= (+ (* |ULTIMATE.start_main_~y~0#1| |ULTIMATE.start_main_~z~0#1|) 6 (* |ULTIMATE.start_main_~z~0#1| |ULTIMATE.start_main_~z~0#1|)) (+ (* |ULTIMATE.start_main_~z~0#1| 4) (* |ULTIMATE.start_main_~x~0#1| 18) (* |ULTIMATE.start_main_~y~0#1| 24))) (= |ULTIMATE.start_main_~z~0#1| (+ 6 (* 6 |ULTIMATE.start_main_~n~0#1|))) (let ((.cse0 (<= (mod |ULTIMATE.start_main_~a~0#1| 65536) 32767))) (or (and (< |ULTIMATE.start_main_~a~0#1| 65536) .cse0 (<= 0 |ULTIMATE.start_main_~a~0#1|)) (and (<= 0 (+ 65536 |ULTIMATE.start_main_~a~0#1|)) (< |ULTIMATE.start_main_~a~0#1| 0) (not .cse0)))) (= (+ (* 2 |ULTIMATE.start_main_~y~0#1|) (* 6 |ULTIMATE.start_main_~a~0#1|) 10) (+ (* |ULTIMATE.start_main_~a~0#1| |ULTIMATE.start_main_~z~0#1|) (* 2 |ULTIMATE.start_main_~z~0#1|)))) (and (= |ULTIMATE.start_main_~y~0#1| 1) (= |ULTIMATE.start_main_~n~0#1| 0) (= |ULTIMATE.start_main_~x~0#1| 0) (= 6 |ULTIMATE.start_main_~z~0#1|))) [2022-07-13 15:58:44,252 INFO L899 garLoopResultBuilder]: For program point ULTIMATE.startFINAL(line -1) no Hoare annotation was computed. [2022-07-13 15:58:44,252 INFO L895 garLoopResultBuilder]: At program point L51(line 51) the Hoare annotation is: (and (= |ULTIMATE.start_main_~y~0#1| (+ (* 3 |ULTIMATE.start_main_~n~0#1|) (* 3 (* |ULTIMATE.start_main_~n~0#1| |ULTIMATE.start_main_~n~0#1|)) 1)) (= (+ (* |ULTIMATE.start_main_~y~0#1| |ULTIMATE.start_main_~z~0#1|) 6 (* |ULTIMATE.start_main_~z~0#1| |ULTIMATE.start_main_~z~0#1|)) (+ (* |ULTIMATE.start_main_~z~0#1| 4) (* |ULTIMATE.start_main_~x~0#1| 18) (* |ULTIMATE.start_main_~y~0#1| 24))) (= |ULTIMATE.start_main_~z~0#1| (+ 6 (* 6 |ULTIMATE.start_main_~n~0#1|)))) [2022-07-13 15:58:44,252 INFO L895 garLoopResultBuilder]: At program point L49(line 49) the Hoare annotation is: (and (= |ULTIMATE.start_main_~y~0#1| (+ (* 3 |ULTIMATE.start_main_~n~0#1|) (* 3 (* |ULTIMATE.start_main_~n~0#1| |ULTIMATE.start_main_~n~0#1|)) 1)) (= (+ (* |ULTIMATE.start_main_~y~0#1| |ULTIMATE.start_main_~z~0#1|) 6 (* |ULTIMATE.start_main_~z~0#1| |ULTIMATE.start_main_~z~0#1|)) (+ (* |ULTIMATE.start_main_~z~0#1| 4) (* |ULTIMATE.start_main_~x~0#1| 18) (* |ULTIMATE.start_main_~y~0#1| 24))) (= |ULTIMATE.start_main_~z~0#1| (+ 6 (* 6 |ULTIMATE.start_main_~n~0#1|)))) [2022-07-13 15:58:44,252 INFO L895 garLoopResultBuilder]: At program point L47(line 47) the Hoare annotation is: (or (and (= |ULTIMATE.start_main_~y~0#1| (+ (* 3 |ULTIMATE.start_main_~n~0#1|) (* 3 (* |ULTIMATE.start_main_~n~0#1| |ULTIMATE.start_main_~n~0#1|)) 1)) (= (+ (* |ULTIMATE.start_main_~y~0#1| |ULTIMATE.start_main_~z~0#1|) 6 (* |ULTIMATE.start_main_~z~0#1| |ULTIMATE.start_main_~z~0#1|)) (+ (* |ULTIMATE.start_main_~z~0#1| 4) (* |ULTIMATE.start_main_~x~0#1| 18) (* |ULTIMATE.start_main_~y~0#1| 24))) (= |ULTIMATE.start_main_~z~0#1| (+ 6 (* 6 |ULTIMATE.start_main_~n~0#1|))) (let ((.cse0 (<= (mod |ULTIMATE.start_main_~a~0#1| 65536) 32767))) (or (and (< |ULTIMATE.start_main_~a~0#1| 65536) .cse0 (<= 0 |ULTIMATE.start_main_~a~0#1|)) (and (<= 0 (+ 65536 |ULTIMATE.start_main_~a~0#1|)) (< |ULTIMATE.start_main_~a~0#1| 0) (not .cse0)))) (= (+ (* 2 |ULTIMATE.start_main_~y~0#1|) (* 6 |ULTIMATE.start_main_~a~0#1|) 10) (+ (* |ULTIMATE.start_main_~a~0#1| |ULTIMATE.start_main_~z~0#1|) (* 2 |ULTIMATE.start_main_~z~0#1|)))) (and (= |ULTIMATE.start_main_~y~0#1| 1) (= |ULTIMATE.start_main_~n~0#1| 0) (= |ULTIMATE.start_main_~x~0#1| 0) (= 6 |ULTIMATE.start_main_~z~0#1|))) [2022-07-13 15:58:44,252 INFO L899 garLoopResultBuilder]: For program point L37(lines 32 45) no Hoare annotation was computed. [2022-07-13 15:58:44,252 INFO L895 garLoopResultBuilder]: At program point L35(line 35) the Hoare annotation is: (let ((.cse0 (let ((.cse2 (<= (mod |ULTIMATE.start_main_~a~0#1| 65536) 32767))) (or (and (< |ULTIMATE.start_main_~a~0#1| 65536) .cse2 (<= 0 |ULTIMATE.start_main_~a~0#1|)) (and (<= 0 (+ 65536 |ULTIMATE.start_main_~a~0#1|)) (< |ULTIMATE.start_main_~a~0#1| 0) (not .cse2))))) (.cse1 (= (+ (* 3 |ULTIMATE.start_main_~n~0#1|) 5 |ULTIMATE.start_main_~y~0#1|) (+ (* 3 (* |ULTIMATE.start_main_~n~0#1| |ULTIMATE.start_main_~n~0#1|)) |ULTIMATE.start_main_~z~0#1|)))) (or (and .cse0 .cse1 (= |ULTIMATE.start_main_~n~0#1| 0) (= |ULTIMATE.start_main_~x~0#1| 0) (= 6 |ULTIMATE.start_main_~z~0#1|)) (and (= (+ (* |ULTIMATE.start_main_~y~0#1| |ULTIMATE.start_main_~z~0#1|) 6 (* |ULTIMATE.start_main_~z~0#1| |ULTIMATE.start_main_~z~0#1|)) (+ (* |ULTIMATE.start_main_~z~0#1| 4) (* |ULTIMATE.start_main_~x~0#1| 18) (* |ULTIMATE.start_main_~y~0#1| 24))) (= |ULTIMATE.start_main_~z~0#1| (+ 6 (* 6 |ULTIMATE.start_main_~n~0#1|))) (<= |ULTIMATE.start_main_~n~0#1| (+ |ULTIMATE.start_main_~a~0#1| 1)) .cse0 .cse1))) [2022-07-13 15:58:44,252 INFO L899 garLoopResultBuilder]: For program point L16(lines 16 17) no Hoare annotation was computed. [2022-07-13 15:58:44,252 INFO L899 garLoopResultBuilder]: For program point L15(lines 15 18) no Hoare annotation was computed. [2022-07-13 15:58:44,252 INFO L902 garLoopResultBuilder]: At program point __VERIFIER_assertENTRY(lines 14 20) the Hoare annotation is: true [2022-07-13 15:58:44,253 INFO L899 garLoopResultBuilder]: For program point L15-2(lines 14 20) no Hoare annotation was computed. [2022-07-13 15:58:44,253 INFO L899 garLoopResultBuilder]: For program point __VERIFIER_assertEXIT(lines 14 20) no Hoare annotation was computed. [2022-07-13 15:58:44,253 INFO L899 garLoopResultBuilder]: For program point __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION(line 17) no Hoare annotation was computed. [2022-07-13 15:58:44,255 INFO L356 BasicCegarLoop]: Path program histogram: [4, 3, 3, 1, 1, 1, 1, 1] [2022-07-13 15:58:44,256 INFO L176 ceAbstractionStarter]: Computing trace abstraction results [2022-07-13 15:58:44,272 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 13.07 03:58:44 BoogieIcfgContainer [2022-07-13 15:58:44,272 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2022-07-13 15:58:44,273 INFO L113 PluginConnector]: ------------------------Witness Printer---------------------------- [2022-07-13 15:58:44,273 INFO L271 PluginConnector]: Initializing Witness Printer... [2022-07-13 15:58:44,273 INFO L275 PluginConnector]: Witness Printer initialized [2022-07-13 15:58:44,273 INFO L185 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 13.07 03:57:03" (3/4) ... [2022-07-13 15:58:44,275 INFO L137 WitnessPrinter]: Generating witness for correct program [2022-07-13 15:58:44,281 INFO L354 RCFGBacktranslator]: Ignoring RootEdge to procedure __VERIFIER_assert [2022-07-13 15:58:44,283 INFO L910 BoogieBacktranslator]: Reduced CFG by removing 11 nodes and edges [2022-07-13 15:58:44,284 INFO L910 BoogieBacktranslator]: Reduced CFG by removing 5 nodes and edges [2022-07-13 15:58:44,284 INFO L910 BoogieBacktranslator]: Reduced CFG by removing 2 nodes and edges [2022-07-13 15:58:44,284 INFO L910 BoogieBacktranslator]: Reduced CFG by removing 1 nodes and edges [2022-07-13 15:58:44,312 INFO L141 WitnessManager]: Wrote witness to /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/witness.graphml [2022-07-13 15:58:44,312 INFO L132 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2022-07-13 15:58:44,313 INFO L158 Benchmark]: Toolchain (without parser) took 101667.95ms. Allocated memory was 96.5MB in the beginning and 151.0MB in the end (delta: 54.5MB). Free memory was 65.2MB in the beginning and 63.1MB in the end (delta: 2.1MB). Peak memory consumption was 57.3MB. Max. memory is 16.1GB. [2022-07-13 15:58:44,313 INFO L158 Benchmark]: CDTParser took 0.20ms. Allocated memory is still 96.5MB. Free memory is still 53.2MB. There was no memory consumed. Max. memory is 16.1GB. [2022-07-13 15:58:44,313 INFO L158 Benchmark]: CACSL2BoogieTranslator took 233.53ms. Allocated memory is still 96.5MB. Free memory was 65.0MB in the beginning and 72.0MB in the end (delta: -7.1MB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. [2022-07-13 15:58:44,314 INFO L158 Benchmark]: Boogie Procedure Inliner took 33.82ms. Allocated memory is still 96.5MB. Free memory was 71.7MB in the beginning and 70.4MB in the end (delta: 1.3MB). There was no memory consumed. Max. memory is 16.1GB. [2022-07-13 15:58:44,314 INFO L158 Benchmark]: Boogie Preprocessor took 15.61ms. Allocated memory is still 96.5MB. Free memory was 70.4MB in the beginning and 69.3MB in the end (delta: 1.1MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. [2022-07-13 15:58:44,314 INFO L158 Benchmark]: RCFGBuilder took 212.59ms. Allocated memory is still 96.5MB. Free memory was 69.3MB in the beginning and 59.5MB in the end (delta: 9.8MB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. [2022-07-13 15:58:44,315 INFO L158 Benchmark]: TraceAbstraction took 101122.11ms. Allocated memory was 96.5MB in the beginning and 151.0MB in the end (delta: 54.5MB). Free memory was 58.8MB in the beginning and 65.2MB in the end (delta: -6.3MB). Peak memory consumption was 79.4MB. Max. memory is 16.1GB. [2022-07-13 15:58:44,315 INFO L158 Benchmark]: Witness Printer took 39.76ms. Allocated memory is still 151.0MB. Free memory was 65.2MB in the beginning and 63.1MB in the end (delta: 2.1MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. [2022-07-13 15:58:44,316 INFO L339 ainManager$Toolchain]: ####################### End [Toolchain 1] ####################### --- Results --- * Results from de.uni_freiburg.informatik.ultimate.core: - StatisticsResult: Toolchain Benchmarks Benchmark results are: * CDTParser took 0.20ms. Allocated memory is still 96.5MB. Free memory is still 53.2MB. There was no memory consumed. Max. memory is 16.1GB. * CACSL2BoogieTranslator took 233.53ms. Allocated memory is still 96.5MB. Free memory was 65.0MB in the beginning and 72.0MB in the end (delta: -7.1MB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. * Boogie Procedure Inliner took 33.82ms. Allocated memory is still 96.5MB. Free memory was 71.7MB in the beginning and 70.4MB in the end (delta: 1.3MB). There was no memory consumed. Max. memory is 16.1GB. * Boogie Preprocessor took 15.61ms. Allocated memory is still 96.5MB. Free memory was 70.4MB in the beginning and 69.3MB in the end (delta: 1.1MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. * RCFGBuilder took 212.59ms. Allocated memory is still 96.5MB. Free memory was 69.3MB in the beginning and 59.5MB in the end (delta: 9.8MB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. * TraceAbstraction took 101122.11ms. Allocated memory was 96.5MB in the beginning and 151.0MB in the end (delta: 54.5MB). Free memory was 58.8MB in the beginning and 65.2MB in the end (delta: -6.3MB). Peak memory consumption was 79.4MB. Max. memory is 16.1GB. * Witness Printer took 39.76ms. Allocated memory is still 151.0MB. Free memory was 65.2MB in the beginning and 63.1MB in the end (delta: 2.1MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - StatisticsResult: ErrorAutomatonStatistics NumberErrorTraces: 0, NumberStatementsAllTraces: 0, NumberRelevantStatements: 0, 0.0s ErrorAutomatonConstructionTimeTotal, 0.0s FaulLocalizationTime, NumberStatementsFirstTrace: -1, TraceLengthAvg: 0, 0.0s ErrorAutomatonConstructionTimeAvg, 0.0s ErrorAutomatonDifferenceTimeAvg, 0.0s ErrorAutomatonDifferenceTimeTotal, NumberOfNoEnhancement: 0, NumberOfFiniteEnhancement: 0, NumberOfInfiniteEnhancement: 0 - PositiveResult [Line: 17]: call to reach_error is unreachable For all program executions holds that call to reach_error is unreachable at this location - StatisticsResult: Ultimate Automizer benchmark data CFG has 2 procedures, 25 locations, 1 error locations. Started 1 CEGAR loops. OverallTime: 101.1s, OverallIterations: 15, TraceHistogramMax: 23, PathProgramHistogramMax: 4, EmptinessCheckTime: 0.0s, AutomataDifference: 57.8s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 15.0s, InitialAbstractionConstructionTime: 0.0s, HoareTripleCheckerStatistics: 5 mSolverCounterUnknown, 179 SdHoareTripleChecker+Valid, 26.7s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 126 mSDsluCounter, 1369 SdHoareTripleChecker+Invalid, 26.4s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 2 IncrementalHoareTripleChecker+Unchecked, 879 mSDsCounter, 264 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 1943 IncrementalHoareTripleChecker+Invalid, 2214 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 264 mSolverCounterUnsat, 490 mSDtfsCounter, 1943 mSolverCounterSat, 0.0s SdHoareTripleChecker+Time, 5 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 1504 GetRequests, 1353 SyntacticMatches, 18 SemanticMatches, 133 ConstructedPredicates, 2 IntricatePredicates, 0 DeprecatedPredicates, 160 ImplicationChecksByTransitivity, 42.5s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=117occurred in iteration=14, InterpolantAutomatonStates: 106, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s DumpTime, AutomataMinimizationStatistics: 0.2s AutomataMinimizationTime, 15 MinimizatonAttempts, 43 StatesRemovedByMinimization, 7 NontrivialMinimizations, HoareAnnotationStatistics: 0.0s HoareAnnotationTime, 14 LocationsWithAnnotation, 65 PreInvPairs, 111 NumberOfFragments, 1170 HoareAnnotationTreeSize, 65 FomulaSimplifications, 6854 FormulaSimplificationTreeSizeReduction, 0.3s HoareSimplificationTime, 14 FomulaSimplificationsInter, 9616 FormulaSimplificationTreeSizeReductionInter, 14.7s HoareSimplificationTimeInter, RefinementEngineStatistics: TRACE_CHECK: 0.1s SsaConstructionTime, 2.3s SatisfiabilityAnalysisTime, 22.1s InterpolantComputationTime, 862 NumberOfCodeBlocks, 673 NumberOfCodeBlocksAsserted, 24 NumberOfCheckSat, 1314 ConstructedInterpolants, 0 QuantifiedInterpolants, 6466 SizeOfPredicates, 42 NumberOfNonLiveVariables, 1669 ConjunctsInSsa, 264 ConjunctsInUnsatCore, 21 InterpolantComputations, 5 PerfectInterpolantSequences, 7130/7414 InterpolantCoveringCapability, INVARIANT_SYNTHESIS: No data available, INTERPOLANT_CONSOLIDATION: No data available, ABSTRACT_INTERPRETATION: No data available, PDR: No data available, ACCELERATED_INTERPOLATION: No data available, SIFA: No data available, ReuseStatistics: No data available - AllSpecificationsHoldResult: All specifications hold 1 specifications checked. All of them hold - InvariantResult [Line: 32]: Loop Invariant Derived loop invariant: ((((y == 3 * n + 3 * (n * n) + 1 && y * z + 6 + z * z == z * 4 + x * 18 + y * 24) && z == 6 + 6 * n) && n <= a + 1) && (((a < 65536 && a % 65536 <= 32767) && 0 <= a) || ((0 <= 65536 + a && a < 0) && !(a % 65536 <= 32767)))) || (((((((a < 65536 && a % 65536 <= 32767) && 0 <= a) || ((0 <= 65536 + a && a < 0) && !(a % 65536 <= 32767))) && n == 0) && 2 * y + 6 * a + 10 == a * z + 2 * z) && x == 0) && 6 == z) - InvariantResult [Line: 22]: Loop Invariant Derived loop invariant: 1 RESULT: Ultimate proved your program to be correct! [2022-07-13 15:58:44,352 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (1)] Forceful destruction successful, exit code 0 Received shutdown request... --- End real Ultimate output --- Execution finished normally Writing output log to file Ultimate.log Result: TRUE