/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_unwindbound5.c -------------------------------------------------------------------------------- This is Ultimate 0.2.2-dev-e106359-m [2022-04-14 16:16:39,698 INFO L177 SettingsManager]: Resetting all preferences to default values... [2022-04-14 16:16:39,721 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2022-04-14 16:16:39,748 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2022-04-14 16:16:39,749 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2022-04-14 16:16:39,750 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2022-04-14 16:16:39,752 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2022-04-14 16:16:39,756 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2022-04-14 16:16:39,757 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2022-04-14 16:16:39,760 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2022-04-14 16:16:39,761 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2022-04-14 16:16:39,762 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2022-04-14 16:16:39,762 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2022-04-14 16:16:39,764 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2022-04-14 16:16:39,765 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2022-04-14 16:16:39,767 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2022-04-14 16:16:39,767 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2022-04-14 16:16:39,768 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2022-04-14 16:16:39,769 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2022-04-14 16:16:39,773 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2022-04-14 16:16:39,774 INFO L181 SettingsManager]: Resetting HornVerifier preferences to default values [2022-04-14 16:16:39,775 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2022-04-14 16:16:39,776 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2022-04-14 16:16:39,776 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2022-04-14 16:16:39,777 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2022-04-14 16:16:39,781 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2022-04-14 16:16:39,782 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2022-04-14 16:16:39,782 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2022-04-14 16:16:39,783 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2022-04-14 16:16:39,783 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2022-04-14 16:16:39,784 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2022-04-14 16:16:39,784 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2022-04-14 16:16:39,785 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2022-04-14 16:16:39,786 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2022-04-14 16:16:39,786 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2022-04-14 16:16:39,787 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2022-04-14 16:16:39,787 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2022-04-14 16:16:39,787 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2022-04-14 16:16:39,787 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2022-04-14 16:16:39,787 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2022-04-14 16:16:39,788 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2022-04-14 16:16:39,789 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2022-04-14 16:16:39,790 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-14 16:16:39,813 INFO L113 SettingsManager]: Loading preferences was successful [2022-04-14 16:16:39,814 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2022-04-14 16:16:39,814 INFO L136 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2022-04-14 16:16:39,814 INFO L138 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2022-04-14 16:16:39,814 INFO L136 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2022-04-14 16:16:39,814 INFO L138 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2022-04-14 16:16:39,815 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2022-04-14 16:16:39,815 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2022-04-14 16:16:39,815 INFO L138 SettingsManager]: * Use SBE=true [2022-04-14 16:16:39,815 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2022-04-14 16:16:39,815 INFO L138 SettingsManager]: * sizeof long=4 [2022-04-14 16:16:39,815 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2022-04-14 16:16:39,815 INFO L138 SettingsManager]: * sizeof POINTER=4 [2022-04-14 16:16:39,816 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2022-04-14 16:16:39,816 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2022-04-14 16:16:39,816 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2022-04-14 16:16:39,816 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2022-04-14 16:16:39,816 INFO L138 SettingsManager]: * sizeof long double=12 [2022-04-14 16:16:39,816 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2022-04-14 16:16:39,816 INFO L138 SettingsManager]: * Use constant arrays=true [2022-04-14 16:16:39,816 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2022-04-14 16:16:39,816 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2022-04-14 16:16:39,817 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2022-04-14 16:16:39,817 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2022-04-14 16:16:39,817 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-04-14 16:16:39,817 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2022-04-14 16:16:39,817 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2022-04-14 16:16:39,817 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2022-04-14 16:16:39,817 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2022-04-14 16:16:39,817 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2022-04-14 16:16:39,817 INFO L138 SettingsManager]: * Large block encoding in concurrent analysis=OFF [2022-04-14 16:16:39,817 INFO L138 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2022-04-14 16:16:39,818 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2022-04-14 16:16:39,818 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-14 16:16:40,001 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2022-04-14 16:16:40,018 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2022-04-14 16:16:40,019 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2022-04-14 16:16:40,020 INFO L271 PluginConnector]: Initializing CDTParser... [2022-04-14 16:16:40,020 INFO L275 PluginConnector]: CDTParser initialized [2022-04-14 16:16:40,021 INFO L432 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/nla-digbench-scaling/fermat2-ll_unwindbound5.c [2022-04-14 16:16:40,067 INFO L220 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/39937e851/a221c30e3c74472aa3ea6d72f51791ad/FLAG7cb2c8766 [2022-04-14 16:16:40,426 INFO L306 CDTParser]: Found 1 translation units. [2022-04-14 16:16:40,426 INFO L160 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/nla-digbench-scaling/fermat2-ll_unwindbound5.c [2022-04-14 16:16:40,432 INFO L349 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/39937e851/a221c30e3c74472aa3ea6d72f51791ad/FLAG7cb2c8766 [2022-04-14 16:16:40,441 INFO L357 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/39937e851/a221c30e3c74472aa3ea6d72f51791ad [2022-04-14 16:16:40,443 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2022-04-14 16:16:40,444 INFO L131 ToolchainWalker]: Walking toolchain with 4 elements. [2022-04-14 16:16:40,446 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2022-04-14 16:16:40,446 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2022-04-14 16:16:40,448 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2022-04-14 16:16:40,449 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 14.04 04:16:40" (1/1) ... [2022-04-14 16:16:40,449 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@71d9dfc1 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.04 04:16:40, skipping insertion in model container [2022-04-14 16:16:40,450 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 14.04 04:16:40" (1/1) ... [2022-04-14 16:16:40,453 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2022-04-14 16:16:40,464 INFO L178 MainTranslator]: Built tables and reachable declarations [2022-04-14 16:16:40,618 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_unwindbound5.c[524,537] [2022-04-14 16:16:40,640 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-04-14 16:16:40,648 INFO L203 MainTranslator]: Completed pre-run [2022-04-14 16:16:40,658 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_unwindbound5.c[524,537] [2022-04-14 16:16:40,677 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-04-14 16:16:40,685 INFO L208 MainTranslator]: Completed translation [2022-04-14 16:16:40,685 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.04 04:16:40 WrapperNode [2022-04-14 16:16:40,685 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2022-04-14 16:16:40,686 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2022-04-14 16:16:40,686 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2022-04-14 16:16:40,686 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2022-04-14 16:16:40,693 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.04 04:16:40" (1/1) ... [2022-04-14 16:16:40,694 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.04 04:16:40" (1/1) ... [2022-04-14 16:16:40,699 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.04 04:16:40" (1/1) ... [2022-04-14 16:16:40,699 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.04 04:16:40" (1/1) ... [2022-04-14 16:16:40,709 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.04 04:16:40" (1/1) ... [2022-04-14 16:16:40,713 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.04 04:16:40" (1/1) ... [2022-04-14 16:16:40,716 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.04 04:16:40" (1/1) ... [2022-04-14 16:16:40,718 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2022-04-14 16:16:40,718 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2022-04-14 16:16:40,718 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2022-04-14 16:16:40,719 INFO L275 PluginConnector]: RCFGBuilder initialized [2022-04-14 16:16:40,719 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.04 04:16:40" (1/1) ... [2022-04-14 16:16:40,724 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-04-14 16:16:40,731 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-04-14 16:16:40,739 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-14 16:16:40,748 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-14 16:16:40,765 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.init [2022-04-14 16:16:40,765 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2022-04-14 16:16:40,765 INFO L138 BoogieDeclarations]: Found implementation of procedure reach_error [2022-04-14 16:16:40,766 INFO L138 BoogieDeclarations]: Found implementation of procedure assume_abort_if_not [2022-04-14 16:16:40,766 INFO L138 BoogieDeclarations]: Found implementation of procedure __VERIFIER_assert [2022-04-14 16:16:40,766 INFO L138 BoogieDeclarations]: Found implementation of procedure main [2022-04-14 16:16:40,766 INFO L130 BoogieDeclarations]: Found specification of procedure abort [2022-04-14 16:16:40,766 INFO L130 BoogieDeclarations]: Found specification of procedure __assert_fail [2022-04-14 16:16:40,766 INFO L130 BoogieDeclarations]: Found specification of procedure reach_error [2022-04-14 16:16:40,767 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2022-04-14 16:16:40,767 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_nondet_int [2022-04-14 16:16:40,767 INFO L130 BoogieDeclarations]: Found specification of procedure assume_abort_if_not [2022-04-14 16:16:40,767 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_assert [2022-04-14 16:16:40,767 INFO L130 BoogieDeclarations]: Found specification of procedure main [2022-04-14 16:16:40,767 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.init [2022-04-14 16:16:40,767 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2022-04-14 16:16:40,767 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2022-04-14 16:16:40,767 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2022-04-14 16:16:40,767 INFO L130 BoogieDeclarations]: Found specification of procedure read~int [2022-04-14 16:16:40,767 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2022-04-14 16:16:40,811 INFO L234 CfgBuilder]: Building ICFG [2022-04-14 16:16:40,812 INFO L260 CfgBuilder]: Building CFG for each procedure with an implementation [2022-04-14 16:16:40,910 INFO L275 CfgBuilder]: Performing block encoding [2022-04-14 16:16:40,914 INFO L294 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2022-04-14 16:16:40,915 INFO L299 CfgBuilder]: Removed 1 assume(true) statements. [2022-04-14 16:16:40,916 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 14.04 04:16:40 BoogieIcfgContainer [2022-04-14 16:16:40,916 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2022-04-14 16:16:40,917 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2022-04-14 16:16:40,917 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2022-04-14 16:16:40,919 INFO L275 PluginConnector]: TraceAbstraction initialized [2022-04-14 16:16:40,919 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 14.04 04:16:40" (1/3) ... [2022-04-14 16:16:40,919 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@49c5750a and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 14.04 04:16:40, skipping insertion in model container [2022-04-14 16:16:40,920 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.04 04:16:40" (2/3) ... [2022-04-14 16:16:40,920 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@49c5750a and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 14.04 04:16:40, skipping insertion in model container [2022-04-14 16:16:40,920 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 14.04 04:16:40" (3/3) ... [2022-04-14 16:16:40,921 INFO L111 eAbstractionObserver]: Analyzing ICFG fermat2-ll_unwindbound5.c [2022-04-14 16:16:40,924 INFO L202 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2022-04-14 16:16:40,924 INFO L161 ceAbstractionStarter]: Applying trace abstraction to program that has 1 error locations. [2022-04-14 16:16:40,953 INFO L339 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2022-04-14 16:16:40,957 INFO L340 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 [2022-04-14 16:16:40,957 INFO L341 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2022-04-14 16:16:40,969 INFO L276 IsEmpty]: Start isEmpty. Operand has 30 states, 18 states have (on average 1.3888888888888888) internal successors, (25), 19 states have internal predecessors, (25), 6 states have call successors, (6), 4 states have call predecessors, (6), 4 states have return successors, (6), 6 states have call predecessors, (6), 6 states have call successors, (6) [2022-04-14 16:16:40,972 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2022-04-14 16:16:40,972 INFO L491 BasicCegarLoop]: Found error trace [2022-04-14 16:16:40,973 INFO L499 BasicCegarLoop]: trace histogram [2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-14 16:16:40,973 INFO L403 AbstractCegarLoop]: === Iteration 1 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-14 16:16:40,976 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-14 16:16:40,976 INFO L85 PathProgramCache]: Analyzing trace with hash -1859024204, now seen corresponding path program 1 times [2022-04-14 16:16:40,982 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-14 16:16:40,982 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [3512726] [2022-04-14 16:16:40,982 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-14 16:16:40,983 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-14 16:16:41,049 ERROR L245 FreeRefinementEngine]: Caught known exception: Unsupported non-linear arithmetic [2022-04-14 16:16:41,050 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [1048630747] [2022-04-14 16:16:41,050 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-14 16:16:41,050 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-14 16:16:41,050 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-04-14 16:16:41,051 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-14 16:16:41,057 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-14 16:16:41,135 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-14 16:16:41,137 INFO L263 TraceCheckSpWp]: Trace formula consists of 89 conjuncts, 1 conjunts are in the unsatisfiable core [2022-04-14 16:16:41,149 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-14 16:16:41,152 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-04-14 16:16:41,240 INFO L272 TraceCheckUtils]: 0: Hoare triple {33#true} call ULTIMATE.init(); {33#true} is VALID [2022-04-14 16:16:41,241 INFO L290 TraceCheckUtils]: 1: Hoare triple {33#true} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(13, 2);call #Ultimate.allocInit(12, 3);~counter~0 := 0; {33#true} is VALID [2022-04-14 16:16:41,241 INFO L290 TraceCheckUtils]: 2: Hoare triple {33#true} assume true; {33#true} is VALID [2022-04-14 16:16:41,241 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {33#true} {33#true} #67#return; {33#true} is VALID [2022-04-14 16:16:41,242 INFO L272 TraceCheckUtils]: 4: Hoare triple {33#true} call #t~ret7 := main(); {33#true} is VALID [2022-04-14 16:16:41,242 INFO L290 TraceCheckUtils]: 5: Hoare triple {33#true} havoc ~A~0;havoc ~R~0;havoc ~u~0;havoc ~v~0;havoc ~r~0;assume -2147483648 <= #t~nondet4 && #t~nondet4 <= 2147483647;~A~0 := #t~nondet4;havoc #t~nondet4;assume -2147483648 <= #t~nondet5 && #t~nondet5 <= 2147483647;~R~0 := #t~nondet5;havoc #t~nondet5; {33#true} is VALID [2022-04-14 16:16:41,242 INFO L272 TraceCheckUtils]: 6: Hoare triple {33#true} call assume_abort_if_not((if (~R~0 - 1) * (~R~0 - 1) < ~A~0 then 1 else 0)); {33#true} is VALID [2022-04-14 16:16:41,245 INFO L290 TraceCheckUtils]: 7: Hoare triple {33#true} ~cond := #in~cond; {33#true} is VALID [2022-04-14 16:16:41,246 INFO L290 TraceCheckUtils]: 8: Hoare triple {33#true} assume 0 == ~cond;assume false; {34#false} is VALID [2022-04-14 16:16:41,246 INFO L290 TraceCheckUtils]: 9: Hoare triple {34#false} assume true; {34#false} is VALID [2022-04-14 16:16:41,246 INFO L284 TraceCheckUtils]: 10: Hoare quadruple {34#false} {33#true} #59#return; {34#false} is VALID [2022-04-14 16:16:41,247 INFO L272 TraceCheckUtils]: 11: Hoare triple {34#false} call assume_abort_if_not((if 1 == (if ~A~0 < 0 && 0 != ~A~0 % 2 then ~A~0 % 2 - 2 else ~A~0 % 2) then 1 else 0)); {34#false} is VALID [2022-04-14 16:16:41,247 INFO L290 TraceCheckUtils]: 12: Hoare triple {34#false} ~cond := #in~cond; {34#false} is VALID [2022-04-14 16:16:41,247 INFO L290 TraceCheckUtils]: 13: Hoare triple {34#false} assume 0 == ~cond;assume false; {34#false} is VALID [2022-04-14 16:16:41,247 INFO L290 TraceCheckUtils]: 14: Hoare triple {34#false} assume true; {34#false} is VALID [2022-04-14 16:16:41,247 INFO L284 TraceCheckUtils]: 15: Hoare quadruple {34#false} {34#false} #61#return; {34#false} is VALID [2022-04-14 16:16:41,247 INFO L290 TraceCheckUtils]: 16: Hoare triple {34#false} ~u~0 := 1 + 2 * ~R~0;~v~0 := 1;~r~0 := ~R~0 * ~R~0 - ~A~0; {34#false} is VALID [2022-04-14 16:16:41,248 INFO L290 TraceCheckUtils]: 17: Hoare triple {34#false} assume !true; {34#false} is VALID [2022-04-14 16:16:41,248 INFO L272 TraceCheckUtils]: 18: Hoare triple {34#false} call __VERIFIER_assert((if 4 * ~A~0 == ~u~0 * ~u~0 - ~v~0 * ~v~0 - 2 * ~u~0 + 2 * ~v~0 then 1 else 0)); {34#false} is VALID [2022-04-14 16:16:41,248 INFO L290 TraceCheckUtils]: 19: Hoare triple {34#false} ~cond := #in~cond; {34#false} is VALID [2022-04-14 16:16:41,248 INFO L290 TraceCheckUtils]: 20: Hoare triple {34#false} assume 0 == ~cond; {34#false} is VALID [2022-04-14 16:16:41,248 INFO L290 TraceCheckUtils]: 21: Hoare triple {34#false} assume !false; {34#false} is VALID [2022-04-14 16:16:41,249 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 2 proven. 0 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2022-04-14 16:16:41,249 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-04-14 16:16:41,249 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-14 16:16:41,250 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [3512726] [2022-04-14 16:16:41,250 WARN L310 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2022-04-14 16:16:41,251 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1048630747] [2022-04-14 16:16:41,252 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1048630747] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-14 16:16:41,252 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-14 16:16:41,252 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2022-04-14 16:16:41,254 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [603639988] [2022-04-14 16:16:41,254 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-14 16:16:41,258 INFO L78 Accepts]: Start accepts. Automaton has has 2 states, 2 states have (on average 6.5) internal successors, (13), 2 states have internal predecessors, (13), 2 states have call successors, (5), 2 states have call predecessors, (5), 2 states have return successors, (3), 2 states have call predecessors, (3), 2 states have call successors, (3) Word has length 22 [2022-04-14 16:16:41,259 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-14 16:16:41,261 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with has 2 states, 2 states have (on average 6.5) internal successors, (13), 2 states have internal predecessors, (13), 2 states have call successors, (5), 2 states have call predecessors, (5), 2 states have return successors, (3), 2 states have call predecessors, (3), 2 states have call successors, (3) [2022-04-14 16:16:41,288 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 21 edges. 21 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-14 16:16:41,289 INFO L554 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2022-04-14 16:16:41,289 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-04-14 16:16:41,305 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2022-04-14 16:16:41,307 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2022-04-14 16:16:41,309 INFO L87 Difference]: Start difference. First operand has 30 states, 18 states have (on average 1.3888888888888888) internal successors, (25), 19 states have internal predecessors, (25), 6 states have call successors, (6), 4 states have call predecessors, (6), 4 states have return successors, (6), 6 states have call predecessors, (6), 6 states have call successors, (6) Second operand has 2 states, 2 states have (on average 6.5) internal successors, (13), 2 states have internal predecessors, (13), 2 states have call successors, (5), 2 states have call predecessors, (5), 2 states have return successors, (3), 2 states have call predecessors, (3), 2 states have call successors, (3) [2022-04-14 16:16:41,365 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-14 16:16:41,365 INFO L93 Difference]: Finished difference Result 53 states and 70 transitions. [2022-04-14 16:16:41,366 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2022-04-14 16:16:41,366 INFO L78 Accepts]: Start accepts. Automaton has has 2 states, 2 states have (on average 6.5) internal successors, (13), 2 states have internal predecessors, (13), 2 states have call successors, (5), 2 states have call predecessors, (5), 2 states have return successors, (3), 2 states have call predecessors, (3), 2 states have call successors, (3) Word has length 22 [2022-04-14 16:16:41,367 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-14 16:16:41,367 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 2 states, 2 states have (on average 6.5) internal successors, (13), 2 states have internal predecessors, (13), 2 states have call successors, (5), 2 states have call predecessors, (5), 2 states have return successors, (3), 2 states have call predecessors, (3), 2 states have call successors, (3) [2022-04-14 16:16:41,376 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2 states to 2 states and 70 transitions. [2022-04-14 16:16:41,377 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 2 states, 2 states have (on average 6.5) internal successors, (13), 2 states have internal predecessors, (13), 2 states have call successors, (5), 2 states have call predecessors, (5), 2 states have return successors, (3), 2 states have call predecessors, (3), 2 states have call successors, (3) [2022-04-14 16:16:41,386 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2 states to 2 states and 70 transitions. [2022-04-14 16:16:41,386 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 2 states and 70 transitions. [2022-04-14 16:16:41,451 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 70 edges. 70 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-14 16:16:41,457 INFO L225 Difference]: With dead ends: 53 [2022-04-14 16:16:41,457 INFO L226 Difference]: Without dead ends: 25 [2022-04-14 16:16:41,459 INFO L912 BasicCegarLoop]: 0 DeclaredPredicates, 21 GetRequests, 21 SyntacticMatches, 0 SemanticMatches, 0 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2022-04-14 16:16:41,462 INFO L913 BasicCegarLoop]: 34 mSDtfsCounter, 0 mSDsluCounter, 0 mSDsCounter, 0 mSdLazyCounter, 0 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 34 SdHoareTripleChecker+Invalid, 0 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 0 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-04-14 16:16:41,463 INFO L914 BasicCegarLoop]: SdHoareTripleChecker [0 Valid, 34 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 0 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-04-14 16:16:41,473 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 25 states. [2022-04-14 16:16:41,482 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 25 to 25. [2022-04-14 16:16:41,483 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-14 16:16:41,483 INFO L82 GeneralOperation]: Start isEquivalent. First operand 25 states. Second operand has 25 states, 15 states have (on average 1.2666666666666666) internal successors, (19), 16 states have internal predecessors, (19), 6 states have call successors, (6), 4 states have call predecessors, (6), 3 states have return successors, (4), 4 states have call predecessors, (4), 4 states have call successors, (4) [2022-04-14 16:16:41,484 INFO L74 IsIncluded]: Start isIncluded. First operand 25 states. Second operand has 25 states, 15 states have (on average 1.2666666666666666) internal successors, (19), 16 states have internal predecessors, (19), 6 states have call successors, (6), 4 states have call predecessors, (6), 3 states have return successors, (4), 4 states have call predecessors, (4), 4 states have call successors, (4) [2022-04-14 16:16:41,484 INFO L87 Difference]: Start difference. First operand 25 states. Second operand has 25 states, 15 states have (on average 1.2666666666666666) internal successors, (19), 16 states have internal predecessors, (19), 6 states have call successors, (6), 4 states have call predecessors, (6), 3 states have return successors, (4), 4 states have call predecessors, (4), 4 states have call successors, (4) [2022-04-14 16:16:41,488 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-14 16:16:41,498 INFO L93 Difference]: Finished difference Result 25 states and 29 transitions. [2022-04-14 16:16:41,499 INFO L276 IsEmpty]: Start isEmpty. Operand 25 states and 29 transitions. [2022-04-14 16:16:41,501 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-14 16:16:41,502 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-14 16:16:41,507 INFO L74 IsIncluded]: Start isIncluded. First operand has 25 states, 15 states have (on average 1.2666666666666666) internal successors, (19), 16 states have internal predecessors, (19), 6 states have call successors, (6), 4 states have call predecessors, (6), 3 states have return successors, (4), 4 states have call predecessors, (4), 4 states have call successors, (4) Second operand 25 states. [2022-04-14 16:16:41,508 INFO L87 Difference]: Start difference. First operand has 25 states, 15 states have (on average 1.2666666666666666) internal successors, (19), 16 states have internal predecessors, (19), 6 states have call successors, (6), 4 states have call predecessors, (6), 3 states have return successors, (4), 4 states have call predecessors, (4), 4 states have call successors, (4) Second operand 25 states. [2022-04-14 16:16:41,511 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-14 16:16:41,511 INFO L93 Difference]: Finished difference Result 25 states and 29 transitions. [2022-04-14 16:16:41,511 INFO L276 IsEmpty]: Start isEmpty. Operand 25 states and 29 transitions. [2022-04-14 16:16:41,512 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-14 16:16:41,512 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-14 16:16:41,512 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-14 16:16:41,512 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-14 16:16:41,512 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 25 states, 15 states have (on average 1.2666666666666666) internal successors, (19), 16 states have internal predecessors, (19), 6 states have call successors, (6), 4 states have call predecessors, (6), 3 states have return successors, (4), 4 states have call predecessors, (4), 4 states have call successors, (4) [2022-04-14 16:16:41,516 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 25 states to 25 states and 29 transitions. [2022-04-14 16:16:41,517 INFO L78 Accepts]: Start accepts. Automaton has 25 states and 29 transitions. Word has length 22 [2022-04-14 16:16:41,517 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-14 16:16:41,517 INFO L478 AbstractCegarLoop]: Abstraction has 25 states and 29 transitions. [2022-04-14 16:16:41,518 INFO L479 AbstractCegarLoop]: INTERPOLANT automaton has has 2 states, 2 states have (on average 6.5) internal successors, (13), 2 states have internal predecessors, (13), 2 states have call successors, (5), 2 states have call predecessors, (5), 2 states have return successors, (3), 2 states have call predecessors, (3), 2 states have call successors, (3) [2022-04-14 16:16:41,518 INFO L276 IsEmpty]: Start isEmpty. Operand 25 states and 29 transitions. [2022-04-14 16:16:41,518 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 24 [2022-04-14 16:16:41,518 INFO L491 BasicCegarLoop]: Found error trace [2022-04-14 16:16:41,519 INFO L499 BasicCegarLoop]: trace histogram [2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-14 16:16:41,537 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-14 16:16:41,730 WARN L460 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 2 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable0 [2022-04-14 16:16:41,731 INFO L403 AbstractCegarLoop]: === Iteration 2 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-14 16:16:41,732 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-14 16:16:41,732 INFO L85 PathProgramCache]: Analyzing trace with hash 243739414, now seen corresponding path program 1 times [2022-04-14 16:16:41,732 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-14 16:16:41,732 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [690601466] [2022-04-14 16:16:41,732 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-14 16:16:41,733 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-14 16:16:41,754 ERROR L245 FreeRefinementEngine]: Caught known exception: Unsupported non-linear arithmetic [2022-04-14 16:16:41,755 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [776959073] [2022-04-14 16:16:41,755 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-14 16:16:41,755 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-14 16:16:41,755 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-04-14 16:16:41,756 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-14 16:16:41,757 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-14 16:16:41,794 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-14 16:16:41,794 INFO L263 TraceCheckSpWp]: Trace formula consists of 93 conjuncts, 5 conjunts are in the unsatisfiable core [2022-04-14 16:16:41,802 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-14 16:16:41,803 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-04-14 16:16:41,927 INFO L272 TraceCheckUtils]: 0: Hoare triple {256#true} call ULTIMATE.init(); {256#true} is VALID [2022-04-14 16:16:41,927 INFO L290 TraceCheckUtils]: 1: Hoare triple {256#true} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(13, 2);call #Ultimate.allocInit(12, 3);~counter~0 := 0; {264#(<= ~counter~0 0)} is VALID [2022-04-14 16:16:41,928 INFO L290 TraceCheckUtils]: 2: Hoare triple {264#(<= ~counter~0 0)} assume true; {264#(<= ~counter~0 0)} is VALID [2022-04-14 16:16:41,928 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {264#(<= ~counter~0 0)} {256#true} #67#return; {264#(<= ~counter~0 0)} is VALID [2022-04-14 16:16:41,929 INFO L272 TraceCheckUtils]: 4: Hoare triple {264#(<= ~counter~0 0)} call #t~ret7 := main(); {264#(<= ~counter~0 0)} is VALID [2022-04-14 16:16:41,929 INFO L290 TraceCheckUtils]: 5: Hoare triple {264#(<= ~counter~0 0)} havoc ~A~0;havoc ~R~0;havoc ~u~0;havoc ~v~0;havoc ~r~0;assume -2147483648 <= #t~nondet4 && #t~nondet4 <= 2147483647;~A~0 := #t~nondet4;havoc #t~nondet4;assume -2147483648 <= #t~nondet5 && #t~nondet5 <= 2147483647;~R~0 := #t~nondet5;havoc #t~nondet5; {264#(<= ~counter~0 0)} is VALID [2022-04-14 16:16:41,930 INFO L272 TraceCheckUtils]: 6: Hoare triple {264#(<= ~counter~0 0)} call assume_abort_if_not((if (~R~0 - 1) * (~R~0 - 1) < ~A~0 then 1 else 0)); {264#(<= ~counter~0 0)} is VALID [2022-04-14 16:16:41,930 INFO L290 TraceCheckUtils]: 7: Hoare triple {264#(<= ~counter~0 0)} ~cond := #in~cond; {264#(<= ~counter~0 0)} is VALID [2022-04-14 16:16:41,930 INFO L290 TraceCheckUtils]: 8: Hoare triple {264#(<= ~counter~0 0)} assume !(0 == ~cond); {264#(<= ~counter~0 0)} is VALID [2022-04-14 16:16:41,931 INFO L290 TraceCheckUtils]: 9: Hoare triple {264#(<= ~counter~0 0)} assume true; {264#(<= ~counter~0 0)} is VALID [2022-04-14 16:16:41,931 INFO L284 TraceCheckUtils]: 10: Hoare quadruple {264#(<= ~counter~0 0)} {264#(<= ~counter~0 0)} #59#return; {264#(<= ~counter~0 0)} is VALID [2022-04-14 16:16:41,932 INFO L272 TraceCheckUtils]: 11: Hoare triple {264#(<= ~counter~0 0)} call assume_abort_if_not((if 1 == (if ~A~0 < 0 && 0 != ~A~0 % 2 then ~A~0 % 2 - 2 else ~A~0 % 2) then 1 else 0)); {264#(<= ~counter~0 0)} is VALID [2022-04-14 16:16:41,932 INFO L290 TraceCheckUtils]: 12: Hoare triple {264#(<= ~counter~0 0)} ~cond := #in~cond; {264#(<= ~counter~0 0)} is VALID [2022-04-14 16:16:41,933 INFO L290 TraceCheckUtils]: 13: Hoare triple {264#(<= ~counter~0 0)} assume !(0 == ~cond); {264#(<= ~counter~0 0)} is VALID [2022-04-14 16:16:41,933 INFO L290 TraceCheckUtils]: 14: Hoare triple {264#(<= ~counter~0 0)} assume true; {264#(<= ~counter~0 0)} is VALID [2022-04-14 16:16:41,934 INFO L284 TraceCheckUtils]: 15: Hoare quadruple {264#(<= ~counter~0 0)} {264#(<= ~counter~0 0)} #61#return; {264#(<= ~counter~0 0)} is VALID [2022-04-14 16:16:41,934 INFO L290 TraceCheckUtils]: 16: Hoare triple {264#(<= ~counter~0 0)} ~u~0 := 1 + 2 * ~R~0;~v~0 := 1;~r~0 := ~R~0 * ~R~0 - ~A~0; {264#(<= ~counter~0 0)} is VALID [2022-04-14 16:16:41,934 INFO L290 TraceCheckUtils]: 17: Hoare triple {264#(<= ~counter~0 0)} #t~post6 := ~counter~0;~counter~0 := 1 + #t~post6; {313#(<= |main_#t~post6| 0)} is VALID [2022-04-14 16:16:41,935 INFO L290 TraceCheckUtils]: 18: Hoare triple {313#(<= |main_#t~post6| 0)} assume !(#t~post6 < 5);havoc #t~post6; {257#false} is VALID [2022-04-14 16:16:41,935 INFO L272 TraceCheckUtils]: 19: Hoare triple {257#false} call __VERIFIER_assert((if 4 * ~A~0 == ~u~0 * ~u~0 - ~v~0 * ~v~0 - 2 * ~u~0 + 2 * ~v~0 then 1 else 0)); {257#false} is VALID [2022-04-14 16:16:41,935 INFO L290 TraceCheckUtils]: 20: Hoare triple {257#false} ~cond := #in~cond; {257#false} is VALID [2022-04-14 16:16:41,935 INFO L290 TraceCheckUtils]: 21: Hoare triple {257#false} assume 0 == ~cond; {257#false} is VALID [2022-04-14 16:16:41,936 INFO L290 TraceCheckUtils]: 22: Hoare triple {257#false} assume !false; {257#false} is VALID [2022-04-14 16:16:41,936 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2022-04-14 16:16:41,936 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-04-14 16:16:41,936 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-14 16:16:41,936 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [690601466] [2022-04-14 16:16:41,936 WARN L310 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2022-04-14 16:16:41,936 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [776959073] [2022-04-14 16:16:41,936 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [776959073] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-14 16:16:41,937 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-14 16:16:41,937 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-04-14 16:16:41,937 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1462846534] [2022-04-14 16:16:41,937 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-14 16:16:41,938 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 3.0) internal successors, (12), 3 states have internal predecessors, (12), 3 states have call successors, (5), 3 states have call predecessors, (5), 1 states have return successors, (3), 1 states have call predecessors, (3), 2 states have call successors, (3) Word has length 23 [2022-04-14 16:16:41,938 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-14 16:16:41,938 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with has 4 states, 4 states have (on average 3.0) internal successors, (12), 3 states have internal predecessors, (12), 3 states have call successors, (5), 3 states have call predecessors, (5), 1 states have return successors, (3), 1 states have call predecessors, (3), 2 states have call successors, (3) [2022-04-14 16:16:41,953 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 20 edges. 20 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-14 16:16:41,954 INFO L554 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-04-14 16:16:41,954 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-04-14 16:16:41,954 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-04-14 16:16:41,954 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-04-14 16:16:41,955 INFO L87 Difference]: Start difference. First operand 25 states and 29 transitions. Second operand has 4 states, 4 states have (on average 3.0) internal successors, (12), 3 states have internal predecessors, (12), 3 states have call successors, (5), 3 states have call predecessors, (5), 1 states have return successors, (3), 1 states have call predecessors, (3), 2 states have call successors, (3) [2022-04-14 16:16:41,999 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-14 16:16:41,999 INFO L93 Difference]: Finished difference Result 34 states and 38 transitions. [2022-04-14 16:16:41,999 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-04-14 16:16:41,999 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 3.0) internal successors, (12), 3 states have internal predecessors, (12), 3 states have call successors, (5), 3 states have call predecessors, (5), 1 states have return successors, (3), 1 states have call predecessors, (3), 2 states have call successors, (3) Word has length 23 [2022-04-14 16:16:41,999 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-14 16:16:41,999 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 4 states, 4 states have (on average 3.0) internal successors, (12), 3 states have internal predecessors, (12), 3 states have call successors, (5), 3 states have call predecessors, (5), 1 states have return successors, (3), 1 states have call predecessors, (3), 2 states have call successors, (3) [2022-04-14 16:16:42,001 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 38 transitions. [2022-04-14 16:16:42,001 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 4 states, 4 states have (on average 3.0) internal successors, (12), 3 states have internal predecessors, (12), 3 states have call successors, (5), 3 states have call predecessors, (5), 1 states have return successors, (3), 1 states have call predecessors, (3), 2 states have call successors, (3) [2022-04-14 16:16:42,002 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 38 transitions. [2022-04-14 16:16:42,002 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 4 states and 38 transitions. [2022-04-14 16:16:42,029 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 38 edges. 38 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-14 16:16:42,030 INFO L225 Difference]: With dead ends: 34 [2022-04-14 16:16:42,030 INFO L226 Difference]: Without dead ends: 27 [2022-04-14 16:16:42,030 INFO L912 BasicCegarLoop]: 0 DeclaredPredicates, 22 GetRequests, 20 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-04-14 16:16:42,031 INFO L913 BasicCegarLoop]: 27 mSDtfsCounter, 0 mSDsluCounter, 40 mSDsCounter, 0 mSdLazyCounter, 7 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 67 SdHoareTripleChecker+Invalid, 7 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 7 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-04-14 16:16:42,031 INFO L914 BasicCegarLoop]: SdHoareTripleChecker [0 Valid, 67 Invalid, 7 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 7 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-04-14 16:16:42,032 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 27 states. [2022-04-14 16:16:42,037 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 27 to 27. [2022-04-14 16:16:42,037 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-14 16:16:42,038 INFO L82 GeneralOperation]: Start isEquivalent. First operand 27 states. Second operand has 27 states, 17 states have (on average 1.2352941176470589) internal successors, (21), 18 states have internal predecessors, (21), 6 states have call successors, (6), 4 states have call predecessors, (6), 3 states have return successors, (4), 4 states have call predecessors, (4), 4 states have call successors, (4) [2022-04-14 16:16:42,038 INFO L74 IsIncluded]: Start isIncluded. First operand 27 states. Second operand has 27 states, 17 states have (on average 1.2352941176470589) internal successors, (21), 18 states have internal predecessors, (21), 6 states have call successors, (6), 4 states have call predecessors, (6), 3 states have return successors, (4), 4 states have call predecessors, (4), 4 states have call successors, (4) [2022-04-14 16:16:42,038 INFO L87 Difference]: Start difference. First operand 27 states. Second operand has 27 states, 17 states have (on average 1.2352941176470589) internal successors, (21), 18 states have internal predecessors, (21), 6 states have call successors, (6), 4 states have call predecessors, (6), 3 states have return successors, (4), 4 states have call predecessors, (4), 4 states have call successors, (4) [2022-04-14 16:16:42,039 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-14 16:16:42,040 INFO L93 Difference]: Finished difference Result 27 states and 31 transitions. [2022-04-14 16:16:42,040 INFO L276 IsEmpty]: Start isEmpty. Operand 27 states and 31 transitions. [2022-04-14 16:16:42,040 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-14 16:16:42,040 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-14 16:16:42,040 INFO L74 IsIncluded]: Start isIncluded. First operand has 27 states, 17 states have (on average 1.2352941176470589) internal successors, (21), 18 states have internal predecessors, (21), 6 states have call successors, (6), 4 states have call predecessors, (6), 3 states have return successors, (4), 4 states have call predecessors, (4), 4 states have call successors, (4) Second operand 27 states. [2022-04-14 16:16:42,041 INFO L87 Difference]: Start difference. First operand has 27 states, 17 states have (on average 1.2352941176470589) internal successors, (21), 18 states have internal predecessors, (21), 6 states have call successors, (6), 4 states have call predecessors, (6), 3 states have return successors, (4), 4 states have call predecessors, (4), 4 states have call successors, (4) Second operand 27 states. [2022-04-14 16:16:42,042 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-14 16:16:42,042 INFO L93 Difference]: Finished difference Result 27 states and 31 transitions. [2022-04-14 16:16:42,042 INFO L276 IsEmpty]: Start isEmpty. Operand 27 states and 31 transitions. [2022-04-14 16:16:42,043 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-14 16:16:42,043 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-14 16:16:42,043 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-14 16:16:42,043 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-14 16:16:42,043 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 27 states, 17 states have (on average 1.2352941176470589) internal successors, (21), 18 states have internal predecessors, (21), 6 states have call successors, (6), 4 states have call predecessors, (6), 3 states have return successors, (4), 4 states have call predecessors, (4), 4 states have call successors, (4) [2022-04-14 16:16:42,045 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 27 states to 27 states and 31 transitions. [2022-04-14 16:16:42,045 INFO L78 Accepts]: Start accepts. Automaton has 27 states and 31 transitions. Word has length 23 [2022-04-14 16:16:42,045 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-14 16:16:42,045 INFO L478 AbstractCegarLoop]: Abstraction has 27 states and 31 transitions. [2022-04-14 16:16:42,045 INFO L479 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 3.0) internal successors, (12), 3 states have internal predecessors, (12), 3 states have call successors, (5), 3 states have call predecessors, (5), 1 states have return successors, (3), 1 states have call predecessors, (3), 2 states have call successors, (3) [2022-04-14 16:16:42,045 INFO L276 IsEmpty]: Start isEmpty. Operand 27 states and 31 transitions. [2022-04-14 16:16:42,046 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 24 [2022-04-14 16:16:42,046 INFO L491 BasicCegarLoop]: Found error trace [2022-04-14 16:16:42,046 INFO L499 BasicCegarLoop]: trace histogram [2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-14 16:16:42,063 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-14 16:16:42,255 WARN L460 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 3 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable1 [2022-04-14 16:16:42,256 INFO L403 AbstractCegarLoop]: === Iteration 3 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-14 16:16:42,256 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-14 16:16:42,256 INFO L85 PathProgramCache]: Analyzing trace with hash 245526874, now seen corresponding path program 1 times [2022-04-14 16:16:42,256 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-14 16:16:42,257 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1595389240] [2022-04-14 16:16:42,257 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-14 16:16:42,257 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-14 16:16:42,271 ERROR L245 FreeRefinementEngine]: Caught known exception: Unsupported non-linear arithmetic [2022-04-14 16:16:42,271 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [160589165] [2022-04-14 16:16:42,271 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-14 16:16:42,271 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-14 16:16:42,271 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-04-14 16:16:42,272 INFO L229 MonitoredProcess]: Starting monitored process 4 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-04-14 16:16:42,273 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Waiting until timeout for monitored process [2022-04-14 16:16:42,326 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-14 16:16:42,327 INFO L263 TraceCheckSpWp]: Trace formula consists of 93 conjuncts, 13 conjunts are in the unsatisfiable core [2022-04-14 16:16:42,907 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-14 16:16:42,908 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-04-14 16:16:46,737 INFO L272 TraceCheckUtils]: 0: Hoare triple {469#true} call ULTIMATE.init(); {469#true} is VALID [2022-04-14 16:16:46,738 INFO L290 TraceCheckUtils]: 1: Hoare triple {469#true} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(13, 2);call #Ultimate.allocInit(12, 3);~counter~0 := 0; {469#true} is VALID [2022-04-14 16:16:46,738 INFO L290 TraceCheckUtils]: 2: Hoare triple {469#true} assume true; {469#true} is VALID [2022-04-14 16:16:46,738 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {469#true} {469#true} #67#return; {469#true} is VALID [2022-04-14 16:16:46,738 INFO L272 TraceCheckUtils]: 4: Hoare triple {469#true} call #t~ret7 := main(); {469#true} is VALID [2022-04-14 16:16:46,738 INFO L290 TraceCheckUtils]: 5: Hoare triple {469#true} havoc ~A~0;havoc ~R~0;havoc ~u~0;havoc ~v~0;havoc ~r~0;assume -2147483648 <= #t~nondet4 && #t~nondet4 <= 2147483647;~A~0 := #t~nondet4;havoc #t~nondet4;assume -2147483648 <= #t~nondet5 && #t~nondet5 <= 2147483647;~R~0 := #t~nondet5;havoc #t~nondet5; {469#true} is VALID [2022-04-14 16:16:46,738 INFO L272 TraceCheckUtils]: 6: Hoare triple {469#true} call assume_abort_if_not((if (~R~0 - 1) * (~R~0 - 1) < ~A~0 then 1 else 0)); {469#true} is VALID [2022-04-14 16:16:46,739 INFO L290 TraceCheckUtils]: 7: Hoare triple {469#true} ~cond := #in~cond; {469#true} is VALID [2022-04-14 16:16:46,739 INFO L290 TraceCheckUtils]: 8: Hoare triple {469#true} assume !(0 == ~cond); {469#true} is VALID [2022-04-14 16:16:46,739 INFO L290 TraceCheckUtils]: 9: Hoare triple {469#true} assume true; {469#true} is VALID [2022-04-14 16:16:46,739 INFO L284 TraceCheckUtils]: 10: Hoare quadruple {469#true} {469#true} #59#return; {469#true} is VALID [2022-04-14 16:16:46,739 INFO L272 TraceCheckUtils]: 11: Hoare triple {469#true} call assume_abort_if_not((if 1 == (if ~A~0 < 0 && 0 != ~A~0 % 2 then ~A~0 % 2 - 2 else ~A~0 % 2) then 1 else 0)); {469#true} is VALID [2022-04-14 16:16:46,739 INFO L290 TraceCheckUtils]: 12: Hoare triple {469#true} ~cond := #in~cond; {469#true} is VALID [2022-04-14 16:16:46,739 INFO L290 TraceCheckUtils]: 13: Hoare triple {469#true} assume !(0 == ~cond); {469#true} is VALID [2022-04-14 16:16:46,739 INFO L290 TraceCheckUtils]: 14: Hoare triple {469#true} assume true; {469#true} is VALID [2022-04-14 16:16:46,740 INFO L284 TraceCheckUtils]: 15: Hoare quadruple {469#true} {469#true} #61#return; {469#true} is VALID [2022-04-14 16:16:48,019 INFO L290 TraceCheckUtils]: 16: Hoare triple {469#true} ~u~0 := 1 + 2 * ~R~0;~v~0 := 1;~r~0 := ~R~0 * ~R~0 - ~A~0; {522#(and (= (+ (* (- 1) main_~A~0) (* (div (+ (* (- 1) main_~u~0) 1) (- 2)) (div (+ (* (- 1) main_~u~0) 1) (- 2)))) main_~r~0) (= (mod (+ main_~u~0 1) 2) 0) (= main_~v~0 1))} is VALID [2022-04-14 16:16:48,020 INFO L290 TraceCheckUtils]: 17: Hoare triple {522#(and (= (+ (* (- 1) main_~A~0) (* (div (+ (* (- 1) main_~u~0) 1) (- 2)) (div (+ (* (- 1) main_~u~0) 1) (- 2)))) main_~r~0) (= (mod (+ main_~u~0 1) 2) 0) (= main_~v~0 1))} #t~post6 := ~counter~0;~counter~0 := 1 + #t~post6; {522#(and (= (+ (* (- 1) main_~A~0) (* (div (+ (* (- 1) main_~u~0) 1) (- 2)) (div (+ (* (- 1) main_~u~0) 1) (- 2)))) main_~r~0) (= (mod (+ main_~u~0 1) 2) 0) (= main_~v~0 1))} is VALID [2022-04-14 16:16:48,021 INFO L290 TraceCheckUtils]: 18: Hoare triple {522#(and (= (+ (* (- 1) main_~A~0) (* (div (+ (* (- 1) main_~u~0) 1) (- 2)) (div (+ (* (- 1) main_~u~0) 1) (- 2)))) main_~r~0) (= (mod (+ main_~u~0 1) 2) 0) (= main_~v~0 1))} assume !!(#t~post6 < 5);havoc #t~post6; {522#(and (= (+ (* (- 1) main_~A~0) (* (div (+ (* (- 1) main_~u~0) 1) (- 2)) (div (+ (* (- 1) main_~u~0) 1) (- 2)))) main_~r~0) (= (mod (+ main_~u~0 1) 2) 0) (= main_~v~0 1))} is VALID [2022-04-14 16:16:49,198 INFO L272 TraceCheckUtils]: 19: Hoare triple {522#(and (= (+ (* (- 1) main_~A~0) (* (div (+ (* (- 1) main_~u~0) 1) (- 2)) (div (+ (* (- 1) main_~u~0) 1) (- 2)))) main_~r~0) (= (mod (+ main_~u~0 1) 2) 0) (= main_~v~0 1))} call __VERIFIER_assert((if 4 * (~A~0 + ~r~0) == ~u~0 * ~u~0 - ~v~0 * ~v~0 - 2 * ~u~0 + 2 * ~v~0 then 1 else 0)); {532#(<= 1 |__VERIFIER_assert_#in~cond|)} is VALID [2022-04-14 16:16:49,199 INFO L290 TraceCheckUtils]: 20: Hoare triple {532#(<= 1 |__VERIFIER_assert_#in~cond|)} ~cond := #in~cond; {536#(<= 1 __VERIFIER_assert_~cond)} is VALID [2022-04-14 16:16:49,200 INFO L290 TraceCheckUtils]: 21: Hoare triple {536#(<= 1 __VERIFIER_assert_~cond)} assume 0 == ~cond; {470#false} is VALID [2022-04-14 16:16:49,200 INFO L290 TraceCheckUtils]: 22: Hoare triple {470#false} assume !false; {470#false} is VALID [2022-04-14 16:16:49,200 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2022-04-14 16:16:49,200 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-04-14 16:16:49,200 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-14 16:16:49,200 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1595389240] [2022-04-14 16:16:49,201 WARN L310 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2022-04-14 16:16:49,201 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [160589165] [2022-04-14 16:16:49,201 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [160589165] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-14 16:16:49,201 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-14 16:16:49,201 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2022-04-14 16:16:49,201 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [473623281] [2022-04-14 16:16:49,201 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-14 16:16:49,201 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 2.4) internal successors, (12), 4 states have internal predecessors, (12), 2 states have call successors, (5), 2 states have call predecessors, (5), 1 states have return successors, (3), 1 states have call predecessors, (3), 1 states have call successors, (3) Word has length 23 [2022-04-14 16:16:49,202 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-14 16:16:49,202 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with has 5 states, 5 states have (on average 2.4) internal successors, (12), 4 states have internal predecessors, (12), 2 states have call successors, (5), 2 states have call predecessors, (5), 1 states have return successors, (3), 1 states have call predecessors, (3), 1 states have call successors, (3) [2022-04-14 16:16:50,638 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 20 edges. 20 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-14 16:16:50,638 INFO L554 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-04-14 16:16:50,638 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-04-14 16:16:50,638 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-04-14 16:16:50,639 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2022-04-14 16:16:50,639 INFO L87 Difference]: Start difference. First operand 27 states and 31 transitions. Second operand has 5 states, 5 states have (on average 2.4) internal successors, (12), 4 states have internal predecessors, (12), 2 states have call successors, (5), 2 states have call predecessors, (5), 1 states have return successors, (3), 1 states have call predecessors, (3), 1 states have call successors, (3) [2022-04-14 16:16:52,099 WARN L534 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.41s for a HTC check with result INVALID. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=true, quantifiers [] [2022-04-14 16:16:54,780 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-14 16:16:54,806 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-14 16:16:54,807 INFO L93 Difference]: Finished difference Result 37 states and 43 transitions. [2022-04-14 16:16:54,807 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-04-14 16:16:54,807 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 2.4) internal successors, (12), 4 states have internal predecessors, (12), 2 states have call successors, (5), 2 states have call predecessors, (5), 1 states have return successors, (3), 1 states have call predecessors, (3), 1 states have call successors, (3) Word has length 23 [2022-04-14 16:16:54,807 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-14 16:16:54,807 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 5 states, 5 states have (on average 2.4) internal successors, (12), 4 states have internal predecessors, (12), 2 states have call successors, (5), 2 states have call predecessors, (5), 1 states have return successors, (3), 1 states have call predecessors, (3), 1 states have call successors, (3) [2022-04-14 16:16:54,809 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 43 transitions. [2022-04-14 16:16:54,809 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 5 states, 5 states have (on average 2.4) internal successors, (12), 4 states have internal predecessors, (12), 2 states have call successors, (5), 2 states have call predecessors, (5), 1 states have return successors, (3), 1 states have call predecessors, (3), 1 states have call successors, (3) [2022-04-14 16:16:54,810 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 43 transitions. [2022-04-14 16:16:54,810 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 5 states and 43 transitions. [2022-04-14 16:16:55,596 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 43 edges. 43 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-14 16:16:55,598 INFO L225 Difference]: With dead ends: 37 [2022-04-14 16:16:55,598 INFO L226 Difference]: Without dead ends: 35 [2022-04-14 16:16:55,598 INFO L912 BasicCegarLoop]: 0 DeclaredPredicates, 23 GetRequests, 19 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2022-04-14 16:16:55,599 INFO L913 BasicCegarLoop]: 23 mSDtfsCounter, 7 mSDsluCounter, 59 mSDsCounter, 0 mSdLazyCounter, 36 mSolverCounterSat, 0 mSolverCounterUnsat, 1 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 4.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 8 SdHoareTripleChecker+Valid, 82 SdHoareTripleChecker+Invalid, 37 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 36 IncrementalHoareTripleChecker+Invalid, 1 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 4.1s IncrementalHoareTripleChecker+Time [2022-04-14 16:16:55,599 INFO L914 BasicCegarLoop]: SdHoareTripleChecker [8 Valid, 82 Invalid, 37 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 36 Invalid, 1 Unknown, 0 Unchecked, 4.1s Time] [2022-04-14 16:16:55,600 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 35 states. [2022-04-14 16:16:55,607 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 35 to 32. [2022-04-14 16:16:55,607 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-14 16:16:55,607 INFO L82 GeneralOperation]: Start isEquivalent. First operand 35 states. Second operand has 32 states, 20 states have (on average 1.2) internal successors, (24), 22 states have internal predecessors, (24), 7 states have call successors, (7), 5 states have call predecessors, (7), 4 states have return successors, (5), 4 states have call predecessors, (5), 5 states have call successors, (5) [2022-04-14 16:16:55,607 INFO L74 IsIncluded]: Start isIncluded. First operand 35 states. Second operand has 32 states, 20 states have (on average 1.2) internal successors, (24), 22 states have internal predecessors, (24), 7 states have call successors, (7), 5 states have call predecessors, (7), 4 states have return successors, (5), 4 states have call predecessors, (5), 5 states have call successors, (5) [2022-04-14 16:16:55,607 INFO L87 Difference]: Start difference. First operand 35 states. Second operand has 32 states, 20 states have (on average 1.2) internal successors, (24), 22 states have internal predecessors, (24), 7 states have call successors, (7), 5 states have call predecessors, (7), 4 states have return successors, (5), 4 states have call predecessors, (5), 5 states have call successors, (5) [2022-04-14 16:16:55,609 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-14 16:16:55,609 INFO L93 Difference]: Finished difference Result 35 states and 41 transitions. [2022-04-14 16:16:55,609 INFO L276 IsEmpty]: Start isEmpty. Operand 35 states and 41 transitions. [2022-04-14 16:16:55,609 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-14 16:16:55,609 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-14 16:16:55,609 INFO L74 IsIncluded]: Start isIncluded. First operand has 32 states, 20 states have (on average 1.2) internal successors, (24), 22 states have internal predecessors, (24), 7 states have call successors, (7), 5 states have call predecessors, (7), 4 states have return successors, (5), 4 states have call predecessors, (5), 5 states have call successors, (5) Second operand 35 states. [2022-04-14 16:16:55,610 INFO L87 Difference]: Start difference. First operand has 32 states, 20 states have (on average 1.2) internal successors, (24), 22 states have internal predecessors, (24), 7 states have call successors, (7), 5 states have call predecessors, (7), 4 states have return successors, (5), 4 states have call predecessors, (5), 5 states have call successors, (5) Second operand 35 states. [2022-04-14 16:16:55,611 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-14 16:16:55,611 INFO L93 Difference]: Finished difference Result 35 states and 41 transitions. [2022-04-14 16:16:55,611 INFO L276 IsEmpty]: Start isEmpty. Operand 35 states and 41 transitions. [2022-04-14 16:16:55,611 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-14 16:16:55,611 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-14 16:16:55,612 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-14 16:16:55,612 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-14 16:16:55,612 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 32 states, 20 states have (on average 1.2) internal successors, (24), 22 states have internal predecessors, (24), 7 states have call successors, (7), 5 states have call predecessors, (7), 4 states have return successors, (5), 4 states have call predecessors, (5), 5 states have call successors, (5) [2022-04-14 16:16:55,613 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 32 states to 32 states and 36 transitions. [2022-04-14 16:16:55,613 INFO L78 Accepts]: Start accepts. Automaton has 32 states and 36 transitions. Word has length 23 [2022-04-14 16:16:55,613 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-14 16:16:55,613 INFO L478 AbstractCegarLoop]: Abstraction has 32 states and 36 transitions. [2022-04-14 16:16:55,613 INFO L479 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 2.4) internal successors, (12), 4 states have internal predecessors, (12), 2 states have call successors, (5), 2 states have call predecessors, (5), 1 states have return successors, (3), 1 states have call predecessors, (3), 1 states have call successors, (3) [2022-04-14 16:16:55,613 INFO L276 IsEmpty]: Start isEmpty. Operand 32 states and 36 transitions. [2022-04-14 16:16:55,614 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 30 [2022-04-14 16:16:55,614 INFO L491 BasicCegarLoop]: Found error trace [2022-04-14 16:16:55,614 INFO L499 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-14 16:16:55,630 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Forceful destruction successful, exit code 0 [2022-04-14 16:16:55,814 WARN L460 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2,4 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-14 16:16:55,815 INFO L403 AbstractCegarLoop]: === Iteration 4 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-14 16:16:55,815 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-14 16:16:55,815 INFO L85 PathProgramCache]: Analyzing trace with hash -1019533657, now seen corresponding path program 1 times [2022-04-14 16:16:55,815 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-14 16:16:55,815 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1808512858] [2022-04-14 16:16:55,815 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-14 16:16:55,815 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-14 16:16:55,825 ERROR L245 FreeRefinementEngine]: Caught known exception: Unsupported non-linear arithmetic [2022-04-14 16:16:55,825 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [1497461120] [2022-04-14 16:16:55,825 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-14 16:16:55,825 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-14 16:16:55,825 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-04-14 16:16:55,826 INFO L229 MonitoredProcess]: Starting monitored process 5 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-04-14 16:16:55,827 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Waiting until timeout for monitored process [2022-04-14 16:16:55,866 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-14 16:16:55,867 INFO L263 TraceCheckSpWp]: Trace formula consists of 104 conjuncts, 10 conjunts are in the unsatisfiable core [2022-04-14 16:16:55,872 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-14 16:16:55,872 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-04-14 16:16:56,024 INFO L272 TraceCheckUtils]: 0: Hoare triple {712#true} call ULTIMATE.init(); {712#true} is VALID [2022-04-14 16:16:56,024 INFO L290 TraceCheckUtils]: 1: Hoare triple {712#true} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(13, 2);call #Ultimate.allocInit(12, 3);~counter~0 := 0; {712#true} is VALID [2022-04-14 16:16:56,025 INFO L290 TraceCheckUtils]: 2: Hoare triple {712#true} assume true; {712#true} is VALID [2022-04-14 16:16:56,025 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {712#true} {712#true} #67#return; {712#true} is VALID [2022-04-14 16:16:56,025 INFO L272 TraceCheckUtils]: 4: Hoare triple {712#true} call #t~ret7 := main(); {712#true} is VALID [2022-04-14 16:16:56,025 INFO L290 TraceCheckUtils]: 5: Hoare triple {712#true} havoc ~A~0;havoc ~R~0;havoc ~u~0;havoc ~v~0;havoc ~r~0;assume -2147483648 <= #t~nondet4 && #t~nondet4 <= 2147483647;~A~0 := #t~nondet4;havoc #t~nondet4;assume -2147483648 <= #t~nondet5 && #t~nondet5 <= 2147483647;~R~0 := #t~nondet5;havoc #t~nondet5; {712#true} is VALID [2022-04-14 16:16:56,027 INFO L272 TraceCheckUtils]: 6: Hoare triple {712#true} call assume_abort_if_not((if (~R~0 - 1) * (~R~0 - 1) < ~A~0 then 1 else 0)); {712#true} is VALID [2022-04-14 16:16:56,027 INFO L290 TraceCheckUtils]: 7: Hoare triple {712#true} ~cond := #in~cond; {712#true} is VALID [2022-04-14 16:16:56,028 INFO L290 TraceCheckUtils]: 8: Hoare triple {712#true} assume !(0 == ~cond); {712#true} is VALID [2022-04-14 16:16:56,028 INFO L290 TraceCheckUtils]: 9: Hoare triple {712#true} assume true; {712#true} is VALID [2022-04-14 16:16:56,028 INFO L284 TraceCheckUtils]: 10: Hoare quadruple {712#true} {712#true} #59#return; {712#true} is VALID [2022-04-14 16:16:56,028 INFO L272 TraceCheckUtils]: 11: Hoare triple {712#true} call assume_abort_if_not((if 1 == (if ~A~0 < 0 && 0 != ~A~0 % 2 then ~A~0 % 2 - 2 else ~A~0 % 2) then 1 else 0)); {712#true} is VALID [2022-04-14 16:16:56,028 INFO L290 TraceCheckUtils]: 12: Hoare triple {712#true} ~cond := #in~cond; {712#true} is VALID [2022-04-14 16:16:56,028 INFO L290 TraceCheckUtils]: 13: Hoare triple {712#true} assume !(0 == ~cond); {712#true} is VALID [2022-04-14 16:16:56,028 INFO L290 TraceCheckUtils]: 14: Hoare triple {712#true} assume true; {712#true} is VALID [2022-04-14 16:16:56,028 INFO L284 TraceCheckUtils]: 15: Hoare quadruple {712#true} {712#true} #61#return; {712#true} is VALID [2022-04-14 16:16:56,028 INFO L290 TraceCheckUtils]: 16: Hoare triple {712#true} ~u~0 := 1 + 2 * ~R~0;~v~0 := 1;~r~0 := ~R~0 * ~R~0 - ~A~0; {712#true} is VALID [2022-04-14 16:16:56,029 INFO L290 TraceCheckUtils]: 17: Hoare triple {712#true} #t~post6 := ~counter~0;~counter~0 := 1 + #t~post6; {712#true} is VALID [2022-04-14 16:16:56,029 INFO L290 TraceCheckUtils]: 18: Hoare triple {712#true} assume !!(#t~post6 < 5);havoc #t~post6; {712#true} is VALID [2022-04-14 16:16:56,030 INFO L272 TraceCheckUtils]: 19: Hoare triple {712#true} call __VERIFIER_assert((if 4 * (~A~0 + ~r~0) == ~u~0 * ~u~0 - ~v~0 * ~v~0 - 2 * ~u~0 + 2 * ~v~0 then 1 else 0)); {712#true} is VALID [2022-04-14 16:16:56,030 INFO L290 TraceCheckUtils]: 20: Hoare triple {712#true} ~cond := #in~cond; {777#(= |__VERIFIER_assert_#in~cond| __VERIFIER_assert_~cond)} is VALID [2022-04-14 16:16:56,030 INFO L290 TraceCheckUtils]: 21: Hoare triple {777#(= |__VERIFIER_assert_#in~cond| __VERIFIER_assert_~cond)} assume !(0 == ~cond); {781#(not (= |__VERIFIER_assert_#in~cond| 0))} is VALID [2022-04-14 16:16:56,031 INFO L290 TraceCheckUtils]: 22: Hoare triple {781#(not (= |__VERIFIER_assert_#in~cond| 0))} assume true; {781#(not (= |__VERIFIER_assert_#in~cond| 0))} is VALID [2022-04-14 16:16:56,032 INFO L284 TraceCheckUtils]: 23: Hoare quadruple {781#(not (= |__VERIFIER_assert_#in~cond| 0))} {712#true} #63#return; {788#(= (+ (* main_~v~0 2) (* main_~u~0 main_~u~0)) (+ (* main_~v~0 main_~v~0) (* main_~u~0 2) (* main_~A~0 4) (* main_~r~0 4)))} is VALID [2022-04-14 16:16:56,032 INFO L290 TraceCheckUtils]: 24: Hoare triple {788#(= (+ (* main_~v~0 2) (* main_~u~0 main_~u~0)) (+ (* main_~v~0 main_~v~0) (* main_~u~0 2) (* main_~A~0 4) (* main_~r~0 4)))} assume !(0 != ~r~0); {792#(= (+ (* main_~v~0 2) (* main_~u~0 main_~u~0)) (+ (* main_~v~0 main_~v~0) (* main_~u~0 2) (* main_~A~0 4)))} is VALID [2022-04-14 16:16:56,033 INFO L272 TraceCheckUtils]: 25: Hoare triple {792#(= (+ (* main_~v~0 2) (* main_~u~0 main_~u~0)) (+ (* main_~v~0 main_~v~0) (* main_~u~0 2) (* main_~A~0 4)))} call __VERIFIER_assert((if 4 * ~A~0 == ~u~0 * ~u~0 - ~v~0 * ~v~0 - 2 * ~u~0 + 2 * ~v~0 then 1 else 0)); {796#(<= 1 |__VERIFIER_assert_#in~cond|)} is VALID [2022-04-14 16:16:56,033 INFO L290 TraceCheckUtils]: 26: Hoare triple {796#(<= 1 |__VERIFIER_assert_#in~cond|)} ~cond := #in~cond; {800#(<= 1 __VERIFIER_assert_~cond)} is VALID [2022-04-14 16:16:56,033 INFO L290 TraceCheckUtils]: 27: Hoare triple {800#(<= 1 __VERIFIER_assert_~cond)} assume 0 == ~cond; {713#false} is VALID [2022-04-14 16:16:56,034 INFO L290 TraceCheckUtils]: 28: Hoare triple {713#false} assume !false; {713#false} is VALID [2022-04-14 16:16:56,034 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 1 proven. 1 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2022-04-14 16:16:56,034 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-04-14 16:16:56,403 INFO L290 TraceCheckUtils]: 28: Hoare triple {713#false} assume !false; {713#false} is VALID [2022-04-14 16:16:56,404 INFO L290 TraceCheckUtils]: 27: Hoare triple {800#(<= 1 __VERIFIER_assert_~cond)} assume 0 == ~cond; {713#false} is VALID [2022-04-14 16:16:56,404 INFO L290 TraceCheckUtils]: 26: Hoare triple {796#(<= 1 |__VERIFIER_assert_#in~cond|)} ~cond := #in~cond; {800#(<= 1 __VERIFIER_assert_~cond)} is VALID [2022-04-14 16:16:56,405 INFO L272 TraceCheckUtils]: 25: Hoare triple {792#(= (+ (* main_~v~0 2) (* main_~u~0 main_~u~0)) (+ (* main_~v~0 main_~v~0) (* main_~u~0 2) (* main_~A~0 4)))} call __VERIFIER_assert((if 4 * ~A~0 == ~u~0 * ~u~0 - ~v~0 * ~v~0 - 2 * ~u~0 + 2 * ~v~0 then 1 else 0)); {796#(<= 1 |__VERIFIER_assert_#in~cond|)} is VALID [2022-04-14 16:16:56,405 INFO L290 TraceCheckUtils]: 24: Hoare triple {819#(or (not (= main_~r~0 0)) (= (+ (* main_~v~0 2) (* main_~u~0 main_~u~0)) (+ (* main_~v~0 main_~v~0) (* main_~u~0 2) (* main_~A~0 4))))} assume !(0 != ~r~0); {792#(= (+ (* main_~v~0 2) (* main_~u~0 main_~u~0)) (+ (* main_~v~0 main_~v~0) (* main_~u~0 2) (* main_~A~0 4)))} is VALID [2022-04-14 16:16:56,408 INFO L284 TraceCheckUtils]: 23: Hoare quadruple {781#(not (= |__VERIFIER_assert_#in~cond| 0))} {712#true} #63#return; {819#(or (not (= main_~r~0 0)) (= (+ (* main_~v~0 2) (* main_~u~0 main_~u~0)) (+ (* main_~v~0 main_~v~0) (* main_~u~0 2) (* main_~A~0 4))))} is VALID [2022-04-14 16:16:56,408 INFO L290 TraceCheckUtils]: 22: Hoare triple {781#(not (= |__VERIFIER_assert_#in~cond| 0))} assume true; {781#(not (= |__VERIFIER_assert_#in~cond| 0))} is VALID [2022-04-14 16:16:56,408 INFO L290 TraceCheckUtils]: 21: Hoare triple {832#(or (not (= |__VERIFIER_assert_#in~cond| 0)) (= __VERIFIER_assert_~cond 0))} assume !(0 == ~cond); {781#(not (= |__VERIFIER_assert_#in~cond| 0))} is VALID [2022-04-14 16:16:56,409 INFO L290 TraceCheckUtils]: 20: Hoare triple {712#true} ~cond := #in~cond; {832#(or (not (= |__VERIFIER_assert_#in~cond| 0)) (= __VERIFIER_assert_~cond 0))} is VALID [2022-04-14 16:16:56,409 INFO L272 TraceCheckUtils]: 19: Hoare triple {712#true} call __VERIFIER_assert((if 4 * (~A~0 + ~r~0) == ~u~0 * ~u~0 - ~v~0 * ~v~0 - 2 * ~u~0 + 2 * ~v~0 then 1 else 0)); {712#true} is VALID [2022-04-14 16:16:56,409 INFO L290 TraceCheckUtils]: 18: Hoare triple {712#true} assume !!(#t~post6 < 5);havoc #t~post6; {712#true} is VALID [2022-04-14 16:16:56,409 INFO L290 TraceCheckUtils]: 17: Hoare triple {712#true} #t~post6 := ~counter~0;~counter~0 := 1 + #t~post6; {712#true} is VALID [2022-04-14 16:16:56,409 INFO L290 TraceCheckUtils]: 16: Hoare triple {712#true} ~u~0 := 1 + 2 * ~R~0;~v~0 := 1;~r~0 := ~R~0 * ~R~0 - ~A~0; {712#true} is VALID [2022-04-14 16:16:56,409 INFO L284 TraceCheckUtils]: 15: Hoare quadruple {712#true} {712#true} #61#return; {712#true} is VALID [2022-04-14 16:16:56,409 INFO L290 TraceCheckUtils]: 14: Hoare triple {712#true} assume true; {712#true} is VALID [2022-04-14 16:16:56,410 INFO L290 TraceCheckUtils]: 13: Hoare triple {712#true} assume !(0 == ~cond); {712#true} is VALID [2022-04-14 16:16:56,410 INFO L290 TraceCheckUtils]: 12: Hoare triple {712#true} ~cond := #in~cond; {712#true} is VALID [2022-04-14 16:16:56,411 INFO L272 TraceCheckUtils]: 11: Hoare triple {712#true} call assume_abort_if_not((if 1 == (if ~A~0 < 0 && 0 != ~A~0 % 2 then ~A~0 % 2 - 2 else ~A~0 % 2) then 1 else 0)); {712#true} is VALID [2022-04-14 16:16:56,411 INFO L284 TraceCheckUtils]: 10: Hoare quadruple {712#true} {712#true} #59#return; {712#true} is VALID [2022-04-14 16:16:56,411 INFO L290 TraceCheckUtils]: 9: Hoare triple {712#true} assume true; {712#true} is VALID [2022-04-14 16:16:56,412 INFO L290 TraceCheckUtils]: 8: Hoare triple {712#true} assume !(0 == ~cond); {712#true} is VALID [2022-04-14 16:16:56,412 INFO L290 TraceCheckUtils]: 7: Hoare triple {712#true} ~cond := #in~cond; {712#true} is VALID [2022-04-14 16:16:56,418 INFO L272 TraceCheckUtils]: 6: Hoare triple {712#true} call assume_abort_if_not((if (~R~0 - 1) * (~R~0 - 1) < ~A~0 then 1 else 0)); {712#true} is VALID [2022-04-14 16:16:56,421 INFO L290 TraceCheckUtils]: 5: Hoare triple {712#true} havoc ~A~0;havoc ~R~0;havoc ~u~0;havoc ~v~0;havoc ~r~0;assume -2147483648 <= #t~nondet4 && #t~nondet4 <= 2147483647;~A~0 := #t~nondet4;havoc #t~nondet4;assume -2147483648 <= #t~nondet5 && #t~nondet5 <= 2147483647;~R~0 := #t~nondet5;havoc #t~nondet5; {712#true} is VALID [2022-04-14 16:16:56,421 INFO L272 TraceCheckUtils]: 4: Hoare triple {712#true} call #t~ret7 := main(); {712#true} is VALID [2022-04-14 16:16:56,421 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {712#true} {712#true} #67#return; {712#true} is VALID [2022-04-14 16:16:56,421 INFO L290 TraceCheckUtils]: 2: Hoare triple {712#true} assume true; {712#true} is VALID [2022-04-14 16:16:56,421 INFO L290 TraceCheckUtils]: 1: Hoare triple {712#true} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(13, 2);call #Ultimate.allocInit(12, 3);~counter~0 := 0; {712#true} is VALID [2022-04-14 16:16:56,421 INFO L272 TraceCheckUtils]: 0: Hoare triple {712#true} call ULTIMATE.init(); {712#true} is VALID [2022-04-14 16:16:56,421 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 1 proven. 1 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2022-04-14 16:16:56,421 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-14 16:16:56,422 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1808512858] [2022-04-14 16:16:56,422 WARN L310 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2022-04-14 16:16:56,422 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1497461120] [2022-04-14 16:16:56,422 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1497461120] provided 0 perfect and 2 imperfect interpolant sequences [2022-04-14 16:16:56,422 INFO L184 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2022-04-14 16:16:56,422 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [8, 8] total 10 [2022-04-14 16:16:56,422 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [530626361] [2022-04-14 16:16:56,422 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2022-04-14 16:16:56,423 INFO L78 Accepts]: Start accepts. Automaton has has 10 states, 9 states have (on average 2.111111111111111) internal successors, (19), 7 states have internal predecessors, (19), 2 states have call successors, (6), 2 states have call predecessors, (6), 2 states have return successors, (5), 3 states have call predecessors, (5), 1 states have call successors, (5) Word has length 29 [2022-04-14 16:16:56,423 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-14 16:16:56,423 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with has 10 states, 9 states have (on average 2.111111111111111) internal successors, (19), 7 states have internal predecessors, (19), 2 states have call successors, (6), 2 states have call predecessors, (6), 2 states have return successors, (5), 3 states have call predecessors, (5), 1 states have call successors, (5) [2022-04-14 16:16:56,445 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 30 edges. 30 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-14 16:16:56,445 INFO L554 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2022-04-14 16:16:56,445 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-04-14 16:16:56,446 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2022-04-14 16:16:56,446 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=23, Invalid=67, Unknown=0, NotChecked=0, Total=90 [2022-04-14 16:16:56,446 INFO L87 Difference]: Start difference. First operand 32 states and 36 transitions. Second operand has 10 states, 9 states have (on average 2.111111111111111) internal successors, (19), 7 states have internal predecessors, (19), 2 states have call successors, (6), 2 states have call predecessors, (6), 2 states have return successors, (5), 3 states have call predecessors, (5), 1 states have call successors, (5) [2022-04-14 16:16:56,751 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-14 16:16:56,751 INFO L93 Difference]: Finished difference Result 39 states and 42 transitions. [2022-04-14 16:16:56,751 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2022-04-14 16:16:56,752 INFO L78 Accepts]: Start accepts. Automaton has has 10 states, 9 states have (on average 2.111111111111111) internal successors, (19), 7 states have internal predecessors, (19), 2 states have call successors, (6), 2 states have call predecessors, (6), 2 states have return successors, (5), 3 states have call predecessors, (5), 1 states have call successors, (5) Word has length 29 [2022-04-14 16:16:56,752 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-14 16:16:56,752 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 10 states, 9 states have (on average 2.111111111111111) internal successors, (19), 7 states have internal predecessors, (19), 2 states have call successors, (6), 2 states have call predecessors, (6), 2 states have return successors, (5), 3 states have call predecessors, (5), 1 states have call successors, (5) [2022-04-14 16:16:56,753 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8 states to 8 states and 35 transitions. [2022-04-14 16:16:56,753 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 10 states, 9 states have (on average 2.111111111111111) internal successors, (19), 7 states have internal predecessors, (19), 2 states have call successors, (6), 2 states have call predecessors, (6), 2 states have return successors, (5), 3 states have call predecessors, (5), 1 states have call successors, (5) [2022-04-14 16:16:56,754 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8 states to 8 states and 35 transitions. [2022-04-14 16:16:56,754 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 8 states and 35 transitions. [2022-04-14 16:16:56,792 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 35 edges. 35 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-14 16:16:56,793 INFO L225 Difference]: With dead ends: 39 [2022-04-14 16:16:56,793 INFO L226 Difference]: Without dead ends: 34 [2022-04-14 16:16:56,793 INFO L912 BasicCegarLoop]: 0 DeclaredPredicates, 60 GetRequests, 48 SyntacticMatches, 1 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 10 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=41, Invalid=115, Unknown=0, NotChecked=0, Total=156 [2022-04-14 16:16:56,794 INFO L913 BasicCegarLoop]: 21 mSDtfsCounter, 23 mSDsluCounter, 94 mSDsCounter, 0 mSdLazyCounter, 64 mSolverCounterSat, 6 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 23 SdHoareTripleChecker+Valid, 115 SdHoareTripleChecker+Invalid, 70 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 6 IncrementalHoareTripleChecker+Valid, 64 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-04-14 16:16:56,794 INFO L914 BasicCegarLoop]: SdHoareTripleChecker [23 Valid, 115 Invalid, 70 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [6 Valid, 64 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-04-14 16:16:56,794 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 34 states. [2022-04-14 16:16:56,802 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 34 to 29. [2022-04-14 16:16:56,802 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-14 16:16:56,802 INFO L82 GeneralOperation]: Start isEquivalent. First operand 34 states. Second operand has 29 states, 19 states have (on average 1.105263157894737) internal successors, (21), 19 states have internal predecessors, (21), 6 states have call successors, (6), 5 states have call predecessors, (6), 3 states have return successors, (4), 4 states have call predecessors, (4), 4 states have call successors, (4) [2022-04-14 16:16:56,802 INFO L74 IsIncluded]: Start isIncluded. First operand 34 states. Second operand has 29 states, 19 states have (on average 1.105263157894737) internal successors, (21), 19 states have internal predecessors, (21), 6 states have call successors, (6), 5 states have call predecessors, (6), 3 states have return successors, (4), 4 states have call predecessors, (4), 4 states have call successors, (4) [2022-04-14 16:16:56,802 INFO L87 Difference]: Start difference. First operand 34 states. Second operand has 29 states, 19 states have (on average 1.105263157894737) internal successors, (21), 19 states have internal predecessors, (21), 6 states have call successors, (6), 5 states have call predecessors, (6), 3 states have return successors, (4), 4 states have call predecessors, (4), 4 states have call successors, (4) [2022-04-14 16:16:56,803 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-14 16:16:56,804 INFO L93 Difference]: Finished difference Result 34 states and 36 transitions. [2022-04-14 16:16:56,804 INFO L276 IsEmpty]: Start isEmpty. Operand 34 states and 36 transitions. [2022-04-14 16:16:56,804 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-14 16:16:56,804 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-14 16:16:56,804 INFO L74 IsIncluded]: Start isIncluded. First operand has 29 states, 19 states have (on average 1.105263157894737) internal successors, (21), 19 states have internal predecessors, (21), 6 states have call successors, (6), 5 states have call predecessors, (6), 3 states have return successors, (4), 4 states have call predecessors, (4), 4 states have call successors, (4) Second operand 34 states. [2022-04-14 16:16:56,804 INFO L87 Difference]: Start difference. First operand has 29 states, 19 states have (on average 1.105263157894737) internal successors, (21), 19 states have internal predecessors, (21), 6 states have call successors, (6), 5 states have call predecessors, (6), 3 states have return successors, (4), 4 states have call predecessors, (4), 4 states have call successors, (4) Second operand 34 states. [2022-04-14 16:16:56,805 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-14 16:16:56,805 INFO L93 Difference]: Finished difference Result 34 states and 36 transitions. [2022-04-14 16:16:56,805 INFO L276 IsEmpty]: Start isEmpty. Operand 34 states and 36 transitions. [2022-04-14 16:16:56,806 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-14 16:16:56,806 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-14 16:16:56,806 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-14 16:16:56,806 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-14 16:16:56,806 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 29 states, 19 states have (on average 1.105263157894737) internal successors, (21), 19 states have internal predecessors, (21), 6 states have call successors, (6), 5 states have call predecessors, (6), 3 states have return successors, (4), 4 states have call predecessors, (4), 4 states have call successors, (4) [2022-04-14 16:16:56,807 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 29 states to 29 states and 31 transitions. [2022-04-14 16:16:56,807 INFO L78 Accepts]: Start accepts. Automaton has 29 states and 31 transitions. Word has length 29 [2022-04-14 16:16:56,807 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-14 16:16:56,807 INFO L478 AbstractCegarLoop]: Abstraction has 29 states and 31 transitions. [2022-04-14 16:16:56,807 INFO L479 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 9 states have (on average 2.111111111111111) internal successors, (19), 7 states have internal predecessors, (19), 2 states have call successors, (6), 2 states have call predecessors, (6), 2 states have return successors, (5), 3 states have call predecessors, (5), 1 states have call successors, (5) [2022-04-14 16:16:56,807 INFO L276 IsEmpty]: Start isEmpty. Operand 29 states and 31 transitions. [2022-04-14 16:16:56,808 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 33 [2022-04-14 16:16:56,808 INFO L491 BasicCegarLoop]: Found error trace [2022-04-14 16:16:56,808 INFO L499 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-14 16:16:56,827 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Forceful destruction successful, exit code 0 [2022-04-14 16:16:57,015 WARN L460 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3,5 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-14 16:16:57,015 INFO L403 AbstractCegarLoop]: === Iteration 5 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-14 16:16:57,016 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-14 16:16:57,016 INFO L85 PathProgramCache]: Analyzing trace with hash 1080225052, now seen corresponding path program 1 times [2022-04-14 16:16:57,016 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-14 16:16:57,016 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [335754196] [2022-04-14 16:16:57,016 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-14 16:16:57,016 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-14 16:16:57,026 ERROR L245 FreeRefinementEngine]: Caught known exception: Unsupported non-linear arithmetic [2022-04-14 16:16:57,026 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [903445229] [2022-04-14 16:16:57,026 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-14 16:16:57,027 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-14 16:16:57,027 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-04-14 16:16:57,032 INFO L229 MonitoredProcess]: Starting monitored process 6 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-04-14 16:16:57,033 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (6)] Waiting until timeout for monitored process [2022-04-14 16:16:57,065 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-14 16:16:57,066 INFO L263 TraceCheckSpWp]: Trace formula consists of 113 conjuncts, 7 conjunts are in the unsatisfiable core [2022-04-14 16:16:57,077 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-14 16:16:57,078 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-04-14 16:16:57,224 INFO L272 TraceCheckUtils]: 0: Hoare triple {1066#true} call ULTIMATE.init(); {1066#true} is VALID [2022-04-14 16:16:57,225 INFO L290 TraceCheckUtils]: 1: Hoare triple {1066#true} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(13, 2);call #Ultimate.allocInit(12, 3);~counter~0 := 0; {1074#(<= ~counter~0 0)} is VALID [2022-04-14 16:16:57,225 INFO L290 TraceCheckUtils]: 2: Hoare triple {1074#(<= ~counter~0 0)} assume true; {1074#(<= ~counter~0 0)} is VALID [2022-04-14 16:16:57,226 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {1074#(<= ~counter~0 0)} {1066#true} #67#return; {1074#(<= ~counter~0 0)} is VALID [2022-04-14 16:16:57,226 INFO L272 TraceCheckUtils]: 4: Hoare triple {1074#(<= ~counter~0 0)} call #t~ret7 := main(); {1074#(<= ~counter~0 0)} is VALID [2022-04-14 16:16:57,226 INFO L290 TraceCheckUtils]: 5: Hoare triple {1074#(<= ~counter~0 0)} havoc ~A~0;havoc ~R~0;havoc ~u~0;havoc ~v~0;havoc ~r~0;assume -2147483648 <= #t~nondet4 && #t~nondet4 <= 2147483647;~A~0 := #t~nondet4;havoc #t~nondet4;assume -2147483648 <= #t~nondet5 && #t~nondet5 <= 2147483647;~R~0 := #t~nondet5;havoc #t~nondet5; {1074#(<= ~counter~0 0)} is VALID [2022-04-14 16:16:57,227 INFO L272 TraceCheckUtils]: 6: Hoare triple {1074#(<= ~counter~0 0)} call assume_abort_if_not((if (~R~0 - 1) * (~R~0 - 1) < ~A~0 then 1 else 0)); {1074#(<= ~counter~0 0)} is VALID [2022-04-14 16:16:57,227 INFO L290 TraceCheckUtils]: 7: Hoare triple {1074#(<= ~counter~0 0)} ~cond := #in~cond; {1074#(<= ~counter~0 0)} is VALID [2022-04-14 16:16:57,228 INFO L290 TraceCheckUtils]: 8: Hoare triple {1074#(<= ~counter~0 0)} assume !(0 == ~cond); {1074#(<= ~counter~0 0)} is VALID [2022-04-14 16:16:57,228 INFO L290 TraceCheckUtils]: 9: Hoare triple {1074#(<= ~counter~0 0)} assume true; {1074#(<= ~counter~0 0)} is VALID [2022-04-14 16:16:57,229 INFO L284 TraceCheckUtils]: 10: Hoare quadruple {1074#(<= ~counter~0 0)} {1074#(<= ~counter~0 0)} #59#return; {1074#(<= ~counter~0 0)} is VALID [2022-04-14 16:16:57,229 INFO L272 TraceCheckUtils]: 11: Hoare triple {1074#(<= ~counter~0 0)} call assume_abort_if_not((if 1 == (if ~A~0 < 0 && 0 != ~A~0 % 2 then ~A~0 % 2 - 2 else ~A~0 % 2) then 1 else 0)); {1074#(<= ~counter~0 0)} is VALID [2022-04-14 16:16:57,229 INFO L290 TraceCheckUtils]: 12: Hoare triple {1074#(<= ~counter~0 0)} ~cond := #in~cond; {1074#(<= ~counter~0 0)} is VALID [2022-04-14 16:16:57,230 INFO L290 TraceCheckUtils]: 13: Hoare triple {1074#(<= ~counter~0 0)} assume !(0 == ~cond); {1074#(<= ~counter~0 0)} is VALID [2022-04-14 16:16:57,230 INFO L290 TraceCheckUtils]: 14: Hoare triple {1074#(<= ~counter~0 0)} assume true; {1074#(<= ~counter~0 0)} is VALID [2022-04-14 16:16:57,231 INFO L284 TraceCheckUtils]: 15: Hoare quadruple {1074#(<= ~counter~0 0)} {1074#(<= ~counter~0 0)} #61#return; {1074#(<= ~counter~0 0)} is VALID [2022-04-14 16:16:57,231 INFO L290 TraceCheckUtils]: 16: Hoare triple {1074#(<= ~counter~0 0)} ~u~0 := 1 + 2 * ~R~0;~v~0 := 1;~r~0 := ~R~0 * ~R~0 - ~A~0; {1074#(<= ~counter~0 0)} is VALID [2022-04-14 16:16:57,232 INFO L290 TraceCheckUtils]: 17: Hoare triple {1074#(<= ~counter~0 0)} #t~post6 := ~counter~0;~counter~0 := 1 + #t~post6; {1123#(<= ~counter~0 1)} is VALID [2022-04-14 16:16:57,232 INFO L290 TraceCheckUtils]: 18: Hoare triple {1123#(<= ~counter~0 1)} assume !!(#t~post6 < 5);havoc #t~post6; {1123#(<= ~counter~0 1)} is VALID [2022-04-14 16:16:57,233 INFO L272 TraceCheckUtils]: 19: Hoare triple {1123#(<= ~counter~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)); {1123#(<= ~counter~0 1)} is VALID [2022-04-14 16:16:57,233 INFO L290 TraceCheckUtils]: 20: Hoare triple {1123#(<= ~counter~0 1)} ~cond := #in~cond; {1123#(<= ~counter~0 1)} is VALID [2022-04-14 16:16:57,233 INFO L290 TraceCheckUtils]: 21: Hoare triple {1123#(<= ~counter~0 1)} assume !(0 == ~cond); {1123#(<= ~counter~0 1)} is VALID [2022-04-14 16:16:57,234 INFO L290 TraceCheckUtils]: 22: Hoare triple {1123#(<= ~counter~0 1)} assume true; {1123#(<= ~counter~0 1)} is VALID [2022-04-14 16:16:57,234 INFO L284 TraceCheckUtils]: 23: Hoare quadruple {1123#(<= ~counter~0 1)} {1123#(<= ~counter~0 1)} #63#return; {1123#(<= ~counter~0 1)} is VALID [2022-04-14 16:16:57,235 INFO L290 TraceCheckUtils]: 24: Hoare triple {1123#(<= ~counter~0 1)} assume !!(0 != ~r~0); {1123#(<= ~counter~0 1)} is VALID [2022-04-14 16:16:57,235 INFO L290 TraceCheckUtils]: 25: Hoare triple {1123#(<= ~counter~0 1)} assume ~r~0 > 0;~r~0 := ~r~0 - ~v~0;~v~0 := 2 + ~v~0; {1123#(<= ~counter~0 1)} is VALID [2022-04-14 16:16:57,235 INFO L290 TraceCheckUtils]: 26: Hoare triple {1123#(<= ~counter~0 1)} #t~post6 := ~counter~0;~counter~0 := 1 + #t~post6; {1151#(<= |main_#t~post6| 1)} is VALID [2022-04-14 16:16:57,236 INFO L290 TraceCheckUtils]: 27: Hoare triple {1151#(<= |main_#t~post6| 1)} assume !(#t~post6 < 5);havoc #t~post6; {1067#false} is VALID [2022-04-14 16:16:57,236 INFO L272 TraceCheckUtils]: 28: Hoare triple {1067#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)); {1067#false} is VALID [2022-04-14 16:16:57,236 INFO L290 TraceCheckUtils]: 29: Hoare triple {1067#false} ~cond := #in~cond; {1067#false} is VALID [2022-04-14 16:16:57,236 INFO L290 TraceCheckUtils]: 30: Hoare triple {1067#false} assume 0 == ~cond; {1067#false} is VALID [2022-04-14 16:16:57,236 INFO L290 TraceCheckUtils]: 31: Hoare triple {1067#false} assume !false; {1067#false} is VALID [2022-04-14 16:16:57,236 INFO L134 CoverageAnalysis]: Checked inductivity of 8 backedges. 2 proven. 2 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2022-04-14 16:16:57,236 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-04-14 16:16:57,404 INFO L290 TraceCheckUtils]: 31: Hoare triple {1067#false} assume !false; {1067#false} is VALID [2022-04-14 16:16:57,405 INFO L290 TraceCheckUtils]: 30: Hoare triple {1067#false} assume 0 == ~cond; {1067#false} is VALID [2022-04-14 16:16:57,405 INFO L290 TraceCheckUtils]: 29: Hoare triple {1067#false} ~cond := #in~cond; {1067#false} is VALID [2022-04-14 16:16:57,405 INFO L272 TraceCheckUtils]: 28: Hoare triple {1067#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)); {1067#false} is VALID [2022-04-14 16:16:57,405 INFO L290 TraceCheckUtils]: 27: Hoare triple {1179#(< |main_#t~post6| 5)} assume !(#t~post6 < 5);havoc #t~post6; {1067#false} is VALID [2022-04-14 16:16:57,406 INFO L290 TraceCheckUtils]: 26: Hoare triple {1183#(< ~counter~0 5)} #t~post6 := ~counter~0;~counter~0 := 1 + #t~post6; {1179#(< |main_#t~post6| 5)} is VALID [2022-04-14 16:16:57,406 INFO L290 TraceCheckUtils]: 25: Hoare triple {1183#(< ~counter~0 5)} assume ~r~0 > 0;~r~0 := ~r~0 - ~v~0;~v~0 := 2 + ~v~0; {1183#(< ~counter~0 5)} is VALID [2022-04-14 16:16:57,406 INFO L290 TraceCheckUtils]: 24: Hoare triple {1183#(< ~counter~0 5)} assume !!(0 != ~r~0); {1183#(< ~counter~0 5)} is VALID [2022-04-14 16:16:57,407 INFO L284 TraceCheckUtils]: 23: Hoare quadruple {1066#true} {1183#(< ~counter~0 5)} #63#return; {1183#(< ~counter~0 5)} is VALID [2022-04-14 16:16:57,407 INFO L290 TraceCheckUtils]: 22: Hoare triple {1066#true} assume true; {1066#true} is VALID [2022-04-14 16:16:57,407 INFO L290 TraceCheckUtils]: 21: Hoare triple {1066#true} assume !(0 == ~cond); {1066#true} is VALID [2022-04-14 16:16:57,407 INFO L290 TraceCheckUtils]: 20: Hoare triple {1066#true} ~cond := #in~cond; {1066#true} is VALID [2022-04-14 16:16:57,407 INFO L272 TraceCheckUtils]: 19: Hoare triple {1183#(< ~counter~0 5)} 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)); {1066#true} is VALID [2022-04-14 16:16:57,408 INFO L290 TraceCheckUtils]: 18: Hoare triple {1183#(< ~counter~0 5)} assume !!(#t~post6 < 5);havoc #t~post6; {1183#(< ~counter~0 5)} is VALID [2022-04-14 16:16:57,408 INFO L290 TraceCheckUtils]: 17: Hoare triple {1211#(< ~counter~0 4)} #t~post6 := ~counter~0;~counter~0 := 1 + #t~post6; {1183#(< ~counter~0 5)} is VALID [2022-04-14 16:16:57,408 INFO L290 TraceCheckUtils]: 16: Hoare triple {1211#(< ~counter~0 4)} ~u~0 := 1 + 2 * ~R~0;~v~0 := 1;~r~0 := ~R~0 * ~R~0 - ~A~0; {1211#(< ~counter~0 4)} is VALID [2022-04-14 16:16:57,409 INFO L284 TraceCheckUtils]: 15: Hoare quadruple {1066#true} {1211#(< ~counter~0 4)} #61#return; {1211#(< ~counter~0 4)} is VALID [2022-04-14 16:16:57,409 INFO L290 TraceCheckUtils]: 14: Hoare triple {1066#true} assume true; {1066#true} is VALID [2022-04-14 16:16:57,409 INFO L290 TraceCheckUtils]: 13: Hoare triple {1066#true} assume !(0 == ~cond); {1066#true} is VALID [2022-04-14 16:16:57,409 INFO L290 TraceCheckUtils]: 12: Hoare triple {1066#true} ~cond := #in~cond; {1066#true} is VALID [2022-04-14 16:16:57,409 INFO L272 TraceCheckUtils]: 11: Hoare triple {1211#(< ~counter~0 4)} 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)); {1066#true} is VALID [2022-04-14 16:16:57,410 INFO L284 TraceCheckUtils]: 10: Hoare quadruple {1066#true} {1211#(< ~counter~0 4)} #59#return; {1211#(< ~counter~0 4)} is VALID [2022-04-14 16:16:57,410 INFO L290 TraceCheckUtils]: 9: Hoare triple {1066#true} assume true; {1066#true} is VALID [2022-04-14 16:16:57,410 INFO L290 TraceCheckUtils]: 8: Hoare triple {1066#true} assume !(0 == ~cond); {1066#true} is VALID [2022-04-14 16:16:57,410 INFO L290 TraceCheckUtils]: 7: Hoare triple {1066#true} ~cond := #in~cond; {1066#true} is VALID [2022-04-14 16:16:57,410 INFO L272 TraceCheckUtils]: 6: Hoare triple {1211#(< ~counter~0 4)} call assume_abort_if_not((if (~R~0 - 1) * (~R~0 - 1) < ~A~0 then 1 else 0)); {1066#true} is VALID [2022-04-14 16:16:57,411 INFO L290 TraceCheckUtils]: 5: Hoare triple {1211#(< ~counter~0 4)} havoc ~A~0;havoc ~R~0;havoc ~u~0;havoc ~v~0;havoc ~r~0;assume -2147483648 <= #t~nondet4 && #t~nondet4 <= 2147483647;~A~0 := #t~nondet4;havoc #t~nondet4;assume -2147483648 <= #t~nondet5 && #t~nondet5 <= 2147483647;~R~0 := #t~nondet5;havoc #t~nondet5; {1211#(< ~counter~0 4)} is VALID [2022-04-14 16:16:57,411 INFO L272 TraceCheckUtils]: 4: Hoare triple {1211#(< ~counter~0 4)} call #t~ret7 := main(); {1211#(< ~counter~0 4)} is VALID [2022-04-14 16:16:57,411 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {1211#(< ~counter~0 4)} {1066#true} #67#return; {1211#(< ~counter~0 4)} is VALID [2022-04-14 16:16:57,412 INFO L290 TraceCheckUtils]: 2: Hoare triple {1211#(< ~counter~0 4)} assume true; {1211#(< ~counter~0 4)} is VALID [2022-04-14 16:16:57,412 INFO L290 TraceCheckUtils]: 1: Hoare triple {1066#true} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(13, 2);call #Ultimate.allocInit(12, 3);~counter~0 := 0; {1211#(< ~counter~0 4)} is VALID [2022-04-14 16:16:57,412 INFO L272 TraceCheckUtils]: 0: Hoare triple {1066#true} call ULTIMATE.init(); {1066#true} is VALID [2022-04-14 16:16:57,413 INFO L134 CoverageAnalysis]: Checked inductivity of 8 backedges. 2 proven. 2 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2022-04-14 16:16:57,413 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-14 16:16:57,413 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [335754196] [2022-04-14 16:16:57,413 WARN L310 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2022-04-14 16:16:57,413 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [903445229] [2022-04-14 16:16:57,413 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [903445229] provided 0 perfect and 2 imperfect interpolant sequences [2022-04-14 16:16:57,413 INFO L184 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2022-04-14 16:16:57,413 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [5, 5] total 8 [2022-04-14 16:16:57,413 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [596659870] [2022-04-14 16:16:57,413 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2022-04-14 16:16:57,414 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 8 states have (on average 4.375) internal successors, (35), 8 states have internal predecessors, (35), 6 states have call successors, (10), 5 states have call predecessors, (10), 4 states have return successors, (8), 4 states have call predecessors, (8), 5 states have call successors, (8) Word has length 32 [2022-04-14 16:16:57,414 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-14 16:16:57,414 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with has 8 states, 8 states have (on average 4.375) internal successors, (35), 8 states have internal predecessors, (35), 6 states have call successors, (10), 5 states have call predecessors, (10), 4 states have return successors, (8), 4 states have call predecessors, (8), 5 states have call successors, (8) [2022-04-14 16:16:57,452 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 53 edges. 53 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-14 16:16:57,452 INFO L554 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2022-04-14 16:16:57,452 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-04-14 16:16:57,453 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2022-04-14 16:16:57,453 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=20, Invalid=36, Unknown=0, NotChecked=0, Total=56 [2022-04-14 16:16:57,453 INFO L87 Difference]: Start difference. First operand 29 states and 31 transitions. Second operand has 8 states, 8 states have (on average 4.375) internal successors, (35), 8 states have internal predecessors, (35), 6 states have call successors, (10), 5 states have call predecessors, (10), 4 states have return successors, (8), 4 states have call predecessors, (8), 5 states have call successors, (8) [2022-04-14 16:16:57,629 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-14 16:16:57,630 INFO L93 Difference]: Finished difference Result 61 states and 68 transitions. [2022-04-14 16:16:57,630 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2022-04-14 16:16:57,630 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 8 states have (on average 4.375) internal successors, (35), 8 states have internal predecessors, (35), 6 states have call successors, (10), 5 states have call predecessors, (10), 4 states have return successors, (8), 4 states have call predecessors, (8), 5 states have call successors, (8) Word has length 32 [2022-04-14 16:16:57,631 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-14 16:16:57,632 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 8 states, 8 states have (on average 4.375) internal successors, (35), 8 states have internal predecessors, (35), 6 states have call successors, (10), 5 states have call predecessors, (10), 4 states have return successors, (8), 4 states have call predecessors, (8), 5 states have call successors, (8) [2022-04-14 16:16:57,638 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 10 states to 10 states and 67 transitions. [2022-04-14 16:16:57,639 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 8 states, 8 states have (on average 4.375) internal successors, (35), 8 states have internal predecessors, (35), 6 states have call successors, (10), 5 states have call predecessors, (10), 4 states have return successors, (8), 4 states have call predecessors, (8), 5 states have call successors, (8) [2022-04-14 16:16:57,642 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 10 states to 10 states and 67 transitions. [2022-04-14 16:16:57,642 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 10 states and 67 transitions. [2022-04-14 16:16:57,693 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 67 edges. 67 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-14 16:16:57,694 INFO L225 Difference]: With dead ends: 61 [2022-04-14 16:16:57,694 INFO L226 Difference]: Without dead ends: 56 [2022-04-14 16:16:57,695 INFO L912 BasicCegarLoop]: 0 DeclaredPredicates, 66 GetRequests, 57 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 7 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=40, Invalid=70, Unknown=0, NotChecked=0, Total=110 [2022-04-14 16:16:57,695 INFO L913 BasicCegarLoop]: 29 mSDtfsCounter, 32 mSDsluCounter, 99 mSDsCounter, 0 mSdLazyCounter, 24 mSolverCounterSat, 20 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 32 SdHoareTripleChecker+Valid, 128 SdHoareTripleChecker+Invalid, 44 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 20 IncrementalHoareTripleChecker+Valid, 24 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-04-14 16:16:57,695 INFO L914 BasicCegarLoop]: SdHoareTripleChecker [32 Valid, 128 Invalid, 44 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [20 Valid, 24 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-04-14 16:16:57,696 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 56 states. [2022-04-14 16:16:57,707 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 56 to 56. [2022-04-14 16:16:57,707 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-14 16:16:57,708 INFO L82 GeneralOperation]: Start isEquivalent. First operand 56 states. Second operand has 56 states, 40 states have (on average 1.125) internal successors, (45), 40 states have internal predecessors, (45), 9 states have call successors, (9), 8 states have call predecessors, (9), 6 states have return successors, (7), 7 states have call predecessors, (7), 7 states have call successors, (7) [2022-04-14 16:16:57,708 INFO L74 IsIncluded]: Start isIncluded. First operand 56 states. Second operand has 56 states, 40 states have (on average 1.125) internal successors, (45), 40 states have internal predecessors, (45), 9 states have call successors, (9), 8 states have call predecessors, (9), 6 states have return successors, (7), 7 states have call predecessors, (7), 7 states have call successors, (7) [2022-04-14 16:16:57,708 INFO L87 Difference]: Start difference. First operand 56 states. Second operand has 56 states, 40 states have (on average 1.125) internal successors, (45), 40 states have internal predecessors, (45), 9 states have call successors, (9), 8 states have call predecessors, (9), 6 states have return successors, (7), 7 states have call predecessors, (7), 7 states have call successors, (7) [2022-04-14 16:16:57,710 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-14 16:16:57,710 INFO L93 Difference]: Finished difference Result 56 states and 61 transitions. [2022-04-14 16:16:57,710 INFO L276 IsEmpty]: Start isEmpty. Operand 56 states and 61 transitions. [2022-04-14 16:16:57,710 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-14 16:16:57,710 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-14 16:16:57,710 INFO L74 IsIncluded]: Start isIncluded. First operand has 56 states, 40 states have (on average 1.125) internal successors, (45), 40 states have internal predecessors, (45), 9 states have call successors, (9), 8 states have call predecessors, (9), 6 states have return successors, (7), 7 states have call predecessors, (7), 7 states have call successors, (7) Second operand 56 states. [2022-04-14 16:16:57,711 INFO L87 Difference]: Start difference. First operand has 56 states, 40 states have (on average 1.125) internal successors, (45), 40 states have internal predecessors, (45), 9 states have call successors, (9), 8 states have call predecessors, (9), 6 states have return successors, (7), 7 states have call predecessors, (7), 7 states have call successors, (7) Second operand 56 states. [2022-04-14 16:16:57,712 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-14 16:16:57,712 INFO L93 Difference]: Finished difference Result 56 states and 61 transitions. [2022-04-14 16:16:57,712 INFO L276 IsEmpty]: Start isEmpty. Operand 56 states and 61 transitions. [2022-04-14 16:16:57,713 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-14 16:16:57,713 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-14 16:16:57,713 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-14 16:16:57,713 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-14 16:16:57,713 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 56 states, 40 states have (on average 1.125) internal successors, (45), 40 states have internal predecessors, (45), 9 states have call successors, (9), 8 states have call predecessors, (9), 6 states have return successors, (7), 7 states have call predecessors, (7), 7 states have call successors, (7) [2022-04-14 16:16:57,714 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 56 states to 56 states and 61 transitions. [2022-04-14 16:16:57,715 INFO L78 Accepts]: Start accepts. Automaton has 56 states and 61 transitions. Word has length 32 [2022-04-14 16:16:57,715 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-14 16:16:57,715 INFO L478 AbstractCegarLoop]: Abstraction has 56 states and 61 transitions. [2022-04-14 16:16:57,715 INFO L479 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 4.375) internal successors, (35), 8 states have internal predecessors, (35), 6 states have call successors, (10), 5 states have call predecessors, (10), 4 states have return successors, (8), 4 states have call predecessors, (8), 5 states have call successors, (8) [2022-04-14 16:16:57,715 INFO L276 IsEmpty]: Start isEmpty. Operand 56 states and 61 transitions. [2022-04-14 16:16:57,716 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 60 [2022-04-14 16:16:57,716 INFO L491 BasicCegarLoop]: Found error trace [2022-04-14 16:16:57,716 INFO L499 BasicCegarLoop]: trace histogram [5, 5, 4, 4, 4, 4, 4, 4, 4, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-14 16:16:57,734 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (6)] Forceful destruction successful, exit code 0 [2022-04-14 16:16:57,932 WARN L460 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4,6 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-14 16:16:57,932 INFO L403 AbstractCegarLoop]: === Iteration 6 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-14 16:16:57,932 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-14 16:16:57,932 INFO L85 PathProgramCache]: Analyzing trace with hash 1632159894, now seen corresponding path program 2 times [2022-04-14 16:16:57,933 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-14 16:16:57,933 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [479527888] [2022-04-14 16:16:57,933 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-14 16:16:57,933 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-14 16:16:57,944 ERROR L245 FreeRefinementEngine]: Caught known exception: Unsupported non-linear arithmetic [2022-04-14 16:16:57,944 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [2145800060] [2022-04-14 16:16:57,944 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2022-04-14 16:16:57,944 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-14 16:16:57,944 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-04-14 16:16:57,945 INFO L229 MonitoredProcess]: Starting monitored process 7 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-04-14 16:16:57,946 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (7)] Waiting until timeout for monitored process [2022-04-14 16:16:57,991 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2022-04-14 16:16:57,991 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-04-14 16:16:57,992 INFO L263 TraceCheckSpWp]: Trace formula consists of 173 conjuncts, 13 conjunts are in the unsatisfiable core [2022-04-14 16:16:58,005 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-14 16:16:58,006 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-04-14 16:16:58,304 INFO L272 TraceCheckUtils]: 0: Hoare triple {1546#true} call ULTIMATE.init(); {1546#true} is VALID [2022-04-14 16:16:58,304 INFO L290 TraceCheckUtils]: 1: Hoare triple {1546#true} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(13, 2);call #Ultimate.allocInit(12, 3);~counter~0 := 0; {1554#(<= ~counter~0 0)} is VALID [2022-04-14 16:16:58,305 INFO L290 TraceCheckUtils]: 2: Hoare triple {1554#(<= ~counter~0 0)} assume true; {1554#(<= ~counter~0 0)} is VALID [2022-04-14 16:16:58,305 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {1554#(<= ~counter~0 0)} {1546#true} #67#return; {1554#(<= ~counter~0 0)} is VALID [2022-04-14 16:16:58,305 INFO L272 TraceCheckUtils]: 4: Hoare triple {1554#(<= ~counter~0 0)} call #t~ret7 := main(); {1554#(<= ~counter~0 0)} is VALID [2022-04-14 16:16:58,306 INFO L290 TraceCheckUtils]: 5: Hoare triple {1554#(<= ~counter~0 0)} havoc ~A~0;havoc ~R~0;havoc ~u~0;havoc ~v~0;havoc ~r~0;assume -2147483648 <= #t~nondet4 && #t~nondet4 <= 2147483647;~A~0 := #t~nondet4;havoc #t~nondet4;assume -2147483648 <= #t~nondet5 && #t~nondet5 <= 2147483647;~R~0 := #t~nondet5;havoc #t~nondet5; {1554#(<= ~counter~0 0)} is VALID [2022-04-14 16:16:58,306 INFO L272 TraceCheckUtils]: 6: Hoare triple {1554#(<= ~counter~0 0)} call assume_abort_if_not((if (~R~0 - 1) * (~R~0 - 1) < ~A~0 then 1 else 0)); {1554#(<= ~counter~0 0)} is VALID [2022-04-14 16:16:58,306 INFO L290 TraceCheckUtils]: 7: Hoare triple {1554#(<= ~counter~0 0)} ~cond := #in~cond; {1554#(<= ~counter~0 0)} is VALID [2022-04-14 16:16:58,307 INFO L290 TraceCheckUtils]: 8: Hoare triple {1554#(<= ~counter~0 0)} assume !(0 == ~cond); {1554#(<= ~counter~0 0)} is VALID [2022-04-14 16:16:58,310 INFO L290 TraceCheckUtils]: 9: Hoare triple {1554#(<= ~counter~0 0)} assume true; {1554#(<= ~counter~0 0)} is VALID [2022-04-14 16:16:58,310 INFO L284 TraceCheckUtils]: 10: Hoare quadruple {1554#(<= ~counter~0 0)} {1554#(<= ~counter~0 0)} #59#return; {1554#(<= ~counter~0 0)} is VALID [2022-04-14 16:16:58,311 INFO L272 TraceCheckUtils]: 11: Hoare triple {1554#(<= ~counter~0 0)} call assume_abort_if_not((if 1 == (if ~A~0 < 0 && 0 != ~A~0 % 2 then ~A~0 % 2 - 2 else ~A~0 % 2) then 1 else 0)); {1554#(<= ~counter~0 0)} is VALID [2022-04-14 16:16:58,311 INFO L290 TraceCheckUtils]: 12: Hoare triple {1554#(<= ~counter~0 0)} ~cond := #in~cond; {1554#(<= ~counter~0 0)} is VALID [2022-04-14 16:16:58,312 INFO L290 TraceCheckUtils]: 13: Hoare triple {1554#(<= ~counter~0 0)} assume !(0 == ~cond); {1554#(<= ~counter~0 0)} is VALID [2022-04-14 16:16:58,312 INFO L290 TraceCheckUtils]: 14: Hoare triple {1554#(<= ~counter~0 0)} assume true; {1554#(<= ~counter~0 0)} is VALID [2022-04-14 16:16:58,313 INFO L284 TraceCheckUtils]: 15: Hoare quadruple {1554#(<= ~counter~0 0)} {1554#(<= ~counter~0 0)} #61#return; {1554#(<= ~counter~0 0)} is VALID [2022-04-14 16:16:58,313 INFO L290 TraceCheckUtils]: 16: Hoare triple {1554#(<= ~counter~0 0)} ~u~0 := 1 + 2 * ~R~0;~v~0 := 1;~r~0 := ~R~0 * ~R~0 - ~A~0; {1554#(<= ~counter~0 0)} is VALID [2022-04-14 16:16:58,313 INFO L290 TraceCheckUtils]: 17: Hoare triple {1554#(<= ~counter~0 0)} #t~post6 := ~counter~0;~counter~0 := 1 + #t~post6; {1603#(<= ~counter~0 1)} is VALID [2022-04-14 16:16:58,314 INFO L290 TraceCheckUtils]: 18: Hoare triple {1603#(<= ~counter~0 1)} assume !!(#t~post6 < 5);havoc #t~post6; {1603#(<= ~counter~0 1)} is VALID [2022-04-14 16:16:58,315 INFO L272 TraceCheckUtils]: 19: Hoare triple {1603#(<= ~counter~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)); {1603#(<= ~counter~0 1)} is VALID [2022-04-14 16:16:58,315 INFO L290 TraceCheckUtils]: 20: Hoare triple {1603#(<= ~counter~0 1)} ~cond := #in~cond; {1603#(<= ~counter~0 1)} is VALID [2022-04-14 16:16:58,315 INFO L290 TraceCheckUtils]: 21: Hoare triple {1603#(<= ~counter~0 1)} assume !(0 == ~cond); {1603#(<= ~counter~0 1)} is VALID [2022-04-14 16:16:58,316 INFO L290 TraceCheckUtils]: 22: Hoare triple {1603#(<= ~counter~0 1)} assume true; {1603#(<= ~counter~0 1)} is VALID [2022-04-14 16:16:58,316 INFO L284 TraceCheckUtils]: 23: Hoare quadruple {1603#(<= ~counter~0 1)} {1603#(<= ~counter~0 1)} #63#return; {1603#(<= ~counter~0 1)} is VALID [2022-04-14 16:16:58,317 INFO L290 TraceCheckUtils]: 24: Hoare triple {1603#(<= ~counter~0 1)} assume !!(0 != ~r~0); {1603#(<= ~counter~0 1)} is VALID [2022-04-14 16:16:58,317 INFO L290 TraceCheckUtils]: 25: Hoare triple {1603#(<= ~counter~0 1)} assume ~r~0 > 0;~r~0 := ~r~0 - ~v~0;~v~0 := 2 + ~v~0; {1603#(<= ~counter~0 1)} is VALID [2022-04-14 16:16:58,317 INFO L290 TraceCheckUtils]: 26: Hoare triple {1603#(<= ~counter~0 1)} #t~post6 := ~counter~0;~counter~0 := 1 + #t~post6; {1631#(<= ~counter~0 2)} is VALID [2022-04-14 16:16:58,318 INFO L290 TraceCheckUtils]: 27: Hoare triple {1631#(<= ~counter~0 2)} assume !!(#t~post6 < 5);havoc #t~post6; {1631#(<= ~counter~0 2)} is VALID [2022-04-14 16:16:58,318 INFO L272 TraceCheckUtils]: 28: Hoare triple {1631#(<= ~counter~0 2)} 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)); {1631#(<= ~counter~0 2)} is VALID [2022-04-14 16:16:58,318 INFO L290 TraceCheckUtils]: 29: Hoare triple {1631#(<= ~counter~0 2)} ~cond := #in~cond; {1631#(<= ~counter~0 2)} is VALID [2022-04-14 16:16:58,319 INFO L290 TraceCheckUtils]: 30: Hoare triple {1631#(<= ~counter~0 2)} assume !(0 == ~cond); {1631#(<= ~counter~0 2)} is VALID [2022-04-14 16:16:58,319 INFO L290 TraceCheckUtils]: 31: Hoare triple {1631#(<= ~counter~0 2)} assume true; {1631#(<= ~counter~0 2)} is VALID [2022-04-14 16:16:58,320 INFO L284 TraceCheckUtils]: 32: Hoare quadruple {1631#(<= ~counter~0 2)} {1631#(<= ~counter~0 2)} #63#return; {1631#(<= ~counter~0 2)} is VALID [2022-04-14 16:16:58,320 INFO L290 TraceCheckUtils]: 33: Hoare triple {1631#(<= ~counter~0 2)} assume !!(0 != ~r~0); {1631#(<= ~counter~0 2)} is VALID [2022-04-14 16:16:58,320 INFO L290 TraceCheckUtils]: 34: Hoare triple {1631#(<= ~counter~0 2)} assume ~r~0 > 0;~r~0 := ~r~0 - ~v~0;~v~0 := 2 + ~v~0; {1631#(<= ~counter~0 2)} is VALID [2022-04-14 16:16:58,320 INFO L290 TraceCheckUtils]: 35: Hoare triple {1631#(<= ~counter~0 2)} #t~post6 := ~counter~0;~counter~0 := 1 + #t~post6; {1659#(<= ~counter~0 3)} is VALID [2022-04-14 16:16:58,321 INFO L290 TraceCheckUtils]: 36: Hoare triple {1659#(<= ~counter~0 3)} assume !!(#t~post6 < 5);havoc #t~post6; {1659#(<= ~counter~0 3)} is VALID [2022-04-14 16:16:58,321 INFO L272 TraceCheckUtils]: 37: Hoare triple {1659#(<= ~counter~0 3)} 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)); {1659#(<= ~counter~0 3)} is VALID [2022-04-14 16:16:58,322 INFO L290 TraceCheckUtils]: 38: Hoare triple {1659#(<= ~counter~0 3)} ~cond := #in~cond; {1659#(<= ~counter~0 3)} is VALID [2022-04-14 16:16:58,322 INFO L290 TraceCheckUtils]: 39: Hoare triple {1659#(<= ~counter~0 3)} assume !(0 == ~cond); {1659#(<= ~counter~0 3)} is VALID [2022-04-14 16:16:58,322 INFO L290 TraceCheckUtils]: 40: Hoare triple {1659#(<= ~counter~0 3)} assume true; {1659#(<= ~counter~0 3)} is VALID [2022-04-14 16:16:58,323 INFO L284 TraceCheckUtils]: 41: Hoare quadruple {1659#(<= ~counter~0 3)} {1659#(<= ~counter~0 3)} #63#return; {1659#(<= ~counter~0 3)} is VALID [2022-04-14 16:16:58,323 INFO L290 TraceCheckUtils]: 42: Hoare triple {1659#(<= ~counter~0 3)} assume !!(0 != ~r~0); {1659#(<= ~counter~0 3)} is VALID [2022-04-14 16:16:58,323 INFO L290 TraceCheckUtils]: 43: Hoare triple {1659#(<= ~counter~0 3)} assume ~r~0 > 0;~r~0 := ~r~0 - ~v~0;~v~0 := 2 + ~v~0; {1659#(<= ~counter~0 3)} is VALID [2022-04-14 16:16:58,324 INFO L290 TraceCheckUtils]: 44: Hoare triple {1659#(<= ~counter~0 3)} #t~post6 := ~counter~0;~counter~0 := 1 + #t~post6; {1687#(<= ~counter~0 4)} is VALID [2022-04-14 16:16:58,324 INFO L290 TraceCheckUtils]: 45: Hoare triple {1687#(<= ~counter~0 4)} assume !!(#t~post6 < 5);havoc #t~post6; {1687#(<= ~counter~0 4)} is VALID [2022-04-14 16:16:58,325 INFO L272 TraceCheckUtils]: 46: Hoare triple {1687#(<= ~counter~0 4)} 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)); {1687#(<= ~counter~0 4)} is VALID [2022-04-14 16:16:58,325 INFO L290 TraceCheckUtils]: 47: Hoare triple {1687#(<= ~counter~0 4)} ~cond := #in~cond; {1687#(<= ~counter~0 4)} is VALID [2022-04-14 16:16:58,325 INFO L290 TraceCheckUtils]: 48: Hoare triple {1687#(<= ~counter~0 4)} assume !(0 == ~cond); {1687#(<= ~counter~0 4)} is VALID [2022-04-14 16:16:58,325 INFO L290 TraceCheckUtils]: 49: Hoare triple {1687#(<= ~counter~0 4)} assume true; {1687#(<= ~counter~0 4)} is VALID [2022-04-14 16:16:58,326 INFO L284 TraceCheckUtils]: 50: Hoare quadruple {1687#(<= ~counter~0 4)} {1687#(<= ~counter~0 4)} #63#return; {1687#(<= ~counter~0 4)} is VALID [2022-04-14 16:16:58,326 INFO L290 TraceCheckUtils]: 51: Hoare triple {1687#(<= ~counter~0 4)} assume !!(0 != ~r~0); {1687#(<= ~counter~0 4)} is VALID [2022-04-14 16:16:58,327 INFO L290 TraceCheckUtils]: 52: Hoare triple {1687#(<= ~counter~0 4)} assume ~r~0 > 0;~r~0 := ~r~0 - ~v~0;~v~0 := 2 + ~v~0; {1687#(<= ~counter~0 4)} is VALID [2022-04-14 16:16:58,331 INFO L290 TraceCheckUtils]: 53: Hoare triple {1687#(<= ~counter~0 4)} #t~post6 := ~counter~0;~counter~0 := 1 + #t~post6; {1715#(<= |main_#t~post6| 4)} is VALID [2022-04-14 16:16:58,332 INFO L290 TraceCheckUtils]: 54: Hoare triple {1715#(<= |main_#t~post6| 4)} assume !(#t~post6 < 5);havoc #t~post6; {1547#false} is VALID [2022-04-14 16:16:58,332 INFO L272 TraceCheckUtils]: 55: Hoare triple {1547#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)); {1547#false} is VALID [2022-04-14 16:16:58,332 INFO L290 TraceCheckUtils]: 56: Hoare triple {1547#false} ~cond := #in~cond; {1547#false} is VALID [2022-04-14 16:16:58,332 INFO L290 TraceCheckUtils]: 57: Hoare triple {1547#false} assume 0 == ~cond; {1547#false} is VALID [2022-04-14 16:16:58,332 INFO L290 TraceCheckUtils]: 58: Hoare triple {1547#false} assume !false; {1547#false} is VALID [2022-04-14 16:16:58,332 INFO L134 CoverageAnalysis]: Checked inductivity of 74 backedges. 8 proven. 62 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2022-04-14 16:16:58,332 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-04-14 16:16:58,617 INFO L290 TraceCheckUtils]: 58: Hoare triple {1547#false} assume !false; {1547#false} is VALID [2022-04-14 16:16:58,617 INFO L290 TraceCheckUtils]: 57: Hoare triple {1547#false} assume 0 == ~cond; {1547#false} is VALID [2022-04-14 16:16:58,617 INFO L290 TraceCheckUtils]: 56: Hoare triple {1547#false} ~cond := #in~cond; {1547#false} is VALID [2022-04-14 16:16:58,617 INFO L272 TraceCheckUtils]: 55: Hoare triple {1547#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)); {1547#false} is VALID [2022-04-14 16:16:58,618 INFO L290 TraceCheckUtils]: 54: Hoare triple {1715#(<= |main_#t~post6| 4)} assume !(#t~post6 < 5);havoc #t~post6; {1547#false} is VALID [2022-04-14 16:16:58,619 INFO L290 TraceCheckUtils]: 53: Hoare triple {1687#(<= ~counter~0 4)} #t~post6 := ~counter~0;~counter~0 := 1 + #t~post6; {1715#(<= |main_#t~post6| 4)} is VALID [2022-04-14 16:16:58,622 INFO L290 TraceCheckUtils]: 52: Hoare triple {1687#(<= ~counter~0 4)} assume ~r~0 > 0;~r~0 := ~r~0 - ~v~0;~v~0 := 2 + ~v~0; {1687#(<= ~counter~0 4)} is VALID [2022-04-14 16:16:58,623 INFO L290 TraceCheckUtils]: 51: Hoare triple {1687#(<= ~counter~0 4)} assume !!(0 != ~r~0); {1687#(<= ~counter~0 4)} is VALID [2022-04-14 16:16:58,623 INFO L284 TraceCheckUtils]: 50: Hoare quadruple {1546#true} {1687#(<= ~counter~0 4)} #63#return; {1687#(<= ~counter~0 4)} is VALID [2022-04-14 16:16:58,624 INFO L290 TraceCheckUtils]: 49: Hoare triple {1546#true} assume true; {1546#true} is VALID [2022-04-14 16:16:58,624 INFO L290 TraceCheckUtils]: 48: Hoare triple {1546#true} assume !(0 == ~cond); {1546#true} is VALID [2022-04-14 16:16:58,624 INFO L290 TraceCheckUtils]: 47: Hoare triple {1546#true} ~cond := #in~cond; {1546#true} is VALID [2022-04-14 16:16:58,624 INFO L272 TraceCheckUtils]: 46: Hoare triple {1687#(<= ~counter~0 4)} 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)); {1546#true} is VALID [2022-04-14 16:16:58,624 INFO L290 TraceCheckUtils]: 45: Hoare triple {1687#(<= ~counter~0 4)} assume !!(#t~post6 < 5);havoc #t~post6; {1687#(<= ~counter~0 4)} is VALID [2022-04-14 16:16:58,624 INFO L290 TraceCheckUtils]: 44: Hoare triple {1659#(<= ~counter~0 3)} #t~post6 := ~counter~0;~counter~0 := 1 + #t~post6; {1687#(<= ~counter~0 4)} is VALID [2022-04-14 16:16:58,641 INFO L290 TraceCheckUtils]: 43: Hoare triple {1659#(<= ~counter~0 3)} assume ~r~0 > 0;~r~0 := ~r~0 - ~v~0;~v~0 := 2 + ~v~0; {1659#(<= ~counter~0 3)} is VALID [2022-04-14 16:16:58,643 INFO L290 TraceCheckUtils]: 42: Hoare triple {1659#(<= ~counter~0 3)} assume !!(0 != ~r~0); {1659#(<= ~counter~0 3)} is VALID [2022-04-14 16:16:58,644 INFO L284 TraceCheckUtils]: 41: Hoare quadruple {1546#true} {1659#(<= ~counter~0 3)} #63#return; {1659#(<= ~counter~0 3)} is VALID [2022-04-14 16:16:58,644 INFO L290 TraceCheckUtils]: 40: Hoare triple {1546#true} assume true; {1546#true} is VALID [2022-04-14 16:16:58,644 INFO L290 TraceCheckUtils]: 39: Hoare triple {1546#true} assume !(0 == ~cond); {1546#true} is VALID [2022-04-14 16:16:58,644 INFO L290 TraceCheckUtils]: 38: Hoare triple {1546#true} ~cond := #in~cond; {1546#true} is VALID [2022-04-14 16:16:58,644 INFO L272 TraceCheckUtils]: 37: Hoare triple {1659#(<= ~counter~0 3)} 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)); {1546#true} is VALID [2022-04-14 16:16:58,645 INFO L290 TraceCheckUtils]: 36: Hoare triple {1659#(<= ~counter~0 3)} assume !!(#t~post6 < 5);havoc #t~post6; {1659#(<= ~counter~0 3)} is VALID [2022-04-14 16:16:58,645 INFO L290 TraceCheckUtils]: 35: Hoare triple {1631#(<= ~counter~0 2)} #t~post6 := ~counter~0;~counter~0 := 1 + #t~post6; {1659#(<= ~counter~0 3)} is VALID [2022-04-14 16:16:58,646 INFO L290 TraceCheckUtils]: 34: Hoare triple {1631#(<= ~counter~0 2)} assume ~r~0 > 0;~r~0 := ~r~0 - ~v~0;~v~0 := 2 + ~v~0; {1631#(<= ~counter~0 2)} is VALID [2022-04-14 16:16:58,646 INFO L290 TraceCheckUtils]: 33: Hoare triple {1631#(<= ~counter~0 2)} assume !!(0 != ~r~0); {1631#(<= ~counter~0 2)} is VALID [2022-04-14 16:16:58,646 INFO L284 TraceCheckUtils]: 32: Hoare quadruple {1546#true} {1631#(<= ~counter~0 2)} #63#return; {1631#(<= ~counter~0 2)} is VALID [2022-04-14 16:16:58,646 INFO L290 TraceCheckUtils]: 31: Hoare triple {1546#true} assume true; {1546#true} is VALID [2022-04-14 16:16:58,646 INFO L290 TraceCheckUtils]: 30: Hoare triple {1546#true} assume !(0 == ~cond); {1546#true} is VALID [2022-04-14 16:16:58,647 INFO L290 TraceCheckUtils]: 29: Hoare triple {1546#true} ~cond := #in~cond; {1546#true} is VALID [2022-04-14 16:16:58,647 INFO L272 TraceCheckUtils]: 28: Hoare triple {1631#(<= ~counter~0 2)} 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)); {1546#true} is VALID [2022-04-14 16:16:58,647 INFO L290 TraceCheckUtils]: 27: Hoare triple {1631#(<= ~counter~0 2)} assume !!(#t~post6 < 5);havoc #t~post6; {1631#(<= ~counter~0 2)} is VALID [2022-04-14 16:16:58,647 INFO L290 TraceCheckUtils]: 26: Hoare triple {1603#(<= ~counter~0 1)} #t~post6 := ~counter~0;~counter~0 := 1 + #t~post6; {1631#(<= ~counter~0 2)} is VALID [2022-04-14 16:16:58,648 INFO L290 TraceCheckUtils]: 25: Hoare triple {1603#(<= ~counter~0 1)} assume ~r~0 > 0;~r~0 := ~r~0 - ~v~0;~v~0 := 2 + ~v~0; {1603#(<= ~counter~0 1)} is VALID [2022-04-14 16:16:58,648 INFO L290 TraceCheckUtils]: 24: Hoare triple {1603#(<= ~counter~0 1)} assume !!(0 != ~r~0); {1603#(<= ~counter~0 1)} is VALID [2022-04-14 16:16:58,649 INFO L284 TraceCheckUtils]: 23: Hoare quadruple {1546#true} {1603#(<= ~counter~0 1)} #63#return; {1603#(<= ~counter~0 1)} is VALID [2022-04-14 16:16:58,649 INFO L290 TraceCheckUtils]: 22: Hoare triple {1546#true} assume true; {1546#true} is VALID [2022-04-14 16:16:58,649 INFO L290 TraceCheckUtils]: 21: Hoare triple {1546#true} assume !(0 == ~cond); {1546#true} is VALID [2022-04-14 16:16:58,649 INFO L290 TraceCheckUtils]: 20: Hoare triple {1546#true} ~cond := #in~cond; {1546#true} is VALID [2022-04-14 16:16:58,649 INFO L272 TraceCheckUtils]: 19: Hoare triple {1603#(<= ~counter~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)); {1546#true} is VALID [2022-04-14 16:16:58,650 INFO L290 TraceCheckUtils]: 18: Hoare triple {1603#(<= ~counter~0 1)} assume !!(#t~post6 < 5);havoc #t~post6; {1603#(<= ~counter~0 1)} is VALID [2022-04-14 16:16:58,650 INFO L290 TraceCheckUtils]: 17: Hoare triple {1554#(<= ~counter~0 0)} #t~post6 := ~counter~0;~counter~0 := 1 + #t~post6; {1603#(<= ~counter~0 1)} is VALID [2022-04-14 16:16:58,650 INFO L290 TraceCheckUtils]: 16: Hoare triple {1554#(<= ~counter~0 0)} ~u~0 := 1 + 2 * ~R~0;~v~0 := 1;~r~0 := ~R~0 * ~R~0 - ~A~0; {1554#(<= ~counter~0 0)} is VALID [2022-04-14 16:16:58,651 INFO L284 TraceCheckUtils]: 15: Hoare quadruple {1546#true} {1554#(<= ~counter~0 0)} #61#return; {1554#(<= ~counter~0 0)} is VALID [2022-04-14 16:16:58,651 INFO L290 TraceCheckUtils]: 14: Hoare triple {1546#true} assume true; {1546#true} is VALID [2022-04-14 16:16:58,651 INFO L290 TraceCheckUtils]: 13: Hoare triple {1546#true} assume !(0 == ~cond); {1546#true} is VALID [2022-04-14 16:16:58,651 INFO L290 TraceCheckUtils]: 12: Hoare triple {1546#true} ~cond := #in~cond; {1546#true} is VALID [2022-04-14 16:16:58,651 INFO L272 TraceCheckUtils]: 11: Hoare triple {1554#(<= ~counter~0 0)} call assume_abort_if_not((if 1 == (if ~A~0 < 0 && 0 != ~A~0 % 2 then ~A~0 % 2 - 2 else ~A~0 % 2) then 1 else 0)); {1546#true} is VALID [2022-04-14 16:16:58,652 INFO L284 TraceCheckUtils]: 10: Hoare quadruple {1546#true} {1554#(<= ~counter~0 0)} #59#return; {1554#(<= ~counter~0 0)} is VALID [2022-04-14 16:16:58,652 INFO L290 TraceCheckUtils]: 9: Hoare triple {1546#true} assume true; {1546#true} is VALID [2022-04-14 16:16:58,652 INFO L290 TraceCheckUtils]: 8: Hoare triple {1546#true} assume !(0 == ~cond); {1546#true} is VALID [2022-04-14 16:16:58,652 INFO L290 TraceCheckUtils]: 7: Hoare triple {1546#true} ~cond := #in~cond; {1546#true} is VALID [2022-04-14 16:16:58,652 INFO L272 TraceCheckUtils]: 6: Hoare triple {1554#(<= ~counter~0 0)} call assume_abort_if_not((if (~R~0 - 1) * (~R~0 - 1) < ~A~0 then 1 else 0)); {1546#true} is VALID [2022-04-14 16:16:58,652 INFO L290 TraceCheckUtils]: 5: Hoare triple {1554#(<= ~counter~0 0)} havoc ~A~0;havoc ~R~0;havoc ~u~0;havoc ~v~0;havoc ~r~0;assume -2147483648 <= #t~nondet4 && #t~nondet4 <= 2147483647;~A~0 := #t~nondet4;havoc #t~nondet4;assume -2147483648 <= #t~nondet5 && #t~nondet5 <= 2147483647;~R~0 := #t~nondet5;havoc #t~nondet5; {1554#(<= ~counter~0 0)} is VALID [2022-04-14 16:16:58,653 INFO L272 TraceCheckUtils]: 4: Hoare triple {1554#(<= ~counter~0 0)} call #t~ret7 := main(); {1554#(<= ~counter~0 0)} is VALID [2022-04-14 16:16:58,653 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {1554#(<= ~counter~0 0)} {1546#true} #67#return; {1554#(<= ~counter~0 0)} is VALID [2022-04-14 16:16:58,653 INFO L290 TraceCheckUtils]: 2: Hoare triple {1554#(<= ~counter~0 0)} assume true; {1554#(<= ~counter~0 0)} is VALID [2022-04-14 16:16:58,654 INFO L290 TraceCheckUtils]: 1: Hoare triple {1546#true} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(13, 2);call #Ultimate.allocInit(12, 3);~counter~0 := 0; {1554#(<= ~counter~0 0)} is VALID [2022-04-14 16:16:58,654 INFO L272 TraceCheckUtils]: 0: Hoare triple {1546#true} call ULTIMATE.init(); {1546#true} is VALID [2022-04-14 16:16:58,654 INFO L134 CoverageAnalysis]: Checked inductivity of 74 backedges. 8 proven. 38 refuted. 0 times theorem prover too weak. 28 trivial. 0 not checked. [2022-04-14 16:16:58,654 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-14 16:16:58,654 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [479527888] [2022-04-14 16:16:58,654 WARN L310 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2022-04-14 16:16:58,655 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [2145800060] [2022-04-14 16:16:58,655 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [2145800060] provided 0 perfect and 2 imperfect interpolant sequences [2022-04-14 16:16:58,655 INFO L184 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2022-04-14 16:16:58,655 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [8, 8] total 8 [2022-04-14 16:16:58,655 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1218770143] [2022-04-14 16:16:58,655 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2022-04-14 16:16:58,656 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 8 states have (on average 5.75) internal successors, (46), 8 states have internal predecessors, (46), 7 states have call successors, (15), 7 states have call predecessors, (15), 6 states have return successors, (13), 5 states have call predecessors, (13), 6 states have call successors, (13) Word has length 59 [2022-04-14 16:16:58,658 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-14 16:16:58,658 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with has 8 states, 8 states have (on average 5.75) internal successors, (46), 8 states have internal predecessors, (46), 7 states have call successors, (15), 7 states have call predecessors, (15), 6 states have return successors, (13), 5 states have call predecessors, (13), 6 states have call successors, (13) [2022-04-14 16:16:58,708 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 74 edges. 74 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-14 16:16:58,708 INFO L554 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2022-04-14 16:16:58,708 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-04-14 16:16:58,708 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2022-04-14 16:16:58,709 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=23, Invalid=33, Unknown=0, NotChecked=0, Total=56 [2022-04-14 16:16:58,709 INFO L87 Difference]: Start difference. First operand 56 states and 61 transitions. Second operand has 8 states, 8 states have (on average 5.75) internal successors, (46), 8 states have internal predecessors, (46), 7 states have call successors, (15), 7 states have call predecessors, (15), 6 states have return successors, (13), 5 states have call predecessors, (13), 6 states have call successors, (13) [2022-04-14 16:16:58,862 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-14 16:16:58,862 INFO L93 Difference]: Finished difference Result 70 states and 76 transitions. [2022-04-14 16:16:58,862 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2022-04-14 16:16:58,862 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 8 states have (on average 5.75) internal successors, (46), 8 states have internal predecessors, (46), 7 states have call successors, (15), 7 states have call predecessors, (15), 6 states have return successors, (13), 5 states have call predecessors, (13), 6 states have call successors, (13) Word has length 59 [2022-04-14 16:16:58,862 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-14 16:16:58,863 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 8 states, 8 states have (on average 5.75) internal successors, (46), 8 states have internal predecessors, (46), 7 states have call successors, (15), 7 states have call predecessors, (15), 6 states have return successors, (13), 5 states have call predecessors, (13), 6 states have call successors, (13) [2022-04-14 16:16:58,864 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 12 states to 12 states and 75 transitions. [2022-04-14 16:16:58,864 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 8 states, 8 states have (on average 5.75) internal successors, (46), 8 states have internal predecessors, (46), 7 states have call successors, (15), 7 states have call predecessors, (15), 6 states have return successors, (13), 5 states have call predecessors, (13), 6 states have call successors, (13) [2022-04-14 16:16:58,865 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 12 states to 12 states and 75 transitions. [2022-04-14 16:16:58,866 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 12 states and 75 transitions. [2022-04-14 16:16:58,916 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 75 edges. 75 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-14 16:16:58,917 INFO L225 Difference]: With dead ends: 70 [2022-04-14 16:16:58,917 INFO L226 Difference]: Without dead ends: 65 [2022-04-14 16:16:58,917 INFO L912 BasicCegarLoop]: 0 DeclaredPredicates, 121 GetRequests, 110 SyntacticMatches, 1 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 14 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=51, Invalid=81, Unknown=0, NotChecked=0, Total=132 [2022-04-14 16:16:58,918 INFO L913 BasicCegarLoop]: 30 mSDtfsCounter, 10 mSDsluCounter, 84 mSDsCounter, 0 mSdLazyCounter, 26 mSolverCounterSat, 7 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 10 SdHoareTripleChecker+Valid, 114 SdHoareTripleChecker+Invalid, 33 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 7 IncrementalHoareTripleChecker+Valid, 26 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-04-14 16:16:58,918 INFO L914 BasicCegarLoop]: SdHoareTripleChecker [10 Valid, 114 Invalid, 33 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [7 Valid, 26 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-04-14 16:16:58,918 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 65 states. [2022-04-14 16:16:58,937 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 65 to 65. [2022-04-14 16:16:58,937 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-14 16:16:58,937 INFO L82 GeneralOperation]: Start isEquivalent. First operand 65 states. Second operand has 65 states, 47 states have (on average 1.127659574468085) internal successors, (53), 47 states have internal predecessors, (53), 10 states have call successors, (10), 9 states have call predecessors, (10), 7 states have return successors, (8), 8 states have call predecessors, (8), 8 states have call successors, (8) [2022-04-14 16:16:58,937 INFO L74 IsIncluded]: Start isIncluded. First operand 65 states. Second operand has 65 states, 47 states have (on average 1.127659574468085) internal successors, (53), 47 states have internal predecessors, (53), 10 states have call successors, (10), 9 states have call predecessors, (10), 7 states have return successors, (8), 8 states have call predecessors, (8), 8 states have call successors, (8) [2022-04-14 16:16:58,937 INFO L87 Difference]: Start difference. First operand 65 states. Second operand has 65 states, 47 states have (on average 1.127659574468085) internal successors, (53), 47 states have internal predecessors, (53), 10 states have call successors, (10), 9 states have call predecessors, (10), 7 states have return successors, (8), 8 states have call predecessors, (8), 8 states have call successors, (8) [2022-04-14 16:16:58,939 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-14 16:16:58,939 INFO L93 Difference]: Finished difference Result 65 states and 71 transitions. [2022-04-14 16:16:58,939 INFO L276 IsEmpty]: Start isEmpty. Operand 65 states and 71 transitions. [2022-04-14 16:16:58,940 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-14 16:16:58,940 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-14 16:16:58,940 INFO L74 IsIncluded]: Start isIncluded. First operand has 65 states, 47 states have (on average 1.127659574468085) internal successors, (53), 47 states have internal predecessors, (53), 10 states have call successors, (10), 9 states have call predecessors, (10), 7 states have return successors, (8), 8 states have call predecessors, (8), 8 states have call successors, (8) Second operand 65 states. [2022-04-14 16:16:58,940 INFO L87 Difference]: Start difference. First operand has 65 states, 47 states have (on average 1.127659574468085) internal successors, (53), 47 states have internal predecessors, (53), 10 states have call successors, (10), 9 states have call predecessors, (10), 7 states have return successors, (8), 8 states have call predecessors, (8), 8 states have call successors, (8) Second operand 65 states. [2022-04-14 16:16:58,941 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-14 16:16:58,942 INFO L93 Difference]: Finished difference Result 65 states and 71 transitions. [2022-04-14 16:16:58,942 INFO L276 IsEmpty]: Start isEmpty. Operand 65 states and 71 transitions. [2022-04-14 16:16:58,942 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-14 16:16:58,942 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-14 16:16:58,942 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-14 16:16:58,942 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-14 16:16:58,942 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 65 states, 47 states have (on average 1.127659574468085) internal successors, (53), 47 states have internal predecessors, (53), 10 states have call successors, (10), 9 states have call predecessors, (10), 7 states have return successors, (8), 8 states have call predecessors, (8), 8 states have call successors, (8) [2022-04-14 16:16:58,944 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 65 states to 65 states and 71 transitions. [2022-04-14 16:16:58,944 INFO L78 Accepts]: Start accepts. Automaton has 65 states and 71 transitions. Word has length 59 [2022-04-14 16:16:58,944 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-14 16:16:58,944 INFO L478 AbstractCegarLoop]: Abstraction has 65 states and 71 transitions. [2022-04-14 16:16:58,944 INFO L479 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 5.75) internal successors, (46), 8 states have internal predecessors, (46), 7 states have call successors, (15), 7 states have call predecessors, (15), 6 states have return successors, (13), 5 states have call predecessors, (13), 6 states have call successors, (13) [2022-04-14 16:16:58,944 INFO L276 IsEmpty]: Start isEmpty. Operand 65 states and 71 transitions. [2022-04-14 16:16:58,947 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 69 [2022-04-14 16:16:58,947 INFO L491 BasicCegarLoop]: Found error trace [2022-04-14 16:16:58,947 INFO L499 BasicCegarLoop]: trace histogram [6, 6, 5, 5, 5, 5, 5, 5, 5, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-14 16:16:58,983 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (7)] Forceful destruction successful, exit code 0 [2022-04-14 16:16:59,167 WARN L460 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5,7 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-14 16:16:59,168 INFO L403 AbstractCegarLoop]: === Iteration 7 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-14 16:16:59,168 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-14 16:16:59,168 INFO L85 PathProgramCache]: Analyzing trace with hash -1512407140, now seen corresponding path program 3 times [2022-04-14 16:16:59,168 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-14 16:16:59,168 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1534017737] [2022-04-14 16:16:59,168 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-14 16:16:59,168 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-14 16:16:59,179 ERROR L245 FreeRefinementEngine]: Caught known exception: Unsupported non-linear arithmetic [2022-04-14 16:16:59,180 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [1439754878] [2022-04-14 16:16:59,180 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2022-04-14 16:16:59,180 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-14 16:16:59,180 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-04-14 16:16:59,181 INFO L229 MonitoredProcess]: Starting monitored process 8 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-04-14 16:16:59,183 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (8)] Waiting until timeout for monitored process [2022-04-14 16:17:00,338 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 6 check-sat command(s) [2022-04-14 16:17:00,339 INFO L229 tOrderPrioritization]: Conjunction of SSA is sat [2022-04-14 16:17:00,339 INFO L352 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2022-04-14 16:17:00,482 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-04-14 16:17:00,514 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2022-04-14 16:17:00,514 INFO L618 BasicCegarLoop]: Counterexample is feasible [2022-04-14 16:17:00,514 INFO L788 garLoopResultBuilder]: Registering result UNSAFE for location __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION (0 of 1 remaining) [2022-04-14 16:17:00,524 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (8)] Forceful destruction successful, exit code 0 [2022-04-14 16:17:00,716 WARN L460 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6,8 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-14 16:17:00,718 INFO L719 BasicCegarLoop]: Path program histogram: [3, 1, 1, 1, 1] [2022-04-14 16:17:00,720 INFO L177 ceAbstractionStarter]: Computing trace abstraction results [2022-04-14 16:17:00,748 WARN L170 areAnnotationChecker]: reach_errorENTRY has no Hoare annotation [2022-04-14 16:17:00,748 WARN L170 areAnnotationChecker]: ULTIMATE.initENTRY has no Hoare annotation [2022-04-14 16:17:00,748 WARN L170 areAnnotationChecker]: ULTIMATE.startENTRY has no Hoare annotation [2022-04-14 16:17:00,748 WARN L170 areAnnotationChecker]: ULTIMATE.startENTRY has no Hoare annotation [2022-04-14 16:17:00,748 WARN L170 areAnnotationChecker]: assume_abort_if_notENTRY has no Hoare annotation [2022-04-14 16:17:00,748 WARN L170 areAnnotationChecker]: mainENTRY has no Hoare annotation [2022-04-14 16:17:00,748 WARN L170 areAnnotationChecker]: __VERIFIER_assertENTRY has no Hoare annotation [2022-04-14 16:17:00,748 WARN L170 areAnnotationChecker]: reach_errorFINAL has no Hoare annotation [2022-04-14 16:17:00,748 WARN L170 areAnnotationChecker]: ULTIMATE.initFINAL has no Hoare annotation [2022-04-14 16:17:00,748 WARN L170 areAnnotationChecker]: L-1 has no Hoare annotation [2022-04-14 16:17:00,748 WARN L170 areAnnotationChecker]: L-1 has no Hoare annotation [2022-04-14 16:17:00,748 WARN L170 areAnnotationChecker]: L9 has no Hoare annotation [2022-04-14 16:17:00,748 WARN L170 areAnnotationChecker]: L9 has no Hoare annotation [2022-04-14 16:17:00,748 WARN L170 areAnnotationChecker]: L26 has no Hoare annotation [2022-04-14 16:17:00,748 WARN L170 areAnnotationChecker]: L26 has no Hoare annotation [2022-04-14 16:17:00,749 WARN L170 areAnnotationChecker]: L12 has no Hoare annotation [2022-04-14 16:17:00,749 WARN L170 areAnnotationChecker]: L12 has no Hoare annotation [2022-04-14 16:17:00,749 WARN L170 areAnnotationChecker]: ULTIMATE.initEXIT has no Hoare annotation [2022-04-14 16:17:00,749 WARN L170 areAnnotationChecker]: ULTIMATE.startFINAL has no Hoare annotation [2022-04-14 16:17:00,749 WARN L170 areAnnotationChecker]: L9-2 has no Hoare annotation [2022-04-14 16:17:00,749 WARN L170 areAnnotationChecker]: L26-1 has no Hoare annotation [2022-04-14 16:17:00,749 WARN L170 areAnnotationChecker]: L26-1 has no Hoare annotation [2022-04-14 16:17:00,749 WARN L170 areAnnotationChecker]: L13 has no Hoare annotation [2022-04-14 16:17:00,749 WARN L170 areAnnotationChecker]: L13 has no Hoare annotation [2022-04-14 16:17:00,749 WARN L170 areAnnotationChecker]: L12-2 has no Hoare annotation [2022-04-14 16:17:00,749 WARN L170 areAnnotationChecker]: assume_abort_if_notEXIT has no Hoare annotation [2022-04-14 16:17:00,749 WARN L170 areAnnotationChecker]: assume_abort_if_notEXIT has no Hoare annotation [2022-04-14 16:17:00,749 WARN L170 areAnnotationChecker]: L28 has no Hoare annotation [2022-04-14 16:17:00,749 WARN L170 areAnnotationChecker]: __VERIFIER_assertEXIT has no Hoare annotation [2022-04-14 16:17:00,749 WARN L170 areAnnotationChecker]: __VERIFIER_assertEXIT has no Hoare annotation [2022-04-14 16:17:00,749 WARN L170 areAnnotationChecker]: L38-2 has no Hoare annotation [2022-04-14 16:17:00,749 WARN L170 areAnnotationChecker]: L38-2 has no Hoare annotation [2022-04-14 16:17:00,749 WARN L170 areAnnotationChecker]: L35-1 has no Hoare annotation [2022-04-14 16:17:00,749 WARN L170 areAnnotationChecker]: L35-1 has no Hoare annotation [2022-04-14 16:17:00,749 WARN L170 areAnnotationChecker]: L48 has no Hoare annotation [2022-04-14 16:17:00,749 WARN L170 areAnnotationChecker]: L34-3 has no Hoare annotation [2022-04-14 16:17:00,749 WARN L170 areAnnotationChecker]: L34-3 has no Hoare annotation [2022-04-14 16:17:00,749 WARN L170 areAnnotationChecker]: L34-1 has no Hoare annotation [2022-04-14 16:17:00,749 WARN L170 areAnnotationChecker]: L34-1 has no Hoare annotation [2022-04-14 16:17:00,749 WARN L170 areAnnotationChecker]: L38 has no Hoare annotation [2022-04-14 16:17:00,749 WARN L170 areAnnotationChecker]: L38 has no Hoare annotation [2022-04-14 16:17:00,750 WARN L170 areAnnotationChecker]: mainFINAL has no Hoare annotation [2022-04-14 16:17:00,750 WARN L170 areAnnotationChecker]: L35 has no Hoare annotation [2022-04-14 16:17:00,750 WARN L170 areAnnotationChecker]: L35 has no Hoare annotation [2022-04-14 16:17:00,750 WARN L170 areAnnotationChecker]: mainEXIT has no Hoare annotation [2022-04-14 16:17:00,750 INFO L163 areAnnotationChecker]: CFG has 0 edges. 0 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. 0 times interpolants missing. [2022-04-14 16:17:00,750 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 14.04 04:17:00 BoogieIcfgContainer [2022-04-14 16:17:00,750 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2022-04-14 16:17:00,751 INFO L158 Benchmark]: Toolchain (without parser) took 20306.71ms. Allocated memory was 196.1MB in the beginning and 264.2MB in the end (delta: 68.2MB). Free memory was 143.7MB in the beginning and 187.9MB in the end (delta: -44.2MB). Peak memory consumption was 25.5MB. Max. memory is 8.0GB. [2022-04-14 16:17:00,751 INFO L158 Benchmark]: CDTParser took 0.09ms. Allocated memory is still 196.1MB. Free memory is still 160.5MB. There was no memory consumed. Max. memory is 8.0GB. [2022-04-14 16:17:00,751 INFO L158 Benchmark]: CACSL2BoogieTranslator took 239.50ms. Allocated memory is still 196.1MB. Free memory was 143.6MB in the beginning and 169.8MB in the end (delta: -26.3MB). Peak memory consumption was 13.3MB. Max. memory is 8.0GB. [2022-04-14 16:17:00,751 INFO L158 Benchmark]: Boogie Preprocessor took 31.64ms. Allocated memory is still 196.1MB. Free memory was 169.8MB in the beginning and 168.5MB in the end (delta: 1.4MB). Peak memory consumption was 1.0MB. Max. memory is 8.0GB. [2022-04-14 16:17:00,751 INFO L158 Benchmark]: RCFGBuilder took 197.62ms. Allocated memory is still 196.1MB. Free memory was 168.2MB in the beginning and 156.9MB in the end (delta: 11.2MB). Peak memory consumption was 11.5MB. Max. memory is 8.0GB. [2022-04-14 16:17:00,752 INFO L158 Benchmark]: TraceAbstraction took 19833.44ms. Allocated memory was 196.1MB in the beginning and 264.2MB in the end (delta: 68.2MB). Free memory was 156.6MB in the beginning and 187.9MB in the end (delta: -31.3MB). Peak memory consumption was 37.4MB. Max. memory is 8.0GB. [2022-04-14 16:17:00,752 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.09ms. Allocated memory is still 196.1MB. Free memory is still 160.5MB. There was no memory consumed. Max. memory is 8.0GB. * CACSL2BoogieTranslator took 239.50ms. Allocated memory is still 196.1MB. Free memory was 143.6MB in the beginning and 169.8MB in the end (delta: -26.3MB). Peak memory consumption was 13.3MB. Max. memory is 8.0GB. * Boogie Preprocessor took 31.64ms. Allocated memory is still 196.1MB. Free memory was 169.8MB in the beginning and 168.5MB in the end (delta: 1.4MB). Peak memory consumption was 1.0MB. Max. memory is 8.0GB. * RCFGBuilder took 197.62ms. Allocated memory is still 196.1MB. Free memory was 168.2MB in the beginning and 156.9MB in the end (delta: 11.2MB). Peak memory consumption was 11.5MB. Max. memory is 8.0GB. * TraceAbstraction took 19833.44ms. Allocated memory was 196.1MB in the beginning and 264.2MB in the end (delta: 68.2MB). Free memory was 156.6MB in the beginning and 187.9MB in the end (delta: -31.3MB). Peak memory consumption was 37.4MB. Max. memory is 8.0GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - StatisticsResult: ErrorAutomatonStatistics NumberErrorTraces: 0, NumberStatementsAllTraces: 0, NumberRelevantStatements: 0, 0.0s ErrorAutomatonConstructionTimeTotal, 0.0s FaulLocalizationTime, NumberStatementsFirstTrace: -1, TraceLengthAvg: 0, 0.0s ErrorAutomatonConstructionTimeAvg, 0.0s ErrorAutomatonDifferenceTimeAvg, 0.0s ErrorAutomatonDifferenceTimeTotal, NumberOfNoEnhancement: 0, NumberOfFiniteEnhancement: 0, NumberOfInfiniteEnhancement: 0 - CounterExampleResult [Line: 14]: a call to reach_error is reachable a call to reach_error is reachable We found a FailurePath: [L19] int counter = 0; VAL [\old(counter)=8, counter=0] [L21] int A, R; [L22] long long u, v, r; [L23] A = __VERIFIER_nondet_int() [L24] R = __VERIFIER_nondet_int() [L26] CALL assume_abort_if_not(((long long) R - 1) * ((long long) R - 1) < A) VAL [\old(cond)=1, \old(counter)=0, counter=0] [L9] COND FALSE !(!cond) VAL [\old(cond)=1, \old(counter)=0, cond=1, counter=0] [L26] RET assume_abort_if_not(((long long) R - 1) * ((long long) R - 1) < A) VAL [\old(counter)=0, A=1851, counter=0, R=44] [L28] CALL assume_abort_if_not(A % 2 == 1) VAL [\old(cond)=1, \old(counter)=0, counter=0] [L9] COND FALSE !(!cond) VAL [\old(cond)=1, \old(counter)=0, cond=1, counter=0] [L28] RET assume_abort_if_not(A % 2 == 1) VAL [\old(counter)=0, A=1851, counter=0, R=44] [L30] u = ((long long) 2 * R) + 1 [L31] v = 1 [L32] r = ((long long) R * R) - A VAL [\old(counter)=0, A=1851, counter=0, R=44, r=85, u=89, v=1] [L34] EXPR counter++ VAL [\old(counter)=0, A=1851, counter=1, counter++=0, r=85, R=44, u=89, v=1] [L34] COND TRUE counter++<5 [L35] CALL __VERIFIER_assert(4*(A+r) == u*u - v*v - 2*u + 2*v) VAL [\old(cond)=1, \old(counter)=0, counter=1] [L12] COND FALSE !(!(cond)) VAL [\old(cond)=1, \old(counter)=0, cond=1, counter=1] [L35] RET __VERIFIER_assert(4*(A+r) == u*u - v*v - 2*u + 2*v) VAL [\old(counter)=0, A=1851, counter=1, r=85, R=44, u=89, v=1] [L36] COND FALSE !(!(r != 0)) VAL [\old(counter)=0, A=1851, counter=1, r=85, R=44, u=89, v=1] [L38] COND TRUE r > 0 [L39] r = r - v [L40] v = v + 2 VAL [\old(counter)=0, A=1851, counter=1, R=44, r=84, u=89, v=3] [L34] EXPR counter++ VAL [\old(counter)=0, A=1851, counter=2, counter++=1, r=84, R=44, u=89, v=3] [L34] COND TRUE counter++<5 [L35] CALL __VERIFIER_assert(4*(A+r) == u*u - v*v - 2*u + 2*v) VAL [\old(cond)=1, \old(counter)=0, counter=2] [L12] COND FALSE !(!(cond)) VAL [\old(cond)=1, \old(counter)=0, cond=1, counter=2] [L35] RET __VERIFIER_assert(4*(A+r) == u*u - v*v - 2*u + 2*v) VAL [\old(counter)=0, A=1851, counter=2, r=84, R=44, u=89, v=3] [L36] COND FALSE !(!(r != 0)) VAL [\old(counter)=0, A=1851, counter=2, r=84, R=44, u=89, v=3] [L38] COND TRUE r > 0 [L39] r = r - v [L40] v = v + 2 VAL [\old(counter)=0, A=1851, counter=2, R=44, r=81, u=89, v=5] [L34] EXPR counter++ VAL [\old(counter)=0, A=1851, counter=3, counter++=2, r=81, R=44, u=89, v=5] [L34] COND TRUE counter++<5 [L35] CALL __VERIFIER_assert(4*(A+r) == u*u - v*v - 2*u + 2*v) VAL [\old(cond)=1, \old(counter)=0, counter=3] [L12] COND FALSE !(!(cond)) VAL [\old(cond)=1, \old(counter)=0, cond=1, counter=3] [L35] RET __VERIFIER_assert(4*(A+r) == u*u - v*v - 2*u + 2*v) VAL [\old(counter)=0, A=1851, counter=3, r=81, R=44, u=89, v=5] [L36] COND FALSE !(!(r != 0)) VAL [\old(counter)=0, A=1851, counter=3, r=81, R=44, u=89, v=5] [L38] COND TRUE r > 0 [L39] r = r - v [L40] v = v + 2 VAL [\old(counter)=0, A=1851, counter=3, r=76, R=44, u=89, v=7] [L34] EXPR counter++ VAL [\old(counter)=0, A=1851, counter=4, counter++=3, R=44, r=76, u=89, v=7] [L34] COND TRUE counter++<5 [L35] CALL __VERIFIER_assert(4*(A+r) == u*u - v*v - 2*u + 2*v) VAL [\old(cond)=1, \old(counter)=0, counter=4] [L12] COND FALSE !(!(cond)) VAL [\old(cond)=1, \old(counter)=0, cond=1, counter=4] [L35] RET __VERIFIER_assert(4*(A+r) == u*u - v*v - 2*u + 2*v) VAL [\old(counter)=0, A=1851, counter=4, R=44, r=76, u=89, v=7] [L36] COND FALSE !(!(r != 0)) VAL [\old(counter)=0, A=1851, counter=4, r=76, R=44, u=89, v=7] [L38] COND TRUE r > 0 [L39] r = r - v [L40] v = v + 2 VAL [\old(counter)=0, A=1851, counter=4, R=44, r=69, u=89, v=9] [L34] EXPR counter++ VAL [\old(counter)=0, A=1851, counter=5, counter++=4, r=69, R=44, u=89, v=9] [L34] COND TRUE counter++<5 [L35] CALL __VERIFIER_assert(4*(A+r) == u*u - v*v - 2*u + 2*v) VAL [\old(cond)=1, \old(counter)=0, counter=5] [L12] COND FALSE !(!(cond)) VAL [\old(cond)=1, \old(counter)=0, cond=1, counter=5] [L35] RET __VERIFIER_assert(4*(A+r) == u*u - v*v - 2*u + 2*v) VAL [\old(counter)=0, A=1851, counter=5, R=44, r=69, u=89, v=9] [L36] COND FALSE !(!(r != 0)) VAL [\old(counter)=0, A=1851, counter=5, R=44, r=69, u=89, v=9] [L38] COND TRUE r > 0 [L39] r = r - v [L40] v = v + 2 VAL [\old(counter)=0, A=1851, counter=5, r=60, R=44, u=89, v=11] [L34] EXPR counter++ VAL [\old(counter)=0, A=1851, counter=6, counter++=5, r=60, R=44, u=89, v=11] [L34] COND FALSE !(counter++<5) [L48] CALL __VERIFIER_assert(((long long) 4*A) == u*u - v*v - 2*u + 2*v) VAL [\old(cond)=0, \old(counter)=0, counter=6] [L12] COND TRUE !(cond) VAL [\old(cond)=0, \old(counter)=0, cond=0, counter=6] [L14] reach_error() VAL [\old(cond)=0, \old(counter)=0, cond=0, counter=6] - StatisticsResult: Ultimate Automizer benchmark data CFG has 6 procedures, 33 locations, 1 error locations. Started 1 CEGAR loops. OverallTime: 19.8s, OverallIterations: 7, TraceHistogramMax: 6, PathProgramHistogramMax: 3, EmptinessCheckTime: 0.0s, AutomataDifference: 6.0s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 0.0s, PartialOrderReductionTime: 0.0s, HoareTripleCheckerStatistics: 1 mSolverCounterUnknown, 73 SdHoareTripleChecker+Valid, 4.2s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 72 mSDsluCounter, 540 SdHoareTripleChecker+Invalid, 4.2s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 376 mSDsCounter, 33 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 157 IncrementalHoareTripleChecker+Invalid, 191 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 33 mSolverCounterUnsat, 164 mSDtfsCounter, 157 mSolverCounterSat, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 313 GetRequests, 275 SyntacticMatches, 2 SemanticMatches, 36 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 31 ImplicationChecksByTransitivity, 0.2s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=65occurred in iteration=6, InterpolantAutomatonStates: 41, 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, 6 MinimizatonAttempts, 8 StatesRemovedByMinimization, 2 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.1s SsaConstructionTime, 1.3s SatisfiabilityAnalysisTime, 8.7s InterpolantComputationTime, 256 NumberOfCodeBlocks, 256 NumberOfCodeBlocksAsserted, 13 NumberOfCheckSat, 299 ConstructedInterpolants, 0 QuantifiedInterpolants, 779 SizeOfPredicates, 17 NumberOfNonLiveVariables, 665 ConjunctsInSsa, 49 ConjunctsInUnsatCore, 9 InterpolantComputations, 3 PerfectInterpolantSequences, 82/188 InterpolantCoveringCapability, INVARIANT_SYNTHESIS: No data available, INTERPOLANT_CONSOLIDATION: No data available, ABSTRACT_INTERPRETATION: No data available, PDR: No data available, ACCELERATED_INTERPOLATION: No data available, SIFA: No data available, ReuseStatistics: No data available RESULT: Ultimate proved your program to be incorrect! [2022-04-14 16:17:00,767 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...