/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/fermat1-ll_unwindbound5.c -------------------------------------------------------------------------------- This is Ultimate 0.2.2-dev-fb4f59a-m [2022-04-27 13:16:39,221 INFO L177 SettingsManager]: Resetting all preferences to default values... [2022-04-27 13:16:39,224 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2022-04-27 13:16:39,263 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2022-04-27 13:16:39,264 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2022-04-27 13:16:39,265 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2022-04-27 13:16:39,268 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2022-04-27 13:16:39,272 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2022-04-27 13:16:39,273 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2022-04-27 13:16:39,274 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2022-04-27 13:16:39,275 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2022-04-27 13:16:39,275 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2022-04-27 13:16:39,276 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2022-04-27 13:16:39,276 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2022-04-27 13:16:39,277 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2022-04-27 13:16:39,278 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2022-04-27 13:16:39,279 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2022-04-27 13:16:39,279 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2022-04-27 13:16:39,281 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2022-04-27 13:16:39,282 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2022-04-27 13:16:39,286 INFO L181 SettingsManager]: Resetting HornVerifier preferences to default values [2022-04-27 13:16:39,292 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2022-04-27 13:16:39,293 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2022-04-27 13:16:39,296 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2022-04-27 13:16:39,298 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2022-04-27 13:16:39,305 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2022-04-27 13:16:39,306 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2022-04-27 13:16:39,306 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2022-04-27 13:16:39,307 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2022-04-27 13:16:39,307 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2022-04-27 13:16:39,308 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2022-04-27 13:16:39,308 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2022-04-27 13:16:39,309 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2022-04-27 13:16:39,310 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2022-04-27 13:16:39,310 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2022-04-27 13:16:39,311 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2022-04-27 13:16:39,311 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2022-04-27 13:16:39,312 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2022-04-27 13:16:39,312 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2022-04-27 13:16:39,312 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2022-04-27 13:16:39,313 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2022-04-27 13:16:39,315 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2022-04-27 13:16:39,315 INFO L101 SettingsManager]: Beginning loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/settings/default/automizer/svcomp-Reach-32bit-Automizer_Default.epf [2022-04-27 13:16:39,350 INFO L113 SettingsManager]: Loading preferences was successful [2022-04-27 13:16:39,351 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2022-04-27 13:16:39,351 INFO L136 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2022-04-27 13:16:39,351 INFO L138 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2022-04-27 13:16:39,352 INFO L136 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2022-04-27 13:16:39,352 INFO L138 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2022-04-27 13:16:39,352 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2022-04-27 13:16:39,352 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2022-04-27 13:16:39,353 INFO L138 SettingsManager]: * Use SBE=true [2022-04-27 13:16:39,353 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2022-04-27 13:16:39,354 INFO L138 SettingsManager]: * sizeof long=4 [2022-04-27 13:16:39,354 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2022-04-27 13:16:39,354 INFO L138 SettingsManager]: * sizeof POINTER=4 [2022-04-27 13:16:39,354 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2022-04-27 13:16:39,354 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2022-04-27 13:16:39,354 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2022-04-27 13:16:39,354 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2022-04-27 13:16:39,355 INFO L138 SettingsManager]: * sizeof long double=12 [2022-04-27 13:16:39,355 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2022-04-27 13:16:39,355 INFO L138 SettingsManager]: * Use constant arrays=true [2022-04-27 13:16:39,355 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2022-04-27 13:16:39,355 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2022-04-27 13:16:39,355 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2022-04-27 13:16:39,355 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2022-04-27 13:16:39,356 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-04-27 13:16:39,356 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2022-04-27 13:16:39,356 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2022-04-27 13:16:39,356 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2022-04-27 13:16:39,356 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2022-04-27 13:16:39,356 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2022-04-27 13:16:39,357 INFO L138 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2022-04-27 13:16:39,357 INFO L138 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2022-04-27 13:16:39,357 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2022-04-27 13:16:39,357 INFO L138 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode WARNING: An illegal reflective access operation has occurred WARNING: Illegal reflective access by com.sun.xml.bind.v2.runtime.reflect.opt.Injector$1 (file:/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/plugins/com.sun.xml.bind_2.2.0.v201505121915.jar) to method java.lang.ClassLoader.defineClass(java.lang.String,byte[],int,int) WARNING: Please consider reporting this to the maintainers of com.sun.xml.bind.v2.runtime.reflect.opt.Injector$1 WARNING: Use --illegal-access=warn to enable warnings of further illegal reflective access operations WARNING: All illegal access operations will be denied in a future release Applying setting for plugin de.uni_freiburg.informatik.ultimate.core: Log level for class -> de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=WARN; [2022-04-27 13:16:39,552 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2022-04-27 13:16:39,573 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2022-04-27 13:16:39,575 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2022-04-27 13:16:39,576 INFO L271 PluginConnector]: Initializing CDTParser... [2022-04-27 13:16:39,577 INFO L275 PluginConnector]: CDTParser initialized [2022-04-27 13:16:39,578 INFO L432 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/nla-digbench-scaling/fermat1-ll_unwindbound5.c [2022-04-27 13:16:39,628 INFO L220 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/1d9329617/1a8a93dc692d48d0981fac405414bd2d/FLAG2aa7d32dd [2022-04-27 13:16:39,988 INFO L306 CDTParser]: Found 1 translation units. [2022-04-27 13:16:39,989 INFO L160 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/nla-digbench-scaling/fermat1-ll_unwindbound5.c [2022-04-27 13:16:39,995 INFO L349 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/1d9329617/1a8a93dc692d48d0981fac405414bd2d/FLAG2aa7d32dd [2022-04-27 13:16:40,405 INFO L357 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/1d9329617/1a8a93dc692d48d0981fac405414bd2d [2022-04-27 13:16:40,408 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2022-04-27 13:16:40,409 INFO L131 ToolchainWalker]: Walking toolchain with 4 elements. [2022-04-27 13:16:40,411 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2022-04-27 13:16:40,411 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2022-04-27 13:16:40,418 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2022-04-27 13:16:40,419 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 27.04 01:16:40" (1/1) ... [2022-04-27 13:16:40,422 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@1aab77de and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.04 01:16:40, skipping insertion in model container [2022-04-27 13:16:40,422 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 27.04 01:16:40" (1/1) ... [2022-04-27 13:16:40,428 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2022-04-27 13:16:40,439 INFO L178 MainTranslator]: Built tables and reachable declarations [2022-04-27 13:16:40,561 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/fermat1-ll_unwindbound5.c[535,548] [2022-04-27 13:16:40,580 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-04-27 13:16:40,587 INFO L203 MainTranslator]: Completed pre-run [2022-04-27 13:16:40,597 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/fermat1-ll_unwindbound5.c[535,548] [2022-04-27 13:16:40,606 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-04-27 13:16:40,617 INFO L208 MainTranslator]: Completed translation [2022-04-27 13:16:40,618 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.04 01:16:40 WrapperNode [2022-04-27 13:16:40,618 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2022-04-27 13:16:40,619 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2022-04-27 13:16:40,619 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2022-04-27 13:16:40,619 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2022-04-27 13:16:40,627 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.04 01:16:40" (1/1) ... [2022-04-27 13:16:40,628 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.04 01:16:40" (1/1) ... [2022-04-27 13:16:40,643 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.04 01:16:40" (1/1) ... [2022-04-27 13:16:40,643 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.04 01:16:40" (1/1) ... [2022-04-27 13:16:40,648 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.04 01:16:40" (1/1) ... [2022-04-27 13:16:40,653 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.04 01:16:40" (1/1) ... [2022-04-27 13:16:40,654 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.04 01:16:40" (1/1) ... [2022-04-27 13:16:40,657 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2022-04-27 13:16:40,657 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2022-04-27 13:16:40,657 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2022-04-27 13:16:40,658 INFO L275 PluginConnector]: RCFGBuilder initialized [2022-04-27 13:16:40,660 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.04 01:16:40" (1/1) ... [2022-04-27 13:16:40,671 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-04-27 13:16:40,678 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-04-27 13:16:40,688 INFO L229 MonitoredProcess]: Starting monitored process 1 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (exit command is (exit), workingDir is null) [2022-04-27 13:16:40,690 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (1)] Waiting until timeout for monitored process [2022-04-27 13:16:40,722 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.init [2022-04-27 13:16:40,722 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2022-04-27 13:16:40,723 INFO L138 BoogieDeclarations]: Found implementation of procedure reach_error [2022-04-27 13:16:40,723 INFO L138 BoogieDeclarations]: Found implementation of procedure assume_abort_if_not [2022-04-27 13:16:40,723 INFO L138 BoogieDeclarations]: Found implementation of procedure __VERIFIER_assert [2022-04-27 13:16:40,723 INFO L138 BoogieDeclarations]: Found implementation of procedure main [2022-04-27 13:16:40,723 INFO L130 BoogieDeclarations]: Found specification of procedure abort [2022-04-27 13:16:40,723 INFO L130 BoogieDeclarations]: Found specification of procedure __assert_fail [2022-04-27 13:16:40,723 INFO L130 BoogieDeclarations]: Found specification of procedure reach_error [2022-04-27 13:16:40,724 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2022-04-27 13:16:40,724 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_nondet_int [2022-04-27 13:16:40,724 INFO L130 BoogieDeclarations]: Found specification of procedure assume_abort_if_not [2022-04-27 13:16:40,724 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_assert [2022-04-27 13:16:40,724 INFO L130 BoogieDeclarations]: Found specification of procedure main [2022-04-27 13:16:40,724 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.init [2022-04-27 13:16:40,724 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2022-04-27 13:16:40,724 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2022-04-27 13:16:40,725 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2022-04-27 13:16:40,725 INFO L130 BoogieDeclarations]: Found specification of procedure read~int [2022-04-27 13:16:40,725 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2022-04-27 13:16:40,774 INFO L234 CfgBuilder]: Building ICFG [2022-04-27 13:16:40,775 INFO L260 CfgBuilder]: Building CFG for each procedure with an implementation [2022-04-27 13:16:40,972 INFO L275 CfgBuilder]: Performing block encoding [2022-04-27 13:16:40,979 INFO L294 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2022-04-27 13:16:40,979 INFO L299 CfgBuilder]: Removed 3 assume(true) statements. [2022-04-27 13:16:40,981 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 27.04 01:16:40 BoogieIcfgContainer [2022-04-27 13:16:40,981 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2022-04-27 13:16:40,982 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2022-04-27 13:16:40,982 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2022-04-27 13:16:40,996 INFO L275 PluginConnector]: TraceAbstraction initialized [2022-04-27 13:16:40,997 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 27.04 01:16:40" (1/3) ... [2022-04-27 13:16:40,997 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@1e4d2910 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 27.04 01:16:40, skipping insertion in model container [2022-04-27 13:16:40,997 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.04 01:16:40" (2/3) ... [2022-04-27 13:16:40,998 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@1e4d2910 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 27.04 01:16:40, skipping insertion in model container [2022-04-27 13:16:40,998 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 27.04 01:16:40" (3/3) ... [2022-04-27 13:16:40,999 INFO L111 eAbstractionObserver]: Analyzing ICFG fermat1-ll_unwindbound5.c [2022-04-27 13:16:41,010 INFO L201 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2022-04-27 13:16:41,011 INFO L160 ceAbstractionStarter]: Applying trace abstraction to program that has 1 error locations. [2022-04-27 13:16:41,053 INFO L356 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2022-04-27 13:16:41,059 INFO L357 AbstractCegarLoop]: Settings: SEPARATE_VIOLATION_CHECK=true, mInterprocedural=true, mMaxIterations=1000000, mWatchIteration=1000000, mArtifact=RCFG, mInterpolation=FPandBP, mInterpolantAutomaton=STRAIGHT_LINE, mDumpAutomata=false, mAutomataFormat=ATS_NUMERATE, mDumpPath=., mDeterminiation=PREDICATE_ABSTRACTION, mMinimize=MINIMIZE_SEVPA, mHoare=true, mAutomataTypeConcurrency=PETRI_NET, mHoareTripleChecks=INCREMENTAL, mHoareAnnotationPositions=LoopsAndPotentialCycles, mDumpOnlyReuseAutomata=false, mLimitTraceHistogram=0, mErrorLocTimeLimit=0, mLimitPathProgramCount=0, mCollectInterpolantStatistics=true, mHeuristicEmptinessCheck=false, mHeuristicEmptinessCheckAStarHeuristic=ZERO, mHeuristicEmptinessCheckAStarHeuristicRandomSeed=1337, mHeuristicEmptinessCheckSmtFeatureScoringMethod=DAGSIZE, mSMTFeatureExtraction=false, mSMTFeatureExtractionDumpPath=., mOverrideInterpolantAutomaton=false, mMcrInterpolantMethod=WP, mPorIndependenceSettings=de.uni_freiburg.informatik.ultimate.lib.tracecheckerutils.partialorder.independence.IndependenceSettings@6e033b53, mLbeIndependenceSettings=de.uni_freiburg.informatik.ultimate.lib.tracecheckerutils.partialorder.independence.IndependenceSettings@40c99dcf [2022-04-27 13:16:41,059 INFO L358 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2022-04-27 13:16:41,068 INFO L276 IsEmpty]: Start isEmpty. Operand has 37 states, 23 states have (on average 1.5217391304347827) internal successors, (35), 24 states have internal predecessors, (35), 8 states have call successors, (8), 4 states have call predecessors, (8), 4 states have return successors, (8), 8 states have call predecessors, (8), 8 states have call successors, (8) [2022-04-27 13:16:41,079 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2022-04-27 13:16:41,079 INFO L187 NwaCegarLoop]: Found error trace [2022-04-27 13:16:41,080 INFO L195 NwaCegarLoop]: trace histogram [2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-27 13:16:41,080 INFO L420 AbstractCegarLoop]: === Iteration 1 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-27 13:16:41,088 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-27 13:16:41,088 INFO L85 PathProgramCache]: Analyzing trace with hash 928708300, now seen corresponding path program 1 times [2022-04-27 13:16:41,097 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-27 13:16:41,098 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1604838695] [2022-04-27 13:16:41,098 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-27 13:16:41,099 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-27 13:16:41,176 ERROR L245 FreeRefinementEngine]: Caught known exception: Unsupported non-linear arithmetic [2022-04-27 13:16:41,176 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [1326605236] [2022-04-27 13:16:41,176 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-27 13:16:41,177 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-27 13:16:41,177 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-04-27 13:16:41,178 INFO L229 MonitoredProcess]: Starting monitored process 2 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-04-27 13:16:41,183 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Waiting until timeout for monitored process [2022-04-27 13:16:41,255 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-27 13:16:41,257 INFO L263 TraceCheckSpWp]: Trace formula consists of 89 conjuncts, 1 conjunts are in the unsatisfiable core [2022-04-27 13:16:41,266 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-27 13:16:41,269 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-04-27 13:16:41,352 INFO L272 TraceCheckUtils]: 0: Hoare triple {40#true} call ULTIMATE.init(); {40#true} is VALID [2022-04-27 13:16:41,353 INFO L290 TraceCheckUtils]: 1: Hoare triple {40#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; {40#true} is VALID [2022-04-27 13:16:41,353 INFO L290 TraceCheckUtils]: 2: Hoare triple {40#true} assume true; {40#true} is VALID [2022-04-27 13:16:41,353 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {40#true} {40#true} #102#return; {40#true} is VALID [2022-04-27 13:16:41,353 INFO L272 TraceCheckUtils]: 4: Hoare triple {40#true} call #t~ret9 := main(); {40#true} is VALID [2022-04-27 13:16:41,354 INFO L290 TraceCheckUtils]: 5: Hoare triple {40#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; {40#true} is VALID [2022-04-27 13:16:41,354 INFO L272 TraceCheckUtils]: 6: Hoare triple {40#true} call assume_abort_if_not((if (~R~0 - 1) * (~R~0 - 1) < ~A~0 then 1 else 0)); {40#true} is VALID [2022-04-27 13:16:41,354 INFO L290 TraceCheckUtils]: 7: Hoare triple {40#true} ~cond := #in~cond; {40#true} is VALID [2022-04-27 13:16:41,355 INFO L290 TraceCheckUtils]: 8: Hoare triple {40#true} assume 0 == ~cond;assume false; {41#false} is VALID [2022-04-27 13:16:41,355 INFO L290 TraceCheckUtils]: 9: Hoare triple {41#false} assume true; {41#false} is VALID [2022-04-27 13:16:41,355 INFO L284 TraceCheckUtils]: 10: Hoare quadruple {41#false} {40#true} #90#return; {41#false} is VALID [2022-04-27 13:16:41,355 INFO L272 TraceCheckUtils]: 11: Hoare triple {41#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)); {41#false} is VALID [2022-04-27 13:16:41,356 INFO L290 TraceCheckUtils]: 12: Hoare triple {41#false} ~cond := #in~cond; {41#false} is VALID [2022-04-27 13:16:41,356 INFO L290 TraceCheckUtils]: 13: Hoare triple {41#false} assume 0 == ~cond;assume false; {41#false} is VALID [2022-04-27 13:16:41,356 INFO L290 TraceCheckUtils]: 14: Hoare triple {41#false} assume true; {41#false} is VALID [2022-04-27 13:16:41,356 INFO L284 TraceCheckUtils]: 15: Hoare quadruple {41#false} {41#false} #92#return; {41#false} is VALID [2022-04-27 13:16:41,356 INFO L290 TraceCheckUtils]: 16: Hoare triple {41#false} ~u~0 := 1 + 2 * ~R~0;~v~0 := 1;~r~0 := ~R~0 * ~R~0 - ~A~0; {41#false} is VALID [2022-04-27 13:16:41,357 INFO L290 TraceCheckUtils]: 17: Hoare triple {41#false} assume !true; {41#false} is VALID [2022-04-27 13:16:41,357 INFO L272 TraceCheckUtils]: 18: Hoare triple {41#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)); {41#false} is VALID [2022-04-27 13:16:41,357 INFO L290 TraceCheckUtils]: 19: Hoare triple {41#false} ~cond := #in~cond; {41#false} is VALID [2022-04-27 13:16:41,357 INFO L290 TraceCheckUtils]: 20: Hoare triple {41#false} assume 0 == ~cond; {41#false} is VALID [2022-04-27 13:16:41,357 INFO L290 TraceCheckUtils]: 21: Hoare triple {41#false} assume !false; {41#false} is VALID [2022-04-27 13:16:41,358 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 2 proven. 0 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2022-04-27 13:16:41,359 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-04-27 13:16:41,359 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-27 13:16:41,359 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1604838695] [2022-04-27 13:16:41,359 WARN L310 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2022-04-27 13:16:41,359 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1326605236] [2022-04-27 13:16:41,360 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1326605236] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-27 13:16:41,360 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-27 13:16:41,360 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2022-04-27 13:16:41,362 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1284338398] [2022-04-27 13:16:41,362 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-27 13:16:41,367 INFO L78 Accepts]: Start accepts. Automaton has has 2 states, 2 states have (on average 6.5) internal successors, (13), 2 states have internal predecessors, (13), 2 states have call successors, (5), 2 states have call predecessors, (5), 2 states have return successors, (3), 2 states have call predecessors, (3), 2 states have call successors, (3) Word has length 22 [2022-04-27 13:16:41,368 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-27 13:16:41,371 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with has 2 states, 2 states have (on average 6.5) internal successors, (13), 2 states have internal predecessors, (13), 2 states have call successors, (5), 2 states have call predecessors, (5), 2 states have return successors, (3), 2 states have call predecessors, (3), 2 states have call successors, (3) [2022-04-27 13:16:41,393 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 21 edges. 21 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-27 13:16:41,394 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2022-04-27 13:16:41,394 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-04-27 13:16:41,413 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2022-04-27 13:16:41,414 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2022-04-27 13:16:41,416 INFO L87 Difference]: Start difference. First operand has 37 states, 23 states have (on average 1.5217391304347827) internal successors, (35), 24 states have internal predecessors, (35), 8 states have call successors, (8), 4 states have call predecessors, (8), 4 states have return successors, (8), 8 states have call predecessors, (8), 8 states have call successors, (8) Second operand has 2 states, 2 states have (on average 6.5) internal successors, (13), 2 states have internal predecessors, (13), 2 states have call successors, (5), 2 states have call predecessors, (5), 2 states have return successors, (3), 2 states have call predecessors, (3), 2 states have call successors, (3) [2022-04-27 13:16:41,502 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-27 13:16:41,502 INFO L93 Difference]: Finished difference Result 67 states and 100 transitions. [2022-04-27 13:16:41,502 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2022-04-27 13:16:41,503 INFO L78 Accepts]: Start accepts. Automaton has has 2 states, 2 states have (on average 6.5) internal successors, (13), 2 states have internal predecessors, (13), 2 states have call successors, (5), 2 states have call predecessors, (5), 2 states have return successors, (3), 2 states have call predecessors, (3), 2 states have call successors, (3) Word has length 22 [2022-04-27 13:16:41,505 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-27 13:16:41,507 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 2 states, 2 states have (on average 6.5) internal successors, (13), 2 states have internal predecessors, (13), 2 states have call successors, (5), 2 states have call predecessors, (5), 2 states have return successors, (3), 2 states have call predecessors, (3), 2 states have call successors, (3) [2022-04-27 13:16:41,515 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2 states to 2 states and 100 transitions. [2022-04-27 13:16:41,516 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 2 states, 2 states have (on average 6.5) internal successors, (13), 2 states have internal predecessors, (13), 2 states have call successors, (5), 2 states have call predecessors, (5), 2 states have return successors, (3), 2 states have call predecessors, (3), 2 states have call successors, (3) [2022-04-27 13:16:41,520 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2 states to 2 states and 100 transitions. [2022-04-27 13:16:41,521 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 2 states and 100 transitions. [2022-04-27 13:16:41,613 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 100 edges. 100 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-27 13:16:41,629 INFO L225 Difference]: With dead ends: 67 [2022-04-27 13:16:41,629 INFO L226 Difference]: Without dead ends: 32 [2022-04-27 13:16:41,632 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 21 GetRequests, 21 SyntacticMatches, 0 SemanticMatches, 0 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2022-04-27 13:16:41,638 INFO L413 NwaCegarLoop]: 46 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, 46 SdHoareTripleChecker+Invalid, 0 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 0 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-04-27 13:16:41,639 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 46 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 0 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-04-27 13:16:41,656 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 32 states. [2022-04-27 13:16:41,671 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 32 to 32. [2022-04-27 13:16:41,671 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-27 13:16:41,673 INFO L82 GeneralOperation]: Start isEquivalent. First operand 32 states. Second operand has 32 states, 20 states have (on average 1.35) internal successors, (27), 21 states have internal predecessors, (27), 8 states have call successors, (8), 4 states have call predecessors, (8), 3 states have return successors, (6), 6 states have call predecessors, (6), 6 states have call successors, (6) [2022-04-27 13:16:41,674 INFO L74 IsIncluded]: Start isIncluded. First operand 32 states. Second operand has 32 states, 20 states have (on average 1.35) internal successors, (27), 21 states have internal predecessors, (27), 8 states have call successors, (8), 4 states have call predecessors, (8), 3 states have return successors, (6), 6 states have call predecessors, (6), 6 states have call successors, (6) [2022-04-27 13:16:41,674 INFO L87 Difference]: Start difference. First operand 32 states. Second operand has 32 states, 20 states have (on average 1.35) internal successors, (27), 21 states have internal predecessors, (27), 8 states have call successors, (8), 4 states have call predecessors, (8), 3 states have return successors, (6), 6 states have call predecessors, (6), 6 states have call successors, (6) [2022-04-27 13:16:41,683 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-27 13:16:41,684 INFO L93 Difference]: Finished difference Result 32 states and 41 transitions. [2022-04-27 13:16:41,684 INFO L276 IsEmpty]: Start isEmpty. Operand 32 states and 41 transitions. [2022-04-27 13:16:41,688 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-27 13:16:41,688 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-27 13:16:41,694 INFO L74 IsIncluded]: Start isIncluded. First operand has 32 states, 20 states have (on average 1.35) internal successors, (27), 21 states have internal predecessors, (27), 8 states have call successors, (8), 4 states have call predecessors, (8), 3 states have return successors, (6), 6 states have call predecessors, (6), 6 states have call successors, (6) Second operand 32 states. [2022-04-27 13:16:41,696 INFO L87 Difference]: Start difference. First operand has 32 states, 20 states have (on average 1.35) internal successors, (27), 21 states have internal predecessors, (27), 8 states have call successors, (8), 4 states have call predecessors, (8), 3 states have return successors, (6), 6 states have call predecessors, (6), 6 states have call successors, (6) Second operand 32 states. [2022-04-27 13:16:41,709 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-27 13:16:41,710 INFO L93 Difference]: Finished difference Result 32 states and 41 transitions. [2022-04-27 13:16:41,710 INFO L276 IsEmpty]: Start isEmpty. Operand 32 states and 41 transitions. [2022-04-27 13:16:41,711 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-27 13:16:41,711 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-27 13:16:41,711 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-27 13:16:41,711 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-27 13:16:41,712 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 32 states, 20 states have (on average 1.35) internal successors, (27), 21 states have internal predecessors, (27), 8 states have call successors, (8), 4 states have call predecessors, (8), 3 states have return successors, (6), 6 states have call predecessors, (6), 6 states have call successors, (6) [2022-04-27 13:16:41,714 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 32 states to 32 states and 41 transitions. [2022-04-27 13:16:41,715 INFO L78 Accepts]: Start accepts. Automaton has 32 states and 41 transitions. Word has length 22 [2022-04-27 13:16:41,716 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-27 13:16:41,716 INFO L495 AbstractCegarLoop]: Abstraction has 32 states and 41 transitions. [2022-04-27 13:16:41,716 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 2 states, 2 states have (on average 6.5) internal successors, (13), 2 states have internal predecessors, (13), 2 states have call successors, (5), 2 states have call predecessors, (5), 2 states have return successors, (3), 2 states have call predecessors, (3), 2 states have call successors, (3) [2022-04-27 13:16:41,716 INFO L276 IsEmpty]: Start isEmpty. Operand 32 states and 41 transitions. [2022-04-27 13:16:41,717 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 24 [2022-04-27 13:16:41,717 INFO L187 NwaCegarLoop]: Found error trace [2022-04-27 13:16:41,718 INFO L195 NwaCegarLoop]: trace histogram [2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-27 13:16:41,745 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Forceful destruction successful, exit code 0 [2022-04-27 13:16:41,935 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 2 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable0 [2022-04-27 13:16:41,936 INFO L420 AbstractCegarLoop]: === Iteration 2 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-27 13:16:41,936 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-27 13:16:41,936 INFO L85 PathProgramCache]: Analyzing trace with hash -155606603, now seen corresponding path program 1 times [2022-04-27 13:16:41,937 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-27 13:16:41,937 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [726472322] [2022-04-27 13:16:41,937 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-27 13:16:41,937 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-27 13:16:41,962 ERROR L245 FreeRefinementEngine]: Caught known exception: Unsupported non-linear arithmetic [2022-04-27 13:16:41,963 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [1757124691] [2022-04-27 13:16:41,963 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-27 13:16:41,963 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-27 13:16:41,963 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-04-27 13:16:41,964 INFO L229 MonitoredProcess]: Starting monitored process 3 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-04-27 13:16:41,967 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Waiting until timeout for monitored process [2022-04-27 13:16:42,018 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-27 13:16:42,019 INFO L263 TraceCheckSpWp]: Trace formula consists of 93 conjuncts, 5 conjunts are in the unsatisfiable core [2022-04-27 13:16:42,028 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-27 13:16:42,030 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-04-27 13:16:42,217 INFO L272 TraceCheckUtils]: 0: Hoare triple {307#true} call ULTIMATE.init(); {307#true} is VALID [2022-04-27 13:16:42,226 INFO L290 TraceCheckUtils]: 1: Hoare triple {307#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; {315#(<= ~counter~0 0)} is VALID [2022-04-27 13:16:42,227 INFO L290 TraceCheckUtils]: 2: Hoare triple {315#(<= ~counter~0 0)} assume true; {315#(<= ~counter~0 0)} is VALID [2022-04-27 13:16:42,229 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {315#(<= ~counter~0 0)} {307#true} #102#return; {315#(<= ~counter~0 0)} is VALID [2022-04-27 13:16:42,229 INFO L272 TraceCheckUtils]: 4: Hoare triple {315#(<= ~counter~0 0)} call #t~ret9 := main(); {315#(<= ~counter~0 0)} is VALID [2022-04-27 13:16:42,230 INFO L290 TraceCheckUtils]: 5: Hoare triple {315#(<= ~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; {315#(<= ~counter~0 0)} is VALID [2022-04-27 13:16:42,230 INFO L272 TraceCheckUtils]: 6: Hoare triple {315#(<= ~counter~0 0)} call assume_abort_if_not((if (~R~0 - 1) * (~R~0 - 1) < ~A~0 then 1 else 0)); {315#(<= ~counter~0 0)} is VALID [2022-04-27 13:16:42,231 INFO L290 TraceCheckUtils]: 7: Hoare triple {315#(<= ~counter~0 0)} ~cond := #in~cond; {315#(<= ~counter~0 0)} is VALID [2022-04-27 13:16:42,231 INFO L290 TraceCheckUtils]: 8: Hoare triple {315#(<= ~counter~0 0)} assume !(0 == ~cond); {315#(<= ~counter~0 0)} is VALID [2022-04-27 13:16:42,232 INFO L290 TraceCheckUtils]: 9: Hoare triple {315#(<= ~counter~0 0)} assume true; {315#(<= ~counter~0 0)} is VALID [2022-04-27 13:16:42,233 INFO L284 TraceCheckUtils]: 10: Hoare quadruple {315#(<= ~counter~0 0)} {315#(<= ~counter~0 0)} #90#return; {315#(<= ~counter~0 0)} is VALID [2022-04-27 13:16:42,234 INFO L272 TraceCheckUtils]: 11: Hoare triple {315#(<= ~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)); {315#(<= ~counter~0 0)} is VALID [2022-04-27 13:16:42,234 INFO L290 TraceCheckUtils]: 12: Hoare triple {315#(<= ~counter~0 0)} ~cond := #in~cond; {315#(<= ~counter~0 0)} is VALID [2022-04-27 13:16:42,235 INFO L290 TraceCheckUtils]: 13: Hoare triple {315#(<= ~counter~0 0)} assume !(0 == ~cond); {315#(<= ~counter~0 0)} is VALID [2022-04-27 13:16:42,235 INFO L290 TraceCheckUtils]: 14: Hoare triple {315#(<= ~counter~0 0)} assume true; {315#(<= ~counter~0 0)} is VALID [2022-04-27 13:16:42,236 INFO L284 TraceCheckUtils]: 15: Hoare quadruple {315#(<= ~counter~0 0)} {315#(<= ~counter~0 0)} #92#return; {315#(<= ~counter~0 0)} is VALID [2022-04-27 13:16:42,236 INFO L290 TraceCheckUtils]: 16: Hoare triple {315#(<= ~counter~0 0)} ~u~0 := 1 + 2 * ~R~0;~v~0 := 1;~r~0 := ~R~0 * ~R~0 - ~A~0; {315#(<= ~counter~0 0)} is VALID [2022-04-27 13:16:42,237 INFO L290 TraceCheckUtils]: 17: Hoare triple {315#(<= ~counter~0 0)} #t~post6 := ~counter~0;~counter~0 := 1 + #t~post6; {364#(<= |main_#t~post6| 0)} is VALID [2022-04-27 13:16:42,237 INFO L290 TraceCheckUtils]: 18: Hoare triple {364#(<= |main_#t~post6| 0)} assume !(#t~post6 < 5);havoc #t~post6; {308#false} is VALID [2022-04-27 13:16:42,238 INFO L272 TraceCheckUtils]: 19: Hoare triple {308#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)); {308#false} is VALID [2022-04-27 13:16:42,238 INFO L290 TraceCheckUtils]: 20: Hoare triple {308#false} ~cond := #in~cond; {308#false} is VALID [2022-04-27 13:16:42,238 INFO L290 TraceCheckUtils]: 21: Hoare triple {308#false} assume 0 == ~cond; {308#false} is VALID [2022-04-27 13:16:42,238 INFO L290 TraceCheckUtils]: 22: Hoare triple {308#false} assume !false; {308#false} is VALID [2022-04-27 13:16:42,238 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2022-04-27 13:16:42,238 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-04-27 13:16:42,239 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-27 13:16:42,239 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [726472322] [2022-04-27 13:16:42,239 WARN L310 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2022-04-27 13:16:42,241 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1757124691] [2022-04-27 13:16:42,242 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1757124691] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-27 13:16:42,242 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-27 13:16:42,242 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-04-27 13:16:42,242 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2007939648] [2022-04-27 13:16:42,242 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-27 13:16:42,244 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 3.0) internal successors, (12), 3 states have internal predecessors, (12), 3 states have call successors, (5), 3 states have call predecessors, (5), 1 states have return successors, (3), 1 states have call predecessors, (3), 2 states have call successors, (3) Word has length 23 [2022-04-27 13:16:42,244 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-27 13:16:42,245 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with has 4 states, 4 states have (on average 3.0) internal successors, (12), 3 states have internal predecessors, (12), 3 states have call successors, (5), 3 states have call predecessors, (5), 1 states have return successors, (3), 1 states have call predecessors, (3), 2 states have call successors, (3) [2022-04-27 13:16:42,263 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 20 edges. 20 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-27 13:16:42,263 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-04-27 13:16:42,263 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-04-27 13:16:42,264 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-04-27 13:16:42,264 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-04-27 13:16:42,264 INFO L87 Difference]: Start difference. First operand 32 states and 41 transitions. Second operand has 4 states, 4 states have (on average 3.0) internal successors, (12), 3 states have internal predecessors, (12), 3 states have call successors, (5), 3 states have call predecessors, (5), 1 states have return successors, (3), 1 states have call predecessors, (3), 2 states have call successors, (3) [2022-04-27 13:16:42,358 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-27 13:16:42,358 INFO L93 Difference]: Finished difference Result 41 states and 50 transitions. [2022-04-27 13:16:42,358 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-04-27 13:16:42,358 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 3.0) internal successors, (12), 3 states have internal predecessors, (12), 3 states have call successors, (5), 3 states have call predecessors, (5), 1 states have return successors, (3), 1 states have call predecessors, (3), 2 states have call successors, (3) Word has length 23 [2022-04-27 13:16:42,359 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-27 13:16:42,360 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 4 states, 4 states have (on average 3.0) internal successors, (12), 3 states have internal predecessors, (12), 3 states have call successors, (5), 3 states have call predecessors, (5), 1 states have return successors, (3), 1 states have call predecessors, (3), 2 states have call successors, (3) [2022-04-27 13:16:42,367 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 50 transitions. [2022-04-27 13:16:42,368 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 4 states, 4 states have (on average 3.0) internal successors, (12), 3 states have internal predecessors, (12), 3 states have call successors, (5), 3 states have call predecessors, (5), 1 states have return successors, (3), 1 states have call predecessors, (3), 2 states have call successors, (3) [2022-04-27 13:16:42,371 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 50 transitions. [2022-04-27 13:16:42,371 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 4 states and 50 transitions. [2022-04-27 13:16:42,412 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 50 edges. 50 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-27 13:16:42,415 INFO L225 Difference]: With dead ends: 41 [2022-04-27 13:16:42,416 INFO L226 Difference]: Without dead ends: 34 [2022-04-27 13:16:42,416 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 22 GetRequests, 20 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-04-27 13:16:42,419 INFO L413 NwaCegarLoop]: 39 mSDtfsCounter, 0 mSDsluCounter, 62 mSDsCounter, 0 mSdLazyCounter, 9 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 101 SdHoareTripleChecker+Invalid, 9 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 9 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-04-27 13:16:42,420 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 101 Invalid, 9 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 9 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-04-27 13:16:42,422 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 34 states. [2022-04-27 13:16:42,434 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 34 to 34. [2022-04-27 13:16:42,434 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-27 13:16:42,435 INFO L82 GeneralOperation]: Start isEquivalent. First operand 34 states. Second operand has 34 states, 22 states have (on average 1.3181818181818181) internal successors, (29), 23 states have internal predecessors, (29), 8 states have call successors, (8), 4 states have call predecessors, (8), 3 states have return successors, (6), 6 states have call predecessors, (6), 6 states have call successors, (6) [2022-04-27 13:16:42,435 INFO L74 IsIncluded]: Start isIncluded. First operand 34 states. Second operand has 34 states, 22 states have (on average 1.3181818181818181) internal successors, (29), 23 states have internal predecessors, (29), 8 states have call successors, (8), 4 states have call predecessors, (8), 3 states have return successors, (6), 6 states have call predecessors, (6), 6 states have call successors, (6) [2022-04-27 13:16:42,438 INFO L87 Difference]: Start difference. First operand 34 states. Second operand has 34 states, 22 states have (on average 1.3181818181818181) internal successors, (29), 23 states have internal predecessors, (29), 8 states have call successors, (8), 4 states have call predecessors, (8), 3 states have return successors, (6), 6 states have call predecessors, (6), 6 states have call successors, (6) [2022-04-27 13:16:42,440 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-27 13:16:42,440 INFO L93 Difference]: Finished difference Result 34 states and 43 transitions. [2022-04-27 13:16:42,440 INFO L276 IsEmpty]: Start isEmpty. Operand 34 states and 43 transitions. [2022-04-27 13:16:42,441 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-27 13:16:42,441 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-27 13:16:42,441 INFO L74 IsIncluded]: Start isIncluded. First operand has 34 states, 22 states have (on average 1.3181818181818181) internal successors, (29), 23 states have internal predecessors, (29), 8 states have call successors, (8), 4 states have call predecessors, (8), 3 states have return successors, (6), 6 states have call predecessors, (6), 6 states have call successors, (6) Second operand 34 states. [2022-04-27 13:16:42,441 INFO L87 Difference]: Start difference. First operand has 34 states, 22 states have (on average 1.3181818181818181) internal successors, (29), 23 states have internal predecessors, (29), 8 states have call successors, (8), 4 states have call predecessors, (8), 3 states have return successors, (6), 6 states have call predecessors, (6), 6 states have call successors, (6) Second operand 34 states. [2022-04-27 13:16:42,444 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-27 13:16:42,444 INFO L93 Difference]: Finished difference Result 34 states and 43 transitions. [2022-04-27 13:16:42,444 INFO L276 IsEmpty]: Start isEmpty. Operand 34 states and 43 transitions. [2022-04-27 13:16:42,445 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-27 13:16:42,445 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-27 13:16:42,445 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-27 13:16:42,445 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-27 13:16:42,445 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 34 states, 22 states have (on average 1.3181818181818181) internal successors, (29), 23 states have internal predecessors, (29), 8 states have call successors, (8), 4 states have call predecessors, (8), 3 states have return successors, (6), 6 states have call predecessors, (6), 6 states have call successors, (6) [2022-04-27 13:16:42,447 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 34 states to 34 states and 43 transitions. [2022-04-27 13:16:42,448 INFO L78 Accepts]: Start accepts. Automaton has 34 states and 43 transitions. Word has length 23 [2022-04-27 13:16:42,448 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-27 13:16:42,448 INFO L495 AbstractCegarLoop]: Abstraction has 34 states and 43 transitions. [2022-04-27 13:16:42,448 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 3.0) internal successors, (12), 3 states have internal predecessors, (12), 3 states have call successors, (5), 3 states have call predecessors, (5), 1 states have return successors, (3), 1 states have call predecessors, (3), 2 states have call successors, (3) [2022-04-27 13:16:42,448 INFO L276 IsEmpty]: Start isEmpty. Operand 34 states and 43 transitions. [2022-04-27 13:16:42,449 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 24 [2022-04-27 13:16:42,449 INFO L187 NwaCegarLoop]: Found error trace [2022-04-27 13:16:42,449 INFO L195 NwaCegarLoop]: trace histogram [2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-27 13:16:42,475 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Forceful destruction successful, exit code 0 [2022-04-27 13:16:42,670 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 3 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable1 [2022-04-27 13:16:42,671 INFO L420 AbstractCegarLoop]: === Iteration 3 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-27 13:16:42,671 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-27 13:16:42,672 INFO L85 PathProgramCache]: Analyzing trace with hash -153938307, now seen corresponding path program 1 times [2022-04-27 13:16:42,672 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-27 13:16:42,672 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1869361401] [2022-04-27 13:16:42,672 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-27 13:16:42,672 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-27 13:16:42,687 ERROR L245 FreeRefinementEngine]: Caught known exception: Unsupported non-linear arithmetic [2022-04-27 13:16:42,687 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [1691123209] [2022-04-27 13:16:42,687 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-27 13:16:42,687 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-27 13:16:42,687 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-04-27 13:16:42,688 INFO L229 MonitoredProcess]: Starting monitored process 4 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-04-27 13:16:42,691 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Waiting until timeout for monitored process [2022-04-27 13:16:42,740 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-27 13:16:42,741 INFO L263 TraceCheckSpWp]: Trace formula consists of 93 conjuncts, 13 conjunts are in the unsatisfiable core [2022-04-27 13:16:42,753 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-27 13:16:42,755 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-04-27 13:16:43,187 INFO L272 TraceCheckUtils]: 0: Hoare triple {554#true} call ULTIMATE.init(); {554#true} is VALID [2022-04-27 13:16:43,188 INFO L290 TraceCheckUtils]: 1: Hoare triple {554#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; {554#true} is VALID [2022-04-27 13:16:43,188 INFO L290 TraceCheckUtils]: 2: Hoare triple {554#true} assume true; {554#true} is VALID [2022-04-27 13:16:43,188 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {554#true} {554#true} #102#return; {554#true} is VALID [2022-04-27 13:16:43,188 INFO L272 TraceCheckUtils]: 4: Hoare triple {554#true} call #t~ret9 := main(); {554#true} is VALID [2022-04-27 13:16:43,189 INFO L290 TraceCheckUtils]: 5: Hoare triple {554#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; {554#true} is VALID [2022-04-27 13:16:43,189 INFO L272 TraceCheckUtils]: 6: Hoare triple {554#true} call assume_abort_if_not((if (~R~0 - 1) * (~R~0 - 1) < ~A~0 then 1 else 0)); {554#true} is VALID [2022-04-27 13:16:43,189 INFO L290 TraceCheckUtils]: 7: Hoare triple {554#true} ~cond := #in~cond; {554#true} is VALID [2022-04-27 13:16:43,189 INFO L290 TraceCheckUtils]: 8: Hoare triple {554#true} assume !(0 == ~cond); {554#true} is VALID [2022-04-27 13:16:43,189 INFO L290 TraceCheckUtils]: 9: Hoare triple {554#true} assume true; {554#true} is VALID [2022-04-27 13:16:43,189 INFO L284 TraceCheckUtils]: 10: Hoare quadruple {554#true} {554#true} #90#return; {554#true} is VALID [2022-04-27 13:16:43,189 INFO L272 TraceCheckUtils]: 11: Hoare triple {554#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)); {554#true} is VALID [2022-04-27 13:16:43,190 INFO L290 TraceCheckUtils]: 12: Hoare triple {554#true} ~cond := #in~cond; {554#true} is VALID [2022-04-27 13:16:43,190 INFO L290 TraceCheckUtils]: 13: Hoare triple {554#true} assume !(0 == ~cond); {554#true} is VALID [2022-04-27 13:16:43,190 INFO L290 TraceCheckUtils]: 14: Hoare triple {554#true} assume true; {554#true} is VALID [2022-04-27 13:16:43,190 INFO L284 TraceCheckUtils]: 15: Hoare quadruple {554#true} {554#true} #92#return; {554#true} is VALID [2022-04-27 13:16:45,192 WARN L290 TraceCheckUtils]: 16: Hoare triple {554#true} ~u~0 := 1 + 2 * ~R~0;~v~0 := 1;~r~0 := ~R~0 * ~R~0 - ~A~0; {607#(and (= (+ (* (- 1) main_~A~0) (* (div (+ (* (- 1) main_~u~0) 1) (- 2)) (div (+ (* (- 1) main_~u~0) 1) (- 2)))) main_~r~0) (= (mod (+ main_~u~0 1) 2) 0) (= main_~v~0 1))} is UNKNOWN [2022-04-27 13:16:45,193 INFO L290 TraceCheckUtils]: 17: Hoare triple {607#(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; {607#(and (= (+ (* (- 1) main_~A~0) (* (div (+ (* (- 1) main_~u~0) 1) (- 2)) (div (+ (* (- 1) main_~u~0) 1) (- 2)))) main_~r~0) (= (mod (+ main_~u~0 1) 2) 0) (= main_~v~0 1))} is VALID [2022-04-27 13:16:45,198 INFO L290 TraceCheckUtils]: 18: Hoare triple {607#(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; {607#(and (= (+ (* (- 1) main_~A~0) (* (div (+ (* (- 1) main_~u~0) 1) (- 2)) (div (+ (* (- 1) main_~u~0) 1) (- 2)))) main_~r~0) (= (mod (+ main_~u~0 1) 2) 0) (= main_~v~0 1))} is VALID [2022-04-27 13:16:45,872 INFO L272 TraceCheckUtils]: 19: Hoare triple {607#(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)); {617#(<= 1 |__VERIFIER_assert_#in~cond|)} is VALID [2022-04-27 13:16:45,873 INFO L290 TraceCheckUtils]: 20: Hoare triple {617#(<= 1 |__VERIFIER_assert_#in~cond|)} ~cond := #in~cond; {621#(<= 1 __VERIFIER_assert_~cond)} is VALID [2022-04-27 13:16:45,873 INFO L290 TraceCheckUtils]: 21: Hoare triple {621#(<= 1 __VERIFIER_assert_~cond)} assume 0 == ~cond; {555#false} is VALID [2022-04-27 13:16:45,874 INFO L290 TraceCheckUtils]: 22: Hoare triple {555#false} assume !false; {555#false} is VALID [2022-04-27 13:16:45,874 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2022-04-27 13:16:45,874 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-04-27 13:16:45,874 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-27 13:16:45,874 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1869361401] [2022-04-27 13:16:45,874 WARN L310 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2022-04-27 13:16:45,874 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1691123209] [2022-04-27 13:16:45,875 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1691123209] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-27 13:16:45,875 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-27 13:16:45,875 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2022-04-27 13:16:45,875 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1261426735] [2022-04-27 13:16:45,875 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-27 13:16:45,875 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 2.4) internal successors, (12), 4 states have internal predecessors, (12), 2 states have call successors, (5), 2 states have call predecessors, (5), 1 states have return successors, (3), 1 states have call predecessors, (3), 1 states have call successors, (3) Word has length 23 [2022-04-27 13:16:45,876 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-27 13:16:45,876 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with has 5 states, 5 states have (on average 2.4) internal successors, (12), 4 states have internal predecessors, (12), 2 states have call successors, (5), 2 states have call predecessors, (5), 1 states have return successors, (3), 1 states have call predecessors, (3), 1 states have call successors, (3) [2022-04-27 13:16:47,630 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 20 edges. 20 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-27 13:16:47,630 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-04-27 13:16:47,630 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-04-27 13:16:47,631 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-04-27 13:16:47,631 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2022-04-27 13:16:47,631 INFO L87 Difference]: Start difference. First operand 34 states and 43 transitions. Second operand has 5 states, 5 states have (on average 2.4) internal successors, (12), 4 states have internal predecessors, (12), 2 states have call successors, (5), 2 states have call predecessors, (5), 1 states have return successors, (3), 1 states have call predecessors, (3), 1 states have call successors, (3) [2022-04-27 13:16:56,974 WARN L534 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.65s for a HTC check with result INVALID. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=true, quantifiers [] [2022-04-27 13:16:59,352 WARN L534 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=true, quantifiers [] [2022-04-27 13:16:59,409 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-27 13:16:59,410 INFO L93 Difference]: Finished difference Result 53 states and 70 transitions. [2022-04-27 13:16:59,410 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-04-27 13:16:59,410 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 2.4) internal successors, (12), 4 states have internal predecessors, (12), 2 states have call successors, (5), 2 states have call predecessors, (5), 1 states have return successors, (3), 1 states have call predecessors, (3), 1 states have call successors, (3) Word has length 23 [2022-04-27 13:16:59,410 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-27 13:16:59,411 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 5 states, 5 states have (on average 2.4) internal successors, (12), 4 states have internal predecessors, (12), 2 states have call successors, (5), 2 states have call predecessors, (5), 1 states have return successors, (3), 1 states have call predecessors, (3), 1 states have call successors, (3) [2022-04-27 13:16:59,412 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 68 transitions. [2022-04-27 13:16:59,413 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 5 states, 5 states have (on average 2.4) internal successors, (12), 4 states have internal predecessors, (12), 2 states have call successors, (5), 2 states have call predecessors, (5), 1 states have return successors, (3), 1 states have call predecessors, (3), 1 states have call successors, (3) [2022-04-27 13:16:59,415 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 68 transitions. [2022-04-27 13:16:59,415 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 5 states and 68 transitions. [2022-04-27 13:17:04,643 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 68 edges. 67 inductive. 0 not inductive. 1 times theorem prover too weak to decide inductivity. [2022-04-27 13:17:04,645 INFO L225 Difference]: With dead ends: 53 [2022-04-27 13:17:04,645 INFO L226 Difference]: Without dead ends: 51 [2022-04-27 13:17:04,646 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 23 GetRequests, 19 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2022-04-27 13:17:04,647 INFO L413 NwaCegarLoop]: 33 mSDtfsCounter, 16 mSDsluCounter, 83 mSDsCounter, 0 mSdLazyCounter, 55 mSolverCounterSat, 2 mSolverCounterUnsat, 1 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 6.6s Time, 0 mProtectedPredicate, 0 mProtectedAction, 19 SdHoareTripleChecker+Valid, 116 SdHoareTripleChecker+Invalid, 58 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 55 IncrementalHoareTripleChecker+Invalid, 1 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 6.6s IncrementalHoareTripleChecker+Time [2022-04-27 13:17:04,647 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [19 Valid, 116 Invalid, 58 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 55 Invalid, 1 Unknown, 0 Unchecked, 6.6s Time] [2022-04-27 13:17:04,648 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 51 states. [2022-04-27 13:17:04,662 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 51 to 50. [2022-04-27 13:17:04,662 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-27 13:17:04,662 INFO L82 GeneralOperation]: Start isEquivalent. First operand 51 states. Second operand has 50 states, 34 states have (on average 1.3823529411764706) internal successors, (47), 35 states have internal predecessors, (47), 11 states have call successors, (11), 5 states have call predecessors, (11), 4 states have return successors, (9), 9 states have call predecessors, (9), 9 states have call successors, (9) [2022-04-27 13:17:04,663 INFO L74 IsIncluded]: Start isIncluded. First operand 51 states. Second operand has 50 states, 34 states have (on average 1.3823529411764706) internal successors, (47), 35 states have internal predecessors, (47), 11 states have call successors, (11), 5 states have call predecessors, (11), 4 states have return successors, (9), 9 states have call predecessors, (9), 9 states have call successors, (9) [2022-04-27 13:17:04,663 INFO L87 Difference]: Start difference. First operand 51 states. Second operand has 50 states, 34 states have (on average 1.3823529411764706) internal successors, (47), 35 states have internal predecessors, (47), 11 states have call successors, (11), 5 states have call predecessors, (11), 4 states have return successors, (9), 9 states have call predecessors, (9), 9 states have call successors, (9) [2022-04-27 13:17:04,666 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-27 13:17:04,666 INFO L93 Difference]: Finished difference Result 51 states and 68 transitions. [2022-04-27 13:17:04,666 INFO L276 IsEmpty]: Start isEmpty. Operand 51 states and 68 transitions. [2022-04-27 13:17:04,667 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-27 13:17:04,667 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-27 13:17:04,667 INFO L74 IsIncluded]: Start isIncluded. First operand has 50 states, 34 states have (on average 1.3823529411764706) internal successors, (47), 35 states have internal predecessors, (47), 11 states have call successors, (11), 5 states have call predecessors, (11), 4 states have return successors, (9), 9 states have call predecessors, (9), 9 states have call successors, (9) Second operand 51 states. [2022-04-27 13:17:04,668 INFO L87 Difference]: Start difference. First operand has 50 states, 34 states have (on average 1.3823529411764706) internal successors, (47), 35 states have internal predecessors, (47), 11 states have call successors, (11), 5 states have call predecessors, (11), 4 states have return successors, (9), 9 states have call predecessors, (9), 9 states have call successors, (9) Second operand 51 states. [2022-04-27 13:17:04,670 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-27 13:17:04,670 INFO L93 Difference]: Finished difference Result 51 states and 68 transitions. [2022-04-27 13:17:04,670 INFO L276 IsEmpty]: Start isEmpty. Operand 51 states and 68 transitions. [2022-04-27 13:17:04,671 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-27 13:17:04,671 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-27 13:17:04,671 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-27 13:17:04,671 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-27 13:17:04,672 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 50 states, 34 states have (on average 1.3823529411764706) internal successors, (47), 35 states have internal predecessors, (47), 11 states have call successors, (11), 5 states have call predecessors, (11), 4 states have return successors, (9), 9 states have call predecessors, (9), 9 states have call successors, (9) [2022-04-27 13:17:04,674 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 50 states to 50 states and 67 transitions. [2022-04-27 13:17:04,674 INFO L78 Accepts]: Start accepts. Automaton has 50 states and 67 transitions. Word has length 23 [2022-04-27 13:17:04,674 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-27 13:17:04,674 INFO L495 AbstractCegarLoop]: Abstraction has 50 states and 67 transitions. [2022-04-27 13:17:04,675 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 2.4) internal successors, (12), 4 states have internal predecessors, (12), 2 states have call successors, (5), 2 states have call predecessors, (5), 1 states have return successors, (3), 1 states have call predecessors, (3), 1 states have call successors, (3) [2022-04-27 13:17:04,675 INFO L276 IsEmpty]: Start isEmpty. Operand 50 states and 67 transitions. [2022-04-27 13:17:04,675 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 30 [2022-04-27 13:17:04,676 INFO L187 NwaCegarLoop]: Found error trace [2022-04-27 13:17:04,676 INFO L195 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-27 13:17:04,701 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Forceful destruction successful, exit code 0 [2022-04-27 13:17:04,876 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2,4 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-27 13:17:04,877 INFO L420 AbstractCegarLoop]: === Iteration 4 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-27 13:17:04,877 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-27 13:17:04,877 INFO L85 PathProgramCache]: Analyzing trace with hash -1676885497, now seen corresponding path program 1 times [2022-04-27 13:17:04,877 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-27 13:17:04,877 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [357179502] [2022-04-27 13:17:04,877 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-27 13:17:04,877 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-27 13:17:04,891 ERROR L245 FreeRefinementEngine]: Caught known exception: Unsupported non-linear arithmetic [2022-04-27 13:17:04,892 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [1016533613] [2022-04-27 13:17:04,892 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-27 13:17:04,892 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-27 13:17:04,892 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-04-27 13:17:04,897 INFO L229 MonitoredProcess]: Starting monitored process 5 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-04-27 13:17:04,898 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Waiting until timeout for monitored process [2022-04-27 13:17:04,955 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-27 13:17:04,957 INFO L263 TraceCheckSpWp]: Trace formula consists of 104 conjuncts, 10 conjunts are in the unsatisfiable core [2022-04-27 13:17:04,970 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-27 13:17:04,971 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-04-27 13:17:05,154 INFO L272 TraceCheckUtils]: 0: Hoare triple {877#true} call ULTIMATE.init(); {877#true} is VALID [2022-04-27 13:17:05,154 INFO L290 TraceCheckUtils]: 1: Hoare triple {877#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; {877#true} is VALID [2022-04-27 13:17:05,154 INFO L290 TraceCheckUtils]: 2: Hoare triple {877#true} assume true; {877#true} is VALID [2022-04-27 13:17:05,154 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {877#true} {877#true} #102#return; {877#true} is VALID [2022-04-27 13:17:05,155 INFO L272 TraceCheckUtils]: 4: Hoare triple {877#true} call #t~ret9 := main(); {877#true} is VALID [2022-04-27 13:17:05,155 INFO L290 TraceCheckUtils]: 5: Hoare triple {877#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; {877#true} is VALID [2022-04-27 13:17:05,155 INFO L272 TraceCheckUtils]: 6: Hoare triple {877#true} call assume_abort_if_not((if (~R~0 - 1) * (~R~0 - 1) < ~A~0 then 1 else 0)); {877#true} is VALID [2022-04-27 13:17:05,156 INFO L290 TraceCheckUtils]: 7: Hoare triple {877#true} ~cond := #in~cond; {877#true} is VALID [2022-04-27 13:17:05,156 INFO L290 TraceCheckUtils]: 8: Hoare triple {877#true} assume !(0 == ~cond); {877#true} is VALID [2022-04-27 13:17:05,156 INFO L290 TraceCheckUtils]: 9: Hoare triple {877#true} assume true; {877#true} is VALID [2022-04-27 13:17:05,156 INFO L284 TraceCheckUtils]: 10: Hoare quadruple {877#true} {877#true} #90#return; {877#true} is VALID [2022-04-27 13:17:05,157 INFO L272 TraceCheckUtils]: 11: Hoare triple {877#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)); {877#true} is VALID [2022-04-27 13:17:05,157 INFO L290 TraceCheckUtils]: 12: Hoare triple {877#true} ~cond := #in~cond; {877#true} is VALID [2022-04-27 13:17:05,157 INFO L290 TraceCheckUtils]: 13: Hoare triple {877#true} assume !(0 == ~cond); {877#true} is VALID [2022-04-27 13:17:05,157 INFO L290 TraceCheckUtils]: 14: Hoare triple {877#true} assume true; {877#true} is VALID [2022-04-27 13:17:05,157 INFO L284 TraceCheckUtils]: 15: Hoare quadruple {877#true} {877#true} #92#return; {877#true} is VALID [2022-04-27 13:17:05,157 INFO L290 TraceCheckUtils]: 16: Hoare triple {877#true} ~u~0 := 1 + 2 * ~R~0;~v~0 := 1;~r~0 := ~R~0 * ~R~0 - ~A~0; {877#true} is VALID [2022-04-27 13:17:05,158 INFO L290 TraceCheckUtils]: 17: Hoare triple {877#true} #t~post6 := ~counter~0;~counter~0 := 1 + #t~post6; {877#true} is VALID [2022-04-27 13:17:05,158 INFO L290 TraceCheckUtils]: 18: Hoare triple {877#true} assume !!(#t~post6 < 5);havoc #t~post6; {877#true} is VALID [2022-04-27 13:17:05,158 INFO L272 TraceCheckUtils]: 19: Hoare triple {877#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)); {877#true} is VALID [2022-04-27 13:17:05,158 INFO L290 TraceCheckUtils]: 20: Hoare triple {877#true} ~cond := #in~cond; {942#(= |__VERIFIER_assert_#in~cond| __VERIFIER_assert_~cond)} is VALID [2022-04-27 13:17:05,159 INFO L290 TraceCheckUtils]: 21: Hoare triple {942#(= |__VERIFIER_assert_#in~cond| __VERIFIER_assert_~cond)} assume !(0 == ~cond); {946#(not (= |__VERIFIER_assert_#in~cond| 0))} is VALID [2022-04-27 13:17:05,159 INFO L290 TraceCheckUtils]: 22: Hoare triple {946#(not (= |__VERIFIER_assert_#in~cond| 0))} assume true; {946#(not (= |__VERIFIER_assert_#in~cond| 0))} is VALID [2022-04-27 13:17:05,160 INFO L284 TraceCheckUtils]: 23: Hoare quadruple {946#(not (= |__VERIFIER_assert_#in~cond| 0))} {877#true} #94#return; {953#(= (+ (* main_~v~0 2) (* main_~u~0 main_~u~0)) (+ (* main_~v~0 main_~v~0) (* main_~u~0 2) (* main_~A~0 4) (* main_~r~0 4)))} is VALID [2022-04-27 13:17:05,161 INFO L290 TraceCheckUtils]: 24: Hoare triple {953#(= (+ (* 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); {957#(= (+ (* main_~v~0 2) (* main_~u~0 main_~u~0)) (+ (* main_~v~0 main_~v~0) (* main_~u~0 2) (* main_~A~0 4)))} is VALID [2022-04-27 13:17:05,162 INFO L272 TraceCheckUtils]: 25: Hoare triple {957#(= (+ (* 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)); {961#(<= 1 |__VERIFIER_assert_#in~cond|)} is VALID [2022-04-27 13:17:05,162 INFO L290 TraceCheckUtils]: 26: Hoare triple {961#(<= 1 |__VERIFIER_assert_#in~cond|)} ~cond := #in~cond; {965#(<= 1 __VERIFIER_assert_~cond)} is VALID [2022-04-27 13:17:05,162 INFO L290 TraceCheckUtils]: 27: Hoare triple {965#(<= 1 __VERIFIER_assert_~cond)} assume 0 == ~cond; {878#false} is VALID [2022-04-27 13:17:05,163 INFO L290 TraceCheckUtils]: 28: Hoare triple {878#false} assume !false; {878#false} is VALID [2022-04-27 13:17:05,163 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 1 proven. 1 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2022-04-27 13:17:05,163 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-04-27 13:17:05,623 INFO L290 TraceCheckUtils]: 28: Hoare triple {878#false} assume !false; {878#false} is VALID [2022-04-27 13:17:05,624 INFO L290 TraceCheckUtils]: 27: Hoare triple {965#(<= 1 __VERIFIER_assert_~cond)} assume 0 == ~cond; {878#false} is VALID [2022-04-27 13:17:05,624 INFO L290 TraceCheckUtils]: 26: Hoare triple {961#(<= 1 |__VERIFIER_assert_#in~cond|)} ~cond := #in~cond; {965#(<= 1 __VERIFIER_assert_~cond)} is VALID [2022-04-27 13:17:05,625 INFO L272 TraceCheckUtils]: 25: Hoare triple {957#(= (+ (* 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)); {961#(<= 1 |__VERIFIER_assert_#in~cond|)} is VALID [2022-04-27 13:17:05,628 INFO L290 TraceCheckUtils]: 24: Hoare triple {984#(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); {957#(= (+ (* main_~v~0 2) (* main_~u~0 main_~u~0)) (+ (* main_~v~0 main_~v~0) (* main_~u~0 2) (* main_~A~0 4)))} is VALID [2022-04-27 13:17:05,629 INFO L284 TraceCheckUtils]: 23: Hoare quadruple {946#(not (= |__VERIFIER_assert_#in~cond| 0))} {877#true} #94#return; {984#(or (not (= main_~r~0 0)) (= (+ (* main_~v~0 2) (* main_~u~0 main_~u~0)) (+ (* main_~v~0 main_~v~0) (* main_~u~0 2) (* main_~A~0 4))))} is VALID [2022-04-27 13:17:05,629 INFO L290 TraceCheckUtils]: 22: Hoare triple {946#(not (= |__VERIFIER_assert_#in~cond| 0))} assume true; {946#(not (= |__VERIFIER_assert_#in~cond| 0))} is VALID [2022-04-27 13:17:05,629 INFO L290 TraceCheckUtils]: 21: Hoare triple {997#(or (not (= |__VERIFIER_assert_#in~cond| 0)) (= __VERIFIER_assert_~cond 0))} assume !(0 == ~cond); {946#(not (= |__VERIFIER_assert_#in~cond| 0))} is VALID [2022-04-27 13:17:05,633 INFO L290 TraceCheckUtils]: 20: Hoare triple {877#true} ~cond := #in~cond; {997#(or (not (= |__VERIFIER_assert_#in~cond| 0)) (= __VERIFIER_assert_~cond 0))} is VALID [2022-04-27 13:17:05,633 INFO L272 TraceCheckUtils]: 19: Hoare triple {877#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)); {877#true} is VALID [2022-04-27 13:17:05,633 INFO L290 TraceCheckUtils]: 18: Hoare triple {877#true} assume !!(#t~post6 < 5);havoc #t~post6; {877#true} is VALID [2022-04-27 13:17:05,633 INFO L290 TraceCheckUtils]: 17: Hoare triple {877#true} #t~post6 := ~counter~0;~counter~0 := 1 + #t~post6; {877#true} is VALID [2022-04-27 13:17:05,633 INFO L290 TraceCheckUtils]: 16: Hoare triple {877#true} ~u~0 := 1 + 2 * ~R~0;~v~0 := 1;~r~0 := ~R~0 * ~R~0 - ~A~0; {877#true} is VALID [2022-04-27 13:17:05,633 INFO L284 TraceCheckUtils]: 15: Hoare quadruple {877#true} {877#true} #92#return; {877#true} is VALID [2022-04-27 13:17:05,634 INFO L290 TraceCheckUtils]: 14: Hoare triple {877#true} assume true; {877#true} is VALID [2022-04-27 13:17:05,634 INFO L290 TraceCheckUtils]: 13: Hoare triple {877#true} assume !(0 == ~cond); {877#true} is VALID [2022-04-27 13:17:05,634 INFO L290 TraceCheckUtils]: 12: Hoare triple {877#true} ~cond := #in~cond; {877#true} is VALID [2022-04-27 13:17:05,635 INFO L272 TraceCheckUtils]: 11: Hoare triple {877#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)); {877#true} is VALID [2022-04-27 13:17:05,635 INFO L284 TraceCheckUtils]: 10: Hoare quadruple {877#true} {877#true} #90#return; {877#true} is VALID [2022-04-27 13:17:05,635 INFO L290 TraceCheckUtils]: 9: Hoare triple {877#true} assume true; {877#true} is VALID [2022-04-27 13:17:05,636 INFO L290 TraceCheckUtils]: 8: Hoare triple {877#true} assume !(0 == ~cond); {877#true} is VALID [2022-04-27 13:17:05,636 INFO L290 TraceCheckUtils]: 7: Hoare triple {877#true} ~cond := #in~cond; {877#true} is VALID [2022-04-27 13:17:05,644 INFO L272 TraceCheckUtils]: 6: Hoare triple {877#true} call assume_abort_if_not((if (~R~0 - 1) * (~R~0 - 1) < ~A~0 then 1 else 0)); {877#true} is VALID [2022-04-27 13:17:05,644 INFO L290 TraceCheckUtils]: 5: Hoare triple {877#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; {877#true} is VALID [2022-04-27 13:17:05,644 INFO L272 TraceCheckUtils]: 4: Hoare triple {877#true} call #t~ret9 := main(); {877#true} is VALID [2022-04-27 13:17:05,645 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {877#true} {877#true} #102#return; {877#true} is VALID [2022-04-27 13:17:05,645 INFO L290 TraceCheckUtils]: 2: Hoare triple {877#true} assume true; {877#true} is VALID [2022-04-27 13:17:05,645 INFO L290 TraceCheckUtils]: 1: Hoare triple {877#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; {877#true} is VALID [2022-04-27 13:17:05,645 INFO L272 TraceCheckUtils]: 0: Hoare triple {877#true} call ULTIMATE.init(); {877#true} is VALID [2022-04-27 13:17:05,645 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 1 proven. 1 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2022-04-27 13:17:05,645 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-27 13:17:05,645 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [357179502] [2022-04-27 13:17:05,645 WARN L310 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2022-04-27 13:17:05,646 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1016533613] [2022-04-27 13:17:05,646 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1016533613] provided 0 perfect and 2 imperfect interpolant sequences [2022-04-27 13:17:05,646 INFO L184 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2022-04-27 13:17:05,646 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [8, 8] total 10 [2022-04-27 13:17:05,646 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [635060960] [2022-04-27 13:17:05,646 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2022-04-27 13:17:05,647 INFO L78 Accepts]: Start accepts. Automaton has has 10 states, 9 states have (on average 2.111111111111111) internal successors, (19), 7 states have internal predecessors, (19), 2 states have call successors, (6), 2 states have call predecessors, (6), 2 states have return successors, (5), 3 states have call predecessors, (5), 1 states have call successors, (5) Word has length 29 [2022-04-27 13:17:05,647 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-27 13:17:05,647 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with has 10 states, 9 states have (on average 2.111111111111111) internal successors, (19), 7 states have internal predecessors, (19), 2 states have call successors, (6), 2 states have call predecessors, (6), 2 states have return successors, (5), 3 states have call predecessors, (5), 1 states have call successors, (5) [2022-04-27 13:17:05,671 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 30 edges. 30 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-27 13:17:05,671 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2022-04-27 13:17:05,671 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-04-27 13:17:05,671 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2022-04-27 13:17:05,672 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=23, Invalid=67, Unknown=0, NotChecked=0, Total=90 [2022-04-27 13:17:05,672 INFO L87 Difference]: Start difference. First operand 50 states and 67 transitions. Second operand has 10 states, 9 states have (on average 2.111111111111111) internal successors, (19), 7 states have internal predecessors, (19), 2 states have call successors, (6), 2 states have call predecessors, (6), 2 states have return successors, (5), 3 states have call predecessors, (5), 1 states have call successors, (5) [2022-04-27 13:17:06,201 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-27 13:17:06,201 INFO L93 Difference]: Finished difference Result 57 states and 73 transitions. [2022-04-27 13:17:06,201 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2022-04-27 13:17:06,202 INFO L78 Accepts]: Start accepts. Automaton has has 10 states, 9 states have (on average 2.111111111111111) internal successors, (19), 7 states have internal predecessors, (19), 2 states have call successors, (6), 2 states have call predecessors, (6), 2 states have return successors, (5), 3 states have call predecessors, (5), 1 states have call successors, (5) Word has length 29 [2022-04-27 13:17:06,202 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-27 13:17:06,202 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 10 states, 9 states have (on average 2.111111111111111) internal successors, (19), 7 states have internal predecessors, (19), 2 states have call successors, (6), 2 states have call predecessors, (6), 2 states have return successors, (5), 3 states have call predecessors, (5), 1 states have call successors, (5) [2022-04-27 13:17:06,205 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8 states to 8 states and 47 transitions. [2022-04-27 13:17:06,205 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 10 states, 9 states have (on average 2.111111111111111) internal successors, (19), 7 states have internal predecessors, (19), 2 states have call successors, (6), 2 states have call predecessors, (6), 2 states have return successors, (5), 3 states have call predecessors, (5), 1 states have call successors, (5) [2022-04-27 13:17:06,206 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8 states to 8 states and 47 transitions. [2022-04-27 13:17:06,206 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 8 states and 47 transitions. [2022-04-27 13:17:06,254 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 47 edges. 47 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-27 13:17:06,256 INFO L225 Difference]: With dead ends: 57 [2022-04-27 13:17:06,256 INFO L226 Difference]: Without dead ends: 52 [2022-04-27 13:17:06,256 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 60 GetRequests, 48 SyntacticMatches, 1 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 10 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=41, Invalid=115, Unknown=0, NotChecked=0, Total=156 [2022-04-27 13:17:06,257 INFO L413 NwaCegarLoop]: 29 mSDtfsCounter, 24 mSDsluCounter, 142 mSDsCounter, 0 mSdLazyCounter, 105 mSolverCounterSat, 8 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 26 SdHoareTripleChecker+Valid, 171 SdHoareTripleChecker+Invalid, 113 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 8 IncrementalHoareTripleChecker+Valid, 105 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2022-04-27 13:17:06,257 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [26 Valid, 171 Invalid, 113 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [8 Valid, 105 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2022-04-27 13:17:06,258 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 52 states. [2022-04-27 13:17:06,269 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 52 to 36. [2022-04-27 13:17:06,269 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-27 13:17:06,270 INFO L82 GeneralOperation]: Start isEquivalent. First operand 52 states. Second operand has 36 states, 24 states have (on average 1.2083333333333333) internal successors, (29), 24 states have internal predecessors, (29), 8 states have call successors, (8), 5 states have call predecessors, (8), 3 states have return successors, (6), 6 states have call predecessors, (6), 6 states have call successors, (6) [2022-04-27 13:17:06,270 INFO L74 IsIncluded]: Start isIncluded. First operand 52 states. Second operand has 36 states, 24 states have (on average 1.2083333333333333) internal successors, (29), 24 states have internal predecessors, (29), 8 states have call successors, (8), 5 states have call predecessors, (8), 3 states have return successors, (6), 6 states have call predecessors, (6), 6 states have call successors, (6) [2022-04-27 13:17:06,270 INFO L87 Difference]: Start difference. First operand 52 states. Second operand has 36 states, 24 states have (on average 1.2083333333333333) internal successors, (29), 24 states have internal predecessors, (29), 8 states have call successors, (8), 5 states have call predecessors, (8), 3 states have return successors, (6), 6 states have call predecessors, (6), 6 states have call successors, (6) [2022-04-27 13:17:06,273 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-27 13:17:06,273 INFO L93 Difference]: Finished difference Result 52 states and 66 transitions. [2022-04-27 13:17:06,273 INFO L276 IsEmpty]: Start isEmpty. Operand 52 states and 66 transitions. [2022-04-27 13:17:06,273 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-27 13:17:06,274 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-27 13:17:06,274 INFO L74 IsIncluded]: Start isIncluded. First operand has 36 states, 24 states have (on average 1.2083333333333333) internal successors, (29), 24 states have internal predecessors, (29), 8 states have call successors, (8), 5 states have call predecessors, (8), 3 states have return successors, (6), 6 states have call predecessors, (6), 6 states have call successors, (6) Second operand 52 states. [2022-04-27 13:17:06,274 INFO L87 Difference]: Start difference. First operand has 36 states, 24 states have (on average 1.2083333333333333) internal successors, (29), 24 states have internal predecessors, (29), 8 states have call successors, (8), 5 states have call predecessors, (8), 3 states have return successors, (6), 6 states have call predecessors, (6), 6 states have call successors, (6) Second operand 52 states. [2022-04-27 13:17:06,276 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-27 13:17:06,277 INFO L93 Difference]: Finished difference Result 52 states and 66 transitions. [2022-04-27 13:17:06,277 INFO L276 IsEmpty]: Start isEmpty. Operand 52 states and 66 transitions. [2022-04-27 13:17:06,277 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-27 13:17:06,277 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-27 13:17:06,277 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-27 13:17:06,278 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-27 13:17:06,278 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 36 states, 24 states have (on average 1.2083333333333333) internal successors, (29), 24 states have internal predecessors, (29), 8 states have call successors, (8), 5 states have call predecessors, (8), 3 states have return successors, (6), 6 states have call predecessors, (6), 6 states have call successors, (6) [2022-04-27 13:17:06,279 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 36 states to 36 states and 43 transitions. [2022-04-27 13:17:06,279 INFO L78 Accepts]: Start accepts. Automaton has 36 states and 43 transitions. Word has length 29 [2022-04-27 13:17:06,280 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-27 13:17:06,280 INFO L495 AbstractCegarLoop]: Abstraction has 36 states and 43 transitions. [2022-04-27 13:17:06,280 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 9 states have (on average 2.111111111111111) internal successors, (19), 7 states have internal predecessors, (19), 2 states have call successors, (6), 2 states have call predecessors, (6), 2 states have return successors, (5), 3 states have call predecessors, (5), 1 states have call successors, (5) [2022-04-27 13:17:06,280 INFO L276 IsEmpty]: Start isEmpty. Operand 36 states and 43 transitions. [2022-04-27 13:17:06,281 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 36 [2022-04-27 13:17:06,281 INFO L187 NwaCegarLoop]: Found error trace [2022-04-27 13:17:06,281 INFO L195 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-27 13:17:06,309 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Forceful destruction successful, exit code 0 [2022-04-27 13:17:06,504 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3,5 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-27 13:17:06,504 INFO L420 AbstractCegarLoop]: === Iteration 5 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-27 13:17:06,504 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-27 13:17:06,504 INFO L85 PathProgramCache]: Analyzing trace with hash 1154059858, now seen corresponding path program 1 times [2022-04-27 13:17:06,504 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-27 13:17:06,504 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1043344311] [2022-04-27 13:17:06,505 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-27 13:17:06,505 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-27 13:17:06,522 ERROR L245 FreeRefinementEngine]: Caught known exception: Unsupported non-linear arithmetic [2022-04-27 13:17:06,522 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [81867384] [2022-04-27 13:17:06,522 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-27 13:17:06,523 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-27 13:17:06,523 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-04-27 13:17:06,527 INFO L229 MonitoredProcess]: Starting monitored process 6 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-04-27 13:17:06,545 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (6)] Waiting until timeout for monitored process [2022-04-27 13:17:06,583 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-27 13:17:06,584 INFO L263 TraceCheckSpWp]: Trace formula consists of 118 conjuncts, 7 conjunts are in the unsatisfiable core [2022-04-27 13:17:06,600 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-27 13:17:06,601 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-04-27 13:17:06,795 INFO L272 TraceCheckUtils]: 0: Hoare triple {1302#true} call ULTIMATE.init(); {1302#true} is VALID [2022-04-27 13:17:06,796 INFO L290 TraceCheckUtils]: 1: Hoare triple {1302#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; {1310#(<= ~counter~0 0)} is VALID [2022-04-27 13:17:06,796 INFO L290 TraceCheckUtils]: 2: Hoare triple {1310#(<= ~counter~0 0)} assume true; {1310#(<= ~counter~0 0)} is VALID [2022-04-27 13:17:06,797 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {1310#(<= ~counter~0 0)} {1302#true} #102#return; {1310#(<= ~counter~0 0)} is VALID [2022-04-27 13:17:06,798 INFO L272 TraceCheckUtils]: 4: Hoare triple {1310#(<= ~counter~0 0)} call #t~ret9 := main(); {1310#(<= ~counter~0 0)} is VALID [2022-04-27 13:17:06,798 INFO L290 TraceCheckUtils]: 5: Hoare triple {1310#(<= ~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; {1310#(<= ~counter~0 0)} is VALID [2022-04-27 13:17:06,799 INFO L272 TraceCheckUtils]: 6: Hoare triple {1310#(<= ~counter~0 0)} call assume_abort_if_not((if (~R~0 - 1) * (~R~0 - 1) < ~A~0 then 1 else 0)); {1310#(<= ~counter~0 0)} is VALID [2022-04-27 13:17:06,799 INFO L290 TraceCheckUtils]: 7: Hoare triple {1310#(<= ~counter~0 0)} ~cond := #in~cond; {1310#(<= ~counter~0 0)} is VALID [2022-04-27 13:17:06,799 INFO L290 TraceCheckUtils]: 8: Hoare triple {1310#(<= ~counter~0 0)} assume !(0 == ~cond); {1310#(<= ~counter~0 0)} is VALID [2022-04-27 13:17:06,800 INFO L290 TraceCheckUtils]: 9: Hoare triple {1310#(<= ~counter~0 0)} assume true; {1310#(<= ~counter~0 0)} is VALID [2022-04-27 13:17:06,800 INFO L284 TraceCheckUtils]: 10: Hoare quadruple {1310#(<= ~counter~0 0)} {1310#(<= ~counter~0 0)} #90#return; {1310#(<= ~counter~0 0)} is VALID [2022-04-27 13:17:06,801 INFO L272 TraceCheckUtils]: 11: Hoare triple {1310#(<= ~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)); {1310#(<= ~counter~0 0)} is VALID [2022-04-27 13:17:06,801 INFO L290 TraceCheckUtils]: 12: Hoare triple {1310#(<= ~counter~0 0)} ~cond := #in~cond; {1310#(<= ~counter~0 0)} is VALID [2022-04-27 13:17:06,802 INFO L290 TraceCheckUtils]: 13: Hoare triple {1310#(<= ~counter~0 0)} assume !(0 == ~cond); {1310#(<= ~counter~0 0)} is VALID [2022-04-27 13:17:06,802 INFO L290 TraceCheckUtils]: 14: Hoare triple {1310#(<= ~counter~0 0)} assume true; {1310#(<= ~counter~0 0)} is VALID [2022-04-27 13:17:06,803 INFO L284 TraceCheckUtils]: 15: Hoare quadruple {1310#(<= ~counter~0 0)} {1310#(<= ~counter~0 0)} #92#return; {1310#(<= ~counter~0 0)} is VALID [2022-04-27 13:17:06,803 INFO L290 TraceCheckUtils]: 16: Hoare triple {1310#(<= ~counter~0 0)} ~u~0 := 1 + 2 * ~R~0;~v~0 := 1;~r~0 := ~R~0 * ~R~0 - ~A~0; {1310#(<= ~counter~0 0)} is VALID [2022-04-27 13:17:06,804 INFO L290 TraceCheckUtils]: 17: Hoare triple {1310#(<= ~counter~0 0)} #t~post6 := ~counter~0;~counter~0 := 1 + #t~post6; {1359#(<= ~counter~0 1)} is VALID [2022-04-27 13:17:06,804 INFO L290 TraceCheckUtils]: 18: Hoare triple {1359#(<= ~counter~0 1)} assume !!(#t~post6 < 5);havoc #t~post6; {1359#(<= ~counter~0 1)} is VALID [2022-04-27 13:17:06,805 INFO L272 TraceCheckUtils]: 19: Hoare triple {1359#(<= ~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)); {1359#(<= ~counter~0 1)} is VALID [2022-04-27 13:17:06,805 INFO L290 TraceCheckUtils]: 20: Hoare triple {1359#(<= ~counter~0 1)} ~cond := #in~cond; {1359#(<= ~counter~0 1)} is VALID [2022-04-27 13:17:06,806 INFO L290 TraceCheckUtils]: 21: Hoare triple {1359#(<= ~counter~0 1)} assume !(0 == ~cond); {1359#(<= ~counter~0 1)} is VALID [2022-04-27 13:17:06,806 INFO L290 TraceCheckUtils]: 22: Hoare triple {1359#(<= ~counter~0 1)} assume true; {1359#(<= ~counter~0 1)} is VALID [2022-04-27 13:17:06,807 INFO L284 TraceCheckUtils]: 23: Hoare quadruple {1359#(<= ~counter~0 1)} {1359#(<= ~counter~0 1)} #94#return; {1359#(<= ~counter~0 1)} is VALID [2022-04-27 13:17:06,807 INFO L290 TraceCheckUtils]: 24: Hoare triple {1359#(<= ~counter~0 1)} assume !!(0 != ~r~0); {1359#(<= ~counter~0 1)} is VALID [2022-04-27 13:17:06,808 INFO L290 TraceCheckUtils]: 25: Hoare triple {1359#(<= ~counter~0 1)} #t~post7 := ~counter~0;~counter~0 := 1 + #t~post7; {1384#(<= |main_#t~post7| 1)} is VALID [2022-04-27 13:17:06,808 INFO L290 TraceCheckUtils]: 26: Hoare triple {1384#(<= |main_#t~post7| 1)} assume !(#t~post7 < 5);havoc #t~post7; {1303#false} is VALID [2022-04-27 13:17:06,809 INFO L290 TraceCheckUtils]: 27: Hoare triple {1303#false} #t~post8 := ~counter~0;~counter~0 := 1 + #t~post8; {1303#false} is VALID [2022-04-27 13:17:06,809 INFO L290 TraceCheckUtils]: 28: Hoare triple {1303#false} assume !(#t~post8 < 5);havoc #t~post8; {1303#false} is VALID [2022-04-27 13:17:06,809 INFO L290 TraceCheckUtils]: 29: Hoare triple {1303#false} #t~post6 := ~counter~0;~counter~0 := 1 + #t~post6; {1303#false} is VALID [2022-04-27 13:17:06,809 INFO L290 TraceCheckUtils]: 30: Hoare triple {1303#false} assume !(#t~post6 < 5);havoc #t~post6; {1303#false} is VALID [2022-04-27 13:17:06,809 INFO L272 TraceCheckUtils]: 31: Hoare triple {1303#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)); {1303#false} is VALID [2022-04-27 13:17:06,809 INFO L290 TraceCheckUtils]: 32: Hoare triple {1303#false} ~cond := #in~cond; {1303#false} is VALID [2022-04-27 13:17:06,809 INFO L290 TraceCheckUtils]: 33: Hoare triple {1303#false} assume 0 == ~cond; {1303#false} is VALID [2022-04-27 13:17:06,809 INFO L290 TraceCheckUtils]: 34: Hoare triple {1303#false} assume !false; {1303#false} is VALID [2022-04-27 13:17:06,810 INFO L134 CoverageAnalysis]: Checked inductivity of 8 backedges. 4 proven. 0 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2022-04-27 13:17:06,810 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-04-27 13:17:06,810 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-27 13:17:06,810 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1043344311] [2022-04-27 13:17:06,810 WARN L310 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2022-04-27 13:17:06,810 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [81867384] [2022-04-27 13:17:06,810 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [81867384] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-27 13:17:06,810 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-27 13:17:06,810 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2022-04-27 13:17:06,810 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2047040573] [2022-04-27 13:17:06,811 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-27 13:17:06,811 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 4.4) internal successors, (22), 4 states have internal predecessors, (22), 4 states have call successors, (6), 4 states have call predecessors, (6), 2 states have return successors, (4), 2 states have call predecessors, (4), 3 states have call successors, (4) Word has length 35 [2022-04-27 13:17:06,811 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-27 13:17:06,815 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with has 5 states, 5 states have (on average 4.4) internal successors, (22), 4 states have internal predecessors, (22), 4 states have call successors, (6), 4 states have call predecessors, (6), 2 states have return successors, (4), 2 states have call predecessors, (4), 3 states have call successors, (4) [2022-04-27 13:17:06,838 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 32 edges. 32 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-27 13:17:06,838 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-04-27 13:17:06,838 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-04-27 13:17:06,838 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-04-27 13:17:06,839 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2022-04-27 13:17:06,839 INFO L87 Difference]: Start difference. First operand 36 states and 43 transitions. Second operand has 5 states, 5 states have (on average 4.4) internal successors, (22), 4 states have internal predecessors, (22), 4 states have call successors, (6), 4 states have call predecessors, (6), 2 states have return successors, (4), 2 states have call predecessors, (4), 3 states have call successors, (4) [2022-04-27 13:17:06,967 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-27 13:17:06,967 INFO L93 Difference]: Finished difference Result 65 states and 79 transitions. [2022-04-27 13:17:06,967 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-04-27 13:17:06,967 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 4.4) internal successors, (22), 4 states have internal predecessors, (22), 4 states have call successors, (6), 4 states have call predecessors, (6), 2 states have return successors, (4), 2 states have call predecessors, (4), 3 states have call successors, (4) Word has length 35 [2022-04-27 13:17:06,967 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-27 13:17:06,968 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 5 states, 5 states have (on average 4.4) internal successors, (22), 4 states have internal predecessors, (22), 4 states have call successors, (6), 4 states have call predecessors, (6), 2 states have return successors, (4), 2 states have call predecessors, (4), 3 states have call successors, (4) [2022-04-27 13:17:06,969 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 77 transitions. [2022-04-27 13:17:06,970 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 5 states, 5 states have (on average 4.4) internal successors, (22), 4 states have internal predecessors, (22), 4 states have call successors, (6), 4 states have call predecessors, (6), 2 states have return successors, (4), 2 states have call predecessors, (4), 3 states have call successors, (4) [2022-04-27 13:17:06,971 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 77 transitions. [2022-04-27 13:17:06,971 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 5 states and 77 transitions. [2022-04-27 13:17:07,037 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 77 edges. 77 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-27 13:17:07,038 INFO L225 Difference]: With dead ends: 65 [2022-04-27 13:17:07,038 INFO L226 Difference]: Without dead ends: 44 [2022-04-27 13:17:07,038 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 34 GetRequests, 31 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2022-04-27 13:17:07,039 INFO L413 NwaCegarLoop]: 38 mSDtfsCounter, 6 mSDsluCounter, 82 mSDsCounter, 0 mSdLazyCounter, 17 mSolverCounterSat, 7 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 6 SdHoareTripleChecker+Valid, 120 SdHoareTripleChecker+Invalid, 24 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 7 IncrementalHoareTripleChecker+Valid, 17 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-04-27 13:17:07,040 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [6 Valid, 120 Invalid, 24 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [7 Valid, 17 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-04-27 13:17:07,040 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 44 states. [2022-04-27 13:17:07,053 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 44 to 44. [2022-04-27 13:17:07,053 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-27 13:17:07,053 INFO L82 GeneralOperation]: Start isEquivalent. First operand 44 states. Second operand has 44 states, 30 states have (on average 1.1666666666666667) internal successors, (35), 30 states have internal predecessors, (35), 9 states have call successors, (9), 6 states have call predecessors, (9), 4 states have return successors, (7), 7 states have call predecessors, (7), 7 states have call successors, (7) [2022-04-27 13:17:07,053 INFO L74 IsIncluded]: Start isIncluded. First operand 44 states. Second operand has 44 states, 30 states have (on average 1.1666666666666667) internal successors, (35), 30 states have internal predecessors, (35), 9 states have call successors, (9), 6 states have call predecessors, (9), 4 states have return successors, (7), 7 states have call predecessors, (7), 7 states have call successors, (7) [2022-04-27 13:17:07,054 INFO L87 Difference]: Start difference. First operand 44 states. Second operand has 44 states, 30 states have (on average 1.1666666666666667) internal successors, (35), 30 states have internal predecessors, (35), 9 states have call successors, (9), 6 states have call predecessors, (9), 4 states have return successors, (7), 7 states have call predecessors, (7), 7 states have call successors, (7) [2022-04-27 13:17:07,056 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-27 13:17:07,056 INFO L93 Difference]: Finished difference Result 44 states and 51 transitions. [2022-04-27 13:17:07,056 INFO L276 IsEmpty]: Start isEmpty. Operand 44 states and 51 transitions. [2022-04-27 13:17:07,056 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-27 13:17:07,056 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-27 13:17:07,057 INFO L74 IsIncluded]: Start isIncluded. First operand has 44 states, 30 states have (on average 1.1666666666666667) internal successors, (35), 30 states have internal predecessors, (35), 9 states have call successors, (9), 6 states have call predecessors, (9), 4 states have return successors, (7), 7 states have call predecessors, (7), 7 states have call successors, (7) Second operand 44 states. [2022-04-27 13:17:07,057 INFO L87 Difference]: Start difference. First operand has 44 states, 30 states have (on average 1.1666666666666667) internal successors, (35), 30 states have internal predecessors, (35), 9 states have call successors, (9), 6 states have call predecessors, (9), 4 states have return successors, (7), 7 states have call predecessors, (7), 7 states have call successors, (7) Second operand 44 states. [2022-04-27 13:17:07,059 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-27 13:17:07,059 INFO L93 Difference]: Finished difference Result 44 states and 51 transitions. [2022-04-27 13:17:07,059 INFO L276 IsEmpty]: Start isEmpty. Operand 44 states and 51 transitions. [2022-04-27 13:17:07,059 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-27 13:17:07,059 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-27 13:17:07,059 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-27 13:17:07,059 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-27 13:17:07,060 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 44 states, 30 states have (on average 1.1666666666666667) internal successors, (35), 30 states have internal predecessors, (35), 9 states have call successors, (9), 6 states have call predecessors, (9), 4 states have return successors, (7), 7 states have call predecessors, (7), 7 states have call successors, (7) [2022-04-27 13:17:07,061 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 44 states to 44 states and 51 transitions. [2022-04-27 13:17:07,061 INFO L78 Accepts]: Start accepts. Automaton has 44 states and 51 transitions. Word has length 35 [2022-04-27 13:17:07,061 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-27 13:17:07,061 INFO L495 AbstractCegarLoop]: Abstraction has 44 states and 51 transitions. [2022-04-27 13:17:07,062 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 4.4) internal successors, (22), 4 states have internal predecessors, (22), 4 states have call successors, (6), 4 states have call predecessors, (6), 2 states have return successors, (4), 2 states have call predecessors, (4), 3 states have call successors, (4) [2022-04-27 13:17:07,062 INFO L276 IsEmpty]: Start isEmpty. Operand 44 states and 51 transitions. [2022-04-27 13:17:07,062 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 42 [2022-04-27 13:17:07,062 INFO L187 NwaCegarLoop]: Found error trace [2022-04-27 13:17:07,063 INFO L195 NwaCegarLoop]: trace histogram [3, 2, 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, 1, 1, 1, 1] [2022-04-27 13:17:07,089 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-27 13:17:07,283 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4,6 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-27 13:17:07,283 INFO L420 AbstractCegarLoop]: === Iteration 6 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-27 13:17:07,284 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-27 13:17:07,284 INFO L85 PathProgramCache]: Analyzing trace with hash -174895632, now seen corresponding path program 1 times [2022-04-27 13:17:07,284 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-27 13:17:07,284 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1679361098] [2022-04-27 13:17:07,284 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-27 13:17:07,284 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-27 13:17:07,304 ERROR L245 FreeRefinementEngine]: Caught known exception: Unsupported non-linear arithmetic [2022-04-27 13:17:07,304 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [1422843932] [2022-04-27 13:17:07,304 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-27 13:17:07,304 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-27 13:17:07,304 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-04-27 13:17:07,309 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-27 13:17:07,310 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-27 13:17:07,360 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-27 13:17:07,361 INFO L263 TraceCheckSpWp]: Trace formula consists of 128 conjuncts, 9 conjunts are in the unsatisfiable core [2022-04-27 13:17:07,372 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-27 13:17:07,373 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-04-27 13:17:07,636 INFO L272 TraceCheckUtils]: 0: Hoare triple {1654#true} call ULTIMATE.init(); {1654#true} is VALID [2022-04-27 13:17:07,637 INFO L290 TraceCheckUtils]: 1: Hoare triple {1654#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; {1662#(<= ~counter~0 0)} is VALID [2022-04-27 13:17:07,637 INFO L290 TraceCheckUtils]: 2: Hoare triple {1662#(<= ~counter~0 0)} assume true; {1662#(<= ~counter~0 0)} is VALID [2022-04-27 13:17:07,638 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {1662#(<= ~counter~0 0)} {1654#true} #102#return; {1662#(<= ~counter~0 0)} is VALID [2022-04-27 13:17:07,638 INFO L272 TraceCheckUtils]: 4: Hoare triple {1662#(<= ~counter~0 0)} call #t~ret9 := main(); {1662#(<= ~counter~0 0)} is VALID [2022-04-27 13:17:07,639 INFO L290 TraceCheckUtils]: 5: Hoare triple {1662#(<= ~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; {1662#(<= ~counter~0 0)} is VALID [2022-04-27 13:17:07,639 INFO L272 TraceCheckUtils]: 6: Hoare triple {1662#(<= ~counter~0 0)} call assume_abort_if_not((if (~R~0 - 1) * (~R~0 - 1) < ~A~0 then 1 else 0)); {1662#(<= ~counter~0 0)} is VALID [2022-04-27 13:17:07,639 INFO L290 TraceCheckUtils]: 7: Hoare triple {1662#(<= ~counter~0 0)} ~cond := #in~cond; {1662#(<= ~counter~0 0)} is VALID [2022-04-27 13:17:07,640 INFO L290 TraceCheckUtils]: 8: Hoare triple {1662#(<= ~counter~0 0)} assume !(0 == ~cond); {1662#(<= ~counter~0 0)} is VALID [2022-04-27 13:17:07,640 INFO L290 TraceCheckUtils]: 9: Hoare triple {1662#(<= ~counter~0 0)} assume true; {1662#(<= ~counter~0 0)} is VALID [2022-04-27 13:17:07,641 INFO L284 TraceCheckUtils]: 10: Hoare quadruple {1662#(<= ~counter~0 0)} {1662#(<= ~counter~0 0)} #90#return; {1662#(<= ~counter~0 0)} is VALID [2022-04-27 13:17:07,641 INFO L272 TraceCheckUtils]: 11: Hoare triple {1662#(<= ~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)); {1662#(<= ~counter~0 0)} is VALID [2022-04-27 13:17:07,641 INFO L290 TraceCheckUtils]: 12: Hoare triple {1662#(<= ~counter~0 0)} ~cond := #in~cond; {1662#(<= ~counter~0 0)} is VALID [2022-04-27 13:17:07,642 INFO L290 TraceCheckUtils]: 13: Hoare triple {1662#(<= ~counter~0 0)} assume !(0 == ~cond); {1662#(<= ~counter~0 0)} is VALID [2022-04-27 13:17:07,642 INFO L290 TraceCheckUtils]: 14: Hoare triple {1662#(<= ~counter~0 0)} assume true; {1662#(<= ~counter~0 0)} is VALID [2022-04-27 13:17:07,642 INFO L284 TraceCheckUtils]: 15: Hoare quadruple {1662#(<= ~counter~0 0)} {1662#(<= ~counter~0 0)} #92#return; {1662#(<= ~counter~0 0)} is VALID [2022-04-27 13:17:07,643 INFO L290 TraceCheckUtils]: 16: Hoare triple {1662#(<= ~counter~0 0)} ~u~0 := 1 + 2 * ~R~0;~v~0 := 1;~r~0 := ~R~0 * ~R~0 - ~A~0; {1662#(<= ~counter~0 0)} is VALID [2022-04-27 13:17:07,643 INFO L290 TraceCheckUtils]: 17: Hoare triple {1662#(<= ~counter~0 0)} #t~post6 := ~counter~0;~counter~0 := 1 + #t~post6; {1711#(<= ~counter~0 1)} is VALID [2022-04-27 13:17:07,644 INFO L290 TraceCheckUtils]: 18: Hoare triple {1711#(<= ~counter~0 1)} assume !!(#t~post6 < 5);havoc #t~post6; {1711#(<= ~counter~0 1)} is VALID [2022-04-27 13:17:07,645 INFO L272 TraceCheckUtils]: 19: Hoare triple {1711#(<= ~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)); {1711#(<= ~counter~0 1)} is VALID [2022-04-27 13:17:07,645 INFO L290 TraceCheckUtils]: 20: Hoare triple {1711#(<= ~counter~0 1)} ~cond := #in~cond; {1711#(<= ~counter~0 1)} is VALID [2022-04-27 13:17:07,646 INFO L290 TraceCheckUtils]: 21: Hoare triple {1711#(<= ~counter~0 1)} assume !(0 == ~cond); {1711#(<= ~counter~0 1)} is VALID [2022-04-27 13:17:07,646 INFO L290 TraceCheckUtils]: 22: Hoare triple {1711#(<= ~counter~0 1)} assume true; {1711#(<= ~counter~0 1)} is VALID [2022-04-27 13:17:07,650 INFO L284 TraceCheckUtils]: 23: Hoare quadruple {1711#(<= ~counter~0 1)} {1711#(<= ~counter~0 1)} #94#return; {1711#(<= ~counter~0 1)} is VALID [2022-04-27 13:17:07,650 INFO L290 TraceCheckUtils]: 24: Hoare triple {1711#(<= ~counter~0 1)} assume !!(0 != ~r~0); {1711#(<= ~counter~0 1)} is VALID [2022-04-27 13:17:07,651 INFO L290 TraceCheckUtils]: 25: Hoare triple {1711#(<= ~counter~0 1)} #t~post7 := ~counter~0;~counter~0 := 1 + #t~post7; {1736#(<= ~counter~0 2)} is VALID [2022-04-27 13:17:07,651 INFO L290 TraceCheckUtils]: 26: Hoare triple {1736#(<= ~counter~0 2)} assume !!(#t~post7 < 5);havoc #t~post7; {1736#(<= ~counter~0 2)} is VALID [2022-04-27 13:17:07,652 INFO L272 TraceCheckUtils]: 27: Hoare triple {1736#(<= ~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)); {1736#(<= ~counter~0 2)} is VALID [2022-04-27 13:17:07,652 INFO L290 TraceCheckUtils]: 28: Hoare triple {1736#(<= ~counter~0 2)} ~cond := #in~cond; {1736#(<= ~counter~0 2)} is VALID [2022-04-27 13:17:07,653 INFO L290 TraceCheckUtils]: 29: Hoare triple {1736#(<= ~counter~0 2)} assume !(0 == ~cond); {1736#(<= ~counter~0 2)} is VALID [2022-04-27 13:17:07,653 INFO L290 TraceCheckUtils]: 30: Hoare triple {1736#(<= ~counter~0 2)} assume true; {1736#(<= ~counter~0 2)} is VALID [2022-04-27 13:17:07,654 INFO L284 TraceCheckUtils]: 31: Hoare quadruple {1736#(<= ~counter~0 2)} {1736#(<= ~counter~0 2)} #96#return; {1736#(<= ~counter~0 2)} is VALID [2022-04-27 13:17:07,654 INFO L290 TraceCheckUtils]: 32: Hoare triple {1736#(<= ~counter~0 2)} assume !(~r~0 > 0); {1736#(<= ~counter~0 2)} is VALID [2022-04-27 13:17:07,654 INFO L290 TraceCheckUtils]: 33: Hoare triple {1736#(<= ~counter~0 2)} #t~post8 := ~counter~0;~counter~0 := 1 + #t~post8; {1761#(<= |main_#t~post8| 2)} is VALID [2022-04-27 13:17:07,655 INFO L290 TraceCheckUtils]: 34: Hoare triple {1761#(<= |main_#t~post8| 2)} assume !(#t~post8 < 5);havoc #t~post8; {1655#false} is VALID [2022-04-27 13:17:07,655 INFO L290 TraceCheckUtils]: 35: Hoare triple {1655#false} #t~post6 := ~counter~0;~counter~0 := 1 + #t~post6; {1655#false} is VALID [2022-04-27 13:17:07,655 INFO L290 TraceCheckUtils]: 36: Hoare triple {1655#false} assume !(#t~post6 < 5);havoc #t~post6; {1655#false} is VALID [2022-04-27 13:17:07,659 INFO L272 TraceCheckUtils]: 37: Hoare triple {1655#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)); {1655#false} is VALID [2022-04-27 13:17:07,660 INFO L290 TraceCheckUtils]: 38: Hoare triple {1655#false} ~cond := #in~cond; {1655#false} is VALID [2022-04-27 13:17:07,660 INFO L290 TraceCheckUtils]: 39: Hoare triple {1655#false} assume 0 == ~cond; {1655#false} is VALID [2022-04-27 13:17:07,660 INFO L290 TraceCheckUtils]: 40: Hoare triple {1655#false} assume !false; {1655#false} is VALID [2022-04-27 13:17:07,660 INFO L134 CoverageAnalysis]: Checked inductivity of 14 backedges. 6 proven. 4 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2022-04-27 13:17:07,660 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-04-27 13:17:07,874 INFO L290 TraceCheckUtils]: 40: Hoare triple {1655#false} assume !false; {1655#false} is VALID [2022-04-27 13:17:07,875 INFO L290 TraceCheckUtils]: 39: Hoare triple {1655#false} assume 0 == ~cond; {1655#false} is VALID [2022-04-27 13:17:07,875 INFO L290 TraceCheckUtils]: 38: Hoare triple {1655#false} ~cond := #in~cond; {1655#false} is VALID [2022-04-27 13:17:07,875 INFO L272 TraceCheckUtils]: 37: Hoare triple {1655#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)); {1655#false} is VALID [2022-04-27 13:17:07,875 INFO L290 TraceCheckUtils]: 36: Hoare triple {1655#false} assume !(#t~post6 < 5);havoc #t~post6; {1655#false} is VALID [2022-04-27 13:17:07,875 INFO L290 TraceCheckUtils]: 35: Hoare triple {1655#false} #t~post6 := ~counter~0;~counter~0 := 1 + #t~post6; {1655#false} is VALID [2022-04-27 13:17:07,883 INFO L290 TraceCheckUtils]: 34: Hoare triple {1801#(< |main_#t~post8| 5)} assume !(#t~post8 < 5);havoc #t~post8; {1655#false} is VALID [2022-04-27 13:17:07,884 INFO L290 TraceCheckUtils]: 33: Hoare triple {1805#(< ~counter~0 5)} #t~post8 := ~counter~0;~counter~0 := 1 + #t~post8; {1801#(< |main_#t~post8| 5)} is VALID [2022-04-27 13:17:07,884 INFO L290 TraceCheckUtils]: 32: Hoare triple {1805#(< ~counter~0 5)} assume !(~r~0 > 0); {1805#(< ~counter~0 5)} is VALID [2022-04-27 13:17:07,885 INFO L284 TraceCheckUtils]: 31: Hoare quadruple {1654#true} {1805#(< ~counter~0 5)} #96#return; {1805#(< ~counter~0 5)} is VALID [2022-04-27 13:17:07,885 INFO L290 TraceCheckUtils]: 30: Hoare triple {1654#true} assume true; {1654#true} is VALID [2022-04-27 13:17:07,885 INFO L290 TraceCheckUtils]: 29: Hoare triple {1654#true} assume !(0 == ~cond); {1654#true} is VALID [2022-04-27 13:17:07,886 INFO L290 TraceCheckUtils]: 28: Hoare triple {1654#true} ~cond := #in~cond; {1654#true} is VALID [2022-04-27 13:17:07,886 INFO L272 TraceCheckUtils]: 27: Hoare triple {1805#(< ~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)); {1654#true} is VALID [2022-04-27 13:17:07,886 INFO L290 TraceCheckUtils]: 26: Hoare triple {1805#(< ~counter~0 5)} assume !!(#t~post7 < 5);havoc #t~post7; {1805#(< ~counter~0 5)} is VALID [2022-04-27 13:17:07,887 INFO L290 TraceCheckUtils]: 25: Hoare triple {1830#(< ~counter~0 4)} #t~post7 := ~counter~0;~counter~0 := 1 + #t~post7; {1805#(< ~counter~0 5)} is VALID [2022-04-27 13:17:07,887 INFO L290 TraceCheckUtils]: 24: Hoare triple {1830#(< ~counter~0 4)} assume !!(0 != ~r~0); {1830#(< ~counter~0 4)} is VALID [2022-04-27 13:17:07,888 INFO L284 TraceCheckUtils]: 23: Hoare quadruple {1654#true} {1830#(< ~counter~0 4)} #94#return; {1830#(< ~counter~0 4)} is VALID [2022-04-27 13:17:07,888 INFO L290 TraceCheckUtils]: 22: Hoare triple {1654#true} assume true; {1654#true} is VALID [2022-04-27 13:17:07,888 INFO L290 TraceCheckUtils]: 21: Hoare triple {1654#true} assume !(0 == ~cond); {1654#true} is VALID [2022-04-27 13:17:07,888 INFO L290 TraceCheckUtils]: 20: Hoare triple {1654#true} ~cond := #in~cond; {1654#true} is VALID [2022-04-27 13:17:07,888 INFO L272 TraceCheckUtils]: 19: Hoare triple {1830#(< ~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)); {1654#true} is VALID [2022-04-27 13:17:07,889 INFO L290 TraceCheckUtils]: 18: Hoare triple {1830#(< ~counter~0 4)} assume !!(#t~post6 < 5);havoc #t~post6; {1830#(< ~counter~0 4)} is VALID [2022-04-27 13:17:07,889 INFO L290 TraceCheckUtils]: 17: Hoare triple {1736#(<= ~counter~0 2)} #t~post6 := ~counter~0;~counter~0 := 1 + #t~post6; {1830#(< ~counter~0 4)} is VALID [2022-04-27 13:17:07,890 INFO L290 TraceCheckUtils]: 16: Hoare triple {1736#(<= ~counter~0 2)} ~u~0 := 1 + 2 * ~R~0;~v~0 := 1;~r~0 := ~R~0 * ~R~0 - ~A~0; {1736#(<= ~counter~0 2)} is VALID [2022-04-27 13:17:07,890 INFO L284 TraceCheckUtils]: 15: Hoare quadruple {1654#true} {1736#(<= ~counter~0 2)} #92#return; {1736#(<= ~counter~0 2)} is VALID [2022-04-27 13:17:07,890 INFO L290 TraceCheckUtils]: 14: Hoare triple {1654#true} assume true; {1654#true} is VALID [2022-04-27 13:17:07,891 INFO L290 TraceCheckUtils]: 13: Hoare triple {1654#true} assume !(0 == ~cond); {1654#true} is VALID [2022-04-27 13:17:07,891 INFO L290 TraceCheckUtils]: 12: Hoare triple {1654#true} ~cond := #in~cond; {1654#true} is VALID [2022-04-27 13:17:07,891 INFO L272 TraceCheckUtils]: 11: Hoare triple {1736#(<= ~counter~0 2)} 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)); {1654#true} is VALID [2022-04-27 13:17:07,892 INFO L284 TraceCheckUtils]: 10: Hoare quadruple {1654#true} {1736#(<= ~counter~0 2)} #90#return; {1736#(<= ~counter~0 2)} is VALID [2022-04-27 13:17:07,892 INFO L290 TraceCheckUtils]: 9: Hoare triple {1654#true} assume true; {1654#true} is VALID [2022-04-27 13:17:07,892 INFO L290 TraceCheckUtils]: 8: Hoare triple {1654#true} assume !(0 == ~cond); {1654#true} is VALID [2022-04-27 13:17:07,892 INFO L290 TraceCheckUtils]: 7: Hoare triple {1654#true} ~cond := #in~cond; {1654#true} is VALID [2022-04-27 13:17:07,892 INFO L272 TraceCheckUtils]: 6: Hoare triple {1736#(<= ~counter~0 2)} call assume_abort_if_not((if (~R~0 - 1) * (~R~0 - 1) < ~A~0 then 1 else 0)); {1654#true} is VALID [2022-04-27 13:17:07,893 INFO L290 TraceCheckUtils]: 5: Hoare triple {1736#(<= ~counter~0 2)} 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; {1736#(<= ~counter~0 2)} is VALID [2022-04-27 13:17:07,893 INFO L272 TraceCheckUtils]: 4: Hoare triple {1736#(<= ~counter~0 2)} call #t~ret9 := main(); {1736#(<= ~counter~0 2)} is VALID [2022-04-27 13:17:07,894 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {1736#(<= ~counter~0 2)} {1654#true} #102#return; {1736#(<= ~counter~0 2)} is VALID [2022-04-27 13:17:07,894 INFO L290 TraceCheckUtils]: 2: Hoare triple {1736#(<= ~counter~0 2)} assume true; {1736#(<= ~counter~0 2)} is VALID [2022-04-27 13:17:07,895 INFO L290 TraceCheckUtils]: 1: Hoare triple {1654#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; {1736#(<= ~counter~0 2)} is VALID [2022-04-27 13:17:07,895 INFO L272 TraceCheckUtils]: 0: Hoare triple {1654#true} call ULTIMATE.init(); {1654#true} is VALID [2022-04-27 13:17:07,896 INFO L134 CoverageAnalysis]: Checked inductivity of 14 backedges. 6 proven. 0 refuted. 0 times theorem prover too weak. 8 trivial. 0 not checked. [2022-04-27 13:17:07,896 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-27 13:17:07,896 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1679361098] [2022-04-27 13:17:07,896 WARN L310 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2022-04-27 13:17:07,896 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1422843932] [2022-04-27 13:17:07,896 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1422843932] provided 1 perfect and 1 imperfect interpolant sequences [2022-04-27 13:17:07,897 INFO L184 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2022-04-27 13:17:07,897 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [6] total 9 [2022-04-27 13:17:07,897 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [80004137] [2022-04-27 13:17:07,897 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-27 13:17:07,897 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 3.8333333333333335) internal successors, (23), 6 states have internal predecessors, (23), 5 states have call successors, (7), 3 states have call predecessors, (7), 2 states have return successors, (5), 3 states have call predecessors, (5), 4 states have call successors, (5) Word has length 41 [2022-04-27 13:17:07,899 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-27 13:17:07,899 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with has 6 states, 6 states have (on average 3.8333333333333335) internal successors, (23), 6 states have internal predecessors, (23), 5 states have call successors, (7), 3 states have call predecessors, (7), 2 states have return successors, (5), 3 states have call predecessors, (5), 4 states have call successors, (5) [2022-04-27 13:17:07,932 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 35 edges. 35 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-27 13:17:07,932 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2022-04-27 13:17:07,932 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-04-27 13:17:07,933 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2022-04-27 13:17:07,933 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=26, Invalid=46, Unknown=0, NotChecked=0, Total=72 [2022-04-27 13:17:07,933 INFO L87 Difference]: Start difference. First operand 44 states and 51 transitions. Second operand has 6 states, 6 states have (on average 3.8333333333333335) internal successors, (23), 6 states have internal predecessors, (23), 5 states have call successors, (7), 3 states have call predecessors, (7), 2 states have return successors, (5), 3 states have call predecessors, (5), 4 states have call successors, (5) [2022-04-27 13:17:08,090 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-27 13:17:08,091 INFO L93 Difference]: Finished difference Result 74 states and 89 transitions. [2022-04-27 13:17:08,091 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2022-04-27 13:17:08,091 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 3.8333333333333335) internal successors, (23), 6 states have internal predecessors, (23), 5 states have call successors, (7), 3 states have call predecessors, (7), 2 states have return successors, (5), 3 states have call predecessors, (5), 4 states have call successors, (5) Word has length 41 [2022-04-27 13:17:08,091 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-27 13:17:08,092 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 6 states, 6 states have (on average 3.8333333333333335) internal successors, (23), 6 states have internal predecessors, (23), 5 states have call successors, (7), 3 states have call predecessors, (7), 2 states have return successors, (5), 3 states have call predecessors, (5), 4 states have call successors, (5) [2022-04-27 13:17:08,093 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 87 transitions. [2022-04-27 13:17:08,094 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 6 states, 6 states have (on average 3.8333333333333335) internal successors, (23), 6 states have internal predecessors, (23), 5 states have call successors, (7), 3 states have call predecessors, (7), 2 states have return successors, (5), 3 states have call predecessors, (5), 4 states have call successors, (5) [2022-04-27 13:17:08,095 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 87 transitions. [2022-04-27 13:17:08,095 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 6 states and 87 transitions. [2022-04-27 13:17:08,162 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 87 edges. 87 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-27 13:17:08,163 INFO L225 Difference]: With dead ends: 74 [2022-04-27 13:17:08,163 INFO L226 Difference]: Without dead ends: 53 [2022-04-27 13:17:08,163 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 81 GetRequests, 73 SyntacticMatches, 1 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 8 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=26, Invalid=46, Unknown=0, NotChecked=0, Total=72 [2022-04-27 13:17:08,164 INFO L413 NwaCegarLoop]: 38 mSDtfsCounter, 22 mSDsluCounter, 87 mSDsCounter, 0 mSdLazyCounter, 22 mSolverCounterSat, 9 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 22 SdHoareTripleChecker+Valid, 125 SdHoareTripleChecker+Invalid, 31 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 9 IncrementalHoareTripleChecker+Valid, 22 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-04-27 13:17:08,164 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [22 Valid, 125 Invalid, 31 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [9 Valid, 22 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-04-27 13:17:08,165 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 53 states. [2022-04-27 13:17:08,183 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 53 to 52. [2022-04-27 13:17:08,183 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-27 13:17:08,183 INFO L82 GeneralOperation]: Start isEquivalent. First operand 53 states. Second operand has 52 states, 36 states have (on average 1.1666666666666667) internal successors, (42), 36 states have internal predecessors, (42), 10 states have call successors, (10), 7 states have call predecessors, (10), 5 states have return successors, (8), 8 states have call predecessors, (8), 8 states have call successors, (8) [2022-04-27 13:17:08,183 INFO L74 IsIncluded]: Start isIncluded. First operand 53 states. Second operand has 52 states, 36 states have (on average 1.1666666666666667) internal successors, (42), 36 states have internal predecessors, (42), 10 states have call successors, (10), 7 states have call predecessors, (10), 5 states have return successors, (8), 8 states have call predecessors, (8), 8 states have call successors, (8) [2022-04-27 13:17:08,184 INFO L87 Difference]: Start difference. First operand 53 states. Second operand has 52 states, 36 states have (on average 1.1666666666666667) internal successors, (42), 36 states have internal predecessors, (42), 10 states have call successors, (10), 7 states have call predecessors, (10), 5 states have return successors, (8), 8 states have call predecessors, (8), 8 states have call successors, (8) [2022-04-27 13:17:08,186 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-27 13:17:08,186 INFO L93 Difference]: Finished difference Result 53 states and 61 transitions. [2022-04-27 13:17:08,186 INFO L276 IsEmpty]: Start isEmpty. Operand 53 states and 61 transitions. [2022-04-27 13:17:08,186 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-27 13:17:08,186 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-27 13:17:08,186 INFO L74 IsIncluded]: Start isIncluded. First operand has 52 states, 36 states have (on average 1.1666666666666667) internal successors, (42), 36 states have internal predecessors, (42), 10 states have call successors, (10), 7 states have call predecessors, (10), 5 states have return successors, (8), 8 states have call predecessors, (8), 8 states have call successors, (8) Second operand 53 states. [2022-04-27 13:17:08,187 INFO L87 Difference]: Start difference. First operand has 52 states, 36 states have (on average 1.1666666666666667) internal successors, (42), 36 states have internal predecessors, (42), 10 states have call successors, (10), 7 states have call predecessors, (10), 5 states have return successors, (8), 8 states have call predecessors, (8), 8 states have call successors, (8) Second operand 53 states. [2022-04-27 13:17:08,188 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-27 13:17:08,188 INFO L93 Difference]: Finished difference Result 53 states and 61 transitions. [2022-04-27 13:17:08,189 INFO L276 IsEmpty]: Start isEmpty. Operand 53 states and 61 transitions. [2022-04-27 13:17:08,189 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-27 13:17:08,189 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-27 13:17:08,189 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-27 13:17:08,189 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-27 13:17:08,189 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 52 states, 36 states have (on average 1.1666666666666667) internal successors, (42), 36 states have internal predecessors, (42), 10 states have call successors, (10), 7 states have call predecessors, (10), 5 states have return successors, (8), 8 states have call predecessors, (8), 8 states have call successors, (8) [2022-04-27 13:17:08,191 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 52 states to 52 states and 60 transitions. [2022-04-27 13:17:08,191 INFO L78 Accepts]: Start accepts. Automaton has 52 states and 60 transitions. Word has length 41 [2022-04-27 13:17:08,191 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-27 13:17:08,191 INFO L495 AbstractCegarLoop]: Abstraction has 52 states and 60 transitions. [2022-04-27 13:17:08,191 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 3.8333333333333335) internal successors, (23), 6 states have internal predecessors, (23), 5 states have call successors, (7), 3 states have call predecessors, (7), 2 states have return successors, (5), 3 states have call predecessors, (5), 4 states have call successors, (5) [2022-04-27 13:17:08,192 INFO L276 IsEmpty]: Start isEmpty. Operand 52 states and 60 transitions. [2022-04-27 13:17:08,192 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 44 [2022-04-27 13:17:08,192 INFO L187 NwaCegarLoop]: Found error trace [2022-04-27 13:17:08,192 INFO L195 NwaCegarLoop]: trace histogram [3, 2, 2, 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, 1, 1, 1, 1] [2022-04-27 13:17:08,217 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (7)] Ended with exit code 0 [2022-04-27 13:17:08,415 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5,7 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-27 13:17:08,415 INFO L420 AbstractCegarLoop]: === Iteration 7 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-27 13:17:08,415 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-27 13:17:08,415 INFO L85 PathProgramCache]: Analyzing trace with hash -1292932747, now seen corresponding path program 1 times [2022-04-27 13:17:08,416 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-27 13:17:08,416 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [89846833] [2022-04-27 13:17:08,416 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-27 13:17:08,416 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-27 13:17:08,428 ERROR L245 FreeRefinementEngine]: Caught known exception: Unsupported non-linear arithmetic [2022-04-27 13:17:08,428 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [201516930] [2022-04-27 13:17:08,428 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-27 13:17:08,428 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-27 13:17:08,428 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-04-27 13:17:08,429 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-27 13:17:08,435 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-27 13:17:08,482 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-27 13:17:08,483 INFO L263 TraceCheckSpWp]: Trace formula consists of 137 conjuncts, 9 conjunts are in the unsatisfiable core [2022-04-27 13:17:08,499 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-27 13:17:08,500 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-04-27 13:17:08,729 INFO L272 TraceCheckUtils]: 0: Hoare triple {2191#true} call ULTIMATE.init(); {2191#true} is VALID [2022-04-27 13:17:08,730 INFO L290 TraceCheckUtils]: 1: Hoare triple {2191#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; {2199#(<= ~counter~0 0)} is VALID [2022-04-27 13:17:08,731 INFO L290 TraceCheckUtils]: 2: Hoare triple {2199#(<= ~counter~0 0)} assume true; {2199#(<= ~counter~0 0)} is VALID [2022-04-27 13:17:08,736 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {2199#(<= ~counter~0 0)} {2191#true} #102#return; {2199#(<= ~counter~0 0)} is VALID [2022-04-27 13:17:08,737 INFO L272 TraceCheckUtils]: 4: Hoare triple {2199#(<= ~counter~0 0)} call #t~ret9 := main(); {2199#(<= ~counter~0 0)} is VALID [2022-04-27 13:17:08,738 INFO L290 TraceCheckUtils]: 5: Hoare triple {2199#(<= ~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; {2199#(<= ~counter~0 0)} is VALID [2022-04-27 13:17:08,738 INFO L272 TraceCheckUtils]: 6: Hoare triple {2199#(<= ~counter~0 0)} call assume_abort_if_not((if (~R~0 - 1) * (~R~0 - 1) < ~A~0 then 1 else 0)); {2199#(<= ~counter~0 0)} is VALID [2022-04-27 13:17:08,738 INFO L290 TraceCheckUtils]: 7: Hoare triple {2199#(<= ~counter~0 0)} ~cond := #in~cond; {2199#(<= ~counter~0 0)} is VALID [2022-04-27 13:17:08,739 INFO L290 TraceCheckUtils]: 8: Hoare triple {2199#(<= ~counter~0 0)} assume !(0 == ~cond); {2199#(<= ~counter~0 0)} is VALID [2022-04-27 13:17:08,739 INFO L290 TraceCheckUtils]: 9: Hoare triple {2199#(<= ~counter~0 0)} assume true; {2199#(<= ~counter~0 0)} is VALID [2022-04-27 13:17:08,740 INFO L284 TraceCheckUtils]: 10: Hoare quadruple {2199#(<= ~counter~0 0)} {2199#(<= ~counter~0 0)} #90#return; {2199#(<= ~counter~0 0)} is VALID [2022-04-27 13:17:08,740 INFO L272 TraceCheckUtils]: 11: Hoare triple {2199#(<= ~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)); {2199#(<= ~counter~0 0)} is VALID [2022-04-27 13:17:08,741 INFO L290 TraceCheckUtils]: 12: Hoare triple {2199#(<= ~counter~0 0)} ~cond := #in~cond; {2199#(<= ~counter~0 0)} is VALID [2022-04-27 13:17:08,741 INFO L290 TraceCheckUtils]: 13: Hoare triple {2199#(<= ~counter~0 0)} assume !(0 == ~cond); {2199#(<= ~counter~0 0)} is VALID [2022-04-27 13:17:08,741 INFO L290 TraceCheckUtils]: 14: Hoare triple {2199#(<= ~counter~0 0)} assume true; {2199#(<= ~counter~0 0)} is VALID [2022-04-27 13:17:08,742 INFO L284 TraceCheckUtils]: 15: Hoare quadruple {2199#(<= ~counter~0 0)} {2199#(<= ~counter~0 0)} #92#return; {2199#(<= ~counter~0 0)} is VALID [2022-04-27 13:17:08,742 INFO L290 TraceCheckUtils]: 16: Hoare triple {2199#(<= ~counter~0 0)} ~u~0 := 1 + 2 * ~R~0;~v~0 := 1;~r~0 := ~R~0 * ~R~0 - ~A~0; {2199#(<= ~counter~0 0)} is VALID [2022-04-27 13:17:08,743 INFO L290 TraceCheckUtils]: 17: Hoare triple {2199#(<= ~counter~0 0)} #t~post6 := ~counter~0;~counter~0 := 1 + #t~post6; {2248#(<= ~counter~0 1)} is VALID [2022-04-27 13:17:08,743 INFO L290 TraceCheckUtils]: 18: Hoare triple {2248#(<= ~counter~0 1)} assume !!(#t~post6 < 5);havoc #t~post6; {2248#(<= ~counter~0 1)} is VALID [2022-04-27 13:17:08,744 INFO L272 TraceCheckUtils]: 19: Hoare triple {2248#(<= ~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)); {2248#(<= ~counter~0 1)} is VALID [2022-04-27 13:17:08,744 INFO L290 TraceCheckUtils]: 20: Hoare triple {2248#(<= ~counter~0 1)} ~cond := #in~cond; {2248#(<= ~counter~0 1)} is VALID [2022-04-27 13:17:08,744 INFO L290 TraceCheckUtils]: 21: Hoare triple {2248#(<= ~counter~0 1)} assume !(0 == ~cond); {2248#(<= ~counter~0 1)} is VALID [2022-04-27 13:17:08,745 INFO L290 TraceCheckUtils]: 22: Hoare triple {2248#(<= ~counter~0 1)} assume true; {2248#(<= ~counter~0 1)} is VALID [2022-04-27 13:17:08,745 INFO L284 TraceCheckUtils]: 23: Hoare quadruple {2248#(<= ~counter~0 1)} {2248#(<= ~counter~0 1)} #94#return; {2248#(<= ~counter~0 1)} is VALID [2022-04-27 13:17:08,746 INFO L290 TraceCheckUtils]: 24: Hoare triple {2248#(<= ~counter~0 1)} assume !!(0 != ~r~0); {2248#(<= ~counter~0 1)} is VALID [2022-04-27 13:17:08,746 INFO L290 TraceCheckUtils]: 25: Hoare triple {2248#(<= ~counter~0 1)} #t~post7 := ~counter~0;~counter~0 := 1 + #t~post7; {2273#(<= ~counter~0 2)} is VALID [2022-04-27 13:17:08,747 INFO L290 TraceCheckUtils]: 26: Hoare triple {2273#(<= ~counter~0 2)} assume !!(#t~post7 < 5);havoc #t~post7; {2273#(<= ~counter~0 2)} is VALID [2022-04-27 13:17:08,748 INFO L272 TraceCheckUtils]: 27: Hoare triple {2273#(<= ~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)); {2273#(<= ~counter~0 2)} is VALID [2022-04-27 13:17:08,748 INFO L290 TraceCheckUtils]: 28: Hoare triple {2273#(<= ~counter~0 2)} ~cond := #in~cond; {2273#(<= ~counter~0 2)} is VALID [2022-04-27 13:17:08,748 INFO L290 TraceCheckUtils]: 29: Hoare triple {2273#(<= ~counter~0 2)} assume !(0 == ~cond); {2273#(<= ~counter~0 2)} is VALID [2022-04-27 13:17:08,749 INFO L290 TraceCheckUtils]: 30: Hoare triple {2273#(<= ~counter~0 2)} assume true; {2273#(<= ~counter~0 2)} is VALID [2022-04-27 13:17:08,749 INFO L284 TraceCheckUtils]: 31: Hoare quadruple {2273#(<= ~counter~0 2)} {2273#(<= ~counter~0 2)} #96#return; {2273#(<= ~counter~0 2)} is VALID [2022-04-27 13:17:08,750 INFO L290 TraceCheckUtils]: 32: Hoare triple {2273#(<= ~counter~0 2)} assume !!(~r~0 > 0);~r~0 := ~r~0 - ~v~0;~v~0 := 2 + ~v~0; {2273#(<= ~counter~0 2)} is VALID [2022-04-27 13:17:08,750 INFO L290 TraceCheckUtils]: 33: Hoare triple {2273#(<= ~counter~0 2)} #t~post7 := ~counter~0;~counter~0 := 1 + #t~post7; {2298#(<= |main_#t~post7| 2)} is VALID [2022-04-27 13:17:08,751 INFO L290 TraceCheckUtils]: 34: Hoare triple {2298#(<= |main_#t~post7| 2)} assume !(#t~post7 < 5);havoc #t~post7; {2192#false} is VALID [2022-04-27 13:17:08,751 INFO L290 TraceCheckUtils]: 35: Hoare triple {2192#false} #t~post8 := ~counter~0;~counter~0 := 1 + #t~post8; {2192#false} is VALID [2022-04-27 13:17:08,751 INFO L290 TraceCheckUtils]: 36: Hoare triple {2192#false} assume !(#t~post8 < 5);havoc #t~post8; {2192#false} is VALID [2022-04-27 13:17:08,751 INFO L290 TraceCheckUtils]: 37: Hoare triple {2192#false} #t~post6 := ~counter~0;~counter~0 := 1 + #t~post6; {2192#false} is VALID [2022-04-27 13:17:08,751 INFO L290 TraceCheckUtils]: 38: Hoare triple {2192#false} assume !(#t~post6 < 5);havoc #t~post6; {2192#false} is VALID [2022-04-27 13:17:08,751 INFO L272 TraceCheckUtils]: 39: Hoare triple {2192#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)); {2192#false} is VALID [2022-04-27 13:17:08,751 INFO L290 TraceCheckUtils]: 40: Hoare triple {2192#false} ~cond := #in~cond; {2192#false} is VALID [2022-04-27 13:17:08,751 INFO L290 TraceCheckUtils]: 41: Hoare triple {2192#false} assume 0 == ~cond; {2192#false} is VALID [2022-04-27 13:17:08,752 INFO L290 TraceCheckUtils]: 42: Hoare triple {2192#false} assume !false; {2192#false} is VALID [2022-04-27 13:17:08,752 INFO L134 CoverageAnalysis]: Checked inductivity of 16 backedges. 6 proven. 6 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2022-04-27 13:17:08,752 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-04-27 13:17:08,984 INFO L290 TraceCheckUtils]: 42: Hoare triple {2192#false} assume !false; {2192#false} is VALID [2022-04-27 13:17:08,984 INFO L290 TraceCheckUtils]: 41: Hoare triple {2192#false} assume 0 == ~cond; {2192#false} is VALID [2022-04-27 13:17:08,984 INFO L290 TraceCheckUtils]: 40: Hoare triple {2192#false} ~cond := #in~cond; {2192#false} is VALID [2022-04-27 13:17:08,984 INFO L272 TraceCheckUtils]: 39: Hoare triple {2192#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)); {2192#false} is VALID [2022-04-27 13:17:08,984 INFO L290 TraceCheckUtils]: 38: Hoare triple {2192#false} assume !(#t~post6 < 5);havoc #t~post6; {2192#false} is VALID [2022-04-27 13:17:08,984 INFO L290 TraceCheckUtils]: 37: Hoare triple {2192#false} #t~post6 := ~counter~0;~counter~0 := 1 + #t~post6; {2192#false} is VALID [2022-04-27 13:17:08,985 INFO L290 TraceCheckUtils]: 36: Hoare triple {2192#false} assume !(#t~post8 < 5);havoc #t~post8; {2192#false} is VALID [2022-04-27 13:17:08,985 INFO L290 TraceCheckUtils]: 35: Hoare triple {2192#false} #t~post8 := ~counter~0;~counter~0 := 1 + #t~post8; {2192#false} is VALID [2022-04-27 13:17:08,985 INFO L290 TraceCheckUtils]: 34: Hoare triple {2350#(< |main_#t~post7| 5)} assume !(#t~post7 < 5);havoc #t~post7; {2192#false} is VALID [2022-04-27 13:17:08,985 INFO L290 TraceCheckUtils]: 33: Hoare triple {2354#(< ~counter~0 5)} #t~post7 := ~counter~0;~counter~0 := 1 + #t~post7; {2350#(< |main_#t~post7| 5)} is VALID [2022-04-27 13:17:08,986 INFO L290 TraceCheckUtils]: 32: Hoare triple {2354#(< ~counter~0 5)} assume !!(~r~0 > 0);~r~0 := ~r~0 - ~v~0;~v~0 := 2 + ~v~0; {2354#(< ~counter~0 5)} is VALID [2022-04-27 13:17:08,986 INFO L284 TraceCheckUtils]: 31: Hoare quadruple {2191#true} {2354#(< ~counter~0 5)} #96#return; {2354#(< ~counter~0 5)} is VALID [2022-04-27 13:17:08,986 INFO L290 TraceCheckUtils]: 30: Hoare triple {2191#true} assume true; {2191#true} is VALID [2022-04-27 13:17:08,986 INFO L290 TraceCheckUtils]: 29: Hoare triple {2191#true} assume !(0 == ~cond); {2191#true} is VALID [2022-04-27 13:17:08,987 INFO L290 TraceCheckUtils]: 28: Hoare triple {2191#true} ~cond := #in~cond; {2191#true} is VALID [2022-04-27 13:17:08,987 INFO L272 TraceCheckUtils]: 27: Hoare triple {2354#(< ~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)); {2191#true} is VALID [2022-04-27 13:17:08,987 INFO L290 TraceCheckUtils]: 26: Hoare triple {2354#(< ~counter~0 5)} assume !!(#t~post7 < 5);havoc #t~post7; {2354#(< ~counter~0 5)} is VALID [2022-04-27 13:17:08,987 INFO L290 TraceCheckUtils]: 25: Hoare triple {2379#(< ~counter~0 4)} #t~post7 := ~counter~0;~counter~0 := 1 + #t~post7; {2354#(< ~counter~0 5)} is VALID [2022-04-27 13:17:08,988 INFO L290 TraceCheckUtils]: 24: Hoare triple {2379#(< ~counter~0 4)} assume !!(0 != ~r~0); {2379#(< ~counter~0 4)} is VALID [2022-04-27 13:17:08,988 INFO L284 TraceCheckUtils]: 23: Hoare quadruple {2191#true} {2379#(< ~counter~0 4)} #94#return; {2379#(< ~counter~0 4)} is VALID [2022-04-27 13:17:08,988 INFO L290 TraceCheckUtils]: 22: Hoare triple {2191#true} assume true; {2191#true} is VALID [2022-04-27 13:17:08,988 INFO L290 TraceCheckUtils]: 21: Hoare triple {2191#true} assume !(0 == ~cond); {2191#true} is VALID [2022-04-27 13:17:08,989 INFO L290 TraceCheckUtils]: 20: Hoare triple {2191#true} ~cond := #in~cond; {2191#true} is VALID [2022-04-27 13:17:08,989 INFO L272 TraceCheckUtils]: 19: Hoare triple {2379#(< ~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)); {2191#true} is VALID [2022-04-27 13:17:08,990 INFO L290 TraceCheckUtils]: 18: Hoare triple {2379#(< ~counter~0 4)} assume !!(#t~post6 < 5);havoc #t~post6; {2379#(< ~counter~0 4)} is VALID [2022-04-27 13:17:08,990 INFO L290 TraceCheckUtils]: 17: Hoare triple {2273#(<= ~counter~0 2)} #t~post6 := ~counter~0;~counter~0 := 1 + #t~post6; {2379#(< ~counter~0 4)} is VALID [2022-04-27 13:17:08,991 INFO L290 TraceCheckUtils]: 16: Hoare triple {2273#(<= ~counter~0 2)} ~u~0 := 1 + 2 * ~R~0;~v~0 := 1;~r~0 := ~R~0 * ~R~0 - ~A~0; {2273#(<= ~counter~0 2)} is VALID [2022-04-27 13:17:08,991 INFO L284 TraceCheckUtils]: 15: Hoare quadruple {2191#true} {2273#(<= ~counter~0 2)} #92#return; {2273#(<= ~counter~0 2)} is VALID [2022-04-27 13:17:08,991 INFO L290 TraceCheckUtils]: 14: Hoare triple {2191#true} assume true; {2191#true} is VALID [2022-04-27 13:17:08,991 INFO L290 TraceCheckUtils]: 13: Hoare triple {2191#true} assume !(0 == ~cond); {2191#true} is VALID [2022-04-27 13:17:08,991 INFO L290 TraceCheckUtils]: 12: Hoare triple {2191#true} ~cond := #in~cond; {2191#true} is VALID [2022-04-27 13:17:08,991 INFO L272 TraceCheckUtils]: 11: Hoare triple {2273#(<= ~counter~0 2)} 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)); {2191#true} is VALID [2022-04-27 13:17:08,992 INFO L284 TraceCheckUtils]: 10: Hoare quadruple {2191#true} {2273#(<= ~counter~0 2)} #90#return; {2273#(<= ~counter~0 2)} is VALID [2022-04-27 13:17:08,992 INFO L290 TraceCheckUtils]: 9: Hoare triple {2191#true} assume true; {2191#true} is VALID [2022-04-27 13:17:08,992 INFO L290 TraceCheckUtils]: 8: Hoare triple {2191#true} assume !(0 == ~cond); {2191#true} is VALID [2022-04-27 13:17:08,992 INFO L290 TraceCheckUtils]: 7: Hoare triple {2191#true} ~cond := #in~cond; {2191#true} is VALID [2022-04-27 13:17:08,992 INFO L272 TraceCheckUtils]: 6: Hoare triple {2273#(<= ~counter~0 2)} call assume_abort_if_not((if (~R~0 - 1) * (~R~0 - 1) < ~A~0 then 1 else 0)); {2191#true} is VALID [2022-04-27 13:17:08,993 INFO L290 TraceCheckUtils]: 5: Hoare triple {2273#(<= ~counter~0 2)} 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; {2273#(<= ~counter~0 2)} is VALID [2022-04-27 13:17:08,993 INFO L272 TraceCheckUtils]: 4: Hoare triple {2273#(<= ~counter~0 2)} call #t~ret9 := main(); {2273#(<= ~counter~0 2)} is VALID [2022-04-27 13:17:08,993 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {2273#(<= ~counter~0 2)} {2191#true} #102#return; {2273#(<= ~counter~0 2)} is VALID [2022-04-27 13:17:08,993 INFO L290 TraceCheckUtils]: 2: Hoare triple {2273#(<= ~counter~0 2)} assume true; {2273#(<= ~counter~0 2)} is VALID [2022-04-27 13:17:08,994 INFO L290 TraceCheckUtils]: 1: Hoare triple {2191#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; {2273#(<= ~counter~0 2)} is VALID [2022-04-27 13:17:08,994 INFO L272 TraceCheckUtils]: 0: Hoare triple {2191#true} call ULTIMATE.init(); {2191#true} is VALID [2022-04-27 13:17:08,994 INFO L134 CoverageAnalysis]: Checked inductivity of 16 backedges. 6 proven. 2 refuted. 0 times theorem prover too weak. 8 trivial. 0 not checked. [2022-04-27 13:17:08,995 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-27 13:17:08,995 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [89846833] [2022-04-27 13:17:08,995 WARN L310 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2022-04-27 13:17:08,995 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [201516930] [2022-04-27 13:17:08,995 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [201516930] provided 0 perfect and 2 imperfect interpolant sequences [2022-04-27 13:17:08,995 INFO L184 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2022-04-27 13:17:08,995 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [6, 6] total 9 [2022-04-27 13:17:08,995 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [331744368] [2022-04-27 13:17:08,995 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2022-04-27 13:17:08,996 INFO L78 Accepts]: Start accepts. Automaton has has 9 states, 9 states have (on average 5.111111111111111) internal successors, (46), 9 states have internal predecessors, (46), 7 states have call successors, (12), 5 states have call predecessors, (12), 4 states have return successors, (10), 5 states have call predecessors, (10), 6 states have call successors, (10) Word has length 43 [2022-04-27 13:17:08,996 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-27 13:17:08,996 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with has 9 states, 9 states have (on average 5.111111111111111) internal successors, (46), 9 states have internal predecessors, (46), 7 states have call successors, (12), 5 states have call predecessors, (12), 4 states have return successors, (10), 5 states have call predecessors, (10), 6 states have call successors, (10) [2022-04-27 13:17:09,047 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 68 edges. 68 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-27 13:17:09,047 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2022-04-27 13:17:09,048 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-04-27 13:17:09,048 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2022-04-27 13:17:09,048 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=26, Invalid=46, Unknown=0, NotChecked=0, Total=72 [2022-04-27 13:17:09,048 INFO L87 Difference]: Start difference. First operand 52 states and 60 transitions. Second operand has 9 states, 9 states have (on average 5.111111111111111) internal successors, (46), 9 states have internal predecessors, (46), 7 states have call successors, (12), 5 states have call predecessors, (12), 4 states have return successors, (10), 5 states have call predecessors, (10), 6 states have call successors, (10) [2022-04-27 13:17:09,370 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-27 13:17:09,371 INFO L93 Difference]: Finished difference Result 108 states and 133 transitions. [2022-04-27 13:17:09,371 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2022-04-27 13:17:09,371 INFO L78 Accepts]: Start accepts. Automaton has has 9 states, 9 states have (on average 5.111111111111111) internal successors, (46), 9 states have internal predecessors, (46), 7 states have call successors, (12), 5 states have call predecessors, (12), 4 states have return successors, (10), 5 states have call predecessors, (10), 6 states have call successors, (10) Word has length 43 [2022-04-27 13:17:09,371 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-27 13:17:09,371 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 9 states, 9 states have (on average 5.111111111111111) internal successors, (46), 9 states have internal predecessors, (46), 7 states have call successors, (12), 5 states have call predecessors, (12), 4 states have return successors, (10), 5 states have call predecessors, (10), 6 states have call successors, (10) [2022-04-27 13:17:09,374 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 11 states to 11 states and 130 transitions. [2022-04-27 13:17:09,374 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 9 states, 9 states have (on average 5.111111111111111) internal successors, (46), 9 states have internal predecessors, (46), 7 states have call successors, (12), 5 states have call predecessors, (12), 4 states have return successors, (10), 5 states have call predecessors, (10), 6 states have call successors, (10) [2022-04-27 13:17:09,377 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 11 states to 11 states and 130 transitions. [2022-04-27 13:17:09,377 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 11 states and 130 transitions. [2022-04-27 13:17:09,484 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 130 edges. 130 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-27 13:17:09,485 INFO L225 Difference]: With dead ends: 108 [2022-04-27 13:17:09,486 INFO L226 Difference]: Without dead ends: 87 [2022-04-27 13:17:09,486 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 88 GetRequests, 77 SyntacticMatches, 1 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 11 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=46, Invalid=86, Unknown=0, NotChecked=0, Total=132 [2022-04-27 13:17:09,487 INFO L413 NwaCegarLoop]: 43 mSDtfsCounter, 47 mSDsluCounter, 127 mSDsCounter, 0 mSdLazyCounter, 55 mSolverCounterSat, 19 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 47 SdHoareTripleChecker+Valid, 170 SdHoareTripleChecker+Invalid, 74 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 19 IncrementalHoareTripleChecker+Valid, 55 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-04-27 13:17:09,487 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [47 Valid, 170 Invalid, 74 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [19 Valid, 55 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-04-27 13:17:09,487 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 87 states. [2022-04-27 13:17:09,521 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 87 to 79. [2022-04-27 13:17:09,522 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-27 13:17:09,522 INFO L82 GeneralOperation]: Start isEquivalent. First operand 87 states. Second operand has 79 states, 56 states have (on average 1.1964285714285714) internal successors, (67), 57 states have internal predecessors, (67), 15 states have call successors, (15), 9 states have call predecessors, (15), 7 states have return successors, (13), 12 states have call predecessors, (13), 13 states have call successors, (13) [2022-04-27 13:17:09,522 INFO L74 IsIncluded]: Start isIncluded. First operand 87 states. Second operand has 79 states, 56 states have (on average 1.1964285714285714) internal successors, (67), 57 states have internal predecessors, (67), 15 states have call successors, (15), 9 states have call predecessors, (15), 7 states have return successors, (13), 12 states have call predecessors, (13), 13 states have call successors, (13) [2022-04-27 13:17:09,523 INFO L87 Difference]: Start difference. First operand 87 states. Second operand has 79 states, 56 states have (on average 1.1964285714285714) internal successors, (67), 57 states have internal predecessors, (67), 15 states have call successors, (15), 9 states have call predecessors, (15), 7 states have return successors, (13), 12 states have call predecessors, (13), 13 states have call successors, (13) [2022-04-27 13:17:09,526 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-27 13:17:09,526 INFO L93 Difference]: Finished difference Result 87 states and 103 transitions. [2022-04-27 13:17:09,526 INFO L276 IsEmpty]: Start isEmpty. Operand 87 states and 103 transitions. [2022-04-27 13:17:09,526 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-27 13:17:09,526 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-27 13:17:09,527 INFO L74 IsIncluded]: Start isIncluded. First operand has 79 states, 56 states have (on average 1.1964285714285714) internal successors, (67), 57 states have internal predecessors, (67), 15 states have call successors, (15), 9 states have call predecessors, (15), 7 states have return successors, (13), 12 states have call predecessors, (13), 13 states have call successors, (13) Second operand 87 states. [2022-04-27 13:17:09,527 INFO L87 Difference]: Start difference. First operand has 79 states, 56 states have (on average 1.1964285714285714) internal successors, (67), 57 states have internal predecessors, (67), 15 states have call successors, (15), 9 states have call predecessors, (15), 7 states have return successors, (13), 12 states have call predecessors, (13), 13 states have call successors, (13) Second operand 87 states. [2022-04-27 13:17:09,530 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-27 13:17:09,530 INFO L93 Difference]: Finished difference Result 87 states and 103 transitions. [2022-04-27 13:17:09,530 INFO L276 IsEmpty]: Start isEmpty. Operand 87 states and 103 transitions. [2022-04-27 13:17:09,530 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-27 13:17:09,530 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-27 13:17:09,530 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-27 13:17:09,530 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-27 13:17:09,531 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 79 states, 56 states have (on average 1.1964285714285714) internal successors, (67), 57 states have internal predecessors, (67), 15 states have call successors, (15), 9 states have call predecessors, (15), 7 states have return successors, (13), 12 states have call predecessors, (13), 13 states have call successors, (13) [2022-04-27 13:17:09,533 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 79 states to 79 states and 95 transitions. [2022-04-27 13:17:09,533 INFO L78 Accepts]: Start accepts. Automaton has 79 states and 95 transitions. Word has length 43 [2022-04-27 13:17:09,533 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-27 13:17:09,534 INFO L495 AbstractCegarLoop]: Abstraction has 79 states and 95 transitions. [2022-04-27 13:17:09,534 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 9 states have (on average 5.111111111111111) internal successors, (46), 9 states have internal predecessors, (46), 7 states have call successors, (12), 5 states have call predecessors, (12), 4 states have return successors, (10), 5 states have call predecessors, (10), 6 states have call successors, (10) [2022-04-27 13:17:09,534 INFO L276 IsEmpty]: Start isEmpty. Operand 79 states and 95 transitions. [2022-04-27 13:17:09,534 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 48 [2022-04-27 13:17:09,534 INFO L187 NwaCegarLoop]: Found error trace [2022-04-27 13:17:09,535 INFO L195 NwaCegarLoop]: trace histogram [4, 3, 3, 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, 1, 1, 1, 1, 1, 1, 1] [2022-04-27 13:17:09,561 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-27 13:17:09,739 WARN L477 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-27 13:17:09,740 INFO L420 AbstractCegarLoop]: === Iteration 8 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-27 13:17:09,740 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-27 13:17:09,740 INFO L85 PathProgramCache]: Analyzing trace with hash 1407897436, now seen corresponding path program 1 times [2022-04-27 13:17:09,740 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-27 13:17:09,740 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1566261717] [2022-04-27 13:17:09,740 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-27 13:17:09,740 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-27 13:17:09,752 ERROR L245 FreeRefinementEngine]: Caught known exception: Unsupported non-linear arithmetic [2022-04-27 13:17:09,752 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [213090471] [2022-04-27 13:17:09,753 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-27 13:17:09,753 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-27 13:17:09,753 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-04-27 13:17:09,754 INFO L229 MonitoredProcess]: Starting monitored process 9 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-04-27 13:17:09,755 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (9)] Waiting until timeout for monitored process [2022-04-27 13:17:09,797 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-27 13:17:09,797 INFO L263 TraceCheckSpWp]: Trace formula consists of 138 conjuncts, 3 conjunts are in the unsatisfiable core [2022-04-27 13:17:09,806 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-27 13:17:09,810 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-04-27 13:17:09,998 INFO L272 TraceCheckUtils]: 0: Hoare triple {2899#true} call ULTIMATE.init(); {2899#true} is VALID [2022-04-27 13:17:09,998 INFO L290 TraceCheckUtils]: 1: Hoare triple {2899#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; {2899#true} is VALID [2022-04-27 13:17:09,998 INFO L290 TraceCheckUtils]: 2: Hoare triple {2899#true} assume true; {2899#true} is VALID [2022-04-27 13:17:09,998 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {2899#true} {2899#true} #102#return; {2899#true} is VALID [2022-04-27 13:17:09,998 INFO L272 TraceCheckUtils]: 4: Hoare triple {2899#true} call #t~ret9 := main(); {2899#true} is VALID [2022-04-27 13:17:09,999 INFO L290 TraceCheckUtils]: 5: Hoare triple {2899#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; {2899#true} is VALID [2022-04-27 13:17:09,999 INFO L272 TraceCheckUtils]: 6: Hoare triple {2899#true} call assume_abort_if_not((if (~R~0 - 1) * (~R~0 - 1) < ~A~0 then 1 else 0)); {2899#true} is VALID [2022-04-27 13:17:09,999 INFO L290 TraceCheckUtils]: 7: Hoare triple {2899#true} ~cond := #in~cond; {2899#true} is VALID [2022-04-27 13:17:09,999 INFO L290 TraceCheckUtils]: 8: Hoare triple {2899#true} assume !(0 == ~cond); {2899#true} is VALID [2022-04-27 13:17:09,999 INFO L290 TraceCheckUtils]: 9: Hoare triple {2899#true} assume true; {2899#true} is VALID [2022-04-27 13:17:09,999 INFO L284 TraceCheckUtils]: 10: Hoare quadruple {2899#true} {2899#true} #90#return; {2899#true} is VALID [2022-04-27 13:17:09,999 INFO L272 TraceCheckUtils]: 11: Hoare triple {2899#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)); {2899#true} is VALID [2022-04-27 13:17:09,999 INFO L290 TraceCheckUtils]: 12: Hoare triple {2899#true} ~cond := #in~cond; {2899#true} is VALID [2022-04-27 13:17:09,999 INFO L290 TraceCheckUtils]: 13: Hoare triple {2899#true} assume !(0 == ~cond); {2899#true} is VALID [2022-04-27 13:17:09,999 INFO L290 TraceCheckUtils]: 14: Hoare triple {2899#true} assume true; {2899#true} is VALID [2022-04-27 13:17:09,999 INFO L284 TraceCheckUtils]: 15: Hoare quadruple {2899#true} {2899#true} #92#return; {2899#true} is VALID [2022-04-27 13:17:09,999 INFO L290 TraceCheckUtils]: 16: Hoare triple {2899#true} ~u~0 := 1 + 2 * ~R~0;~v~0 := 1;~r~0 := ~R~0 * ~R~0 - ~A~0; {2899#true} is VALID [2022-04-27 13:17:09,999 INFO L290 TraceCheckUtils]: 17: Hoare triple {2899#true} #t~post6 := ~counter~0;~counter~0 := 1 + #t~post6; {2899#true} is VALID [2022-04-27 13:17:10,000 INFO L290 TraceCheckUtils]: 18: Hoare triple {2899#true} assume !!(#t~post6 < 5);havoc #t~post6; {2899#true} is VALID [2022-04-27 13:17:10,000 INFO L272 TraceCheckUtils]: 19: Hoare triple {2899#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)); {2899#true} is VALID [2022-04-27 13:17:10,000 INFO L290 TraceCheckUtils]: 20: Hoare triple {2899#true} ~cond := #in~cond; {2899#true} is VALID [2022-04-27 13:17:10,000 INFO L290 TraceCheckUtils]: 21: Hoare triple {2899#true} assume !(0 == ~cond); {2899#true} is VALID [2022-04-27 13:17:10,000 INFO L290 TraceCheckUtils]: 22: Hoare triple {2899#true} assume true; {2899#true} is VALID [2022-04-27 13:17:10,000 INFO L284 TraceCheckUtils]: 23: Hoare quadruple {2899#true} {2899#true} #94#return; {2899#true} is VALID [2022-04-27 13:17:10,000 INFO L290 TraceCheckUtils]: 24: Hoare triple {2899#true} assume !!(0 != ~r~0); {2976#(not (= main_~r~0 0))} is VALID [2022-04-27 13:17:10,001 INFO L290 TraceCheckUtils]: 25: Hoare triple {2976#(not (= main_~r~0 0))} #t~post7 := ~counter~0;~counter~0 := 1 + #t~post7; {2976#(not (= main_~r~0 0))} is VALID [2022-04-27 13:17:10,001 INFO L290 TraceCheckUtils]: 26: Hoare triple {2976#(not (= main_~r~0 0))} assume !!(#t~post7 < 5);havoc #t~post7; {2976#(not (= main_~r~0 0))} is VALID [2022-04-27 13:17:10,001 INFO L272 TraceCheckUtils]: 27: Hoare triple {2976#(not (= main_~r~0 0))} 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)); {2899#true} is VALID [2022-04-27 13:17:10,001 INFO L290 TraceCheckUtils]: 28: Hoare triple {2899#true} ~cond := #in~cond; {2899#true} is VALID [2022-04-27 13:17:10,001 INFO L290 TraceCheckUtils]: 29: Hoare triple {2899#true} assume !(0 == ~cond); {2899#true} is VALID [2022-04-27 13:17:10,001 INFO L290 TraceCheckUtils]: 30: Hoare triple {2899#true} assume true; {2899#true} is VALID [2022-04-27 13:17:10,002 INFO L284 TraceCheckUtils]: 31: Hoare quadruple {2899#true} {2976#(not (= main_~r~0 0))} #96#return; {2976#(not (= main_~r~0 0))} is VALID [2022-04-27 13:17:10,002 INFO L290 TraceCheckUtils]: 32: Hoare triple {2976#(not (= main_~r~0 0))} assume !(~r~0 > 0); {3001#(and (not (= main_~r~0 0)) (not (< 0 main_~r~0)))} is VALID [2022-04-27 13:17:10,003 INFO L290 TraceCheckUtils]: 33: Hoare triple {3001#(and (not (= main_~r~0 0)) (not (< 0 main_~r~0)))} #t~post8 := ~counter~0;~counter~0 := 1 + #t~post8; {3001#(and (not (= main_~r~0 0)) (not (< 0 main_~r~0)))} is VALID [2022-04-27 13:17:10,003 INFO L290 TraceCheckUtils]: 34: Hoare triple {3001#(and (not (= main_~r~0 0)) (not (< 0 main_~r~0)))} assume !!(#t~post8 < 5);havoc #t~post8; {3001#(and (not (= main_~r~0 0)) (not (< 0 main_~r~0)))} is VALID [2022-04-27 13:17:10,009 INFO L272 TraceCheckUtils]: 35: Hoare triple {3001#(and (not (= main_~r~0 0)) (not (< 0 main_~r~0)))} 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)); {2899#true} is VALID [2022-04-27 13:17:10,009 INFO L290 TraceCheckUtils]: 36: Hoare triple {2899#true} ~cond := #in~cond; {2899#true} is VALID [2022-04-27 13:17:10,009 INFO L290 TraceCheckUtils]: 37: Hoare triple {2899#true} assume !(0 == ~cond); {2899#true} is VALID [2022-04-27 13:17:10,009 INFO L290 TraceCheckUtils]: 38: Hoare triple {2899#true} assume true; {2899#true} is VALID [2022-04-27 13:17:10,011 INFO L284 TraceCheckUtils]: 39: Hoare quadruple {2899#true} {3001#(and (not (= main_~r~0 0)) (not (< 0 main_~r~0)))} #98#return; {3001#(and (not (= main_~r~0 0)) (not (< 0 main_~r~0)))} is VALID [2022-04-27 13:17:10,011 INFO L290 TraceCheckUtils]: 40: Hoare triple {3001#(and (not (= main_~r~0 0)) (not (< 0 main_~r~0)))} assume !(~r~0 < 0); {2900#false} is VALID [2022-04-27 13:17:10,011 INFO L290 TraceCheckUtils]: 41: Hoare triple {2900#false} #t~post6 := ~counter~0;~counter~0 := 1 + #t~post6; {2900#false} is VALID [2022-04-27 13:17:10,012 INFO L290 TraceCheckUtils]: 42: Hoare triple {2900#false} assume !(#t~post6 < 5);havoc #t~post6; {2900#false} is VALID [2022-04-27 13:17:10,012 INFO L272 TraceCheckUtils]: 43: Hoare triple {2900#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)); {2900#false} is VALID [2022-04-27 13:17:10,014 INFO L290 TraceCheckUtils]: 44: Hoare triple {2900#false} ~cond := #in~cond; {2900#false} is VALID [2022-04-27 13:17:10,015 INFO L290 TraceCheckUtils]: 45: Hoare triple {2900#false} assume 0 == ~cond; {2900#false} is VALID [2022-04-27 13:17:10,016 INFO L290 TraceCheckUtils]: 46: Hoare triple {2900#false} assume !false; {2900#false} is VALID [2022-04-27 13:17:10,016 INFO L134 CoverageAnalysis]: Checked inductivity of 24 backedges. 8 proven. 0 refuted. 0 times theorem prover too weak. 16 trivial. 0 not checked. [2022-04-27 13:17:10,016 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-04-27 13:17:10,016 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-27 13:17:10,016 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1566261717] [2022-04-27 13:17:10,016 WARN L310 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2022-04-27 13:17:10,016 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [213090471] [2022-04-27 13:17:10,016 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [213090471] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-27 13:17:10,016 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-27 13:17:10,016 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-04-27 13:17:10,017 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [524857542] [2022-04-27 13:17:10,017 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-27 13:17:10,017 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 6.0) internal successors, (24), 4 states have internal predecessors, (24), 4 states have call successors, (8), 2 states have call predecessors, (8), 1 states have return successors, (6), 3 states have call predecessors, (6), 3 states have call successors, (6) Word has length 47 [2022-04-27 13:17:10,019 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-27 13:17:10,019 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with has 4 states, 4 states have (on average 6.0) internal successors, (24), 4 states have internal predecessors, (24), 4 states have call successors, (8), 2 states have call predecessors, (8), 1 states have return successors, (6), 3 states have call predecessors, (6), 3 states have call successors, (6) [2022-04-27 13:17:10,047 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 38 edges. 38 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-27 13:17:10,047 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-04-27 13:17:10,048 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-04-27 13:17:10,048 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-04-27 13:17:10,048 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2022-04-27 13:17:10,048 INFO L87 Difference]: Start difference. First operand 79 states and 95 transitions. Second operand has 4 states, 4 states have (on average 6.0) internal successors, (24), 4 states have internal predecessors, (24), 4 states have call successors, (8), 2 states have call predecessors, (8), 1 states have return successors, (6), 3 states have call predecessors, (6), 3 states have call successors, (6) [2022-04-27 13:17:10,251 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-27 13:17:10,251 INFO L93 Difference]: Finished difference Result 132 states and 169 transitions. [2022-04-27 13:17:10,251 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-04-27 13:17:10,251 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 6.0) internal successors, (24), 4 states have internal predecessors, (24), 4 states have call successors, (8), 2 states have call predecessors, (8), 1 states have return successors, (6), 3 states have call predecessors, (6), 3 states have call successors, (6) Word has length 47 [2022-04-27 13:17:10,252 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-27 13:17:10,252 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 4 states, 4 states have (on average 6.0) internal successors, (24), 4 states have internal predecessors, (24), 4 states have call successors, (8), 2 states have call predecessors, (8), 1 states have return successors, (6), 3 states have call predecessors, (6), 3 states have call successors, (6) [2022-04-27 13:17:10,253 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 108 transitions. [2022-04-27 13:17:10,254 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 4 states, 4 states have (on average 6.0) internal successors, (24), 4 states have internal predecessors, (24), 4 states have call successors, (8), 2 states have call predecessors, (8), 1 states have return successors, (6), 3 states have call predecessors, (6), 3 states have call successors, (6) [2022-04-27 13:17:10,255 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 108 transitions. [2022-04-27 13:17:10,255 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 4 states and 108 transitions. [2022-04-27 13:17:10,345 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 108 edges. 108 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-27 13:17:10,348 INFO L225 Difference]: With dead ends: 132 [2022-04-27 13:17:10,348 INFO L226 Difference]: Without dead ends: 101 [2022-04-27 13:17:10,348 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 46 GetRequests, 44 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2022-04-27 13:17:10,349 INFO L413 NwaCegarLoop]: 59 mSDtfsCounter, 19 mSDsluCounter, 70 mSDsCounter, 0 mSdLazyCounter, 37 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 23 SdHoareTripleChecker+Valid, 129 SdHoareTripleChecker+Invalid, 39 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 37 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-04-27 13:17:10,349 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [23 Valid, 129 Invalid, 39 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 37 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-04-27 13:17:10,349 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 101 states. [2022-04-27 13:17:10,395 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 101 to 91. [2022-04-27 13:17:10,396 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-27 13:17:10,400 INFO L82 GeneralOperation]: Start isEquivalent. First operand 101 states. Second operand has 91 states, 65 states have (on average 1.2153846153846153) internal successors, (79), 66 states have internal predecessors, (79), 18 states have call successors, (18), 9 states have call predecessors, (18), 7 states have return successors, (16), 15 states have call predecessors, (16), 16 states have call successors, (16) [2022-04-27 13:17:10,402 INFO L74 IsIncluded]: Start isIncluded. First operand 101 states. Second operand has 91 states, 65 states have (on average 1.2153846153846153) internal successors, (79), 66 states have internal predecessors, (79), 18 states have call successors, (18), 9 states have call predecessors, (18), 7 states have return successors, (16), 15 states have call predecessors, (16), 16 states have call successors, (16) [2022-04-27 13:17:10,404 INFO L87 Difference]: Start difference. First operand 101 states. Second operand has 91 states, 65 states have (on average 1.2153846153846153) internal successors, (79), 66 states have internal predecessors, (79), 18 states have call successors, (18), 9 states have call predecessors, (18), 7 states have return successors, (16), 15 states have call predecessors, (16), 16 states have call successors, (16) [2022-04-27 13:17:10,409 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-27 13:17:10,409 INFO L93 Difference]: Finished difference Result 101 states and 128 transitions. [2022-04-27 13:17:10,409 INFO L276 IsEmpty]: Start isEmpty. Operand 101 states and 128 transitions. [2022-04-27 13:17:10,410 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-27 13:17:10,410 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-27 13:17:10,411 INFO L74 IsIncluded]: Start isIncluded. First operand has 91 states, 65 states have (on average 1.2153846153846153) internal successors, (79), 66 states have internal predecessors, (79), 18 states have call successors, (18), 9 states have call predecessors, (18), 7 states have return successors, (16), 15 states have call predecessors, (16), 16 states have call successors, (16) Second operand 101 states. [2022-04-27 13:17:10,411 INFO L87 Difference]: Start difference. First operand has 91 states, 65 states have (on average 1.2153846153846153) internal successors, (79), 66 states have internal predecessors, (79), 18 states have call successors, (18), 9 states have call predecessors, (18), 7 states have return successors, (16), 15 states have call predecessors, (16), 16 states have call successors, (16) Second operand 101 states. [2022-04-27 13:17:10,414 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-27 13:17:10,415 INFO L93 Difference]: Finished difference Result 101 states and 128 transitions. [2022-04-27 13:17:10,415 INFO L276 IsEmpty]: Start isEmpty. Operand 101 states and 128 transitions. [2022-04-27 13:17:10,415 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-27 13:17:10,415 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-27 13:17:10,415 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-27 13:17:10,415 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-27 13:17:10,416 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 91 states, 65 states have (on average 1.2153846153846153) internal successors, (79), 66 states have internal predecessors, (79), 18 states have call successors, (18), 9 states have call predecessors, (18), 7 states have return successors, (16), 15 states have call predecessors, (16), 16 states have call successors, (16) [2022-04-27 13:17:10,419 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 91 states to 91 states and 113 transitions. [2022-04-27 13:17:10,419 INFO L78 Accepts]: Start accepts. Automaton has 91 states and 113 transitions. Word has length 47 [2022-04-27 13:17:10,420 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-27 13:17:10,420 INFO L495 AbstractCegarLoop]: Abstraction has 91 states and 113 transitions. [2022-04-27 13:17:10,420 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 6.0) internal successors, (24), 4 states have internal predecessors, (24), 4 states have call successors, (8), 2 states have call predecessors, (8), 1 states have return successors, (6), 3 states have call predecessors, (6), 3 states have call successors, (6) [2022-04-27 13:17:10,420 INFO L276 IsEmpty]: Start isEmpty. Operand 91 states and 113 transitions. [2022-04-27 13:17:10,421 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 50 [2022-04-27 13:17:10,421 INFO L187 NwaCegarLoop]: Found error trace [2022-04-27 13:17:10,421 INFO L195 NwaCegarLoop]: trace histogram [4, 3, 3, 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, 1, 1, 1, 1, 1, 1, 1] [2022-04-27 13:17:10,449 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (9)] Forceful destruction successful, exit code 0 [2022-04-27 13:17:10,647 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 9 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable7 [2022-04-27 13:17:10,647 INFO L420 AbstractCegarLoop]: === Iteration 9 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-27 13:17:10,648 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-27 13:17:10,648 INFO L85 PathProgramCache]: Analyzing trace with hash 1915058849, now seen corresponding path program 1 times [2022-04-27 13:17:10,648 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-27 13:17:10,648 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1453163764] [2022-04-27 13:17:10,648 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-27 13:17:10,648 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-27 13:17:10,659 ERROR L245 FreeRefinementEngine]: Caught known exception: Unsupported non-linear arithmetic [2022-04-27 13:17:10,659 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [1909517417] [2022-04-27 13:17:10,659 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-27 13:17:10,659 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-27 13:17:10,659 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-04-27 13:17:10,660 INFO L229 MonitoredProcess]: Starting monitored process 10 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-04-27 13:17:10,671 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (10)] Waiting until timeout for monitored process [2022-04-27 13:17:10,703 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-27 13:17:10,704 INFO L263 TraceCheckSpWp]: Trace formula consists of 147 conjuncts, 11 conjunts are in the unsatisfiable core [2022-04-27 13:17:10,715 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-27 13:17:10,717 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-04-27 13:17:10,966 INFO L272 TraceCheckUtils]: 0: Hoare triple {3559#true} call ULTIMATE.init(); {3559#true} is VALID [2022-04-27 13:17:10,966 INFO L290 TraceCheckUtils]: 1: Hoare triple {3559#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; {3567#(<= ~counter~0 0)} is VALID [2022-04-27 13:17:10,967 INFO L290 TraceCheckUtils]: 2: Hoare triple {3567#(<= ~counter~0 0)} assume true; {3567#(<= ~counter~0 0)} is VALID [2022-04-27 13:17:10,967 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {3567#(<= ~counter~0 0)} {3559#true} #102#return; {3567#(<= ~counter~0 0)} is VALID [2022-04-27 13:17:10,968 INFO L272 TraceCheckUtils]: 4: Hoare triple {3567#(<= ~counter~0 0)} call #t~ret9 := main(); {3567#(<= ~counter~0 0)} is VALID [2022-04-27 13:17:10,968 INFO L290 TraceCheckUtils]: 5: Hoare triple {3567#(<= ~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; {3567#(<= ~counter~0 0)} is VALID [2022-04-27 13:17:10,968 INFO L272 TraceCheckUtils]: 6: Hoare triple {3567#(<= ~counter~0 0)} call assume_abort_if_not((if (~R~0 - 1) * (~R~0 - 1) < ~A~0 then 1 else 0)); {3567#(<= ~counter~0 0)} is VALID [2022-04-27 13:17:10,969 INFO L290 TraceCheckUtils]: 7: Hoare triple {3567#(<= ~counter~0 0)} ~cond := #in~cond; {3567#(<= ~counter~0 0)} is VALID [2022-04-27 13:17:10,969 INFO L290 TraceCheckUtils]: 8: Hoare triple {3567#(<= ~counter~0 0)} assume !(0 == ~cond); {3567#(<= ~counter~0 0)} is VALID [2022-04-27 13:17:10,969 INFO L290 TraceCheckUtils]: 9: Hoare triple {3567#(<= ~counter~0 0)} assume true; {3567#(<= ~counter~0 0)} is VALID [2022-04-27 13:17:10,970 INFO L284 TraceCheckUtils]: 10: Hoare quadruple {3567#(<= ~counter~0 0)} {3567#(<= ~counter~0 0)} #90#return; {3567#(<= ~counter~0 0)} is VALID [2022-04-27 13:17:10,970 INFO L272 TraceCheckUtils]: 11: Hoare triple {3567#(<= ~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)); {3567#(<= ~counter~0 0)} is VALID [2022-04-27 13:17:10,971 INFO L290 TraceCheckUtils]: 12: Hoare triple {3567#(<= ~counter~0 0)} ~cond := #in~cond; {3567#(<= ~counter~0 0)} is VALID [2022-04-27 13:17:10,971 INFO L290 TraceCheckUtils]: 13: Hoare triple {3567#(<= ~counter~0 0)} assume !(0 == ~cond); {3567#(<= ~counter~0 0)} is VALID [2022-04-27 13:17:10,971 INFO L290 TraceCheckUtils]: 14: Hoare triple {3567#(<= ~counter~0 0)} assume true; {3567#(<= ~counter~0 0)} is VALID [2022-04-27 13:17:10,972 INFO L284 TraceCheckUtils]: 15: Hoare quadruple {3567#(<= ~counter~0 0)} {3567#(<= ~counter~0 0)} #92#return; {3567#(<= ~counter~0 0)} is VALID [2022-04-27 13:17:10,972 INFO L290 TraceCheckUtils]: 16: Hoare triple {3567#(<= ~counter~0 0)} ~u~0 := 1 + 2 * ~R~0;~v~0 := 1;~r~0 := ~R~0 * ~R~0 - ~A~0; {3567#(<= ~counter~0 0)} is VALID [2022-04-27 13:17:10,973 INFO L290 TraceCheckUtils]: 17: Hoare triple {3567#(<= ~counter~0 0)} #t~post6 := ~counter~0;~counter~0 := 1 + #t~post6; {3616#(<= ~counter~0 1)} is VALID [2022-04-27 13:17:10,973 INFO L290 TraceCheckUtils]: 18: Hoare triple {3616#(<= ~counter~0 1)} assume !!(#t~post6 < 5);havoc #t~post6; {3616#(<= ~counter~0 1)} is VALID [2022-04-27 13:17:10,974 INFO L272 TraceCheckUtils]: 19: Hoare triple {3616#(<= ~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)); {3616#(<= ~counter~0 1)} is VALID [2022-04-27 13:17:10,975 INFO L290 TraceCheckUtils]: 20: Hoare triple {3616#(<= ~counter~0 1)} ~cond := #in~cond; {3616#(<= ~counter~0 1)} is VALID [2022-04-27 13:17:10,975 INFO L290 TraceCheckUtils]: 21: Hoare triple {3616#(<= ~counter~0 1)} assume !(0 == ~cond); {3616#(<= ~counter~0 1)} is VALID [2022-04-27 13:17:10,975 INFO L290 TraceCheckUtils]: 22: Hoare triple {3616#(<= ~counter~0 1)} assume true; {3616#(<= ~counter~0 1)} is VALID [2022-04-27 13:17:10,976 INFO L284 TraceCheckUtils]: 23: Hoare quadruple {3616#(<= ~counter~0 1)} {3616#(<= ~counter~0 1)} #94#return; {3616#(<= ~counter~0 1)} is VALID [2022-04-27 13:17:10,977 INFO L290 TraceCheckUtils]: 24: Hoare triple {3616#(<= ~counter~0 1)} assume !!(0 != ~r~0); {3616#(<= ~counter~0 1)} is VALID [2022-04-27 13:17:10,977 INFO L290 TraceCheckUtils]: 25: Hoare triple {3616#(<= ~counter~0 1)} #t~post7 := ~counter~0;~counter~0 := 1 + #t~post7; {3641#(<= ~counter~0 2)} is VALID [2022-04-27 13:17:10,977 INFO L290 TraceCheckUtils]: 26: Hoare triple {3641#(<= ~counter~0 2)} assume !!(#t~post7 < 5);havoc #t~post7; {3641#(<= ~counter~0 2)} is VALID [2022-04-27 13:17:10,978 INFO L272 TraceCheckUtils]: 27: Hoare triple {3641#(<= ~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)); {3641#(<= ~counter~0 2)} is VALID [2022-04-27 13:17:10,979 INFO L290 TraceCheckUtils]: 28: Hoare triple {3641#(<= ~counter~0 2)} ~cond := #in~cond; {3641#(<= ~counter~0 2)} is VALID [2022-04-27 13:17:10,979 INFO L290 TraceCheckUtils]: 29: Hoare triple {3641#(<= ~counter~0 2)} assume !(0 == ~cond); {3641#(<= ~counter~0 2)} is VALID [2022-04-27 13:17:10,979 INFO L290 TraceCheckUtils]: 30: Hoare triple {3641#(<= ~counter~0 2)} assume true; {3641#(<= ~counter~0 2)} is VALID [2022-04-27 13:17:10,980 INFO L284 TraceCheckUtils]: 31: Hoare quadruple {3641#(<= ~counter~0 2)} {3641#(<= ~counter~0 2)} #96#return; {3641#(<= ~counter~0 2)} is VALID [2022-04-27 13:17:10,980 INFO L290 TraceCheckUtils]: 32: Hoare triple {3641#(<= ~counter~0 2)} assume !(~r~0 > 0); {3641#(<= ~counter~0 2)} is VALID [2022-04-27 13:17:10,981 INFO L290 TraceCheckUtils]: 33: Hoare triple {3641#(<= ~counter~0 2)} #t~post8 := ~counter~0;~counter~0 := 1 + #t~post8; {3666#(<= ~counter~0 3)} is VALID [2022-04-27 13:17:10,981 INFO L290 TraceCheckUtils]: 34: Hoare triple {3666#(<= ~counter~0 3)} assume !!(#t~post8 < 5);havoc #t~post8; {3666#(<= ~counter~0 3)} is VALID [2022-04-27 13:17:10,982 INFO L272 TraceCheckUtils]: 35: Hoare triple {3666#(<= ~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)); {3666#(<= ~counter~0 3)} is VALID [2022-04-27 13:17:10,983 INFO L290 TraceCheckUtils]: 36: Hoare triple {3666#(<= ~counter~0 3)} ~cond := #in~cond; {3666#(<= ~counter~0 3)} is VALID [2022-04-27 13:17:10,983 INFO L290 TraceCheckUtils]: 37: Hoare triple {3666#(<= ~counter~0 3)} assume !(0 == ~cond); {3666#(<= ~counter~0 3)} is VALID [2022-04-27 13:17:10,983 INFO L290 TraceCheckUtils]: 38: Hoare triple {3666#(<= ~counter~0 3)} assume true; {3666#(<= ~counter~0 3)} is VALID [2022-04-27 13:17:10,984 INFO L284 TraceCheckUtils]: 39: Hoare quadruple {3666#(<= ~counter~0 3)} {3666#(<= ~counter~0 3)} #98#return; {3666#(<= ~counter~0 3)} is VALID [2022-04-27 13:17:10,985 INFO L290 TraceCheckUtils]: 40: Hoare triple {3666#(<= ~counter~0 3)} assume !!(~r~0 < 0);~r~0 := ~r~0 + ~u~0;~u~0 := 2 + ~u~0; {3666#(<= ~counter~0 3)} is VALID [2022-04-27 13:17:10,985 INFO L290 TraceCheckUtils]: 41: Hoare triple {3666#(<= ~counter~0 3)} #t~post8 := ~counter~0;~counter~0 := 1 + #t~post8; {3691#(<= |main_#t~post8| 3)} is VALID [2022-04-27 13:17:10,985 INFO L290 TraceCheckUtils]: 42: Hoare triple {3691#(<= |main_#t~post8| 3)} assume !(#t~post8 < 5);havoc #t~post8; {3560#false} is VALID [2022-04-27 13:17:10,986 INFO L290 TraceCheckUtils]: 43: Hoare triple {3560#false} #t~post6 := ~counter~0;~counter~0 := 1 + #t~post6; {3560#false} is VALID [2022-04-27 13:17:10,986 INFO L290 TraceCheckUtils]: 44: Hoare triple {3560#false} assume !(#t~post6 < 5);havoc #t~post6; {3560#false} is VALID [2022-04-27 13:17:10,986 INFO L272 TraceCheckUtils]: 45: Hoare triple {3560#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)); {3560#false} is VALID [2022-04-27 13:17:10,986 INFO L290 TraceCheckUtils]: 46: Hoare triple {3560#false} ~cond := #in~cond; {3560#false} is VALID [2022-04-27 13:17:10,986 INFO L290 TraceCheckUtils]: 47: Hoare triple {3560#false} assume 0 == ~cond; {3560#false} is VALID [2022-04-27 13:17:10,986 INFO L290 TraceCheckUtils]: 48: Hoare triple {3560#false} assume !false; {3560#false} is VALID [2022-04-27 13:17:10,986 INFO L134 CoverageAnalysis]: Checked inductivity of 26 backedges. 8 proven. 14 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2022-04-27 13:17:10,986 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-04-27 13:17:11,285 INFO L290 TraceCheckUtils]: 48: Hoare triple {3560#false} assume !false; {3560#false} is VALID [2022-04-27 13:17:11,285 INFO L290 TraceCheckUtils]: 47: Hoare triple {3560#false} assume 0 == ~cond; {3560#false} is VALID [2022-04-27 13:17:11,286 INFO L290 TraceCheckUtils]: 46: Hoare triple {3560#false} ~cond := #in~cond; {3560#false} is VALID [2022-04-27 13:17:11,286 INFO L272 TraceCheckUtils]: 45: Hoare triple {3560#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)); {3560#false} is VALID [2022-04-27 13:17:11,286 INFO L290 TraceCheckUtils]: 44: Hoare triple {3560#false} assume !(#t~post6 < 5);havoc #t~post6; {3560#false} is VALID [2022-04-27 13:17:11,286 INFO L290 TraceCheckUtils]: 43: Hoare triple {3560#false} #t~post6 := ~counter~0;~counter~0 := 1 + #t~post6; {3560#false} is VALID [2022-04-27 13:17:11,286 INFO L290 TraceCheckUtils]: 42: Hoare triple {3731#(< |main_#t~post8| 5)} assume !(#t~post8 < 5);havoc #t~post8; {3560#false} is VALID [2022-04-27 13:17:11,287 INFO L290 TraceCheckUtils]: 41: Hoare triple {3735#(< ~counter~0 5)} #t~post8 := ~counter~0;~counter~0 := 1 + #t~post8; {3731#(< |main_#t~post8| 5)} is VALID [2022-04-27 13:17:11,287 INFO L290 TraceCheckUtils]: 40: Hoare triple {3735#(< ~counter~0 5)} assume !!(~r~0 < 0);~r~0 := ~r~0 + ~u~0;~u~0 := 2 + ~u~0; {3735#(< ~counter~0 5)} is VALID [2022-04-27 13:17:11,288 INFO L284 TraceCheckUtils]: 39: Hoare quadruple {3559#true} {3735#(< ~counter~0 5)} #98#return; {3735#(< ~counter~0 5)} is VALID [2022-04-27 13:17:11,288 INFO L290 TraceCheckUtils]: 38: Hoare triple {3559#true} assume true; {3559#true} is VALID [2022-04-27 13:17:11,288 INFO L290 TraceCheckUtils]: 37: Hoare triple {3559#true} assume !(0 == ~cond); {3559#true} is VALID [2022-04-27 13:17:11,288 INFO L290 TraceCheckUtils]: 36: Hoare triple {3559#true} ~cond := #in~cond; {3559#true} is VALID [2022-04-27 13:17:11,288 INFO L272 TraceCheckUtils]: 35: Hoare triple {3735#(< ~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)); {3559#true} is VALID [2022-04-27 13:17:11,289 INFO L290 TraceCheckUtils]: 34: Hoare triple {3735#(< ~counter~0 5)} assume !!(#t~post8 < 5);havoc #t~post8; {3735#(< ~counter~0 5)} is VALID [2022-04-27 13:17:11,289 INFO L290 TraceCheckUtils]: 33: Hoare triple {3666#(<= ~counter~0 3)} #t~post8 := ~counter~0;~counter~0 := 1 + #t~post8; {3735#(< ~counter~0 5)} is VALID [2022-04-27 13:17:11,290 INFO L290 TraceCheckUtils]: 32: Hoare triple {3666#(<= ~counter~0 3)} assume !(~r~0 > 0); {3666#(<= ~counter~0 3)} is VALID [2022-04-27 13:17:11,291 INFO L284 TraceCheckUtils]: 31: Hoare quadruple {3559#true} {3666#(<= ~counter~0 3)} #96#return; {3666#(<= ~counter~0 3)} is VALID [2022-04-27 13:17:11,291 INFO L290 TraceCheckUtils]: 30: Hoare triple {3559#true} assume true; {3559#true} is VALID [2022-04-27 13:17:11,291 INFO L290 TraceCheckUtils]: 29: Hoare triple {3559#true} assume !(0 == ~cond); {3559#true} is VALID [2022-04-27 13:17:11,291 INFO L290 TraceCheckUtils]: 28: Hoare triple {3559#true} ~cond := #in~cond; {3559#true} is VALID [2022-04-27 13:17:11,291 INFO L272 TraceCheckUtils]: 27: Hoare triple {3666#(<= ~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)); {3559#true} is VALID [2022-04-27 13:17:11,291 INFO L290 TraceCheckUtils]: 26: Hoare triple {3666#(<= ~counter~0 3)} assume !!(#t~post7 < 5);havoc #t~post7; {3666#(<= ~counter~0 3)} is VALID [2022-04-27 13:17:11,292 INFO L290 TraceCheckUtils]: 25: Hoare triple {3641#(<= ~counter~0 2)} #t~post7 := ~counter~0;~counter~0 := 1 + #t~post7; {3666#(<= ~counter~0 3)} is VALID [2022-04-27 13:17:11,292 INFO L290 TraceCheckUtils]: 24: Hoare triple {3641#(<= ~counter~0 2)} assume !!(0 != ~r~0); {3641#(<= ~counter~0 2)} is VALID [2022-04-27 13:17:11,293 INFO L284 TraceCheckUtils]: 23: Hoare quadruple {3559#true} {3641#(<= ~counter~0 2)} #94#return; {3641#(<= ~counter~0 2)} is VALID [2022-04-27 13:17:11,293 INFO L290 TraceCheckUtils]: 22: Hoare triple {3559#true} assume true; {3559#true} is VALID [2022-04-27 13:17:11,293 INFO L290 TraceCheckUtils]: 21: Hoare triple {3559#true} assume !(0 == ~cond); {3559#true} is VALID [2022-04-27 13:17:11,293 INFO L290 TraceCheckUtils]: 20: Hoare triple {3559#true} ~cond := #in~cond; {3559#true} is VALID [2022-04-27 13:17:11,293 INFO L272 TraceCheckUtils]: 19: Hoare triple {3641#(<= ~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)); {3559#true} is VALID [2022-04-27 13:17:11,294 INFO L290 TraceCheckUtils]: 18: Hoare triple {3641#(<= ~counter~0 2)} assume !!(#t~post6 < 5);havoc #t~post6; {3641#(<= ~counter~0 2)} is VALID [2022-04-27 13:17:11,294 INFO L290 TraceCheckUtils]: 17: Hoare triple {3616#(<= ~counter~0 1)} #t~post6 := ~counter~0;~counter~0 := 1 + #t~post6; {3641#(<= ~counter~0 2)} is VALID [2022-04-27 13:17:11,295 INFO L290 TraceCheckUtils]: 16: Hoare triple {3616#(<= ~counter~0 1)} ~u~0 := 1 + 2 * ~R~0;~v~0 := 1;~r~0 := ~R~0 * ~R~0 - ~A~0; {3616#(<= ~counter~0 1)} is VALID [2022-04-27 13:17:11,295 INFO L284 TraceCheckUtils]: 15: Hoare quadruple {3559#true} {3616#(<= ~counter~0 1)} #92#return; {3616#(<= ~counter~0 1)} is VALID [2022-04-27 13:17:11,295 INFO L290 TraceCheckUtils]: 14: Hoare triple {3559#true} assume true; {3559#true} is VALID [2022-04-27 13:17:11,295 INFO L290 TraceCheckUtils]: 13: Hoare triple {3559#true} assume !(0 == ~cond); {3559#true} is VALID [2022-04-27 13:17:11,295 INFO L290 TraceCheckUtils]: 12: Hoare triple {3559#true} ~cond := #in~cond; {3559#true} is VALID [2022-04-27 13:17:11,296 INFO L272 TraceCheckUtils]: 11: Hoare triple {3616#(<= ~counter~0 1)} 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)); {3559#true} is VALID [2022-04-27 13:17:11,296 INFO L284 TraceCheckUtils]: 10: Hoare quadruple {3559#true} {3616#(<= ~counter~0 1)} #90#return; {3616#(<= ~counter~0 1)} is VALID [2022-04-27 13:17:11,296 INFO L290 TraceCheckUtils]: 9: Hoare triple {3559#true} assume true; {3559#true} is VALID [2022-04-27 13:17:11,296 INFO L290 TraceCheckUtils]: 8: Hoare triple {3559#true} assume !(0 == ~cond); {3559#true} is VALID [2022-04-27 13:17:11,296 INFO L290 TraceCheckUtils]: 7: Hoare triple {3559#true} ~cond := #in~cond; {3559#true} is VALID [2022-04-27 13:17:11,296 INFO L272 TraceCheckUtils]: 6: Hoare triple {3616#(<= ~counter~0 1)} call assume_abort_if_not((if (~R~0 - 1) * (~R~0 - 1) < ~A~0 then 1 else 0)); {3559#true} is VALID [2022-04-27 13:17:11,297 INFO L290 TraceCheckUtils]: 5: Hoare triple {3616#(<= ~counter~0 1)} 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; {3616#(<= ~counter~0 1)} is VALID [2022-04-27 13:17:11,297 INFO L272 TraceCheckUtils]: 4: Hoare triple {3616#(<= ~counter~0 1)} call #t~ret9 := main(); {3616#(<= ~counter~0 1)} is VALID [2022-04-27 13:17:11,298 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {3616#(<= ~counter~0 1)} {3559#true} #102#return; {3616#(<= ~counter~0 1)} is VALID [2022-04-27 13:17:11,298 INFO L290 TraceCheckUtils]: 2: Hoare triple {3616#(<= ~counter~0 1)} assume true; {3616#(<= ~counter~0 1)} is VALID [2022-04-27 13:17:11,299 INFO L290 TraceCheckUtils]: 1: Hoare triple {3559#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; {3616#(<= ~counter~0 1)} is VALID [2022-04-27 13:17:11,299 INFO L272 TraceCheckUtils]: 0: Hoare triple {3559#true} call ULTIMATE.init(); {3559#true} is VALID [2022-04-27 13:17:11,299 INFO L134 CoverageAnalysis]: Checked inductivity of 26 backedges. 8 proven. 2 refuted. 0 times theorem prover too weak. 16 trivial. 0 not checked. [2022-04-27 13:17:11,299 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-27 13:17:11,299 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1453163764] [2022-04-27 13:17:11,299 WARN L310 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2022-04-27 13:17:11,299 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1909517417] [2022-04-27 13:17:11,299 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1909517417] provided 0 perfect and 2 imperfect interpolant sequences [2022-04-27 13:17:11,299 INFO L184 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2022-04-27 13:17:11,299 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 7] total 9 [2022-04-27 13:17:11,300 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1950206229] [2022-04-27 13:17:11,300 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2022-04-27 13:17:11,300 INFO L78 Accepts]: Start accepts. Automaton has has 9 states, 9 states have (on average 5.888888888888889) internal successors, (53), 9 states have internal predecessors, (53), 7 states have call successors, (14), 6 states have call predecessors, (14), 5 states have return successors, (12), 5 states have call predecessors, (12), 6 states have call successors, (12) Word has length 49 [2022-04-27 13:17:11,300 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-27 13:17:11,301 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with has 9 states, 9 states have (on average 5.888888888888889) internal successors, (53), 9 states have internal predecessors, (53), 7 states have call successors, (14), 6 states have call predecessors, (14), 5 states have return successors, (12), 5 states have call predecessors, (12), 6 states have call successors, (12) [2022-04-27 13:17:11,369 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 79 edges. 79 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-27 13:17:11,369 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2022-04-27 13:17:11,369 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-04-27 13:17:11,369 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2022-04-27 13:17:11,369 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=26, Invalid=46, Unknown=0, NotChecked=0, Total=72 [2022-04-27 13:17:11,369 INFO L87 Difference]: Start difference. First operand 91 states and 113 transitions. Second operand has 9 states, 9 states have (on average 5.888888888888889) internal successors, (53), 9 states have internal predecessors, (53), 7 states have call successors, (14), 6 states have call predecessors, (14), 5 states have return successors, (12), 5 states have call predecessors, (12), 6 states have call successors, (12) [2022-04-27 13:17:11,692 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-27 13:17:11,692 INFO L93 Difference]: Finished difference Result 132 states and 171 transitions. [2022-04-27 13:17:11,693 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2022-04-27 13:17:11,693 INFO L78 Accepts]: Start accepts. Automaton has has 9 states, 9 states have (on average 5.888888888888889) internal successors, (53), 9 states have internal predecessors, (53), 7 states have call successors, (14), 6 states have call predecessors, (14), 5 states have return successors, (12), 5 states have call predecessors, (12), 6 states have call successors, (12) Word has length 49 [2022-04-27 13:17:11,693 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-27 13:17:11,693 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 9 states, 9 states have (on average 5.888888888888889) internal successors, (53), 9 states have internal predecessors, (53), 7 states have call successors, (14), 6 states have call predecessors, (14), 5 states have return successors, (12), 5 states have call predecessors, (12), 6 states have call successors, (12) [2022-04-27 13:17:11,695 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 10 states to 10 states and 118 transitions. [2022-04-27 13:17:11,696 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 9 states, 9 states have (on average 5.888888888888889) internal successors, (53), 9 states have internal predecessors, (53), 7 states have call successors, (14), 6 states have call predecessors, (14), 5 states have return successors, (12), 5 states have call predecessors, (12), 6 states have call successors, (12) [2022-04-27 13:17:11,698 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 10 states to 10 states and 118 transitions. [2022-04-27 13:17:11,698 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 10 states and 118 transitions. [2022-04-27 13:17:11,798 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 118 edges. 118 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-27 13:17:11,800 INFO L225 Difference]: With dead ends: 132 [2022-04-27 13:17:11,800 INFO L226 Difference]: Without dead ends: 95 [2022-04-27 13:17:11,800 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 99 GetRequests, 89 SyntacticMatches, 1 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 9 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=38, Invalid=72, Unknown=0, NotChecked=0, Total=110 [2022-04-27 13:17:11,801 INFO L413 NwaCegarLoop]: 42 mSDtfsCounter, 34 mSDsluCounter, 132 mSDsCounter, 0 mSdLazyCounter, 46 mSolverCounterSat, 17 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 34 SdHoareTripleChecker+Valid, 174 SdHoareTripleChecker+Invalid, 63 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 17 IncrementalHoareTripleChecker+Valid, 46 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-04-27 13:17:11,801 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [34 Valid, 174 Invalid, 63 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [17 Valid, 46 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-04-27 13:17:11,802 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 95 states. [2022-04-27 13:17:11,844 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 95 to 94. [2022-04-27 13:17:11,844 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-27 13:17:11,845 INFO L82 GeneralOperation]: Start isEquivalent. First operand 95 states. Second operand has 94 states, 68 states have (on average 1.2058823529411764) internal successors, (82), 68 states have internal predecessors, (82), 18 states have call successors, (18), 9 states have call predecessors, (18), 7 states have return successors, (16), 16 states have call predecessors, (16), 16 states have call successors, (16) [2022-04-27 13:17:11,845 INFO L74 IsIncluded]: Start isIncluded. First operand 95 states. Second operand has 94 states, 68 states have (on average 1.2058823529411764) internal successors, (82), 68 states have internal predecessors, (82), 18 states have call successors, (18), 9 states have call predecessors, (18), 7 states have return successors, (16), 16 states have call predecessors, (16), 16 states have call successors, (16) [2022-04-27 13:17:11,845 INFO L87 Difference]: Start difference. First operand 95 states. Second operand has 94 states, 68 states have (on average 1.2058823529411764) internal successors, (82), 68 states have internal predecessors, (82), 18 states have call successors, (18), 9 states have call predecessors, (18), 7 states have return successors, (16), 16 states have call predecessors, (16), 16 states have call successors, (16) [2022-04-27 13:17:11,848 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-27 13:17:11,848 INFO L93 Difference]: Finished difference Result 95 states and 117 transitions. [2022-04-27 13:17:11,848 INFO L276 IsEmpty]: Start isEmpty. Operand 95 states and 117 transitions. [2022-04-27 13:17:11,849 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-27 13:17:11,849 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-27 13:17:11,849 INFO L74 IsIncluded]: Start isIncluded. First operand has 94 states, 68 states have (on average 1.2058823529411764) internal successors, (82), 68 states have internal predecessors, (82), 18 states have call successors, (18), 9 states have call predecessors, (18), 7 states have return successors, (16), 16 states have call predecessors, (16), 16 states have call successors, (16) Second operand 95 states. [2022-04-27 13:17:11,849 INFO L87 Difference]: Start difference. First operand has 94 states, 68 states have (on average 1.2058823529411764) internal successors, (82), 68 states have internal predecessors, (82), 18 states have call successors, (18), 9 states have call predecessors, (18), 7 states have return successors, (16), 16 states have call predecessors, (16), 16 states have call successors, (16) Second operand 95 states. [2022-04-27 13:17:11,852 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-27 13:17:11,852 INFO L93 Difference]: Finished difference Result 95 states and 117 transitions. [2022-04-27 13:17:11,852 INFO L276 IsEmpty]: Start isEmpty. Operand 95 states and 117 transitions. [2022-04-27 13:17:11,852 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-27 13:17:11,852 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-27 13:17:11,852 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-27 13:17:11,852 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-27 13:17:11,853 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 94 states, 68 states have (on average 1.2058823529411764) internal successors, (82), 68 states have internal predecessors, (82), 18 states have call successors, (18), 9 states have call predecessors, (18), 7 states have return successors, (16), 16 states have call predecessors, (16), 16 states have call successors, (16) [2022-04-27 13:17:11,855 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 94 states to 94 states and 116 transitions. [2022-04-27 13:17:11,855 INFO L78 Accepts]: Start accepts. Automaton has 94 states and 116 transitions. Word has length 49 [2022-04-27 13:17:11,855 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-27 13:17:11,855 INFO L495 AbstractCegarLoop]: Abstraction has 94 states and 116 transitions. [2022-04-27 13:17:11,855 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 9 states have (on average 5.888888888888889) internal successors, (53), 9 states have internal predecessors, (53), 7 states have call successors, (14), 6 states have call predecessors, (14), 5 states have return successors, (12), 5 states have call predecessors, (12), 6 states have call successors, (12) [2022-04-27 13:17:11,856 INFO L276 IsEmpty]: Start isEmpty. Operand 94 states and 116 transitions. [2022-04-27 13:17:11,856 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 56 [2022-04-27 13:17:11,856 INFO L187 NwaCegarLoop]: Found error trace [2022-04-27 13:17:11,856 INFO L195 NwaCegarLoop]: trace histogram [5, 4, 4, 2, 2, 2, 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, 1, 1, 1, 1] [2022-04-27 13:17:11,880 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (10)] Forceful destruction successful, exit code 0 [2022-04-27 13:17:12,071 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8,10 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-27 13:17:12,071 INFO L420 AbstractCegarLoop]: === Iteration 10 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-27 13:17:12,072 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-27 13:17:12,072 INFO L85 PathProgramCache]: Analyzing trace with hash -1067781299, now seen corresponding path program 1 times [2022-04-27 13:17:12,072 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-27 13:17:12,072 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1147657230] [2022-04-27 13:17:12,072 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-27 13:17:12,072 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-27 13:17:12,082 ERROR L245 FreeRefinementEngine]: Caught known exception: Unsupported non-linear arithmetic [2022-04-27 13:17:12,083 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [168265102] [2022-04-27 13:17:12,083 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-27 13:17:12,083 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-27 13:17:12,083 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-04-27 13:17:12,084 INFO L229 MonitoredProcess]: Starting monitored process 11 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-04-27 13:17:12,089 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (11)] Waiting until timeout for monitored process [2022-04-27 13:17:12,134 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-27 13:17:12,135 INFO L263 TraceCheckSpWp]: Trace formula consists of 157 conjuncts, 13 conjunts are in the unsatisfiable core [2022-04-27 13:17:12,147 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-27 13:17:12,148 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-04-27 13:17:12,442 INFO L272 TraceCheckUtils]: 0: Hoare triple {4371#true} call ULTIMATE.init(); {4371#true} is VALID [2022-04-27 13:17:12,443 INFO L290 TraceCheckUtils]: 1: Hoare triple {4371#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; {4379#(<= ~counter~0 0)} is VALID [2022-04-27 13:17:12,443 INFO L290 TraceCheckUtils]: 2: Hoare triple {4379#(<= ~counter~0 0)} assume true; {4379#(<= ~counter~0 0)} is VALID [2022-04-27 13:17:12,444 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {4379#(<= ~counter~0 0)} {4371#true} #102#return; {4379#(<= ~counter~0 0)} is VALID [2022-04-27 13:17:12,444 INFO L272 TraceCheckUtils]: 4: Hoare triple {4379#(<= ~counter~0 0)} call #t~ret9 := main(); {4379#(<= ~counter~0 0)} is VALID [2022-04-27 13:17:12,444 INFO L290 TraceCheckUtils]: 5: Hoare triple {4379#(<= ~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; {4379#(<= ~counter~0 0)} is VALID [2022-04-27 13:17:12,445 INFO L272 TraceCheckUtils]: 6: Hoare triple {4379#(<= ~counter~0 0)} call assume_abort_if_not((if (~R~0 - 1) * (~R~0 - 1) < ~A~0 then 1 else 0)); {4379#(<= ~counter~0 0)} is VALID [2022-04-27 13:17:12,445 INFO L290 TraceCheckUtils]: 7: Hoare triple {4379#(<= ~counter~0 0)} ~cond := #in~cond; {4379#(<= ~counter~0 0)} is VALID [2022-04-27 13:17:12,445 INFO L290 TraceCheckUtils]: 8: Hoare triple {4379#(<= ~counter~0 0)} assume !(0 == ~cond); {4379#(<= ~counter~0 0)} is VALID [2022-04-27 13:17:12,445 INFO L290 TraceCheckUtils]: 9: Hoare triple {4379#(<= ~counter~0 0)} assume true; {4379#(<= ~counter~0 0)} is VALID [2022-04-27 13:17:12,446 INFO L284 TraceCheckUtils]: 10: Hoare quadruple {4379#(<= ~counter~0 0)} {4379#(<= ~counter~0 0)} #90#return; {4379#(<= ~counter~0 0)} is VALID [2022-04-27 13:17:12,446 INFO L272 TraceCheckUtils]: 11: Hoare triple {4379#(<= ~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)); {4379#(<= ~counter~0 0)} is VALID [2022-04-27 13:17:12,447 INFO L290 TraceCheckUtils]: 12: Hoare triple {4379#(<= ~counter~0 0)} ~cond := #in~cond; {4379#(<= ~counter~0 0)} is VALID [2022-04-27 13:17:12,447 INFO L290 TraceCheckUtils]: 13: Hoare triple {4379#(<= ~counter~0 0)} assume !(0 == ~cond); {4379#(<= ~counter~0 0)} is VALID [2022-04-27 13:17:12,447 INFO L290 TraceCheckUtils]: 14: Hoare triple {4379#(<= ~counter~0 0)} assume true; {4379#(<= ~counter~0 0)} is VALID [2022-04-27 13:17:12,447 INFO L284 TraceCheckUtils]: 15: Hoare quadruple {4379#(<= ~counter~0 0)} {4379#(<= ~counter~0 0)} #92#return; {4379#(<= ~counter~0 0)} is VALID [2022-04-27 13:17:12,448 INFO L290 TraceCheckUtils]: 16: Hoare triple {4379#(<= ~counter~0 0)} ~u~0 := 1 + 2 * ~R~0;~v~0 := 1;~r~0 := ~R~0 * ~R~0 - ~A~0; {4379#(<= ~counter~0 0)} is VALID [2022-04-27 13:17:12,448 INFO L290 TraceCheckUtils]: 17: Hoare triple {4379#(<= ~counter~0 0)} #t~post6 := ~counter~0;~counter~0 := 1 + #t~post6; {4428#(<= ~counter~0 1)} is VALID [2022-04-27 13:17:12,448 INFO L290 TraceCheckUtils]: 18: Hoare triple {4428#(<= ~counter~0 1)} assume !!(#t~post6 < 5);havoc #t~post6; {4428#(<= ~counter~0 1)} is VALID [2022-04-27 13:17:12,449 INFO L272 TraceCheckUtils]: 19: Hoare triple {4428#(<= ~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)); {4428#(<= ~counter~0 1)} is VALID [2022-04-27 13:17:12,449 INFO L290 TraceCheckUtils]: 20: Hoare triple {4428#(<= ~counter~0 1)} ~cond := #in~cond; {4428#(<= ~counter~0 1)} is VALID [2022-04-27 13:17:12,449 INFO L290 TraceCheckUtils]: 21: Hoare triple {4428#(<= ~counter~0 1)} assume !(0 == ~cond); {4428#(<= ~counter~0 1)} is VALID [2022-04-27 13:17:12,450 INFO L290 TraceCheckUtils]: 22: Hoare triple {4428#(<= ~counter~0 1)} assume true; {4428#(<= ~counter~0 1)} is VALID [2022-04-27 13:17:12,450 INFO L284 TraceCheckUtils]: 23: Hoare quadruple {4428#(<= ~counter~0 1)} {4428#(<= ~counter~0 1)} #94#return; {4428#(<= ~counter~0 1)} is VALID [2022-04-27 13:17:12,451 INFO L290 TraceCheckUtils]: 24: Hoare triple {4428#(<= ~counter~0 1)} assume !!(0 != ~r~0); {4428#(<= ~counter~0 1)} is VALID [2022-04-27 13:17:12,451 INFO L290 TraceCheckUtils]: 25: Hoare triple {4428#(<= ~counter~0 1)} #t~post7 := ~counter~0;~counter~0 := 1 + #t~post7; {4453#(<= ~counter~0 2)} is VALID [2022-04-27 13:17:12,451 INFO L290 TraceCheckUtils]: 26: Hoare triple {4453#(<= ~counter~0 2)} assume !!(#t~post7 < 5);havoc #t~post7; {4453#(<= ~counter~0 2)} is VALID [2022-04-27 13:17:12,452 INFO L272 TraceCheckUtils]: 27: Hoare triple {4453#(<= ~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)); {4453#(<= ~counter~0 2)} is VALID [2022-04-27 13:17:12,452 INFO L290 TraceCheckUtils]: 28: Hoare triple {4453#(<= ~counter~0 2)} ~cond := #in~cond; {4453#(<= ~counter~0 2)} is VALID [2022-04-27 13:17:12,452 INFO L290 TraceCheckUtils]: 29: Hoare triple {4453#(<= ~counter~0 2)} assume !(0 == ~cond); {4453#(<= ~counter~0 2)} is VALID [2022-04-27 13:17:12,453 INFO L290 TraceCheckUtils]: 30: Hoare triple {4453#(<= ~counter~0 2)} assume true; {4453#(<= ~counter~0 2)} is VALID [2022-04-27 13:17:12,453 INFO L284 TraceCheckUtils]: 31: Hoare quadruple {4453#(<= ~counter~0 2)} {4453#(<= ~counter~0 2)} #96#return; {4453#(<= ~counter~0 2)} is VALID [2022-04-27 13:17:12,453 INFO L290 TraceCheckUtils]: 32: Hoare triple {4453#(<= ~counter~0 2)} assume !(~r~0 > 0); {4453#(<= ~counter~0 2)} is VALID [2022-04-27 13:17:12,454 INFO L290 TraceCheckUtils]: 33: Hoare triple {4453#(<= ~counter~0 2)} #t~post8 := ~counter~0;~counter~0 := 1 + #t~post8; {4478#(<= ~counter~0 3)} is VALID [2022-04-27 13:17:12,454 INFO L290 TraceCheckUtils]: 34: Hoare triple {4478#(<= ~counter~0 3)} assume !!(#t~post8 < 5);havoc #t~post8; {4478#(<= ~counter~0 3)} is VALID [2022-04-27 13:17:12,455 INFO L272 TraceCheckUtils]: 35: Hoare triple {4478#(<= ~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)); {4478#(<= ~counter~0 3)} is VALID [2022-04-27 13:17:12,455 INFO L290 TraceCheckUtils]: 36: Hoare triple {4478#(<= ~counter~0 3)} ~cond := #in~cond; {4478#(<= ~counter~0 3)} is VALID [2022-04-27 13:17:12,455 INFO L290 TraceCheckUtils]: 37: Hoare triple {4478#(<= ~counter~0 3)} assume !(0 == ~cond); {4478#(<= ~counter~0 3)} is VALID [2022-04-27 13:17:12,455 INFO L290 TraceCheckUtils]: 38: Hoare triple {4478#(<= ~counter~0 3)} assume true; {4478#(<= ~counter~0 3)} is VALID [2022-04-27 13:17:12,456 INFO L284 TraceCheckUtils]: 39: Hoare quadruple {4478#(<= ~counter~0 3)} {4478#(<= ~counter~0 3)} #98#return; {4478#(<= ~counter~0 3)} is VALID [2022-04-27 13:17:12,456 INFO L290 TraceCheckUtils]: 40: Hoare triple {4478#(<= ~counter~0 3)} assume !!(~r~0 < 0);~r~0 := ~r~0 + ~u~0;~u~0 := 2 + ~u~0; {4478#(<= ~counter~0 3)} is VALID [2022-04-27 13:17:12,457 INFO L290 TraceCheckUtils]: 41: Hoare triple {4478#(<= ~counter~0 3)} #t~post8 := ~counter~0;~counter~0 := 1 + #t~post8; {4503#(<= ~counter~0 4)} is VALID [2022-04-27 13:17:12,459 INFO L290 TraceCheckUtils]: 42: Hoare triple {4503#(<= ~counter~0 4)} assume !!(#t~post8 < 5);havoc #t~post8; {4503#(<= ~counter~0 4)} is VALID [2022-04-27 13:17:12,460 INFO L272 TraceCheckUtils]: 43: Hoare triple {4503#(<= ~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)); {4503#(<= ~counter~0 4)} is VALID [2022-04-27 13:17:12,461 INFO L290 TraceCheckUtils]: 44: Hoare triple {4503#(<= ~counter~0 4)} ~cond := #in~cond; {4503#(<= ~counter~0 4)} is VALID [2022-04-27 13:17:12,461 INFO L290 TraceCheckUtils]: 45: Hoare triple {4503#(<= ~counter~0 4)} assume !(0 == ~cond); {4503#(<= ~counter~0 4)} is VALID [2022-04-27 13:17:12,461 INFO L290 TraceCheckUtils]: 46: Hoare triple {4503#(<= ~counter~0 4)} assume true; {4503#(<= ~counter~0 4)} is VALID [2022-04-27 13:17:12,462 INFO L284 TraceCheckUtils]: 47: Hoare quadruple {4503#(<= ~counter~0 4)} {4503#(<= ~counter~0 4)} #98#return; {4503#(<= ~counter~0 4)} is VALID [2022-04-27 13:17:12,462 INFO L290 TraceCheckUtils]: 48: Hoare triple {4503#(<= ~counter~0 4)} assume !(~r~0 < 0); {4503#(<= ~counter~0 4)} is VALID [2022-04-27 13:17:12,463 INFO L290 TraceCheckUtils]: 49: Hoare triple {4503#(<= ~counter~0 4)} #t~post6 := ~counter~0;~counter~0 := 1 + #t~post6; {4528#(<= |main_#t~post6| 4)} is VALID [2022-04-27 13:17:12,463 INFO L290 TraceCheckUtils]: 50: Hoare triple {4528#(<= |main_#t~post6| 4)} assume !(#t~post6 < 5);havoc #t~post6; {4372#false} is VALID [2022-04-27 13:17:12,464 INFO L272 TraceCheckUtils]: 51: Hoare triple {4372#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)); {4372#false} is VALID [2022-04-27 13:17:12,464 INFO L290 TraceCheckUtils]: 52: Hoare triple {4372#false} ~cond := #in~cond; {4372#false} is VALID [2022-04-27 13:17:12,464 INFO L290 TraceCheckUtils]: 53: Hoare triple {4372#false} assume 0 == ~cond; {4372#false} is VALID [2022-04-27 13:17:12,464 INFO L290 TraceCheckUtils]: 54: Hoare triple {4372#false} assume !false; {4372#false} is VALID [2022-04-27 13:17:12,465 INFO L134 CoverageAnalysis]: Checked inductivity of 42 backedges. 8 proven. 30 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2022-04-27 13:17:12,465 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-04-27 13:17:12,708 INFO L290 TraceCheckUtils]: 54: Hoare triple {4372#false} assume !false; {4372#false} is VALID [2022-04-27 13:17:12,708 INFO L290 TraceCheckUtils]: 53: Hoare triple {4372#false} assume 0 == ~cond; {4372#false} is VALID [2022-04-27 13:17:12,708 INFO L290 TraceCheckUtils]: 52: Hoare triple {4372#false} ~cond := #in~cond; {4372#false} is VALID [2022-04-27 13:17:12,708 INFO L272 TraceCheckUtils]: 51: Hoare triple {4372#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)); {4372#false} is VALID [2022-04-27 13:17:12,709 INFO L290 TraceCheckUtils]: 50: Hoare triple {4528#(<= |main_#t~post6| 4)} assume !(#t~post6 < 5);havoc #t~post6; {4372#false} is VALID [2022-04-27 13:17:12,709 INFO L290 TraceCheckUtils]: 49: Hoare triple {4503#(<= ~counter~0 4)} #t~post6 := ~counter~0;~counter~0 := 1 + #t~post6; {4528#(<= |main_#t~post6| 4)} is VALID [2022-04-27 13:17:12,709 INFO L290 TraceCheckUtils]: 48: Hoare triple {4503#(<= ~counter~0 4)} assume !(~r~0 < 0); {4503#(<= ~counter~0 4)} is VALID [2022-04-27 13:17:12,710 INFO L284 TraceCheckUtils]: 47: Hoare quadruple {4371#true} {4503#(<= ~counter~0 4)} #98#return; {4503#(<= ~counter~0 4)} is VALID [2022-04-27 13:17:12,710 INFO L290 TraceCheckUtils]: 46: Hoare triple {4371#true} assume true; {4371#true} is VALID [2022-04-27 13:17:12,710 INFO L290 TraceCheckUtils]: 45: Hoare triple {4371#true} assume !(0 == ~cond); {4371#true} is VALID [2022-04-27 13:17:12,710 INFO L290 TraceCheckUtils]: 44: Hoare triple {4371#true} ~cond := #in~cond; {4371#true} is VALID [2022-04-27 13:17:12,710 INFO L272 TraceCheckUtils]: 43: Hoare triple {4503#(<= ~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)); {4371#true} is VALID [2022-04-27 13:17:12,710 INFO L290 TraceCheckUtils]: 42: Hoare triple {4503#(<= ~counter~0 4)} assume !!(#t~post8 < 5);havoc #t~post8; {4503#(<= ~counter~0 4)} is VALID [2022-04-27 13:17:12,711 INFO L290 TraceCheckUtils]: 41: Hoare triple {4478#(<= ~counter~0 3)} #t~post8 := ~counter~0;~counter~0 := 1 + #t~post8; {4503#(<= ~counter~0 4)} is VALID [2022-04-27 13:17:12,711 INFO L290 TraceCheckUtils]: 40: Hoare triple {4478#(<= ~counter~0 3)} assume !!(~r~0 < 0);~r~0 := ~r~0 + ~u~0;~u~0 := 2 + ~u~0; {4478#(<= ~counter~0 3)} is VALID [2022-04-27 13:17:12,711 INFO L284 TraceCheckUtils]: 39: Hoare quadruple {4371#true} {4478#(<= ~counter~0 3)} #98#return; {4478#(<= ~counter~0 3)} is VALID [2022-04-27 13:17:12,712 INFO L290 TraceCheckUtils]: 38: Hoare triple {4371#true} assume true; {4371#true} is VALID [2022-04-27 13:17:12,712 INFO L290 TraceCheckUtils]: 37: Hoare triple {4371#true} assume !(0 == ~cond); {4371#true} is VALID [2022-04-27 13:17:12,712 INFO L290 TraceCheckUtils]: 36: Hoare triple {4371#true} ~cond := #in~cond; {4371#true} is VALID [2022-04-27 13:17:12,712 INFO L272 TraceCheckUtils]: 35: Hoare triple {4478#(<= ~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)); {4371#true} is VALID [2022-04-27 13:17:12,713 INFO L290 TraceCheckUtils]: 34: Hoare triple {4478#(<= ~counter~0 3)} assume !!(#t~post8 < 5);havoc #t~post8; {4478#(<= ~counter~0 3)} is VALID [2022-04-27 13:17:12,713 INFO L290 TraceCheckUtils]: 33: Hoare triple {4453#(<= ~counter~0 2)} #t~post8 := ~counter~0;~counter~0 := 1 + #t~post8; {4478#(<= ~counter~0 3)} is VALID [2022-04-27 13:17:12,714 INFO L290 TraceCheckUtils]: 32: Hoare triple {4453#(<= ~counter~0 2)} assume !(~r~0 > 0); {4453#(<= ~counter~0 2)} is VALID [2022-04-27 13:17:12,714 INFO L284 TraceCheckUtils]: 31: Hoare quadruple {4371#true} {4453#(<= ~counter~0 2)} #96#return; {4453#(<= ~counter~0 2)} is VALID [2022-04-27 13:17:12,714 INFO L290 TraceCheckUtils]: 30: Hoare triple {4371#true} assume true; {4371#true} is VALID [2022-04-27 13:17:12,714 INFO L290 TraceCheckUtils]: 29: Hoare triple {4371#true} assume !(0 == ~cond); {4371#true} is VALID [2022-04-27 13:17:12,714 INFO L290 TraceCheckUtils]: 28: Hoare triple {4371#true} ~cond := #in~cond; {4371#true} is VALID [2022-04-27 13:17:12,714 INFO L272 TraceCheckUtils]: 27: Hoare triple {4453#(<= ~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)); {4371#true} is VALID [2022-04-27 13:17:12,715 INFO L290 TraceCheckUtils]: 26: Hoare triple {4453#(<= ~counter~0 2)} assume !!(#t~post7 < 5);havoc #t~post7; {4453#(<= ~counter~0 2)} is VALID [2022-04-27 13:17:12,715 INFO L290 TraceCheckUtils]: 25: Hoare triple {4428#(<= ~counter~0 1)} #t~post7 := ~counter~0;~counter~0 := 1 + #t~post7; {4453#(<= ~counter~0 2)} is VALID [2022-04-27 13:17:12,715 INFO L290 TraceCheckUtils]: 24: Hoare triple {4428#(<= ~counter~0 1)} assume !!(0 != ~r~0); {4428#(<= ~counter~0 1)} is VALID [2022-04-27 13:17:12,716 INFO L284 TraceCheckUtils]: 23: Hoare quadruple {4371#true} {4428#(<= ~counter~0 1)} #94#return; {4428#(<= ~counter~0 1)} is VALID [2022-04-27 13:17:12,716 INFO L290 TraceCheckUtils]: 22: Hoare triple {4371#true} assume true; {4371#true} is VALID [2022-04-27 13:17:12,716 INFO L290 TraceCheckUtils]: 21: Hoare triple {4371#true} assume !(0 == ~cond); {4371#true} is VALID [2022-04-27 13:17:12,716 INFO L290 TraceCheckUtils]: 20: Hoare triple {4371#true} ~cond := #in~cond; {4371#true} is VALID [2022-04-27 13:17:12,716 INFO L272 TraceCheckUtils]: 19: Hoare triple {4428#(<= ~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)); {4371#true} is VALID [2022-04-27 13:17:12,716 INFO L290 TraceCheckUtils]: 18: Hoare triple {4428#(<= ~counter~0 1)} assume !!(#t~post6 < 5);havoc #t~post6; {4428#(<= ~counter~0 1)} is VALID [2022-04-27 13:17:12,717 INFO L290 TraceCheckUtils]: 17: Hoare triple {4379#(<= ~counter~0 0)} #t~post6 := ~counter~0;~counter~0 := 1 + #t~post6; {4428#(<= ~counter~0 1)} is VALID [2022-04-27 13:17:12,717 INFO L290 TraceCheckUtils]: 16: Hoare triple {4379#(<= ~counter~0 0)} ~u~0 := 1 + 2 * ~R~0;~v~0 := 1;~r~0 := ~R~0 * ~R~0 - ~A~0; {4379#(<= ~counter~0 0)} is VALID [2022-04-27 13:17:12,717 INFO L284 TraceCheckUtils]: 15: Hoare quadruple {4371#true} {4379#(<= ~counter~0 0)} #92#return; {4379#(<= ~counter~0 0)} is VALID [2022-04-27 13:17:12,717 INFO L290 TraceCheckUtils]: 14: Hoare triple {4371#true} assume true; {4371#true} is VALID [2022-04-27 13:17:12,717 INFO L290 TraceCheckUtils]: 13: Hoare triple {4371#true} assume !(0 == ~cond); {4371#true} is VALID [2022-04-27 13:17:12,717 INFO L290 TraceCheckUtils]: 12: Hoare triple {4371#true} ~cond := #in~cond; {4371#true} is VALID [2022-04-27 13:17:12,718 INFO L272 TraceCheckUtils]: 11: Hoare triple {4379#(<= ~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)); {4371#true} is VALID [2022-04-27 13:17:12,718 INFO L284 TraceCheckUtils]: 10: Hoare quadruple {4371#true} {4379#(<= ~counter~0 0)} #90#return; {4379#(<= ~counter~0 0)} is VALID [2022-04-27 13:17:12,718 INFO L290 TraceCheckUtils]: 9: Hoare triple {4371#true} assume true; {4371#true} is VALID [2022-04-27 13:17:12,718 INFO L290 TraceCheckUtils]: 8: Hoare triple {4371#true} assume !(0 == ~cond); {4371#true} is VALID [2022-04-27 13:17:12,718 INFO L290 TraceCheckUtils]: 7: Hoare triple {4371#true} ~cond := #in~cond; {4371#true} is VALID [2022-04-27 13:17:12,718 INFO L272 TraceCheckUtils]: 6: Hoare triple {4379#(<= ~counter~0 0)} call assume_abort_if_not((if (~R~0 - 1) * (~R~0 - 1) < ~A~0 then 1 else 0)); {4371#true} is VALID [2022-04-27 13:17:12,718 INFO L290 TraceCheckUtils]: 5: Hoare triple {4379#(<= ~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; {4379#(<= ~counter~0 0)} is VALID [2022-04-27 13:17:12,719 INFO L272 TraceCheckUtils]: 4: Hoare triple {4379#(<= ~counter~0 0)} call #t~ret9 := main(); {4379#(<= ~counter~0 0)} is VALID [2022-04-27 13:17:12,719 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {4379#(<= ~counter~0 0)} {4371#true} #102#return; {4379#(<= ~counter~0 0)} is VALID [2022-04-27 13:17:12,719 INFO L290 TraceCheckUtils]: 2: Hoare triple {4379#(<= ~counter~0 0)} assume true; {4379#(<= ~counter~0 0)} is VALID [2022-04-27 13:17:12,720 INFO L290 TraceCheckUtils]: 1: Hoare triple {4371#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; {4379#(<= ~counter~0 0)} is VALID [2022-04-27 13:17:12,720 INFO L272 TraceCheckUtils]: 0: Hoare triple {4371#true} call ULTIMATE.init(); {4371#true} is VALID [2022-04-27 13:17:12,720 INFO L134 CoverageAnalysis]: Checked inductivity of 42 backedges. 8 proven. 6 refuted. 0 times theorem prover too weak. 28 trivial. 0 not checked. [2022-04-27 13:17:12,720 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-27 13:17:12,720 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1147657230] [2022-04-27 13:17:12,720 WARN L310 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2022-04-27 13:17:12,720 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [168265102] [2022-04-27 13:17:12,720 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [168265102] provided 0 perfect and 2 imperfect interpolant sequences [2022-04-27 13:17:12,720 INFO L184 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2022-04-27 13:17:12,720 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [8, 8] total 8 [2022-04-27 13:17:12,721 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1740724298] [2022-04-27 13:17:12,721 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2022-04-27 13:17:12,721 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 8 states have (on average 5.25) internal successors, (42), 8 states have internal predecessors, (42), 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 55 [2022-04-27 13:17:12,723 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-27 13:17:12,723 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with has 8 states, 8 states have (on average 5.25) internal successors, (42), 8 states have internal predecessors, (42), 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-27 13:17:12,774 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 70 edges. 70 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-27 13:17:12,774 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2022-04-27 13:17:12,774 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-04-27 13:17:12,774 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2022-04-27 13:17:12,774 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=23, Invalid=33, Unknown=0, NotChecked=0, Total=56 [2022-04-27 13:17:12,774 INFO L87 Difference]: Start difference. First operand 94 states and 116 transitions. Second operand has 8 states, 8 states have (on average 5.25) internal successors, (42), 8 states have internal predecessors, (42), 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-27 13:17:13,066 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-27 13:17:13,066 INFO L93 Difference]: Finished difference Result 101 states and 123 transitions. [2022-04-27 13:17:13,066 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2022-04-27 13:17:13,066 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 8 states have (on average 5.25) internal successors, (42), 8 states have internal predecessors, (42), 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 55 [2022-04-27 13:17:13,067 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-27 13:17:13,067 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 8 states, 8 states have (on average 5.25) internal successors, (42), 8 states have internal predecessors, (42), 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-27 13:17:13,068 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9 states to 9 states and 95 transitions. [2022-04-27 13:17:13,069 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 8 states, 8 states have (on average 5.25) internal successors, (42), 8 states have internal predecessors, (42), 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-27 13:17:13,070 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9 states to 9 states and 95 transitions. [2022-04-27 13:17:13,070 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 9 states and 95 transitions. [2022-04-27 13:17:13,161 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 95 edges. 95 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-27 13:17:13,163 INFO L225 Difference]: With dead ends: 101 [2022-04-27 13:17:13,163 INFO L226 Difference]: Without dead ends: 96 [2022-04-27 13:17:13,164 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 110 GetRequests, 102 SyntacticMatches, 1 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 8 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=30, Invalid=42, Unknown=0, NotChecked=0, Total=72 [2022-04-27 13:17:13,164 INFO L413 NwaCegarLoop]: 42 mSDtfsCounter, 33 mSDsluCounter, 107 mSDsCounter, 0 mSdLazyCounter, 39 mSolverCounterSat, 29 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 33 SdHoareTripleChecker+Valid, 149 SdHoareTripleChecker+Invalid, 68 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 29 IncrementalHoareTripleChecker+Valid, 39 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-04-27 13:17:13,164 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [33 Valid, 149 Invalid, 68 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [29 Valid, 39 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-04-27 13:17:13,165 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 96 states. [2022-04-27 13:17:13,208 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 96 to 96. [2022-04-27 13:17:13,208 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-27 13:17:13,209 INFO L82 GeneralOperation]: Start isEquivalent. First operand 96 states. Second operand has 96 states, 70 states have (on average 1.2) internal successors, (84), 70 states have internal predecessors, (84), 18 states have call successors, (18), 9 states have call predecessors, (18), 7 states have return successors, (16), 16 states have call predecessors, (16), 16 states have call successors, (16) [2022-04-27 13:17:13,209 INFO L74 IsIncluded]: Start isIncluded. First operand 96 states. Second operand has 96 states, 70 states have (on average 1.2) internal successors, (84), 70 states have internal predecessors, (84), 18 states have call successors, (18), 9 states have call predecessors, (18), 7 states have return successors, (16), 16 states have call predecessors, (16), 16 states have call successors, (16) [2022-04-27 13:17:13,209 INFO L87 Difference]: Start difference. First operand 96 states. Second operand has 96 states, 70 states have (on average 1.2) internal successors, (84), 70 states have internal predecessors, (84), 18 states have call successors, (18), 9 states have call predecessors, (18), 7 states have return successors, (16), 16 states have call predecessors, (16), 16 states have call successors, (16) [2022-04-27 13:17:13,211 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-27 13:17:13,211 INFO L93 Difference]: Finished difference Result 96 states and 118 transitions. [2022-04-27 13:17:13,212 INFO L276 IsEmpty]: Start isEmpty. Operand 96 states and 118 transitions. [2022-04-27 13:17:13,212 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-27 13:17:13,212 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-27 13:17:13,212 INFO L74 IsIncluded]: Start isIncluded. First operand has 96 states, 70 states have (on average 1.2) internal successors, (84), 70 states have internal predecessors, (84), 18 states have call successors, (18), 9 states have call predecessors, (18), 7 states have return successors, (16), 16 states have call predecessors, (16), 16 states have call successors, (16) Second operand 96 states. [2022-04-27 13:17:13,212 INFO L87 Difference]: Start difference. First operand has 96 states, 70 states have (on average 1.2) internal successors, (84), 70 states have internal predecessors, (84), 18 states have call successors, (18), 9 states have call predecessors, (18), 7 states have return successors, (16), 16 states have call predecessors, (16), 16 states have call successors, (16) Second operand 96 states. [2022-04-27 13:17:13,214 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-27 13:17:13,214 INFO L93 Difference]: Finished difference Result 96 states and 118 transitions. [2022-04-27 13:17:13,215 INFO L276 IsEmpty]: Start isEmpty. Operand 96 states and 118 transitions. [2022-04-27 13:17:13,215 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-27 13:17:13,215 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-27 13:17:13,215 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-27 13:17:13,215 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-27 13:17:13,216 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 96 states, 70 states have (on average 1.2) internal successors, (84), 70 states have internal predecessors, (84), 18 states have call successors, (18), 9 states have call predecessors, (18), 7 states have return successors, (16), 16 states have call predecessors, (16), 16 states have call successors, (16) [2022-04-27 13:17:13,218 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 96 states to 96 states and 118 transitions. [2022-04-27 13:17:13,218 INFO L78 Accepts]: Start accepts. Automaton has 96 states and 118 transitions. Word has length 55 [2022-04-27 13:17:13,218 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-27 13:17:13,218 INFO L495 AbstractCegarLoop]: Abstraction has 96 states and 118 transitions. [2022-04-27 13:17:13,218 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 5.25) internal successors, (42), 8 states have internal predecessors, (42), 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-27 13:17:13,218 INFO L276 IsEmpty]: Start isEmpty. Operand 96 states and 118 transitions. [2022-04-27 13:17:13,219 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 64 [2022-04-27 13:17:13,219 INFO L187 NwaCegarLoop]: Found error trace [2022-04-27 13:17:13,219 INFO L195 NwaCegarLoop]: trace histogram [6, 5, 5, 3, 3, 3, 3, 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, 1, 1, 1] [2022-04-27 13:17:13,242 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (11)] Forceful destruction successful, exit code 0 [2022-04-27 13:17:13,442 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 11 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable9 [2022-04-27 13:17:13,442 INFO L420 AbstractCegarLoop]: === Iteration 11 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-27 13:17:13,442 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-27 13:17:13,442 INFO L85 PathProgramCache]: Analyzing trace with hash -1402694082, now seen corresponding path program 2 times [2022-04-27 13:17:13,442 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-27 13:17:13,443 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1721443120] [2022-04-27 13:17:13,443 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-27 13:17:13,443 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-27 13:17:13,454 ERROR L245 FreeRefinementEngine]: Caught known exception: Unsupported non-linear arithmetic [2022-04-27 13:17:13,454 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [1368671213] [2022-04-27 13:17:13,454 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2022-04-27 13:17:13,455 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-27 13:17:13,455 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-04-27 13:17:13,456 INFO L229 MonitoredProcess]: Starting monitored process 12 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-04-27 13:17:13,460 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (12)] Waiting until timeout for monitored process [2022-04-27 13:17:13,516 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2022-04-27 13:17:13,516 INFO L229 tOrderPrioritization]: Conjunction of SSA is sat [2022-04-27 13:17:13,516 INFO L352 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2022-04-27 13:17:13,537 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-04-27 13:17:13,574 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2022-04-27 13:17:13,574 INFO L271 BasicCegarLoop]: Counterexample is feasible [2022-04-27 13:17:13,575 INFO L805 garLoopResultBuilder]: Registering result UNSAFE for location __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION (0 of 1 remaining) [2022-04-27 13:17:13,633 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (12)] Forceful destruction successful, exit code 0 [2022-04-27 13:17:13,777 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 12 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable10 [2022-04-27 13:17:13,780 INFO L356 BasicCegarLoop]: Path program histogram: [2, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-27 13:17:13,782 INFO L176 ceAbstractionStarter]: Computing trace abstraction results [2022-04-27 13:17:13,827 WARN L170 areAnnotationChecker]: reach_errorENTRY has no Hoare annotation [2022-04-27 13:17:13,827 WARN L170 areAnnotationChecker]: ULTIMATE.initENTRY has no Hoare annotation [2022-04-27 13:17:13,827 WARN L170 areAnnotationChecker]: ULTIMATE.startENTRY has no Hoare annotation [2022-04-27 13:17:13,827 WARN L170 areAnnotationChecker]: ULTIMATE.startENTRY has no Hoare annotation [2022-04-27 13:17:13,827 WARN L170 areAnnotationChecker]: assume_abort_if_notENTRY has no Hoare annotation [2022-04-27 13:17:13,827 WARN L170 areAnnotationChecker]: mainENTRY has no Hoare annotation [2022-04-27 13:17:13,828 WARN L170 areAnnotationChecker]: __VERIFIER_assertENTRY has no Hoare annotation [2022-04-27 13:17:13,828 WARN L170 areAnnotationChecker]: reach_errorFINAL has no Hoare annotation [2022-04-27 13:17:13,828 WARN L170 areAnnotationChecker]: ULTIMATE.initFINAL has no Hoare annotation [2022-04-27 13:17:13,828 WARN L170 areAnnotationChecker]: L-1 has no Hoare annotation [2022-04-27 13:17:13,828 WARN L170 areAnnotationChecker]: L-1 has no Hoare annotation [2022-04-27 13:17:13,828 WARN L170 areAnnotationChecker]: L9 has no Hoare annotation [2022-04-27 13:17:13,828 WARN L170 areAnnotationChecker]: L9 has no Hoare annotation [2022-04-27 13:17:13,828 WARN L170 areAnnotationChecker]: L25 has no Hoare annotation [2022-04-27 13:17:13,828 WARN L170 areAnnotationChecker]: L25 has no Hoare annotation [2022-04-27 13:17:13,828 WARN L170 areAnnotationChecker]: L12 has no Hoare annotation [2022-04-27 13:17:13,828 WARN L170 areAnnotationChecker]: L12 has no Hoare annotation [2022-04-27 13:17:13,828 WARN L170 areAnnotationChecker]: ULTIMATE.initEXIT has no Hoare annotation [2022-04-27 13:17:13,828 WARN L170 areAnnotationChecker]: ULTIMATE.startFINAL has no Hoare annotation [2022-04-27 13:17:13,828 WARN L170 areAnnotationChecker]: L9-2 has no Hoare annotation [2022-04-27 13:17:13,828 WARN L170 areAnnotationChecker]: L25-1 has no Hoare annotation [2022-04-27 13:17:13,828 WARN L170 areAnnotationChecker]: L25-1 has no Hoare annotation [2022-04-27 13:17:13,828 WARN L170 areAnnotationChecker]: L13 has no Hoare annotation [2022-04-27 13:17:13,828 WARN L170 areAnnotationChecker]: L13 has no Hoare annotation [2022-04-27 13:17:13,828 WARN L170 areAnnotationChecker]: L12-2 has no Hoare annotation [2022-04-27 13:17:13,828 WARN L170 areAnnotationChecker]: assume_abort_if_notEXIT has no Hoare annotation [2022-04-27 13:17:13,828 WARN L170 areAnnotationChecker]: assume_abort_if_notEXIT has no Hoare annotation [2022-04-27 13:17:13,828 WARN L170 areAnnotationChecker]: L27 has no Hoare annotation [2022-04-27 13:17:13,829 WARN L170 areAnnotationChecker]: __VERIFIER_assertEXIT has no Hoare annotation [2022-04-27 13:17:13,829 WARN L170 areAnnotationChecker]: __VERIFIER_assertEXIT has no Hoare annotation [2022-04-27 13:17:13,829 WARN L170 areAnnotationChecker]: __VERIFIER_assertEXIT has no Hoare annotation [2022-04-27 13:17:13,829 WARN L170 areAnnotationChecker]: __VERIFIER_assertEXIT has no Hoare annotation [2022-04-27 13:17:13,829 WARN L170 areAnnotationChecker]: L47-3 has no Hoare annotation [2022-04-27 13:17:13,829 WARN L170 areAnnotationChecker]: L47-3 has no Hoare annotation [2022-04-27 13:17:13,829 WARN L170 areAnnotationChecker]: L35-1 has no Hoare annotation [2022-04-27 13:17:13,829 WARN L170 areAnnotationChecker]: L35-1 has no Hoare annotation [2022-04-27 13:17:13,829 WARN L170 areAnnotationChecker]: L40-1 has no Hoare annotation [2022-04-27 13:17:13,829 WARN L170 areAnnotationChecker]: L40-1 has no Hoare annotation [2022-04-27 13:17:13,829 WARN L170 areAnnotationChecker]: L48-1 has no Hoare annotation [2022-04-27 13:17:13,829 WARN L170 areAnnotationChecker]: L48-1 has no Hoare annotation [2022-04-27 13:17:13,829 WARN L170 areAnnotationChecker]: L56 has no Hoare annotation [2022-04-27 13:17:13,829 WARN L170 areAnnotationChecker]: L34-3 has no Hoare annotation [2022-04-27 13:17:13,829 WARN L170 areAnnotationChecker]: L34-3 has no Hoare annotation [2022-04-27 13:17:13,829 WARN L170 areAnnotationChecker]: L34-1 has no Hoare annotation [2022-04-27 13:17:13,829 WARN L170 areAnnotationChecker]: L34-1 has no Hoare annotation [2022-04-27 13:17:13,829 WARN L170 areAnnotationChecker]: L39-3 has no Hoare annotation [2022-04-27 13:17:13,829 WARN L170 areAnnotationChecker]: L39-3 has no Hoare annotation [2022-04-27 13:17:13,829 WARN L170 areAnnotationChecker]: L47-2 has no Hoare annotation [2022-04-27 13:17:13,829 WARN L170 areAnnotationChecker]: L47-2 has no Hoare annotation [2022-04-27 13:17:13,829 WARN L170 areAnnotationChecker]: mainFINAL has no Hoare annotation [2022-04-27 13:17:13,829 WARN L170 areAnnotationChecker]: L35 has no Hoare annotation [2022-04-27 13:17:13,830 WARN L170 areAnnotationChecker]: L35 has no Hoare annotation [2022-04-27 13:17:13,830 WARN L170 areAnnotationChecker]: L39-1 has no Hoare annotation [2022-04-27 13:17:13,830 WARN L170 areAnnotationChecker]: L39-1 has no Hoare annotation [2022-04-27 13:17:13,830 WARN L170 areAnnotationChecker]: L47 has no Hoare annotation [2022-04-27 13:17:13,830 WARN L170 areAnnotationChecker]: L47 has no Hoare annotation [2022-04-27 13:17:13,830 WARN L170 areAnnotationChecker]: mainEXIT has no Hoare annotation [2022-04-27 13:17:13,830 WARN L170 areAnnotationChecker]: L40 has no Hoare annotation [2022-04-27 13:17:13,830 WARN L170 areAnnotationChecker]: L40 has no Hoare annotation [2022-04-27 13:17:13,830 WARN L170 areAnnotationChecker]: L48 has no Hoare annotation [2022-04-27 13:17:13,830 WARN L170 areAnnotationChecker]: L48 has no Hoare annotation [2022-04-27 13:17:13,830 INFO L163 areAnnotationChecker]: CFG has 0 edges. 0 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. 0 times interpolants missing. [2022-04-27 13:17:13,831 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 27.04 01:17:13 BoogieIcfgContainer [2022-04-27 13:17:13,831 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2022-04-27 13:17:13,832 INFO L158 Benchmark]: Toolchain (without parser) took 33423.01ms. Allocated memory was 169.9MB in the beginning and 204.5MB in the end (delta: 34.6MB). Free memory was 121.8MB in the beginning and 155.6MB in the end (delta: -33.8MB). Peak memory consumption was 1.4MB. Max. memory is 8.0GB. [2022-04-27 13:17:13,832 INFO L158 Benchmark]: CDTParser took 0.34ms. Allocated memory is still 169.9MB. Free memory is still 138.2MB. There was no memory consumed. Max. memory is 8.0GB. [2022-04-27 13:17:13,832 INFO L158 Benchmark]: CACSL2BoogieTranslator took 207.27ms. Allocated memory is still 169.9MB. Free memory was 121.5MB in the beginning and 146.4MB in the end (delta: -24.9MB). Peak memory consumption was 12.6MB. Max. memory is 8.0GB. [2022-04-27 13:17:13,832 INFO L158 Benchmark]: Boogie Preprocessor took 37.97ms. Allocated memory is still 169.9MB. Free memory was 146.4MB in the beginning and 144.6MB in the end (delta: 1.8MB). Peak memory consumption was 2.1MB. Max. memory is 8.0GB. [2022-04-27 13:17:13,833 INFO L158 Benchmark]: RCFGBuilder took 323.65ms. Allocated memory is still 169.9MB. Free memory was 144.6MB in the beginning and 132.3MB in the end (delta: 12.3MB). Peak memory consumption was 12.6MB. Max. memory is 8.0GB. [2022-04-27 13:17:13,837 INFO L158 Benchmark]: TraceAbstraction took 32848.57ms. Allocated memory was 169.9MB in the beginning and 204.5MB in the end (delta: 34.6MB). Free memory was 131.7MB in the beginning and 155.6MB in the end (delta: -23.9MB). Peak memory consumption was 12.1MB. Max. memory is 8.0GB. [2022-04-27 13:17:13,839 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.34ms. Allocated memory is still 169.9MB. Free memory is still 138.2MB. There was no memory consumed. Max. memory is 8.0GB. * CACSL2BoogieTranslator took 207.27ms. Allocated memory is still 169.9MB. Free memory was 121.5MB in the beginning and 146.4MB in the end (delta: -24.9MB). Peak memory consumption was 12.6MB. Max. memory is 8.0GB. * Boogie Preprocessor took 37.97ms. Allocated memory is still 169.9MB. Free memory was 146.4MB in the beginning and 144.6MB in the end (delta: 1.8MB). Peak memory consumption was 2.1MB. Max. memory is 8.0GB. * RCFGBuilder took 323.65ms. Allocated memory is still 169.9MB. Free memory was 144.6MB in the beginning and 132.3MB in the end (delta: 12.3MB). Peak memory consumption was 12.6MB. Max. memory is 8.0GB. * TraceAbstraction took 32848.57ms. Allocated memory was 169.9MB in the beginning and 204.5MB in the end (delta: 34.6MB). Free memory was 131.7MB in the beginning and 155.6MB in the end (delta: -23.9MB). Peak memory consumption was 12.1MB. Max. memory is 8.0GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - StatisticsResult: ErrorAutomatonStatistics NumberErrorTraces: 0, NumberStatementsAllTraces: 0, NumberRelevantStatements: 0, 0.0s ErrorAutomatonConstructionTimeTotal, 0.0s FaulLocalizationTime, NumberStatementsFirstTrace: -1, TraceLengthAvg: 0, 0.0s ErrorAutomatonConstructionTimeAvg, 0.0s ErrorAutomatonDifferenceTimeAvg, 0.0s ErrorAutomatonDifferenceTimeTotal, NumberOfNoEnhancement: 0, NumberOfFiniteEnhancement: 0, NumberOfInfiniteEnhancement: 0 - CounterExampleResult [Line: 14]: a call to reach_error is reachable a call to reach_error is reachable We found a FailurePath: [L19] int counter = 0; VAL [\old(counter)=10, counter=0] [L21] int A, R; [L22] long long u, v, r; [L23] A = __VERIFIER_nondet_int() [L24] R = __VERIFIER_nondet_int() [L25] 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] [L25] RET assume_abort_if_not((((long long) R - 1) * ((long long) R - 1)) < A) VAL [\old(counter)=0, A=3, counter=0, R=0] [L27] 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] [L27] RET assume_abort_if_not(A % 2 == 1) VAL [\old(counter)=0, A=3, counter=0, R=0] [L29] u = ((long long) 2 * R) + 1 [L30] v = 1 [L31] r = ((long long) R * R) - A VAL [\old(counter)=0, A=3, counter=0, R=0, r=-3, u=1, v=1] [L34] EXPR counter++ VAL [\old(counter)=0, A=3, counter=1, counter++=0, R=0, r=-3, u=1, 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=3, counter=1, R=0, r=-3, u=1, v=1] [L36] COND FALSE !(!(r != 0)) VAL [\old(counter)=0, A=3, counter=1, r=-3, R=0, u=1, v=1] [L39] EXPR counter++ VAL [\old(counter)=0, A=3, counter=2, counter++=1, R=0, r=-3, u=1, v=1] [L39] COND TRUE counter++<5 [L40] 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] [L40] RET __VERIFIER_assert(4*(A+r) == u*u - v*v - 2*u + 2*v) VAL [\old(counter)=0, A=3, counter=2, R=0, r=-3, u=1, v=1] [L41] COND TRUE !(r > 0) VAL [\old(counter)=0, A=3, counter=2, R=0, r=-3, u=1, v=1] [L47] EXPR counter++ VAL [\old(counter)=0, A=3, counter=3, counter++=2, R=0, r=-3, u=1, v=1] [L47] COND TRUE counter++<5 [L48] 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] [L48] RET __VERIFIER_assert(4*(A+r) == u*u - v*v - 2*u + 2*v) VAL [\old(counter)=0, A=3, counter=3, R=0, r=-3, u=1, v=1] [L49] COND FALSE !(!(r < 0)) [L51] r = r + u [L52] u = u + 2 VAL [\old(counter)=0, A=3, counter=3, R=0, r=-2, u=3, v=1] [L47] EXPR counter++ VAL [\old(counter)=0, A=3, counter=4, counter++=3, R=0, r=-2, u=3, v=1] [L47] COND TRUE counter++<5 [L48] 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] [L48] RET __VERIFIER_assert(4*(A+r) == u*u - v*v - 2*u + 2*v) VAL [\old(counter)=0, A=3, counter=4, r=-2, R=0, u=3, v=1] [L49] COND FALSE !(!(r < 0)) [L51] r = r + u [L52] u = u + 2 VAL [\old(counter)=0, A=3, counter=4, r=1, R=0, u=5, v=1] [L47] EXPR counter++ VAL [\old(counter)=0, A=3, counter=5, counter++=4, R=0, r=1, u=5, v=1] [L47] COND TRUE counter++<5 [L48] 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] [L48] RET __VERIFIER_assert(4*(A+r) == u*u - v*v - 2*u + 2*v) VAL [\old(counter)=0, A=3, counter=5, r=1, R=0, u=5, v=1] [L49] COND TRUE !(r < 0) VAL [\old(counter)=0, A=3, counter=5, R=0, r=1, u=5, v=1] [L34] EXPR counter++ VAL [\old(counter)=0, A=3, counter=6, counter++=5, R=0, r=1, u=5, v=1] [L34] COND FALSE !(counter++<5) [L56] 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, 40 locations, 1 error locations. Started 1 CEGAR loops. OverallTime: 32.7s, OverallIterations: 11, TraceHistogramMax: 6, PathProgramHistogramMax: 2, EmptinessCheckTime: 0.0s, AutomataDifference: 20.0s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 0.0s, HoareTripleCheckerStatistics: 1 mSolverCounterUnknown, 210 SdHoareTripleChecker+Valid, 7.1s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 201 mSDsluCounter, 1301 SdHoareTripleChecker+Invalid, 7.1s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 892 mSDsCounter, 93 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 385 IncrementalHoareTripleChecker+Invalid, 479 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 93 mSolverCounterUnsat, 409 mSDtfsCounter, 385 mSolverCounterSat, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 584 GetRequests, 524 SyntacticMatches, 5 SemanticMatches, 55 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 47 ImplicationChecksByTransitivity, 0.3s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=96occurred in iteration=10, InterpolantAutomatonStates: 64, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s DumpTime, AutomataMinimizationStatistics: 0.4s AutomataMinimizationTime, 10 MinimizatonAttempts, 37 StatesRemovedByMinimization, 6 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.1s SsaConstructionTime, 0.3s SatisfiabilityAnalysisTime, 6.8s InterpolantComputationTime, 430 NumberOfCodeBlocks, 430 NumberOfCodeBlocksAsserted, 12 NumberOfCheckSat, 569 ConstructedInterpolants, 0 QuantifiedInterpolants, 1371 SizeOfPredicates, 28 NumberOfNonLiveVariables, 1204 ConjunctsInSsa, 81 ConjunctsInUnsatCore, 15 InterpolantComputations, 6 PerfectInterpolantSequences, 186/252 InterpolantCoveringCapability, INVARIANT_SYNTHESIS: No data available, INTERPOLANT_CONSOLIDATION: No data available, ABSTRACT_INTERPRETATION: No data available, PDR: No data available, ACCELERATED_INTERPOLATION: No data available, SIFA: No data available, ReuseStatistics: No data available RESULT: Ultimate proved your program to be incorrect! [2022-04-27 13:17:13,863 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...