/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-34549b5 [2022-04-07 14:01:52,496 INFO L177 SettingsManager]: Resetting all preferences to default values... [2022-04-07 14:01:52,497 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2022-04-07 14:01:52,517 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2022-04-07 14:01:52,518 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2022-04-07 14:01:52,518 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2022-04-07 14:01:52,519 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2022-04-07 14:01:52,520 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2022-04-07 14:01:52,521 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2022-04-07 14:01:52,521 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2022-04-07 14:01:52,522 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2022-04-07 14:01:52,523 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2022-04-07 14:01:52,523 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2022-04-07 14:01:52,523 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2022-04-07 14:01:52,524 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2022-04-07 14:01:52,525 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2022-04-07 14:01:52,525 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2022-04-07 14:01:52,526 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2022-04-07 14:01:52,527 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2022-04-07 14:01:52,528 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2022-04-07 14:01:52,529 INFO L181 SettingsManager]: Resetting HornVerifier preferences to default values [2022-04-07 14:01:52,531 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2022-04-07 14:01:52,532 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2022-04-07 14:01:52,532 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2022-04-07 14:01:52,533 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2022-04-07 14:01:52,535 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2022-04-07 14:01:52,535 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2022-04-07 14:01:52,535 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2022-04-07 14:01:52,536 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2022-04-07 14:01:52,536 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2022-04-07 14:01:52,537 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2022-04-07 14:01:52,537 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2022-04-07 14:01:52,538 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2022-04-07 14:01:52,538 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2022-04-07 14:01:52,539 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2022-04-07 14:01:52,539 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2022-04-07 14:01:52,540 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2022-04-07 14:01:52,540 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2022-04-07 14:01:52,540 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2022-04-07 14:01:52,541 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2022-04-07 14:01:52,541 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2022-04-07 14:01:52,552 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2022-04-07 14:01:52,552 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-07 14:01:52,565 INFO L113 SettingsManager]: Loading preferences was successful [2022-04-07 14:01:52,565 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2022-04-07 14:01:52,566 INFO L136 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2022-04-07 14:01:52,566 INFO L138 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2022-04-07 14:01:52,566 INFO L136 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2022-04-07 14:01:52,566 INFO L138 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2022-04-07 14:01:52,567 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2022-04-07 14:01:52,567 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2022-04-07 14:01:52,567 INFO L138 SettingsManager]: * Use SBE=true [2022-04-07 14:01:52,567 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2022-04-07 14:01:52,567 INFO L138 SettingsManager]: * sizeof long=4 [2022-04-07 14:01:52,567 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2022-04-07 14:01:52,567 INFO L138 SettingsManager]: * sizeof POINTER=4 [2022-04-07 14:01:52,568 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2022-04-07 14:01:52,568 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2022-04-07 14:01:52,568 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2022-04-07 14:01:52,568 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2022-04-07 14:01:52,568 INFO L138 SettingsManager]: * sizeof long double=12 [2022-04-07 14:01:52,568 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2022-04-07 14:01:52,568 INFO L138 SettingsManager]: * Use constant arrays=true [2022-04-07 14:01:52,568 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2022-04-07 14:01:52,569 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2022-04-07 14:01:52,569 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2022-04-07 14:01:52,569 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2022-04-07 14:01:52,569 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-04-07 14:01:52,569 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2022-04-07 14:01:52,569 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2022-04-07 14:01:52,569 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2022-04-07 14:01:52,569 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2022-04-07 14:01:52,570 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2022-04-07 14:01:52,570 INFO L138 SettingsManager]: * Large block encoding in concurrent analysis=OFF [2022-04-07 14:01:52,570 INFO L138 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2022-04-07 14:01:52,570 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2022-04-07 14:01:52,570 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-07 14:01:52,736 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2022-04-07 14:01:52,753 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2022-04-07 14:01:52,755 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2022-04-07 14:01:52,755 INFO L271 PluginConnector]: Initializing CDTParser... [2022-04-07 14:01:52,759 INFO L275 PluginConnector]: CDTParser initialized [2022-04-07 14:01:52,760 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-07 14:01:52,810 INFO L220 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/9297587cb/80a36f71ea8d4cd1be64fb780b366e8c/FLAGe3f418582 [2022-04-07 14:01:53,164 INFO L306 CDTParser]: Found 1 translation units. [2022-04-07 14:01:53,164 INFO L160 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/nla-digbench-scaling/fermat1-ll_unwindbound5.c [2022-04-07 14:01:53,168 INFO L349 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/9297587cb/80a36f71ea8d4cd1be64fb780b366e8c/FLAGe3f418582 [2022-04-07 14:01:53,176 INFO L357 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/9297587cb/80a36f71ea8d4cd1be64fb780b366e8c [2022-04-07 14:01:53,177 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2022-04-07 14:01:53,178 INFO L131 ToolchainWalker]: Walking toolchain with 4 elements. [2022-04-07 14:01:53,183 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2022-04-07 14:01:53,183 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2022-04-07 14:01:53,185 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2022-04-07 14:01:53,186 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 07.04 02:01:53" (1/1) ... [2022-04-07 14:01:53,186 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@2f752c2d and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.04 02:01:53, skipping insertion in model container [2022-04-07 14:01:53,187 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 07.04 02:01:53" (1/1) ... [2022-04-07 14:01:53,190 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2022-04-07 14:01:53,200 INFO L178 MainTranslator]: Built tables and reachable declarations [2022-04-07 14:01:53,303 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-07 14:01:53,341 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-04-07 14:01:53,346 INFO L203 MainTranslator]: Completed pre-run [2022-04-07 14:01:53,354 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-07 14:01:53,363 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-04-07 14:01:53,373 INFO L208 MainTranslator]: Completed translation [2022-04-07 14:01:53,373 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.04 02:01:53 WrapperNode [2022-04-07 14:01:53,373 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2022-04-07 14:01:53,374 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2022-04-07 14:01:53,374 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2022-04-07 14:01:53,374 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2022-04-07 14:01:53,380 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.04 02:01:53" (1/1) ... [2022-04-07 14:01:53,380 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.04 02:01:53" (1/1) ... [2022-04-07 14:01:53,384 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.04 02:01:53" (1/1) ... [2022-04-07 14:01:53,384 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.04 02:01:53" (1/1) ... [2022-04-07 14:01:53,393 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.04 02:01:53" (1/1) ... [2022-04-07 14:01:53,396 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.04 02:01:53" (1/1) ... [2022-04-07 14:01:53,396 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.04 02:01:53" (1/1) ... [2022-04-07 14:01:53,397 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2022-04-07 14:01:53,398 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2022-04-07 14:01:53,398 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2022-04-07 14:01:53,398 INFO L275 PluginConnector]: RCFGBuilder initialized [2022-04-07 14:01:53,403 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.04 02:01:53" (1/1) ... [2022-04-07 14:01:53,415 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-04-07 14:01:53,422 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-04-07 14:01:53,430 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-07 14:01:53,442 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-07 14:01:53,460 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.init [2022-04-07 14:01:53,460 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2022-04-07 14:01:53,460 INFO L138 BoogieDeclarations]: Found implementation of procedure reach_error [2022-04-07 14:01:53,460 INFO L138 BoogieDeclarations]: Found implementation of procedure assume_abort_if_not [2022-04-07 14:01:53,460 INFO L138 BoogieDeclarations]: Found implementation of procedure __VERIFIER_assert [2022-04-07 14:01:53,461 INFO L138 BoogieDeclarations]: Found implementation of procedure main [2022-04-07 14:01:53,461 INFO L130 BoogieDeclarations]: Found specification of procedure abort [2022-04-07 14:01:53,461 INFO L130 BoogieDeclarations]: Found specification of procedure __assert_fail [2022-04-07 14:01:53,461 INFO L130 BoogieDeclarations]: Found specification of procedure reach_error [2022-04-07 14:01:53,461 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2022-04-07 14:01:53,461 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_nondet_int [2022-04-07 14:01:53,461 INFO L130 BoogieDeclarations]: Found specification of procedure assume_abort_if_not [2022-04-07 14:01:53,461 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_assert [2022-04-07 14:01:53,461 INFO L130 BoogieDeclarations]: Found specification of procedure main [2022-04-07 14:01:53,461 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.init [2022-04-07 14:01:53,461 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2022-04-07 14:01:53,461 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2022-04-07 14:01:53,462 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2022-04-07 14:01:53,462 INFO L130 BoogieDeclarations]: Found specification of procedure read~int [2022-04-07 14:01:53,462 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2022-04-07 14:01:53,502 INFO L234 CfgBuilder]: Building ICFG [2022-04-07 14:01:53,503 INFO L260 CfgBuilder]: Building CFG for each procedure with an implementation [2022-04-07 14:01:53,646 INFO L275 CfgBuilder]: Performing block encoding [2022-04-07 14:01:53,652 INFO L294 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2022-04-07 14:01:53,652 INFO L299 CfgBuilder]: Removed 3 assume(true) statements. [2022-04-07 14:01:53,653 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 07.04 02:01:53 BoogieIcfgContainer [2022-04-07 14:01:53,654 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2022-04-07 14:01:53,655 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2022-04-07 14:01:53,655 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2022-04-07 14:01:53,658 INFO L275 PluginConnector]: TraceAbstraction initialized [2022-04-07 14:01:53,658 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 07.04 02:01:53" (1/3) ... [2022-04-07 14:01:53,659 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@5f127579 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 07.04 02:01:53, skipping insertion in model container [2022-04-07 14:01:53,659 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.04 02:01:53" (2/3) ... [2022-04-07 14:01:53,659 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@5f127579 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 07.04 02:01:53, skipping insertion in model container [2022-04-07 14:01:53,659 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 07.04 02:01:53" (3/3) ... [2022-04-07 14:01:53,660 INFO L111 eAbstractionObserver]: Analyzing ICFG fermat1-ll_unwindbound5.c [2022-04-07 14:01:53,664 INFO L203 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2022-04-07 14:01:53,664 INFO L162 ceAbstractionStarter]: Applying trace abstraction to program that has 1 error locations. [2022-04-07 14:01:53,705 INFO L339 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2022-04-07 14:01:53,722 INFO L340 AbstractCegarLoop]: Settings: SEPARATE_VIOLATION_CHECK=true, mInterprocedural=true, mMaxIterations=1000000, mWatchIteration=1000000, mArtifact=RCFG, mInterpolation=FPandBP, mInterpolantAutomaton=STRAIGHT_LINE, mDumpAutomata=false, mAutomataFormat=ATS_NUMERATE, mDumpPath=., mDeterminiation=PREDICATE_ABSTRACTION, mMinimize=MINIMIZE_SEVPA, mHoare=true, mAutomataTypeConcurrency=PETRI_NET, mHoareTripleChecks=INCREMENTAL, mHoareAnnotationPositions=LoopsAndPotentialCycles, mDumpOnlyReuseAutomata=false, mLimitTraceHistogram=0, mErrorLocTimeLimit=0, mLimitPathProgramCount=0, mCollectInterpolantStatistics=true, mHeuristicEmptinessCheck=false, mHeuristicEmptinessCheckAStarHeuristic=ZERO, mHeuristicEmptinessCheckAStarHeuristicRandomSeed=1337, mHeuristicEmptinessCheckSmtFeatureScoringMethod=DAGSIZE, mSMTFeatureExtraction=false, mSMTFeatureExtractionDumpPath=., mOverrideInterpolantAutomaton=false, mMcrInterpolantMethod=WP [2022-04-07 14:01:53,722 INFO L341 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2022-04-07 14:01:53,744 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-07 14:01:53,748 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2022-04-07 14:01:53,748 INFO L491 BasicCegarLoop]: Found error trace [2022-04-07 14:01:53,748 INFO L499 BasicCegarLoop]: trace histogram [2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-07 14:01:53,749 INFO L403 AbstractCegarLoop]: === Iteration 1 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-07 14:01:53,752 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-07 14:01:53,753 INFO L85 PathProgramCache]: Analyzing trace with hash 928708300, now seen corresponding path program 1 times [2022-04-07 14:01:53,760 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-07 14:01:53,760 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [894975637] [2022-04-07 14:01:53,760 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-07 14:01:53,761 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-07 14:01:53,858 ERROR L245 FreeRefinementEngine]: Caught known exception: Unsupported non-linear arithmetic [2022-04-07 14:01:53,859 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [1538894194] [2022-04-07 14:01:53,859 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-07 14:01:53,859 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-07 14:01:53,860 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-04-07 14:01:53,861 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-07 14:01:53,862 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-07 14:01:53,939 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-07 14:01:53,941 INFO L263 TraceCheckSpWp]: Trace formula consists of 89 conjuncts, 1 conjunts are in the unsatisfiable core [2022-04-07 14:01:53,949 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-07 14:01:53,951 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-04-07 14:01:54,074 INFO L272 TraceCheckUtils]: 0: Hoare triple {40#true} call ULTIMATE.init(); {40#true} is VALID [2022-04-07 14:01:54,074 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-07 14:01:54,074 INFO L290 TraceCheckUtils]: 2: Hoare triple {40#true} assume true; {40#true} is VALID [2022-04-07 14:01:54,075 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {40#true} {40#true} #102#return; {40#true} is VALID [2022-04-07 14:01:54,076 INFO L272 TraceCheckUtils]: 4: Hoare triple {40#true} call #t~ret9 := main(); {40#true} is VALID [2022-04-07 14:01:54,076 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-07 14:01:54,076 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-07 14:01:54,076 INFO L290 TraceCheckUtils]: 7: Hoare triple {40#true} ~cond := #in~cond; {40#true} is VALID [2022-04-07 14:01:54,077 INFO L290 TraceCheckUtils]: 8: Hoare triple {40#true} assume 0 == ~cond;assume false; {41#false} is VALID [2022-04-07 14:01:54,077 INFO L290 TraceCheckUtils]: 9: Hoare triple {41#false} assume true; {41#false} is VALID [2022-04-07 14:01:54,078 INFO L284 TraceCheckUtils]: 10: Hoare quadruple {41#false} {40#true} #90#return; {41#false} is VALID [2022-04-07 14:01:54,078 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-07 14:01:54,078 INFO L290 TraceCheckUtils]: 12: Hoare triple {41#false} ~cond := #in~cond; {41#false} is VALID [2022-04-07 14:01:54,078 INFO L290 TraceCheckUtils]: 13: Hoare triple {41#false} assume 0 == ~cond;assume false; {41#false} is VALID [2022-04-07 14:01:54,078 INFO L290 TraceCheckUtils]: 14: Hoare triple {41#false} assume true; {41#false} is VALID [2022-04-07 14:01:54,079 INFO L284 TraceCheckUtils]: 15: Hoare quadruple {41#false} {41#false} #92#return; {41#false} is VALID [2022-04-07 14:01:54,079 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-07 14:01:54,079 INFO L290 TraceCheckUtils]: 17: Hoare triple {41#false} assume !true; {41#false} is VALID [2022-04-07 14:01:54,080 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-07 14:01:54,080 INFO L290 TraceCheckUtils]: 19: Hoare triple {41#false} ~cond := #in~cond; {41#false} is VALID [2022-04-07 14:01:54,080 INFO L290 TraceCheckUtils]: 20: Hoare triple {41#false} assume 0 == ~cond; {41#false} is VALID [2022-04-07 14:01:54,080 INFO L290 TraceCheckUtils]: 21: Hoare triple {41#false} assume !false; {41#false} is VALID [2022-04-07 14:01:54,081 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-07 14:01:54,081 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-04-07 14:01:54,081 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-07 14:01:54,082 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [894975637] [2022-04-07 14:01:54,082 WARN L310 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2022-04-07 14:01:54,082 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1538894194] [2022-04-07 14:01:54,083 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1538894194] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-07 14:01:54,083 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-07 14:01:54,083 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2022-04-07 14:01:54,085 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1651652245] [2022-04-07 14:01:54,085 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-07 14:01:54,091 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-07 14:01:54,093 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-07 14:01:54,096 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-07 14:01:54,130 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-07 14:01:54,131 INFO L554 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2022-04-07 14:01:54,131 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-04-07 14:01:54,172 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2022-04-07 14:01:54,173 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2022-04-07 14:01:54,174 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-07 14:01:54,244 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-07 14:01:54,244 INFO L93 Difference]: Finished difference Result 67 states and 100 transitions. [2022-04-07 14:01:54,244 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2022-04-07 14:01:54,245 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-07 14:01:54,245 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-07 14:01:54,246 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-07 14:01:54,251 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2 states to 2 states and 100 transitions. [2022-04-07 14:01:54,251 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-07 14:01:54,255 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2 states to 2 states and 100 transitions. [2022-04-07 14:01:54,255 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 2 states and 100 transitions. [2022-04-07 14:01:54,338 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-07 14:01:54,349 INFO L225 Difference]: With dead ends: 67 [2022-04-07 14:01:54,350 INFO L226 Difference]: Without dead ends: 32 [2022-04-07 14:01:54,352 INFO L912 BasicCegarLoop]: 0 DeclaredPredicates, 21 GetRequests, 21 SyntacticMatches, 0 SemanticMatches, 0 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2022-04-07 14:01:54,357 INFO L913 BasicCegarLoop]: 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-07 14:01:54,358 INFO L914 BasicCegarLoop]: 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-07 14:01:54,368 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 32 states. [2022-04-07 14:01:54,380 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 32 to 32. [2022-04-07 14:01:54,380 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-07 14:01:54,381 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-07 14:01:54,382 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-07 14:01:54,382 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-07 14:01:54,388 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-07 14:01:54,389 INFO L93 Difference]: Finished difference Result 32 states and 41 transitions. [2022-04-07 14:01:54,390 INFO L276 IsEmpty]: Start isEmpty. Operand 32 states and 41 transitions. [2022-04-07 14:01:54,392 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-07 14:01:54,392 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-07 14:01:54,397 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-07 14:01:54,399 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-07 14:01:54,405 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-07 14:01:54,405 INFO L93 Difference]: Finished difference Result 32 states and 41 transitions. [2022-04-07 14:01:54,405 INFO L276 IsEmpty]: Start isEmpty. Operand 32 states and 41 transitions. [2022-04-07 14:01:54,406 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-07 14:01:54,406 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-07 14:01:54,406 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-07 14:01:54,406 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-07 14:01:54,406 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-07 14:01:54,410 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 32 states to 32 states and 41 transitions. [2022-04-07 14:01:54,411 INFO L78 Accepts]: Start accepts. Automaton has 32 states and 41 transitions. Word has length 22 [2022-04-07 14:01:54,411 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-07 14:01:54,412 INFO L478 AbstractCegarLoop]: Abstraction has 32 states and 41 transitions. [2022-04-07 14:01:54,412 INFO L479 AbstractCegarLoop]: INTERPOLANT automaton has has 2 states, 2 states have (on average 6.5) internal successors, (13), 2 states have internal predecessors, (13), 2 states have call successors, (5), 2 states have call predecessors, (5), 2 states have return successors, (3), 2 states have call predecessors, (3), 2 states have call successors, (3) [2022-04-07 14:01:54,412 INFO L276 IsEmpty]: Start isEmpty. Operand 32 states and 41 transitions. [2022-04-07 14:01:54,412 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 24 [2022-04-07 14:01:54,413 INFO L491 BasicCegarLoop]: Found error trace [2022-04-07 14:01:54,413 INFO L499 BasicCegarLoop]: trace histogram [2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-07 14:01:54,431 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Ended with exit code 0 [2022-04-07 14:01:54,626 WARN L460 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 2 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable0 [2022-04-07 14:01:54,626 INFO L403 AbstractCegarLoop]: === Iteration 2 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-07 14:01:54,626 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-07 14:01:54,627 INFO L85 PathProgramCache]: Analyzing trace with hash -155606603, now seen corresponding path program 1 times [2022-04-07 14:01:54,627 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-07 14:01:54,627 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [238408334] [2022-04-07 14:01:54,627 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-07 14:01:54,627 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-07 14:01:54,651 ERROR L245 FreeRefinementEngine]: Caught known exception: Unsupported non-linear arithmetic [2022-04-07 14:01:54,651 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [247164806] [2022-04-07 14:01:54,651 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-07 14:01:54,651 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-07 14:01:54,652 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-04-07 14:01:54,659 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-07 14:01:54,660 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-07 14:01:54,700 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-07 14:01:54,700 INFO L263 TraceCheckSpWp]: Trace formula consists of 93 conjuncts, 5 conjunts are in the unsatisfiable core [2022-04-07 14:01:54,713 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-07 14:01:54,714 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-04-07 14:01:54,888 INFO L272 TraceCheckUtils]: 0: Hoare triple {307#true} call ULTIMATE.init(); {307#true} is VALID [2022-04-07 14:01:54,889 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-07 14:01:54,889 INFO L290 TraceCheckUtils]: 2: Hoare triple {315#(<= ~counter~0 0)} assume true; {315#(<= ~counter~0 0)} is VALID [2022-04-07 14:01:54,890 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {315#(<= ~counter~0 0)} {307#true} #102#return; {315#(<= ~counter~0 0)} is VALID [2022-04-07 14:01:54,892 INFO L272 TraceCheckUtils]: 4: Hoare triple {315#(<= ~counter~0 0)} call #t~ret9 := main(); {315#(<= ~counter~0 0)} is VALID [2022-04-07 14:01:54,892 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-07 14:01:54,893 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-07 14:01:54,894 INFO L290 TraceCheckUtils]: 7: Hoare triple {315#(<= ~counter~0 0)} ~cond := #in~cond; {315#(<= ~counter~0 0)} is VALID [2022-04-07 14:01:54,894 INFO L290 TraceCheckUtils]: 8: Hoare triple {315#(<= ~counter~0 0)} assume !(0 == ~cond); {315#(<= ~counter~0 0)} is VALID [2022-04-07 14:01:54,894 INFO L290 TraceCheckUtils]: 9: Hoare triple {315#(<= ~counter~0 0)} assume true; {315#(<= ~counter~0 0)} is VALID [2022-04-07 14:01:54,895 INFO L284 TraceCheckUtils]: 10: Hoare quadruple {315#(<= ~counter~0 0)} {315#(<= ~counter~0 0)} #90#return; {315#(<= ~counter~0 0)} is VALID [2022-04-07 14:01:54,895 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-07 14:01:54,896 INFO L290 TraceCheckUtils]: 12: Hoare triple {315#(<= ~counter~0 0)} ~cond := #in~cond; {315#(<= ~counter~0 0)} is VALID [2022-04-07 14:01:54,896 INFO L290 TraceCheckUtils]: 13: Hoare triple {315#(<= ~counter~0 0)} assume !(0 == ~cond); {315#(<= ~counter~0 0)} is VALID [2022-04-07 14:01:54,896 INFO L290 TraceCheckUtils]: 14: Hoare triple {315#(<= ~counter~0 0)} assume true; {315#(<= ~counter~0 0)} is VALID [2022-04-07 14:01:54,897 INFO L284 TraceCheckUtils]: 15: Hoare quadruple {315#(<= ~counter~0 0)} {315#(<= ~counter~0 0)} #92#return; {315#(<= ~counter~0 0)} is VALID [2022-04-07 14:01:54,897 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-07 14:01:54,898 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-07 14:01:54,898 INFO L290 TraceCheckUtils]: 18: Hoare triple {364#(<= |main_#t~post6| 0)} assume !(#t~post6 < 5);havoc #t~post6; {308#false} is VALID [2022-04-07 14:01:54,899 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-07 14:01:54,899 INFO L290 TraceCheckUtils]: 20: Hoare triple {308#false} ~cond := #in~cond; {308#false} is VALID [2022-04-07 14:01:54,899 INFO L290 TraceCheckUtils]: 21: Hoare triple {308#false} assume 0 == ~cond; {308#false} is VALID [2022-04-07 14:01:54,899 INFO L290 TraceCheckUtils]: 22: Hoare triple {308#false} assume !false; {308#false} is VALID [2022-04-07 14:01:54,900 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-07 14:01:54,900 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-04-07 14:01:54,900 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-07 14:01:54,900 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [238408334] [2022-04-07 14:01:54,900 WARN L310 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2022-04-07 14:01:54,900 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [247164806] [2022-04-07 14:01:54,901 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [247164806] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-07 14:01:54,901 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-07 14:01:54,901 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-04-07 14:01:54,901 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2055285340] [2022-04-07 14:01:54,901 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-07 14:01:54,903 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-07 14:01:54,903 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-07 14:01:54,903 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-07 14:01:54,919 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-07 14:01:54,920 INFO L554 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-04-07 14:01:54,920 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-04-07 14:01:54,920 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-04-07 14:01:54,920 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-04-07 14:01:54,921 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-07 14:01:55,000 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-07 14:01:55,000 INFO L93 Difference]: Finished difference Result 41 states and 50 transitions. [2022-04-07 14:01:55,000 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-04-07 14:01:55,000 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-07 14:01:55,001 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-07 14:01:55,001 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 4 states, 4 states have (on average 3.0) internal successors, (12), 3 states have internal predecessors, (12), 3 states have call successors, (5), 3 states have call predecessors, (5), 1 states have return successors, (3), 1 states have call predecessors, (3), 2 states have call successors, (3) [2022-04-07 14:01:55,007 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 50 transitions. [2022-04-07 14:01:55,007 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-07 14:01:55,008 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 50 transitions. [2022-04-07 14:01:55,009 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 4 states and 50 transitions. [2022-04-07 14:01:55,045 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-07 14:01:55,046 INFO L225 Difference]: With dead ends: 41 [2022-04-07 14:01:55,046 INFO L226 Difference]: Without dead ends: 34 [2022-04-07 14:01:55,046 INFO L912 BasicCegarLoop]: 0 DeclaredPredicates, 22 GetRequests, 20 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-04-07 14:01:55,047 INFO L913 BasicCegarLoop]: 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-07 14:01:55,047 INFO L914 BasicCegarLoop]: 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-07 14:01:55,048 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 34 states. [2022-04-07 14:01:55,053 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 34 to 34. [2022-04-07 14:01:55,053 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-07 14:01:55,053 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-07 14:01:55,054 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-07 14:01:55,054 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-07 14:01:55,056 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-07 14:01:55,056 INFO L93 Difference]: Finished difference Result 34 states and 43 transitions. [2022-04-07 14:01:55,056 INFO L276 IsEmpty]: Start isEmpty. Operand 34 states and 43 transitions. [2022-04-07 14:01:55,056 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-07 14:01:55,056 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-07 14:01:55,056 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-07 14:01:55,057 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-07 14:01:55,058 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-07 14:01:55,058 INFO L93 Difference]: Finished difference Result 34 states and 43 transitions. [2022-04-07 14:01:55,058 INFO L276 IsEmpty]: Start isEmpty. Operand 34 states and 43 transitions. [2022-04-07 14:01:55,059 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-07 14:01:55,059 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-07 14:01:55,059 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-07 14:01:55,059 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-07 14:01:55,059 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-07 14:01:55,060 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 34 states to 34 states and 43 transitions. [2022-04-07 14:01:55,061 INFO L78 Accepts]: Start accepts. Automaton has 34 states and 43 transitions. Word has length 23 [2022-04-07 14:01:55,061 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-07 14:01:55,061 INFO L478 AbstractCegarLoop]: Abstraction has 34 states and 43 transitions. [2022-04-07 14:01:55,061 INFO L479 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 3.0) internal successors, (12), 3 states have internal predecessors, (12), 3 states have call successors, (5), 3 states have call predecessors, (5), 1 states have return successors, (3), 1 states have call predecessors, (3), 2 states have call successors, (3) [2022-04-07 14:01:55,061 INFO L276 IsEmpty]: Start isEmpty. Operand 34 states and 43 transitions. [2022-04-07 14:01:55,061 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 24 [2022-04-07 14:01:55,061 INFO L491 BasicCegarLoop]: Found error trace [2022-04-07 14:01:55,062 INFO L499 BasicCegarLoop]: trace histogram [2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-07 14:01:55,080 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-07 14:01:55,278 WARN L460 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 3 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable1 [2022-04-07 14:01:55,278 INFO L403 AbstractCegarLoop]: === Iteration 3 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-07 14:01:55,279 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-07 14:01:55,279 INFO L85 PathProgramCache]: Analyzing trace with hash -153938307, now seen corresponding path program 1 times [2022-04-07 14:01:55,279 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-07 14:01:55,279 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1846523340] [2022-04-07 14:01:55,280 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-07 14:01:55,280 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-07 14:01:55,291 ERROR L245 FreeRefinementEngine]: Caught known exception: Unsupported non-linear arithmetic [2022-04-07 14:01:55,291 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [1732359218] [2022-04-07 14:01:55,291 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-07 14:01:55,291 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-07 14:01:55,292 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-04-07 14:01:55,292 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-07 14:01:55,293 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-07 14:01:55,330 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-07 14:01:55,331 INFO L263 TraceCheckSpWp]: Trace formula consists of 93 conjuncts, 13 conjunts are in the unsatisfiable core [2022-04-07 14:01:55,338 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-07 14:01:55,339 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-04-07 14:01:55,683 INFO L272 TraceCheckUtils]: 0: Hoare triple {554#true} call ULTIMATE.init(); {554#true} is VALID [2022-04-07 14:01:55,683 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-07 14:01:55,683 INFO L290 TraceCheckUtils]: 2: Hoare triple {554#true} assume true; {554#true} is VALID [2022-04-07 14:01:55,683 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {554#true} {554#true} #102#return; {554#true} is VALID [2022-04-07 14:01:55,684 INFO L272 TraceCheckUtils]: 4: Hoare triple {554#true} call #t~ret9 := main(); {554#true} is VALID [2022-04-07 14:01:55,684 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-07 14:01:55,684 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-07 14:01:55,684 INFO L290 TraceCheckUtils]: 7: Hoare triple {554#true} ~cond := #in~cond; {554#true} is VALID [2022-04-07 14:01:55,684 INFO L290 TraceCheckUtils]: 8: Hoare triple {554#true} assume !(0 == ~cond); {554#true} is VALID [2022-04-07 14:01:55,684 INFO L290 TraceCheckUtils]: 9: Hoare triple {554#true} assume true; {554#true} is VALID [2022-04-07 14:01:55,684 INFO L284 TraceCheckUtils]: 10: Hoare quadruple {554#true} {554#true} #90#return; {554#true} is VALID [2022-04-07 14:01:55,684 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-07 14:01:55,684 INFO L290 TraceCheckUtils]: 12: Hoare triple {554#true} ~cond := #in~cond; {554#true} is VALID [2022-04-07 14:01:55,685 INFO L290 TraceCheckUtils]: 13: Hoare triple {554#true} assume !(0 == ~cond); {554#true} is VALID [2022-04-07 14:01:55,685 INFO L290 TraceCheckUtils]: 14: Hoare triple {554#true} assume true; {554#true} is VALID [2022-04-07 14:01:55,685 INFO L284 TraceCheckUtils]: 15: Hoare quadruple {554#true} {554#true} #92#return; {554#true} is VALID [2022-04-07 14:01:57,688 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-07 14:01:57,689 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-07 14:01:57,689 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-07 14:01:58,921 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-07 14:01:58,922 INFO L290 TraceCheckUtils]: 20: Hoare triple {617#(<= 1 |__VERIFIER_assert_#in~cond|)} ~cond := #in~cond; {621#(<= 1 __VERIFIER_assert_~cond)} is VALID [2022-04-07 14:01:58,922 INFO L290 TraceCheckUtils]: 21: Hoare triple {621#(<= 1 __VERIFIER_assert_~cond)} assume 0 == ~cond; {555#false} is VALID [2022-04-07 14:01:58,923 INFO L290 TraceCheckUtils]: 22: Hoare triple {555#false} assume !false; {555#false} is VALID [2022-04-07 14:01:58,923 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-07 14:01:58,923 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-04-07 14:01:58,923 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-07 14:01:58,923 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1846523340] [2022-04-07 14:01:58,923 WARN L310 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2022-04-07 14:01:58,923 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1732359218] [2022-04-07 14:01:58,923 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1732359218] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-07 14:01:58,924 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-07 14:01:58,924 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2022-04-07 14:01:58,924 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [744534081] [2022-04-07 14:01:58,924 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-07 14:01:58,924 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-07 14:01:58,924 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-07 14:01:58,925 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-07 14:01:59,693 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-07 14:01:59,693 INFO L554 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-04-07 14:01:59,694 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-04-07 14:01:59,694 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-04-07 14:01:59,694 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2022-04-07 14:01:59,694 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-07 14:02:07,393 WARN L534 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.37s for a HTC check with result INVALID. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=true, quantifiers [] [2022-04-07 14:02:11,021 WARN L534 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.66s for a HTC check with result VALID. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=true, quantifiers [] [2022-04-07 14:02:11,077 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-07 14:02:11,078 INFO L93 Difference]: Finished difference Result 53 states and 70 transitions. [2022-04-07 14:02:11,078 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-04-07 14:02:11,078 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-07 14:02:11,078 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-07 14:02:11,078 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-07 14:02:11,080 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 68 transitions. [2022-04-07 14:02:11,080 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-07 14:02:11,081 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 68 transitions. [2022-04-07 14:02:11,081 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 5 states and 68 transitions. [2022-04-07 14:02:19,693 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 68 edges. 64 inductive. 0 not inductive. 4 times theorem prover too weak to decide inductivity. [2022-04-07 14:02:19,695 INFO L225 Difference]: With dead ends: 53 [2022-04-07 14:02:19,695 INFO L226 Difference]: Without dead ends: 51 [2022-04-07 14:02:19,695 INFO L912 BasicCegarLoop]: 0 DeclaredPredicates, 23 GetRequests, 19 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2022-04-07 14:02:19,697 INFO L913 BasicCegarLoop]: 33 mSDtfsCounter, 16 mSDsluCounter, 83 mSDsCounter, 0 mSdLazyCounter, 56 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 6.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 19 SdHoareTripleChecker+Valid, 116 SdHoareTripleChecker+Invalid, 59 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 56 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 6.2s IncrementalHoareTripleChecker+Time [2022-04-07 14:02:19,697 INFO L914 BasicCegarLoop]: SdHoareTripleChecker [19 Valid, 116 Invalid, 59 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 56 Invalid, 0 Unknown, 0 Unchecked, 6.2s Time] [2022-04-07 14:02:19,697 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 51 states. [2022-04-07 14:02:19,709 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 51 to 50. [2022-04-07 14:02:19,709 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-07 14:02:19,710 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-07 14:02:19,710 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-07 14:02:19,710 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-07 14:02:19,712 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-07 14:02:19,712 INFO L93 Difference]: Finished difference Result 51 states and 68 transitions. [2022-04-07 14:02:19,713 INFO L276 IsEmpty]: Start isEmpty. Operand 51 states and 68 transitions. [2022-04-07 14:02:19,713 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-07 14:02:19,713 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-07 14:02:19,713 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-07 14:02:19,714 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-07 14:02:19,718 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-07 14:02:19,718 INFO L93 Difference]: Finished difference Result 51 states and 68 transitions. [2022-04-07 14:02:19,718 INFO L276 IsEmpty]: Start isEmpty. Operand 51 states and 68 transitions. [2022-04-07 14:02:19,721 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-07 14:02:19,721 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-07 14:02:19,721 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-07 14:02:19,721 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-07 14:02:19,721 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-07 14:02:19,723 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 50 states to 50 states and 67 transitions. [2022-04-07 14:02:19,723 INFO L78 Accepts]: Start accepts. Automaton has 50 states and 67 transitions. Word has length 23 [2022-04-07 14:02:19,723 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-07 14:02:19,723 INFO L478 AbstractCegarLoop]: Abstraction has 50 states and 67 transitions. [2022-04-07 14:02:19,724 INFO L479 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 2.4) internal successors, (12), 4 states have internal predecessors, (12), 2 states have call successors, (5), 2 states have call predecessors, (5), 1 states have return successors, (3), 1 states have call predecessors, (3), 1 states have call successors, (3) [2022-04-07 14:02:19,724 INFO L276 IsEmpty]: Start isEmpty. Operand 50 states and 67 transitions. [2022-04-07 14:02:19,724 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 30 [2022-04-07 14:02:19,724 INFO L491 BasicCegarLoop]: Found error trace [2022-04-07 14:02:19,724 INFO L499 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-07 14:02:19,740 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-07 14:02:19,925 WARN L460 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2,4 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-07 14:02:19,925 INFO L403 AbstractCegarLoop]: === Iteration 4 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-07 14:02:19,926 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-07 14:02:19,926 INFO L85 PathProgramCache]: Analyzing trace with hash -1676885497, now seen corresponding path program 1 times [2022-04-07 14:02:19,926 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-07 14:02:19,926 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1554047267] [2022-04-07 14:02:19,926 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-07 14:02:19,926 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-07 14:02:19,938 ERROR L245 FreeRefinementEngine]: Caught known exception: Unsupported non-linear arithmetic [2022-04-07 14:02:19,939 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [1378909014] [2022-04-07 14:02:19,939 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-07 14:02:19,939 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-07 14:02:19,939 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-04-07 14:02:19,940 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-07 14:02:19,940 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-07 14:02:19,974 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-07 14:02:19,975 INFO L263 TraceCheckSpWp]: Trace formula consists of 104 conjuncts, 10 conjunts are in the unsatisfiable core [2022-04-07 14:02:19,982 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-07 14:02:19,983 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-04-07 14:02:20,162 INFO L272 TraceCheckUtils]: 0: Hoare triple {877#true} call ULTIMATE.init(); {877#true} is VALID [2022-04-07 14:02:20,162 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-07 14:02:20,162 INFO L290 TraceCheckUtils]: 2: Hoare triple {877#true} assume true; {877#true} is VALID [2022-04-07 14:02:20,163 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {877#true} {877#true} #102#return; {877#true} is VALID [2022-04-07 14:02:20,163 INFO L272 TraceCheckUtils]: 4: Hoare triple {877#true} call #t~ret9 := main(); {877#true} is VALID [2022-04-07 14:02:20,163 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-07 14:02:20,163 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-07 14:02:20,163 INFO L290 TraceCheckUtils]: 7: Hoare triple {877#true} ~cond := #in~cond; {877#true} is VALID [2022-04-07 14:02:20,163 INFO L290 TraceCheckUtils]: 8: Hoare triple {877#true} assume !(0 == ~cond); {877#true} is VALID [2022-04-07 14:02:20,163 INFO L290 TraceCheckUtils]: 9: Hoare triple {877#true} assume true; {877#true} is VALID [2022-04-07 14:02:20,163 INFO L284 TraceCheckUtils]: 10: Hoare quadruple {877#true} {877#true} #90#return; {877#true} is VALID [2022-04-07 14:02:20,163 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-07 14:02:20,164 INFO L290 TraceCheckUtils]: 12: Hoare triple {877#true} ~cond := #in~cond; {877#true} is VALID [2022-04-07 14:02:20,164 INFO L290 TraceCheckUtils]: 13: Hoare triple {877#true} assume !(0 == ~cond); {877#true} is VALID [2022-04-07 14:02:20,164 INFO L290 TraceCheckUtils]: 14: Hoare triple {877#true} assume true; {877#true} is VALID [2022-04-07 14:02:20,164 INFO L284 TraceCheckUtils]: 15: Hoare quadruple {877#true} {877#true} #92#return; {877#true} is VALID [2022-04-07 14:02:20,164 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-07 14:02:20,164 INFO L290 TraceCheckUtils]: 17: Hoare triple {877#true} #t~post6 := ~counter~0;~counter~0 := 1 + #t~post6; {877#true} is VALID [2022-04-07 14:02:20,164 INFO L290 TraceCheckUtils]: 18: Hoare triple {877#true} assume !!(#t~post6 < 5);havoc #t~post6; {877#true} is VALID [2022-04-07 14:02:20,164 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-07 14:02:20,165 INFO L290 TraceCheckUtils]: 20: Hoare triple {877#true} ~cond := #in~cond; {942#(= |__VERIFIER_assert_#in~cond| __VERIFIER_assert_~cond)} is VALID [2022-04-07 14:02:20,165 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-07 14:02:20,165 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-07 14:02:20,166 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-07 14:02:20,167 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-07 14:02:20,168 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-07 14:02:20,168 INFO L290 TraceCheckUtils]: 26: Hoare triple {961#(<= 1 |__VERIFIER_assert_#in~cond|)} ~cond := #in~cond; {965#(<= 1 __VERIFIER_assert_~cond)} is VALID [2022-04-07 14:02:20,168 INFO L290 TraceCheckUtils]: 27: Hoare triple {965#(<= 1 __VERIFIER_assert_~cond)} assume 0 == ~cond; {878#false} is VALID [2022-04-07 14:02:20,168 INFO L290 TraceCheckUtils]: 28: Hoare triple {878#false} assume !false; {878#false} is VALID [2022-04-07 14:02:20,169 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-07 14:02:20,169 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-04-07 14:02:20,520 INFO L290 TraceCheckUtils]: 28: Hoare triple {878#false} assume !false; {878#false} is VALID [2022-04-07 14:02:20,521 INFO L290 TraceCheckUtils]: 27: Hoare triple {965#(<= 1 __VERIFIER_assert_~cond)} assume 0 == ~cond; {878#false} is VALID [2022-04-07 14:02:20,521 INFO L290 TraceCheckUtils]: 26: Hoare triple {961#(<= 1 |__VERIFIER_assert_#in~cond|)} ~cond := #in~cond; {965#(<= 1 __VERIFIER_assert_~cond)} is VALID [2022-04-07 14:02:20,522 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-07 14:02:20,522 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-07 14:02:20,523 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-07 14:02:20,535 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-07 14:02:20,536 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-07 14:02:20,536 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-07 14:02:20,536 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-07 14:02:20,536 INFO L290 TraceCheckUtils]: 18: Hoare triple {877#true} assume !!(#t~post6 < 5);havoc #t~post6; {877#true} is VALID [2022-04-07 14:02:20,536 INFO L290 TraceCheckUtils]: 17: Hoare triple {877#true} #t~post6 := ~counter~0;~counter~0 := 1 + #t~post6; {877#true} is VALID [2022-04-07 14:02:20,537 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-07 14:02:20,537 INFO L284 TraceCheckUtils]: 15: Hoare quadruple {877#true} {877#true} #92#return; {877#true} is VALID [2022-04-07 14:02:20,537 INFO L290 TraceCheckUtils]: 14: Hoare triple {877#true} assume true; {877#true} is VALID [2022-04-07 14:02:20,537 INFO L290 TraceCheckUtils]: 13: Hoare triple {877#true} assume !(0 == ~cond); {877#true} is VALID [2022-04-07 14:02:20,537 INFO L290 TraceCheckUtils]: 12: Hoare triple {877#true} ~cond := #in~cond; {877#true} is VALID [2022-04-07 14:02:20,537 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-07 14:02:20,537 INFO L284 TraceCheckUtils]: 10: Hoare quadruple {877#true} {877#true} #90#return; {877#true} is VALID [2022-04-07 14:02:20,538 INFO L290 TraceCheckUtils]: 9: Hoare triple {877#true} assume true; {877#true} is VALID [2022-04-07 14:02:20,539 INFO L290 TraceCheckUtils]: 8: Hoare triple {877#true} assume !(0 == ~cond); {877#true} is VALID [2022-04-07 14:02:20,539 INFO L290 TraceCheckUtils]: 7: Hoare triple {877#true} ~cond := #in~cond; {877#true} is VALID [2022-04-07 14:02:20,540 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-07 14:02:20,541 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-07 14:02:20,541 INFO L272 TraceCheckUtils]: 4: Hoare triple {877#true} call #t~ret9 := main(); {877#true} is VALID [2022-04-07 14:02:20,542 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {877#true} {877#true} #102#return; {877#true} is VALID [2022-04-07 14:02:20,542 INFO L290 TraceCheckUtils]: 2: Hoare triple {877#true} assume true; {877#true} is VALID [2022-04-07 14:02:20,542 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-07 14:02:20,542 INFO L272 TraceCheckUtils]: 0: Hoare triple {877#true} call ULTIMATE.init(); {877#true} is VALID [2022-04-07 14:02:20,542 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-07 14:02:20,543 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-07 14:02:20,543 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1554047267] [2022-04-07 14:02:20,543 WARN L310 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2022-04-07 14:02:20,543 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1378909014] [2022-04-07 14:02:20,543 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1378909014] provided 0 perfect and 2 imperfect interpolant sequences [2022-04-07 14:02:20,543 INFO L184 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2022-04-07 14:02:20,543 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [8, 8] total 10 [2022-04-07 14:02:20,543 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [15593816] [2022-04-07 14:02:20,543 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2022-04-07 14:02:20,544 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-07 14:02:20,544 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-07 14:02:20,544 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-07 14:02:20,566 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-07 14:02:20,566 INFO L554 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2022-04-07 14:02:20,566 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-04-07 14:02:20,567 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2022-04-07 14:02:20,567 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=23, Invalid=67, Unknown=0, NotChecked=0, Total=90 [2022-04-07 14:02:20,567 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-07 14:02:21,049 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-07 14:02:21,049 INFO L93 Difference]: Finished difference Result 57 states and 73 transitions. [2022-04-07 14:02:21,049 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2022-04-07 14:02:21,049 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-07 14:02:21,049 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-07 14:02:21,049 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-07 14:02:21,051 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8 states to 8 states and 47 transitions. [2022-04-07 14:02:21,051 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-07 14:02:21,052 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8 states to 8 states and 47 transitions. [2022-04-07 14:02:21,052 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 8 states and 47 transitions. [2022-04-07 14:02:21,086 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-07 14:02:21,087 INFO L225 Difference]: With dead ends: 57 [2022-04-07 14:02:21,087 INFO L226 Difference]: Without dead ends: 52 [2022-04-07 14:02:21,087 INFO L912 BasicCegarLoop]: 0 DeclaredPredicates, 60 GetRequests, 48 SyntacticMatches, 1 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 10 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=41, Invalid=115, Unknown=0, NotChecked=0, Total=156 [2022-04-07 14:02:21,088 INFO L913 BasicCegarLoop]: 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-07 14:02:21,088 INFO L914 BasicCegarLoop]: 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-07 14:02:21,088 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 52 states. [2022-04-07 14:02:21,098 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 52 to 36. [2022-04-07 14:02:21,098 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-07 14:02:21,099 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-07 14:02:21,099 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-07 14:02:21,099 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-07 14:02:21,101 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-07 14:02:21,101 INFO L93 Difference]: Finished difference Result 52 states and 66 transitions. [2022-04-07 14:02:21,101 INFO L276 IsEmpty]: Start isEmpty. Operand 52 states and 66 transitions. [2022-04-07 14:02:21,101 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-07 14:02:21,101 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-07 14:02:21,102 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-07 14:02:21,102 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-07 14:02:21,104 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-07 14:02:21,104 INFO L93 Difference]: Finished difference Result 52 states and 66 transitions. [2022-04-07 14:02:21,104 INFO L276 IsEmpty]: Start isEmpty. Operand 52 states and 66 transitions. [2022-04-07 14:02:21,104 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-07 14:02:21,104 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-07 14:02:21,104 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-07 14:02:21,104 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-07 14:02:21,105 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-07 14:02:21,105 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 36 states to 36 states and 43 transitions. [2022-04-07 14:02:21,106 INFO L78 Accepts]: Start accepts. Automaton has 36 states and 43 transitions. Word has length 29 [2022-04-07 14:02:21,106 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-07 14:02:21,106 INFO L478 AbstractCegarLoop]: Abstraction has 36 states and 43 transitions. [2022-04-07 14:02:21,106 INFO L479 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 9 states have (on average 2.111111111111111) internal successors, (19), 7 states have internal predecessors, (19), 2 states have call successors, (6), 2 states have call predecessors, (6), 2 states have return successors, (5), 3 states have call predecessors, (5), 1 states have call successors, (5) [2022-04-07 14:02:21,106 INFO L276 IsEmpty]: Start isEmpty. Operand 36 states and 43 transitions. [2022-04-07 14:02:21,107 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 36 [2022-04-07 14:02:21,107 INFO L491 BasicCegarLoop]: Found error trace [2022-04-07 14:02:21,107 INFO L499 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-07 14:02:21,143 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-07 14:02:21,319 WARN L460 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3,5 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-07 14:02:21,319 INFO L403 AbstractCegarLoop]: === Iteration 5 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-07 14:02:21,320 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-07 14:02:21,320 INFO L85 PathProgramCache]: Analyzing trace with hash 1154059858, now seen corresponding path program 1 times [2022-04-07 14:02:21,320 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-07 14:02:21,320 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [984889756] [2022-04-07 14:02:21,320 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-07 14:02:21,320 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-07 14:02:21,330 ERROR L245 FreeRefinementEngine]: Caught known exception: Unsupported non-linear arithmetic [2022-04-07 14:02:21,330 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [1680372701] [2022-04-07 14:02:21,330 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-07 14:02:21,330 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-07 14:02:21,331 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-04-07 14:02:21,338 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-07 14:02:21,339 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-07 14:02:21,374 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-07 14:02:21,375 INFO L263 TraceCheckSpWp]: Trace formula consists of 118 conjuncts, 7 conjunts are in the unsatisfiable core [2022-04-07 14:02:21,386 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-07 14:02:21,392 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-04-07 14:02:21,537 INFO L272 TraceCheckUtils]: 0: Hoare triple {1302#true} call ULTIMATE.init(); {1302#true} is VALID [2022-04-07 14:02:21,538 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-07 14:02:21,538 INFO L290 TraceCheckUtils]: 2: Hoare triple {1310#(<= ~counter~0 0)} assume true; {1310#(<= ~counter~0 0)} is VALID [2022-04-07 14:02:21,539 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {1310#(<= ~counter~0 0)} {1302#true} #102#return; {1310#(<= ~counter~0 0)} is VALID [2022-04-07 14:02:21,539 INFO L272 TraceCheckUtils]: 4: Hoare triple {1310#(<= ~counter~0 0)} call #t~ret9 := main(); {1310#(<= ~counter~0 0)} is VALID [2022-04-07 14:02:21,539 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-07 14:02:21,540 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-07 14:02:21,540 INFO L290 TraceCheckUtils]: 7: Hoare triple {1310#(<= ~counter~0 0)} ~cond := #in~cond; {1310#(<= ~counter~0 0)} is VALID [2022-04-07 14:02:21,540 INFO L290 TraceCheckUtils]: 8: Hoare triple {1310#(<= ~counter~0 0)} assume !(0 == ~cond); {1310#(<= ~counter~0 0)} is VALID [2022-04-07 14:02:21,540 INFO L290 TraceCheckUtils]: 9: Hoare triple {1310#(<= ~counter~0 0)} assume true; {1310#(<= ~counter~0 0)} is VALID [2022-04-07 14:02:21,541 INFO L284 TraceCheckUtils]: 10: Hoare quadruple {1310#(<= ~counter~0 0)} {1310#(<= ~counter~0 0)} #90#return; {1310#(<= ~counter~0 0)} is VALID [2022-04-07 14:02:21,541 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-07 14:02:21,542 INFO L290 TraceCheckUtils]: 12: Hoare triple {1310#(<= ~counter~0 0)} ~cond := #in~cond; {1310#(<= ~counter~0 0)} is VALID [2022-04-07 14:02:21,542 INFO L290 TraceCheckUtils]: 13: Hoare triple {1310#(<= ~counter~0 0)} assume !(0 == ~cond); {1310#(<= ~counter~0 0)} is VALID [2022-04-07 14:02:21,542 INFO L290 TraceCheckUtils]: 14: Hoare triple {1310#(<= ~counter~0 0)} assume true; {1310#(<= ~counter~0 0)} is VALID [2022-04-07 14:02:21,542 INFO L284 TraceCheckUtils]: 15: Hoare quadruple {1310#(<= ~counter~0 0)} {1310#(<= ~counter~0 0)} #92#return; {1310#(<= ~counter~0 0)} is VALID [2022-04-07 14:02:21,543 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-07 14:02:21,543 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-07 14:02:21,544 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-07 14:02:21,544 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-07 14:02:21,544 INFO L290 TraceCheckUtils]: 20: Hoare triple {1359#(<= ~counter~0 1)} ~cond := #in~cond; {1359#(<= ~counter~0 1)} is VALID [2022-04-07 14:02:21,545 INFO L290 TraceCheckUtils]: 21: Hoare triple {1359#(<= ~counter~0 1)} assume !(0 == ~cond); {1359#(<= ~counter~0 1)} is VALID [2022-04-07 14:02:21,545 INFO L290 TraceCheckUtils]: 22: Hoare triple {1359#(<= ~counter~0 1)} assume true; {1359#(<= ~counter~0 1)} is VALID [2022-04-07 14:02:21,545 INFO L284 TraceCheckUtils]: 23: Hoare quadruple {1359#(<= ~counter~0 1)} {1359#(<= ~counter~0 1)} #94#return; {1359#(<= ~counter~0 1)} is VALID [2022-04-07 14:02:21,546 INFO L290 TraceCheckUtils]: 24: Hoare triple {1359#(<= ~counter~0 1)} assume !!(0 != ~r~0); {1359#(<= ~counter~0 1)} is VALID [2022-04-07 14:02:21,546 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-07 14:02:21,546 INFO L290 TraceCheckUtils]: 26: Hoare triple {1384#(<= |main_#t~post7| 1)} assume !(#t~post7 < 5);havoc #t~post7; {1303#false} is VALID [2022-04-07 14:02:21,547 INFO L290 TraceCheckUtils]: 27: Hoare triple {1303#false} #t~post8 := ~counter~0;~counter~0 := 1 + #t~post8; {1303#false} is VALID [2022-04-07 14:02:21,547 INFO L290 TraceCheckUtils]: 28: Hoare triple {1303#false} assume !(#t~post8 < 5);havoc #t~post8; {1303#false} is VALID [2022-04-07 14:02:21,547 INFO L290 TraceCheckUtils]: 29: Hoare triple {1303#false} #t~post6 := ~counter~0;~counter~0 := 1 + #t~post6; {1303#false} is VALID [2022-04-07 14:02:21,547 INFO L290 TraceCheckUtils]: 30: Hoare triple {1303#false} assume !(#t~post6 < 5);havoc #t~post6; {1303#false} is VALID [2022-04-07 14:02:21,547 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-07 14:02:21,547 INFO L290 TraceCheckUtils]: 32: Hoare triple {1303#false} ~cond := #in~cond; {1303#false} is VALID [2022-04-07 14:02:21,547 INFO L290 TraceCheckUtils]: 33: Hoare triple {1303#false} assume 0 == ~cond; {1303#false} is VALID [2022-04-07 14:02:21,547 INFO L290 TraceCheckUtils]: 34: Hoare triple {1303#false} assume !false; {1303#false} is VALID [2022-04-07 14:02:21,547 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-07 14:02:21,547 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-04-07 14:02:21,548 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-07 14:02:21,548 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [984889756] [2022-04-07 14:02:21,548 WARN L310 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2022-04-07 14:02:21,548 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1680372701] [2022-04-07 14:02:21,548 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1680372701] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-07 14:02:21,548 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-07 14:02:21,548 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2022-04-07 14:02:21,548 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [727541185] [2022-04-07 14:02:21,548 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-07 14:02:21,549 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-07 14:02:21,549 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-07 14:02:21,550 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-07 14:02:21,568 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-07 14:02:21,568 INFO L554 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-04-07 14:02:21,568 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-04-07 14:02:21,569 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-04-07 14:02:21,569 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2022-04-07 14:02:21,569 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-07 14:02:21,680 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-07 14:02:21,680 INFO L93 Difference]: Finished difference Result 65 states and 79 transitions. [2022-04-07 14:02:21,681 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-04-07 14:02:21,681 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-07 14:02:21,681 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-07 14:02:21,681 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-07 14:02:21,683 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 77 transitions. [2022-04-07 14:02:21,683 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-07 14:02:21,685 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 77 transitions. [2022-04-07 14:02:21,685 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 5 states and 77 transitions. [2022-04-07 14:02:21,735 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-07 14:02:21,736 INFO L225 Difference]: With dead ends: 65 [2022-04-07 14:02:21,736 INFO L226 Difference]: Without dead ends: 44 [2022-04-07 14:02:21,736 INFO L912 BasicCegarLoop]: 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-07 14:02:21,737 INFO L913 BasicCegarLoop]: 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-07 14:02:21,737 INFO L914 BasicCegarLoop]: 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-07 14:02:21,738 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 44 states. [2022-04-07 14:02:21,757 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 44 to 44. [2022-04-07 14:02:21,757 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-07 14:02:21,757 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-07 14:02:21,758 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-07 14:02:21,758 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-07 14:02:21,759 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-07 14:02:21,759 INFO L93 Difference]: Finished difference Result 44 states and 51 transitions. [2022-04-07 14:02:21,759 INFO L276 IsEmpty]: Start isEmpty. Operand 44 states and 51 transitions. [2022-04-07 14:02:21,760 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-07 14:02:21,760 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-07 14:02:21,760 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-07 14:02:21,760 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-07 14:02:21,761 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-07 14:02:21,762 INFO L93 Difference]: Finished difference Result 44 states and 51 transitions. [2022-04-07 14:02:21,762 INFO L276 IsEmpty]: Start isEmpty. Operand 44 states and 51 transitions. [2022-04-07 14:02:21,762 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-07 14:02:21,762 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-07 14:02:21,762 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-07 14:02:21,762 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-07 14:02:21,762 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-07 14:02:21,763 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 44 states to 44 states and 51 transitions. [2022-04-07 14:02:21,763 INFO L78 Accepts]: Start accepts. Automaton has 44 states and 51 transitions. Word has length 35 [2022-04-07 14:02:21,763 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-07 14:02:21,763 INFO L478 AbstractCegarLoop]: Abstraction has 44 states and 51 transitions. [2022-04-07 14:02:21,764 INFO L479 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-07 14:02:21,764 INFO L276 IsEmpty]: Start isEmpty. Operand 44 states and 51 transitions. [2022-04-07 14:02:21,764 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 42 [2022-04-07 14:02:21,764 INFO L491 BasicCegarLoop]: Found error trace [2022-04-07 14:02:21,764 INFO L499 BasicCegarLoop]: 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-07 14:02:21,783 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-07 14:02:21,981 WARN L460 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4,6 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-07 14:02:21,981 INFO L403 AbstractCegarLoop]: === Iteration 6 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-07 14:02:21,981 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-07 14:02:21,981 INFO L85 PathProgramCache]: Analyzing trace with hash -174895632, now seen corresponding path program 1 times [2022-04-07 14:02:21,982 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-07 14:02:21,982 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [602102261] [2022-04-07 14:02:21,982 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-07 14:02:21,982 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-07 14:02:21,992 ERROR L245 FreeRefinementEngine]: Caught known exception: Unsupported non-linear arithmetic [2022-04-07 14:02:21,992 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [1270207148] [2022-04-07 14:02:21,992 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-07 14:02:21,992 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-07 14:02:21,992 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-04-07 14:02:21,996 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-07 14:02:22,015 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-07 14:02:22,055 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-07 14:02:22,055 INFO L263 TraceCheckSpWp]: Trace formula consists of 128 conjuncts, 9 conjunts are in the unsatisfiable core [2022-04-07 14:02:22,064 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-07 14:02:22,066 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-04-07 14:02:22,218 INFO L272 TraceCheckUtils]: 0: Hoare triple {1654#true} call ULTIMATE.init(); {1654#true} is VALID [2022-04-07 14:02:22,219 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-07 14:02:22,219 INFO L290 TraceCheckUtils]: 2: Hoare triple {1662#(<= ~counter~0 0)} assume true; {1662#(<= ~counter~0 0)} is VALID [2022-04-07 14:02:22,220 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {1662#(<= ~counter~0 0)} {1654#true} #102#return; {1662#(<= ~counter~0 0)} is VALID [2022-04-07 14:02:22,220 INFO L272 TraceCheckUtils]: 4: Hoare triple {1662#(<= ~counter~0 0)} call #t~ret9 := main(); {1662#(<= ~counter~0 0)} is VALID [2022-04-07 14:02:22,221 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-07 14:02:22,221 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-07 14:02:22,222 INFO L290 TraceCheckUtils]: 7: Hoare triple {1662#(<= ~counter~0 0)} ~cond := #in~cond; {1662#(<= ~counter~0 0)} is VALID [2022-04-07 14:02:22,222 INFO L290 TraceCheckUtils]: 8: Hoare triple {1662#(<= ~counter~0 0)} assume !(0 == ~cond); {1662#(<= ~counter~0 0)} is VALID [2022-04-07 14:02:22,222 INFO L290 TraceCheckUtils]: 9: Hoare triple {1662#(<= ~counter~0 0)} assume true; {1662#(<= ~counter~0 0)} is VALID [2022-04-07 14:02:22,223 INFO L284 TraceCheckUtils]: 10: Hoare quadruple {1662#(<= ~counter~0 0)} {1662#(<= ~counter~0 0)} #90#return; {1662#(<= ~counter~0 0)} is VALID [2022-04-07 14:02:22,223 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-07 14:02:22,223 INFO L290 TraceCheckUtils]: 12: Hoare triple {1662#(<= ~counter~0 0)} ~cond := #in~cond; {1662#(<= ~counter~0 0)} is VALID [2022-04-07 14:02:22,224 INFO L290 TraceCheckUtils]: 13: Hoare triple {1662#(<= ~counter~0 0)} assume !(0 == ~cond); {1662#(<= ~counter~0 0)} is VALID [2022-04-07 14:02:22,224 INFO L290 TraceCheckUtils]: 14: Hoare triple {1662#(<= ~counter~0 0)} assume true; {1662#(<= ~counter~0 0)} is VALID [2022-04-07 14:02:22,224 INFO L284 TraceCheckUtils]: 15: Hoare quadruple {1662#(<= ~counter~0 0)} {1662#(<= ~counter~0 0)} #92#return; {1662#(<= ~counter~0 0)} is VALID [2022-04-07 14:02:22,225 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-07 14:02:22,225 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-07 14:02:22,226 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-07 14:02:22,226 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-07 14:02:22,226 INFO L290 TraceCheckUtils]: 20: Hoare triple {1711#(<= ~counter~0 1)} ~cond := #in~cond; {1711#(<= ~counter~0 1)} is VALID [2022-04-07 14:02:22,227 INFO L290 TraceCheckUtils]: 21: Hoare triple {1711#(<= ~counter~0 1)} assume !(0 == ~cond); {1711#(<= ~counter~0 1)} is VALID [2022-04-07 14:02:22,227 INFO L290 TraceCheckUtils]: 22: Hoare triple {1711#(<= ~counter~0 1)} assume true; {1711#(<= ~counter~0 1)} is VALID [2022-04-07 14:02:22,227 INFO L284 TraceCheckUtils]: 23: Hoare quadruple {1711#(<= ~counter~0 1)} {1711#(<= ~counter~0 1)} #94#return; {1711#(<= ~counter~0 1)} is VALID [2022-04-07 14:02:22,228 INFO L290 TraceCheckUtils]: 24: Hoare triple {1711#(<= ~counter~0 1)} assume !!(0 != ~r~0); {1711#(<= ~counter~0 1)} is VALID [2022-04-07 14:02:22,228 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-07 14:02:22,228 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-07 14:02:22,229 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-07 14:02:22,229 INFO L290 TraceCheckUtils]: 28: Hoare triple {1736#(<= ~counter~0 2)} ~cond := #in~cond; {1736#(<= ~counter~0 2)} is VALID [2022-04-07 14:02:22,229 INFO L290 TraceCheckUtils]: 29: Hoare triple {1736#(<= ~counter~0 2)} assume !(0 == ~cond); {1736#(<= ~counter~0 2)} is VALID [2022-04-07 14:02:22,230 INFO L290 TraceCheckUtils]: 30: Hoare triple {1736#(<= ~counter~0 2)} assume true; {1736#(<= ~counter~0 2)} is VALID [2022-04-07 14:02:22,230 INFO L284 TraceCheckUtils]: 31: Hoare quadruple {1736#(<= ~counter~0 2)} {1736#(<= ~counter~0 2)} #96#return; {1736#(<= ~counter~0 2)} is VALID [2022-04-07 14:02:22,230 INFO L290 TraceCheckUtils]: 32: Hoare triple {1736#(<= ~counter~0 2)} assume !(~r~0 > 0); {1736#(<= ~counter~0 2)} is VALID [2022-04-07 14:02:22,231 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-07 14:02:22,231 INFO L290 TraceCheckUtils]: 34: Hoare triple {1761#(<= |main_#t~post8| 2)} assume !(#t~post8 < 5);havoc #t~post8; {1655#false} is VALID [2022-04-07 14:02:22,231 INFO L290 TraceCheckUtils]: 35: Hoare triple {1655#false} #t~post6 := ~counter~0;~counter~0 := 1 + #t~post6; {1655#false} is VALID [2022-04-07 14:02:22,231 INFO L290 TraceCheckUtils]: 36: Hoare triple {1655#false} assume !(#t~post6 < 5);havoc #t~post6; {1655#false} is VALID [2022-04-07 14:02:22,231 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-07 14:02:22,231 INFO L290 TraceCheckUtils]: 38: Hoare triple {1655#false} ~cond := #in~cond; {1655#false} is VALID [2022-04-07 14:02:22,232 INFO L290 TraceCheckUtils]: 39: Hoare triple {1655#false} assume 0 == ~cond; {1655#false} is VALID [2022-04-07 14:02:22,232 INFO L290 TraceCheckUtils]: 40: Hoare triple {1655#false} assume !false; {1655#false} is VALID [2022-04-07 14:02:22,232 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-07 14:02:22,232 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-04-07 14:02:22,427 INFO L290 TraceCheckUtils]: 40: Hoare triple {1655#false} assume !false; {1655#false} is VALID [2022-04-07 14:02:22,427 INFO L290 TraceCheckUtils]: 39: Hoare triple {1655#false} assume 0 == ~cond; {1655#false} is VALID [2022-04-07 14:02:22,427 INFO L290 TraceCheckUtils]: 38: Hoare triple {1655#false} ~cond := #in~cond; {1655#false} is VALID [2022-04-07 14:02:22,427 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-07 14:02:22,427 INFO L290 TraceCheckUtils]: 36: Hoare triple {1655#false} assume !(#t~post6 < 5);havoc #t~post6; {1655#false} is VALID [2022-04-07 14:02:22,427 INFO L290 TraceCheckUtils]: 35: Hoare triple {1655#false} #t~post6 := ~counter~0;~counter~0 := 1 + #t~post6; {1655#false} is VALID [2022-04-07 14:02:22,427 INFO L290 TraceCheckUtils]: 34: Hoare triple {1801#(< |main_#t~post8| 5)} assume !(#t~post8 < 5);havoc #t~post8; {1655#false} is VALID [2022-04-07 14:02:22,428 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-07 14:02:22,428 INFO L290 TraceCheckUtils]: 32: Hoare triple {1805#(< ~counter~0 5)} assume !(~r~0 > 0); {1805#(< ~counter~0 5)} is VALID [2022-04-07 14:02:22,429 INFO L284 TraceCheckUtils]: 31: Hoare quadruple {1654#true} {1805#(< ~counter~0 5)} #96#return; {1805#(< ~counter~0 5)} is VALID [2022-04-07 14:02:22,429 INFO L290 TraceCheckUtils]: 30: Hoare triple {1654#true} assume true; {1654#true} is VALID [2022-04-07 14:02:22,429 INFO L290 TraceCheckUtils]: 29: Hoare triple {1654#true} assume !(0 == ~cond); {1654#true} is VALID [2022-04-07 14:02:22,429 INFO L290 TraceCheckUtils]: 28: Hoare triple {1654#true} ~cond := #in~cond; {1654#true} is VALID [2022-04-07 14:02:22,429 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-07 14:02:22,429 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-07 14:02:22,430 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-07 14:02:22,430 INFO L290 TraceCheckUtils]: 24: Hoare triple {1830#(< ~counter~0 4)} assume !!(0 != ~r~0); {1830#(< ~counter~0 4)} is VALID [2022-04-07 14:02:22,431 INFO L284 TraceCheckUtils]: 23: Hoare quadruple {1654#true} {1830#(< ~counter~0 4)} #94#return; {1830#(< ~counter~0 4)} is VALID [2022-04-07 14:02:22,431 INFO L290 TraceCheckUtils]: 22: Hoare triple {1654#true} assume true; {1654#true} is VALID [2022-04-07 14:02:22,431 INFO L290 TraceCheckUtils]: 21: Hoare triple {1654#true} assume !(0 == ~cond); {1654#true} is VALID [2022-04-07 14:02:22,431 INFO L290 TraceCheckUtils]: 20: Hoare triple {1654#true} ~cond := #in~cond; {1654#true} is VALID [2022-04-07 14:02:22,431 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-07 14:02:22,431 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-07 14:02:22,432 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-07 14:02:22,432 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-07 14:02:22,432 INFO L284 TraceCheckUtils]: 15: Hoare quadruple {1654#true} {1736#(<= ~counter~0 2)} #92#return; {1736#(<= ~counter~0 2)} is VALID [2022-04-07 14:02:22,432 INFO L290 TraceCheckUtils]: 14: Hoare triple {1654#true} assume true; {1654#true} is VALID [2022-04-07 14:02:22,432 INFO L290 TraceCheckUtils]: 13: Hoare triple {1654#true} assume !(0 == ~cond); {1654#true} is VALID [2022-04-07 14:02:22,433 INFO L290 TraceCheckUtils]: 12: Hoare triple {1654#true} ~cond := #in~cond; {1654#true} is VALID [2022-04-07 14:02:22,433 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-07 14:02:22,433 INFO L284 TraceCheckUtils]: 10: Hoare quadruple {1654#true} {1736#(<= ~counter~0 2)} #90#return; {1736#(<= ~counter~0 2)} is VALID [2022-04-07 14:02:22,433 INFO L290 TraceCheckUtils]: 9: Hoare triple {1654#true} assume true; {1654#true} is VALID [2022-04-07 14:02:22,433 INFO L290 TraceCheckUtils]: 8: Hoare triple {1654#true} assume !(0 == ~cond); {1654#true} is VALID [2022-04-07 14:02:22,433 INFO L290 TraceCheckUtils]: 7: Hoare triple {1654#true} ~cond := #in~cond; {1654#true} is VALID [2022-04-07 14:02:22,433 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-07 14:02:22,434 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-07 14:02:22,434 INFO L272 TraceCheckUtils]: 4: Hoare triple {1736#(<= ~counter~0 2)} call #t~ret9 := main(); {1736#(<= ~counter~0 2)} is VALID [2022-04-07 14:02:22,434 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {1736#(<= ~counter~0 2)} {1654#true} #102#return; {1736#(<= ~counter~0 2)} is VALID [2022-04-07 14:02:22,435 INFO L290 TraceCheckUtils]: 2: Hoare triple {1736#(<= ~counter~0 2)} assume true; {1736#(<= ~counter~0 2)} is VALID [2022-04-07 14:02:22,435 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-07 14:02:22,435 INFO L272 TraceCheckUtils]: 0: Hoare triple {1654#true} call ULTIMATE.init(); {1654#true} is VALID [2022-04-07 14:02:22,435 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-07 14:02:22,436 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-07 14:02:22,436 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [602102261] [2022-04-07 14:02:22,436 WARN L310 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2022-04-07 14:02:22,436 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1270207148] [2022-04-07 14:02:22,436 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1270207148] provided 1 perfect and 1 imperfect interpolant sequences [2022-04-07 14:02:22,436 INFO L184 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2022-04-07 14:02:22,436 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [6] total 9 [2022-04-07 14:02:22,436 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2001726364] [2022-04-07 14:02:22,436 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-07 14:02:22,437 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-07 14:02:22,437 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-07 14:02:22,437 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-07 14:02:22,467 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-07 14:02:22,467 INFO L554 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2022-04-07 14:02:22,467 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-04-07 14:02:22,467 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2022-04-07 14:02:22,467 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=26, Invalid=46, Unknown=0, NotChecked=0, Total=72 [2022-04-07 14:02:22,468 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-07 14:02:22,594 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-07 14:02:22,595 INFO L93 Difference]: Finished difference Result 74 states and 89 transitions. [2022-04-07 14:02:22,595 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2022-04-07 14:02:22,595 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-07 14:02:22,595 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-07 14:02:22,595 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-07 14:02:22,596 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 87 transitions. [2022-04-07 14:02:22,597 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-07 14:02:22,598 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 87 transitions. [2022-04-07 14:02:22,598 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 6 states and 87 transitions. [2022-04-07 14:02:22,655 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-07 14:02:22,656 INFO L225 Difference]: With dead ends: 74 [2022-04-07 14:02:22,656 INFO L226 Difference]: Without dead ends: 53 [2022-04-07 14:02:22,656 INFO L912 BasicCegarLoop]: 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-07 14:02:22,657 INFO L913 BasicCegarLoop]: 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-07 14:02:22,657 INFO L914 BasicCegarLoop]: 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-07 14:02:22,657 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 53 states. [2022-04-07 14:02:22,680 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 53 to 52. [2022-04-07 14:02:22,680 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-07 14:02:22,682 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-07 14:02:22,682 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-07 14:02:22,682 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-07 14:02:22,684 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-07 14:02:22,684 INFO L93 Difference]: Finished difference Result 53 states and 61 transitions. [2022-04-07 14:02:22,684 INFO L276 IsEmpty]: Start isEmpty. Operand 53 states and 61 transitions. [2022-04-07 14:02:22,684 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-07 14:02:22,684 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-07 14:02:22,684 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-07 14:02:22,684 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-07 14:02:22,686 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-07 14:02:22,686 INFO L93 Difference]: Finished difference Result 53 states and 61 transitions. [2022-04-07 14:02:22,686 INFO L276 IsEmpty]: Start isEmpty. Operand 53 states and 61 transitions. [2022-04-07 14:02:22,686 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-07 14:02:22,686 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-07 14:02:22,686 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-07 14:02:22,686 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-07 14:02:22,687 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-07 14:02:22,688 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 52 states to 52 states and 60 transitions. [2022-04-07 14:02:22,688 INFO L78 Accepts]: Start accepts. Automaton has 52 states and 60 transitions. Word has length 41 [2022-04-07 14:02:22,689 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-07 14:02:22,689 INFO L478 AbstractCegarLoop]: Abstraction has 52 states and 60 transitions. [2022-04-07 14:02:22,690 INFO L479 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-07 14:02:22,690 INFO L276 IsEmpty]: Start isEmpty. Operand 52 states and 60 transitions. [2022-04-07 14:02:22,691 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 44 [2022-04-07 14:02:22,691 INFO L491 BasicCegarLoop]: Found error trace [2022-04-07 14:02:22,691 INFO L499 BasicCegarLoop]: 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-07 14:02:22,710 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (7)] Forceful destruction successful, exit code 0 [2022-04-07 14:02:22,903 WARN L460 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5,7 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-07 14:02:22,903 INFO L403 AbstractCegarLoop]: === Iteration 7 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-07 14:02:22,904 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-07 14:02:22,904 INFO L85 PathProgramCache]: Analyzing trace with hash -1292932747, now seen corresponding path program 1 times [2022-04-07 14:02:22,904 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-07 14:02:22,904 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [112783992] [2022-04-07 14:02:22,904 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-07 14:02:22,904 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-07 14:02:22,916 ERROR L245 FreeRefinementEngine]: Caught known exception: Unsupported non-linear arithmetic [2022-04-07 14:02:22,916 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [1628617431] [2022-04-07 14:02:22,916 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-07 14:02:22,916 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-07 14:02:22,916 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-04-07 14:02:22,930 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-07 14:02:22,943 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-07 14:02:22,982 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-07 14:02:22,982 INFO L263 TraceCheckSpWp]: Trace formula consists of 137 conjuncts, 9 conjunts are in the unsatisfiable core [2022-04-07 14:02:22,996 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-07 14:02:22,999 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-04-07 14:02:23,161 INFO L272 TraceCheckUtils]: 0: Hoare triple {2191#true} call ULTIMATE.init(); {2191#true} is VALID [2022-04-07 14:02:23,162 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-07 14:02:23,162 INFO L290 TraceCheckUtils]: 2: Hoare triple {2199#(<= ~counter~0 0)} assume true; {2199#(<= ~counter~0 0)} is VALID [2022-04-07 14:02:23,171 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {2199#(<= ~counter~0 0)} {2191#true} #102#return; {2199#(<= ~counter~0 0)} is VALID [2022-04-07 14:02:23,172 INFO L272 TraceCheckUtils]: 4: Hoare triple {2199#(<= ~counter~0 0)} call #t~ret9 := main(); {2199#(<= ~counter~0 0)} is VALID [2022-04-07 14:02:23,173 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-07 14:02:23,174 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-07 14:02:23,174 INFO L290 TraceCheckUtils]: 7: Hoare triple {2199#(<= ~counter~0 0)} ~cond := #in~cond; {2199#(<= ~counter~0 0)} is VALID [2022-04-07 14:02:23,176 INFO L290 TraceCheckUtils]: 8: Hoare triple {2199#(<= ~counter~0 0)} assume !(0 == ~cond); {2199#(<= ~counter~0 0)} is VALID [2022-04-07 14:02:23,176 INFO L290 TraceCheckUtils]: 9: Hoare triple {2199#(<= ~counter~0 0)} assume true; {2199#(<= ~counter~0 0)} is VALID [2022-04-07 14:02:23,176 INFO L284 TraceCheckUtils]: 10: Hoare quadruple {2199#(<= ~counter~0 0)} {2199#(<= ~counter~0 0)} #90#return; {2199#(<= ~counter~0 0)} is VALID [2022-04-07 14:02:23,177 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-07 14:02:23,187 INFO L290 TraceCheckUtils]: 12: Hoare triple {2199#(<= ~counter~0 0)} ~cond := #in~cond; {2199#(<= ~counter~0 0)} is VALID [2022-04-07 14:02:23,188 INFO L290 TraceCheckUtils]: 13: Hoare triple {2199#(<= ~counter~0 0)} assume !(0 == ~cond); {2199#(<= ~counter~0 0)} is VALID [2022-04-07 14:02:23,188 INFO L290 TraceCheckUtils]: 14: Hoare triple {2199#(<= ~counter~0 0)} assume true; {2199#(<= ~counter~0 0)} is VALID [2022-04-07 14:02:23,189 INFO L284 TraceCheckUtils]: 15: Hoare quadruple {2199#(<= ~counter~0 0)} {2199#(<= ~counter~0 0)} #92#return; {2199#(<= ~counter~0 0)} is VALID [2022-04-07 14:02:23,189 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-07 14:02:23,190 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-07 14:02:23,190 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-07 14:02:23,190 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-07 14:02:23,191 INFO L290 TraceCheckUtils]: 20: Hoare triple {2248#(<= ~counter~0 1)} ~cond := #in~cond; {2248#(<= ~counter~0 1)} is VALID [2022-04-07 14:02:23,191 INFO L290 TraceCheckUtils]: 21: Hoare triple {2248#(<= ~counter~0 1)} assume !(0 == ~cond); {2248#(<= ~counter~0 1)} is VALID [2022-04-07 14:02:23,191 INFO L290 TraceCheckUtils]: 22: Hoare triple {2248#(<= ~counter~0 1)} assume true; {2248#(<= ~counter~0 1)} is VALID [2022-04-07 14:02:23,192 INFO L284 TraceCheckUtils]: 23: Hoare quadruple {2248#(<= ~counter~0 1)} {2248#(<= ~counter~0 1)} #94#return; {2248#(<= ~counter~0 1)} is VALID [2022-04-07 14:02:23,192 INFO L290 TraceCheckUtils]: 24: Hoare triple {2248#(<= ~counter~0 1)} assume !!(0 != ~r~0); {2248#(<= ~counter~0 1)} is VALID [2022-04-07 14:02:23,192 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-07 14:02:23,192 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-07 14:02:23,193 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-07 14:02:23,193 INFO L290 TraceCheckUtils]: 28: Hoare triple {2273#(<= ~counter~0 2)} ~cond := #in~cond; {2273#(<= ~counter~0 2)} is VALID [2022-04-07 14:02:23,193 INFO L290 TraceCheckUtils]: 29: Hoare triple {2273#(<= ~counter~0 2)} assume !(0 == ~cond); {2273#(<= ~counter~0 2)} is VALID [2022-04-07 14:02:23,194 INFO L290 TraceCheckUtils]: 30: Hoare triple {2273#(<= ~counter~0 2)} assume true; {2273#(<= ~counter~0 2)} is VALID [2022-04-07 14:02:23,194 INFO L284 TraceCheckUtils]: 31: Hoare quadruple {2273#(<= ~counter~0 2)} {2273#(<= ~counter~0 2)} #96#return; {2273#(<= ~counter~0 2)} is VALID [2022-04-07 14:02:23,194 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-07 14:02:23,195 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-07 14:02:23,195 INFO L290 TraceCheckUtils]: 34: Hoare triple {2298#(<= |main_#t~post7| 2)} assume !(#t~post7 < 5);havoc #t~post7; {2192#false} is VALID [2022-04-07 14:02:23,195 INFO L290 TraceCheckUtils]: 35: Hoare triple {2192#false} #t~post8 := ~counter~0;~counter~0 := 1 + #t~post8; {2192#false} is VALID [2022-04-07 14:02:23,195 INFO L290 TraceCheckUtils]: 36: Hoare triple {2192#false} assume !(#t~post8 < 5);havoc #t~post8; {2192#false} is VALID [2022-04-07 14:02:23,195 INFO L290 TraceCheckUtils]: 37: Hoare triple {2192#false} #t~post6 := ~counter~0;~counter~0 := 1 + #t~post6; {2192#false} is VALID [2022-04-07 14:02:23,195 INFO L290 TraceCheckUtils]: 38: Hoare triple {2192#false} assume !(#t~post6 < 5);havoc #t~post6; {2192#false} is VALID [2022-04-07 14:02:23,195 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-07 14:02:23,195 INFO L290 TraceCheckUtils]: 40: Hoare triple {2192#false} ~cond := #in~cond; {2192#false} is VALID [2022-04-07 14:02:23,195 INFO L290 TraceCheckUtils]: 41: Hoare triple {2192#false} assume 0 == ~cond; {2192#false} is VALID [2022-04-07 14:02:23,195 INFO L290 TraceCheckUtils]: 42: Hoare triple {2192#false} assume !false; {2192#false} is VALID [2022-04-07 14:02:23,196 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-07 14:02:23,196 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-04-07 14:02:23,384 INFO L290 TraceCheckUtils]: 42: Hoare triple {2192#false} assume !false; {2192#false} is VALID [2022-04-07 14:02:23,384 INFO L290 TraceCheckUtils]: 41: Hoare triple {2192#false} assume 0 == ~cond; {2192#false} is VALID [2022-04-07 14:02:23,384 INFO L290 TraceCheckUtils]: 40: Hoare triple {2192#false} ~cond := #in~cond; {2192#false} is VALID [2022-04-07 14:02:23,384 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-07 14:02:23,384 INFO L290 TraceCheckUtils]: 38: Hoare triple {2192#false} assume !(#t~post6 < 5);havoc #t~post6; {2192#false} is VALID [2022-04-07 14:02:23,384 INFO L290 TraceCheckUtils]: 37: Hoare triple {2192#false} #t~post6 := ~counter~0;~counter~0 := 1 + #t~post6; {2192#false} is VALID [2022-04-07 14:02:23,384 INFO L290 TraceCheckUtils]: 36: Hoare triple {2192#false} assume !(#t~post8 < 5);havoc #t~post8; {2192#false} is VALID [2022-04-07 14:02:23,384 INFO L290 TraceCheckUtils]: 35: Hoare triple {2192#false} #t~post8 := ~counter~0;~counter~0 := 1 + #t~post8; {2192#false} is VALID [2022-04-07 14:02:23,385 INFO L290 TraceCheckUtils]: 34: Hoare triple {2350#(< |main_#t~post7| 5)} assume !(#t~post7 < 5);havoc #t~post7; {2192#false} is VALID [2022-04-07 14:02:23,385 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-07 14:02:23,385 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-07 14:02:23,386 INFO L284 TraceCheckUtils]: 31: Hoare quadruple {2191#true} {2354#(< ~counter~0 5)} #96#return; {2354#(< ~counter~0 5)} is VALID [2022-04-07 14:02:23,386 INFO L290 TraceCheckUtils]: 30: Hoare triple {2191#true} assume true; {2191#true} is VALID [2022-04-07 14:02:23,386 INFO L290 TraceCheckUtils]: 29: Hoare triple {2191#true} assume !(0 == ~cond); {2191#true} is VALID [2022-04-07 14:02:23,386 INFO L290 TraceCheckUtils]: 28: Hoare triple {2191#true} ~cond := #in~cond; {2191#true} is VALID [2022-04-07 14:02:23,386 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-07 14:02:23,386 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-07 14:02:23,387 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-07 14:02:23,387 INFO L290 TraceCheckUtils]: 24: Hoare triple {2379#(< ~counter~0 4)} assume !!(0 != ~r~0); {2379#(< ~counter~0 4)} is VALID [2022-04-07 14:02:23,388 INFO L284 TraceCheckUtils]: 23: Hoare quadruple {2191#true} {2379#(< ~counter~0 4)} #94#return; {2379#(< ~counter~0 4)} is VALID [2022-04-07 14:02:23,388 INFO L290 TraceCheckUtils]: 22: Hoare triple {2191#true} assume true; {2191#true} is VALID [2022-04-07 14:02:23,388 INFO L290 TraceCheckUtils]: 21: Hoare triple {2191#true} assume !(0 == ~cond); {2191#true} is VALID [2022-04-07 14:02:23,388 INFO L290 TraceCheckUtils]: 20: Hoare triple {2191#true} ~cond := #in~cond; {2191#true} is VALID [2022-04-07 14:02:23,388 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-07 14:02:23,389 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-07 14:02:23,389 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-07 14:02:23,389 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-07 14:02:23,390 INFO L284 TraceCheckUtils]: 15: Hoare quadruple {2191#true} {2273#(<= ~counter~0 2)} #92#return; {2273#(<= ~counter~0 2)} is VALID [2022-04-07 14:02:23,390 INFO L290 TraceCheckUtils]: 14: Hoare triple {2191#true} assume true; {2191#true} is VALID [2022-04-07 14:02:23,390 INFO L290 TraceCheckUtils]: 13: Hoare triple {2191#true} assume !(0 == ~cond); {2191#true} is VALID [2022-04-07 14:02:23,390 INFO L290 TraceCheckUtils]: 12: Hoare triple {2191#true} ~cond := #in~cond; {2191#true} is VALID [2022-04-07 14:02:23,390 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-07 14:02:23,391 INFO L284 TraceCheckUtils]: 10: Hoare quadruple {2191#true} {2273#(<= ~counter~0 2)} #90#return; {2273#(<= ~counter~0 2)} is VALID [2022-04-07 14:02:23,391 INFO L290 TraceCheckUtils]: 9: Hoare triple {2191#true} assume true; {2191#true} is VALID [2022-04-07 14:02:23,391 INFO L290 TraceCheckUtils]: 8: Hoare triple {2191#true} assume !(0 == ~cond); {2191#true} is VALID [2022-04-07 14:02:23,391 INFO L290 TraceCheckUtils]: 7: Hoare triple {2191#true} ~cond := #in~cond; {2191#true} is VALID [2022-04-07 14:02:23,391 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-07 14:02:23,391 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-07 14:02:23,392 INFO L272 TraceCheckUtils]: 4: Hoare triple {2273#(<= ~counter~0 2)} call #t~ret9 := main(); {2273#(<= ~counter~0 2)} is VALID [2022-04-07 14:02:23,392 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {2273#(<= ~counter~0 2)} {2191#true} #102#return; {2273#(<= ~counter~0 2)} is VALID [2022-04-07 14:02:23,392 INFO L290 TraceCheckUtils]: 2: Hoare triple {2273#(<= ~counter~0 2)} assume true; {2273#(<= ~counter~0 2)} is VALID [2022-04-07 14:02:23,393 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-07 14:02:23,393 INFO L272 TraceCheckUtils]: 0: Hoare triple {2191#true} call ULTIMATE.init(); {2191#true} is VALID [2022-04-07 14:02:23,393 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-07 14:02:23,393 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-07 14:02:23,393 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [112783992] [2022-04-07 14:02:23,393 WARN L310 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2022-04-07 14:02:23,393 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1628617431] [2022-04-07 14:02:23,393 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1628617431] provided 0 perfect and 2 imperfect interpolant sequences [2022-04-07 14:02:23,393 INFO L184 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2022-04-07 14:02:23,393 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [6, 6] total 9 [2022-04-07 14:02:23,394 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1905340968] [2022-04-07 14:02:23,394 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2022-04-07 14:02:23,394 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-07 14:02:23,394 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-07 14:02:23,394 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-07 14:02:23,451 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-07 14:02:23,451 INFO L554 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2022-04-07 14:02:23,451 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-04-07 14:02:23,451 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2022-04-07 14:02:23,452 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=26, Invalid=46, Unknown=0, NotChecked=0, Total=72 [2022-04-07 14:02:23,452 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-07 14:02:23,735 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-07 14:02:23,736 INFO L93 Difference]: Finished difference Result 108 states and 133 transitions. [2022-04-07 14:02:23,736 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2022-04-07 14:02:23,736 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-07 14:02:23,736 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-07 14:02:23,736 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-07 14:02:23,738 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 11 states to 11 states and 130 transitions. [2022-04-07 14:02:23,738 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-07 14:02:23,740 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 11 states to 11 states and 130 transitions. [2022-04-07 14:02:23,741 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 11 states and 130 transitions. [2022-04-07 14:02:23,843 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-07 14:02:23,844 INFO L225 Difference]: With dead ends: 108 [2022-04-07 14:02:23,844 INFO L226 Difference]: Without dead ends: 87 [2022-04-07 14:02:23,845 INFO L912 BasicCegarLoop]: 0 DeclaredPredicates, 88 GetRequests, 77 SyntacticMatches, 1 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 11 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=46, Invalid=86, Unknown=0, NotChecked=0, Total=132 [2022-04-07 14:02:23,845 INFO L913 BasicCegarLoop]: 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-07 14:02:23,845 INFO L914 BasicCegarLoop]: 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-07 14:02:23,846 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 87 states. [2022-04-07 14:02:23,877 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 87 to 79. [2022-04-07 14:02:23,877 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-07 14:02:23,878 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-07 14:02:23,878 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-07 14:02:23,878 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-07 14:02:23,881 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-07 14:02:23,881 INFO L93 Difference]: Finished difference Result 87 states and 103 transitions. [2022-04-07 14:02:23,881 INFO L276 IsEmpty]: Start isEmpty. Operand 87 states and 103 transitions. [2022-04-07 14:02:23,881 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-07 14:02:23,881 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-07 14:02:23,882 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-07 14:02:23,882 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-07 14:02:23,884 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-07 14:02:23,884 INFO L93 Difference]: Finished difference Result 87 states and 103 transitions. [2022-04-07 14:02:23,884 INFO L276 IsEmpty]: Start isEmpty. Operand 87 states and 103 transitions. [2022-04-07 14:02:23,884 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-07 14:02:23,885 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-07 14:02:23,885 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-07 14:02:23,885 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-07 14:02:23,885 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-07 14:02:23,886 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 79 states to 79 states and 95 transitions. [2022-04-07 14:02:23,887 INFO L78 Accepts]: Start accepts. Automaton has 79 states and 95 transitions. Word has length 43 [2022-04-07 14:02:23,887 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-07 14:02:23,887 INFO L478 AbstractCegarLoop]: Abstraction has 79 states and 95 transitions. [2022-04-07 14:02:23,887 INFO L479 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-07 14:02:23,887 INFO L276 IsEmpty]: Start isEmpty. Operand 79 states and 95 transitions. [2022-04-07 14:02:23,887 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 48 [2022-04-07 14:02:23,888 INFO L491 BasicCegarLoop]: Found error trace [2022-04-07 14:02:23,888 INFO L499 BasicCegarLoop]: 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-07 14:02:23,914 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-07 14:02:24,109 WARN L460 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6,8 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-07 14:02:24,110 INFO L403 AbstractCegarLoop]: === Iteration 8 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-07 14:02:24,110 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-07 14:02:24,110 INFO L85 PathProgramCache]: Analyzing trace with hash 1407897436, now seen corresponding path program 1 times [2022-04-07 14:02:24,110 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-07 14:02:24,110 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [956722781] [2022-04-07 14:02:24,110 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-07 14:02:24,111 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-07 14:02:24,120 ERROR L245 FreeRefinementEngine]: Caught known exception: Unsupported non-linear arithmetic [2022-04-07 14:02:24,120 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [645262203] [2022-04-07 14:02:24,121 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-07 14:02:24,121 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-07 14:02:24,121 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-04-07 14:02:24,127 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-07 14:02:24,130 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-07 14:02:24,164 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-07 14:02:24,164 INFO L263 TraceCheckSpWp]: Trace formula consists of 138 conjuncts, 3 conjunts are in the unsatisfiable core [2022-04-07 14:02:24,171 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-07 14:02:24,172 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-04-07 14:02:24,314 INFO L272 TraceCheckUtils]: 0: Hoare triple {2899#true} call ULTIMATE.init(); {2899#true} is VALID [2022-04-07 14:02:24,314 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-07 14:02:24,314 INFO L290 TraceCheckUtils]: 2: Hoare triple {2899#true} assume true; {2899#true} is VALID [2022-04-07 14:02:24,314 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {2899#true} {2899#true} #102#return; {2899#true} is VALID [2022-04-07 14:02:24,314 INFO L272 TraceCheckUtils]: 4: Hoare triple {2899#true} call #t~ret9 := main(); {2899#true} is VALID [2022-04-07 14:02:24,314 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-07 14:02:24,314 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-07 14:02:24,314 INFO L290 TraceCheckUtils]: 7: Hoare triple {2899#true} ~cond := #in~cond; {2899#true} is VALID [2022-04-07 14:02:24,315 INFO L290 TraceCheckUtils]: 8: Hoare triple {2899#true} assume !(0 == ~cond); {2899#true} is VALID [2022-04-07 14:02:24,315 INFO L290 TraceCheckUtils]: 9: Hoare triple {2899#true} assume true; {2899#true} is VALID [2022-04-07 14:02:24,315 INFO L284 TraceCheckUtils]: 10: Hoare quadruple {2899#true} {2899#true} #90#return; {2899#true} is VALID [2022-04-07 14:02:24,315 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-07 14:02:24,315 INFO L290 TraceCheckUtils]: 12: Hoare triple {2899#true} ~cond := #in~cond; {2899#true} is VALID [2022-04-07 14:02:24,315 INFO L290 TraceCheckUtils]: 13: Hoare triple {2899#true} assume !(0 == ~cond); {2899#true} is VALID [2022-04-07 14:02:24,315 INFO L290 TraceCheckUtils]: 14: Hoare triple {2899#true} assume true; {2899#true} is VALID [2022-04-07 14:02:24,315 INFO L284 TraceCheckUtils]: 15: Hoare quadruple {2899#true} {2899#true} #92#return; {2899#true} is VALID [2022-04-07 14:02:24,315 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-07 14:02:24,315 INFO L290 TraceCheckUtils]: 17: Hoare triple {2899#true} #t~post6 := ~counter~0;~counter~0 := 1 + #t~post6; {2899#true} is VALID [2022-04-07 14:02:24,315 INFO L290 TraceCheckUtils]: 18: Hoare triple {2899#true} assume !!(#t~post6 < 5);havoc #t~post6; {2899#true} is VALID [2022-04-07 14:02:24,315 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-07 14:02:24,315 INFO L290 TraceCheckUtils]: 20: Hoare triple {2899#true} ~cond := #in~cond; {2899#true} is VALID [2022-04-07 14:02:24,316 INFO L290 TraceCheckUtils]: 21: Hoare triple {2899#true} assume !(0 == ~cond); {2899#true} is VALID [2022-04-07 14:02:24,316 INFO L290 TraceCheckUtils]: 22: Hoare triple {2899#true} assume true; {2899#true} is VALID [2022-04-07 14:02:24,316 INFO L284 TraceCheckUtils]: 23: Hoare quadruple {2899#true} {2899#true} #94#return; {2899#true} is VALID [2022-04-07 14:02:24,316 INFO L290 TraceCheckUtils]: 24: Hoare triple {2899#true} assume !!(0 != ~r~0); {2976#(not (= main_~r~0 0))} is VALID [2022-04-07 14:02:24,316 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-07 14:02:24,316 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-07 14:02:24,317 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-07 14:02:24,317 INFO L290 TraceCheckUtils]: 28: Hoare triple {2899#true} ~cond := #in~cond; {2899#true} is VALID [2022-04-07 14:02:24,317 INFO L290 TraceCheckUtils]: 29: Hoare triple {2899#true} assume !(0 == ~cond); {2899#true} is VALID [2022-04-07 14:02:24,317 INFO L290 TraceCheckUtils]: 30: Hoare triple {2899#true} assume true; {2899#true} is VALID [2022-04-07 14:02:24,317 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-07 14:02:24,318 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-07 14:02:24,318 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-07 14:02:24,318 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-07 14:02:24,318 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-07 14:02:24,319 INFO L290 TraceCheckUtils]: 36: Hoare triple {2899#true} ~cond := #in~cond; {2899#true} is VALID [2022-04-07 14:02:24,319 INFO L290 TraceCheckUtils]: 37: Hoare triple {2899#true} assume !(0 == ~cond); {2899#true} is VALID [2022-04-07 14:02:24,319 INFO L290 TraceCheckUtils]: 38: Hoare triple {2899#true} assume true; {2899#true} is VALID [2022-04-07 14:02:24,323 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-07 14:02:24,324 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-07 14:02:24,324 INFO L290 TraceCheckUtils]: 41: Hoare triple {2900#false} #t~post6 := ~counter~0;~counter~0 := 1 + #t~post6; {2900#false} is VALID [2022-04-07 14:02:24,324 INFO L290 TraceCheckUtils]: 42: Hoare triple {2900#false} assume !(#t~post6 < 5);havoc #t~post6; {2900#false} is VALID [2022-04-07 14:02:24,324 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-07 14:02:24,324 INFO L290 TraceCheckUtils]: 44: Hoare triple {2900#false} ~cond := #in~cond; {2900#false} is VALID [2022-04-07 14:02:24,324 INFO L290 TraceCheckUtils]: 45: Hoare triple {2900#false} assume 0 == ~cond; {2900#false} is VALID [2022-04-07 14:02:24,324 INFO L290 TraceCheckUtils]: 46: Hoare triple {2900#false} assume !false; {2900#false} is VALID [2022-04-07 14:02:24,325 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-07 14:02:24,325 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-04-07 14:02:24,325 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-07 14:02:24,325 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [956722781] [2022-04-07 14:02:24,325 WARN L310 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2022-04-07 14:02:24,325 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [645262203] [2022-04-07 14:02:24,325 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [645262203] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-07 14:02:24,325 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-07 14:02:24,325 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-04-07 14:02:24,325 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [234778658] [2022-04-07 14:02:24,325 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-07 14:02:24,326 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-07 14:02:24,326 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-07 14:02:24,326 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-07 14:02:24,351 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-07 14:02:24,351 INFO L554 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-04-07 14:02:24,352 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-04-07 14:02:24,352 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-04-07 14:02:24,352 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2022-04-07 14:02:24,352 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-07 14:02:24,512 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-07 14:02:24,512 INFO L93 Difference]: Finished difference Result 132 states and 169 transitions. [2022-04-07 14:02:24,512 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-04-07 14:02:24,512 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-07 14:02:24,513 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-07 14:02:24,513 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-07 14:02:24,514 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 108 transitions. [2022-04-07 14:02:24,514 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-07 14:02:24,515 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 108 transitions. [2022-04-07 14:02:24,515 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 4 states and 108 transitions. [2022-04-07 14:02:24,586 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-07 14:02:24,588 INFO L225 Difference]: With dead ends: 132 [2022-04-07 14:02:24,588 INFO L226 Difference]: Without dead ends: 101 [2022-04-07 14:02:24,588 INFO L912 BasicCegarLoop]: 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-07 14:02:24,589 INFO L913 BasicCegarLoop]: 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-07 14:02:24,589 INFO L914 BasicCegarLoop]: 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-07 14:02:24,589 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 101 states. [2022-04-07 14:02:24,627 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 101 to 91. [2022-04-07 14:02:24,628 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-07 14:02:24,628 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-07 14:02:24,628 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-07 14:02:24,628 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-07 14:02:24,631 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-07 14:02:24,631 INFO L93 Difference]: Finished difference Result 101 states and 128 transitions. [2022-04-07 14:02:24,631 INFO L276 IsEmpty]: Start isEmpty. Operand 101 states and 128 transitions. [2022-04-07 14:02:24,631 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-07 14:02:24,631 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-07 14:02:24,632 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-07 14:02:24,632 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-07 14:02:24,636 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-07 14:02:24,636 INFO L93 Difference]: Finished difference Result 101 states and 128 transitions. [2022-04-07 14:02:24,636 INFO L276 IsEmpty]: Start isEmpty. Operand 101 states and 128 transitions. [2022-04-07 14:02:24,637 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-07 14:02:24,637 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-07 14:02:24,637 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-07 14:02:24,637 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-07 14:02:24,637 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-07 14:02:24,639 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 91 states to 91 states and 113 transitions. [2022-04-07 14:02:24,639 INFO L78 Accepts]: Start accepts. Automaton has 91 states and 113 transitions. Word has length 47 [2022-04-07 14:02:24,640 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-07 14:02:24,640 INFO L478 AbstractCegarLoop]: Abstraction has 91 states and 113 transitions. [2022-04-07 14:02:24,640 INFO L479 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-07 14:02:24,640 INFO L276 IsEmpty]: Start isEmpty. Operand 91 states and 113 transitions. [2022-04-07 14:02:24,640 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 50 [2022-04-07 14:02:24,640 INFO L491 BasicCegarLoop]: Found error trace [2022-04-07 14:02:24,640 INFO L499 BasicCegarLoop]: 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-07 14:02:24,657 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-07 14:02:24,856 WARN L460 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-07 14:02:24,857 INFO L403 AbstractCegarLoop]: === Iteration 9 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-07 14:02:24,857 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-07 14:02:24,857 INFO L85 PathProgramCache]: Analyzing trace with hash 1915058849, now seen corresponding path program 1 times [2022-04-07 14:02:24,857 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-07 14:02:24,857 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [386511134] [2022-04-07 14:02:24,857 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-07 14:02:24,857 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-07 14:02:24,866 ERROR L245 FreeRefinementEngine]: Caught known exception: Unsupported non-linear arithmetic [2022-04-07 14:02:24,866 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [1770417528] [2022-04-07 14:02:24,866 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-07 14:02:24,866 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-07 14:02:24,867 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-04-07 14:02:24,867 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-07 14:02:24,884 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-07 14:02:24,913 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-07 14:02:24,914 INFO L263 TraceCheckSpWp]: Trace formula consists of 147 conjuncts, 11 conjunts are in the unsatisfiable core [2022-04-07 14:02:24,924 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-07 14:02:24,925 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-04-07 14:02:25,136 INFO L272 TraceCheckUtils]: 0: Hoare triple {3559#true} call ULTIMATE.init(); {3559#true} is VALID [2022-04-07 14:02:25,137 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-07 14:02:25,141 INFO L290 TraceCheckUtils]: 2: Hoare triple {3567#(<= ~counter~0 0)} assume true; {3567#(<= ~counter~0 0)} is VALID [2022-04-07 14:02:25,141 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {3567#(<= ~counter~0 0)} {3559#true} #102#return; {3567#(<= ~counter~0 0)} is VALID [2022-04-07 14:02:25,141 INFO L272 TraceCheckUtils]: 4: Hoare triple {3567#(<= ~counter~0 0)} call #t~ret9 := main(); {3567#(<= ~counter~0 0)} is VALID [2022-04-07 14:02:25,142 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-07 14:02:25,143 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-07 14:02:25,143 INFO L290 TraceCheckUtils]: 7: Hoare triple {3567#(<= ~counter~0 0)} ~cond := #in~cond; {3567#(<= ~counter~0 0)} is VALID [2022-04-07 14:02:25,144 INFO L290 TraceCheckUtils]: 8: Hoare triple {3567#(<= ~counter~0 0)} assume !(0 == ~cond); {3567#(<= ~counter~0 0)} is VALID [2022-04-07 14:02:25,144 INFO L290 TraceCheckUtils]: 9: Hoare triple {3567#(<= ~counter~0 0)} assume true; {3567#(<= ~counter~0 0)} is VALID [2022-04-07 14:02:25,145 INFO L284 TraceCheckUtils]: 10: Hoare quadruple {3567#(<= ~counter~0 0)} {3567#(<= ~counter~0 0)} #90#return; {3567#(<= ~counter~0 0)} is VALID [2022-04-07 14:02:25,145 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-07 14:02:25,145 INFO L290 TraceCheckUtils]: 12: Hoare triple {3567#(<= ~counter~0 0)} ~cond := #in~cond; {3567#(<= ~counter~0 0)} is VALID [2022-04-07 14:02:25,146 INFO L290 TraceCheckUtils]: 13: Hoare triple {3567#(<= ~counter~0 0)} assume !(0 == ~cond); {3567#(<= ~counter~0 0)} is VALID [2022-04-07 14:02:25,146 INFO L290 TraceCheckUtils]: 14: Hoare triple {3567#(<= ~counter~0 0)} assume true; {3567#(<= ~counter~0 0)} is VALID [2022-04-07 14:02:25,146 INFO L284 TraceCheckUtils]: 15: Hoare quadruple {3567#(<= ~counter~0 0)} {3567#(<= ~counter~0 0)} #92#return; {3567#(<= ~counter~0 0)} is VALID [2022-04-07 14:02:25,147 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-07 14:02:25,147 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-07 14:02:25,147 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-07 14:02:25,148 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-07 14:02:25,148 INFO L290 TraceCheckUtils]: 20: Hoare triple {3616#(<= ~counter~0 1)} ~cond := #in~cond; {3616#(<= ~counter~0 1)} is VALID [2022-04-07 14:02:25,149 INFO L290 TraceCheckUtils]: 21: Hoare triple {3616#(<= ~counter~0 1)} assume !(0 == ~cond); {3616#(<= ~counter~0 1)} is VALID [2022-04-07 14:02:25,149 INFO L290 TraceCheckUtils]: 22: Hoare triple {3616#(<= ~counter~0 1)} assume true; {3616#(<= ~counter~0 1)} is VALID [2022-04-07 14:02:25,149 INFO L284 TraceCheckUtils]: 23: Hoare quadruple {3616#(<= ~counter~0 1)} {3616#(<= ~counter~0 1)} #94#return; {3616#(<= ~counter~0 1)} is VALID [2022-04-07 14:02:25,150 INFO L290 TraceCheckUtils]: 24: Hoare triple {3616#(<= ~counter~0 1)} assume !!(0 != ~r~0); {3616#(<= ~counter~0 1)} is VALID [2022-04-07 14:02:25,150 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-07 14:02:25,150 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-07 14:02:25,151 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-07 14:02:25,151 INFO L290 TraceCheckUtils]: 28: Hoare triple {3641#(<= ~counter~0 2)} ~cond := #in~cond; {3641#(<= ~counter~0 2)} is VALID [2022-04-07 14:02:25,151 INFO L290 TraceCheckUtils]: 29: Hoare triple {3641#(<= ~counter~0 2)} assume !(0 == ~cond); {3641#(<= ~counter~0 2)} is VALID [2022-04-07 14:02:25,152 INFO L290 TraceCheckUtils]: 30: Hoare triple {3641#(<= ~counter~0 2)} assume true; {3641#(<= ~counter~0 2)} is VALID [2022-04-07 14:02:25,152 INFO L284 TraceCheckUtils]: 31: Hoare quadruple {3641#(<= ~counter~0 2)} {3641#(<= ~counter~0 2)} #96#return; {3641#(<= ~counter~0 2)} is VALID [2022-04-07 14:02:25,152 INFO L290 TraceCheckUtils]: 32: Hoare triple {3641#(<= ~counter~0 2)} assume !(~r~0 > 0); {3641#(<= ~counter~0 2)} is VALID [2022-04-07 14:02:25,153 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-07 14:02:25,153 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-07 14:02:25,154 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-07 14:02:25,154 INFO L290 TraceCheckUtils]: 36: Hoare triple {3666#(<= ~counter~0 3)} ~cond := #in~cond; {3666#(<= ~counter~0 3)} is VALID [2022-04-07 14:02:25,154 INFO L290 TraceCheckUtils]: 37: Hoare triple {3666#(<= ~counter~0 3)} assume !(0 == ~cond); {3666#(<= ~counter~0 3)} is VALID [2022-04-07 14:02:25,155 INFO L290 TraceCheckUtils]: 38: Hoare triple {3666#(<= ~counter~0 3)} assume true; {3666#(<= ~counter~0 3)} is VALID [2022-04-07 14:02:25,155 INFO L284 TraceCheckUtils]: 39: Hoare quadruple {3666#(<= ~counter~0 3)} {3666#(<= ~counter~0 3)} #98#return; {3666#(<= ~counter~0 3)} is VALID [2022-04-07 14:02:25,155 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-07 14:02:25,156 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-07 14:02:25,156 INFO L290 TraceCheckUtils]: 42: Hoare triple {3691#(<= |main_#t~post8| 3)} assume !(#t~post8 < 5);havoc #t~post8; {3560#false} is VALID [2022-04-07 14:02:25,156 INFO L290 TraceCheckUtils]: 43: Hoare triple {3560#false} #t~post6 := ~counter~0;~counter~0 := 1 + #t~post6; {3560#false} is VALID [2022-04-07 14:02:25,156 INFO L290 TraceCheckUtils]: 44: Hoare triple {3560#false} assume !(#t~post6 < 5);havoc #t~post6; {3560#false} is VALID [2022-04-07 14:02:25,156 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-07 14:02:25,156 INFO L290 TraceCheckUtils]: 46: Hoare triple {3560#false} ~cond := #in~cond; {3560#false} is VALID [2022-04-07 14:02:25,156 INFO L290 TraceCheckUtils]: 47: Hoare triple {3560#false} assume 0 == ~cond; {3560#false} is VALID [2022-04-07 14:02:25,157 INFO L290 TraceCheckUtils]: 48: Hoare triple {3560#false} assume !false; {3560#false} is VALID [2022-04-07 14:02:25,157 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-07 14:02:25,157 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-04-07 14:02:25,376 INFO L290 TraceCheckUtils]: 48: Hoare triple {3560#false} assume !false; {3560#false} is VALID [2022-04-07 14:02:25,376 INFO L290 TraceCheckUtils]: 47: Hoare triple {3560#false} assume 0 == ~cond; {3560#false} is VALID [2022-04-07 14:02:25,376 INFO L290 TraceCheckUtils]: 46: Hoare triple {3560#false} ~cond := #in~cond; {3560#false} is VALID [2022-04-07 14:02:25,376 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-07 14:02:25,376 INFO L290 TraceCheckUtils]: 44: Hoare triple {3560#false} assume !(#t~post6 < 5);havoc #t~post6; {3560#false} is VALID [2022-04-07 14:02:25,376 INFO L290 TraceCheckUtils]: 43: Hoare triple {3560#false} #t~post6 := ~counter~0;~counter~0 := 1 + #t~post6; {3560#false} is VALID [2022-04-07 14:02:25,380 INFO L290 TraceCheckUtils]: 42: Hoare triple {3731#(< |main_#t~post8| 5)} assume !(#t~post8 < 5);havoc #t~post8; {3560#false} is VALID [2022-04-07 14:02:25,380 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-07 14:02:25,380 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-07 14:02:25,381 INFO L284 TraceCheckUtils]: 39: Hoare quadruple {3559#true} {3735#(< ~counter~0 5)} #98#return; {3735#(< ~counter~0 5)} is VALID [2022-04-07 14:02:25,381 INFO L290 TraceCheckUtils]: 38: Hoare triple {3559#true} assume true; {3559#true} is VALID [2022-04-07 14:02:25,381 INFO L290 TraceCheckUtils]: 37: Hoare triple {3559#true} assume !(0 == ~cond); {3559#true} is VALID [2022-04-07 14:02:25,381 INFO L290 TraceCheckUtils]: 36: Hoare triple {3559#true} ~cond := #in~cond; {3559#true} is VALID [2022-04-07 14:02:25,381 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-07 14:02:25,381 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-07 14:02:25,382 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-07 14:02:25,382 INFO L290 TraceCheckUtils]: 32: Hoare triple {3666#(<= ~counter~0 3)} assume !(~r~0 > 0); {3666#(<= ~counter~0 3)} is VALID [2022-04-07 14:02:25,382 INFO L284 TraceCheckUtils]: 31: Hoare quadruple {3559#true} {3666#(<= ~counter~0 3)} #96#return; {3666#(<= ~counter~0 3)} is VALID [2022-04-07 14:02:25,382 INFO L290 TraceCheckUtils]: 30: Hoare triple {3559#true} assume true; {3559#true} is VALID [2022-04-07 14:02:25,383 INFO L290 TraceCheckUtils]: 29: Hoare triple {3559#true} assume !(0 == ~cond); {3559#true} is VALID [2022-04-07 14:02:25,383 INFO L290 TraceCheckUtils]: 28: Hoare triple {3559#true} ~cond := #in~cond; {3559#true} is VALID [2022-04-07 14:02:25,383 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-07 14:02:25,383 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-07 14:02:25,383 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-07 14:02:25,384 INFO L290 TraceCheckUtils]: 24: Hoare triple {3641#(<= ~counter~0 2)} assume !!(0 != ~r~0); {3641#(<= ~counter~0 2)} is VALID [2022-04-07 14:02:25,384 INFO L284 TraceCheckUtils]: 23: Hoare quadruple {3559#true} {3641#(<= ~counter~0 2)} #94#return; {3641#(<= ~counter~0 2)} is VALID [2022-04-07 14:02:25,384 INFO L290 TraceCheckUtils]: 22: Hoare triple {3559#true} assume true; {3559#true} is VALID [2022-04-07 14:02:25,384 INFO L290 TraceCheckUtils]: 21: Hoare triple {3559#true} assume !(0 == ~cond); {3559#true} is VALID [2022-04-07 14:02:25,384 INFO L290 TraceCheckUtils]: 20: Hoare triple {3559#true} ~cond := #in~cond; {3559#true} is VALID [2022-04-07 14:02:25,384 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-07 14:02:25,385 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-07 14:02:25,385 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-07 14:02:25,385 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-07 14:02:25,386 INFO L284 TraceCheckUtils]: 15: Hoare quadruple {3559#true} {3616#(<= ~counter~0 1)} #92#return; {3616#(<= ~counter~0 1)} is VALID [2022-04-07 14:02:25,386 INFO L290 TraceCheckUtils]: 14: Hoare triple {3559#true} assume true; {3559#true} is VALID [2022-04-07 14:02:25,386 INFO L290 TraceCheckUtils]: 13: Hoare triple {3559#true} assume !(0 == ~cond); {3559#true} is VALID [2022-04-07 14:02:25,386 INFO L290 TraceCheckUtils]: 12: Hoare triple {3559#true} ~cond := #in~cond; {3559#true} is VALID [2022-04-07 14:02:25,386 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-07 14:02:25,386 INFO L284 TraceCheckUtils]: 10: Hoare quadruple {3559#true} {3616#(<= ~counter~0 1)} #90#return; {3616#(<= ~counter~0 1)} is VALID [2022-04-07 14:02:25,386 INFO L290 TraceCheckUtils]: 9: Hoare triple {3559#true} assume true; {3559#true} is VALID [2022-04-07 14:02:25,386 INFO L290 TraceCheckUtils]: 8: Hoare triple {3559#true} assume !(0 == ~cond); {3559#true} is VALID [2022-04-07 14:02:25,387 INFO L290 TraceCheckUtils]: 7: Hoare triple {3559#true} ~cond := #in~cond; {3559#true} is VALID [2022-04-07 14:02:25,387 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-07 14:02:25,387 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-07 14:02:25,387 INFO L272 TraceCheckUtils]: 4: Hoare triple {3616#(<= ~counter~0 1)} call #t~ret9 := main(); {3616#(<= ~counter~0 1)} is VALID [2022-04-07 14:02:25,387 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {3616#(<= ~counter~0 1)} {3559#true} #102#return; {3616#(<= ~counter~0 1)} is VALID [2022-04-07 14:02:25,388 INFO L290 TraceCheckUtils]: 2: Hoare triple {3616#(<= ~counter~0 1)} assume true; {3616#(<= ~counter~0 1)} is VALID [2022-04-07 14:02:25,388 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-07 14:02:25,388 INFO L272 TraceCheckUtils]: 0: Hoare triple {3559#true} call ULTIMATE.init(); {3559#true} is VALID [2022-04-07 14:02:25,388 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-07 14:02:25,389 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-07 14:02:25,389 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [386511134] [2022-04-07 14:02:25,389 WARN L310 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2022-04-07 14:02:25,389 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1770417528] [2022-04-07 14:02:25,389 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1770417528] provided 0 perfect and 2 imperfect interpolant sequences [2022-04-07 14:02:25,389 INFO L184 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2022-04-07 14:02:25,389 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 7] total 9 [2022-04-07 14:02:25,389 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1193639890] [2022-04-07 14:02:25,389 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2022-04-07 14:02:25,390 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-07 14:02:25,390 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-07 14:02:25,390 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-07 14:02:25,448 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-07 14:02:25,449 INFO L554 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2022-04-07 14:02:25,449 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-04-07 14:02:25,449 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2022-04-07 14:02:25,449 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=26, Invalid=46, Unknown=0, NotChecked=0, Total=72 [2022-04-07 14:02:25,449 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-07 14:02:25,688 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-07 14:02:25,688 INFO L93 Difference]: Finished difference Result 132 states and 171 transitions. [2022-04-07 14:02:25,688 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2022-04-07 14:02:25,688 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-07 14:02:25,688 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-07 14:02:25,689 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-07 14:02:25,690 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 10 states to 10 states and 118 transitions. [2022-04-07 14:02:25,690 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-07 14:02:25,691 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 10 states to 10 states and 118 transitions. [2022-04-07 14:02:25,692 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 10 states and 118 transitions. [2022-04-07 14:02:25,767 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-07 14:02:25,771 INFO L225 Difference]: With dead ends: 132 [2022-04-07 14:02:25,771 INFO L226 Difference]: Without dead ends: 95 [2022-04-07 14:02:25,772 INFO L912 BasicCegarLoop]: 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-07 14:02:25,772 INFO L913 BasicCegarLoop]: 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-07 14:02:25,772 INFO L914 BasicCegarLoop]: 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-07 14:02:25,773 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 95 states. [2022-04-07 14:02:25,810 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 95 to 94. [2022-04-07 14:02:25,810 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-07 14:02:25,811 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-07 14:02:25,811 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-07 14:02:25,811 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-07 14:02:25,813 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-07 14:02:25,813 INFO L93 Difference]: Finished difference Result 95 states and 117 transitions. [2022-04-07 14:02:25,814 INFO L276 IsEmpty]: Start isEmpty. Operand 95 states and 117 transitions. [2022-04-07 14:02:25,814 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-07 14:02:25,814 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-07 14:02:25,814 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-07 14:02:25,814 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-07 14:02:25,816 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-07 14:02:25,816 INFO L93 Difference]: Finished difference Result 95 states and 117 transitions. [2022-04-07 14:02:25,816 INFO L276 IsEmpty]: Start isEmpty. Operand 95 states and 117 transitions. [2022-04-07 14:02:25,816 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-07 14:02:25,816 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-07 14:02:25,816 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-07 14:02:25,816 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-07 14:02:25,816 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-07 14:02:25,818 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 94 states to 94 states and 116 transitions. [2022-04-07 14:02:25,818 INFO L78 Accepts]: Start accepts. Automaton has 94 states and 116 transitions. Word has length 49 [2022-04-07 14:02:25,818 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-07 14:02:25,818 INFO L478 AbstractCegarLoop]: Abstraction has 94 states and 116 transitions. [2022-04-07 14:02:25,818 INFO L479 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-07 14:02:25,818 INFO L276 IsEmpty]: Start isEmpty. Operand 94 states and 116 transitions. [2022-04-07 14:02:25,819 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 56 [2022-04-07 14:02:25,819 INFO L491 BasicCegarLoop]: Found error trace [2022-04-07 14:02:25,819 INFO L499 BasicCegarLoop]: 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-07 14:02:25,837 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-07 14:02:26,035 WARN L460 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-07 14:02:26,035 INFO L403 AbstractCegarLoop]: === Iteration 10 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-07 14:02:26,036 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-07 14:02:26,036 INFO L85 PathProgramCache]: Analyzing trace with hash -1067781299, now seen corresponding path program 1 times [2022-04-07 14:02:26,036 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-07 14:02:26,036 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [654422569] [2022-04-07 14:02:26,036 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-07 14:02:26,036 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-07 14:02:26,047 ERROR L245 FreeRefinementEngine]: Caught known exception: Unsupported non-linear arithmetic [2022-04-07 14:02:26,047 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [561724693] [2022-04-07 14:02:26,047 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-07 14:02:26,047 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-07 14:02:26,047 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-04-07 14:02:26,048 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-07 14:02:26,071 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-07 14:02:26,114 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-07 14:02:26,115 INFO L263 TraceCheckSpWp]: Trace formula consists of 157 conjuncts, 13 conjunts are in the unsatisfiable core [2022-04-07 14:02:26,123 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-07 14:02:26,124 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-04-07 14:02:26,373 INFO L272 TraceCheckUtils]: 0: Hoare triple {4371#true} call ULTIMATE.init(); {4371#true} is VALID [2022-04-07 14:02:26,374 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-07 14:02:26,374 INFO L290 TraceCheckUtils]: 2: Hoare triple {4379#(<= ~counter~0 0)} assume true; {4379#(<= ~counter~0 0)} is VALID [2022-04-07 14:02:26,375 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {4379#(<= ~counter~0 0)} {4371#true} #102#return; {4379#(<= ~counter~0 0)} is VALID [2022-04-07 14:02:26,375 INFO L272 TraceCheckUtils]: 4: Hoare triple {4379#(<= ~counter~0 0)} call #t~ret9 := main(); {4379#(<= ~counter~0 0)} is VALID [2022-04-07 14:02:26,376 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-07 14:02:26,376 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-07 14:02:26,376 INFO L290 TraceCheckUtils]: 7: Hoare triple {4379#(<= ~counter~0 0)} ~cond := #in~cond; {4379#(<= ~counter~0 0)} is VALID [2022-04-07 14:02:26,377 INFO L290 TraceCheckUtils]: 8: Hoare triple {4379#(<= ~counter~0 0)} assume !(0 == ~cond); {4379#(<= ~counter~0 0)} is VALID [2022-04-07 14:02:26,377 INFO L290 TraceCheckUtils]: 9: Hoare triple {4379#(<= ~counter~0 0)} assume true; {4379#(<= ~counter~0 0)} is VALID [2022-04-07 14:02:26,377 INFO L284 TraceCheckUtils]: 10: Hoare quadruple {4379#(<= ~counter~0 0)} {4379#(<= ~counter~0 0)} #90#return; {4379#(<= ~counter~0 0)} is VALID [2022-04-07 14:02:26,378 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-07 14:02:26,378 INFO L290 TraceCheckUtils]: 12: Hoare triple {4379#(<= ~counter~0 0)} ~cond := #in~cond; {4379#(<= ~counter~0 0)} is VALID [2022-04-07 14:02:26,378 INFO L290 TraceCheckUtils]: 13: Hoare triple {4379#(<= ~counter~0 0)} assume !(0 == ~cond); {4379#(<= ~counter~0 0)} is VALID [2022-04-07 14:02:26,379 INFO L290 TraceCheckUtils]: 14: Hoare triple {4379#(<= ~counter~0 0)} assume true; {4379#(<= ~counter~0 0)} is VALID [2022-04-07 14:02:26,379 INFO L284 TraceCheckUtils]: 15: Hoare quadruple {4379#(<= ~counter~0 0)} {4379#(<= ~counter~0 0)} #92#return; {4379#(<= ~counter~0 0)} is VALID [2022-04-07 14:02:26,379 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-07 14:02:26,380 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-07 14:02:26,380 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-07 14:02:26,381 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-07 14:02:26,381 INFO L290 TraceCheckUtils]: 20: Hoare triple {4428#(<= ~counter~0 1)} ~cond := #in~cond; {4428#(<= ~counter~0 1)} is VALID [2022-04-07 14:02:26,381 INFO L290 TraceCheckUtils]: 21: Hoare triple {4428#(<= ~counter~0 1)} assume !(0 == ~cond); {4428#(<= ~counter~0 1)} is VALID [2022-04-07 14:02:26,382 INFO L290 TraceCheckUtils]: 22: Hoare triple {4428#(<= ~counter~0 1)} assume true; {4428#(<= ~counter~0 1)} is VALID [2022-04-07 14:02:26,382 INFO L284 TraceCheckUtils]: 23: Hoare quadruple {4428#(<= ~counter~0 1)} {4428#(<= ~counter~0 1)} #94#return; {4428#(<= ~counter~0 1)} is VALID [2022-04-07 14:02:26,382 INFO L290 TraceCheckUtils]: 24: Hoare triple {4428#(<= ~counter~0 1)} assume !!(0 != ~r~0); {4428#(<= ~counter~0 1)} is VALID [2022-04-07 14:02:26,383 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-07 14:02:26,383 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-07 14:02:26,384 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-07 14:02:26,384 INFO L290 TraceCheckUtils]: 28: Hoare triple {4453#(<= ~counter~0 2)} ~cond := #in~cond; {4453#(<= ~counter~0 2)} is VALID [2022-04-07 14:02:26,384 INFO L290 TraceCheckUtils]: 29: Hoare triple {4453#(<= ~counter~0 2)} assume !(0 == ~cond); {4453#(<= ~counter~0 2)} is VALID [2022-04-07 14:02:26,384 INFO L290 TraceCheckUtils]: 30: Hoare triple {4453#(<= ~counter~0 2)} assume true; {4453#(<= ~counter~0 2)} is VALID [2022-04-07 14:02:26,385 INFO L284 TraceCheckUtils]: 31: Hoare quadruple {4453#(<= ~counter~0 2)} {4453#(<= ~counter~0 2)} #96#return; {4453#(<= ~counter~0 2)} is VALID [2022-04-07 14:02:26,385 INFO L290 TraceCheckUtils]: 32: Hoare triple {4453#(<= ~counter~0 2)} assume !(~r~0 > 0); {4453#(<= ~counter~0 2)} is VALID [2022-04-07 14:02:26,386 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-07 14:02:26,386 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-07 14:02:26,387 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-07 14:02:26,387 INFO L290 TraceCheckUtils]: 36: Hoare triple {4478#(<= ~counter~0 3)} ~cond := #in~cond; {4478#(<= ~counter~0 3)} is VALID [2022-04-07 14:02:26,387 INFO L290 TraceCheckUtils]: 37: Hoare triple {4478#(<= ~counter~0 3)} assume !(0 == ~cond); {4478#(<= ~counter~0 3)} is VALID [2022-04-07 14:02:26,387 INFO L290 TraceCheckUtils]: 38: Hoare triple {4478#(<= ~counter~0 3)} assume true; {4478#(<= ~counter~0 3)} is VALID [2022-04-07 14:02:26,388 INFO L284 TraceCheckUtils]: 39: Hoare quadruple {4478#(<= ~counter~0 3)} {4478#(<= ~counter~0 3)} #98#return; {4478#(<= ~counter~0 3)} is VALID [2022-04-07 14:02:26,388 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-07 14:02:26,389 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-07 14:02:26,389 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-07 14:02:26,389 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-07 14:02:26,390 INFO L290 TraceCheckUtils]: 44: Hoare triple {4503#(<= ~counter~0 4)} ~cond := #in~cond; {4503#(<= ~counter~0 4)} is VALID [2022-04-07 14:02:26,390 INFO L290 TraceCheckUtils]: 45: Hoare triple {4503#(<= ~counter~0 4)} assume !(0 == ~cond); {4503#(<= ~counter~0 4)} is VALID [2022-04-07 14:02:26,390 INFO L290 TraceCheckUtils]: 46: Hoare triple {4503#(<= ~counter~0 4)} assume true; {4503#(<= ~counter~0 4)} is VALID [2022-04-07 14:02:26,391 INFO L284 TraceCheckUtils]: 47: Hoare quadruple {4503#(<= ~counter~0 4)} {4503#(<= ~counter~0 4)} #98#return; {4503#(<= ~counter~0 4)} is VALID [2022-04-07 14:02:26,391 INFO L290 TraceCheckUtils]: 48: Hoare triple {4503#(<= ~counter~0 4)} assume !(~r~0 < 0); {4503#(<= ~counter~0 4)} is VALID [2022-04-07 14:02:26,391 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-07 14:02:26,392 INFO L290 TraceCheckUtils]: 50: Hoare triple {4528#(<= |main_#t~post6| 4)} assume !(#t~post6 < 5);havoc #t~post6; {4372#false} is VALID [2022-04-07 14:02:26,392 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-07 14:02:26,392 INFO L290 TraceCheckUtils]: 52: Hoare triple {4372#false} ~cond := #in~cond; {4372#false} is VALID [2022-04-07 14:02:26,392 INFO L290 TraceCheckUtils]: 53: Hoare triple {4372#false} assume 0 == ~cond; {4372#false} is VALID [2022-04-07 14:02:26,392 INFO L290 TraceCheckUtils]: 54: Hoare triple {4372#false} assume !false; {4372#false} is VALID [2022-04-07 14:02:26,392 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-07 14:02:26,392 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-04-07 14:02:26,657 INFO L290 TraceCheckUtils]: 54: Hoare triple {4372#false} assume !false; {4372#false} is VALID [2022-04-07 14:02:26,657 INFO L290 TraceCheckUtils]: 53: Hoare triple {4372#false} assume 0 == ~cond; {4372#false} is VALID [2022-04-07 14:02:26,657 INFO L290 TraceCheckUtils]: 52: Hoare triple {4372#false} ~cond := #in~cond; {4372#false} is VALID [2022-04-07 14:02:26,657 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-07 14:02:26,657 INFO L290 TraceCheckUtils]: 50: Hoare triple {4528#(<= |main_#t~post6| 4)} assume !(#t~post6 < 5);havoc #t~post6; {4372#false} is VALID [2022-04-07 14:02:26,658 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-07 14:02:26,658 INFO L290 TraceCheckUtils]: 48: Hoare triple {4503#(<= ~counter~0 4)} assume !(~r~0 < 0); {4503#(<= ~counter~0 4)} is VALID [2022-04-07 14:02:26,658 INFO L284 TraceCheckUtils]: 47: Hoare quadruple {4371#true} {4503#(<= ~counter~0 4)} #98#return; {4503#(<= ~counter~0 4)} is VALID [2022-04-07 14:02:26,659 INFO L290 TraceCheckUtils]: 46: Hoare triple {4371#true} assume true; {4371#true} is VALID [2022-04-07 14:02:26,659 INFO L290 TraceCheckUtils]: 45: Hoare triple {4371#true} assume !(0 == ~cond); {4371#true} is VALID [2022-04-07 14:02:26,659 INFO L290 TraceCheckUtils]: 44: Hoare triple {4371#true} ~cond := #in~cond; {4371#true} is VALID [2022-04-07 14:02:26,659 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-07 14:02:26,659 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-07 14:02:26,659 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-07 14:02:26,660 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-07 14:02:26,660 INFO L284 TraceCheckUtils]: 39: Hoare quadruple {4371#true} {4478#(<= ~counter~0 3)} #98#return; {4478#(<= ~counter~0 3)} is VALID [2022-04-07 14:02:26,660 INFO L290 TraceCheckUtils]: 38: Hoare triple {4371#true} assume true; {4371#true} is VALID [2022-04-07 14:02:26,660 INFO L290 TraceCheckUtils]: 37: Hoare triple {4371#true} assume !(0 == ~cond); {4371#true} is VALID [2022-04-07 14:02:26,660 INFO L290 TraceCheckUtils]: 36: Hoare triple {4371#true} ~cond := #in~cond; {4371#true} is VALID [2022-04-07 14:02:26,660 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-07 14:02:26,660 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-07 14:02:26,661 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-07 14:02:26,661 INFO L290 TraceCheckUtils]: 32: Hoare triple {4453#(<= ~counter~0 2)} assume !(~r~0 > 0); {4453#(<= ~counter~0 2)} is VALID [2022-04-07 14:02:26,661 INFO L284 TraceCheckUtils]: 31: Hoare quadruple {4371#true} {4453#(<= ~counter~0 2)} #96#return; {4453#(<= ~counter~0 2)} is VALID [2022-04-07 14:02:26,662 INFO L290 TraceCheckUtils]: 30: Hoare triple {4371#true} assume true; {4371#true} is VALID [2022-04-07 14:02:26,662 INFO L290 TraceCheckUtils]: 29: Hoare triple {4371#true} assume !(0 == ~cond); {4371#true} is VALID [2022-04-07 14:02:26,662 INFO L290 TraceCheckUtils]: 28: Hoare triple {4371#true} ~cond := #in~cond; {4371#true} is VALID [2022-04-07 14:02:26,662 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-07 14:02:26,662 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-07 14:02:26,662 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-07 14:02:26,663 INFO L290 TraceCheckUtils]: 24: Hoare triple {4428#(<= ~counter~0 1)} assume !!(0 != ~r~0); {4428#(<= ~counter~0 1)} is VALID [2022-04-07 14:02:26,663 INFO L284 TraceCheckUtils]: 23: Hoare quadruple {4371#true} {4428#(<= ~counter~0 1)} #94#return; {4428#(<= ~counter~0 1)} is VALID [2022-04-07 14:02:26,663 INFO L290 TraceCheckUtils]: 22: Hoare triple {4371#true} assume true; {4371#true} is VALID [2022-04-07 14:02:26,663 INFO L290 TraceCheckUtils]: 21: Hoare triple {4371#true} assume !(0 == ~cond); {4371#true} is VALID [2022-04-07 14:02:26,663 INFO L290 TraceCheckUtils]: 20: Hoare triple {4371#true} ~cond := #in~cond; {4371#true} is VALID [2022-04-07 14:02:26,663 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-07 14:02:26,663 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-07 14:02:26,664 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-07 14:02:26,664 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-07 14:02:26,664 INFO L284 TraceCheckUtils]: 15: Hoare quadruple {4371#true} {4379#(<= ~counter~0 0)} #92#return; {4379#(<= ~counter~0 0)} is VALID [2022-04-07 14:02:26,665 INFO L290 TraceCheckUtils]: 14: Hoare triple {4371#true} assume true; {4371#true} is VALID [2022-04-07 14:02:26,665 INFO L290 TraceCheckUtils]: 13: Hoare triple {4371#true} assume !(0 == ~cond); {4371#true} is VALID [2022-04-07 14:02:26,665 INFO L290 TraceCheckUtils]: 12: Hoare triple {4371#true} ~cond := #in~cond; {4371#true} is VALID [2022-04-07 14:02:26,665 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-07 14:02:26,665 INFO L284 TraceCheckUtils]: 10: Hoare quadruple {4371#true} {4379#(<= ~counter~0 0)} #90#return; {4379#(<= ~counter~0 0)} is VALID [2022-04-07 14:02:26,665 INFO L290 TraceCheckUtils]: 9: Hoare triple {4371#true} assume true; {4371#true} is VALID [2022-04-07 14:02:26,665 INFO L290 TraceCheckUtils]: 8: Hoare triple {4371#true} assume !(0 == ~cond); {4371#true} is VALID [2022-04-07 14:02:26,665 INFO L290 TraceCheckUtils]: 7: Hoare triple {4371#true} ~cond := #in~cond; {4371#true} is VALID [2022-04-07 14:02:26,665 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-07 14:02:26,666 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-07 14:02:26,666 INFO L272 TraceCheckUtils]: 4: Hoare triple {4379#(<= ~counter~0 0)} call #t~ret9 := main(); {4379#(<= ~counter~0 0)} is VALID [2022-04-07 14:02:26,666 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {4379#(<= ~counter~0 0)} {4371#true} #102#return; {4379#(<= ~counter~0 0)} is VALID [2022-04-07 14:02:26,666 INFO L290 TraceCheckUtils]: 2: Hoare triple {4379#(<= ~counter~0 0)} assume true; {4379#(<= ~counter~0 0)} is VALID [2022-04-07 14:02:26,667 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-07 14:02:26,667 INFO L272 TraceCheckUtils]: 0: Hoare triple {4371#true} call ULTIMATE.init(); {4371#true} is VALID [2022-04-07 14:02:26,667 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-07 14:02:26,667 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-07 14:02:26,667 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [654422569] [2022-04-07 14:02:26,667 WARN L310 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2022-04-07 14:02:26,667 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [561724693] [2022-04-07 14:02:26,667 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [561724693] provided 0 perfect and 2 imperfect interpolant sequences [2022-04-07 14:02:26,667 INFO L184 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2022-04-07 14:02:26,667 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [8, 8] total 8 [2022-04-07 14:02:26,668 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [937343008] [2022-04-07 14:02:26,668 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2022-04-07 14:02:26,669 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-07 14:02:26,673 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-07 14:02:26,673 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-07 14:02:26,719 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-07 14:02:26,719 INFO L554 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2022-04-07 14:02:26,719 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-04-07 14:02:26,719 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2022-04-07 14:02:26,720 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=23, Invalid=33, Unknown=0, NotChecked=0, Total=56 [2022-04-07 14:02:26,720 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-07 14:02:26,926 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-07 14:02:26,926 INFO L93 Difference]: Finished difference Result 101 states and 123 transitions. [2022-04-07 14:02:26,926 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2022-04-07 14:02:26,927 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-07 14:02:26,927 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-07 14:02:26,927 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-07 14:02:26,928 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9 states to 9 states and 95 transitions. [2022-04-07 14:02:26,928 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-07 14:02:26,929 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9 states to 9 states and 95 transitions. [2022-04-07 14:02:26,929 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 9 states and 95 transitions. [2022-04-07 14:02:26,989 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-07 14:02:26,991 INFO L225 Difference]: With dead ends: 101 [2022-04-07 14:02:26,991 INFO L226 Difference]: Without dead ends: 96 [2022-04-07 14:02:26,991 INFO L912 BasicCegarLoop]: 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-07 14:02:26,991 INFO L913 BasicCegarLoop]: 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-07 14:02:26,992 INFO L914 BasicCegarLoop]: 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-07 14:02:26,992 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 96 states. [2022-04-07 14:02:27,031 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 96 to 96. [2022-04-07 14:02:27,031 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-07 14:02:27,031 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-07 14:02:27,032 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-07 14:02:27,032 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-07 14:02:27,034 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-07 14:02:27,034 INFO L93 Difference]: Finished difference Result 96 states and 118 transitions. [2022-04-07 14:02:27,035 INFO L276 IsEmpty]: Start isEmpty. Operand 96 states and 118 transitions. [2022-04-07 14:02:27,035 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-07 14:02:27,035 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-07 14:02:27,035 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-07 14:02:27,035 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-07 14:02:27,037 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-07 14:02:27,037 INFO L93 Difference]: Finished difference Result 96 states and 118 transitions. [2022-04-07 14:02:27,037 INFO L276 IsEmpty]: Start isEmpty. Operand 96 states and 118 transitions. [2022-04-07 14:02:27,038 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-07 14:02:27,038 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-07 14:02:27,038 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-07 14:02:27,038 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-07 14:02:27,038 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-07 14:02:27,040 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 96 states to 96 states and 118 transitions. [2022-04-07 14:02:27,040 INFO L78 Accepts]: Start accepts. Automaton has 96 states and 118 transitions. Word has length 55 [2022-04-07 14:02:27,041 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-07 14:02:27,041 INFO L478 AbstractCegarLoop]: Abstraction has 96 states and 118 transitions. [2022-04-07 14:02:27,041 INFO L479 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-07 14:02:27,041 INFO L276 IsEmpty]: Start isEmpty. Operand 96 states and 118 transitions. [2022-04-07 14:02:27,042 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 64 [2022-04-07 14:02:27,042 INFO L491 BasicCegarLoop]: Found error trace [2022-04-07 14:02:27,042 INFO L499 BasicCegarLoop]: 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-07 14:02:27,060 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-07 14:02:27,254 WARN L460 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-07 14:02:27,254 INFO L403 AbstractCegarLoop]: === Iteration 11 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-07 14:02:27,254 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-07 14:02:27,255 INFO L85 PathProgramCache]: Analyzing trace with hash -1402694082, now seen corresponding path program 2 times [2022-04-07 14:02:27,255 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-07 14:02:27,255 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [332132318] [2022-04-07 14:02:27,255 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-07 14:02:27,255 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-07 14:02:27,264 ERROR L245 FreeRefinementEngine]: Caught known exception: Unsupported non-linear arithmetic [2022-04-07 14:02:27,264 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [135163602] [2022-04-07 14:02:27,264 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2022-04-07 14:02:27,264 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-07 14:02:27,265 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-04-07 14:02:27,265 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-07 14:02:27,266 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-07 14:02:27,305 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2022-04-07 14:02:27,305 INFO L229 tOrderPrioritization]: Conjunction of SSA is sat [2022-04-07 14:02:27,305 INFO L352 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2022-04-07 14:02:27,321 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-04-07 14:02:27,343 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2022-04-07 14:02:27,343 INFO L618 BasicCegarLoop]: Counterexample is feasible [2022-04-07 14:02:27,344 INFO L788 garLoopResultBuilder]: Registering result UNSAFE for location __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION (0 of 1 remaining) [2022-04-07 14:02:27,382 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-07 14:02:27,555 WARN L460 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-07 14:02:27,558 INFO L719 BasicCegarLoop]: Path program histogram: [2, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-07 14:02:27,560 INFO L178 ceAbstractionStarter]: Computing trace abstraction results [2022-04-07 14:02:27,586 WARN L170 areAnnotationChecker]: reach_errorENTRY has no Hoare annotation [2022-04-07 14:02:27,586 WARN L170 areAnnotationChecker]: ULTIMATE.initENTRY has no Hoare annotation [2022-04-07 14:02:27,586 WARN L170 areAnnotationChecker]: ULTIMATE.startENTRY has no Hoare annotation [2022-04-07 14:02:27,586 WARN L170 areAnnotationChecker]: ULTIMATE.startENTRY has no Hoare annotation [2022-04-07 14:02:27,586 WARN L170 areAnnotationChecker]: assume_abort_if_notENTRY has no Hoare annotation [2022-04-07 14:02:27,586 WARN L170 areAnnotationChecker]: mainENTRY has no Hoare annotation [2022-04-07 14:02:27,586 WARN L170 areAnnotationChecker]: __VERIFIER_assertENTRY has no Hoare annotation [2022-04-07 14:02:27,586 WARN L170 areAnnotationChecker]: reach_errorFINAL has no Hoare annotation [2022-04-07 14:02:27,586 WARN L170 areAnnotationChecker]: ULTIMATE.initFINAL has no Hoare annotation [2022-04-07 14:02:27,586 WARN L170 areAnnotationChecker]: L-1 has no Hoare annotation [2022-04-07 14:02:27,586 WARN L170 areAnnotationChecker]: L-1 has no Hoare annotation [2022-04-07 14:02:27,586 WARN L170 areAnnotationChecker]: L9 has no Hoare annotation [2022-04-07 14:02:27,586 WARN L170 areAnnotationChecker]: L9 has no Hoare annotation [2022-04-07 14:02:27,586 WARN L170 areAnnotationChecker]: L25 has no Hoare annotation [2022-04-07 14:02:27,586 WARN L170 areAnnotationChecker]: L25 has no Hoare annotation [2022-04-07 14:02:27,587 WARN L170 areAnnotationChecker]: L12 has no Hoare annotation [2022-04-07 14:02:27,587 WARN L170 areAnnotationChecker]: L12 has no Hoare annotation [2022-04-07 14:02:27,587 WARN L170 areAnnotationChecker]: ULTIMATE.initEXIT has no Hoare annotation [2022-04-07 14:02:27,587 WARN L170 areAnnotationChecker]: ULTIMATE.startFINAL has no Hoare annotation [2022-04-07 14:02:27,587 WARN L170 areAnnotationChecker]: L9-2 has no Hoare annotation [2022-04-07 14:02:27,587 WARN L170 areAnnotationChecker]: L25-1 has no Hoare annotation [2022-04-07 14:02:27,587 WARN L170 areAnnotationChecker]: L25-1 has no Hoare annotation [2022-04-07 14:02:27,587 WARN L170 areAnnotationChecker]: L13 has no Hoare annotation [2022-04-07 14:02:27,587 WARN L170 areAnnotationChecker]: L13 has no Hoare annotation [2022-04-07 14:02:27,587 WARN L170 areAnnotationChecker]: L12-2 has no Hoare annotation [2022-04-07 14:02:27,587 WARN L170 areAnnotationChecker]: assume_abort_if_notEXIT has no Hoare annotation [2022-04-07 14:02:27,587 WARN L170 areAnnotationChecker]: assume_abort_if_notEXIT has no Hoare annotation [2022-04-07 14:02:27,587 WARN L170 areAnnotationChecker]: L27 has no Hoare annotation [2022-04-07 14:02:27,587 WARN L170 areAnnotationChecker]: __VERIFIER_assertEXIT has no Hoare annotation [2022-04-07 14:02:27,587 WARN L170 areAnnotationChecker]: __VERIFIER_assertEXIT has no Hoare annotation [2022-04-07 14:02:27,587 WARN L170 areAnnotationChecker]: __VERIFIER_assertEXIT has no Hoare annotation [2022-04-07 14:02:27,587 WARN L170 areAnnotationChecker]: __VERIFIER_assertEXIT has no Hoare annotation [2022-04-07 14:02:27,587 WARN L170 areAnnotationChecker]: L47-3 has no Hoare annotation [2022-04-07 14:02:27,587 WARN L170 areAnnotationChecker]: L47-3 has no Hoare annotation [2022-04-07 14:02:27,587 WARN L170 areAnnotationChecker]: L35-1 has no Hoare annotation [2022-04-07 14:02:27,587 WARN L170 areAnnotationChecker]: L35-1 has no Hoare annotation [2022-04-07 14:02:27,587 WARN L170 areAnnotationChecker]: L40-1 has no Hoare annotation [2022-04-07 14:02:27,587 WARN L170 areAnnotationChecker]: L40-1 has no Hoare annotation [2022-04-07 14:02:27,587 WARN L170 areAnnotationChecker]: L48-1 has no Hoare annotation [2022-04-07 14:02:27,587 WARN L170 areAnnotationChecker]: L48-1 has no Hoare annotation [2022-04-07 14:02:27,587 WARN L170 areAnnotationChecker]: L56 has no Hoare annotation [2022-04-07 14:02:27,588 WARN L170 areAnnotationChecker]: L34-3 has no Hoare annotation [2022-04-07 14:02:27,588 WARN L170 areAnnotationChecker]: L34-3 has no Hoare annotation [2022-04-07 14:02:27,588 WARN L170 areAnnotationChecker]: L34-1 has no Hoare annotation [2022-04-07 14:02:27,588 WARN L170 areAnnotationChecker]: L34-1 has no Hoare annotation [2022-04-07 14:02:27,588 WARN L170 areAnnotationChecker]: L39-3 has no Hoare annotation [2022-04-07 14:02:27,588 WARN L170 areAnnotationChecker]: L39-3 has no Hoare annotation [2022-04-07 14:02:27,588 WARN L170 areAnnotationChecker]: L47-2 has no Hoare annotation [2022-04-07 14:02:27,588 WARN L170 areAnnotationChecker]: L47-2 has no Hoare annotation [2022-04-07 14:02:27,588 WARN L170 areAnnotationChecker]: mainFINAL has no Hoare annotation [2022-04-07 14:02:27,588 WARN L170 areAnnotationChecker]: L35 has no Hoare annotation [2022-04-07 14:02:27,588 WARN L170 areAnnotationChecker]: L35 has no Hoare annotation [2022-04-07 14:02:27,588 WARN L170 areAnnotationChecker]: L39-1 has no Hoare annotation [2022-04-07 14:02:27,588 WARN L170 areAnnotationChecker]: L39-1 has no Hoare annotation [2022-04-07 14:02:27,588 WARN L170 areAnnotationChecker]: L47 has no Hoare annotation [2022-04-07 14:02:27,588 WARN L170 areAnnotationChecker]: L47 has no Hoare annotation [2022-04-07 14:02:27,588 WARN L170 areAnnotationChecker]: mainEXIT has no Hoare annotation [2022-04-07 14:02:27,588 WARN L170 areAnnotationChecker]: L40 has no Hoare annotation [2022-04-07 14:02:27,588 WARN L170 areAnnotationChecker]: L40 has no Hoare annotation [2022-04-07 14:02:27,588 WARN L170 areAnnotationChecker]: L48 has no Hoare annotation [2022-04-07 14:02:27,588 WARN L170 areAnnotationChecker]: L48 has no Hoare annotation [2022-04-07 14:02:27,588 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-07 14:02:27,589 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 07.04 02:02:27 BoogieIcfgContainer [2022-04-07 14:02:27,589 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2022-04-07 14:02:27,590 INFO L158 Benchmark]: Toolchain (without parser) took 34411.67ms. Allocated memory was 174.1MB in the beginning and 210.8MB in the end (delta: 36.7MB). Free memory was 122.4MB in the beginning and 79.8MB in the end (delta: 42.6MB). Peak memory consumption was 79.2MB. Max. memory is 8.0GB. [2022-04-07 14:02:27,590 INFO L158 Benchmark]: CDTParser took 0.09ms. Allocated memory is still 174.1MB. Free memory was 139.1MB in the beginning and 139.1MB in the end (delta: 73.0kB). There was no memory consumed. Max. memory is 8.0GB. [2022-04-07 14:02:27,590 INFO L158 Benchmark]: CACSL2BoogieTranslator took 190.56ms. Allocated memory was 174.1MB in the beginning and 210.8MB in the end (delta: 36.7MB). Free memory was 122.1MB in the beginning and 185.8MB in the end (delta: -63.7MB). Peak memory consumption was 13.2MB. Max. memory is 8.0GB. [2022-04-07 14:02:27,590 INFO L158 Benchmark]: Boogie Preprocessor took 23.49ms. Allocated memory is still 210.8MB. Free memory was 185.8MB in the beginning and 184.4MB in the end (delta: 1.4MB). Peak memory consumption was 1.0MB. Max. memory is 8.0GB. [2022-04-07 14:02:27,590 INFO L158 Benchmark]: RCFGBuilder took 255.55ms. Allocated memory is still 210.8MB. Free memory was 184.4MB in the beginning and 171.5MB in the end (delta: 12.9MB). Peak memory consumption was 12.6MB. Max. memory is 8.0GB. [2022-04-07 14:02:27,603 INFO L158 Benchmark]: TraceAbstraction took 33933.59ms. Allocated memory is still 210.8MB. Free memory was 170.8MB in the beginning and 79.8MB in the end (delta: 91.0MB). Peak memory consumption was 92.2MB. Max. memory is 8.0GB. [2022-04-07 14:02:27,604 INFO L339 ainManager$Toolchain]: ####################### End [Toolchain 1] ####################### --- Results --- * Results from de.uni_freiburg.informatik.ultimate.core: - AssertionsEnabledResult: Assertions are enabled Assertions are enabled - StatisticsResult: Toolchain Benchmarks Benchmark results are: * CDTParser took 0.09ms. Allocated memory is still 174.1MB. Free memory was 139.1MB in the beginning and 139.1MB in the end (delta: 73.0kB). There was no memory consumed. Max. memory is 8.0GB. * CACSL2BoogieTranslator took 190.56ms. Allocated memory was 174.1MB in the beginning and 210.8MB in the end (delta: 36.7MB). Free memory was 122.1MB in the beginning and 185.8MB in the end (delta: -63.7MB). Peak memory consumption was 13.2MB. Max. memory is 8.0GB. * Boogie Preprocessor took 23.49ms. Allocated memory is still 210.8MB. Free memory was 185.8MB in the beginning and 184.4MB in the end (delta: 1.4MB). Peak memory consumption was 1.0MB. Max. memory is 8.0GB. * RCFGBuilder took 255.55ms. Allocated memory is still 210.8MB. Free memory was 184.4MB in the beginning and 171.5MB in the end (delta: 12.9MB). Peak memory consumption was 12.6MB. Max. memory is 8.0GB. * TraceAbstraction took 33933.59ms. Allocated memory is still 210.8MB. Free memory was 170.8MB in the beginning and 79.8MB in the end (delta: 91.0MB). Peak memory consumption was 92.2MB. 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=-3, R=0, u=1, v=1] [L36] COND FALSE !(!(r != 0)) VAL [\old(counter)=0, A=3, counter=1, R=0, r=-3, u=1, v=1] [L39] EXPR counter++ VAL [\old(counter)=0, A=3, counter=2, counter++=1, r=-3, R=0, 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=-3, R=0, 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=-3, R=0, 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=-3, R=0, 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=0, r=1, 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=0, r=1, u=5, v=1] [L49] COND TRUE !(r < 0) VAL [\old(counter)=0, A=3, counter=5, r=1, R=0, u=5, v=1] [L34] EXPR counter++ VAL [\old(counter)=0, A=3, counter=6, counter++=5, r=1, R=0, 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: 33.9s, OverallIterations: 11, TraceHistogramMax: 6, PathProgramHistogramMax: 2, EmptinessCheckTime: 0.0s, AutomataDifference: 22.5s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 0.0s, PartialOrderReductionTime: 0.0s, HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 210 SdHoareTripleChecker+Valid, 6.6s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 201 mSDsluCounter, 1301 SdHoareTripleChecker+Invalid, 6.6s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 892 mSDsCounter, 94 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 386 IncrementalHoareTripleChecker+Invalid, 480 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 94 mSolverCounterUnsat, 409 mSDtfsCounter, 386 mSolverCounterSat, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 584 GetRequests, 524 SyntacticMatches, 5 SemanticMatches, 55 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 47 ImplicationChecksByTransitivity, 0.2s 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.3s AutomataMinimizationTime, 10 MinimizatonAttempts, 37 StatesRemovedByMinimization, 6 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.1s SsaConstructionTime, 0.2s SatisfiabilityAnalysisTime, 6.7s 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-07 14:02:27,624 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...