/usr/bin/java -ea -Xmx8000000000 -Xss4m -jar ./plugins/org.eclipse.equinox.launcher_1.5.800.v20200727-1323.jar -data @noDefault -ultimatedata ./data --core.log.level.for.class de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=WARN -tc ../../../trunk/examples/toolchains/AutomizerC.xml -s ../../../trunk/examples/settings/default/automizer/svcomp-Reach-32bit-Automizer_Default.epf -i ../../../trunk/examples/svcomp/nla-digbench-scaling/fermat2-ll_unwindbound1.c -------------------------------------------------------------------------------- This is Ultimate 0.2.2-dev-fb4f59a-m [2022-04-27 13:17:43,822 INFO L177 SettingsManager]: Resetting all preferences to default values... [2022-04-27 13:17:43,824 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2022-04-27 13:17:43,855 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2022-04-27 13:17:43,856 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2022-04-27 13:17:43,857 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2022-04-27 13:17:43,859 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2022-04-27 13:17:43,860 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2022-04-27 13:17:43,861 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2022-04-27 13:17:43,865 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2022-04-27 13:17:43,865 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2022-04-27 13:17:43,866 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2022-04-27 13:17:43,866 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2022-04-27 13:17:43,868 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2022-04-27 13:17:43,869 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2022-04-27 13:17:43,870 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2022-04-27 13:17:43,871 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2022-04-27 13:17:43,871 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2022-04-27 13:17:43,873 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2022-04-27 13:17:43,877 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2022-04-27 13:17:43,878 INFO L181 SettingsManager]: Resetting HornVerifier preferences to default values [2022-04-27 13:17:43,879 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2022-04-27 13:17:43,879 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2022-04-27 13:17:43,880 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2022-04-27 13:17:43,881 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2022-04-27 13:17:43,885 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2022-04-27 13:17:43,885 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2022-04-27 13:17:43,885 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2022-04-27 13:17:43,886 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2022-04-27 13:17:43,886 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2022-04-27 13:17:43,887 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2022-04-27 13:17:43,887 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2022-04-27 13:17:43,888 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2022-04-27 13:17:43,888 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2022-04-27 13:17:43,889 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2022-04-27 13:17:43,889 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2022-04-27 13:17:43,889 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2022-04-27 13:17:43,890 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2022-04-27 13:17:43,890 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2022-04-27 13:17:43,890 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2022-04-27 13:17:43,890 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2022-04-27 13:17:43,891 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2022-04-27 13:17:43,892 INFO L101 SettingsManager]: Beginning loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/settings/default/automizer/svcomp-Reach-32bit-Automizer_Default.epf [2022-04-27 13:17:43,908 INFO L113 SettingsManager]: Loading preferences was successful [2022-04-27 13:17:43,908 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2022-04-27 13:17:43,908 INFO L136 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2022-04-27 13:17:43,909 INFO L138 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2022-04-27 13:17:43,909 INFO L136 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2022-04-27 13:17:43,909 INFO L138 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2022-04-27 13:17:43,909 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2022-04-27 13:17:43,909 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2022-04-27 13:17:43,910 INFO L138 SettingsManager]: * Use SBE=true [2022-04-27 13:17:43,910 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2022-04-27 13:17:43,910 INFO L138 SettingsManager]: * sizeof long=4 [2022-04-27 13:17:43,910 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2022-04-27 13:17:43,910 INFO L138 SettingsManager]: * sizeof POINTER=4 [2022-04-27 13:17:43,911 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2022-04-27 13:17:43,911 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2022-04-27 13:17:43,911 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2022-04-27 13:17:43,911 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2022-04-27 13:17:43,912 INFO L138 SettingsManager]: * sizeof long double=12 [2022-04-27 13:17:43,912 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2022-04-27 13:17:43,912 INFO L138 SettingsManager]: * Use constant arrays=true [2022-04-27 13:17:43,912 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2022-04-27 13:17:43,912 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2022-04-27 13:17:43,912 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2022-04-27 13:17:43,912 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2022-04-27 13:17:43,912 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-04-27 13:17:43,912 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2022-04-27 13:17:43,912 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2022-04-27 13:17:43,912 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2022-04-27 13:17:43,913 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2022-04-27 13:17:43,913 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2022-04-27 13:17:43,913 INFO L138 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2022-04-27 13:17:43,913 INFO L138 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2022-04-27 13:17:43,913 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2022-04-27 13:17:43,913 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.core: Log level for class -> de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=WARN; [2022-04-27 13:17:44,072 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2022-04-27 13:17:44,089 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2022-04-27 13:17:44,090 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2022-04-27 13:17:44,092 INFO L271 PluginConnector]: Initializing CDTParser... [2022-04-27 13:17:44,092 INFO L275 PluginConnector]: CDTParser initialized [2022-04-27 13:17:44,093 INFO L432 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/nla-digbench-scaling/fermat2-ll_unwindbound1.c [2022-04-27 13:17:44,135 INFO L220 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/723b9c7f3/7e210fc35e11411ba80b6c9694744c8f/FLAGf0ecf8c9c [2022-04-27 13:17:44,494 INFO L306 CDTParser]: Found 1 translation units. [2022-04-27 13:17:44,494 INFO L160 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/nla-digbench-scaling/fermat2-ll_unwindbound1.c [2022-04-27 13:17:44,501 INFO L349 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/723b9c7f3/7e210fc35e11411ba80b6c9694744c8f/FLAGf0ecf8c9c [2022-04-27 13:17:44,511 INFO L357 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/723b9c7f3/7e210fc35e11411ba80b6c9694744c8f [2022-04-27 13:17:44,512 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2022-04-27 13:17:44,514 INFO L131 ToolchainWalker]: Walking toolchain with 4 elements. [2022-04-27 13:17:44,516 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2022-04-27 13:17:44,516 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2022-04-27 13:17:44,518 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2022-04-27 13:17:44,518 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 27.04 01:17:44" (1/1) ... [2022-04-27 13:17:44,519 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@d653998 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.04 01:17:44, skipping insertion in model container [2022-04-27 13:17:44,519 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 27.04 01:17:44" (1/1) ... [2022-04-27 13:17:44,523 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2022-04-27 13:17:44,530 INFO L178 MainTranslator]: Built tables and reachable declarations [2022-04-27 13:17:44,642 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/trunk/examples/svcomp/nla-digbench-scaling/fermat2-ll_unwindbound1.c[524,537] [2022-04-27 13:17:44,667 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-04-27 13:17:44,676 INFO L203 MainTranslator]: Completed pre-run [2022-04-27 13:17:44,687 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/trunk/examples/svcomp/nla-digbench-scaling/fermat2-ll_unwindbound1.c[524,537] [2022-04-27 13:17:44,692 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-04-27 13:17:44,700 INFO L208 MainTranslator]: Completed translation [2022-04-27 13:17:44,700 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.04 01:17:44 WrapperNode [2022-04-27 13:17:44,700 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2022-04-27 13:17:44,701 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2022-04-27 13:17:44,701 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2022-04-27 13:17:44,701 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2022-04-27 13:17:44,707 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.04 01:17:44" (1/1) ... [2022-04-27 13:17:44,707 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.04 01:17:44" (1/1) ... [2022-04-27 13:17:44,711 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.04 01:17:44" (1/1) ... [2022-04-27 13:17:44,711 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.04 01:17:44" (1/1) ... [2022-04-27 13:17:44,718 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.04 01:17:44" (1/1) ... [2022-04-27 13:17:44,720 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.04 01:17:44" (1/1) ... [2022-04-27 13:17:44,721 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.04 01:17:44" (1/1) ... [2022-04-27 13:17:44,726 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2022-04-27 13:17:44,727 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2022-04-27 13:17:44,727 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2022-04-27 13:17:44,728 INFO L275 PluginConnector]: RCFGBuilder initialized [2022-04-27 13:17:44,728 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.04 01:17:44" (1/1) ... [2022-04-27 13:17:44,732 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-04-27 13:17:44,746 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-04-27 13:17:44,757 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-04-27 13:17:44,763 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-04-27 13:17:44,787 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.init [2022-04-27 13:17:44,788 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2022-04-27 13:17:44,788 INFO L138 BoogieDeclarations]: Found implementation of procedure reach_error [2022-04-27 13:17:44,788 INFO L138 BoogieDeclarations]: Found implementation of procedure assume_abort_if_not [2022-04-27 13:17:44,790 INFO L138 BoogieDeclarations]: Found implementation of procedure __VERIFIER_assert [2022-04-27 13:17:44,790 INFO L138 BoogieDeclarations]: Found implementation of procedure main [2022-04-27 13:17:44,790 INFO L130 BoogieDeclarations]: Found specification of procedure abort [2022-04-27 13:17:44,790 INFO L130 BoogieDeclarations]: Found specification of procedure __assert_fail [2022-04-27 13:17:44,790 INFO L130 BoogieDeclarations]: Found specification of procedure reach_error [2022-04-27 13:17:44,790 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2022-04-27 13:17:44,790 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_nondet_int [2022-04-27 13:17:44,790 INFO L130 BoogieDeclarations]: Found specification of procedure assume_abort_if_not [2022-04-27 13:17:44,790 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_assert [2022-04-27 13:17:44,791 INFO L130 BoogieDeclarations]: Found specification of procedure main [2022-04-27 13:17:44,791 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.init [2022-04-27 13:17:44,791 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2022-04-27 13:17:44,791 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2022-04-27 13:17:44,791 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2022-04-27 13:17:44,791 INFO L130 BoogieDeclarations]: Found specification of procedure read~int [2022-04-27 13:17:44,791 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2022-04-27 13:17:44,848 INFO L234 CfgBuilder]: Building ICFG [2022-04-27 13:17:44,849 INFO L260 CfgBuilder]: Building CFG for each procedure with an implementation [2022-04-27 13:17:45,021 INFO L275 CfgBuilder]: Performing block encoding [2022-04-27 13:17:45,026 INFO L294 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2022-04-27 13:17:45,026 INFO L299 CfgBuilder]: Removed 1 assume(true) statements. [2022-04-27 13:17:45,027 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 27.04 01:17:45 BoogieIcfgContainer [2022-04-27 13:17:45,027 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2022-04-27 13:17:45,028 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2022-04-27 13:17:45,028 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2022-04-27 13:17:45,036 INFO L275 PluginConnector]: TraceAbstraction initialized [2022-04-27 13:17:45,036 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 27.04 01:17:44" (1/3) ... [2022-04-27 13:17:45,036 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@5699aa59 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 27.04 01:17:45, skipping insertion in model container [2022-04-27 13:17:45,037 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.04 01:17:44" (2/3) ... [2022-04-27 13:17:45,037 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@5699aa59 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 27.04 01:17:45, skipping insertion in model container [2022-04-27 13:17:45,037 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 27.04 01:17:45" (3/3) ... [2022-04-27 13:17:45,038 INFO L111 eAbstractionObserver]: Analyzing ICFG fermat2-ll_unwindbound1.c [2022-04-27 13:17:45,046 INFO L201 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2022-04-27 13:17:45,047 INFO L160 ceAbstractionStarter]: Applying trace abstraction to program that has 1 error locations. [2022-04-27 13:17:45,074 INFO L356 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2022-04-27 13:17:45,078 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@3d334870, mLbeIndependenceSettings=de.uni_freiburg.informatik.ultimate.lib.tracecheckerutils.partialorder.independence.IndependenceSettings@5f099583 [2022-04-27 13:17:45,078 INFO L358 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2022-04-27 13:17:45,083 INFO L276 IsEmpty]: Start isEmpty. Operand has 30 states, 18 states have (on average 1.3888888888888888) internal successors, (25), 19 states have internal predecessors, (25), 6 states have call successors, (6), 4 states have call predecessors, (6), 4 states have return successors, (6), 6 states have call predecessors, (6), 6 states have call successors, (6) [2022-04-27 13:17:45,088 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2022-04-27 13:17:45,088 INFO L187 NwaCegarLoop]: Found error trace [2022-04-27 13:17:45,088 INFO L195 NwaCegarLoop]: trace histogram [2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-27 13:17:45,088 INFO L420 AbstractCegarLoop]: === Iteration 1 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-27 13:17:45,091 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-27 13:17:45,092 INFO L85 PathProgramCache]: Analyzing trace with hash -1859024204, now seen corresponding path program 1 times [2022-04-27 13:17:45,097 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-27 13:17:45,097 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1585657763] [2022-04-27 13:17:45,097 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-27 13:17:45,098 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-27 13:17:45,159 ERROR L245 FreeRefinementEngine]: Caught known exception: Unsupported non-linear arithmetic [2022-04-27 13:17:45,160 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [1456138652] [2022-04-27 13:17:45,160 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-27 13:17:45,160 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-27 13:17:45,160 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-04-27 13:17:45,162 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-04-27 13:17:45,162 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-04-27 13:17:45,209 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-27 13:17:45,210 INFO L263 TraceCheckSpWp]: Trace formula consists of 89 conjuncts, 1 conjunts are in the unsatisfiable core [2022-04-27 13:17:45,219 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-27 13:17:45,221 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-04-27 13:17:45,314 INFO L272 TraceCheckUtils]: 0: Hoare triple {33#true} call ULTIMATE.init(); {33#true} is VALID [2022-04-27 13:17:45,314 INFO L290 TraceCheckUtils]: 1: Hoare triple {33#true} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(13, 2);call #Ultimate.allocInit(12, 3);~counter~0 := 0; {33#true} is VALID [2022-04-27 13:17:45,315 INFO L290 TraceCheckUtils]: 2: Hoare triple {33#true} assume true; {33#true} is VALID [2022-04-27 13:17:45,315 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {33#true} {33#true} #67#return; {33#true} is VALID [2022-04-27 13:17:45,315 INFO L272 TraceCheckUtils]: 4: Hoare triple {33#true} call #t~ret7 := main(); {33#true} is VALID [2022-04-27 13:17:45,315 INFO L290 TraceCheckUtils]: 5: Hoare triple {33#true} havoc ~A~0;havoc ~R~0;havoc ~u~0;havoc ~v~0;havoc ~r~0;assume -2147483648 <= #t~nondet4 && #t~nondet4 <= 2147483647;~A~0 := #t~nondet4;havoc #t~nondet4;assume -2147483648 <= #t~nondet5 && #t~nondet5 <= 2147483647;~R~0 := #t~nondet5;havoc #t~nondet5; {33#true} is VALID [2022-04-27 13:17:45,315 INFO L272 TraceCheckUtils]: 6: Hoare triple {33#true} call assume_abort_if_not((if (~R~0 - 1) * (~R~0 - 1) < ~A~0 then 1 else 0)); {33#true} is VALID [2022-04-27 13:17:45,315 INFO L290 TraceCheckUtils]: 7: Hoare triple {33#true} ~cond := #in~cond; {33#true} is VALID [2022-04-27 13:17:45,316 INFO L290 TraceCheckUtils]: 8: Hoare triple {33#true} assume 0 == ~cond;assume false; {34#false} is VALID [2022-04-27 13:17:45,316 INFO L290 TraceCheckUtils]: 9: Hoare triple {34#false} assume true; {34#false} is VALID [2022-04-27 13:17:45,316 INFO L284 TraceCheckUtils]: 10: Hoare quadruple {34#false} {33#true} #59#return; {34#false} is VALID [2022-04-27 13:17:45,317 INFO L272 TraceCheckUtils]: 11: Hoare triple {34#false} call assume_abort_if_not((if 1 == (if ~A~0 < 0 && 0 != ~A~0 % 2 then ~A~0 % 2 - 2 else ~A~0 % 2) then 1 else 0)); {34#false} is VALID [2022-04-27 13:17:45,317 INFO L290 TraceCheckUtils]: 12: Hoare triple {34#false} ~cond := #in~cond; {34#false} is VALID [2022-04-27 13:17:45,317 INFO L290 TraceCheckUtils]: 13: Hoare triple {34#false} assume 0 == ~cond;assume false; {34#false} is VALID [2022-04-27 13:17:45,317 INFO L290 TraceCheckUtils]: 14: Hoare triple {34#false} assume true; {34#false} is VALID [2022-04-27 13:17:45,317 INFO L284 TraceCheckUtils]: 15: Hoare quadruple {34#false} {34#false} #61#return; {34#false} is VALID [2022-04-27 13:17:45,317 INFO L290 TraceCheckUtils]: 16: Hoare triple {34#false} ~u~0 := 1 + 2 * ~R~0;~v~0 := 1;~r~0 := ~R~0 * ~R~0 - ~A~0; {34#false} is VALID [2022-04-27 13:17:45,318 INFO L290 TraceCheckUtils]: 17: Hoare triple {34#false} assume !true; {34#false} is VALID [2022-04-27 13:17:45,318 INFO L272 TraceCheckUtils]: 18: Hoare triple {34#false} call __VERIFIER_assert((if 4 * ~A~0 == ~u~0 * ~u~0 - ~v~0 * ~v~0 - 2 * ~u~0 + 2 * ~v~0 then 1 else 0)); {34#false} is VALID [2022-04-27 13:17:45,318 INFO L290 TraceCheckUtils]: 19: Hoare triple {34#false} ~cond := #in~cond; {34#false} is VALID [2022-04-27 13:17:45,318 INFO L290 TraceCheckUtils]: 20: Hoare triple {34#false} assume 0 == ~cond; {34#false} is VALID [2022-04-27 13:17:45,318 INFO L290 TraceCheckUtils]: 21: Hoare triple {34#false} assume !false; {34#false} is VALID [2022-04-27 13:17:45,319 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 2 proven. 0 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2022-04-27 13:17:45,320 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-04-27 13:17:45,320 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-27 13:17:45,320 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1585657763] [2022-04-27 13:17:45,320 WARN L310 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2022-04-27 13:17:45,320 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1456138652] [2022-04-27 13:17:45,321 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1456138652] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-27 13:17:45,321 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-27 13:17:45,321 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2022-04-27 13:17:45,323 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [322003118] [2022-04-27 13:17:45,324 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-27 13:17:45,327 INFO L78 Accepts]: Start accepts. Automaton has has 2 states, 2 states have (on average 6.5) internal successors, (13), 2 states have internal predecessors, (13), 2 states have call successors, (5), 2 states have call predecessors, (5), 2 states have return successors, (3), 2 states have call predecessors, (3), 2 states have call successors, (3) Word has length 22 [2022-04-27 13:17:45,328 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-27 13:17:45,330 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with has 2 states, 2 states have (on average 6.5) internal successors, (13), 2 states have internal predecessors, (13), 2 states have call successors, (5), 2 states have call predecessors, (5), 2 states have return successors, (3), 2 states have call predecessors, (3), 2 states have call successors, (3) [2022-04-27 13:17:45,368 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 21 edges. 21 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-27 13:17:45,369 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2022-04-27 13:17:45,369 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-04-27 13:17:45,391 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2022-04-27 13:17:45,392 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2022-04-27 13:17:45,393 INFO L87 Difference]: Start difference. First operand has 30 states, 18 states have (on average 1.3888888888888888) internal successors, (25), 19 states have internal predecessors, (25), 6 states have call successors, (6), 4 states have call predecessors, (6), 4 states have return successors, (6), 6 states have call predecessors, (6), 6 states have call successors, (6) Second operand has 2 states, 2 states have (on average 6.5) internal successors, (13), 2 states have internal predecessors, (13), 2 states have call successors, (5), 2 states have call predecessors, (5), 2 states have return successors, (3), 2 states have call predecessors, (3), 2 states have call successors, (3) [2022-04-27 13:17:45,431 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-27 13:17:45,431 INFO L93 Difference]: Finished difference Result 53 states and 70 transitions. [2022-04-27 13:17:45,431 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2022-04-27 13:17:45,431 INFO L78 Accepts]: Start accepts. Automaton has has 2 states, 2 states have (on average 6.5) internal successors, (13), 2 states have internal predecessors, (13), 2 states have call successors, (5), 2 states have call predecessors, (5), 2 states have return successors, (3), 2 states have call predecessors, (3), 2 states have call successors, (3) Word has length 22 [2022-04-27 13:17:45,432 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-27 13:17:45,432 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 2 states, 2 states have (on average 6.5) internal successors, (13), 2 states have internal predecessors, (13), 2 states have call successors, (5), 2 states have call predecessors, (5), 2 states have return successors, (3), 2 states have call predecessors, (3), 2 states have call successors, (3) [2022-04-27 13:17:45,440 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2 states to 2 states and 70 transitions. [2022-04-27 13:17:45,440 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 2 states, 2 states have (on average 6.5) internal successors, (13), 2 states have internal predecessors, (13), 2 states have call successors, (5), 2 states have call predecessors, (5), 2 states have return successors, (3), 2 states have call predecessors, (3), 2 states have call successors, (3) [2022-04-27 13:17:45,444 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2 states to 2 states and 70 transitions. [2022-04-27 13:17:45,444 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 2 states and 70 transitions. [2022-04-27 13:17:45,511 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 70 edges. 70 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-27 13:17:45,519 INFO L225 Difference]: With dead ends: 53 [2022-04-27 13:17:45,519 INFO L226 Difference]: Without dead ends: 25 [2022-04-27 13:17:45,521 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 21 GetRequests, 21 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-04-27 13:17:45,524 INFO L413 NwaCegarLoop]: 34 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, 34 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-04-27 13:17:45,526 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 34 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 0 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-04-27 13:17:45,536 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 25 states. [2022-04-27 13:17:45,547 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 25 to 25. [2022-04-27 13:17:45,547 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-27 13:17:45,548 INFO L82 GeneralOperation]: Start isEquivalent. First operand 25 states. Second operand has 25 states, 15 states have (on average 1.2666666666666666) internal successors, (19), 16 states have internal predecessors, (19), 6 states have call successors, (6), 4 states have call predecessors, (6), 3 states have return successors, (4), 4 states have call predecessors, (4), 4 states have call successors, (4) [2022-04-27 13:17:45,549 INFO L74 IsIncluded]: Start isIncluded. First operand 25 states. Second operand has 25 states, 15 states have (on average 1.2666666666666666) internal successors, (19), 16 states have internal predecessors, (19), 6 states have call successors, (6), 4 states have call predecessors, (6), 3 states have return successors, (4), 4 states have call predecessors, (4), 4 states have call successors, (4) [2022-04-27 13:17:45,549 INFO L87 Difference]: Start difference. First operand 25 states. Second operand has 25 states, 15 states have (on average 1.2666666666666666) internal successors, (19), 16 states have internal predecessors, (19), 6 states have call successors, (6), 4 states have call predecessors, (6), 3 states have return successors, (4), 4 states have call predecessors, (4), 4 states have call successors, (4) [2022-04-27 13:17:45,557 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-27 13:17:45,557 INFO L93 Difference]: Finished difference Result 25 states and 29 transitions. [2022-04-27 13:17:45,558 INFO L276 IsEmpty]: Start isEmpty. Operand 25 states and 29 transitions. [2022-04-27 13:17:45,561 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-27 13:17:45,561 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-27 13:17:45,565 INFO L74 IsIncluded]: Start isIncluded. First operand has 25 states, 15 states have (on average 1.2666666666666666) internal successors, (19), 16 states have internal predecessors, (19), 6 states have call successors, (6), 4 states have call predecessors, (6), 3 states have return successors, (4), 4 states have call predecessors, (4), 4 states have call successors, (4) Second operand 25 states. [2022-04-27 13:17:45,565 INFO L87 Difference]: Start difference. First operand has 25 states, 15 states have (on average 1.2666666666666666) internal successors, (19), 16 states have internal predecessors, (19), 6 states have call successors, (6), 4 states have call predecessors, (6), 3 states have return successors, (4), 4 states have call predecessors, (4), 4 states have call successors, (4) Second operand 25 states. [2022-04-27 13:17:45,567 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-27 13:17:45,567 INFO L93 Difference]: Finished difference Result 25 states and 29 transitions. [2022-04-27 13:17:45,567 INFO L276 IsEmpty]: Start isEmpty. Operand 25 states and 29 transitions. [2022-04-27 13:17:45,568 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-27 13:17:45,568 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-27 13:17:45,568 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-27 13:17:45,568 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-27 13:17:45,568 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 25 states, 15 states have (on average 1.2666666666666666) internal successors, (19), 16 states have internal predecessors, (19), 6 states have call successors, (6), 4 states have call predecessors, (6), 3 states have return successors, (4), 4 states have call predecessors, (4), 4 states have call successors, (4) [2022-04-27 13:17:45,570 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 25 states to 25 states and 29 transitions. [2022-04-27 13:17:45,570 INFO L78 Accepts]: Start accepts. Automaton has 25 states and 29 transitions. Word has length 22 [2022-04-27 13:17:45,571 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-27 13:17:45,571 INFO L495 AbstractCegarLoop]: Abstraction has 25 states and 29 transitions. [2022-04-27 13:17:45,571 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 2 states, 2 states have (on average 6.5) internal successors, (13), 2 states have internal predecessors, (13), 2 states have call successors, (5), 2 states have call predecessors, (5), 2 states have return successors, (3), 2 states have call predecessors, (3), 2 states have call successors, (3) [2022-04-27 13:17:45,571 INFO L276 IsEmpty]: Start isEmpty. Operand 25 states and 29 transitions. [2022-04-27 13:17:45,571 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 24 [2022-04-27 13:17:45,571 INFO L187 NwaCegarLoop]: Found error trace [2022-04-27 13:17:45,572 INFO L195 NwaCegarLoop]: trace histogram [2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-27 13:17:45,588 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Forceful destruction successful, exit code 0 [2022-04-27 13:17:45,788 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 2 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable0 [2022-04-27 13:17:45,789 INFO L420 AbstractCegarLoop]: === Iteration 2 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-27 13:17:45,789 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-27 13:17:45,789 INFO L85 PathProgramCache]: Analyzing trace with hash 243739414, now seen corresponding path program 1 times [2022-04-27 13:17:45,789 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-27 13:17:45,790 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [596023331] [2022-04-27 13:17:45,790 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-27 13:17:45,790 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-27 13:17:45,815 ERROR L245 FreeRefinementEngine]: Caught known exception: Unsupported non-linear arithmetic [2022-04-27 13:17:45,815 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [1092488136] [2022-04-27 13:17:45,815 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-27 13:17:45,815 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-27 13:17:45,815 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-04-27 13:17:45,816 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-04-27 13:17:45,817 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-04-27 13:17:45,852 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-27 13:17:45,853 INFO L263 TraceCheckSpWp]: Trace formula consists of 93 conjuncts, 5 conjunts are in the unsatisfiable core [2022-04-27 13:17:45,859 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-27 13:17:45,860 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-04-27 13:17:45,977 INFO L272 TraceCheckUtils]: 0: Hoare triple {256#true} call ULTIMATE.init(); {256#true} is VALID [2022-04-27 13:17:45,978 INFO L290 TraceCheckUtils]: 1: Hoare triple {256#true} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(13, 2);call #Ultimate.allocInit(12, 3);~counter~0 := 0; {264#(<= ~counter~0 0)} is VALID [2022-04-27 13:17:45,978 INFO L290 TraceCheckUtils]: 2: Hoare triple {264#(<= ~counter~0 0)} assume true; {264#(<= ~counter~0 0)} is VALID [2022-04-27 13:17:45,978 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {264#(<= ~counter~0 0)} {256#true} #67#return; {264#(<= ~counter~0 0)} is VALID [2022-04-27 13:17:45,980 INFO L272 TraceCheckUtils]: 4: Hoare triple {264#(<= ~counter~0 0)} call #t~ret7 := main(); {264#(<= ~counter~0 0)} is VALID [2022-04-27 13:17:45,980 INFO L290 TraceCheckUtils]: 5: Hoare triple {264#(<= ~counter~0 0)} havoc ~A~0;havoc ~R~0;havoc ~u~0;havoc ~v~0;havoc ~r~0;assume -2147483648 <= #t~nondet4 && #t~nondet4 <= 2147483647;~A~0 := #t~nondet4;havoc #t~nondet4;assume -2147483648 <= #t~nondet5 && #t~nondet5 <= 2147483647;~R~0 := #t~nondet5;havoc #t~nondet5; {264#(<= ~counter~0 0)} is VALID [2022-04-27 13:17:45,981 INFO L272 TraceCheckUtils]: 6: Hoare triple {264#(<= ~counter~0 0)} call assume_abort_if_not((if (~R~0 - 1) * (~R~0 - 1) < ~A~0 then 1 else 0)); {264#(<= ~counter~0 0)} is VALID [2022-04-27 13:17:45,981 INFO L290 TraceCheckUtils]: 7: Hoare triple {264#(<= ~counter~0 0)} ~cond := #in~cond; {264#(<= ~counter~0 0)} is VALID [2022-04-27 13:17:45,981 INFO L290 TraceCheckUtils]: 8: Hoare triple {264#(<= ~counter~0 0)} assume !(0 == ~cond); {264#(<= ~counter~0 0)} is VALID [2022-04-27 13:17:45,982 INFO L290 TraceCheckUtils]: 9: Hoare triple {264#(<= ~counter~0 0)} assume true; {264#(<= ~counter~0 0)} is VALID [2022-04-27 13:17:45,982 INFO L284 TraceCheckUtils]: 10: Hoare quadruple {264#(<= ~counter~0 0)} {264#(<= ~counter~0 0)} #59#return; {264#(<= ~counter~0 0)} is VALID [2022-04-27 13:17:45,983 INFO L272 TraceCheckUtils]: 11: Hoare triple {264#(<= ~counter~0 0)} call assume_abort_if_not((if 1 == (if ~A~0 < 0 && 0 != ~A~0 % 2 then ~A~0 % 2 - 2 else ~A~0 % 2) then 1 else 0)); {264#(<= ~counter~0 0)} is VALID [2022-04-27 13:17:45,983 INFO L290 TraceCheckUtils]: 12: Hoare triple {264#(<= ~counter~0 0)} ~cond := #in~cond; {264#(<= ~counter~0 0)} is VALID [2022-04-27 13:17:45,984 INFO L290 TraceCheckUtils]: 13: Hoare triple {264#(<= ~counter~0 0)} assume !(0 == ~cond); {264#(<= ~counter~0 0)} is VALID [2022-04-27 13:17:45,984 INFO L290 TraceCheckUtils]: 14: Hoare triple {264#(<= ~counter~0 0)} assume true; {264#(<= ~counter~0 0)} is VALID [2022-04-27 13:17:45,985 INFO L284 TraceCheckUtils]: 15: Hoare quadruple {264#(<= ~counter~0 0)} {264#(<= ~counter~0 0)} #61#return; {264#(<= ~counter~0 0)} is VALID [2022-04-27 13:17:45,985 INFO L290 TraceCheckUtils]: 16: Hoare triple {264#(<= ~counter~0 0)} ~u~0 := 1 + 2 * ~R~0;~v~0 := 1;~r~0 := ~R~0 * ~R~0 - ~A~0; {264#(<= ~counter~0 0)} is VALID [2022-04-27 13:17:45,986 INFO L290 TraceCheckUtils]: 17: Hoare triple {264#(<= ~counter~0 0)} #t~post6 := ~counter~0;~counter~0 := 1 + #t~post6; {313#(<= |main_#t~post6| 0)} is VALID [2022-04-27 13:17:45,986 INFO L290 TraceCheckUtils]: 18: Hoare triple {313#(<= |main_#t~post6| 0)} assume !(#t~post6 < 1);havoc #t~post6; {257#false} is VALID [2022-04-27 13:17:45,986 INFO L272 TraceCheckUtils]: 19: Hoare triple {257#false} call __VERIFIER_assert((if 4 * ~A~0 == ~u~0 * ~u~0 - ~v~0 * ~v~0 - 2 * ~u~0 + 2 * ~v~0 then 1 else 0)); {257#false} is VALID [2022-04-27 13:17:45,986 INFO L290 TraceCheckUtils]: 20: Hoare triple {257#false} ~cond := #in~cond; {257#false} is VALID [2022-04-27 13:17:45,986 INFO L290 TraceCheckUtils]: 21: Hoare triple {257#false} assume 0 == ~cond; {257#false} is VALID [2022-04-27 13:17:45,987 INFO L290 TraceCheckUtils]: 22: Hoare triple {257#false} assume !false; {257#false} is VALID [2022-04-27 13:17:45,987 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2022-04-27 13:17:45,987 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-04-27 13:17:45,987 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-27 13:17:45,987 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [596023331] [2022-04-27 13:17:45,987 WARN L310 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2022-04-27 13:17:45,987 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1092488136] [2022-04-27 13:17:45,987 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1092488136] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-27 13:17:45,987 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-27 13:17:45,988 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-04-27 13:17:45,988 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2025413505] [2022-04-27 13:17:45,988 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-27 13:17:45,989 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 3.0) internal successors, (12), 3 states have internal predecessors, (12), 3 states have call successors, (5), 3 states have call predecessors, (5), 1 states have return successors, (3), 1 states have call predecessors, (3), 2 states have call successors, (3) Word has length 23 [2022-04-27 13:17:45,989 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-27 13:17:45,989 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with has 4 states, 4 states have (on average 3.0) internal successors, (12), 3 states have internal predecessors, (12), 3 states have call successors, (5), 3 states have call predecessors, (5), 1 states have return successors, (3), 1 states have call predecessors, (3), 2 states have call successors, (3) [2022-04-27 13:17:46,004 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 20 edges. 20 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-27 13:17:46,004 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-04-27 13:17:46,004 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-04-27 13:17:46,005 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-04-27 13:17:46,005 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-04-27 13:17:46,005 INFO L87 Difference]: Start difference. First operand 25 states and 29 transitions. Second operand has 4 states, 4 states have (on average 3.0) internal successors, (12), 3 states have internal predecessors, (12), 3 states have call successors, (5), 3 states have call predecessors, (5), 1 states have return successors, (3), 1 states have call predecessors, (3), 2 states have call successors, (3) [2022-04-27 13:17:46,078 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-27 13:17:46,078 INFO L93 Difference]: Finished difference Result 34 states and 38 transitions. [2022-04-27 13:17:46,078 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-04-27 13:17:46,078 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 3.0) internal successors, (12), 3 states have internal predecessors, (12), 3 states have call successors, (5), 3 states have call predecessors, (5), 1 states have return successors, (3), 1 states have call predecessors, (3), 2 states have call successors, (3) Word has length 23 [2022-04-27 13:17:46,079 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-27 13:17:46,079 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 4 states, 4 states have (on average 3.0) internal successors, (12), 3 states have internal predecessors, (12), 3 states have call successors, (5), 3 states have call predecessors, (5), 1 states have return successors, (3), 1 states have call predecessors, (3), 2 states have call successors, (3) [2022-04-27 13:17:46,083 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 38 transitions. [2022-04-27 13:17:46,083 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 4 states, 4 states have (on average 3.0) internal successors, (12), 3 states have internal predecessors, (12), 3 states have call successors, (5), 3 states have call predecessors, (5), 1 states have return successors, (3), 1 states have call predecessors, (3), 2 states have call successors, (3) [2022-04-27 13:17:46,093 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 38 transitions. [2022-04-27 13:17:46,093 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 4 states and 38 transitions. [2022-04-27 13:17:46,120 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 38 edges. 38 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-27 13:17:46,122 INFO L225 Difference]: With dead ends: 34 [2022-04-27 13:17:46,122 INFO L226 Difference]: Without dead ends: 27 [2022-04-27 13:17:46,123 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 22 GetRequests, 20 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-04-27 13:17:46,125 INFO L413 NwaCegarLoop]: 27 mSDtfsCounter, 0 mSDsluCounter, 40 mSDsCounter, 0 mSdLazyCounter, 7 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 67 SdHoareTripleChecker+Invalid, 7 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 7 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-04-27 13:17:46,125 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 67 Invalid, 7 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 7 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-04-27 13:17:46,126 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 27 states. [2022-04-27 13:17:46,133 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 27 to 27. [2022-04-27 13:17:46,133 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-27 13:17:46,134 INFO L82 GeneralOperation]: Start isEquivalent. First operand 27 states. Second operand has 27 states, 17 states have (on average 1.2352941176470589) internal successors, (21), 18 states have internal predecessors, (21), 6 states have call successors, (6), 4 states have call predecessors, (6), 3 states have return successors, (4), 4 states have call predecessors, (4), 4 states have call successors, (4) [2022-04-27 13:17:46,134 INFO L74 IsIncluded]: Start isIncluded. First operand 27 states. Second operand has 27 states, 17 states have (on average 1.2352941176470589) internal successors, (21), 18 states have internal predecessors, (21), 6 states have call successors, (6), 4 states have call predecessors, (6), 3 states have return successors, (4), 4 states have call predecessors, (4), 4 states have call successors, (4) [2022-04-27 13:17:46,135 INFO L87 Difference]: Start difference. First operand 27 states. Second operand has 27 states, 17 states have (on average 1.2352941176470589) internal successors, (21), 18 states have internal predecessors, (21), 6 states have call successors, (6), 4 states have call predecessors, (6), 3 states have return successors, (4), 4 states have call predecessors, (4), 4 states have call successors, (4) [2022-04-27 13:17:46,138 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-27 13:17:46,138 INFO L93 Difference]: Finished difference Result 27 states and 31 transitions. [2022-04-27 13:17:46,138 INFO L276 IsEmpty]: Start isEmpty. Operand 27 states and 31 transitions. [2022-04-27 13:17:46,139 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-27 13:17:46,139 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-27 13:17:46,140 INFO L74 IsIncluded]: Start isIncluded. First operand has 27 states, 17 states have (on average 1.2352941176470589) internal successors, (21), 18 states have internal predecessors, (21), 6 states have call successors, (6), 4 states have call predecessors, (6), 3 states have return successors, (4), 4 states have call predecessors, (4), 4 states have call successors, (4) Second operand 27 states. [2022-04-27 13:17:46,141 INFO L87 Difference]: Start difference. First operand has 27 states, 17 states have (on average 1.2352941176470589) internal successors, (21), 18 states have internal predecessors, (21), 6 states have call successors, (6), 4 states have call predecessors, (6), 3 states have return successors, (4), 4 states have call predecessors, (4), 4 states have call successors, (4) Second operand 27 states. [2022-04-27 13:17:46,143 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-27 13:17:46,143 INFO L93 Difference]: Finished difference Result 27 states and 31 transitions. [2022-04-27 13:17:46,143 INFO L276 IsEmpty]: Start isEmpty. Operand 27 states and 31 transitions. [2022-04-27 13:17:46,144 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-27 13:17:46,144 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-27 13:17:46,144 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-27 13:17:46,144 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-27 13:17:46,146 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 27 states, 17 states have (on average 1.2352941176470589) internal successors, (21), 18 states have internal predecessors, (21), 6 states have call successors, (6), 4 states have call predecessors, (6), 3 states have return successors, (4), 4 states have call predecessors, (4), 4 states have call successors, (4) [2022-04-27 13:17:46,148 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 27 states to 27 states and 31 transitions. [2022-04-27 13:17:46,148 INFO L78 Accepts]: Start accepts. Automaton has 27 states and 31 transitions. Word has length 23 [2022-04-27 13:17:46,148 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-27 13:17:46,149 INFO L495 AbstractCegarLoop]: Abstraction has 27 states and 31 transitions. [2022-04-27 13:17:46,149 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 3.0) internal successors, (12), 3 states have internal predecessors, (12), 3 states have call successors, (5), 3 states have call predecessors, (5), 1 states have return successors, (3), 1 states have call predecessors, (3), 2 states have call successors, (3) [2022-04-27 13:17:46,149 INFO L276 IsEmpty]: Start isEmpty. Operand 27 states and 31 transitions. [2022-04-27 13:17:46,153 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 24 [2022-04-27 13:17:46,153 INFO L187 NwaCegarLoop]: Found error trace [2022-04-27 13:17:46,154 INFO L195 NwaCegarLoop]: trace histogram [2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-27 13:17:46,173 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-04-27 13:17:46,367 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 3 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable1 [2022-04-27 13:17:46,367 INFO L420 AbstractCegarLoop]: === Iteration 3 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-27 13:17:46,368 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-27 13:17:46,368 INFO L85 PathProgramCache]: Analyzing trace with hash 245526874, now seen corresponding path program 1 times [2022-04-27 13:17:46,368 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-27 13:17:46,368 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1402618825] [2022-04-27 13:17:46,368 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-27 13:17:46,368 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-27 13:17:46,380 ERROR L245 FreeRefinementEngine]: Caught known exception: Unsupported non-linear arithmetic [2022-04-27 13:17:46,380 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [1580022947] [2022-04-27 13:17:46,380 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-27 13:17:46,380 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-27 13:17:46,380 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-04-27 13:17:46,382 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-04-27 13:17:46,383 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-04-27 13:17:46,432 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-27 13:17:46,433 INFO L263 TraceCheckSpWp]: Trace formula consists of 93 conjuncts, 13 conjunts are in the unsatisfiable core [2022-04-27 13:17:46,442 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-27 13:17:46,443 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-04-27 13:17:46,805 INFO L272 TraceCheckUtils]: 0: Hoare triple {469#true} call ULTIMATE.init(); {469#true} is VALID [2022-04-27 13:17:46,806 INFO L290 TraceCheckUtils]: 1: Hoare triple {469#true} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(13, 2);call #Ultimate.allocInit(12, 3);~counter~0 := 0; {469#true} is VALID [2022-04-27 13:17:46,806 INFO L290 TraceCheckUtils]: 2: Hoare triple {469#true} assume true; {469#true} is VALID [2022-04-27 13:17:46,806 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {469#true} {469#true} #67#return; {469#true} is VALID [2022-04-27 13:17:46,806 INFO L272 TraceCheckUtils]: 4: Hoare triple {469#true} call #t~ret7 := main(); {469#true} is VALID [2022-04-27 13:17:46,806 INFO L290 TraceCheckUtils]: 5: Hoare triple {469#true} havoc ~A~0;havoc ~R~0;havoc ~u~0;havoc ~v~0;havoc ~r~0;assume -2147483648 <= #t~nondet4 && #t~nondet4 <= 2147483647;~A~0 := #t~nondet4;havoc #t~nondet4;assume -2147483648 <= #t~nondet5 && #t~nondet5 <= 2147483647;~R~0 := #t~nondet5;havoc #t~nondet5; {469#true} is VALID [2022-04-27 13:17:46,806 INFO L272 TraceCheckUtils]: 6: Hoare triple {469#true} call assume_abort_if_not((if (~R~0 - 1) * (~R~0 - 1) < ~A~0 then 1 else 0)); {469#true} is VALID [2022-04-27 13:17:46,806 INFO L290 TraceCheckUtils]: 7: Hoare triple {469#true} ~cond := #in~cond; {469#true} is VALID [2022-04-27 13:17:46,807 INFO L290 TraceCheckUtils]: 8: Hoare triple {469#true} assume !(0 == ~cond); {469#true} is VALID [2022-04-27 13:17:46,807 INFO L290 TraceCheckUtils]: 9: Hoare triple {469#true} assume true; {469#true} is VALID [2022-04-27 13:17:46,807 INFO L284 TraceCheckUtils]: 10: Hoare quadruple {469#true} {469#true} #59#return; {469#true} is VALID [2022-04-27 13:17:46,807 INFO L272 TraceCheckUtils]: 11: Hoare triple {469#true} call assume_abort_if_not((if 1 == (if ~A~0 < 0 && 0 != ~A~0 % 2 then ~A~0 % 2 - 2 else ~A~0 % 2) then 1 else 0)); {469#true} is VALID [2022-04-27 13:17:46,807 INFO L290 TraceCheckUtils]: 12: Hoare triple {469#true} ~cond := #in~cond; {469#true} is VALID [2022-04-27 13:17:46,807 INFO L290 TraceCheckUtils]: 13: Hoare triple {469#true} assume !(0 == ~cond); {469#true} is VALID [2022-04-27 13:17:46,807 INFO L290 TraceCheckUtils]: 14: Hoare triple {469#true} assume true; {469#true} is VALID [2022-04-27 13:17:46,807 INFO L284 TraceCheckUtils]: 15: Hoare quadruple {469#true} {469#true} #61#return; {469#true} is VALID [2022-04-27 13:17:47,038 INFO L290 TraceCheckUtils]: 16: Hoare triple {469#true} ~u~0 := 1 + 2 * ~R~0;~v~0 := 1;~r~0 := ~R~0 * ~R~0 - ~A~0; {522#(and (= (+ (* (- 1) main_~A~0) (* (div (+ (* (- 1) main_~u~0) 1) (- 2)) (div (+ (* (- 1) main_~u~0) 1) (- 2)))) main_~r~0) (= (mod (+ main_~u~0 1) 2) 0) (= main_~v~0 1))} is VALID [2022-04-27 13:17:47,039 INFO L290 TraceCheckUtils]: 17: Hoare triple {522#(and (= (+ (* (- 1) main_~A~0) (* (div (+ (* (- 1) main_~u~0) 1) (- 2)) (div (+ (* (- 1) main_~u~0) 1) (- 2)))) main_~r~0) (= (mod (+ main_~u~0 1) 2) 0) (= main_~v~0 1))} #t~post6 := ~counter~0;~counter~0 := 1 + #t~post6; {522#(and (= (+ (* (- 1) main_~A~0) (* (div (+ (* (- 1) main_~u~0) 1) (- 2)) (div (+ (* (- 1) main_~u~0) 1) (- 2)))) main_~r~0) (= (mod (+ main_~u~0 1) 2) 0) (= main_~v~0 1))} is VALID [2022-04-27 13:17:47,040 INFO L290 TraceCheckUtils]: 18: Hoare triple {522#(and (= (+ (* (- 1) main_~A~0) (* (div (+ (* (- 1) main_~u~0) 1) (- 2)) (div (+ (* (- 1) main_~u~0) 1) (- 2)))) main_~r~0) (= (mod (+ main_~u~0 1) 2) 0) (= main_~v~0 1))} assume !!(#t~post6 < 1);havoc #t~post6; {522#(and (= (+ (* (- 1) main_~A~0) (* (div (+ (* (- 1) main_~u~0) 1) (- 2)) (div (+ (* (- 1) main_~u~0) 1) (- 2)))) main_~r~0) (= (mod (+ main_~u~0 1) 2) 0) (= main_~v~0 1))} is VALID [2022-04-27 13:17:48,915 INFO L272 TraceCheckUtils]: 19: Hoare triple {522#(and (= (+ (* (- 1) main_~A~0) (* (div (+ (* (- 1) main_~u~0) 1) (- 2)) (div (+ (* (- 1) main_~u~0) 1) (- 2)))) main_~r~0) (= (mod (+ main_~u~0 1) 2) 0) (= main_~v~0 1))} call __VERIFIER_assert((if 4 * (~A~0 + ~r~0) == ~u~0 * ~u~0 - ~v~0 * ~v~0 - 2 * ~u~0 + 2 * ~v~0 then 1 else 0)); {532#(<= 1 |__VERIFIER_assert_#in~cond|)} is VALID [2022-04-27 13:17:48,916 INFO L290 TraceCheckUtils]: 20: Hoare triple {532#(<= 1 |__VERIFIER_assert_#in~cond|)} ~cond := #in~cond; {536#(<= 1 __VERIFIER_assert_~cond)} is VALID [2022-04-27 13:17:48,916 INFO L290 TraceCheckUtils]: 21: Hoare triple {536#(<= 1 __VERIFIER_assert_~cond)} assume 0 == ~cond; {470#false} is VALID [2022-04-27 13:17:48,917 INFO L290 TraceCheckUtils]: 22: Hoare triple {470#false} assume !false; {470#false} is VALID [2022-04-27 13:17:48,917 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2022-04-27 13:17:48,917 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-04-27 13:17:48,917 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-27 13:17:48,917 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1402618825] [2022-04-27 13:17:48,917 WARN L310 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2022-04-27 13:17:48,917 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1580022947] [2022-04-27 13:17:48,917 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1580022947] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-27 13:17:48,917 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-27 13:17:48,917 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2022-04-27 13:17:48,918 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [317217227] [2022-04-27 13:17:48,918 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-27 13:17:48,918 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 2.4) internal successors, (12), 4 states have internal predecessors, (12), 2 states have call successors, (5), 2 states have call predecessors, (5), 1 states have return successors, (3), 1 states have call predecessors, (3), 1 states have call successors, (3) Word has length 23 [2022-04-27 13:17:48,918 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-27 13:17:48,918 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with has 5 states, 5 states have (on average 2.4) internal successors, (12), 4 states have internal predecessors, (12), 2 states have call successors, (5), 2 states have call predecessors, (5), 1 states have return successors, (3), 1 states have call predecessors, (3), 1 states have call successors, (3) [2022-04-27 13:17:52,537 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 20 edges. 19 inductive. 0 not inductive. 1 times theorem prover too weak to decide inductivity. [2022-04-27 13:17:52,537 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-04-27 13:17:52,537 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-04-27 13:17:52,538 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-04-27 13:17:52,538 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2022-04-27 13:17:52,538 INFO L87 Difference]: Start difference. First operand 27 states and 31 transitions. Second operand has 5 states, 5 states have (on average 2.4) internal successors, (12), 4 states have internal predecessors, (12), 2 states have call successors, (5), 2 states have call predecessors, (5), 1 states have return successors, (3), 1 states have call predecessors, (3), 1 states have call successors, (3) [2022-04-27 13:17:54,800 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-04-27 13:17:56,993 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-04-27 13:17:57,018 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-27 13:17:57,019 INFO L93 Difference]: Finished difference Result 37 states and 43 transitions. [2022-04-27 13:17:57,019 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-04-27 13:17:57,019 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 2.4) internal successors, (12), 4 states have internal predecessors, (12), 2 states have call successors, (5), 2 states have call predecessors, (5), 1 states have return successors, (3), 1 states have call predecessors, (3), 1 states have call successors, (3) Word has length 23 [2022-04-27 13:17:57,019 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-27 13:17:57,019 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 5 states, 5 states have (on average 2.4) internal successors, (12), 4 states have internal predecessors, (12), 2 states have call successors, (5), 2 states have call predecessors, (5), 1 states have return successors, (3), 1 states have call predecessors, (3), 1 states have call successors, (3) [2022-04-27 13:17:57,020 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 43 transitions. [2022-04-27 13:17:57,020 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 5 states, 5 states have (on average 2.4) internal successors, (12), 4 states have internal predecessors, (12), 2 states have call successors, (5), 2 states have call predecessors, (5), 1 states have return successors, (3), 1 states have call predecessors, (3), 1 states have call successors, (3) [2022-04-27 13:17:57,021 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 43 transitions. [2022-04-27 13:17:57,022 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 5 states and 43 transitions. [2022-04-27 13:17:59,557 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 43 edges. 42 inductive. 0 not inductive. 1 times theorem prover too weak to decide inductivity. [2022-04-27 13:17:59,558 INFO L225 Difference]: With dead ends: 37 [2022-04-27 13:17:59,558 INFO L226 Difference]: Without dead ends: 35 [2022-04-27 13:17:59,558 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 23 GetRequests, 19 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-04-27 13:17:59,559 INFO L413 NwaCegarLoop]: 23 mSDtfsCounter, 7 mSDsluCounter, 59 mSDsCounter, 0 mSdLazyCounter, 36 mSolverCounterSat, 0 mSolverCounterUnsat, 2 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 4.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 8 SdHoareTripleChecker+Valid, 82 SdHoareTripleChecker+Invalid, 38 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 36 IncrementalHoareTripleChecker+Invalid, 2 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 4.3s IncrementalHoareTripleChecker+Time [2022-04-27 13:17:59,559 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [8 Valid, 82 Invalid, 38 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 36 Invalid, 2 Unknown, 0 Unchecked, 4.3s Time] [2022-04-27 13:17:59,560 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 35 states. [2022-04-27 13:17:59,569 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 35 to 32. [2022-04-27 13:17:59,569 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-27 13:17:59,570 INFO L82 GeneralOperation]: Start isEquivalent. First operand 35 states. Second operand has 32 states, 20 states have (on average 1.2) internal successors, (24), 22 states have internal predecessors, (24), 7 states have call successors, (7), 5 states have call predecessors, (7), 4 states have return successors, (5), 4 states have call predecessors, (5), 5 states have call successors, (5) [2022-04-27 13:17:59,570 INFO L74 IsIncluded]: Start isIncluded. First operand 35 states. Second operand has 32 states, 20 states have (on average 1.2) internal successors, (24), 22 states have internal predecessors, (24), 7 states have call successors, (7), 5 states have call predecessors, (7), 4 states have return successors, (5), 4 states have call predecessors, (5), 5 states have call successors, (5) [2022-04-27 13:17:59,570 INFO L87 Difference]: Start difference. First operand 35 states. Second operand has 32 states, 20 states have (on average 1.2) internal successors, (24), 22 states have internal predecessors, (24), 7 states have call successors, (7), 5 states have call predecessors, (7), 4 states have return successors, (5), 4 states have call predecessors, (5), 5 states have call successors, (5) [2022-04-27 13:17:59,572 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-27 13:17:59,572 INFO L93 Difference]: Finished difference Result 35 states and 41 transitions. [2022-04-27 13:17:59,572 INFO L276 IsEmpty]: Start isEmpty. Operand 35 states and 41 transitions. [2022-04-27 13:17:59,572 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-27 13:17:59,572 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-27 13:17:59,572 INFO L74 IsIncluded]: Start isIncluded. First operand has 32 states, 20 states have (on average 1.2) internal successors, (24), 22 states have internal predecessors, (24), 7 states have call successors, (7), 5 states have call predecessors, (7), 4 states have return successors, (5), 4 states have call predecessors, (5), 5 states have call successors, (5) Second operand 35 states. [2022-04-27 13:17:59,573 INFO L87 Difference]: Start difference. First operand has 32 states, 20 states have (on average 1.2) internal successors, (24), 22 states have internal predecessors, (24), 7 states have call successors, (7), 5 states have call predecessors, (7), 4 states have return successors, (5), 4 states have call predecessors, (5), 5 states have call successors, (5) Second operand 35 states. [2022-04-27 13:17:59,574 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-27 13:17:59,574 INFO L93 Difference]: Finished difference Result 35 states and 41 transitions. [2022-04-27 13:17:59,574 INFO L276 IsEmpty]: Start isEmpty. Operand 35 states and 41 transitions. [2022-04-27 13:17:59,574 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-27 13:17:59,574 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-27 13:17:59,575 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-27 13:17:59,575 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-27 13:17:59,575 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 32 states, 20 states have (on average 1.2) internal successors, (24), 22 states have internal predecessors, (24), 7 states have call successors, (7), 5 states have call predecessors, (7), 4 states have return successors, (5), 4 states have call predecessors, (5), 5 states have call successors, (5) [2022-04-27 13:17:59,576 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 32 states to 32 states and 36 transitions. [2022-04-27 13:17:59,576 INFO L78 Accepts]: Start accepts. Automaton has 32 states and 36 transitions. Word has length 23 [2022-04-27 13:17:59,576 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-27 13:17:59,576 INFO L495 AbstractCegarLoop]: Abstraction has 32 states and 36 transitions. [2022-04-27 13:17:59,576 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 2.4) internal successors, (12), 4 states have internal predecessors, (12), 2 states have call successors, (5), 2 states have call predecessors, (5), 1 states have return successors, (3), 1 states have call predecessors, (3), 1 states have call successors, (3) [2022-04-27 13:17:59,576 INFO L276 IsEmpty]: Start isEmpty. Operand 32 states and 36 transitions. [2022-04-27 13:17:59,577 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 30 [2022-04-27 13:17:59,577 INFO L187 NwaCegarLoop]: Found error trace [2022-04-27 13:17:59,577 INFO L195 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-27 13:17:59,593 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-04-27 13:17:59,777 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2,4 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-27 13:17:59,777 INFO L420 AbstractCegarLoop]: === Iteration 4 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-27 13:17:59,778 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-27 13:17:59,778 INFO L85 PathProgramCache]: Analyzing trace with hash -1019533657, now seen corresponding path program 1 times [2022-04-27 13:17:59,778 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-27 13:17:59,778 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [263345274] [2022-04-27 13:17:59,778 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-27 13:17:59,778 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-27 13:17:59,789 ERROR L245 FreeRefinementEngine]: Caught known exception: Unsupported non-linear arithmetic [2022-04-27 13:17:59,790 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [295320331] [2022-04-27 13:17:59,790 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-27 13:17:59,790 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-27 13:17:59,790 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-04-27 13:17:59,791 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-04-27 13:17:59,799 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-04-27 13:17:59,832 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-27 13:17:59,832 INFO L263 TraceCheckSpWp]: Trace formula consists of 104 conjuncts, 10 conjunts are in the unsatisfiable core [2022-04-27 13:17:59,840 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-27 13:17:59,840 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-04-27 13:18:00,001 INFO L272 TraceCheckUtils]: 0: Hoare triple {712#true} call ULTIMATE.init(); {712#true} is VALID [2022-04-27 13:18:00,002 INFO L290 TraceCheckUtils]: 1: Hoare triple {712#true} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(13, 2);call #Ultimate.allocInit(12, 3);~counter~0 := 0; {712#true} is VALID [2022-04-27 13:18:00,002 INFO L290 TraceCheckUtils]: 2: Hoare triple {712#true} assume true; {712#true} is VALID [2022-04-27 13:18:00,002 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {712#true} {712#true} #67#return; {712#true} is VALID [2022-04-27 13:18:00,002 INFO L272 TraceCheckUtils]: 4: Hoare triple {712#true} call #t~ret7 := main(); {712#true} is VALID [2022-04-27 13:18:00,002 INFO L290 TraceCheckUtils]: 5: Hoare triple {712#true} havoc ~A~0;havoc ~R~0;havoc ~u~0;havoc ~v~0;havoc ~r~0;assume -2147483648 <= #t~nondet4 && #t~nondet4 <= 2147483647;~A~0 := #t~nondet4;havoc #t~nondet4;assume -2147483648 <= #t~nondet5 && #t~nondet5 <= 2147483647;~R~0 := #t~nondet5;havoc #t~nondet5; {712#true} is VALID [2022-04-27 13:18:00,002 INFO L272 TraceCheckUtils]: 6: Hoare triple {712#true} call assume_abort_if_not((if (~R~0 - 1) * (~R~0 - 1) < ~A~0 then 1 else 0)); {712#true} is VALID [2022-04-27 13:18:00,002 INFO L290 TraceCheckUtils]: 7: Hoare triple {712#true} ~cond := #in~cond; {712#true} is VALID [2022-04-27 13:18:00,003 INFO L290 TraceCheckUtils]: 8: Hoare triple {712#true} assume !(0 == ~cond); {712#true} is VALID [2022-04-27 13:18:00,003 INFO L290 TraceCheckUtils]: 9: Hoare triple {712#true} assume true; {712#true} is VALID [2022-04-27 13:18:00,003 INFO L284 TraceCheckUtils]: 10: Hoare quadruple {712#true} {712#true} #59#return; {712#true} is VALID [2022-04-27 13:18:00,003 INFO L272 TraceCheckUtils]: 11: Hoare triple {712#true} call assume_abort_if_not((if 1 == (if ~A~0 < 0 && 0 != ~A~0 % 2 then ~A~0 % 2 - 2 else ~A~0 % 2) then 1 else 0)); {712#true} is VALID [2022-04-27 13:18:00,003 INFO L290 TraceCheckUtils]: 12: Hoare triple {712#true} ~cond := #in~cond; {712#true} is VALID [2022-04-27 13:18:00,003 INFO L290 TraceCheckUtils]: 13: Hoare triple {712#true} assume !(0 == ~cond); {712#true} is VALID [2022-04-27 13:18:00,003 INFO L290 TraceCheckUtils]: 14: Hoare triple {712#true} assume true; {712#true} is VALID [2022-04-27 13:18:00,003 INFO L284 TraceCheckUtils]: 15: Hoare quadruple {712#true} {712#true} #61#return; {712#true} is VALID [2022-04-27 13:18:00,003 INFO L290 TraceCheckUtils]: 16: Hoare triple {712#true} ~u~0 := 1 + 2 * ~R~0;~v~0 := 1;~r~0 := ~R~0 * ~R~0 - ~A~0; {712#true} is VALID [2022-04-27 13:18:00,003 INFO L290 TraceCheckUtils]: 17: Hoare triple {712#true} #t~post6 := ~counter~0;~counter~0 := 1 + #t~post6; {712#true} is VALID [2022-04-27 13:18:00,004 INFO L290 TraceCheckUtils]: 18: Hoare triple {712#true} assume !!(#t~post6 < 1);havoc #t~post6; {712#true} is VALID [2022-04-27 13:18:00,004 INFO L272 TraceCheckUtils]: 19: Hoare triple {712#true} call __VERIFIER_assert((if 4 * (~A~0 + ~r~0) == ~u~0 * ~u~0 - ~v~0 * ~v~0 - 2 * ~u~0 + 2 * ~v~0 then 1 else 0)); {712#true} is VALID [2022-04-27 13:18:00,004 INFO L290 TraceCheckUtils]: 20: Hoare triple {712#true} ~cond := #in~cond; {777#(= |__VERIFIER_assert_#in~cond| __VERIFIER_assert_~cond)} is VALID [2022-04-27 13:18:00,004 INFO L290 TraceCheckUtils]: 21: Hoare triple {777#(= |__VERIFIER_assert_#in~cond| __VERIFIER_assert_~cond)} assume !(0 == ~cond); {781#(not (= |__VERIFIER_assert_#in~cond| 0))} is VALID [2022-04-27 13:18:00,005 INFO L290 TraceCheckUtils]: 22: Hoare triple {781#(not (= |__VERIFIER_assert_#in~cond| 0))} assume true; {781#(not (= |__VERIFIER_assert_#in~cond| 0))} is VALID [2022-04-27 13:18:00,006 INFO L284 TraceCheckUtils]: 23: Hoare quadruple {781#(not (= |__VERIFIER_assert_#in~cond| 0))} {712#true} #63#return; {788#(= (+ (* main_~v~0 2) (* main_~u~0 main_~u~0)) (+ (* main_~v~0 main_~v~0) (* main_~u~0 2) (* main_~A~0 4) (* main_~r~0 4)))} is VALID [2022-04-27 13:18:00,006 INFO L290 TraceCheckUtils]: 24: Hoare triple {788#(= (+ (* main_~v~0 2) (* main_~u~0 main_~u~0)) (+ (* main_~v~0 main_~v~0) (* main_~u~0 2) (* main_~A~0 4) (* main_~r~0 4)))} assume !(0 != ~r~0); {792#(= (+ (* main_~v~0 2) (* main_~u~0 main_~u~0)) (+ (* main_~v~0 main_~v~0) (* main_~u~0 2) (* main_~A~0 4)))} is VALID [2022-04-27 13:18:00,007 INFO L272 TraceCheckUtils]: 25: Hoare triple {792#(= (+ (* main_~v~0 2) (* main_~u~0 main_~u~0)) (+ (* main_~v~0 main_~v~0) (* main_~u~0 2) (* main_~A~0 4)))} call __VERIFIER_assert((if 4 * ~A~0 == ~u~0 * ~u~0 - ~v~0 * ~v~0 - 2 * ~u~0 + 2 * ~v~0 then 1 else 0)); {796#(<= 1 |__VERIFIER_assert_#in~cond|)} is VALID [2022-04-27 13:18:00,007 INFO L290 TraceCheckUtils]: 26: Hoare triple {796#(<= 1 |__VERIFIER_assert_#in~cond|)} ~cond := #in~cond; {800#(<= 1 __VERIFIER_assert_~cond)} is VALID [2022-04-27 13:18:00,008 INFO L290 TraceCheckUtils]: 27: Hoare triple {800#(<= 1 __VERIFIER_assert_~cond)} assume 0 == ~cond; {713#false} is VALID [2022-04-27 13:18:00,008 INFO L290 TraceCheckUtils]: 28: Hoare triple {713#false} assume !false; {713#false} is VALID [2022-04-27 13:18:00,008 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 1 proven. 1 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2022-04-27 13:18:00,008 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-04-27 13:18:00,341 INFO L290 TraceCheckUtils]: 28: Hoare triple {713#false} assume !false; {713#false} is VALID [2022-04-27 13:18:00,341 INFO L290 TraceCheckUtils]: 27: Hoare triple {800#(<= 1 __VERIFIER_assert_~cond)} assume 0 == ~cond; {713#false} is VALID [2022-04-27 13:18:00,342 INFO L290 TraceCheckUtils]: 26: Hoare triple {796#(<= 1 |__VERIFIER_assert_#in~cond|)} ~cond := #in~cond; {800#(<= 1 __VERIFIER_assert_~cond)} is VALID [2022-04-27 13:18:00,342 INFO L272 TraceCheckUtils]: 25: Hoare triple {792#(= (+ (* main_~v~0 2) (* main_~u~0 main_~u~0)) (+ (* main_~v~0 main_~v~0) (* main_~u~0 2) (* main_~A~0 4)))} call __VERIFIER_assert((if 4 * ~A~0 == ~u~0 * ~u~0 - ~v~0 * ~v~0 - 2 * ~u~0 + 2 * ~v~0 then 1 else 0)); {796#(<= 1 |__VERIFIER_assert_#in~cond|)} is VALID [2022-04-27 13:18:00,343 INFO L290 TraceCheckUtils]: 24: Hoare triple {819#(or (not (= main_~r~0 0)) (= (+ (* main_~v~0 2) (* main_~u~0 main_~u~0)) (+ (* main_~v~0 main_~v~0) (* main_~u~0 2) (* main_~A~0 4))))} assume !(0 != ~r~0); {792#(= (+ (* main_~v~0 2) (* main_~u~0 main_~u~0)) (+ (* main_~v~0 main_~v~0) (* main_~u~0 2) (* main_~A~0 4)))} is VALID [2022-04-27 13:18:00,344 INFO L284 TraceCheckUtils]: 23: Hoare quadruple {781#(not (= |__VERIFIER_assert_#in~cond| 0))} {712#true} #63#return; {819#(or (not (= main_~r~0 0)) (= (+ (* main_~v~0 2) (* main_~u~0 main_~u~0)) (+ (* main_~v~0 main_~v~0) (* main_~u~0 2) (* main_~A~0 4))))} is VALID [2022-04-27 13:18:00,346 INFO L290 TraceCheckUtils]: 22: Hoare triple {781#(not (= |__VERIFIER_assert_#in~cond| 0))} assume true; {781#(not (= |__VERIFIER_assert_#in~cond| 0))} is VALID [2022-04-27 13:18:00,347 INFO L290 TraceCheckUtils]: 21: Hoare triple {832#(or (not (= |__VERIFIER_assert_#in~cond| 0)) (= __VERIFIER_assert_~cond 0))} assume !(0 == ~cond); {781#(not (= |__VERIFIER_assert_#in~cond| 0))} is VALID [2022-04-27 13:18:00,347 INFO L290 TraceCheckUtils]: 20: Hoare triple {712#true} ~cond := #in~cond; {832#(or (not (= |__VERIFIER_assert_#in~cond| 0)) (= __VERIFIER_assert_~cond 0))} is VALID [2022-04-27 13:18:00,347 INFO L272 TraceCheckUtils]: 19: Hoare triple {712#true} call __VERIFIER_assert((if 4 * (~A~0 + ~r~0) == ~u~0 * ~u~0 - ~v~0 * ~v~0 - 2 * ~u~0 + 2 * ~v~0 then 1 else 0)); {712#true} is VALID [2022-04-27 13:18:00,347 INFO L290 TraceCheckUtils]: 18: Hoare triple {712#true} assume !!(#t~post6 < 1);havoc #t~post6; {712#true} is VALID [2022-04-27 13:18:00,348 INFO L290 TraceCheckUtils]: 17: Hoare triple {712#true} #t~post6 := ~counter~0;~counter~0 := 1 + #t~post6; {712#true} is VALID [2022-04-27 13:18:00,348 INFO L290 TraceCheckUtils]: 16: Hoare triple {712#true} ~u~0 := 1 + 2 * ~R~0;~v~0 := 1;~r~0 := ~R~0 * ~R~0 - ~A~0; {712#true} is VALID [2022-04-27 13:18:00,348 INFO L284 TraceCheckUtils]: 15: Hoare quadruple {712#true} {712#true} #61#return; {712#true} is VALID [2022-04-27 13:18:00,348 INFO L290 TraceCheckUtils]: 14: Hoare triple {712#true} assume true; {712#true} is VALID [2022-04-27 13:18:00,348 INFO L290 TraceCheckUtils]: 13: Hoare triple {712#true} assume !(0 == ~cond); {712#true} is VALID [2022-04-27 13:18:00,348 INFO L290 TraceCheckUtils]: 12: Hoare triple {712#true} ~cond := #in~cond; {712#true} is VALID [2022-04-27 13:18:00,348 INFO L272 TraceCheckUtils]: 11: Hoare triple {712#true} call assume_abort_if_not((if 1 == (if ~A~0 < 0 && 0 != ~A~0 % 2 then ~A~0 % 2 - 2 else ~A~0 % 2) then 1 else 0)); {712#true} is VALID [2022-04-27 13:18:00,348 INFO L284 TraceCheckUtils]: 10: Hoare quadruple {712#true} {712#true} #59#return; {712#true} is VALID [2022-04-27 13:18:00,348 INFO L290 TraceCheckUtils]: 9: Hoare triple {712#true} assume true; {712#true} is VALID [2022-04-27 13:18:00,348 INFO L290 TraceCheckUtils]: 8: Hoare triple {712#true} assume !(0 == ~cond); {712#true} is VALID [2022-04-27 13:18:00,349 INFO L290 TraceCheckUtils]: 7: Hoare triple {712#true} ~cond := #in~cond; {712#true} is VALID [2022-04-27 13:18:00,349 INFO L272 TraceCheckUtils]: 6: Hoare triple {712#true} call assume_abort_if_not((if (~R~0 - 1) * (~R~0 - 1) < ~A~0 then 1 else 0)); {712#true} is VALID [2022-04-27 13:18:00,349 INFO L290 TraceCheckUtils]: 5: Hoare triple {712#true} havoc ~A~0;havoc ~R~0;havoc ~u~0;havoc ~v~0;havoc ~r~0;assume -2147483648 <= #t~nondet4 && #t~nondet4 <= 2147483647;~A~0 := #t~nondet4;havoc #t~nondet4;assume -2147483648 <= #t~nondet5 && #t~nondet5 <= 2147483647;~R~0 := #t~nondet5;havoc #t~nondet5; {712#true} is VALID [2022-04-27 13:18:00,349 INFO L272 TraceCheckUtils]: 4: Hoare triple {712#true} call #t~ret7 := main(); {712#true} is VALID [2022-04-27 13:18:00,349 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {712#true} {712#true} #67#return; {712#true} is VALID [2022-04-27 13:18:00,349 INFO L290 TraceCheckUtils]: 2: Hoare triple {712#true} assume true; {712#true} is VALID [2022-04-27 13:18:00,349 INFO L290 TraceCheckUtils]: 1: Hoare triple {712#true} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(13, 2);call #Ultimate.allocInit(12, 3);~counter~0 := 0; {712#true} is VALID [2022-04-27 13:18:00,349 INFO L272 TraceCheckUtils]: 0: Hoare triple {712#true} call ULTIMATE.init(); {712#true} is VALID [2022-04-27 13:18:00,350 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 1 proven. 1 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2022-04-27 13:18:00,350 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-27 13:18:00,350 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [263345274] [2022-04-27 13:18:00,350 WARN L310 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2022-04-27 13:18:00,350 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [295320331] [2022-04-27 13:18:00,350 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [295320331] provided 0 perfect and 2 imperfect interpolant sequences [2022-04-27 13:18:00,350 INFO L184 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2022-04-27 13:18:00,350 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [8, 8] total 10 [2022-04-27 13:18:00,350 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1569820182] [2022-04-27 13:18:00,350 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2022-04-27 13:18:00,351 INFO L78 Accepts]: Start accepts. Automaton has has 10 states, 9 states have (on average 2.111111111111111) internal successors, (19), 7 states have internal predecessors, (19), 2 states have call successors, (6), 2 states have call predecessors, (6), 2 states have return successors, (5), 3 states have call predecessors, (5), 1 states have call successors, (5) Word has length 29 [2022-04-27 13:18:00,351 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-27 13:18:00,351 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with has 10 states, 9 states have (on average 2.111111111111111) internal successors, (19), 7 states have internal predecessors, (19), 2 states have call successors, (6), 2 states have call predecessors, (6), 2 states have return successors, (5), 3 states have call predecessors, (5), 1 states have call successors, (5) [2022-04-27 13:18:00,368 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 30 edges. 30 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-27 13:18:00,369 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2022-04-27 13:18:00,369 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-04-27 13:18:00,369 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2022-04-27 13:18:00,369 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=23, Invalid=67, Unknown=0, NotChecked=0, Total=90 [2022-04-27 13:18:00,369 INFO L87 Difference]: Start difference. First operand 32 states and 36 transitions. Second operand has 10 states, 9 states have (on average 2.111111111111111) internal successors, (19), 7 states have internal predecessors, (19), 2 states have call successors, (6), 2 states have call predecessors, (6), 2 states have return successors, (5), 3 states have call predecessors, (5), 1 states have call successors, (5) [2022-04-27 13:18:00,686 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-27 13:18:00,686 INFO L93 Difference]: Finished difference Result 39 states and 42 transitions. [2022-04-27 13:18:00,686 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2022-04-27 13:18:00,687 INFO L78 Accepts]: Start accepts. Automaton has has 10 states, 9 states have (on average 2.111111111111111) internal successors, (19), 7 states have internal predecessors, (19), 2 states have call successors, (6), 2 states have call predecessors, (6), 2 states have return successors, (5), 3 states have call predecessors, (5), 1 states have call successors, (5) Word has length 29 [2022-04-27 13:18:00,687 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-27 13:18:00,687 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 10 states, 9 states have (on average 2.111111111111111) internal successors, (19), 7 states have internal predecessors, (19), 2 states have call successors, (6), 2 states have call predecessors, (6), 2 states have return successors, (5), 3 states have call predecessors, (5), 1 states have call successors, (5) [2022-04-27 13:18:00,688 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8 states to 8 states and 35 transitions. [2022-04-27 13:18:00,688 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 10 states, 9 states have (on average 2.111111111111111) internal successors, (19), 7 states have internal predecessors, (19), 2 states have call successors, (6), 2 states have call predecessors, (6), 2 states have return successors, (5), 3 states have call predecessors, (5), 1 states have call successors, (5) [2022-04-27 13:18:00,689 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8 states to 8 states and 35 transitions. [2022-04-27 13:18:00,689 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 8 states and 35 transitions. [2022-04-27 13:18:00,738 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 35 edges. 35 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-27 13:18:00,739 INFO L225 Difference]: With dead ends: 39 [2022-04-27 13:18:00,739 INFO L226 Difference]: Without dead ends: 34 [2022-04-27 13:18:00,739 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 60 GetRequests, 48 SyntacticMatches, 1 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 10 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=41, Invalid=115, Unknown=0, NotChecked=0, Total=156 [2022-04-27 13:18:00,740 INFO L413 NwaCegarLoop]: 21 mSDtfsCounter, 23 mSDsluCounter, 94 mSDsCounter, 0 mSdLazyCounter, 64 mSolverCounterSat, 6 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 23 SdHoareTripleChecker+Valid, 115 SdHoareTripleChecker+Invalid, 70 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 6 IncrementalHoareTripleChecker+Valid, 64 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-04-27 13:18:00,740 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [23 Valid, 115 Invalid, 70 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [6 Valid, 64 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-04-27 13:18:00,741 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 34 states. [2022-04-27 13:18:00,746 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 34 to 29. [2022-04-27 13:18:00,747 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-27 13:18:00,747 INFO L82 GeneralOperation]: Start isEquivalent. First operand 34 states. Second operand has 29 states, 19 states have (on average 1.105263157894737) internal successors, (21), 19 states have internal predecessors, (21), 6 states have call successors, (6), 5 states have call predecessors, (6), 3 states have return successors, (4), 4 states have call predecessors, (4), 4 states have call successors, (4) [2022-04-27 13:18:00,747 INFO L74 IsIncluded]: Start isIncluded. First operand 34 states. Second operand has 29 states, 19 states have (on average 1.105263157894737) internal successors, (21), 19 states have internal predecessors, (21), 6 states have call successors, (6), 5 states have call predecessors, (6), 3 states have return successors, (4), 4 states have call predecessors, (4), 4 states have call successors, (4) [2022-04-27 13:18:00,747 INFO L87 Difference]: Start difference. First operand 34 states. Second operand has 29 states, 19 states have (on average 1.105263157894737) internal successors, (21), 19 states have internal predecessors, (21), 6 states have call successors, (6), 5 states have call predecessors, (6), 3 states have return successors, (4), 4 states have call predecessors, (4), 4 states have call successors, (4) [2022-04-27 13:18:00,748 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-27 13:18:00,748 INFO L93 Difference]: Finished difference Result 34 states and 36 transitions. [2022-04-27 13:18:00,748 INFO L276 IsEmpty]: Start isEmpty. Operand 34 states and 36 transitions. [2022-04-27 13:18:00,749 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-27 13:18:00,749 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-27 13:18:00,749 INFO L74 IsIncluded]: Start isIncluded. First operand has 29 states, 19 states have (on average 1.105263157894737) internal successors, (21), 19 states have internal predecessors, (21), 6 states have call successors, (6), 5 states have call predecessors, (6), 3 states have return successors, (4), 4 states have call predecessors, (4), 4 states have call successors, (4) Second operand 34 states. [2022-04-27 13:18:00,749 INFO L87 Difference]: Start difference. First operand has 29 states, 19 states have (on average 1.105263157894737) internal successors, (21), 19 states have internal predecessors, (21), 6 states have call successors, (6), 5 states have call predecessors, (6), 3 states have return successors, (4), 4 states have call predecessors, (4), 4 states have call successors, (4) Second operand 34 states. [2022-04-27 13:18:00,750 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-27 13:18:00,750 INFO L93 Difference]: Finished difference Result 34 states and 36 transitions. [2022-04-27 13:18:00,750 INFO L276 IsEmpty]: Start isEmpty. Operand 34 states and 36 transitions. [2022-04-27 13:18:00,750 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-27 13:18:00,750 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-27 13:18:00,750 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-27 13:18:00,751 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-27 13:18:00,751 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 29 states, 19 states have (on average 1.105263157894737) internal successors, (21), 19 states have internal predecessors, (21), 6 states have call successors, (6), 5 states have call predecessors, (6), 3 states have return successors, (4), 4 states have call predecessors, (4), 4 states have call successors, (4) [2022-04-27 13:18:00,751 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 29 states to 29 states and 31 transitions. [2022-04-27 13:18:00,752 INFO L78 Accepts]: Start accepts. Automaton has 29 states and 31 transitions. Word has length 29 [2022-04-27 13:18:00,752 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-27 13:18:00,752 INFO L495 AbstractCegarLoop]: Abstraction has 29 states and 31 transitions. [2022-04-27 13:18:00,752 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 9 states have (on average 2.111111111111111) internal successors, (19), 7 states have internal predecessors, (19), 2 states have call successors, (6), 2 states have call predecessors, (6), 2 states have return successors, (5), 3 states have call predecessors, (5), 1 states have call successors, (5) [2022-04-27 13:18:00,752 INFO L276 IsEmpty]: Start isEmpty. Operand 29 states and 31 transitions. [2022-04-27 13:18:00,752 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 33 [2022-04-27 13:18:00,752 INFO L187 NwaCegarLoop]: Found error trace [2022-04-27 13:18:00,753 INFO L195 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-27 13:18:00,769 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-04-27 13:18:00,973 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3,5 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-27 13:18:00,973 INFO L420 AbstractCegarLoop]: === Iteration 5 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-27 13:18:00,974 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-27 13:18:00,974 INFO L85 PathProgramCache]: Analyzing trace with hash 1080225052, now seen corresponding path program 1 times [2022-04-27 13:18:00,974 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-27 13:18:00,974 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1663976740] [2022-04-27 13:18:00,974 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-27 13:18:00,974 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-27 13:18:00,983 ERROR L245 FreeRefinementEngine]: Caught known exception: Unsupported non-linear arithmetic [2022-04-27 13:18:00,984 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [625723026] [2022-04-27 13:18:00,984 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-27 13:18:00,984 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-27 13:18:00,984 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-04-27 13:18:00,985 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-04-27 13:18:00,986 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-04-27 13:18:01,023 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-04-27 13:18:01,023 INFO L352 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2022-04-27 13:18:01,033 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-04-27 13:18:01,046 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2022-04-27 13:18:01,046 INFO L271 BasicCegarLoop]: Counterexample is feasible [2022-04-27 13:18:01,047 INFO L805 garLoopResultBuilder]: Registering result UNSAFE for location __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION (0 of 1 remaining) [2022-04-27 13:18:01,076 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (6)] Ended with exit code 0 [2022-04-27 13:18:01,248 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4,6 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-27 13:18:01,251 INFO L356 BasicCegarLoop]: Path program histogram: [1, 1, 1, 1, 1] [2022-04-27 13:18:01,253 INFO L176 ceAbstractionStarter]: Computing trace abstraction results [2022-04-27 13:18:01,270 WARN L170 areAnnotationChecker]: reach_errorENTRY has no Hoare annotation [2022-04-27 13:18:01,270 WARN L170 areAnnotationChecker]: ULTIMATE.initENTRY has no Hoare annotation [2022-04-27 13:18:01,270 WARN L170 areAnnotationChecker]: ULTIMATE.startENTRY has no Hoare annotation [2022-04-27 13:18:01,270 WARN L170 areAnnotationChecker]: ULTIMATE.startENTRY has no Hoare annotation [2022-04-27 13:18:01,270 WARN L170 areAnnotationChecker]: assume_abort_if_notENTRY has no Hoare annotation [2022-04-27 13:18:01,270 WARN L170 areAnnotationChecker]: mainENTRY has no Hoare annotation [2022-04-27 13:18:01,270 WARN L170 areAnnotationChecker]: __VERIFIER_assertENTRY has no Hoare annotation [2022-04-27 13:18:01,270 WARN L170 areAnnotationChecker]: reach_errorFINAL has no Hoare annotation [2022-04-27 13:18:01,270 WARN L170 areAnnotationChecker]: ULTIMATE.initFINAL has no Hoare annotation [2022-04-27 13:18:01,270 WARN L170 areAnnotationChecker]: L-1 has no Hoare annotation [2022-04-27 13:18:01,270 WARN L170 areAnnotationChecker]: L-1 has no Hoare annotation [2022-04-27 13:18:01,270 WARN L170 areAnnotationChecker]: L9 has no Hoare annotation [2022-04-27 13:18:01,270 WARN L170 areAnnotationChecker]: L9 has no Hoare annotation [2022-04-27 13:18:01,270 WARN L170 areAnnotationChecker]: L26 has no Hoare annotation [2022-04-27 13:18:01,271 WARN L170 areAnnotationChecker]: L26 has no Hoare annotation [2022-04-27 13:18:01,271 WARN L170 areAnnotationChecker]: L12 has no Hoare annotation [2022-04-27 13:18:01,271 WARN L170 areAnnotationChecker]: L12 has no Hoare annotation [2022-04-27 13:18:01,271 WARN L170 areAnnotationChecker]: ULTIMATE.initEXIT has no Hoare annotation [2022-04-27 13:18:01,271 WARN L170 areAnnotationChecker]: ULTIMATE.startFINAL has no Hoare annotation [2022-04-27 13:18:01,271 WARN L170 areAnnotationChecker]: L9-2 has no Hoare annotation [2022-04-27 13:18:01,271 WARN L170 areAnnotationChecker]: L26-1 has no Hoare annotation [2022-04-27 13:18:01,271 WARN L170 areAnnotationChecker]: L26-1 has no Hoare annotation [2022-04-27 13:18:01,271 WARN L170 areAnnotationChecker]: L13 has no Hoare annotation [2022-04-27 13:18:01,271 WARN L170 areAnnotationChecker]: L13 has no Hoare annotation [2022-04-27 13:18:01,271 WARN L170 areAnnotationChecker]: L12-2 has no Hoare annotation [2022-04-27 13:18:01,271 WARN L170 areAnnotationChecker]: assume_abort_if_notEXIT has no Hoare annotation [2022-04-27 13:18:01,271 WARN L170 areAnnotationChecker]: assume_abort_if_notEXIT has no Hoare annotation [2022-04-27 13:18:01,271 WARN L170 areAnnotationChecker]: L28 has no Hoare annotation [2022-04-27 13:18:01,271 WARN L170 areAnnotationChecker]: __VERIFIER_assertEXIT has no Hoare annotation [2022-04-27 13:18:01,271 WARN L170 areAnnotationChecker]: __VERIFIER_assertEXIT has no Hoare annotation [2022-04-27 13:18:01,271 WARN L170 areAnnotationChecker]: L38-2 has no Hoare annotation [2022-04-27 13:18:01,271 WARN L170 areAnnotationChecker]: L38-2 has no Hoare annotation [2022-04-27 13:18:01,271 WARN L170 areAnnotationChecker]: L35-1 has no Hoare annotation [2022-04-27 13:18:01,271 WARN L170 areAnnotationChecker]: L35-1 has no Hoare annotation [2022-04-27 13:18:01,271 WARN L170 areAnnotationChecker]: L48 has no Hoare annotation [2022-04-27 13:18:01,271 WARN L170 areAnnotationChecker]: L34-3 has no Hoare annotation [2022-04-27 13:18:01,272 WARN L170 areAnnotationChecker]: L34-3 has no Hoare annotation [2022-04-27 13:18:01,272 WARN L170 areAnnotationChecker]: L34-1 has no Hoare annotation [2022-04-27 13:18:01,272 WARN L170 areAnnotationChecker]: L34-1 has no Hoare annotation [2022-04-27 13:18:01,272 WARN L170 areAnnotationChecker]: L38 has no Hoare annotation [2022-04-27 13:18:01,272 WARN L170 areAnnotationChecker]: L38 has no Hoare annotation [2022-04-27 13:18:01,272 WARN L170 areAnnotationChecker]: mainFINAL has no Hoare annotation [2022-04-27 13:18:01,272 WARN L170 areAnnotationChecker]: L35 has no Hoare annotation [2022-04-27 13:18:01,272 WARN L170 areAnnotationChecker]: L35 has no Hoare annotation [2022-04-27 13:18:01,272 WARN L170 areAnnotationChecker]: mainEXIT has no Hoare annotation [2022-04-27 13:18:01,272 INFO L163 areAnnotationChecker]: CFG has 0 edges. 0 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. 0 times interpolants missing. [2022-04-27 13:18:01,272 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 27.04 01:18:01 BoogieIcfgContainer [2022-04-27 13:18:01,272 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2022-04-27 13:18:01,273 INFO L158 Benchmark]: Toolchain (without parser) took 16759.43ms. Allocated memory was 177.2MB in the beginning and 223.3MB in the end (delta: 46.1MB). Free memory was 123.8MB in the beginning and 183.1MB in the end (delta: -59.2MB). There was no memory consumed. Max. memory is 8.0GB. [2022-04-27 13:18:01,273 INFO L158 Benchmark]: CDTParser took 0.24ms. Allocated memory is still 177.2MB. Free memory was 140.4MB in the beginning and 140.3MB in the end (delta: 136.4kB). There was no memory consumed. Max. memory is 8.0GB. [2022-04-27 13:18:01,274 INFO L158 Benchmark]: CACSL2BoogieTranslator took 184.93ms. Allocated memory was 177.2MB in the beginning and 223.3MB in the end (delta: 46.1MB). Free memory was 123.7MB in the beginning and 198.6MB in the end (delta: -74.9MB). Peak memory consumption was 15.1MB. Max. memory is 8.0GB. [2022-04-27 13:18:01,274 INFO L158 Benchmark]: Boogie Preprocessor took 24.97ms. Allocated memory is still 223.3MB. Free memory was 198.6MB in the beginning and 197.1MB in the end (delta: 1.6MB). Peak memory consumption was 2.1MB. Max. memory is 8.0GB. [2022-04-27 13:18:01,274 INFO L158 Benchmark]: RCFGBuilder took 300.49ms. Allocated memory is still 223.3MB. Free memory was 197.1MB in the beginning and 185.0MB in the end (delta: 12.1MB). Peak memory consumption was 11.5MB. Max. memory is 8.0GB. [2022-04-27 13:18:01,274 INFO L158 Benchmark]: TraceAbstraction took 16244.33ms. Allocated memory is still 223.3MB. Free memory was 184.5MB in the beginning and 183.1MB in the end (delta: 1.4MB). Peak memory consumption was 3.0MB. Max. memory is 8.0GB. [2022-04-27 13:18:01,275 INFO L339 ainManager$Toolchain]: ####################### End [Toolchain 1] ####################### --- Results --- * Results from de.uni_freiburg.informatik.ultimate.core: - AssertionsEnabledResult: Assertions are enabled Assertions are enabled - StatisticsResult: Toolchain Benchmarks Benchmark results are: * CDTParser took 0.24ms. Allocated memory is still 177.2MB. Free memory was 140.4MB in the beginning and 140.3MB in the end (delta: 136.4kB). There was no memory consumed. Max. memory is 8.0GB. * CACSL2BoogieTranslator took 184.93ms. Allocated memory was 177.2MB in the beginning and 223.3MB in the end (delta: 46.1MB). Free memory was 123.7MB in the beginning and 198.6MB in the end (delta: -74.9MB). Peak memory consumption was 15.1MB. Max. memory is 8.0GB. * Boogie Preprocessor took 24.97ms. Allocated memory is still 223.3MB. Free memory was 198.6MB in the beginning and 197.1MB in the end (delta: 1.6MB). Peak memory consumption was 2.1MB. Max. memory is 8.0GB. * RCFGBuilder took 300.49ms. Allocated memory is still 223.3MB. Free memory was 197.1MB in the beginning and 185.0MB in the end (delta: 12.1MB). Peak memory consumption was 11.5MB. Max. memory is 8.0GB. * TraceAbstraction took 16244.33ms. Allocated memory is still 223.3MB. Free memory was 184.5MB in the beginning and 183.1MB in the end (delta: 1.4MB). Peak memory consumption was 3.0MB. Max. memory is 8.0GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - StatisticsResult: ErrorAutomatonStatistics NumberErrorTraces: 0, NumberStatementsAllTraces: 0, NumberRelevantStatements: 0, 0.0s ErrorAutomatonConstructionTimeTotal, 0.0s FaulLocalizationTime, NumberStatementsFirstTrace: -1, TraceLengthAvg: 0, 0.0s ErrorAutomatonConstructionTimeAvg, 0.0s ErrorAutomatonDifferenceTimeAvg, 0.0s ErrorAutomatonDifferenceTimeTotal, NumberOfNoEnhancement: 0, NumberOfFiniteEnhancement: 0, NumberOfInfiniteEnhancement: 0 - CounterExampleResult [Line: 14]: a call to reach_error is reachable a call to reach_error is reachable We found a FailurePath: [L19] int counter = 0; VAL [\old(counter)=10, counter=0] [L21] int A, R; [L22] long long u, v, r; [L23] A = __VERIFIER_nondet_int() [L24] R = __VERIFIER_nondet_int() [L26] CALL assume_abort_if_not(((long long) R - 1) * ((long long) R - 1) < A) VAL [\old(cond)=1, \old(counter)=0, counter=0] [L9] COND FALSE !(!cond) VAL [\old(cond)=1, \old(counter)=0, cond=1, counter=0] [L26] RET assume_abort_if_not(((long long) R - 1) * ((long long) R - 1) < A) VAL [\old(counter)=0, A=7, counter=0, R=3] [L28] CALL assume_abort_if_not(A % 2 == 1) VAL [\old(cond)=1, \old(counter)=0, counter=0] [L9] COND FALSE !(!cond) VAL [\old(cond)=1, \old(counter)=0, cond=1, counter=0] [L28] RET assume_abort_if_not(A % 2 == 1) VAL [\old(counter)=0, A=7, counter=0, R=3] [L30] u = ((long long) 2 * R) + 1 [L31] v = 1 [L32] r = ((long long) R * R) - A VAL [\old(counter)=0, A=7, counter=0, R=3, r=2, u=7, v=1] [L34] EXPR counter++ VAL [\old(counter)=0, A=7, counter=1, counter++=0, r=2, R=3, u=7, v=1] [L34] COND TRUE counter++<1 [L35] CALL __VERIFIER_assert(4*(A+r) == u*u - v*v - 2*u + 2*v) VAL [\old(cond)=1, \old(counter)=0, counter=1] [L12] COND FALSE !(!(cond)) VAL [\old(cond)=1, \old(counter)=0, cond=1, counter=1] [L35] RET __VERIFIER_assert(4*(A+r) == u*u - v*v - 2*u + 2*v) VAL [\old(counter)=0, A=7, counter=1, r=2, R=3, u=7, v=1] [L36] COND FALSE !(!(r != 0)) VAL [\old(counter)=0, A=7, counter=1, R=3, r=2, u=7, v=1] [L38] COND TRUE r > 0 [L39] r = r - v [L40] v = v + 2 VAL [\old(counter)=0, A=7, counter=1, R=3, r=1, u=7, v=3] [L34] EXPR counter++ VAL [\old(counter)=0, A=7, counter=2, counter++=1, R=3, r=1, u=7, v=3] [L34] COND FALSE !(counter++<1) [L48] CALL __VERIFIER_assert(((long long) 4*A) == u*u - v*v - 2*u + 2*v) VAL [\old(cond)=0, \old(counter)=0, counter=2] [L12] COND TRUE !(cond) VAL [\old(cond)=0, \old(counter)=0, cond=0, counter=2] [L14] reach_error() VAL [\old(cond)=0, \old(counter)=0, cond=0, counter=2] - StatisticsResult: Ultimate Automizer benchmark data CFG has 6 procedures, 33 locations, 1 error locations. Started 1 CEGAR loops. OverallTime: 16.2s, OverallIterations: 5, TraceHistogramMax: 2, PathProgramHistogramMax: 1, EmptinessCheckTime: 0.0s, AutomataDifference: 7.7s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 0.0s, HoareTripleCheckerStatistics: 2 mSolverCounterUnknown, 31 SdHoareTripleChecker+Valid, 4.4s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 30 mSDsluCounter, 298 SdHoareTripleChecker+Invalid, 4.4s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 193 mSDsCounter, 6 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 107 IncrementalHoareTripleChecker+Invalid, 115 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 6 mSolverCounterUnsat, 105 mSDtfsCounter, 107 mSolverCounterSat, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 126 GetRequests, 108 SyntacticMatches, 1 SemanticMatches, 17 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 10 ImplicationChecksByTransitivity, 0.1s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=32occurred in iteration=3, InterpolantAutomatonStates: 19, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s DumpTime, AutomataMinimizationStatistics: 0.1s AutomataMinimizationTime, 4 MinimizatonAttempts, 8 StatesRemovedByMinimization, 2 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.0s SsaConstructionTime, 0.1s SatisfiabilityAnalysisTime, 3.2s InterpolantComputationTime, 129 NumberOfCodeBlocks, 129 NumberOfCodeBlocksAsserted, 5 NumberOfCheckSat, 121 ConstructedInterpolants, 0 QuantifiedInterpolants, 357 SizeOfPredicates, 10 NumberOfNonLiveVariables, 379 ConjunctsInSsa, 29 ConjunctsInUnsatCore, 5 InterpolantComputations, 3 PerfectInterpolantSequences, 22/24 InterpolantCoveringCapability, INVARIANT_SYNTHESIS: No data available, INTERPOLANT_CONSOLIDATION: No data available, ABSTRACT_INTERPRETATION: No data available, PDR: No data available, ACCELERATED_INTERPOLATION: No data available, SIFA: No data available, ReuseStatistics: No data available RESULT: Ultimate proved your program to be incorrect! [2022-04-27 13:18:01,290 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...