/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_valuebound20.c -------------------------------------------------------------------------------- This is Ultimate 0.2.2-dev-fb4f59a-m [2022-04-27 13:18:42,884 INFO L177 SettingsManager]: Resetting all preferences to default values... [2022-04-27 13:18:42,885 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2022-04-27 13:18:42,913 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2022-04-27 13:18:42,913 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2022-04-27 13:18:42,914 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2022-04-27 13:18:42,919 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2022-04-27 13:18:42,923 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2022-04-27 13:18:42,924 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2022-04-27 13:18:42,928 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2022-04-27 13:18:42,929 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2022-04-27 13:18:42,930 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2022-04-27 13:18:42,930 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2022-04-27 13:18:42,932 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2022-04-27 13:18:42,933 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2022-04-27 13:18:42,933 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2022-04-27 13:18:42,934 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2022-04-27 13:18:42,935 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2022-04-27 13:18:42,938 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2022-04-27 13:18:42,939 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2022-04-27 13:18:42,940 INFO L181 SettingsManager]: Resetting HornVerifier preferences to default values [2022-04-27 13:18:42,942 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2022-04-27 13:18:42,942 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2022-04-27 13:18:42,943 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2022-04-27 13:18:42,944 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2022-04-27 13:18:42,948 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2022-04-27 13:18:42,948 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2022-04-27 13:18:42,948 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2022-04-27 13:18:42,949 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2022-04-27 13:18:42,949 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2022-04-27 13:18:42,950 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2022-04-27 13:18:42,950 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2022-04-27 13:18:42,951 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2022-04-27 13:18:42,952 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2022-04-27 13:18:42,952 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2022-04-27 13:18:42,952 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2022-04-27 13:18:42,953 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2022-04-27 13:18:42,953 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2022-04-27 13:18:42,953 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2022-04-27 13:18:42,953 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2022-04-27 13:18:42,954 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2022-04-27 13:18:42,955 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2022-04-27 13:18:42,955 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:18:42,978 INFO L113 SettingsManager]: Loading preferences was successful [2022-04-27 13:18:42,978 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2022-04-27 13:18:42,979 INFO L136 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2022-04-27 13:18:42,979 INFO L138 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2022-04-27 13:18:42,979 INFO L136 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2022-04-27 13:18:42,979 INFO L138 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2022-04-27 13:18:42,980 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2022-04-27 13:18:42,980 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2022-04-27 13:18:42,980 INFO L138 SettingsManager]: * Use SBE=true [2022-04-27 13:18:42,980 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2022-04-27 13:18:42,980 INFO L138 SettingsManager]: * sizeof long=4 [2022-04-27 13:18:42,980 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2022-04-27 13:18:42,980 INFO L138 SettingsManager]: * sizeof POINTER=4 [2022-04-27 13:18:42,980 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2022-04-27 13:18:42,980 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2022-04-27 13:18:42,980 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2022-04-27 13:18:42,980 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2022-04-27 13:18:42,981 INFO L138 SettingsManager]: * sizeof long double=12 [2022-04-27 13:18:42,981 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2022-04-27 13:18:42,981 INFO L138 SettingsManager]: * Use constant arrays=true [2022-04-27 13:18:42,981 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2022-04-27 13:18:42,981 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2022-04-27 13:18:42,981 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2022-04-27 13:18:42,981 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2022-04-27 13:18:42,981 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-04-27 13:18:42,981 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2022-04-27 13:18:42,981 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2022-04-27 13:18:42,981 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2022-04-27 13:18:42,981 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2022-04-27 13:18:42,982 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2022-04-27 13:18:42,982 INFO L138 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2022-04-27 13:18:42,982 INFO L138 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2022-04-27 13:18:42,982 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2022-04-27 13:18:42,982 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:18:43,163 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2022-04-27 13:18:43,184 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2022-04-27 13:18:43,187 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2022-04-27 13:18:43,188 INFO L271 PluginConnector]: Initializing CDTParser... [2022-04-27 13:18:43,188 INFO L275 PluginConnector]: CDTParser initialized [2022-04-27 13:18:43,189 INFO L432 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/nla-digbench-scaling/fermat2-ll_valuebound20.c [2022-04-27 13:18:43,229 INFO L220 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/cec5e0558/5ed30d590cb34052a6714c00e7bb68df/FLAG90b41cd7a [2022-04-27 13:18:43,582 INFO L306 CDTParser]: Found 1 translation units. [2022-04-27 13:18:43,582 INFO L160 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/nla-digbench-scaling/fermat2-ll_valuebound20.c [2022-04-27 13:18:43,586 INFO L349 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/cec5e0558/5ed30d590cb34052a6714c00e7bb68df/FLAG90b41cd7a [2022-04-27 13:18:43,595 INFO L357 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/cec5e0558/5ed30d590cb34052a6714c00e7bb68df [2022-04-27 13:18:43,596 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2022-04-27 13:18:43,597 INFO L131 ToolchainWalker]: Walking toolchain with 4 elements. [2022-04-27 13:18:43,600 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2022-04-27 13:18:43,600 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2022-04-27 13:18:43,602 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2022-04-27 13:18:43,603 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 27.04 01:18:43" (1/1) ... [2022-04-27 13:18:43,604 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@7be5ede7 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.04 01:18:43, skipping insertion in model container [2022-04-27 13:18:43,604 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 27.04 01:18:43" (1/1) ... [2022-04-27 13:18:43,611 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2022-04-27 13:18:43,621 INFO L178 MainTranslator]: Built tables and reachable declarations [2022-04-27 13:18:43,735 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_valuebound20.c[524,537] [2022-04-27 13:18:43,755 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-04-27 13:18:43,760 INFO L203 MainTranslator]: Completed pre-run [2022-04-27 13:18:43,767 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_valuebound20.c[524,537] [2022-04-27 13:18:43,780 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-04-27 13:18:43,788 INFO L208 MainTranslator]: Completed translation [2022-04-27 13:18:43,789 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.04 01:18:43 WrapperNode [2022-04-27 13:18:43,789 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2022-04-27 13:18:43,789 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2022-04-27 13:18:43,789 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2022-04-27 13:18:43,789 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2022-04-27 13:18:43,795 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.04 01:18:43" (1/1) ... [2022-04-27 13:18:43,796 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.04 01:18:43" (1/1) ... [2022-04-27 13:18:43,799 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.04 01:18:43" (1/1) ... [2022-04-27 13:18:43,799 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.04 01:18:43" (1/1) ... [2022-04-27 13:18:43,803 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.04 01:18:43" (1/1) ... [2022-04-27 13:18:43,805 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.04 01:18:43" (1/1) ... [2022-04-27 13:18:43,806 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.04 01:18:43" (1/1) ... [2022-04-27 13:18:43,807 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2022-04-27 13:18:43,807 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2022-04-27 13:18:43,807 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2022-04-27 13:18:43,807 INFO L275 PluginConnector]: RCFGBuilder initialized [2022-04-27 13:18:43,808 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.04 01:18:43" (1/1) ... [2022-04-27 13:18:43,814 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-04-27 13:18:43,825 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-04-27 13:18:43,833 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:18:43,839 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:18:43,860 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.init [2022-04-27 13:18:43,860 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2022-04-27 13:18:43,860 INFO L138 BoogieDeclarations]: Found implementation of procedure reach_error [2022-04-27 13:18:43,860 INFO L138 BoogieDeclarations]: Found implementation of procedure assume_abort_if_not [2022-04-27 13:18:43,861 INFO L138 BoogieDeclarations]: Found implementation of procedure __VERIFIER_assert [2022-04-27 13:18:43,861 INFO L138 BoogieDeclarations]: Found implementation of procedure main [2022-04-27 13:18:43,861 INFO L130 BoogieDeclarations]: Found specification of procedure abort [2022-04-27 13:18:43,861 INFO L130 BoogieDeclarations]: Found specification of procedure __assert_fail [2022-04-27 13:18:43,861 INFO L130 BoogieDeclarations]: Found specification of procedure reach_error [2022-04-27 13:18:43,861 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2022-04-27 13:18:43,861 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_nondet_int [2022-04-27 13:18:43,861 INFO L130 BoogieDeclarations]: Found specification of procedure assume_abort_if_not [2022-04-27 13:18:43,861 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_assert [2022-04-27 13:18:43,861 INFO L130 BoogieDeclarations]: Found specification of procedure main [2022-04-27 13:18:43,861 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.init [2022-04-27 13:18:43,862 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2022-04-27 13:18:43,862 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2022-04-27 13:18:43,862 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2022-04-27 13:18:43,862 INFO L130 BoogieDeclarations]: Found specification of procedure read~int [2022-04-27 13:18:43,862 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2022-04-27 13:18:43,902 INFO L234 CfgBuilder]: Building ICFG [2022-04-27 13:18:43,903 INFO L260 CfgBuilder]: Building CFG for each procedure with an implementation [2022-04-27 13:18:44,036 INFO L275 CfgBuilder]: Performing block encoding [2022-04-27 13:18:44,044 INFO L294 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2022-04-27 13:18:44,044 INFO L299 CfgBuilder]: Removed 1 assume(true) statements. [2022-04-27 13:18:44,046 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 27.04 01:18:44 BoogieIcfgContainer [2022-04-27 13:18:44,046 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2022-04-27 13:18:44,047 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2022-04-27 13:18:44,047 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2022-04-27 13:18:44,051 INFO L275 PluginConnector]: TraceAbstraction initialized [2022-04-27 13:18:44,052 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 27.04 01:18:43" (1/3) ... [2022-04-27 13:18:44,052 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@63db22a1 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 27.04 01:18:44, skipping insertion in model container [2022-04-27 13:18:44,052 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.04 01:18:43" (2/3) ... [2022-04-27 13:18:44,052 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@63db22a1 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 27.04 01:18:44, skipping insertion in model container [2022-04-27 13:18:44,052 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 27.04 01:18:44" (3/3) ... [2022-04-27 13:18:44,053 INFO L111 eAbstractionObserver]: Analyzing ICFG fermat2-ll_valuebound20.c [2022-04-27 13:18:44,062 INFO L201 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2022-04-27 13:18:44,062 INFO L160 ceAbstractionStarter]: Applying trace abstraction to program that has 1 error locations. [2022-04-27 13:18:44,089 INFO L356 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2022-04-27 13:18:44,093 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@563caa6a, mLbeIndependenceSettings=de.uni_freiburg.informatik.ultimate.lib.tracecheckerutils.partialorder.independence.IndependenceSettings@4552f631 [2022-04-27 13:18:44,093 INFO L358 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2022-04-27 13:18:44,098 INFO L276 IsEmpty]: Start isEmpty. Operand has 32 states, 18 states have (on average 1.3888888888888888) internal successors, (25), 19 states have internal predecessors, (25), 8 states have call successors, (8), 4 states have call predecessors, (8), 4 states have return successors, (8), 8 states have call predecessors, (8), 8 states have call successors, (8) [2022-04-27 13:18:44,103 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 34 [2022-04-27 13:18:44,103 INFO L187 NwaCegarLoop]: Found error trace [2022-04-27 13:18:44,103 INFO L195 NwaCegarLoop]: trace histogram [4, 4, 4, 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:44,104 INFO L420 AbstractCegarLoop]: === Iteration 1 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-27 13:18:44,107 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-27 13:18:44,107 INFO L85 PathProgramCache]: Analyzing trace with hash 1790211013, now seen corresponding path program 1 times [2022-04-27 13:18:44,113 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-27 13:18:44,113 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [3512726] [2022-04-27 13:18:44,113 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-27 13:18:44,114 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-27 13:18:44,177 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-27 13:18:44,234 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-04-27 13:18:44,237 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-27 13:18:44,255 INFO L290 TraceCheckUtils]: 0: Hoare triple {56#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} #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); {35#true} is VALID [2022-04-27 13:18:44,255 INFO L290 TraceCheckUtils]: 1: Hoare triple {35#true} assume true; {35#true} is VALID [2022-04-27 13:18:44,256 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {35#true} {35#true} #73#return; {35#true} is VALID [2022-04-27 13:18:44,256 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2022-04-27 13:18:44,258 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-27 13:18:44,270 INFO L290 TraceCheckUtils]: 0: Hoare triple {35#true} ~cond := #in~cond; {35#true} is VALID [2022-04-27 13:18:44,271 INFO L290 TraceCheckUtils]: 1: Hoare triple {35#true} assume 0 == ~cond;assume false; {36#false} is VALID [2022-04-27 13:18:44,271 INFO L290 TraceCheckUtils]: 2: Hoare triple {36#false} assume true; {36#false} is VALID [2022-04-27 13:18:44,272 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {36#false} {35#true} #61#return; {36#false} is VALID [2022-04-27 13:18:44,272 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 12 [2022-04-27 13:18:44,273 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-27 13:18:44,281 INFO L290 TraceCheckUtils]: 0: Hoare triple {35#true} ~cond := #in~cond; {35#true} is VALID [2022-04-27 13:18:44,282 INFO L290 TraceCheckUtils]: 1: Hoare triple {35#true} assume 0 == ~cond;assume false; {36#false} is VALID [2022-04-27 13:18:44,282 INFO L290 TraceCheckUtils]: 2: Hoare triple {36#false} assume true; {36#false} is VALID [2022-04-27 13:18:44,282 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {36#false} {36#false} #63#return; {36#false} is VALID [2022-04-27 13:18:44,282 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 17 [2022-04-27 13:18:44,284 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-27 13:18:44,288 INFO L290 TraceCheckUtils]: 0: Hoare triple {35#true} ~cond := #in~cond; {35#true} is VALID [2022-04-27 13:18:44,288 INFO L290 TraceCheckUtils]: 1: Hoare triple {35#true} assume 0 == ~cond;assume false; {36#false} is VALID [2022-04-27 13:18:44,288 INFO L290 TraceCheckUtils]: 2: Hoare triple {36#false} assume true; {36#false} is VALID [2022-04-27 13:18:44,288 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {36#false} {36#false} #65#return; {36#false} is VALID [2022-04-27 13:18:44,288 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 22 [2022-04-27 13:18:44,290 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-27 13:18:44,294 INFO L290 TraceCheckUtils]: 0: Hoare triple {35#true} ~cond := #in~cond; {35#true} is VALID [2022-04-27 13:18:44,294 INFO L290 TraceCheckUtils]: 1: Hoare triple {35#true} assume 0 == ~cond;assume false; {36#false} is VALID [2022-04-27 13:18:44,294 INFO L290 TraceCheckUtils]: 2: Hoare triple {36#false} assume true; {36#false} is VALID [2022-04-27 13:18:44,294 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {36#false} {36#false} #67#return; {36#false} is VALID [2022-04-27 13:18:44,295 INFO L272 TraceCheckUtils]: 0: Hoare triple {35#true} call ULTIMATE.init(); {56#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} is VALID [2022-04-27 13:18:44,295 INFO L290 TraceCheckUtils]: 1: Hoare triple {56#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} #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); {35#true} is VALID [2022-04-27 13:18:44,295 INFO L290 TraceCheckUtils]: 2: Hoare triple {35#true} assume true; {35#true} is VALID [2022-04-27 13:18:44,296 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {35#true} {35#true} #73#return; {35#true} is VALID [2022-04-27 13:18:44,296 INFO L272 TraceCheckUtils]: 4: Hoare triple {35#true} call #t~ret6 := main(); {35#true} is VALID [2022-04-27 13:18:44,296 INFO L290 TraceCheckUtils]: 5: Hoare triple {35#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; {35#true} is VALID [2022-04-27 13:18:44,296 INFO L272 TraceCheckUtils]: 6: Hoare triple {35#true} call assume_abort_if_not((if ~A~0 >= 0 && ~A~0 <= 20 then 1 else 0)); {35#true} is VALID [2022-04-27 13:18:44,296 INFO L290 TraceCheckUtils]: 7: Hoare triple {35#true} ~cond := #in~cond; {35#true} is VALID [2022-04-27 13:18:44,297 INFO L290 TraceCheckUtils]: 8: Hoare triple {35#true} assume 0 == ~cond;assume false; {36#false} is VALID [2022-04-27 13:18:44,297 INFO L290 TraceCheckUtils]: 9: Hoare triple {36#false} assume true; {36#false} is VALID [2022-04-27 13:18:44,297 INFO L284 TraceCheckUtils]: 10: Hoare quadruple {36#false} {35#true} #61#return; {36#false} is VALID [2022-04-27 13:18:44,297 INFO L290 TraceCheckUtils]: 11: Hoare triple {36#false} assume -2147483648 <= #t~nondet5 && #t~nondet5 <= 2147483647;~R~0 := #t~nondet5;havoc #t~nondet5; {36#false} is VALID [2022-04-27 13:18:44,297 INFO L272 TraceCheckUtils]: 12: Hoare triple {36#false} call assume_abort_if_not((if ~R~0 >= 0 && ~R~0 <= 20 then 1 else 0)); {35#true} is VALID [2022-04-27 13:18:44,297 INFO L290 TraceCheckUtils]: 13: Hoare triple {35#true} ~cond := #in~cond; {35#true} is VALID [2022-04-27 13:18:44,302 INFO L290 TraceCheckUtils]: 14: Hoare triple {35#true} assume 0 == ~cond;assume false; {36#false} is VALID [2022-04-27 13:18:44,302 INFO L290 TraceCheckUtils]: 15: Hoare triple {36#false} assume true; {36#false} is VALID [2022-04-27 13:18:44,302 INFO L284 TraceCheckUtils]: 16: Hoare quadruple {36#false} {36#false} #63#return; {36#false} is VALID [2022-04-27 13:18:44,302 INFO L272 TraceCheckUtils]: 17: Hoare triple {36#false} call assume_abort_if_not((if (~R~0 - 1) * (~R~0 - 1) < ~A~0 then 1 else 0)); {35#true} is VALID [2022-04-27 13:18:44,302 INFO L290 TraceCheckUtils]: 18: Hoare triple {35#true} ~cond := #in~cond; {35#true} is VALID [2022-04-27 13:18:44,303 INFO L290 TraceCheckUtils]: 19: Hoare triple {35#true} assume 0 == ~cond;assume false; {36#false} is VALID [2022-04-27 13:18:44,303 INFO L290 TraceCheckUtils]: 20: Hoare triple {36#false} assume true; {36#false} is VALID [2022-04-27 13:18:44,303 INFO L284 TraceCheckUtils]: 21: Hoare quadruple {36#false} {36#false} #65#return; {36#false} is VALID [2022-04-27 13:18:44,303 INFO L272 TraceCheckUtils]: 22: Hoare triple {36#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)); {35#true} is VALID [2022-04-27 13:18:44,303 INFO L290 TraceCheckUtils]: 23: Hoare triple {35#true} ~cond := #in~cond; {35#true} is VALID [2022-04-27 13:18:44,304 INFO L290 TraceCheckUtils]: 24: Hoare triple {35#true} assume 0 == ~cond;assume false; {36#false} is VALID [2022-04-27 13:18:44,304 INFO L290 TraceCheckUtils]: 25: Hoare triple {36#false} assume true; {36#false} is VALID [2022-04-27 13:18:44,304 INFO L284 TraceCheckUtils]: 26: Hoare quadruple {36#false} {36#false} #67#return; {36#false} is VALID [2022-04-27 13:18:44,304 INFO L290 TraceCheckUtils]: 27: Hoare triple {36#false} ~u~0 := 1 + 2 * ~R~0;~v~0 := 1;~r~0 := ~R~0 * ~R~0 - ~A~0; {36#false} is VALID [2022-04-27 13:18:44,304 INFO L290 TraceCheckUtils]: 28: Hoare triple {36#false} assume !true; {36#false} is VALID [2022-04-27 13:18:44,304 INFO L272 TraceCheckUtils]: 29: Hoare triple {36#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)); {36#false} is VALID [2022-04-27 13:18:44,304 INFO L290 TraceCheckUtils]: 30: Hoare triple {36#false} ~cond := #in~cond; {36#false} is VALID [2022-04-27 13:18:44,305 INFO L290 TraceCheckUtils]: 31: Hoare triple {36#false} assume 0 == ~cond; {36#false} is VALID [2022-04-27 13:18:44,305 INFO L290 TraceCheckUtils]: 32: Hoare triple {36#false} assume !false; {36#false} is VALID [2022-04-27 13:18:44,305 INFO L134 CoverageAnalysis]: Checked inductivity of 24 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 24 trivial. 0 not checked. [2022-04-27 13:18:44,305 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-27 13:18:44,306 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [3512726] [2022-04-27 13:18:44,306 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [3512726] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-27 13:18:44,306 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-27 13:18:44,306 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-04-27 13:18:44,307 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [904898529] [2022-04-27 13:18:44,308 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-27 13:18:44,311 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 4.0) internal successors, (12), 2 states have internal predecessors, (12), 2 states have call successors, (7), 3 states have call predecessors, (7), 2 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) Word has length 33 [2022-04-27 13:18:44,312 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-27 13:18:44,314 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with has 3 states, 3 states have (on average 4.0) internal successors, (12), 2 states have internal predecessors, (12), 2 states have call successors, (7), 3 states have call predecessors, (7), 2 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) [2022-04-27 13:18:44,351 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 24 edges. 24 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-27 13:18:44,352 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-04-27 13:18:44,352 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-04-27 13:18:44,374 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-04-27 13:18:44,374 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-04-27 13:18:44,376 INFO L87 Difference]: Start difference. First operand has 32 states, 18 states have (on average 1.3888888888888888) internal successors, (25), 19 states have internal predecessors, (25), 8 states have call successors, (8), 4 states have call predecessors, (8), 4 states have return successors, (8), 8 states have call predecessors, (8), 8 states have call successors, (8) Second operand has 3 states, 3 states have (on average 4.0) internal successors, (12), 2 states have internal predecessors, (12), 2 states have call successors, (7), 3 states have call predecessors, (7), 2 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) [2022-04-27 13:18:44,494 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-27 13:18:44,494 INFO L93 Difference]: Finished difference Result 57 states and 80 transitions. [2022-04-27 13:18:44,494 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-04-27 13:18:44,495 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 4.0) internal successors, (12), 2 states have internal predecessors, (12), 2 states have call successors, (7), 3 states have call predecessors, (7), 2 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) Word has length 33 [2022-04-27 13:18:44,495 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-27 13:18:44,495 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3 states, 3 states have (on average 4.0) internal successors, (12), 2 states have internal predecessors, (12), 2 states have call successors, (7), 3 states have call predecessors, (7), 2 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) [2022-04-27 13:18:44,502 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 80 transitions. [2022-04-27 13:18:44,502 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3 states, 3 states have (on average 4.0) internal successors, (12), 2 states have internal predecessors, (12), 2 states have call successors, (7), 3 states have call predecessors, (7), 2 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) [2022-04-27 13:18:44,507 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 80 transitions. [2022-04-27 13:18:44,507 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 3 states and 80 transitions. [2022-04-27 13:18:44,600 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 80 edges. 80 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-27 13:18:44,609 INFO L225 Difference]: With dead ends: 57 [2022-04-27 13:18:44,610 INFO L226 Difference]: Without dead ends: 27 [2022-04-27 13:18:44,612 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 16 GetRequests, 15 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-04-27 13:18:44,624 INFO L413 NwaCegarLoop]: 31 mSDtfsCounter, 18 mSDsluCounter, 3 mSDsCounter, 0 mSdLazyCounter, 8 mSolverCounterSat, 7 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 24 SdHoareTripleChecker+Valid, 34 SdHoareTripleChecker+Invalid, 15 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 7 IncrementalHoareTripleChecker+Valid, 8 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-04-27 13:18:44,625 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [24 Valid, 34 Invalid, 15 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [7 Valid, 8 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-04-27 13:18:44,635 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 27 states. [2022-04-27 13:18:44,655 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 27 to 27. [2022-04-27 13:18:44,655 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-27 13:18:44,655 INFO L82 GeneralOperation]: Start isEquivalent. First operand 27 states. Second operand has 27 states, 15 states have (on average 1.2) internal successors, (18), 16 states have internal predecessors, (18), 8 states have call successors, (8), 4 states have call predecessors, (8), 3 states have return successors, (6), 6 states have call predecessors, (6), 6 states have call successors, (6) [2022-04-27 13:18:44,656 INFO L74 IsIncluded]: Start isIncluded. First operand 27 states. Second operand has 27 states, 15 states have (on average 1.2) internal successors, (18), 16 states have internal predecessors, (18), 8 states have call successors, (8), 4 states have call predecessors, (8), 3 states have return successors, (6), 6 states have call predecessors, (6), 6 states have call successors, (6) [2022-04-27 13:18:44,656 INFO L87 Difference]: Start difference. First operand 27 states. Second operand has 27 states, 15 states have (on average 1.2) internal successors, (18), 16 states have internal predecessors, (18), 8 states have call successors, (8), 4 states have call predecessors, (8), 3 states have return successors, (6), 6 states have call predecessors, (6), 6 states have call successors, (6) [2022-04-27 13:18:44,659 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-27 13:18:44,660 INFO L93 Difference]: Finished difference Result 27 states and 32 transitions. [2022-04-27 13:18:44,660 INFO L276 IsEmpty]: Start isEmpty. Operand 27 states and 32 transitions. [2022-04-27 13:18:44,660 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-27 13:18:44,660 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-27 13:18:44,661 INFO L74 IsIncluded]: Start isIncluded. First operand has 27 states, 15 states have (on average 1.2) internal successors, (18), 16 states have internal predecessors, (18), 8 states have call successors, (8), 4 states have call predecessors, (8), 3 states have return successors, (6), 6 states have call predecessors, (6), 6 states have call successors, (6) Second operand 27 states. [2022-04-27 13:18:44,661 INFO L87 Difference]: Start difference. First operand has 27 states, 15 states have (on average 1.2) internal successors, (18), 16 states have internal predecessors, (18), 8 states have call successors, (8), 4 states have call predecessors, (8), 3 states have return successors, (6), 6 states have call predecessors, (6), 6 states have call successors, (6) Second operand 27 states. [2022-04-27 13:18:44,663 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-27 13:18:44,663 INFO L93 Difference]: Finished difference Result 27 states and 32 transitions. [2022-04-27 13:18:44,663 INFO L276 IsEmpty]: Start isEmpty. Operand 27 states and 32 transitions. [2022-04-27 13:18:44,664 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-27 13:18:44,664 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-27 13:18:44,664 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-27 13:18:44,664 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-27 13:18:44,664 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 27 states, 15 states have (on average 1.2) internal successors, (18), 16 states have internal predecessors, (18), 8 states have call successors, (8), 4 states have call predecessors, (8), 3 states have return successors, (6), 6 states have call predecessors, (6), 6 states have call successors, (6) [2022-04-27 13:18:44,666 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 27 states to 27 states and 32 transitions. [2022-04-27 13:18:44,667 INFO L78 Accepts]: Start accepts. Automaton has 27 states and 32 transitions. Word has length 33 [2022-04-27 13:18:44,667 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-27 13:18:44,667 INFO L495 AbstractCegarLoop]: Abstraction has 27 states and 32 transitions. [2022-04-27 13:18:44,667 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 4.0) internal successors, (12), 2 states have internal predecessors, (12), 2 states have call successors, (7), 3 states have call predecessors, (7), 2 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) [2022-04-27 13:18:44,667 INFO L276 IsEmpty]: Start isEmpty. Operand 27 states and 32 transitions. [2022-04-27 13:18:44,668 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 34 [2022-04-27 13:18:44,668 INFO L187 NwaCegarLoop]: Found error trace [2022-04-27 13:18:44,668 INFO L195 NwaCegarLoop]: trace histogram [4, 4, 4, 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:44,669 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2022-04-27 13:18:44,669 INFO L420 AbstractCegarLoop]: === Iteration 2 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-27 13:18:44,669 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-27 13:18:44,669 INFO L85 PathProgramCache]: Analyzing trace with hash -102231875, now seen corresponding path program 1 times [2022-04-27 13:18:44,669 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-27 13:18:44,670 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [740826853] [2022-04-27 13:18:44,670 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-27 13:18:44,670 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-27 13:18:44,702 ERROR L245 FreeRefinementEngine]: Caught known exception: Unsupported non-linear arithmetic [2022-04-27 13:18:44,702 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [1471212170] [2022-04-27 13:18:44,703 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-27 13:18:44,703 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-27 13:18:44,703 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-04-27 13:18:44,704 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:18:44,729 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:18:44,772 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-27 13:18:44,774 INFO L263 TraceCheckSpWp]: Trace formula consists of 99 conjuncts, 11 conjunts are in the unsatisfiable core [2022-04-27 13:18:44,790 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-27 13:18:44,793 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-04-27 13:18:45,221 INFO L272 TraceCheckUtils]: 0: Hoare triple {231#true} call ULTIMATE.init(); {231#true} is VALID [2022-04-27 13:18:45,221 INFO L290 TraceCheckUtils]: 1: Hoare triple {231#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); {231#true} is VALID [2022-04-27 13:18:45,221 INFO L290 TraceCheckUtils]: 2: Hoare triple {231#true} assume true; {231#true} is VALID [2022-04-27 13:18:45,223 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {231#true} {231#true} #73#return; {231#true} is VALID [2022-04-27 13:18:45,223 INFO L272 TraceCheckUtils]: 4: Hoare triple {231#true} call #t~ret6 := main(); {231#true} is VALID [2022-04-27 13:18:45,224 INFO L290 TraceCheckUtils]: 5: Hoare triple {231#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; {231#true} is VALID [2022-04-27 13:18:45,224 INFO L272 TraceCheckUtils]: 6: Hoare triple {231#true} call assume_abort_if_not((if ~A~0 >= 0 && ~A~0 <= 20 then 1 else 0)); {231#true} is VALID [2022-04-27 13:18:45,224 INFO L290 TraceCheckUtils]: 7: Hoare triple {231#true} ~cond := #in~cond; {231#true} is VALID [2022-04-27 13:18:45,224 INFO L290 TraceCheckUtils]: 8: Hoare triple {231#true} assume !(0 == ~cond); {231#true} is VALID [2022-04-27 13:18:45,224 INFO L290 TraceCheckUtils]: 9: Hoare triple {231#true} assume true; {231#true} is VALID [2022-04-27 13:18:45,224 INFO L284 TraceCheckUtils]: 10: Hoare quadruple {231#true} {231#true} #61#return; {231#true} is VALID [2022-04-27 13:18:45,224 INFO L290 TraceCheckUtils]: 11: Hoare triple {231#true} assume -2147483648 <= #t~nondet5 && #t~nondet5 <= 2147483647;~R~0 := #t~nondet5;havoc #t~nondet5; {231#true} is VALID [2022-04-27 13:18:45,225 INFO L272 TraceCheckUtils]: 12: Hoare triple {231#true} call assume_abort_if_not((if ~R~0 >= 0 && ~R~0 <= 20 then 1 else 0)); {231#true} is VALID [2022-04-27 13:18:45,225 INFO L290 TraceCheckUtils]: 13: Hoare triple {231#true} ~cond := #in~cond; {231#true} is VALID [2022-04-27 13:18:45,225 INFO L290 TraceCheckUtils]: 14: Hoare triple {231#true} assume !(0 == ~cond); {231#true} is VALID [2022-04-27 13:18:45,225 INFO L290 TraceCheckUtils]: 15: Hoare triple {231#true} assume true; {231#true} is VALID [2022-04-27 13:18:45,225 INFO L284 TraceCheckUtils]: 16: Hoare quadruple {231#true} {231#true} #63#return; {231#true} is VALID [2022-04-27 13:18:45,225 INFO L272 TraceCheckUtils]: 17: Hoare triple {231#true} call assume_abort_if_not((if (~R~0 - 1) * (~R~0 - 1) < ~A~0 then 1 else 0)); {231#true} is VALID [2022-04-27 13:18:45,225 INFO L290 TraceCheckUtils]: 18: Hoare triple {231#true} ~cond := #in~cond; {231#true} is VALID [2022-04-27 13:18:45,226 INFO L290 TraceCheckUtils]: 19: Hoare triple {231#true} assume !(0 == ~cond); {231#true} is VALID [2022-04-27 13:18:45,226 INFO L290 TraceCheckUtils]: 20: Hoare triple {231#true} assume true; {231#true} is VALID [2022-04-27 13:18:45,226 INFO L284 TraceCheckUtils]: 21: Hoare quadruple {231#true} {231#true} #65#return; {231#true} is VALID [2022-04-27 13:18:45,226 INFO L272 TraceCheckUtils]: 22: Hoare triple {231#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)); {231#true} is VALID [2022-04-27 13:18:45,226 INFO L290 TraceCheckUtils]: 23: Hoare triple {231#true} ~cond := #in~cond; {231#true} is VALID [2022-04-27 13:18:45,226 INFO L290 TraceCheckUtils]: 24: Hoare triple {231#true} assume !(0 == ~cond); {231#true} is VALID [2022-04-27 13:18:45,226 INFO L290 TraceCheckUtils]: 25: Hoare triple {231#true} assume true; {231#true} is VALID [2022-04-27 13:18:45,227 INFO L284 TraceCheckUtils]: 26: Hoare quadruple {231#true} {231#true} #67#return; {231#true} is VALID [2022-04-27 13:18:47,228 WARN L290 TraceCheckUtils]: 27: Hoare triple {231#true} ~u~0 := 1 + 2 * ~R~0;~v~0 := 1;~r~0 := ~R~0 * ~R~0 - ~A~0; {317#(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 UNKNOWN [2022-04-27 13:18:47,230 INFO L290 TraceCheckUtils]: 28: Hoare triple {317#(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 !false; {317#(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:18:47,985 INFO L272 TraceCheckUtils]: 29: Hoare triple {317#(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)); {324#(<= 1 |__VERIFIER_assert_#in~cond|)} is VALID [2022-04-27 13:18:47,986 INFO L290 TraceCheckUtils]: 30: Hoare triple {324#(<= 1 |__VERIFIER_assert_#in~cond|)} ~cond := #in~cond; {328#(<= 1 __VERIFIER_assert_~cond)} is VALID [2022-04-27 13:18:47,987 INFO L290 TraceCheckUtils]: 31: Hoare triple {328#(<= 1 __VERIFIER_assert_~cond)} assume 0 == ~cond; {232#false} is VALID [2022-04-27 13:18:47,987 INFO L290 TraceCheckUtils]: 32: Hoare triple {232#false} assume !false; {232#false} is VALID [2022-04-27 13:18:47,987 INFO L134 CoverageAnalysis]: Checked inductivity of 24 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 24 trivial. 0 not checked. [2022-04-27 13:18:47,987 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-04-27 13:18:47,988 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-27 13:18:47,988 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [740826853] [2022-04-27 13:18:47,988 WARN L310 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2022-04-27 13:18:47,988 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1471212170] [2022-04-27 13:18:47,988 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1471212170] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-27 13:18:47,988 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-27 13:18:47,988 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2022-04-27 13:18:47,989 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1482517412] [2022-04-27 13:18:47,989 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-27 13:18:47,990 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, (7), 2 states have call predecessors, (7), 1 states have return successors, (5), 1 states have call predecessors, (5), 1 states have call successors, (5) Word has length 33 [2022-04-27 13:18:47,990 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-27 13:18:47,990 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, (7), 2 states have call predecessors, (7), 1 states have return successors, (5), 1 states have call predecessors, (5), 1 states have call successors, (5) [2022-04-27 13:18:49,142 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 24 edges. 24 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-27 13:18:49,142 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-04-27 13:18:49,142 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-04-27 13:18:49,142 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-04-27 13:18:49,143 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2022-04-27 13:18:49,143 INFO L87 Difference]: Start difference. First operand 27 states and 32 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, (7), 2 states have call predecessors, (7), 1 states have return successors, (5), 1 states have call predecessors, (5), 1 states have call successors, (5) [2022-04-27 13:18:52,292 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:18:52,326 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-27 13:18:52,327 INFO L93 Difference]: Finished difference Result 38 states and 45 transitions. [2022-04-27 13:18:52,327 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-04-27 13:18:52,327 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, (7), 2 states have call predecessors, (7), 1 states have return successors, (5), 1 states have call predecessors, (5), 1 states have call successors, (5) Word has length 33 [2022-04-27 13:18:52,327 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-27 13:18:52,327 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, (7), 2 states have call predecessors, (7), 1 states have return successors, (5), 1 states have call predecessors, (5), 1 states have call successors, (5) [2022-04-27 13:18:52,329 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 45 transitions. [2022-04-27 13:18:52,329 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, (7), 2 states have call predecessors, (7), 1 states have return successors, (5), 1 states have call predecessors, (5), 1 states have call successors, (5) [2022-04-27 13:18:52,330 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 45 transitions. [2022-04-27 13:18:52,331 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 5 states and 45 transitions. [2022-04-27 13:18:53,494 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 45 edges. 45 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-27 13:18:53,495 INFO L225 Difference]: With dead ends: 38 [2022-04-27 13:18:53,495 INFO L226 Difference]: Without dead ends: 36 [2022-04-27 13:18:53,496 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 33 GetRequests, 29 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:18:53,496 INFO L413 NwaCegarLoop]: 26 mSDtfsCounter, 7 mSDsluCounter, 67 mSDsCounter, 0 mSdLazyCounter, 37 mSolverCounterSat, 0 mSolverCounterUnsat, 1 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 3.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 8 SdHoareTripleChecker+Valid, 93 SdHoareTripleChecker+Invalid, 38 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 37 IncrementalHoareTripleChecker+Invalid, 1 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 3.1s IncrementalHoareTripleChecker+Time [2022-04-27 13:18:53,497 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [8 Valid, 93 Invalid, 38 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 37 Invalid, 1 Unknown, 0 Unchecked, 3.1s Time] [2022-04-27 13:18:53,498 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 36 states. [2022-04-27 13:18:53,505 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 36 to 33. [2022-04-27 13:18:53,505 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-27 13:18:53,506 INFO L82 GeneralOperation]: Start isEquivalent. First operand 36 states. Second operand has 33 states, 19 states have (on average 1.1578947368421053) internal successors, (22), 21 states have internal predecessors, (22), 9 states have call successors, (9), 5 states have call predecessors, (9), 4 states have return successors, (7), 6 states have call predecessors, (7), 7 states have call successors, (7) [2022-04-27 13:18:53,506 INFO L74 IsIncluded]: Start isIncluded. First operand 36 states. Second operand has 33 states, 19 states have (on average 1.1578947368421053) internal successors, (22), 21 states have internal predecessors, (22), 9 states have call successors, (9), 5 states have call predecessors, (9), 4 states have return successors, (7), 6 states have call predecessors, (7), 7 states have call successors, (7) [2022-04-27 13:18:53,507 INFO L87 Difference]: Start difference. First operand 36 states. Second operand has 33 states, 19 states have (on average 1.1578947368421053) internal successors, (22), 21 states have internal predecessors, (22), 9 states have call successors, (9), 5 states have call predecessors, (9), 4 states have return successors, (7), 6 states have call predecessors, (7), 7 states have call successors, (7) [2022-04-27 13:18:53,510 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-27 13:18:53,510 INFO L93 Difference]: Finished difference Result 36 states and 43 transitions. [2022-04-27 13:18:53,510 INFO L276 IsEmpty]: Start isEmpty. Operand 36 states and 43 transitions. [2022-04-27 13:18:53,512 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-27 13:18:53,512 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-27 13:18:53,513 INFO L74 IsIncluded]: Start isIncluded. First operand has 33 states, 19 states have (on average 1.1578947368421053) internal successors, (22), 21 states have internal predecessors, (22), 9 states have call successors, (9), 5 states have call predecessors, (9), 4 states have return successors, (7), 6 states have call predecessors, (7), 7 states have call successors, (7) Second operand 36 states. [2022-04-27 13:18:53,514 INFO L87 Difference]: Start difference. First operand has 33 states, 19 states have (on average 1.1578947368421053) internal successors, (22), 21 states have internal predecessors, (22), 9 states have call successors, (9), 5 states have call predecessors, (9), 4 states have return successors, (7), 6 states have call predecessors, (7), 7 states have call successors, (7) Second operand 36 states. [2022-04-27 13:18:53,521 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-27 13:18:53,521 INFO L93 Difference]: Finished difference Result 36 states and 43 transitions. [2022-04-27 13:18:53,521 INFO L276 IsEmpty]: Start isEmpty. Operand 36 states and 43 transitions. [2022-04-27 13:18:53,522 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-27 13:18:53,522 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-27 13:18:53,522 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-27 13:18:53,522 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-27 13:18:53,522 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 33 states, 19 states have (on average 1.1578947368421053) internal successors, (22), 21 states have internal predecessors, (22), 9 states have call successors, (9), 5 states have call predecessors, (9), 4 states have return successors, (7), 6 states have call predecessors, (7), 7 states have call successors, (7) [2022-04-27 13:18:53,523 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 33 states to 33 states and 38 transitions. [2022-04-27 13:18:53,523 INFO L78 Accepts]: Start accepts. Automaton has 33 states and 38 transitions. Word has length 33 [2022-04-27 13:18:53,524 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-27 13:18:53,524 INFO L495 AbstractCegarLoop]: Abstraction has 33 states and 38 transitions. [2022-04-27 13:18:53,524 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, (7), 2 states have call predecessors, (7), 1 states have return successors, (5), 1 states have call predecessors, (5), 1 states have call successors, (5) [2022-04-27 13:18:53,524 INFO L276 IsEmpty]: Start isEmpty. Operand 33 states and 38 transitions. [2022-04-27 13:18:53,528 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 40 [2022-04-27 13:18:53,528 INFO L187 NwaCegarLoop]: Found error trace [2022-04-27 13:18:53,528 INFO L195 NwaCegarLoop]: trace histogram [4, 4, 4, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-27 13:18:53,533 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:18:53,729 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1,2 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-27 13:18:53,729 INFO L420 AbstractCegarLoop]: === Iteration 3 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-27 13:18:53,729 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-27 13:18:53,730 INFO L85 PathProgramCache]: Analyzing trace with hash -453872510, now seen corresponding path program 1 times [2022-04-27 13:18:53,730 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-27 13:18:53,730 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1618794059] [2022-04-27 13:18:53,730 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-27 13:18:53,730 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-27 13:18:53,746 ERROR L245 FreeRefinementEngine]: Caught known exception: Unsupported non-linear arithmetic [2022-04-27 13:18:53,746 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [1486301148] [2022-04-27 13:18:53,747 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-27 13:18:53,747 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-27 13:18:53,747 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-04-27 13:18:53,748 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:18:53,749 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:18:53,781 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-27 13:18:53,782 INFO L263 TraceCheckSpWp]: Trace formula consists of 110 conjuncts, 10 conjunts are in the unsatisfiable core [2022-04-27 13:18:53,790 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-27 13:18:53,791 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-04-27 13:18:53,945 INFO L272 TraceCheckUtils]: 0: Hoare triple {512#true} call ULTIMATE.init(); {512#true} is VALID [2022-04-27 13:18:53,945 INFO L290 TraceCheckUtils]: 1: Hoare triple {512#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); {512#true} is VALID [2022-04-27 13:18:53,945 INFO L290 TraceCheckUtils]: 2: Hoare triple {512#true} assume true; {512#true} is VALID [2022-04-27 13:18:53,945 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {512#true} {512#true} #73#return; {512#true} is VALID [2022-04-27 13:18:53,945 INFO L272 TraceCheckUtils]: 4: Hoare triple {512#true} call #t~ret6 := main(); {512#true} is VALID [2022-04-27 13:18:53,945 INFO L290 TraceCheckUtils]: 5: Hoare triple {512#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; {512#true} is VALID [2022-04-27 13:18:53,945 INFO L272 TraceCheckUtils]: 6: Hoare triple {512#true} call assume_abort_if_not((if ~A~0 >= 0 && ~A~0 <= 20 then 1 else 0)); {512#true} is VALID [2022-04-27 13:18:53,946 INFO L290 TraceCheckUtils]: 7: Hoare triple {512#true} ~cond := #in~cond; {512#true} is VALID [2022-04-27 13:18:53,946 INFO L290 TraceCheckUtils]: 8: Hoare triple {512#true} assume !(0 == ~cond); {512#true} is VALID [2022-04-27 13:18:53,946 INFO L290 TraceCheckUtils]: 9: Hoare triple {512#true} assume true; {512#true} is VALID [2022-04-27 13:18:53,946 INFO L284 TraceCheckUtils]: 10: Hoare quadruple {512#true} {512#true} #61#return; {512#true} is VALID [2022-04-27 13:18:53,946 INFO L290 TraceCheckUtils]: 11: Hoare triple {512#true} assume -2147483648 <= #t~nondet5 && #t~nondet5 <= 2147483647;~R~0 := #t~nondet5;havoc #t~nondet5; {512#true} is VALID [2022-04-27 13:18:53,946 INFO L272 TraceCheckUtils]: 12: Hoare triple {512#true} call assume_abort_if_not((if ~R~0 >= 0 && ~R~0 <= 20 then 1 else 0)); {512#true} is VALID [2022-04-27 13:18:53,946 INFO L290 TraceCheckUtils]: 13: Hoare triple {512#true} ~cond := #in~cond; {512#true} is VALID [2022-04-27 13:18:53,946 INFO L290 TraceCheckUtils]: 14: Hoare triple {512#true} assume !(0 == ~cond); {512#true} is VALID [2022-04-27 13:18:53,946 INFO L290 TraceCheckUtils]: 15: Hoare triple {512#true} assume true; {512#true} is VALID [2022-04-27 13:18:53,947 INFO L284 TraceCheckUtils]: 16: Hoare quadruple {512#true} {512#true} #63#return; {512#true} is VALID [2022-04-27 13:18:53,947 INFO L272 TraceCheckUtils]: 17: Hoare triple {512#true} call assume_abort_if_not((if (~R~0 - 1) * (~R~0 - 1) < ~A~0 then 1 else 0)); {512#true} is VALID [2022-04-27 13:18:53,947 INFO L290 TraceCheckUtils]: 18: Hoare triple {512#true} ~cond := #in~cond; {512#true} is VALID [2022-04-27 13:18:53,947 INFO L290 TraceCheckUtils]: 19: Hoare triple {512#true} assume !(0 == ~cond); {512#true} is VALID [2022-04-27 13:18:53,947 INFO L290 TraceCheckUtils]: 20: Hoare triple {512#true} assume true; {512#true} is VALID [2022-04-27 13:18:53,947 INFO L284 TraceCheckUtils]: 21: Hoare quadruple {512#true} {512#true} #65#return; {512#true} is VALID [2022-04-27 13:18:53,947 INFO L272 TraceCheckUtils]: 22: Hoare triple {512#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)); {512#true} is VALID [2022-04-27 13:18:53,947 INFO L290 TraceCheckUtils]: 23: Hoare triple {512#true} ~cond := #in~cond; {512#true} is VALID [2022-04-27 13:18:53,947 INFO L290 TraceCheckUtils]: 24: Hoare triple {512#true} assume !(0 == ~cond); {512#true} is VALID [2022-04-27 13:18:53,948 INFO L290 TraceCheckUtils]: 25: Hoare triple {512#true} assume true; {512#true} is VALID [2022-04-27 13:18:53,948 INFO L284 TraceCheckUtils]: 26: Hoare quadruple {512#true} {512#true} #67#return; {512#true} is VALID [2022-04-27 13:18:53,948 INFO L290 TraceCheckUtils]: 27: Hoare triple {512#true} ~u~0 := 1 + 2 * ~R~0;~v~0 := 1;~r~0 := ~R~0 * ~R~0 - ~A~0; {512#true} is VALID [2022-04-27 13:18:53,948 INFO L290 TraceCheckUtils]: 28: Hoare triple {512#true} assume !false; {512#true} is VALID [2022-04-27 13:18:53,948 INFO L272 TraceCheckUtils]: 29: Hoare triple {512#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)); {512#true} is VALID [2022-04-27 13:18:53,948 INFO L290 TraceCheckUtils]: 30: Hoare triple {512#true} ~cond := #in~cond; {607#(= |__VERIFIER_assert_#in~cond| __VERIFIER_assert_~cond)} is VALID [2022-04-27 13:18:53,949 INFO L290 TraceCheckUtils]: 31: Hoare triple {607#(= |__VERIFIER_assert_#in~cond| __VERIFIER_assert_~cond)} assume !(0 == ~cond); {611#(not (= |__VERIFIER_assert_#in~cond| 0))} is VALID [2022-04-27 13:18:53,949 INFO L290 TraceCheckUtils]: 32: Hoare triple {611#(not (= |__VERIFIER_assert_#in~cond| 0))} assume true; {611#(not (= |__VERIFIER_assert_#in~cond| 0))} is VALID [2022-04-27 13:18:53,950 INFO L284 TraceCheckUtils]: 33: Hoare quadruple {611#(not (= |__VERIFIER_assert_#in~cond| 0))} {512#true} #69#return; {618#(= (+ (* 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:53,951 INFO L290 TraceCheckUtils]: 34: Hoare triple {618#(= (+ (* 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); {622#(= (+ (* 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:53,951 INFO L272 TraceCheckUtils]: 35: Hoare triple {622#(= (+ (* 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)); {626#(<= 1 |__VERIFIER_assert_#in~cond|)} is VALID [2022-04-27 13:18:53,952 INFO L290 TraceCheckUtils]: 36: Hoare triple {626#(<= 1 |__VERIFIER_assert_#in~cond|)} ~cond := #in~cond; {630#(<= 1 __VERIFIER_assert_~cond)} is VALID [2022-04-27 13:18:53,952 INFO L290 TraceCheckUtils]: 37: Hoare triple {630#(<= 1 __VERIFIER_assert_~cond)} assume 0 == ~cond; {513#false} is VALID [2022-04-27 13:18:53,952 INFO L290 TraceCheckUtils]: 38: Hoare triple {513#false} assume !false; {513#false} is VALID [2022-04-27 13:18:53,952 INFO L134 CoverageAnalysis]: Checked inductivity of 26 backedges. 1 proven. 1 refuted. 0 times theorem prover too weak. 24 trivial. 0 not checked. [2022-04-27 13:18:53,952 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-04-27 13:18:54,317 INFO L290 TraceCheckUtils]: 38: Hoare triple {513#false} assume !false; {513#false} is VALID [2022-04-27 13:18:54,317 INFO L290 TraceCheckUtils]: 37: Hoare triple {630#(<= 1 __VERIFIER_assert_~cond)} assume 0 == ~cond; {513#false} is VALID [2022-04-27 13:18:54,318 INFO L290 TraceCheckUtils]: 36: Hoare triple {626#(<= 1 |__VERIFIER_assert_#in~cond|)} ~cond := #in~cond; {630#(<= 1 __VERIFIER_assert_~cond)} is VALID [2022-04-27 13:18:54,319 INFO L272 TraceCheckUtils]: 35: Hoare triple {622#(= (+ (* 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)); {626#(<= 1 |__VERIFIER_assert_#in~cond|)} is VALID [2022-04-27 13:18:54,324 INFO L290 TraceCheckUtils]: 34: Hoare triple {649#(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); {622#(= (+ (* 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:54,324 INFO L284 TraceCheckUtils]: 33: Hoare quadruple {611#(not (= |__VERIFIER_assert_#in~cond| 0))} {512#true} #69#return; {649#(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:54,325 INFO L290 TraceCheckUtils]: 32: Hoare triple {611#(not (= |__VERIFIER_assert_#in~cond| 0))} assume true; {611#(not (= |__VERIFIER_assert_#in~cond| 0))} is VALID [2022-04-27 13:18:54,325 INFO L290 TraceCheckUtils]: 31: Hoare triple {662#(or (not (= |__VERIFIER_assert_#in~cond| 0)) (= __VERIFIER_assert_~cond 0))} assume !(0 == ~cond); {611#(not (= |__VERIFIER_assert_#in~cond| 0))} is VALID [2022-04-27 13:18:54,325 INFO L290 TraceCheckUtils]: 30: Hoare triple {512#true} ~cond := #in~cond; {662#(or (not (= |__VERIFIER_assert_#in~cond| 0)) (= __VERIFIER_assert_~cond 0))} is VALID [2022-04-27 13:18:54,326 INFO L272 TraceCheckUtils]: 29: Hoare triple {512#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)); {512#true} is VALID [2022-04-27 13:18:54,326 INFO L290 TraceCheckUtils]: 28: Hoare triple {512#true} assume !false; {512#true} is VALID [2022-04-27 13:18:54,326 INFO L290 TraceCheckUtils]: 27: Hoare triple {512#true} ~u~0 := 1 + 2 * ~R~0;~v~0 := 1;~r~0 := ~R~0 * ~R~0 - ~A~0; {512#true} is VALID [2022-04-27 13:18:54,326 INFO L284 TraceCheckUtils]: 26: Hoare quadruple {512#true} {512#true} #67#return; {512#true} is VALID [2022-04-27 13:18:54,326 INFO L290 TraceCheckUtils]: 25: Hoare triple {512#true} assume true; {512#true} is VALID [2022-04-27 13:18:54,326 INFO L290 TraceCheckUtils]: 24: Hoare triple {512#true} assume !(0 == ~cond); {512#true} is VALID [2022-04-27 13:18:54,326 INFO L290 TraceCheckUtils]: 23: Hoare triple {512#true} ~cond := #in~cond; {512#true} is VALID [2022-04-27 13:18:54,326 INFO L272 TraceCheckUtils]: 22: Hoare triple {512#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)); {512#true} is VALID [2022-04-27 13:18:54,326 INFO L284 TraceCheckUtils]: 21: Hoare quadruple {512#true} {512#true} #65#return; {512#true} is VALID [2022-04-27 13:18:54,327 INFO L290 TraceCheckUtils]: 20: Hoare triple {512#true} assume true; {512#true} is VALID [2022-04-27 13:18:54,327 INFO L290 TraceCheckUtils]: 19: Hoare triple {512#true} assume !(0 == ~cond); {512#true} is VALID [2022-04-27 13:18:54,327 INFO L290 TraceCheckUtils]: 18: Hoare triple {512#true} ~cond := #in~cond; {512#true} is VALID [2022-04-27 13:18:54,327 INFO L272 TraceCheckUtils]: 17: Hoare triple {512#true} call assume_abort_if_not((if (~R~0 - 1) * (~R~0 - 1) < ~A~0 then 1 else 0)); {512#true} is VALID [2022-04-27 13:18:54,327 INFO L284 TraceCheckUtils]: 16: Hoare quadruple {512#true} {512#true} #63#return; {512#true} is VALID [2022-04-27 13:18:54,327 INFO L290 TraceCheckUtils]: 15: Hoare triple {512#true} assume true; {512#true} is VALID [2022-04-27 13:18:54,327 INFO L290 TraceCheckUtils]: 14: Hoare triple {512#true} assume !(0 == ~cond); {512#true} is VALID [2022-04-27 13:18:54,327 INFO L290 TraceCheckUtils]: 13: Hoare triple {512#true} ~cond := #in~cond; {512#true} is VALID [2022-04-27 13:18:54,327 INFO L272 TraceCheckUtils]: 12: Hoare triple {512#true} call assume_abort_if_not((if ~R~0 >= 0 && ~R~0 <= 20 then 1 else 0)); {512#true} is VALID [2022-04-27 13:18:54,328 INFO L290 TraceCheckUtils]: 11: Hoare triple {512#true} assume -2147483648 <= #t~nondet5 && #t~nondet5 <= 2147483647;~R~0 := #t~nondet5;havoc #t~nondet5; {512#true} is VALID [2022-04-27 13:18:54,329 INFO L284 TraceCheckUtils]: 10: Hoare quadruple {512#true} {512#true} #61#return; {512#true} is VALID [2022-04-27 13:18:54,330 INFO L290 TraceCheckUtils]: 9: Hoare triple {512#true} assume true; {512#true} is VALID [2022-04-27 13:18:54,332 INFO L290 TraceCheckUtils]: 8: Hoare triple {512#true} assume !(0 == ~cond); {512#true} is VALID [2022-04-27 13:18:54,332 INFO L290 TraceCheckUtils]: 7: Hoare triple {512#true} ~cond := #in~cond; {512#true} is VALID [2022-04-27 13:18:54,332 INFO L272 TraceCheckUtils]: 6: Hoare triple {512#true} call assume_abort_if_not((if ~A~0 >= 0 && ~A~0 <= 20 then 1 else 0)); {512#true} is VALID [2022-04-27 13:18:54,332 INFO L290 TraceCheckUtils]: 5: Hoare triple {512#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; {512#true} is VALID [2022-04-27 13:18:54,333 INFO L272 TraceCheckUtils]: 4: Hoare triple {512#true} call #t~ret6 := main(); {512#true} is VALID [2022-04-27 13:18:54,333 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {512#true} {512#true} #73#return; {512#true} is VALID [2022-04-27 13:18:54,333 INFO L290 TraceCheckUtils]: 2: Hoare triple {512#true} assume true; {512#true} is VALID [2022-04-27 13:18:54,333 INFO L290 TraceCheckUtils]: 1: Hoare triple {512#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); {512#true} is VALID [2022-04-27 13:18:54,333 INFO L272 TraceCheckUtils]: 0: Hoare triple {512#true} call ULTIMATE.init(); {512#true} is VALID [2022-04-27 13:18:54,333 INFO L134 CoverageAnalysis]: Checked inductivity of 26 backedges. 1 proven. 1 refuted. 0 times theorem prover too weak. 24 trivial. 0 not checked. [2022-04-27 13:18:54,333 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-27 13:18:54,334 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1618794059] [2022-04-27 13:18:54,334 WARN L310 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2022-04-27 13:18:54,334 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1486301148] [2022-04-27 13:18:54,334 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1486301148] provided 0 perfect and 2 imperfect interpolant sequences [2022-04-27 13:18:54,334 INFO L184 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2022-04-27 13:18:54,334 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [8, 8] total 10 [2022-04-27 13:18:54,334 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2074448875] [2022-04-27 13:18:54,334 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2022-04-27 13:18:54,335 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, (8), 2 states have call predecessors, (8), 2 states have return successors, (7), 3 states have call predecessors, (7), 1 states have call successors, (7) Word has length 39 [2022-04-27 13:18:54,335 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-27 13:18:54,335 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, (8), 2 states have call predecessors, (8), 2 states have return successors, (7), 3 states have call predecessors, (7), 1 states have call successors, (7) [2022-04-27 13:18:54,358 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 34 edges. 34 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-27 13:18:54,358 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2022-04-27 13:18:54,358 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-04-27 13:18:54,359 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2022-04-27 13:18:54,359 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=23, Invalid=67, Unknown=0, NotChecked=0, Total=90 [2022-04-27 13:18:54,359 INFO L87 Difference]: Start difference. First operand 33 states and 38 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, (8), 2 states have call predecessors, (8), 2 states have return successors, (7), 3 states have call predecessors, (7), 1 states have call successors, (7) [2022-04-27 13:18:54,532 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-27 13:18:54,532 INFO L93 Difference]: Finished difference Result 33 states and 38 transitions. [2022-04-27 13:18:54,532 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2022-04-27 13:18:54,532 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, (8), 2 states have call predecessors, (8), 2 states have return successors, (7), 3 states have call predecessors, (7), 1 states have call successors, (7) Word has length 39 [2022-04-27 13:18:54,532 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-27 13:18:54,533 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, (8), 2 states have call predecessors, (8), 2 states have return successors, (7), 3 states have call predecessors, (7), 1 states have call successors, (7) [2022-04-27 13:18:54,534 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 32 transitions. [2022-04-27 13:18:54,534 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, (8), 2 states have call predecessors, (8), 2 states have return successors, (7), 3 states have call predecessors, (7), 1 states have call successors, (7) [2022-04-27 13:18:54,535 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 32 transitions. [2022-04-27 13:18:54,535 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 6 states and 32 transitions. [2022-04-27 13:18:54,571 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 32 edges. 32 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-27 13:18:54,571 INFO L225 Difference]: With dead ends: 33 [2022-04-27 13:18:54,571 INFO L226 Difference]: Without dead ends: 0 [2022-04-27 13:18:54,572 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 79 GetRequests, 68 SyntacticMatches, 1 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 8 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=35, Invalid=97, Unknown=0, NotChecked=0, Total=132 [2022-04-27 13:18:54,572 INFO L413 NwaCegarLoop]: 23 mSDtfsCounter, 16 mSDsluCounter, 56 mSDsCounter, 0 mSdLazyCounter, 34 mSolverCounterSat, 11 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 16 SdHoareTripleChecker+Valid, 79 SdHoareTripleChecker+Invalid, 45 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 11 IncrementalHoareTripleChecker+Valid, 34 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-04-27 13:18:54,572 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [16 Valid, 79 Invalid, 45 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [11 Valid, 34 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-04-27 13:18:54,573 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 0 states. [2022-04-27 13:18:54,573 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 0 to 0. [2022-04-27 13:18:54,573 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-27 13:18:54,573 INFO L82 GeneralOperation]: Start isEquivalent. First operand 0 states. Second operand has 0 states, 0 states have (on average 0.0) internal successors, (0), 0 states have internal predecessors, (0), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-04-27 13:18:54,573 INFO L74 IsIncluded]: Start isIncluded. First operand 0 states. Second operand has 0 states, 0 states have (on average 0.0) internal successors, (0), 0 states have internal predecessors, (0), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-04-27 13:18:54,573 INFO L87 Difference]: Start difference. First operand 0 states. Second operand has 0 states, 0 states have (on average 0.0) internal successors, (0), 0 states have internal predecessors, (0), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-04-27 13:18:54,573 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-27 13:18:54,573 INFO L93 Difference]: Finished difference Result 0 states and 0 transitions. [2022-04-27 13:18:54,574 INFO L276 IsEmpty]: Start isEmpty. Operand 0 states and 0 transitions. [2022-04-27 13:18:54,574 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-27 13:18:54,574 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-27 13:18:54,574 INFO L74 IsIncluded]: Start isIncluded. First operand has 0 states, 0 states have (on average 0.0) internal successors, (0), 0 states have internal predecessors, (0), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Second operand 0 states. [2022-04-27 13:18:54,574 INFO L87 Difference]: Start difference. First operand has 0 states, 0 states have (on average 0.0) internal successors, (0), 0 states have internal predecessors, (0), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Second operand 0 states. [2022-04-27 13:18:54,574 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-27 13:18:54,574 INFO L93 Difference]: Finished difference Result 0 states and 0 transitions. [2022-04-27 13:18:54,574 INFO L276 IsEmpty]: Start isEmpty. Operand 0 states and 0 transitions. [2022-04-27 13:18:54,574 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-27 13:18:54,574 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-27 13:18:54,574 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-27 13:18:54,574 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-27 13:18:54,574 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 0 states, 0 states have (on average 0.0) internal successors, (0), 0 states have internal predecessors, (0), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-04-27 13:18:54,574 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 0 states to 0 states and 0 transitions. [2022-04-27 13:18:54,574 INFO L78 Accepts]: Start accepts. Automaton has 0 states and 0 transitions. Word has length 39 [2022-04-27 13:18:54,575 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-27 13:18:54,575 INFO L495 AbstractCegarLoop]: Abstraction has 0 states and 0 transitions. [2022-04-27 13:18:54,575 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, (8), 2 states have call predecessors, (8), 2 states have return successors, (7), 3 states have call predecessors, (7), 1 states have call successors, (7) [2022-04-27 13:18:54,575 INFO L276 IsEmpty]: Start isEmpty. Operand 0 states and 0 transitions. [2022-04-27 13:18:54,575 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-27 13:18:54,578 INFO L805 garLoopResultBuilder]: Registering result SAFE for location __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION (0 of 1 remaining) [2022-04-27 13:18:54,595 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:18:54,787 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,SelfDestructingSolverStorable2 [2022-04-27 13:18:54,789 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends 0 states and 0 transitions. [2022-04-27 13:18:54,852 INFO L899 garLoopResultBuilder]: For program point reach_errorEXIT(line 5) no Hoare annotation was computed. [2022-04-27 13:18:54,852 INFO L899 garLoopResultBuilder]: For program point reach_errorENTRY(line 5) no Hoare annotation was computed. [2022-04-27 13:18:54,852 INFO L899 garLoopResultBuilder]: For program point reach_errorFINAL(line 5) no Hoare annotation was computed. [2022-04-27 13:18:54,852 INFO L902 garLoopResultBuilder]: At program point assume_abort_if_notENTRY(lines 8 10) the Hoare annotation is: true [2022-04-27 13:18:54,852 INFO L899 garLoopResultBuilder]: For program point L9(line 9) no Hoare annotation was computed. [2022-04-27 13:18:54,852 INFO L899 garLoopResultBuilder]: For program point L9-2(lines 8 10) no Hoare annotation was computed. [2022-04-27 13:18:54,852 INFO L899 garLoopResultBuilder]: For program point assume_abort_if_notEXIT(lines 8 10) no Hoare annotation was computed. [2022-04-27 13:18:54,852 INFO L895 garLoopResultBuilder]: At program point L35-2(lines 35 46) the Hoare annotation is: (let ((.cse0 (+ (* main_~v~0 2) (* main_~u~0 main_~u~0))) (.cse1 (* main_~v~0 main_~v~0)) (.cse2 (* main_~u~0 2)) (.cse3 (* main_~A~0 4))) (and (= .cse0 (+ .cse1 .cse2 .cse3 (* main_~r~0 4))) (= .cse0 (+ .cse1 .cse2 .cse3)))) [2022-04-27 13:18:54,852 INFO L899 garLoopResultBuilder]: For program point L29(line 29) no Hoare annotation was computed. [2022-04-27 13:18:54,852 INFO L902 garLoopResultBuilder]: At program point L27(line 27) the Hoare annotation is: true [2022-04-27 13:18:54,853 INFO L902 garLoopResultBuilder]: At program point L25(line 25) the Hoare annotation is: true [2022-04-27 13:18:54,853 INFO L899 garLoopResultBuilder]: For program point mainEXIT(lines 19 51) no Hoare annotation was computed. [2022-04-27 13:18:54,853 INFO L902 garLoopResultBuilder]: At program point L25-1(line 25) the Hoare annotation is: true [2022-04-27 13:18:54,853 INFO L902 garLoopResultBuilder]: At program point L23(line 23) the Hoare annotation is: true [2022-04-27 13:18:54,853 INFO L899 garLoopResultBuilder]: For program point L23-1(line 23) no Hoare annotation was computed. [2022-04-27 13:18:54,853 INFO L899 garLoopResultBuilder]: For program point mainFINAL(lines 19 51) no Hoare annotation was computed. [2022-04-27 13:18:54,853 INFO L895 garLoopResultBuilder]: At program point L36(line 36) the Hoare annotation is: (= (+ (* 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))) [2022-04-27 13:18:54,853 INFO L899 garLoopResultBuilder]: For program point L36-1(lines 35 46) no Hoare annotation was computed. [2022-04-27 13:18:54,853 INFO L902 garLoopResultBuilder]: At program point mainENTRY(lines 19 51) the Hoare annotation is: true [2022-04-27 13:18:54,853 INFO L899 garLoopResultBuilder]: For program point L49(line 49) no Hoare annotation was computed. [2022-04-27 13:18:54,853 INFO L899 garLoopResultBuilder]: For program point L39(lines 39 45) no Hoare annotation was computed. [2022-04-27 13:18:54,853 INFO L895 garLoopResultBuilder]: At program point L39-2(lines 35 46) the Hoare annotation is: (= (+ (* 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))) [2022-04-27 13:18:54,853 INFO L899 garLoopResultBuilder]: For program point ULTIMATE.initFINAL(line -1) no Hoare annotation was computed. [2022-04-27 13:18:54,853 INFO L895 garLoopResultBuilder]: At program point ULTIMATE.initENTRY(line -1) the Hoare annotation is: (and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|)) [2022-04-27 13:18:54,854 INFO L899 garLoopResultBuilder]: For program point ULTIMATE.initEXIT(line -1) no Hoare annotation was computed. [2022-04-27 13:18:54,854 INFO L899 garLoopResultBuilder]: For program point ULTIMATE.startEXIT(line -1) no Hoare annotation was computed. [2022-04-27 13:18:54,854 INFO L902 garLoopResultBuilder]: At program point L-1(line -1) the Hoare annotation is: true [2022-04-27 13:18:54,854 INFO L902 garLoopResultBuilder]: At program point ULTIMATE.startENTRY(line -1) the Hoare annotation is: true [2022-04-27 13:18:54,854 INFO L899 garLoopResultBuilder]: For program point ULTIMATE.startFINAL(line -1) no Hoare annotation was computed. [2022-04-27 13:18:54,854 INFO L902 garLoopResultBuilder]: At program point __VERIFIER_assertENTRY(lines 11 17) the Hoare annotation is: true [2022-04-27 13:18:54,854 INFO L899 garLoopResultBuilder]: For program point L13(lines 13 14) no Hoare annotation was computed. [2022-04-27 13:18:54,854 INFO L899 garLoopResultBuilder]: For program point L12(lines 12 15) no Hoare annotation was computed. [2022-04-27 13:18:54,854 INFO L899 garLoopResultBuilder]: For program point L12-2(lines 11 17) no Hoare annotation was computed. [2022-04-27 13:18:54,854 INFO L899 garLoopResultBuilder]: For program point __VERIFIER_assertEXIT(lines 11 17) no Hoare annotation was computed. [2022-04-27 13:18:54,854 INFO L899 garLoopResultBuilder]: For program point __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION(line 14) no Hoare annotation was computed. [2022-04-27 13:18:54,856 INFO L356 BasicCegarLoop]: Path program histogram: [1, 1, 1] [2022-04-27 13:18:54,857 INFO L176 ceAbstractionStarter]: Computing trace abstraction results [2022-04-27 13:18:54,859 WARN L170 areAnnotationChecker]: reach_errorENTRY has no Hoare annotation [2022-04-27 13:18:54,860 WARN L170 areAnnotationChecker]: ULTIMATE.initFINAL has no Hoare annotation [2022-04-27 13:18:54,892 WARN L170 areAnnotationChecker]: L9 has no Hoare annotation [2022-04-27 13:18:54,892 WARN L170 areAnnotationChecker]: L12 has no Hoare annotation [2022-04-27 13:18:54,892 WARN L170 areAnnotationChecker]: reach_errorFINAL has no Hoare annotation [2022-04-27 13:18:54,892 WARN L170 areAnnotationChecker]: ULTIMATE.initFINAL has no Hoare annotation [2022-04-27 13:18:54,892 WARN L170 areAnnotationChecker]: ULTIMATE.startFINAL has no Hoare annotation [2022-04-27 13:18:54,892 WARN L170 areAnnotationChecker]: L9 has no Hoare annotation [2022-04-27 13:18:54,892 WARN L170 areAnnotationChecker]: L9 has no Hoare annotation [2022-04-27 13:18:54,892 WARN L170 areAnnotationChecker]: L23-1 has no Hoare annotation [2022-04-27 13:18:54,892 WARN L170 areAnnotationChecker]: L12 has no Hoare annotation [2022-04-27 13:18:54,892 WARN L170 areAnnotationChecker]: L12 has no Hoare annotation [2022-04-27 13:18:54,892 WARN L170 areAnnotationChecker]: ULTIMATE.initEXIT has no Hoare annotation [2022-04-27 13:18:54,892 WARN L170 areAnnotationChecker]: ULTIMATE.startFINAL has no Hoare annotation [2022-04-27 13:18:54,892 WARN L170 areAnnotationChecker]: L9-2 has no Hoare annotation [2022-04-27 13:18:54,892 WARN L170 areAnnotationChecker]: L23-1 has no Hoare annotation [2022-04-27 13:18:54,892 WARN L170 areAnnotationChecker]: L13 has no Hoare annotation [2022-04-27 13:18:54,893 WARN L170 areAnnotationChecker]: L13 has no Hoare annotation [2022-04-27 13:18:54,893 WARN L170 areAnnotationChecker]: L12-2 has no Hoare annotation [2022-04-27 13:18:54,893 WARN L170 areAnnotationChecker]: assume_abort_if_notEXIT has no Hoare annotation [2022-04-27 13:18:54,893 WARN L170 areAnnotationChecker]: assume_abort_if_notEXIT has no Hoare annotation [2022-04-27 13:18:54,893 WARN L170 areAnnotationChecker]: assume_abort_if_notEXIT has no Hoare annotation [2022-04-27 13:18:54,893 WARN L170 areAnnotationChecker]: assume_abort_if_notEXIT has no Hoare annotation [2022-04-27 13:18:54,893 WARN L170 areAnnotationChecker]: __VERIFIER_assertEXIT has no Hoare annotation [2022-04-27 13:18:54,893 WARN L170 areAnnotationChecker]: __VERIFIER_assertEXIT has no Hoare annotation [2022-04-27 13:18:54,893 WARN L170 areAnnotationChecker]: L29 has no Hoare annotation [2022-04-27 13:18:54,893 WARN L170 areAnnotationChecker]: L29 has no Hoare annotation [2022-04-27 13:18:54,893 WARN L170 areAnnotationChecker]: L36-1 has no Hoare annotation [2022-04-27 13:18:54,893 WARN L170 areAnnotationChecker]: L36-1 has no Hoare annotation [2022-04-27 13:18:54,893 WARN L170 areAnnotationChecker]: L49 has no Hoare annotation [2022-04-27 13:18:54,896 WARN L170 areAnnotationChecker]: L49 has no Hoare annotation [2022-04-27 13:18:54,896 WARN L170 areAnnotationChecker]: L39 has no Hoare annotation [2022-04-27 13:18:54,896 WARN L170 areAnnotationChecker]: L39 has no Hoare annotation [2022-04-27 13:18:54,896 WARN L170 areAnnotationChecker]: mainFINAL has no Hoare annotation [2022-04-27 13:18:54,896 WARN L170 areAnnotationChecker]: L36-1 has no Hoare annotation [2022-04-27 13:18:54,896 WARN L170 areAnnotationChecker]: mainEXIT has no Hoare annotation [2022-04-27 13:18:54,896 INFO L163 areAnnotationChecker]: CFG has 12 edges. 12 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. 0 times interpolants missing. [2022-04-27 13:18:54,902 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 27.04 01:18:54 BoogieIcfgContainer [2022-04-27 13:18:54,902 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2022-04-27 13:18:54,904 INFO L158 Benchmark]: Toolchain (without parser) took 11305.67ms. Allocated memory was 182.5MB in the beginning and 219.2MB in the end (delta: 36.7MB). Free memory was 132.6MB in the beginning and 164.0MB in the end (delta: -31.4MB). Peak memory consumption was 6.8MB. Max. memory is 8.0GB. [2022-04-27 13:18:54,904 INFO L158 Benchmark]: CDTParser took 0.29ms. Allocated memory is still 182.5MB. Free memory was 148.9MB in the beginning and 148.8MB in the end (delta: 150.5kB). There was no memory consumed. Max. memory is 8.0GB. [2022-04-27 13:18:54,905 INFO L158 Benchmark]: CACSL2BoogieTranslator took 188.66ms. Allocated memory is still 182.5MB. Free memory was 132.3MB in the beginning and 157.2MB in the end (delta: -24.9MB). Peak memory consumption was 12.3MB. Max. memory is 8.0GB. [2022-04-27 13:18:54,905 INFO L158 Benchmark]: Boogie Preprocessor took 17.57ms. Allocated memory is still 182.5MB. Free memory was 157.2MB in the beginning and 155.9MB in the end (delta: 1.3MB). Peak memory consumption was 2.1MB. Max. memory is 8.0GB. [2022-04-27 13:18:54,905 INFO L158 Benchmark]: RCFGBuilder took 238.50ms. Allocated memory is still 182.5MB. Free memory was 155.9MB in the beginning and 144.0MB in the end (delta: 11.9MB). Peak memory consumption was 11.5MB. Max. memory is 8.0GB. [2022-04-27 13:18:54,905 INFO L158 Benchmark]: TraceAbstraction took 10855.48ms. Allocated memory was 182.5MB in the beginning and 219.2MB in the end (delta: 36.7MB). Free memory was 143.6MB in the beginning and 164.0MB in the end (delta: -20.4MB). Peak memory consumption was 17.6MB. Max. memory is 8.0GB. [2022-04-27 13:18:54,906 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.29ms. Allocated memory is still 182.5MB. Free memory was 148.9MB in the beginning and 148.8MB in the end (delta: 150.5kB). There was no memory consumed. Max. memory is 8.0GB. * CACSL2BoogieTranslator took 188.66ms. Allocated memory is still 182.5MB. Free memory was 132.3MB in the beginning and 157.2MB in the end (delta: -24.9MB). Peak memory consumption was 12.3MB. Max. memory is 8.0GB. * Boogie Preprocessor took 17.57ms. Allocated memory is still 182.5MB. Free memory was 157.2MB in the beginning and 155.9MB in the end (delta: 1.3MB). Peak memory consumption was 2.1MB. Max. memory is 8.0GB. * RCFGBuilder took 238.50ms. Allocated memory is still 182.5MB. Free memory was 155.9MB in the beginning and 144.0MB in the end (delta: 11.9MB). Peak memory consumption was 11.5MB. Max. memory is 8.0GB. * TraceAbstraction took 10855.48ms. Allocated memory was 182.5MB in the beginning and 219.2MB in the end (delta: 36.7MB). Free memory was 143.6MB in the beginning and 164.0MB in the end (delta: -20.4MB). Peak memory consumption was 17.6MB. 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 - PositiveResult [Line: 14]: call to reach_error is unreachable For all program executions holds that call to reach_error is unreachable at this location - StatisticsResult: Ultimate Automizer benchmark data CFG has 6 procedures, 35 locations, 1 error locations. Started 1 CEGAR loops. OverallTime: 10.8s, OverallIterations: 3, TraceHistogramMax: 4, PathProgramHistogramMax: 1, EmptinessCheckTime: 0.0s, AutomataDifference: 4.8s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.1s, InitialAbstractionConstructionTime: 0.0s, HoareTripleCheckerStatistics: 1 mSolverCounterUnknown, 48 SdHoareTripleChecker+Valid, 3.2s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 41 mSDsluCounter, 206 SdHoareTripleChecker+Invalid, 3.2s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 126 mSDsCounter, 18 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 79 IncrementalHoareTripleChecker+Invalid, 98 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 18 mSolverCounterUnsat, 80 mSDtfsCounter, 79 mSolverCounterSat, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 128 GetRequests, 112 SyntacticMatches, 1 SemanticMatches, 15 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 8 ImplicationChecksByTransitivity, 0.1s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=33occurred in iteration=2, InterpolantAutomatonStates: 14, 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, 3 MinimizatonAttempts, 3 StatesRemovedByMinimization, 1 NontrivialMinimizations, HoareAnnotationStatistics: 0.0s HoareAnnotationTime, 13 LocationsWithAnnotation, 23 PreInvPairs, 31 NumberOfFragments, 98 HoareAnnotationTreeSize, 23 FomulaSimplifications, 0 FormulaSimplificationTreeSizeReduction, 0.0s HoareSimplificationTime, 13 FomulaSimplificationsInter, 108 FormulaSimplificationTreeSizeReductionInter, 0.0s HoareSimplificationTimeInter, RefinementEngineStatistics: TRACE_CHECK: 0.0s SsaConstructionTime, 0.1s SatisfiabilityAnalysisTime, 3.9s InterpolantComputationTime, 105 NumberOfCodeBlocks, 105 NumberOfCodeBlocksAsserted, 3 NumberOfCheckSat, 140 ConstructedInterpolants, 0 QuantifiedInterpolants, 317 SizeOfPredicates, 9 NumberOfNonLiveVariables, 209 ConjunctsInSsa, 21 ConjunctsInUnsatCore, 4 InterpolantComputations, 2 PerfectInterpolantSequences, 98/100 InterpolantCoveringCapability, INVARIANT_SYNTHESIS: No data available, INTERPOLANT_CONSOLIDATION: No data available, ABSTRACT_INTERPRETATION: No data available, PDR: No data available, ACCELERATED_INTERPOLATION: No data available, SIFA: No data available, ReuseStatistics: No data available - AllSpecificationsHoldResult: All specifications hold 1 specifications checked. All of them hold - InvariantResult [Line: 35]: Loop Invariant Derived loop invariant: v * 2 + u * u == v * v + u * 2 + A * 4 + r * 4 RESULT: Ultimate proved your program to be correct! [2022-04-27 13:18:54,926 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...