/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/divbin_unwindbound5.i -------------------------------------------------------------------------------- This is Ultimate 0.2.2-dev-34549b5 [2022-04-07 13:31:55,360 INFO L177 SettingsManager]: Resetting all preferences to default values... [2022-04-07 13:31:55,362 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2022-04-07 13:31:55,389 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2022-04-07 13:31:55,389 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2022-04-07 13:31:55,390 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2022-04-07 13:31:55,390 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2022-04-07 13:31:55,391 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2022-04-07 13:31:55,393 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2022-04-07 13:31:55,393 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2022-04-07 13:31:55,394 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2022-04-07 13:31:55,395 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2022-04-07 13:31:55,396 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2022-04-07 13:31:55,399 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2022-04-07 13:31:55,400 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2022-04-07 13:31:55,401 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2022-04-07 13:31:55,402 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2022-04-07 13:31:55,403 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2022-04-07 13:31:55,406 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2022-04-07 13:31:55,408 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2022-04-07 13:31:55,408 INFO L181 SettingsManager]: Resetting HornVerifier preferences to default values [2022-04-07 13:31:55,412 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2022-04-07 13:31:55,413 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2022-04-07 13:31:55,414 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2022-04-07 13:31:55,414 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2022-04-07 13:31:55,416 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2022-04-07 13:31:55,416 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2022-04-07 13:31:55,416 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2022-04-07 13:31:55,416 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2022-04-07 13:31:55,416 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2022-04-07 13:31:55,417 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2022-04-07 13:31:55,417 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2022-04-07 13:31:55,418 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2022-04-07 13:31:55,418 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2022-04-07 13:31:55,418 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2022-04-07 13:31:55,419 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2022-04-07 13:31:55,419 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2022-04-07 13:31:55,419 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2022-04-07 13:31:55,420 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2022-04-07 13:31:55,420 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2022-04-07 13:31:55,420 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2022-04-07 13:31:55,421 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2022-04-07 13:31:55,421 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 13:31:55,441 INFO L113 SettingsManager]: Loading preferences was successful [2022-04-07 13:31:55,441 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2022-04-07 13:31:55,441 INFO L136 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2022-04-07 13:31:55,441 INFO L138 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2022-04-07 13:31:55,442 INFO L136 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2022-04-07 13:31:55,442 INFO L138 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2022-04-07 13:31:55,442 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2022-04-07 13:31:55,442 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2022-04-07 13:31:55,442 INFO L138 SettingsManager]: * Use SBE=true [2022-04-07 13:31:55,443 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2022-04-07 13:31:55,443 INFO L138 SettingsManager]: * sizeof long=4 [2022-04-07 13:31:55,446 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2022-04-07 13:31:55,446 INFO L138 SettingsManager]: * sizeof POINTER=4 [2022-04-07 13:31:55,447 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2022-04-07 13:31:55,447 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2022-04-07 13:31:55,447 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2022-04-07 13:31:55,447 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2022-04-07 13:31:55,447 INFO L138 SettingsManager]: * sizeof long double=12 [2022-04-07 13:31:55,447 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2022-04-07 13:31:55,447 INFO L138 SettingsManager]: * Use constant arrays=true [2022-04-07 13:31:55,447 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2022-04-07 13:31:55,448 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2022-04-07 13:31:55,448 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2022-04-07 13:31:55,448 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2022-04-07 13:31:55,448 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-04-07 13:31:55,448 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2022-04-07 13:31:55,448 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2022-04-07 13:31:55,448 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2022-04-07 13:31:55,448 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2022-04-07 13:31:55,449 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2022-04-07 13:31:55,449 INFO L138 SettingsManager]: * Large block encoding in concurrent analysis=OFF [2022-04-07 13:31:55,449 INFO L138 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2022-04-07 13:31:55,449 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2022-04-07 13:31:55,449 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 13:31:55,653 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2022-04-07 13:31:55,679 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2022-04-07 13:31:55,682 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2022-04-07 13:31:55,683 INFO L271 PluginConnector]: Initializing CDTParser... [2022-04-07 13:31:55,684 INFO L275 PluginConnector]: CDTParser initialized [2022-04-07 13:31:55,686 INFO L432 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/nla-digbench-scaling/divbin_unwindbound5.i [2022-04-07 13:31:55,726 INFO L220 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/ed2516174/1ddd954511e348b0a70dbd5fae7e0918/FLAG0e01cab0b [2022-04-07 13:31:56,087 INFO L306 CDTParser]: Found 1 translation units. [2022-04-07 13:31:56,087 INFO L160 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/nla-digbench-scaling/divbin_unwindbound5.i [2022-04-07 13:31:56,094 INFO L349 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/ed2516174/1ddd954511e348b0a70dbd5fae7e0918/FLAG0e01cab0b [2022-04-07 13:31:56,105 INFO L357 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/ed2516174/1ddd954511e348b0a70dbd5fae7e0918 [2022-04-07 13:31:56,107 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2022-04-07 13:31:56,108 INFO L131 ToolchainWalker]: Walking toolchain with 4 elements. [2022-04-07 13:31:56,110 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2022-04-07 13:31:56,111 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2022-04-07 13:31:56,113 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2022-04-07 13:31:56,116 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 07.04 01:31:56" (1/1) ... [2022-04-07 13:31:56,117 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@5fa8928a and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.04 01:31:56, skipping insertion in model container [2022-04-07 13:31:56,117 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 07.04 01:31:56" (1/1) ... [2022-04-07 13:31:56,121 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2022-04-07 13:31:56,132 INFO L178 MainTranslator]: Built tables and reachable declarations [2022-04-07 13:31:56,292 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/divbin_unwindbound5.i[950,963] [2022-04-07 13:31:56,312 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-04-07 13:31:56,317 INFO L203 MainTranslator]: Completed pre-run [2022-04-07 13:31:56,332 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/divbin_unwindbound5.i[950,963] [2022-04-07 13:31:56,350 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-04-07 13:31:56,358 INFO L208 MainTranslator]: Completed translation [2022-04-07 13:31:56,358 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.04 01:31:56 WrapperNode [2022-04-07 13:31:56,359 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2022-04-07 13:31:56,359 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2022-04-07 13:31:56,359 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2022-04-07 13:31:56,359 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2022-04-07 13:31:56,366 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.04 01:31:56" (1/1) ... [2022-04-07 13:31:56,366 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.04 01:31:56" (1/1) ... [2022-04-07 13:31:56,371 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.04 01:31:56" (1/1) ... [2022-04-07 13:31:56,371 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.04 01:31:56" (1/1) ... [2022-04-07 13:31:56,383 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.04 01:31:56" (1/1) ... [2022-04-07 13:31:56,389 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.04 01:31:56" (1/1) ... [2022-04-07 13:31:56,392 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.04 01:31:56" (1/1) ... [2022-04-07 13:31:56,394 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2022-04-07 13:31:56,395 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2022-04-07 13:31:56,395 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2022-04-07 13:31:56,395 INFO L275 PluginConnector]: RCFGBuilder initialized [2022-04-07 13:31:56,396 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.04 01:31:56" (1/1) ... [2022-04-07 13:31:56,420 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-04-07 13:31:56,429 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-04-07 13:31:56,453 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 13:31:56,470 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 13:31:56,487 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.init [2022-04-07 13:31:56,488 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2022-04-07 13:31:56,488 INFO L138 BoogieDeclarations]: Found implementation of procedure reach_error [2022-04-07 13:31:56,488 INFO L138 BoogieDeclarations]: Found implementation of procedure assume_abort_if_not [2022-04-07 13:31:56,489 INFO L138 BoogieDeclarations]: Found implementation of procedure __VERIFIER_assert [2022-04-07 13:31:56,490 INFO L138 BoogieDeclarations]: Found implementation of procedure main [2022-04-07 13:31:56,490 INFO L130 BoogieDeclarations]: Found specification of procedure abort [2022-04-07 13:31:56,490 INFO L130 BoogieDeclarations]: Found specification of procedure __assert_fail [2022-04-07 13:31:56,490 INFO L130 BoogieDeclarations]: Found specification of procedure __assert_perror_fail [2022-04-07 13:31:56,490 INFO L130 BoogieDeclarations]: Found specification of procedure __assert [2022-04-07 13:31:56,490 INFO L130 BoogieDeclarations]: Found specification of procedure reach_error [2022-04-07 13:31:56,490 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2022-04-07 13:31:56,490 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_nondet_uint [2022-04-07 13:31:56,490 INFO L130 BoogieDeclarations]: Found specification of procedure assume_abort_if_not [2022-04-07 13:31:56,490 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_assert [2022-04-07 13:31:56,490 INFO L130 BoogieDeclarations]: Found specification of procedure main [2022-04-07 13:31:56,490 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.init [2022-04-07 13:31:56,490 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2022-04-07 13:31:56,490 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2022-04-07 13:31:56,491 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2022-04-07 13:31:56,491 INFO L130 BoogieDeclarations]: Found specification of procedure read~int [2022-04-07 13:31:56,491 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2022-04-07 13:31:56,556 INFO L234 CfgBuilder]: Building ICFG [2022-04-07 13:31:56,558 INFO L260 CfgBuilder]: Building CFG for each procedure with an implementation [2022-04-07 13:31:56,700 INFO L275 CfgBuilder]: Performing block encoding [2022-04-07 13:31:56,705 INFO L294 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2022-04-07 13:31:56,705 INFO L299 CfgBuilder]: Removed 2 assume(true) statements. [2022-04-07 13:31:56,706 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 07.04 01:31:56 BoogieIcfgContainer [2022-04-07 13:31:56,706 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2022-04-07 13:31:56,707 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2022-04-07 13:31:56,707 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2022-04-07 13:31:56,709 INFO L275 PluginConnector]: TraceAbstraction initialized [2022-04-07 13:31:56,709 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 07.04 01:31:56" (1/3) ... [2022-04-07 13:31:56,710 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@52401b03 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 07.04 01:31:56, skipping insertion in model container [2022-04-07 13:31:56,710 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.04 01:31:56" (2/3) ... [2022-04-07 13:31:56,710 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@52401b03 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 07.04 01:31:56, skipping insertion in model container [2022-04-07 13:31:56,710 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 07.04 01:31:56" (3/3) ... [2022-04-07 13:31:56,711 INFO L111 eAbstractionObserver]: Analyzing ICFG divbin_unwindbound5.i [2022-04-07 13:31:56,714 INFO L203 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2022-04-07 13:31:56,714 INFO L162 ceAbstractionStarter]: Applying trace abstraction to program that has 1 error locations. [2022-04-07 13:31:56,763 INFO L339 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2022-04-07 13:31:56,769 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 13:31:56,769 INFO L341 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2022-04-07 13:31:56,787 INFO L276 IsEmpty]: Start isEmpty. Operand has 33 states, 21 states have (on average 1.4761904761904763) internal successors, (31), 22 states have internal predecessors, (31), 6 states have call successors, (6), 4 states have call predecessors, (6), 4 states have return successors, (6), 6 states have call predecessors, (6), 6 states have call successors, (6) [2022-04-07 13:31:56,791 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 24 [2022-04-07 13:31:56,791 INFO L491 BasicCegarLoop]: Found error trace [2022-04-07 13:31:56,791 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 13:31:56,792 INFO L403 AbstractCegarLoop]: === Iteration 1 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-07 13:31:56,795 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-07 13:31:56,795 INFO L85 PathProgramCache]: Analyzing trace with hash 878397729, now seen corresponding path program 1 times [2022-04-07 13:31:56,801 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-07 13:31:56,802 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2629154] [2022-04-07 13:31:56,802 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-07 13:31:56,802 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-07 13:31:56,879 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-07 13:31:56,939 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-04-07 13:31:56,942 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-07 13:31:56,952 INFO L290 TraceCheckUtils]: 0: Hoare triple {49#(and (= ~counter~0 |old(~counter~0)|) (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(9, 2);~counter~0 := 0; {36#true} is VALID [2022-04-07 13:31:56,952 INFO L290 TraceCheckUtils]: 1: Hoare triple {36#true} assume true; {36#true} is VALID [2022-04-07 13:31:56,952 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {36#true} {36#true} #89#return; {36#true} is VALID [2022-04-07 13:31:56,953 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2022-04-07 13:31:56,954 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-07 13:31:56,958 INFO L290 TraceCheckUtils]: 0: Hoare triple {36#true} ~cond := #in~cond; {36#true} is VALID [2022-04-07 13:31:56,959 INFO L290 TraceCheckUtils]: 1: Hoare triple {36#true} assume 0 == ~cond;assume false; {37#false} is VALID [2022-04-07 13:31:56,959 INFO L290 TraceCheckUtils]: 2: Hoare triple {37#false} assume true; {37#false} is VALID [2022-04-07 13:31:56,959 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {37#false} {36#true} #81#return; {37#false} is VALID [2022-04-07 13:31:56,959 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2022-04-07 13:31:56,961 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-07 13:31:56,964 INFO L290 TraceCheckUtils]: 0: Hoare triple {36#true} ~cond := #in~cond; {36#true} is VALID [2022-04-07 13:31:56,965 INFO L290 TraceCheckUtils]: 1: Hoare triple {36#true} assume 0 == ~cond;assume false; {37#false} is VALID [2022-04-07 13:31:56,965 INFO L290 TraceCheckUtils]: 2: Hoare triple {37#false} assume true; {37#false} is VALID [2022-04-07 13:31:56,965 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {37#false} {37#false} #83#return; {37#false} is VALID [2022-04-07 13:31:56,966 INFO L272 TraceCheckUtils]: 0: Hoare triple {36#true} call ULTIMATE.init(); {49#(and (= ~counter~0 |old(~counter~0)|) (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} is VALID [2022-04-07 13:31:56,966 INFO L290 TraceCheckUtils]: 1: Hoare triple {49#(and (= ~counter~0 |old(~counter~0)|) (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(9, 2);~counter~0 := 0; {36#true} is VALID [2022-04-07 13:31:56,966 INFO L290 TraceCheckUtils]: 2: Hoare triple {36#true} assume true; {36#true} is VALID [2022-04-07 13:31:56,966 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {36#true} {36#true} #89#return; {36#true} is VALID [2022-04-07 13:31:56,967 INFO L272 TraceCheckUtils]: 4: Hoare triple {36#true} call #t~ret5 := main(); {36#true} is VALID [2022-04-07 13:31:56,967 INFO L290 TraceCheckUtils]: 5: Hoare triple {36#true} havoc ~A~0;havoc ~B~0;havoc ~q~0;havoc ~r~0;havoc ~b~0;~A~0 := #t~nondet1;havoc #t~nondet1;~B~0 := #t~nondet2;havoc #t~nondet2; {36#true} is VALID [2022-04-07 13:31:56,967 INFO L272 TraceCheckUtils]: 6: Hoare triple {36#true} call assume_abort_if_not((if ~B~0 % 4294967296 < 2147483647 then 1 else 0)); {36#true} is VALID [2022-04-07 13:31:56,967 INFO L290 TraceCheckUtils]: 7: Hoare triple {36#true} ~cond := #in~cond; {36#true} is VALID [2022-04-07 13:31:56,967 INFO L290 TraceCheckUtils]: 8: Hoare triple {36#true} assume 0 == ~cond;assume false; {37#false} is VALID [2022-04-07 13:31:56,968 INFO L290 TraceCheckUtils]: 9: Hoare triple {37#false} assume true; {37#false} is VALID [2022-04-07 13:31:56,968 INFO L284 TraceCheckUtils]: 10: Hoare quadruple {37#false} {36#true} #81#return; {37#false} is VALID [2022-04-07 13:31:56,968 INFO L272 TraceCheckUtils]: 11: Hoare triple {37#false} call assume_abort_if_not((if ~B~0 % 4294967296 >= 1 then 1 else 0)); {36#true} is VALID [2022-04-07 13:31:56,968 INFO L290 TraceCheckUtils]: 12: Hoare triple {36#true} ~cond := #in~cond; {36#true} is VALID [2022-04-07 13:31:56,968 INFO L290 TraceCheckUtils]: 13: Hoare triple {36#true} assume 0 == ~cond;assume false; {37#false} is VALID [2022-04-07 13:31:56,969 INFO L290 TraceCheckUtils]: 14: Hoare triple {37#false} assume true; {37#false} is VALID [2022-04-07 13:31:56,969 INFO L284 TraceCheckUtils]: 15: Hoare quadruple {37#false} {37#false} #83#return; {37#false} is VALID [2022-04-07 13:31:56,969 INFO L290 TraceCheckUtils]: 16: Hoare triple {37#false} ~q~0 := 0;~r~0 := ~A~0;~b~0 := ~B~0; {37#false} is VALID [2022-04-07 13:31:56,969 INFO L290 TraceCheckUtils]: 17: Hoare triple {37#false} assume !true; {37#false} is VALID [2022-04-07 13:31:56,969 INFO L290 TraceCheckUtils]: 18: Hoare triple {37#false} assume !true; {37#false} is VALID [2022-04-07 13:31:56,969 INFO L272 TraceCheckUtils]: 19: Hoare triple {37#false} call __VERIFIER_assert((if ~A~0 % 4294967296 == (~q~0 * ~b~0 + ~r~0) % 4294967296 then 1 else 0)); {37#false} is VALID [2022-04-07 13:31:56,969 INFO L290 TraceCheckUtils]: 20: Hoare triple {37#false} ~cond := #in~cond; {37#false} is VALID [2022-04-07 13:31:56,970 INFO L290 TraceCheckUtils]: 21: Hoare triple {37#false} assume 0 == ~cond; {37#false} is VALID [2022-04-07 13:31:56,970 INFO L290 TraceCheckUtils]: 22: Hoare triple {37#false} assume !false; {37#false} is VALID [2022-04-07 13:31:56,970 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 13:31:56,970 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-07 13:31:56,971 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2629154] [2022-04-07 13:31:56,971 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2629154] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-07 13:31:56,971 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-07 13:31:56,971 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-04-07 13:31:56,972 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [173658149] [2022-04-07 13:31:56,973 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-07 13:31:56,976 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 4.0) internal successors, (12), 2 states have internal predecessors, (12), 2 states have call successors, (5), 3 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 23 [2022-04-07 13:31:56,977 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-07 13:31:56,979 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with has 3 states, 3 states have (on average 4.0) internal successors, (12), 2 states have internal predecessors, (12), 2 states have call successors, (5), 3 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 13:31:57,001 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 13:31:57,001 INFO L554 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-04-07 13:31:57,002 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-04-07 13:31:57,017 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-04-07 13:31:57,017 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-04-07 13:31:57,019 INFO L87 Difference]: Start difference. First operand has 33 states, 21 states have (on average 1.4761904761904763) internal successors, (31), 22 states have internal predecessors, (31), 6 states have call successors, (6), 4 states have call predecessors, (6), 4 states have return successors, (6), 6 states have call predecessors, (6), 6 states have call successors, (6) Second operand has 3 states, 3 states have (on average 4.0) internal successors, (12), 2 states have internal predecessors, (12), 2 states have call successors, (5), 3 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 13:31:57,160 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-07 13:31:57,161 INFO L93 Difference]: Finished difference Result 60 states and 84 transitions. [2022-04-07 13:31:57,161 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-04-07 13:31:57,161 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 4.0) internal successors, (12), 2 states have internal predecessors, (12), 2 states have call successors, (5), 3 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 23 [2022-04-07 13:31:57,162 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-07 13:31:57,163 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3 states, 3 states have (on average 4.0) internal successors, (12), 2 states have internal predecessors, (12), 2 states have call successors, (5), 3 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 13:31:57,171 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 84 transitions. [2022-04-07 13:31:57,171 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3 states, 3 states have (on average 4.0) internal successors, (12), 2 states have internal predecessors, (12), 2 states have call successors, (5), 3 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 13:31:57,189 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 84 transitions. [2022-04-07 13:31:57,189 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 3 states and 84 transitions. [2022-04-07 13:31:57,301 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 84 edges. 84 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-07 13:31:57,313 INFO L225 Difference]: With dead ends: 60 [2022-04-07 13:31:57,313 INFO L226 Difference]: Without dead ends: 29 [2022-04-07 13:31:57,315 INFO L912 BasicCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 9 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-04-07 13:31:57,321 INFO L913 BasicCegarLoop]: 36 mSDtfsCounter, 10 mSDsluCounter, 4 mSDsCounter, 0 mSdLazyCounter, 20 mSolverCounterSat, 5 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 12 SdHoareTripleChecker+Valid, 40 SdHoareTripleChecker+Invalid, 25 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 5 IncrementalHoareTripleChecker+Valid, 20 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-04-07 13:31:57,322 INFO L914 BasicCegarLoop]: SdHoareTripleChecker [12 Valid, 40 Invalid, 25 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [5 Valid, 20 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-04-07 13:31:57,334 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 29 states. [2022-04-07 13:31:57,351 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 29 to 28. [2022-04-07 13:31:57,351 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-07 13:31:57,352 INFO L82 GeneralOperation]: Start isEquivalent. First operand 29 states. Second operand has 28 states, 18 states have (on average 1.3333333333333333) internal successors, (24), 19 states have internal predecessors, (24), 6 states have call successors, (6), 4 states have call predecessors, (6), 3 states have return successors, (4), 4 states have call predecessors, (4), 4 states have call successors, (4) [2022-04-07 13:31:57,352 INFO L74 IsIncluded]: Start isIncluded. First operand 29 states. Second operand has 28 states, 18 states have (on average 1.3333333333333333) internal successors, (24), 19 states have internal predecessors, (24), 6 states have call successors, (6), 4 states have call predecessors, (6), 3 states have return successors, (4), 4 states have call predecessors, (4), 4 states have call successors, (4) [2022-04-07 13:31:57,353 INFO L87 Difference]: Start difference. First operand 29 states. Second operand has 28 states, 18 states have (on average 1.3333333333333333) internal successors, (24), 19 states have internal predecessors, (24), 6 states have call successors, (6), 4 states have call predecessors, (6), 3 states have return successors, (4), 4 states have call predecessors, (4), 4 states have call successors, (4) [2022-04-07 13:31:57,357 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-07 13:31:57,357 INFO L93 Difference]: Finished difference Result 29 states and 35 transitions. [2022-04-07 13:31:57,358 INFO L276 IsEmpty]: Start isEmpty. Operand 29 states and 35 transitions. [2022-04-07 13:31:57,358 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-07 13:31:57,358 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-07 13:31:57,358 INFO L74 IsIncluded]: Start isIncluded. First operand has 28 states, 18 states have (on average 1.3333333333333333) internal successors, (24), 19 states have internal predecessors, (24), 6 states have call successors, (6), 4 states have call predecessors, (6), 3 states have return successors, (4), 4 states have call predecessors, (4), 4 states have call successors, (4) Second operand 29 states. [2022-04-07 13:31:57,359 INFO L87 Difference]: Start difference. First operand has 28 states, 18 states have (on average 1.3333333333333333) internal successors, (24), 19 states have internal predecessors, (24), 6 states have call successors, (6), 4 states have call predecessors, (6), 3 states have return successors, (4), 4 states have call predecessors, (4), 4 states have call successors, (4) Second operand 29 states. [2022-04-07 13:31:57,361 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-07 13:31:57,361 INFO L93 Difference]: Finished difference Result 29 states and 35 transitions. [2022-04-07 13:31:57,361 INFO L276 IsEmpty]: Start isEmpty. Operand 29 states and 35 transitions. [2022-04-07 13:31:57,361 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-07 13:31:57,362 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-07 13:31:57,362 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-07 13:31:57,362 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-07 13:31:57,362 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 28 states, 18 states have (on average 1.3333333333333333) internal successors, (24), 19 states have internal predecessors, (24), 6 states have call successors, (6), 4 states have call predecessors, (6), 3 states have return successors, (4), 4 states have call predecessors, (4), 4 states have call successors, (4) [2022-04-07 13:31:57,364 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 28 states to 28 states and 34 transitions. [2022-04-07 13:31:57,365 INFO L78 Accepts]: Start accepts. Automaton has 28 states and 34 transitions. Word has length 23 [2022-04-07 13:31:57,365 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-07 13:31:57,365 INFO L478 AbstractCegarLoop]: Abstraction has 28 states and 34 transitions. [2022-04-07 13:31:57,365 INFO L479 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 4.0) internal successors, (12), 2 states have internal predecessors, (12), 2 states have call successors, (5), 3 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 13:31:57,365 INFO L276 IsEmpty]: Start isEmpty. Operand 28 states and 34 transitions. [2022-04-07 13:31:57,366 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2022-04-07 13:31:57,366 INFO L491 BasicCegarLoop]: Found error trace [2022-04-07 13:31:57,378 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, 1, 1] [2022-04-07 13:31:57,378 WARN L460 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2022-04-07 13:31:57,378 INFO L403 AbstractCegarLoop]: === Iteration 2 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-07 13:31:57,379 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-07 13:31:57,379 INFO L85 PathProgramCache]: Analyzing trace with hash 994169231, now seen corresponding path program 1 times [2022-04-07 13:31:57,379 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-07 13:31:57,379 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1939709065] [2022-04-07 13:31:57,380 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-07 13:31:57,380 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-07 13:31:57,400 ERROR L245 FreeRefinementEngine]: Caught known exception: Unsupported non-linear arithmetic [2022-04-07 13:31:57,400 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [1930685058] [2022-04-07 13:31:57,400 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-07 13:31:57,400 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-07 13:31:57,400 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-04-07 13:31:57,402 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 13:31:57,403 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 13:31:57,443 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-07 13:31:57,445 INFO L263 TraceCheckSpWp]: Trace formula consists of 90 conjuncts, 5 conjunts are in the unsatisfiable core [2022-04-07 13:31:57,454 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-07 13:31:57,457 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-04-07 13:31:57,633 INFO L272 TraceCheckUtils]: 0: Hoare triple {227#true} call ULTIMATE.init(); {227#true} is VALID [2022-04-07 13:31:57,634 INFO L290 TraceCheckUtils]: 1: Hoare triple {227#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(9, 2);~counter~0 := 0; {235#(<= ~counter~0 0)} is VALID [2022-04-07 13:31:57,634 INFO L290 TraceCheckUtils]: 2: Hoare triple {235#(<= ~counter~0 0)} assume true; {235#(<= ~counter~0 0)} is VALID [2022-04-07 13:31:57,635 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {235#(<= ~counter~0 0)} {227#true} #89#return; {235#(<= ~counter~0 0)} is VALID [2022-04-07 13:31:57,635 INFO L272 TraceCheckUtils]: 4: Hoare triple {235#(<= ~counter~0 0)} call #t~ret5 := main(); {235#(<= ~counter~0 0)} is VALID [2022-04-07 13:31:57,635 INFO L290 TraceCheckUtils]: 5: Hoare triple {235#(<= ~counter~0 0)} havoc ~A~0;havoc ~B~0;havoc ~q~0;havoc ~r~0;havoc ~b~0;~A~0 := #t~nondet1;havoc #t~nondet1;~B~0 := #t~nondet2;havoc #t~nondet2; {235#(<= ~counter~0 0)} is VALID [2022-04-07 13:31:57,636 INFO L272 TraceCheckUtils]: 6: Hoare triple {235#(<= ~counter~0 0)} call assume_abort_if_not((if ~B~0 % 4294967296 < 2147483647 then 1 else 0)); {235#(<= ~counter~0 0)} is VALID [2022-04-07 13:31:57,636 INFO L290 TraceCheckUtils]: 7: Hoare triple {235#(<= ~counter~0 0)} ~cond := #in~cond; {235#(<= ~counter~0 0)} is VALID [2022-04-07 13:31:57,637 INFO L290 TraceCheckUtils]: 8: Hoare triple {235#(<= ~counter~0 0)} assume !(0 == ~cond); {235#(<= ~counter~0 0)} is VALID [2022-04-07 13:31:57,637 INFO L290 TraceCheckUtils]: 9: Hoare triple {235#(<= ~counter~0 0)} assume true; {235#(<= ~counter~0 0)} is VALID [2022-04-07 13:31:57,638 INFO L284 TraceCheckUtils]: 10: Hoare quadruple {235#(<= ~counter~0 0)} {235#(<= ~counter~0 0)} #81#return; {235#(<= ~counter~0 0)} is VALID [2022-04-07 13:31:57,639 INFO L272 TraceCheckUtils]: 11: Hoare triple {235#(<= ~counter~0 0)} call assume_abort_if_not((if ~B~0 % 4294967296 >= 1 then 1 else 0)); {235#(<= ~counter~0 0)} is VALID [2022-04-07 13:31:57,639 INFO L290 TraceCheckUtils]: 12: Hoare triple {235#(<= ~counter~0 0)} ~cond := #in~cond; {235#(<= ~counter~0 0)} is VALID [2022-04-07 13:31:57,640 INFO L290 TraceCheckUtils]: 13: Hoare triple {235#(<= ~counter~0 0)} assume !(0 == ~cond); {235#(<= ~counter~0 0)} is VALID [2022-04-07 13:31:57,643 INFO L290 TraceCheckUtils]: 14: Hoare triple {235#(<= ~counter~0 0)} assume true; {235#(<= ~counter~0 0)} is VALID [2022-04-07 13:31:57,643 INFO L284 TraceCheckUtils]: 15: Hoare quadruple {235#(<= ~counter~0 0)} {235#(<= ~counter~0 0)} #83#return; {235#(<= ~counter~0 0)} is VALID [2022-04-07 13:31:57,644 INFO L290 TraceCheckUtils]: 16: Hoare triple {235#(<= ~counter~0 0)} ~q~0 := 0;~r~0 := ~A~0;~b~0 := ~B~0; {235#(<= ~counter~0 0)} is VALID [2022-04-07 13:31:57,644 INFO L290 TraceCheckUtils]: 17: Hoare triple {235#(<= ~counter~0 0)} #t~post3 := ~counter~0;~counter~0 := 1 + #t~post3; {284#(<= |main_#t~post3| 0)} is VALID [2022-04-07 13:31:57,645 INFO L290 TraceCheckUtils]: 18: Hoare triple {284#(<= |main_#t~post3| 0)} assume !(#t~post3 < 5);havoc #t~post3; {228#false} is VALID [2022-04-07 13:31:57,645 INFO L290 TraceCheckUtils]: 19: Hoare triple {228#false} #t~post4 := ~counter~0;~counter~0 := 1 + #t~post4; {228#false} is VALID [2022-04-07 13:31:57,645 INFO L290 TraceCheckUtils]: 20: Hoare triple {228#false} assume !(#t~post4 < 5);havoc #t~post4; {228#false} is VALID [2022-04-07 13:31:57,651 INFO L272 TraceCheckUtils]: 21: Hoare triple {228#false} call __VERIFIER_assert((if ~A~0 % 4294967296 == (~q~0 * ~b~0 + ~r~0) % 4294967296 then 1 else 0)); {228#false} is VALID [2022-04-07 13:31:57,651 INFO L290 TraceCheckUtils]: 22: Hoare triple {228#false} ~cond := #in~cond; {228#false} is VALID [2022-04-07 13:31:57,652 INFO L290 TraceCheckUtils]: 23: Hoare triple {228#false} assume 0 == ~cond; {228#false} is VALID [2022-04-07 13:31:57,652 INFO L290 TraceCheckUtils]: 24: Hoare triple {228#false} assume !false; {228#false} is VALID [2022-04-07 13:31:57,653 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 13:31:57,653 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-04-07 13:31:57,653 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-07 13:31:57,653 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1939709065] [2022-04-07 13:31:57,653 WARN L310 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2022-04-07 13:31:57,654 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1930685058] [2022-04-07 13:31:57,657 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1930685058] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-07 13:31:57,657 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-07 13:31:57,657 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-04-07 13:31:57,658 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2005701073] [2022-04-07 13:31:57,658 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-07 13:31:57,660 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 3.5) internal successors, (14), 3 states have internal predecessors, (14), 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 25 [2022-04-07 13:31:57,660 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-07 13:31:57,660 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with has 4 states, 4 states have (on average 3.5) internal successors, (14), 3 states have internal predecessors, (14), 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 13:31:57,675 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 22 edges. 22 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-07 13:31:57,675 INFO L554 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-04-07 13:31:57,676 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-04-07 13:31:57,677 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-04-07 13:31:57,677 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-04-07 13:31:57,678 INFO L87 Difference]: Start difference. First operand 28 states and 34 transitions. Second operand has 4 states, 4 states have (on average 3.5) internal successors, (14), 3 states have internal predecessors, (14), 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 13:31:57,740 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-07 13:31:57,740 INFO L93 Difference]: Finished difference Result 42 states and 52 transitions. [2022-04-07 13:31:57,740 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-04-07 13:31:57,740 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 3.5) internal successors, (14), 3 states have internal predecessors, (14), 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 25 [2022-04-07 13:31:57,741 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-07 13:31:57,742 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 4 states, 4 states have (on average 3.5) internal successors, (14), 3 states have internal predecessors, (14), 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 13:31:57,753 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 52 transitions. [2022-04-07 13:31:57,754 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 4 states, 4 states have (on average 3.5) internal successors, (14), 3 states have internal predecessors, (14), 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 13:31:57,756 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 52 transitions. [2022-04-07 13:31:57,756 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 4 states and 52 transitions. [2022-04-07 13:31:57,791 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 52 edges. 52 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-07 13:31:57,793 INFO L225 Difference]: With dead ends: 42 [2022-04-07 13:31:57,793 INFO L226 Difference]: Without dead ends: 30 [2022-04-07 13:31:57,793 INFO L912 BasicCegarLoop]: 0 DeclaredPredicates, 24 GetRequests, 22 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 13:31:57,794 INFO L913 BasicCegarLoop]: 32 mSDtfsCounter, 0 mSDsluCounter, 49 mSDsCounter, 0 mSdLazyCounter, 8 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 81 SdHoareTripleChecker+Invalid, 8 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 8 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-04-07 13:31:57,794 INFO L914 BasicCegarLoop]: SdHoareTripleChecker [0 Valid, 81 Invalid, 8 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 8 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-04-07 13:31:57,795 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 30 states. [2022-04-07 13:31:57,804 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 30 to 30. [2022-04-07 13:31:57,804 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-07 13:31:57,805 INFO L82 GeneralOperation]: Start isEquivalent. First operand 30 states. Second operand has 30 states, 20 states have (on average 1.3) internal successors, (26), 21 states have internal predecessors, (26), 6 states have call successors, (6), 4 states have call predecessors, (6), 3 states have return successors, (4), 4 states have call predecessors, (4), 4 states have call successors, (4) [2022-04-07 13:31:57,805 INFO L74 IsIncluded]: Start isIncluded. First operand 30 states. Second operand has 30 states, 20 states have (on average 1.3) internal successors, (26), 21 states have internal predecessors, (26), 6 states have call successors, (6), 4 states have call predecessors, (6), 3 states have return successors, (4), 4 states have call predecessors, (4), 4 states have call successors, (4) [2022-04-07 13:31:57,805 INFO L87 Difference]: Start difference. First operand 30 states. Second operand has 30 states, 20 states have (on average 1.3) internal successors, (26), 21 states have internal predecessors, (26), 6 states have call successors, (6), 4 states have call predecessors, (6), 3 states have return successors, (4), 4 states have call predecessors, (4), 4 states have call successors, (4) [2022-04-07 13:31:57,807 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-07 13:31:57,807 INFO L93 Difference]: Finished difference Result 30 states and 36 transitions. [2022-04-07 13:31:57,807 INFO L276 IsEmpty]: Start isEmpty. Operand 30 states and 36 transitions. [2022-04-07 13:31:57,808 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-07 13:31:57,808 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-07 13:31:57,808 INFO L74 IsIncluded]: Start isIncluded. First operand has 30 states, 20 states have (on average 1.3) internal successors, (26), 21 states have internal predecessors, (26), 6 states have call successors, (6), 4 states have call predecessors, (6), 3 states have return successors, (4), 4 states have call predecessors, (4), 4 states have call successors, (4) Second operand 30 states. [2022-04-07 13:31:57,808 INFO L87 Difference]: Start difference. First operand has 30 states, 20 states have (on average 1.3) internal successors, (26), 21 states have internal predecessors, (26), 6 states have call successors, (6), 4 states have call predecessors, (6), 3 states have return successors, (4), 4 states have call predecessors, (4), 4 states have call successors, (4) Second operand 30 states. [2022-04-07 13:31:57,810 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-07 13:31:57,810 INFO L93 Difference]: Finished difference Result 30 states and 36 transitions. [2022-04-07 13:31:57,810 INFO L276 IsEmpty]: Start isEmpty. Operand 30 states and 36 transitions. [2022-04-07 13:31:57,810 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-07 13:31:57,810 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-07 13:31:57,810 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-07 13:31:57,810 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-07 13:31:57,811 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 30 states, 20 states have (on average 1.3) internal successors, (26), 21 states have internal predecessors, (26), 6 states have call successors, (6), 4 states have call predecessors, (6), 3 states have return successors, (4), 4 states have call predecessors, (4), 4 states have call successors, (4) [2022-04-07 13:31:57,812 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 30 states to 30 states and 36 transitions. [2022-04-07 13:31:57,812 INFO L78 Accepts]: Start accepts. Automaton has 30 states and 36 transitions. Word has length 25 [2022-04-07 13:31:57,812 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-07 13:31:57,812 INFO L478 AbstractCegarLoop]: Abstraction has 30 states and 36 transitions. [2022-04-07 13:31:57,812 INFO L479 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 3.5) internal successors, (14), 3 states have internal predecessors, (14), 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 13:31:57,813 INFO L276 IsEmpty]: Start isEmpty. Operand 30 states and 36 transitions. [2022-04-07 13:31:57,813 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 27 [2022-04-07 13:31:57,813 INFO L491 BasicCegarLoop]: Found error trace [2022-04-07 13:31:57,813 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, 1, 1, 1] [2022-04-07 13:31:57,832 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 13:31:58,023 WARN L460 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1,2 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-07 13:31:58,024 INFO L403 AbstractCegarLoop]: === Iteration 3 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-07 13:31:58,025 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-07 13:31:58,025 INFO L85 PathProgramCache]: Analyzing trace with hash 422434646, now seen corresponding path program 1 times [2022-04-07 13:31:58,025 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-07 13:31:58,025 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [341803543] [2022-04-07 13:31:58,025 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-07 13:31:58,025 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-07 13:31:58,042 ERROR L245 FreeRefinementEngine]: Caught known exception: Unsupported non-linear arithmetic [2022-04-07 13:31:58,043 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [1176777669] [2022-04-07 13:31:58,043 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-07 13:31:58,043 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-07 13:31:58,043 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-04-07 13:31:58,044 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 13:31:58,045 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 13:31:58,073 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-07 13:31:58,074 INFO L263 TraceCheckSpWp]: Trace formula consists of 91 conjuncts, 7 conjunts are in the unsatisfiable core [2022-04-07 13:31:58,083 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-07 13:31:58,084 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-04-07 13:31:58,249 INFO L272 TraceCheckUtils]: 0: Hoare triple {464#true} call ULTIMATE.init(); {464#true} is VALID [2022-04-07 13:31:58,249 INFO L290 TraceCheckUtils]: 1: Hoare triple {464#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(9, 2);~counter~0 := 0; {472#(<= ~counter~0 0)} is VALID [2022-04-07 13:31:58,250 INFO L290 TraceCheckUtils]: 2: Hoare triple {472#(<= ~counter~0 0)} assume true; {472#(<= ~counter~0 0)} is VALID [2022-04-07 13:31:58,250 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {472#(<= ~counter~0 0)} {464#true} #89#return; {472#(<= ~counter~0 0)} is VALID [2022-04-07 13:31:58,251 INFO L272 TraceCheckUtils]: 4: Hoare triple {472#(<= ~counter~0 0)} call #t~ret5 := main(); {472#(<= ~counter~0 0)} is VALID [2022-04-07 13:31:58,251 INFO L290 TraceCheckUtils]: 5: Hoare triple {472#(<= ~counter~0 0)} havoc ~A~0;havoc ~B~0;havoc ~q~0;havoc ~r~0;havoc ~b~0;~A~0 := #t~nondet1;havoc #t~nondet1;~B~0 := #t~nondet2;havoc #t~nondet2; {472#(<= ~counter~0 0)} is VALID [2022-04-07 13:31:58,252 INFO L272 TraceCheckUtils]: 6: Hoare triple {472#(<= ~counter~0 0)} call assume_abort_if_not((if ~B~0 % 4294967296 < 2147483647 then 1 else 0)); {472#(<= ~counter~0 0)} is VALID [2022-04-07 13:31:58,252 INFO L290 TraceCheckUtils]: 7: Hoare triple {472#(<= ~counter~0 0)} ~cond := #in~cond; {472#(<= ~counter~0 0)} is VALID [2022-04-07 13:31:58,253 INFO L290 TraceCheckUtils]: 8: Hoare triple {472#(<= ~counter~0 0)} assume !(0 == ~cond); {472#(<= ~counter~0 0)} is VALID [2022-04-07 13:31:58,253 INFO L290 TraceCheckUtils]: 9: Hoare triple {472#(<= ~counter~0 0)} assume true; {472#(<= ~counter~0 0)} is VALID [2022-04-07 13:31:58,254 INFO L284 TraceCheckUtils]: 10: Hoare quadruple {472#(<= ~counter~0 0)} {472#(<= ~counter~0 0)} #81#return; {472#(<= ~counter~0 0)} is VALID [2022-04-07 13:31:58,254 INFO L272 TraceCheckUtils]: 11: Hoare triple {472#(<= ~counter~0 0)} call assume_abort_if_not((if ~B~0 % 4294967296 >= 1 then 1 else 0)); {472#(<= ~counter~0 0)} is VALID [2022-04-07 13:31:58,255 INFO L290 TraceCheckUtils]: 12: Hoare triple {472#(<= ~counter~0 0)} ~cond := #in~cond; {472#(<= ~counter~0 0)} is VALID [2022-04-07 13:31:58,255 INFO L290 TraceCheckUtils]: 13: Hoare triple {472#(<= ~counter~0 0)} assume !(0 == ~cond); {472#(<= ~counter~0 0)} is VALID [2022-04-07 13:31:58,255 INFO L290 TraceCheckUtils]: 14: Hoare triple {472#(<= ~counter~0 0)} assume true; {472#(<= ~counter~0 0)} is VALID [2022-04-07 13:31:58,256 INFO L284 TraceCheckUtils]: 15: Hoare quadruple {472#(<= ~counter~0 0)} {472#(<= ~counter~0 0)} #83#return; {472#(<= ~counter~0 0)} is VALID [2022-04-07 13:31:58,257 INFO L290 TraceCheckUtils]: 16: Hoare triple {472#(<= ~counter~0 0)} ~q~0 := 0;~r~0 := ~A~0;~b~0 := ~B~0; {472#(<= ~counter~0 0)} is VALID [2022-04-07 13:31:58,258 INFO L290 TraceCheckUtils]: 17: Hoare triple {472#(<= ~counter~0 0)} #t~post3 := ~counter~0;~counter~0 := 1 + #t~post3; {521#(<= ~counter~0 1)} is VALID [2022-04-07 13:31:58,258 INFO L290 TraceCheckUtils]: 18: Hoare triple {521#(<= ~counter~0 1)} assume !!(#t~post3 < 5);havoc #t~post3; {521#(<= ~counter~0 1)} is VALID [2022-04-07 13:31:58,258 INFO L290 TraceCheckUtils]: 19: Hoare triple {521#(<= ~counter~0 1)} assume !(~r~0 % 4294967296 >= ~b~0 % 4294967296); {521#(<= ~counter~0 1)} is VALID [2022-04-07 13:31:58,259 INFO L290 TraceCheckUtils]: 20: Hoare triple {521#(<= ~counter~0 1)} #t~post4 := ~counter~0;~counter~0 := 1 + #t~post4; {531#(<= |main_#t~post4| 1)} is VALID [2022-04-07 13:31:58,259 INFO L290 TraceCheckUtils]: 21: Hoare triple {531#(<= |main_#t~post4| 1)} assume !(#t~post4 < 5);havoc #t~post4; {465#false} is VALID [2022-04-07 13:31:58,260 INFO L272 TraceCheckUtils]: 22: Hoare triple {465#false} call __VERIFIER_assert((if ~A~0 % 4294967296 == (~q~0 * ~b~0 + ~r~0) % 4294967296 then 1 else 0)); {465#false} is VALID [2022-04-07 13:31:58,260 INFO L290 TraceCheckUtils]: 23: Hoare triple {465#false} ~cond := #in~cond; {465#false} is VALID [2022-04-07 13:31:58,260 INFO L290 TraceCheckUtils]: 24: Hoare triple {465#false} assume 0 == ~cond; {465#false} is VALID [2022-04-07 13:31:58,260 INFO L290 TraceCheckUtils]: 25: Hoare triple {465#false} assume !false; {465#false} is VALID [2022-04-07 13:31:58,260 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 13:31:58,260 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-04-07 13:31:58,261 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-07 13:31:58,267 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [341803543] [2022-04-07 13:31:58,267 WARN L310 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2022-04-07 13:31:58,267 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1176777669] [2022-04-07 13:31:58,267 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1176777669] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-07 13:31:58,267 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-07 13:31:58,268 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2022-04-07 13:31:58,268 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [946360272] [2022-04-07 13:31:58,268 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-07 13:31:58,269 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 3.0) internal successors, (15), 4 states have internal predecessors, (15), 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 26 [2022-04-07 13:31:58,269 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-07 13:31:58,269 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with has 5 states, 5 states have (on average 3.0) internal successors, (15), 4 states have internal predecessors, (15), 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 13:31:58,285 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 23 edges. 23 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-07 13:31:58,285 INFO L554 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-04-07 13:31:58,285 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-04-07 13:31:58,286 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-04-07 13:31:58,286 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2022-04-07 13:31:58,287 INFO L87 Difference]: Start difference. First operand 30 states and 36 transitions. Second operand has 5 states, 5 states have (on average 3.0) internal successors, (15), 4 states have internal predecessors, (15), 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 13:32:00,481 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-07 13:32:00,482 INFO L93 Difference]: Finished difference Result 41 states and 48 transitions. [2022-04-07 13:32:00,482 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-04-07 13:32:00,482 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 3.0) internal successors, (15), 4 states have internal predecessors, (15), 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 26 [2022-04-07 13:32:00,482 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-07 13:32:00,482 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 5 states, 5 states have (on average 3.0) internal successors, (15), 4 states have internal predecessors, (15), 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 13:32:00,484 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 48 transitions. [2022-04-07 13:32:00,484 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 5 states, 5 states have (on average 3.0) internal successors, (15), 4 states have internal predecessors, (15), 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 13:32:00,485 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 48 transitions. [2022-04-07 13:32:00,485 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 5 states and 48 transitions. [2022-04-07 13:32:00,551 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 48 edges. 48 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-07 13:32:00,552 INFO L225 Difference]: With dead ends: 41 [2022-04-07 13:32:00,552 INFO L226 Difference]: Without dead ends: 34 [2022-04-07 13:32:00,552 INFO L912 BasicCegarLoop]: 0 DeclaredPredicates, 25 GetRequests, 22 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 13:32:00,553 INFO L913 BasicCegarLoop]: 31 mSDtfsCounter, 7 mSDsluCounter, 66 mSDsCounter, 0 mSdLazyCounter, 13 mSolverCounterSat, 7 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 7 SdHoareTripleChecker+Valid, 97 SdHoareTripleChecker+Invalid, 20 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 7 IncrementalHoareTripleChecker+Valid, 13 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-04-07 13:32:00,553 INFO L914 BasicCegarLoop]: SdHoareTripleChecker [7 Valid, 97 Invalid, 20 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [7 Valid, 13 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-04-07 13:32:00,554 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 34 states. [2022-04-07 13:32:00,559 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 34 to 33. [2022-04-07 13:32:00,559 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-07 13:32:00,559 INFO L82 GeneralOperation]: Start isEquivalent. First operand 34 states. Second operand has 33 states, 23 states have (on average 1.3043478260869565) internal successors, (30), 24 states have internal predecessors, (30), 6 states have call successors, (6), 4 states have call predecessors, (6), 3 states have return successors, (4), 4 states have call predecessors, (4), 4 states have call successors, (4) [2022-04-07 13:32:00,559 INFO L74 IsIncluded]: Start isIncluded. First operand 34 states. Second operand has 33 states, 23 states have (on average 1.3043478260869565) internal successors, (30), 24 states have internal predecessors, (30), 6 states have call successors, (6), 4 states have call predecessors, (6), 3 states have return successors, (4), 4 states have call predecessors, (4), 4 states have call successors, (4) [2022-04-07 13:32:00,559 INFO L87 Difference]: Start difference. First operand 34 states. Second operand has 33 states, 23 states have (on average 1.3043478260869565) internal successors, (30), 24 states have internal predecessors, (30), 6 states have call successors, (6), 4 states have call predecessors, (6), 3 states have return successors, (4), 4 states have call predecessors, (4), 4 states have call successors, (4) [2022-04-07 13:32:00,561 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-07 13:32:00,561 INFO L93 Difference]: Finished difference Result 34 states and 41 transitions. [2022-04-07 13:32:00,561 INFO L276 IsEmpty]: Start isEmpty. Operand 34 states and 41 transitions. [2022-04-07 13:32:00,561 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-07 13:32:00,561 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-07 13:32:00,561 INFO L74 IsIncluded]: Start isIncluded. First operand has 33 states, 23 states have (on average 1.3043478260869565) internal successors, (30), 24 states have internal predecessors, (30), 6 states have call successors, (6), 4 states have call predecessors, (6), 3 states have return successors, (4), 4 states have call predecessors, (4), 4 states have call successors, (4) Second operand 34 states. [2022-04-07 13:32:00,562 INFO L87 Difference]: Start difference. First operand has 33 states, 23 states have (on average 1.3043478260869565) internal successors, (30), 24 states have internal predecessors, (30), 6 states have call successors, (6), 4 states have call predecessors, (6), 3 states have return successors, (4), 4 states have call predecessors, (4), 4 states have call successors, (4) Second operand 34 states. [2022-04-07 13:32:00,563 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-07 13:32:00,563 INFO L93 Difference]: Finished difference Result 34 states and 41 transitions. [2022-04-07 13:32:00,563 INFO L276 IsEmpty]: Start isEmpty. Operand 34 states and 41 transitions. [2022-04-07 13:32:00,563 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-07 13:32:00,563 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-07 13:32:00,563 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-07 13:32:00,563 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-07 13:32:00,564 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 33 states, 23 states have (on average 1.3043478260869565) internal successors, (30), 24 states have internal predecessors, (30), 6 states have call successors, (6), 4 states have call predecessors, (6), 3 states have return successors, (4), 4 states have call predecessors, (4), 4 states have call successors, (4) [2022-04-07 13:32:00,565 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 33 states to 33 states and 40 transitions. [2022-04-07 13:32:00,565 INFO L78 Accepts]: Start accepts. Automaton has 33 states and 40 transitions. Word has length 26 [2022-04-07 13:32:00,565 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-07 13:32:00,565 INFO L478 AbstractCegarLoop]: Abstraction has 33 states and 40 transitions. [2022-04-07 13:32:00,565 INFO L479 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 3.0) internal successors, (15), 4 states have internal predecessors, (15), 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 13:32:00,565 INFO L276 IsEmpty]: Start isEmpty. Operand 33 states and 40 transitions. [2022-04-07 13:32:00,566 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 27 [2022-04-07 13:32:00,566 INFO L491 BasicCegarLoop]: Found error trace [2022-04-07 13:32:00,566 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, 1, 1, 1] [2022-04-07 13:32:00,600 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 13:32:00,779 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,SelfDestructingSolverStorable2 [2022-04-07 13:32:00,780 INFO L403 AbstractCegarLoop]: === Iteration 4 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-07 13:32:00,780 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-07 13:32:00,780 INFO L85 PathProgramCache]: Analyzing trace with hash 424222106, now seen corresponding path program 1 times [2022-04-07 13:32:00,780 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-07 13:32:00,781 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [431715837] [2022-04-07 13:32:00,781 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-07 13:32:00,781 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-07 13:32:00,795 ERROR L245 FreeRefinementEngine]: Caught known exception: Unsupported non-linear arithmetic [2022-04-07 13:32:00,795 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [343018614] [2022-04-07 13:32:00,795 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-07 13:32:00,795 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-07 13:32:00,795 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-04-07 13:32:00,796 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 13:32:00,797 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 13:32:00,842 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-07 13:32:00,843 INFO L263 TraceCheckSpWp]: Trace formula consists of 91 conjuncts, 15 conjunts are in the unsatisfiable core [2022-04-07 13:32:00,856 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-07 13:32:00,857 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-04-07 13:32:01,643 INFO L272 TraceCheckUtils]: 0: Hoare triple {715#true} call ULTIMATE.init(); {715#true} is VALID [2022-04-07 13:32:01,643 INFO L290 TraceCheckUtils]: 1: Hoare triple {715#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(9, 2);~counter~0 := 0; {715#true} is VALID [2022-04-07 13:32:01,643 INFO L290 TraceCheckUtils]: 2: Hoare triple {715#true} assume true; {715#true} is VALID [2022-04-07 13:32:01,643 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {715#true} {715#true} #89#return; {715#true} is VALID [2022-04-07 13:32:01,644 INFO L272 TraceCheckUtils]: 4: Hoare triple {715#true} call #t~ret5 := main(); {715#true} is VALID [2022-04-07 13:32:01,644 INFO L290 TraceCheckUtils]: 5: Hoare triple {715#true} havoc ~A~0;havoc ~B~0;havoc ~q~0;havoc ~r~0;havoc ~b~0;~A~0 := #t~nondet1;havoc #t~nondet1;~B~0 := #t~nondet2;havoc #t~nondet2; {715#true} is VALID [2022-04-07 13:32:01,644 INFO L272 TraceCheckUtils]: 6: Hoare triple {715#true} call assume_abort_if_not((if ~B~0 % 4294967296 < 2147483647 then 1 else 0)); {715#true} is VALID [2022-04-07 13:32:01,645 INFO L290 TraceCheckUtils]: 7: Hoare triple {715#true} ~cond := #in~cond; {741#(= assume_abort_if_not_~cond |assume_abort_if_not_#in~cond|)} is VALID [2022-04-07 13:32:01,645 INFO L290 TraceCheckUtils]: 8: Hoare triple {741#(= assume_abort_if_not_~cond |assume_abort_if_not_#in~cond|)} assume !(0 == ~cond); {745#(not (= |assume_abort_if_not_#in~cond| 0))} is VALID [2022-04-07 13:32:01,645 INFO L290 TraceCheckUtils]: 9: Hoare triple {745#(not (= |assume_abort_if_not_#in~cond| 0))} assume true; {745#(not (= |assume_abort_if_not_#in~cond| 0))} is VALID [2022-04-07 13:32:01,646 INFO L284 TraceCheckUtils]: 10: Hoare quadruple {745#(not (= |assume_abort_if_not_#in~cond| 0))} {715#true} #81#return; {752#(< (mod main_~B~0 4294967296) 2147483647)} is VALID [2022-04-07 13:32:01,646 INFO L272 TraceCheckUtils]: 11: Hoare triple {752#(< (mod main_~B~0 4294967296) 2147483647)} call assume_abort_if_not((if ~B~0 % 4294967296 >= 1 then 1 else 0)); {715#true} is VALID [2022-04-07 13:32:01,646 INFO L290 TraceCheckUtils]: 12: Hoare triple {715#true} ~cond := #in~cond; {715#true} is VALID [2022-04-07 13:32:01,646 INFO L290 TraceCheckUtils]: 13: Hoare triple {715#true} assume !(0 == ~cond); {715#true} is VALID [2022-04-07 13:32:01,646 INFO L290 TraceCheckUtils]: 14: Hoare triple {715#true} assume true; {715#true} is VALID [2022-04-07 13:32:01,647 INFO L284 TraceCheckUtils]: 15: Hoare quadruple {715#true} {752#(< (mod main_~B~0 4294967296) 2147483647)} #83#return; {752#(< (mod main_~B~0 4294967296) 2147483647)} is VALID [2022-04-07 13:32:01,647 INFO L290 TraceCheckUtils]: 16: Hoare triple {752#(< (mod main_~B~0 4294967296) 2147483647)} ~q~0 := 0;~r~0 := ~A~0;~b~0 := ~B~0; {771#(and (= main_~A~0 main_~r~0) (= main_~q~0 0) (< (mod main_~b~0 4294967296) 2147483647))} is VALID [2022-04-07 13:32:01,648 INFO L290 TraceCheckUtils]: 17: Hoare triple {771#(and (= main_~A~0 main_~r~0) (= main_~q~0 0) (< (mod main_~b~0 4294967296) 2147483647))} #t~post3 := ~counter~0;~counter~0 := 1 + #t~post3; {771#(and (= main_~A~0 main_~r~0) (= main_~q~0 0) (< (mod main_~b~0 4294967296) 2147483647))} is VALID [2022-04-07 13:32:01,650 INFO L290 TraceCheckUtils]: 18: Hoare triple {771#(and (= main_~A~0 main_~r~0) (= main_~q~0 0) (< (mod main_~b~0 4294967296) 2147483647))} assume !!(#t~post3 < 5);havoc #t~post3; {771#(and (= main_~A~0 main_~r~0) (= main_~q~0 0) (< (mod main_~b~0 4294967296) 2147483647))} is VALID [2022-04-07 13:32:01,650 INFO L290 TraceCheckUtils]: 19: Hoare triple {771#(and (= main_~A~0 main_~r~0) (= main_~q~0 0) (< (mod main_~b~0 4294967296) 2147483647))} assume !(~r~0 % 4294967296 >= ~b~0 % 4294967296); {781#(and (not (<= (mod main_~b~0 4294967296) (mod main_~r~0 4294967296))) (= main_~A~0 main_~r~0) (= main_~q~0 0) (< (mod main_~b~0 4294967296) 2147483647))} is VALID [2022-04-07 13:32:01,651 INFO L290 TraceCheckUtils]: 20: Hoare triple {781#(and (not (<= (mod main_~b~0 4294967296) (mod main_~r~0 4294967296))) (= main_~A~0 main_~r~0) (= main_~q~0 0) (< (mod main_~b~0 4294967296) 2147483647))} #t~post4 := ~counter~0;~counter~0 := 1 + #t~post4; {781#(and (not (<= (mod main_~b~0 4294967296) (mod main_~r~0 4294967296))) (= main_~A~0 main_~r~0) (= main_~q~0 0) (< (mod main_~b~0 4294967296) 2147483647))} is VALID [2022-04-07 13:32:01,652 INFO L290 TraceCheckUtils]: 21: Hoare triple {781#(and (not (<= (mod main_~b~0 4294967296) (mod main_~r~0 4294967296))) (= main_~A~0 main_~r~0) (= main_~q~0 0) (< (mod main_~b~0 4294967296) 2147483647))} assume !!(#t~post4 < 5);havoc #t~post4; {781#(and (not (<= (mod main_~b~0 4294967296) (mod main_~r~0 4294967296))) (= main_~A~0 main_~r~0) (= main_~q~0 0) (< (mod main_~b~0 4294967296) 2147483647))} is VALID [2022-04-07 13:32:01,653 INFO L272 TraceCheckUtils]: 22: Hoare triple {781#(and (not (<= (mod main_~b~0 4294967296) (mod main_~r~0 4294967296))) (= main_~A~0 main_~r~0) (= main_~q~0 0) (< (mod main_~b~0 4294967296) 2147483647))} call __VERIFIER_assert((if ~A~0 % 4294967296 == (~q~0 * ~b~0 + ~r~0) % 4294967296 then 1 else 0)); {791#(<= 1 |__VERIFIER_assert_#in~cond|)} is VALID [2022-04-07 13:32:01,653 INFO L290 TraceCheckUtils]: 23: Hoare triple {791#(<= 1 |__VERIFIER_assert_#in~cond|)} ~cond := #in~cond; {795#(<= 1 __VERIFIER_assert_~cond)} is VALID [2022-04-07 13:32:01,653 INFO L290 TraceCheckUtils]: 24: Hoare triple {795#(<= 1 __VERIFIER_assert_~cond)} assume 0 == ~cond; {716#false} is VALID [2022-04-07 13:32:01,653 INFO L290 TraceCheckUtils]: 25: Hoare triple {716#false} assume !false; {716#false} is VALID [2022-04-07 13:32:01,654 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2022-04-07 13:32:01,654 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-04-07 13:32:02,020 INFO L290 TraceCheckUtils]: 25: Hoare triple {716#false} assume !false; {716#false} is VALID [2022-04-07 13:32:02,021 INFO L290 TraceCheckUtils]: 24: Hoare triple {795#(<= 1 __VERIFIER_assert_~cond)} assume 0 == ~cond; {716#false} is VALID [2022-04-07 13:32:02,021 INFO L290 TraceCheckUtils]: 23: Hoare triple {791#(<= 1 |__VERIFIER_assert_#in~cond|)} ~cond := #in~cond; {795#(<= 1 __VERIFIER_assert_~cond)} is VALID [2022-04-07 13:32:02,022 INFO L272 TraceCheckUtils]: 22: Hoare triple {811#(= (mod main_~A~0 4294967296) (mod (+ main_~r~0 (* main_~b~0 main_~q~0)) 4294967296))} call __VERIFIER_assert((if ~A~0 % 4294967296 == (~q~0 * ~b~0 + ~r~0) % 4294967296 then 1 else 0)); {791#(<= 1 |__VERIFIER_assert_#in~cond|)} is VALID [2022-04-07 13:32:02,023 INFO L290 TraceCheckUtils]: 21: Hoare triple {811#(= (mod main_~A~0 4294967296) (mod (+ main_~r~0 (* main_~b~0 main_~q~0)) 4294967296))} assume !!(#t~post4 < 5);havoc #t~post4; {811#(= (mod main_~A~0 4294967296) (mod (+ main_~r~0 (* main_~b~0 main_~q~0)) 4294967296))} is VALID [2022-04-07 13:32:02,023 INFO L290 TraceCheckUtils]: 20: Hoare triple {811#(= (mod main_~A~0 4294967296) (mod (+ main_~r~0 (* main_~b~0 main_~q~0)) 4294967296))} #t~post4 := ~counter~0;~counter~0 := 1 + #t~post4; {811#(= (mod main_~A~0 4294967296) (mod (+ main_~r~0 (* main_~b~0 main_~q~0)) 4294967296))} is VALID [2022-04-07 13:32:02,027 INFO L290 TraceCheckUtils]: 19: Hoare triple {821#(or (= (mod main_~A~0 4294967296) (mod (+ main_~r~0 (* main_~b~0 main_~q~0)) 4294967296)) (<= (mod main_~b~0 4294967296) (mod main_~r~0 4294967296)))} assume !(~r~0 % 4294967296 >= ~b~0 % 4294967296); {811#(= (mod main_~A~0 4294967296) (mod (+ main_~r~0 (* main_~b~0 main_~q~0)) 4294967296))} is VALID [2022-04-07 13:32:02,029 INFO L290 TraceCheckUtils]: 18: Hoare triple {821#(or (= (mod main_~A~0 4294967296) (mod (+ main_~r~0 (* main_~b~0 main_~q~0)) 4294967296)) (<= (mod main_~b~0 4294967296) (mod main_~r~0 4294967296)))} assume !!(#t~post3 < 5);havoc #t~post3; {821#(or (= (mod main_~A~0 4294967296) (mod (+ main_~r~0 (* main_~b~0 main_~q~0)) 4294967296)) (<= (mod main_~b~0 4294967296) (mod main_~r~0 4294967296)))} is VALID [2022-04-07 13:32:02,029 INFO L290 TraceCheckUtils]: 17: Hoare triple {821#(or (= (mod main_~A~0 4294967296) (mod (+ main_~r~0 (* main_~b~0 main_~q~0)) 4294967296)) (<= (mod main_~b~0 4294967296) (mod main_~r~0 4294967296)))} #t~post3 := ~counter~0;~counter~0 := 1 + #t~post3; {821#(or (= (mod main_~A~0 4294967296) (mod (+ main_~r~0 (* main_~b~0 main_~q~0)) 4294967296)) (<= (mod main_~b~0 4294967296) (mod main_~r~0 4294967296)))} is VALID [2022-04-07 13:32:02,030 INFO L290 TraceCheckUtils]: 16: Hoare triple {715#true} ~q~0 := 0;~r~0 := ~A~0;~b~0 := ~B~0; {821#(or (= (mod main_~A~0 4294967296) (mod (+ main_~r~0 (* main_~b~0 main_~q~0)) 4294967296)) (<= (mod main_~b~0 4294967296) (mod main_~r~0 4294967296)))} is VALID [2022-04-07 13:32:02,030 INFO L284 TraceCheckUtils]: 15: Hoare quadruple {715#true} {715#true} #83#return; {715#true} is VALID [2022-04-07 13:32:02,030 INFO L290 TraceCheckUtils]: 14: Hoare triple {715#true} assume true; {715#true} is VALID [2022-04-07 13:32:02,030 INFO L290 TraceCheckUtils]: 13: Hoare triple {715#true} assume !(0 == ~cond); {715#true} is VALID [2022-04-07 13:32:02,030 INFO L290 TraceCheckUtils]: 12: Hoare triple {715#true} ~cond := #in~cond; {715#true} is VALID [2022-04-07 13:32:02,030 INFO L272 TraceCheckUtils]: 11: Hoare triple {715#true} call assume_abort_if_not((if ~B~0 % 4294967296 >= 1 then 1 else 0)); {715#true} is VALID [2022-04-07 13:32:02,030 INFO L284 TraceCheckUtils]: 10: Hoare quadruple {715#true} {715#true} #81#return; {715#true} is VALID [2022-04-07 13:32:02,030 INFO L290 TraceCheckUtils]: 9: Hoare triple {715#true} assume true; {715#true} is VALID [2022-04-07 13:32:02,030 INFO L290 TraceCheckUtils]: 8: Hoare triple {715#true} assume !(0 == ~cond); {715#true} is VALID [2022-04-07 13:32:02,031 INFO L290 TraceCheckUtils]: 7: Hoare triple {715#true} ~cond := #in~cond; {715#true} is VALID [2022-04-07 13:32:02,031 INFO L272 TraceCheckUtils]: 6: Hoare triple {715#true} call assume_abort_if_not((if ~B~0 % 4294967296 < 2147483647 then 1 else 0)); {715#true} is VALID [2022-04-07 13:32:02,031 INFO L290 TraceCheckUtils]: 5: Hoare triple {715#true} havoc ~A~0;havoc ~B~0;havoc ~q~0;havoc ~r~0;havoc ~b~0;~A~0 := #t~nondet1;havoc #t~nondet1;~B~0 := #t~nondet2;havoc #t~nondet2; {715#true} is VALID [2022-04-07 13:32:02,031 INFO L272 TraceCheckUtils]: 4: Hoare triple {715#true} call #t~ret5 := main(); {715#true} is VALID [2022-04-07 13:32:02,031 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {715#true} {715#true} #89#return; {715#true} is VALID [2022-04-07 13:32:02,031 INFO L290 TraceCheckUtils]: 2: Hoare triple {715#true} assume true; {715#true} is VALID [2022-04-07 13:32:02,031 INFO L290 TraceCheckUtils]: 1: Hoare triple {715#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(9, 2);~counter~0 := 0; {715#true} is VALID [2022-04-07 13:32:02,031 INFO L272 TraceCheckUtils]: 0: Hoare triple {715#true} call ULTIMATE.init(); {715#true} is VALID [2022-04-07 13:32:02,032 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 13:32:02,032 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-07 13:32:02,032 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [431715837] [2022-04-07 13:32:02,032 WARN L310 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2022-04-07 13:32:02,032 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [343018614] [2022-04-07 13:32:02,032 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [343018614] provided 1 perfect and 1 imperfect interpolant sequences [2022-04-07 13:32:02,032 INFO L184 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2022-04-07 13:32:02,032 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [9] total 11 [2022-04-07 13:32:02,032 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2128062900] [2022-04-07 13:32:02,033 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-07 13:32:02,033 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 2.5) internal successors, (15), 5 states have internal predecessors, (15), 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 26 [2022-04-07 13:32:02,033 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-07 13:32:02,033 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with has 6 states, 6 states have (on average 2.5) internal successors, (15), 5 states have internal predecessors, (15), 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 13:32:02,058 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 23 edges. 23 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-07 13:32:02,058 INFO L554 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2022-04-07 13:32:02,058 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-04-07 13:32:02,059 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2022-04-07 13:32:02,059 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=25, Invalid=85, Unknown=0, NotChecked=0, Total=110 [2022-04-07 13:32:02,059 INFO L87 Difference]: Start difference. First operand 33 states and 40 transitions. Second operand has 6 states, 6 states have (on average 2.5) internal successors, (15), 5 states have internal predecessors, (15), 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 13:32:04,432 WARN L534 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=true, quantifiers [] [2022-04-07 13:32:06,632 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-07 13:32:06,632 INFO L93 Difference]: Finished difference Result 42 states and 50 transitions. [2022-04-07 13:32:06,633 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-04-07 13:32:06,633 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 2.5) internal successors, (15), 5 states have internal predecessors, (15), 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 26 [2022-04-07 13:32:06,634 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-07 13:32:06,634 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 6 states, 6 states have (on average 2.5) internal successors, (15), 5 states have internal predecessors, (15), 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 13:32:06,636 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 50 transitions. [2022-04-07 13:32:06,636 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 6 states, 6 states have (on average 2.5) internal successors, (15), 5 states have internal predecessors, (15), 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 13:32:06,637 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 50 transitions. [2022-04-07 13:32:06,637 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 5 states and 50 transitions. [2022-04-07 13:32:06,681 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 13:32:06,682 INFO L225 Difference]: With dead ends: 42 [2022-04-07 13:32:06,682 INFO L226 Difference]: Without dead ends: 39 [2022-04-07 13:32:06,683 INFO L912 BasicCegarLoop]: 0 DeclaredPredicates, 52 GetRequests, 41 SyntacticMatches, 1 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 8 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=29, Invalid=103, Unknown=0, NotChecked=0, Total=132 [2022-04-07 13:32:06,684 INFO L913 BasicCegarLoop]: 29 mSDtfsCounter, 11 mSDsluCounter, 97 mSDsCounter, 0 mSdLazyCounter, 49 mSolverCounterSat, 2 mSolverCounterUnsat, 1 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 2.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 12 SdHoareTripleChecker+Valid, 126 SdHoareTripleChecker+Invalid, 52 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 49 IncrementalHoareTripleChecker+Invalid, 1 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 2.2s IncrementalHoareTripleChecker+Time [2022-04-07 13:32:06,684 INFO L914 BasicCegarLoop]: SdHoareTripleChecker [12 Valid, 126 Invalid, 52 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 49 Invalid, 1 Unknown, 0 Unchecked, 2.2s Time] [2022-04-07 13:32:06,684 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 39 states. [2022-04-07 13:32:06,691 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 39 to 39. [2022-04-07 13:32:06,691 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-07 13:32:06,691 INFO L82 GeneralOperation]: Start isEquivalent. First operand 39 states. Second operand has 39 states, 27 states have (on average 1.2592592592592593) internal successors, (34), 28 states have internal predecessors, (34), 7 states have call successors, (7), 5 states have call predecessors, (7), 4 states have return successors, (5), 5 states have call predecessors, (5), 5 states have call successors, (5) [2022-04-07 13:32:06,691 INFO L74 IsIncluded]: Start isIncluded. First operand 39 states. Second operand has 39 states, 27 states have (on average 1.2592592592592593) internal successors, (34), 28 states have internal predecessors, (34), 7 states have call successors, (7), 5 states have call predecessors, (7), 4 states have return successors, (5), 5 states have call predecessors, (5), 5 states have call successors, (5) [2022-04-07 13:32:06,692 INFO L87 Difference]: Start difference. First operand 39 states. Second operand has 39 states, 27 states have (on average 1.2592592592592593) internal successors, (34), 28 states have internal predecessors, (34), 7 states have call successors, (7), 5 states have call predecessors, (7), 4 states have return successors, (5), 5 states have call predecessors, (5), 5 states have call successors, (5) [2022-04-07 13:32:06,693 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-07 13:32:06,693 INFO L93 Difference]: Finished difference Result 39 states and 46 transitions. [2022-04-07 13:32:06,693 INFO L276 IsEmpty]: Start isEmpty. Operand 39 states and 46 transitions. [2022-04-07 13:32:06,694 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-07 13:32:06,694 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-07 13:32:06,694 INFO L74 IsIncluded]: Start isIncluded. First operand has 39 states, 27 states have (on average 1.2592592592592593) internal successors, (34), 28 states have internal predecessors, (34), 7 states have call successors, (7), 5 states have call predecessors, (7), 4 states have return successors, (5), 5 states have call predecessors, (5), 5 states have call successors, (5) Second operand 39 states. [2022-04-07 13:32:06,694 INFO L87 Difference]: Start difference. First operand has 39 states, 27 states have (on average 1.2592592592592593) internal successors, (34), 28 states have internal predecessors, (34), 7 states have call successors, (7), 5 states have call predecessors, (7), 4 states have return successors, (5), 5 states have call predecessors, (5), 5 states have call successors, (5) Second operand 39 states. [2022-04-07 13:32:06,695 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-07 13:32:06,695 INFO L93 Difference]: Finished difference Result 39 states and 46 transitions. [2022-04-07 13:32:06,696 INFO L276 IsEmpty]: Start isEmpty. Operand 39 states and 46 transitions. [2022-04-07 13:32:06,696 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-07 13:32:06,696 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-07 13:32:06,696 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-07 13:32:06,696 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-07 13:32:06,696 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 39 states, 27 states have (on average 1.2592592592592593) internal successors, (34), 28 states have internal predecessors, (34), 7 states have call successors, (7), 5 states have call predecessors, (7), 4 states have return successors, (5), 5 states have call predecessors, (5), 5 states have call successors, (5) [2022-04-07 13:32:06,698 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 39 states to 39 states and 46 transitions. [2022-04-07 13:32:06,698 INFO L78 Accepts]: Start accepts. Automaton has 39 states and 46 transitions. Word has length 26 [2022-04-07 13:32:06,698 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-07 13:32:06,700 INFO L478 AbstractCegarLoop]: Abstraction has 39 states and 46 transitions. [2022-04-07 13:32:06,700 INFO L479 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 2.5) internal successors, (15), 5 states have internal predecessors, (15), 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 13:32:06,702 INFO L276 IsEmpty]: Start isEmpty. Operand 39 states and 46 transitions. [2022-04-07 13:32:06,702 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 29 [2022-04-07 13:32:06,703 INFO L491 BasicCegarLoop]: Found error trace [2022-04-07 13:32:06,703 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] [2022-04-07 13:32:06,728 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 13:32:06,903 WARN L460 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3,4 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-07 13:32:06,904 INFO L403 AbstractCegarLoop]: === Iteration 5 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-07 13:32:06,904 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-07 13:32:06,904 INFO L85 PathProgramCache]: Analyzing trace with hash -193375877, now seen corresponding path program 1 times [2022-04-07 13:32:06,904 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-07 13:32:06,904 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1948703551] [2022-04-07 13:32:06,904 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-07 13:32:06,904 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-07 13:32:06,935 ERROR L245 FreeRefinementEngine]: Caught known exception: Unsupported non-linear arithmetic [2022-04-07 13:32:06,935 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [1914351140] [2022-04-07 13:32:06,935 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-07 13:32:06,935 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-07 13:32:06,935 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-04-07 13:32:06,942 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 13:32:06,943 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 13:32:06,981 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-07 13:32:06,982 INFO L263 TraceCheckSpWp]: Trace formula consists of 98 conjuncts, 7 conjunts are in the unsatisfiable core [2022-04-07 13:32:06,989 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-07 13:32:06,990 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-04-07 13:32:07,111 INFO L272 TraceCheckUtils]: 0: Hoare triple {1071#true} call ULTIMATE.init(); {1071#true} is VALID [2022-04-07 13:32:07,112 INFO L290 TraceCheckUtils]: 1: Hoare triple {1071#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(9, 2);~counter~0 := 0; {1079#(<= ~counter~0 0)} is VALID [2022-04-07 13:32:07,112 INFO L290 TraceCheckUtils]: 2: Hoare triple {1079#(<= ~counter~0 0)} assume true; {1079#(<= ~counter~0 0)} is VALID [2022-04-07 13:32:07,113 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {1079#(<= ~counter~0 0)} {1071#true} #89#return; {1079#(<= ~counter~0 0)} is VALID [2022-04-07 13:32:07,113 INFO L272 TraceCheckUtils]: 4: Hoare triple {1079#(<= ~counter~0 0)} call #t~ret5 := main(); {1079#(<= ~counter~0 0)} is VALID [2022-04-07 13:32:07,113 INFO L290 TraceCheckUtils]: 5: Hoare triple {1079#(<= ~counter~0 0)} havoc ~A~0;havoc ~B~0;havoc ~q~0;havoc ~r~0;havoc ~b~0;~A~0 := #t~nondet1;havoc #t~nondet1;~B~0 := #t~nondet2;havoc #t~nondet2; {1079#(<= ~counter~0 0)} is VALID [2022-04-07 13:32:07,114 INFO L272 TraceCheckUtils]: 6: Hoare triple {1079#(<= ~counter~0 0)} call assume_abort_if_not((if ~B~0 % 4294967296 < 2147483647 then 1 else 0)); {1079#(<= ~counter~0 0)} is VALID [2022-04-07 13:32:07,114 INFO L290 TraceCheckUtils]: 7: Hoare triple {1079#(<= ~counter~0 0)} ~cond := #in~cond; {1079#(<= ~counter~0 0)} is VALID [2022-04-07 13:32:07,114 INFO L290 TraceCheckUtils]: 8: Hoare triple {1079#(<= ~counter~0 0)} assume !(0 == ~cond); {1079#(<= ~counter~0 0)} is VALID [2022-04-07 13:32:07,115 INFO L290 TraceCheckUtils]: 9: Hoare triple {1079#(<= ~counter~0 0)} assume true; {1079#(<= ~counter~0 0)} is VALID [2022-04-07 13:32:07,115 INFO L284 TraceCheckUtils]: 10: Hoare quadruple {1079#(<= ~counter~0 0)} {1079#(<= ~counter~0 0)} #81#return; {1079#(<= ~counter~0 0)} is VALID [2022-04-07 13:32:07,116 INFO L272 TraceCheckUtils]: 11: Hoare triple {1079#(<= ~counter~0 0)} call assume_abort_if_not((if ~B~0 % 4294967296 >= 1 then 1 else 0)); {1079#(<= ~counter~0 0)} is VALID [2022-04-07 13:32:07,116 INFO L290 TraceCheckUtils]: 12: Hoare triple {1079#(<= ~counter~0 0)} ~cond := #in~cond; {1079#(<= ~counter~0 0)} is VALID [2022-04-07 13:32:07,116 INFO L290 TraceCheckUtils]: 13: Hoare triple {1079#(<= ~counter~0 0)} assume !(0 == ~cond); {1079#(<= ~counter~0 0)} is VALID [2022-04-07 13:32:07,117 INFO L290 TraceCheckUtils]: 14: Hoare triple {1079#(<= ~counter~0 0)} assume true; {1079#(<= ~counter~0 0)} is VALID [2022-04-07 13:32:07,117 INFO L284 TraceCheckUtils]: 15: Hoare quadruple {1079#(<= ~counter~0 0)} {1079#(<= ~counter~0 0)} #83#return; {1079#(<= ~counter~0 0)} is VALID [2022-04-07 13:32:07,117 INFO L290 TraceCheckUtils]: 16: Hoare triple {1079#(<= ~counter~0 0)} ~q~0 := 0;~r~0 := ~A~0;~b~0 := ~B~0; {1079#(<= ~counter~0 0)} is VALID [2022-04-07 13:32:07,118 INFO L290 TraceCheckUtils]: 17: Hoare triple {1079#(<= ~counter~0 0)} #t~post3 := ~counter~0;~counter~0 := 1 + #t~post3; {1128#(<= ~counter~0 1)} is VALID [2022-04-07 13:32:07,118 INFO L290 TraceCheckUtils]: 18: Hoare triple {1128#(<= ~counter~0 1)} assume !!(#t~post3 < 5);havoc #t~post3; {1128#(<= ~counter~0 1)} is VALID [2022-04-07 13:32:07,119 INFO L290 TraceCheckUtils]: 19: Hoare triple {1128#(<= ~counter~0 1)} assume !!(~r~0 % 4294967296 >= ~b~0 % 4294967296);~b~0 := 2 * ~b~0; {1128#(<= ~counter~0 1)} is VALID [2022-04-07 13:32:07,119 INFO L290 TraceCheckUtils]: 20: Hoare triple {1128#(<= ~counter~0 1)} #t~post3 := ~counter~0;~counter~0 := 1 + #t~post3; {1138#(<= |main_#t~post3| 1)} is VALID [2022-04-07 13:32:07,119 INFO L290 TraceCheckUtils]: 21: Hoare triple {1138#(<= |main_#t~post3| 1)} assume !(#t~post3 < 5);havoc #t~post3; {1072#false} is VALID [2022-04-07 13:32:07,120 INFO L290 TraceCheckUtils]: 22: Hoare triple {1072#false} #t~post4 := ~counter~0;~counter~0 := 1 + #t~post4; {1072#false} is VALID [2022-04-07 13:32:07,120 INFO L290 TraceCheckUtils]: 23: Hoare triple {1072#false} assume !(#t~post4 < 5);havoc #t~post4; {1072#false} is VALID [2022-04-07 13:32:07,120 INFO L272 TraceCheckUtils]: 24: Hoare triple {1072#false} call __VERIFIER_assert((if ~A~0 % 4294967296 == (~q~0 * ~b~0 + ~r~0) % 4294967296 then 1 else 0)); {1072#false} is VALID [2022-04-07 13:32:07,120 INFO L290 TraceCheckUtils]: 25: Hoare triple {1072#false} ~cond := #in~cond; {1072#false} is VALID [2022-04-07 13:32:07,120 INFO L290 TraceCheckUtils]: 26: Hoare triple {1072#false} assume 0 == ~cond; {1072#false} is VALID [2022-04-07 13:32:07,120 INFO L290 TraceCheckUtils]: 27: Hoare triple {1072#false} assume !false; {1072#false} is VALID [2022-04-07 13:32:07,120 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2022-04-07 13:32:07,120 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-04-07 13:32:07,259 INFO L290 TraceCheckUtils]: 27: Hoare triple {1072#false} assume !false; {1072#false} is VALID [2022-04-07 13:32:07,259 INFO L290 TraceCheckUtils]: 26: Hoare triple {1072#false} assume 0 == ~cond; {1072#false} is VALID [2022-04-07 13:32:07,259 INFO L290 TraceCheckUtils]: 25: Hoare triple {1072#false} ~cond := #in~cond; {1072#false} is VALID [2022-04-07 13:32:07,259 INFO L272 TraceCheckUtils]: 24: Hoare triple {1072#false} call __VERIFIER_assert((if ~A~0 % 4294967296 == (~q~0 * ~b~0 + ~r~0) % 4294967296 then 1 else 0)); {1072#false} is VALID [2022-04-07 13:32:07,259 INFO L290 TraceCheckUtils]: 23: Hoare triple {1072#false} assume !(#t~post4 < 5);havoc #t~post4; {1072#false} is VALID [2022-04-07 13:32:07,259 INFO L290 TraceCheckUtils]: 22: Hoare triple {1072#false} #t~post4 := ~counter~0;~counter~0 := 1 + #t~post4; {1072#false} is VALID [2022-04-07 13:32:07,260 INFO L290 TraceCheckUtils]: 21: Hoare triple {1178#(< |main_#t~post3| 5)} assume !(#t~post3 < 5);havoc #t~post3; {1072#false} is VALID [2022-04-07 13:32:07,260 INFO L290 TraceCheckUtils]: 20: Hoare triple {1182#(< ~counter~0 5)} #t~post3 := ~counter~0;~counter~0 := 1 + #t~post3; {1178#(< |main_#t~post3| 5)} is VALID [2022-04-07 13:32:07,260 INFO L290 TraceCheckUtils]: 19: Hoare triple {1182#(< ~counter~0 5)} assume !!(~r~0 % 4294967296 >= ~b~0 % 4294967296);~b~0 := 2 * ~b~0; {1182#(< ~counter~0 5)} is VALID [2022-04-07 13:32:07,261 INFO L290 TraceCheckUtils]: 18: Hoare triple {1182#(< ~counter~0 5)} assume !!(#t~post3 < 5);havoc #t~post3; {1182#(< ~counter~0 5)} is VALID [2022-04-07 13:32:07,261 INFO L290 TraceCheckUtils]: 17: Hoare triple {1192#(< ~counter~0 4)} #t~post3 := ~counter~0;~counter~0 := 1 + #t~post3; {1182#(< ~counter~0 5)} is VALID [2022-04-07 13:32:07,261 INFO L290 TraceCheckUtils]: 16: Hoare triple {1192#(< ~counter~0 4)} ~q~0 := 0;~r~0 := ~A~0;~b~0 := ~B~0; {1192#(< ~counter~0 4)} is VALID [2022-04-07 13:32:07,262 INFO L284 TraceCheckUtils]: 15: Hoare quadruple {1071#true} {1192#(< ~counter~0 4)} #83#return; {1192#(< ~counter~0 4)} is VALID [2022-04-07 13:32:07,262 INFO L290 TraceCheckUtils]: 14: Hoare triple {1071#true} assume true; {1071#true} is VALID [2022-04-07 13:32:07,262 INFO L290 TraceCheckUtils]: 13: Hoare triple {1071#true} assume !(0 == ~cond); {1071#true} is VALID [2022-04-07 13:32:07,262 INFO L290 TraceCheckUtils]: 12: Hoare triple {1071#true} ~cond := #in~cond; {1071#true} is VALID [2022-04-07 13:32:07,262 INFO L272 TraceCheckUtils]: 11: Hoare triple {1192#(< ~counter~0 4)} call assume_abort_if_not((if ~B~0 % 4294967296 >= 1 then 1 else 0)); {1071#true} is VALID [2022-04-07 13:32:07,263 INFO L284 TraceCheckUtils]: 10: Hoare quadruple {1071#true} {1192#(< ~counter~0 4)} #81#return; {1192#(< ~counter~0 4)} is VALID [2022-04-07 13:32:07,263 INFO L290 TraceCheckUtils]: 9: Hoare triple {1071#true} assume true; {1071#true} is VALID [2022-04-07 13:32:07,263 INFO L290 TraceCheckUtils]: 8: Hoare triple {1071#true} assume !(0 == ~cond); {1071#true} is VALID [2022-04-07 13:32:07,263 INFO L290 TraceCheckUtils]: 7: Hoare triple {1071#true} ~cond := #in~cond; {1071#true} is VALID [2022-04-07 13:32:07,263 INFO L272 TraceCheckUtils]: 6: Hoare triple {1192#(< ~counter~0 4)} call assume_abort_if_not((if ~B~0 % 4294967296 < 2147483647 then 1 else 0)); {1071#true} is VALID [2022-04-07 13:32:07,263 INFO L290 TraceCheckUtils]: 5: Hoare triple {1192#(< ~counter~0 4)} havoc ~A~0;havoc ~B~0;havoc ~q~0;havoc ~r~0;havoc ~b~0;~A~0 := #t~nondet1;havoc #t~nondet1;~B~0 := #t~nondet2;havoc #t~nondet2; {1192#(< ~counter~0 4)} is VALID [2022-04-07 13:32:07,264 INFO L272 TraceCheckUtils]: 4: Hoare triple {1192#(< ~counter~0 4)} call #t~ret5 := main(); {1192#(< ~counter~0 4)} is VALID [2022-04-07 13:32:07,264 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {1192#(< ~counter~0 4)} {1071#true} #89#return; {1192#(< ~counter~0 4)} is VALID [2022-04-07 13:32:07,265 INFO L290 TraceCheckUtils]: 2: Hoare triple {1192#(< ~counter~0 4)} assume true; {1192#(< ~counter~0 4)} is VALID [2022-04-07 13:32:07,265 INFO L290 TraceCheckUtils]: 1: Hoare triple {1071#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(9, 2);~counter~0 := 0; {1192#(< ~counter~0 4)} is VALID [2022-04-07 13:32:07,265 INFO L272 TraceCheckUtils]: 0: Hoare triple {1071#true} call ULTIMATE.init(); {1071#true} is VALID [2022-04-07 13:32:07,265 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2022-04-07 13:32:07,265 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-07 13:32:07,265 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1948703551] [2022-04-07 13:32:07,266 WARN L310 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2022-04-07 13:32:07,266 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1914351140] [2022-04-07 13:32:07,266 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1914351140] provided 0 perfect and 2 imperfect interpolant sequences [2022-04-07 13:32:07,266 INFO L184 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2022-04-07 13:32:07,266 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [5, 5] total 8 [2022-04-07 13:32:07,266 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1600992338] [2022-04-07 13:32:07,266 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2022-04-07 13:32:07,266 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 8 states have (on average 3.625) internal successors, (29), 8 states have internal predecessors, (29), 4 states have call successors, (8), 4 states have call predecessors, (8), 3 states have return successors, (6), 2 states have call predecessors, (6), 3 states have call successors, (6) Word has length 28 [2022-04-07 13:32:07,267 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-07 13:32:07,267 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with has 8 states, 8 states have (on average 3.625) internal successors, (29), 8 states have internal predecessors, (29), 4 states have call successors, (8), 4 states have call predecessors, (8), 3 states have return successors, (6), 2 states have call predecessors, (6), 3 states have call successors, (6) [2022-04-07 13:32:07,300 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 43 edges. 43 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-07 13:32:07,300 INFO L554 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2022-04-07 13:32:07,300 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-04-07 13:32:07,300 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2022-04-07 13:32:07,301 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=20, Invalid=36, Unknown=0, NotChecked=0, Total=56 [2022-04-07 13:32:07,301 INFO L87 Difference]: Start difference. First operand 39 states and 46 transitions. Second operand has 8 states, 8 states have (on average 3.625) internal successors, (29), 8 states have internal predecessors, (29), 4 states have call successors, (8), 4 states have call predecessors, (8), 3 states have return successors, (6), 2 states have call predecessors, (6), 3 states have call successors, (6) [2022-04-07 13:32:07,487 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-07 13:32:07,487 INFO L93 Difference]: Finished difference Result 73 states and 92 transitions. [2022-04-07 13:32:07,487 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2022-04-07 13:32:07,488 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 8 states have (on average 3.625) internal successors, (29), 8 states have internal predecessors, (29), 4 states have call successors, (8), 4 states have call predecessors, (8), 3 states have return successors, (6), 2 states have call predecessors, (6), 3 states have call successors, (6) Word has length 28 [2022-04-07 13:32:07,488 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-07 13:32:07,488 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 8 states, 8 states have (on average 3.625) internal successors, (29), 8 states have internal predecessors, (29), 4 states have call successors, (8), 4 states have call predecessors, (8), 3 states have return successors, (6), 2 states have call predecessors, (6), 3 states have call successors, (6) [2022-04-07 13:32:07,490 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 10 states to 10 states and 92 transitions. [2022-04-07 13:32:07,490 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 8 states, 8 states have (on average 3.625) internal successors, (29), 8 states have internal predecessors, (29), 4 states have call successors, (8), 4 states have call predecessors, (8), 3 states have return successors, (6), 2 states have call predecessors, (6), 3 states have call successors, (6) [2022-04-07 13:32:07,492 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 10 states to 10 states and 92 transitions. [2022-04-07 13:32:07,492 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 10 states and 92 transitions. [2022-04-07 13:32:07,557 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 92 edges. 92 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-07 13:32:07,558 INFO L225 Difference]: With dead ends: 73 [2022-04-07 13:32:07,559 INFO L226 Difference]: Without dead ends: 61 [2022-04-07 13:32:07,559 INFO L912 BasicCegarLoop]: 0 DeclaredPredicates, 58 GetRequests, 49 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 7 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=40, Invalid=70, Unknown=0, NotChecked=0, Total=110 [2022-04-07 13:32:07,560 INFO L913 BasicCegarLoop]: 33 mSDtfsCounter, 34 mSDsluCounter, 116 mSDsCounter, 0 mSdLazyCounter, 29 mSolverCounterSat, 13 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 34 SdHoareTripleChecker+Valid, 149 SdHoareTripleChecker+Invalid, 42 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 13 IncrementalHoareTripleChecker+Valid, 29 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-04-07 13:32:07,560 INFO L914 BasicCegarLoop]: SdHoareTripleChecker [34 Valid, 149 Invalid, 42 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [13 Valid, 29 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-04-07 13:32:07,560 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 61 states. [2022-04-07 13:32:07,570 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 61 to 47. [2022-04-07 13:32:07,570 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-07 13:32:07,570 INFO L82 GeneralOperation]: Start isEquivalent. First operand 61 states. Second operand has 47 states, 35 states have (on average 1.2571428571428571) internal successors, (44), 36 states have internal predecessors, (44), 7 states have call successors, (7), 5 states have call predecessors, (7), 4 states have return successors, (5), 5 states have call predecessors, (5), 5 states have call successors, (5) [2022-04-07 13:32:07,571 INFO L74 IsIncluded]: Start isIncluded. First operand 61 states. Second operand has 47 states, 35 states have (on average 1.2571428571428571) internal successors, (44), 36 states have internal predecessors, (44), 7 states have call successors, (7), 5 states have call predecessors, (7), 4 states have return successors, (5), 5 states have call predecessors, (5), 5 states have call successors, (5) [2022-04-07 13:32:07,571 INFO L87 Difference]: Start difference. First operand 61 states. Second operand has 47 states, 35 states have (on average 1.2571428571428571) internal successors, (44), 36 states have internal predecessors, (44), 7 states have call successors, (7), 5 states have call predecessors, (7), 4 states have return successors, (5), 5 states have call predecessors, (5), 5 states have call successors, (5) [2022-04-07 13:32:07,572 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-07 13:32:07,573 INFO L93 Difference]: Finished difference Result 61 states and 74 transitions. [2022-04-07 13:32:07,573 INFO L276 IsEmpty]: Start isEmpty. Operand 61 states and 74 transitions. [2022-04-07 13:32:07,573 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-07 13:32:07,573 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-07 13:32:07,573 INFO L74 IsIncluded]: Start isIncluded. First operand has 47 states, 35 states have (on average 1.2571428571428571) internal successors, (44), 36 states have internal predecessors, (44), 7 states have call successors, (7), 5 states have call predecessors, (7), 4 states have return successors, (5), 5 states have call predecessors, (5), 5 states have call successors, (5) Second operand 61 states. [2022-04-07 13:32:07,573 INFO L87 Difference]: Start difference. First operand has 47 states, 35 states have (on average 1.2571428571428571) internal successors, (44), 36 states have internal predecessors, (44), 7 states have call successors, (7), 5 states have call predecessors, (7), 4 states have return successors, (5), 5 states have call predecessors, (5), 5 states have call successors, (5) Second operand 61 states. [2022-04-07 13:32:07,575 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-07 13:32:07,575 INFO L93 Difference]: Finished difference Result 61 states and 74 transitions. [2022-04-07 13:32:07,575 INFO L276 IsEmpty]: Start isEmpty. Operand 61 states and 74 transitions. [2022-04-07 13:32:07,576 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-07 13:32:07,576 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-07 13:32:07,576 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-07 13:32:07,576 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-07 13:32:07,576 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 47 states, 35 states have (on average 1.2571428571428571) internal successors, (44), 36 states have internal predecessors, (44), 7 states have call successors, (7), 5 states have call predecessors, (7), 4 states have return successors, (5), 5 states have call predecessors, (5), 5 states have call successors, (5) [2022-04-07 13:32:07,577 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 47 states to 47 states and 56 transitions. [2022-04-07 13:32:07,577 INFO L78 Accepts]: Start accepts. Automaton has 47 states and 56 transitions. Word has length 28 [2022-04-07 13:32:07,577 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-07 13:32:07,577 INFO L478 AbstractCegarLoop]: Abstraction has 47 states and 56 transitions. [2022-04-07 13:32:07,577 INFO L479 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 3.625) internal successors, (29), 8 states have internal predecessors, (29), 4 states have call successors, (8), 4 states have call predecessors, (8), 3 states have return successors, (6), 2 states have call predecessors, (6), 3 states have call successors, (6) [2022-04-07 13:32:07,577 INFO L276 IsEmpty]: Start isEmpty. Operand 47 states and 56 transitions. [2022-04-07 13:32:07,578 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 30 [2022-04-07 13:32:07,578 INFO L491 BasicCegarLoop]: Found error trace [2022-04-07 13:32:07,578 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] [2022-04-07 13:32:07,607 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 13:32:07,795 WARN L460 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4,5 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-07 13:32:07,795 INFO L403 AbstractCegarLoop]: === Iteration 6 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-07 13:32:07,795 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-07 13:32:07,795 INFO L85 PathProgramCache]: Analyzing trace with hash -2031725334, now seen corresponding path program 1 times [2022-04-07 13:32:07,795 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-07 13:32:07,795 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1342750176] [2022-04-07 13:32:07,795 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-07 13:32:07,796 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-07 13:32:07,813 ERROR L245 FreeRefinementEngine]: Caught known exception: Unsupported non-linear arithmetic [2022-04-07 13:32:07,813 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [966395286] [2022-04-07 13:32:07,813 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-07 13:32:07,814 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-07 13:32:07,814 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-04-07 13:32:07,815 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 13:32:07,816 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 13:32:07,857 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-07 13:32:07,857 INFO L263 TraceCheckSpWp]: Trace formula consists of 99 conjuncts, 9 conjunts are in the unsatisfiable core [2022-04-07 13:32:07,865 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-07 13:32:07,865 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-04-07 13:32:08,026 INFO L272 TraceCheckUtils]: 0: Hoare triple {1534#true} call ULTIMATE.init(); {1534#true} is VALID [2022-04-07 13:32:08,026 INFO L290 TraceCheckUtils]: 1: Hoare triple {1534#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(9, 2);~counter~0 := 0; {1542#(<= ~counter~0 0)} is VALID [2022-04-07 13:32:08,027 INFO L290 TraceCheckUtils]: 2: Hoare triple {1542#(<= ~counter~0 0)} assume true; {1542#(<= ~counter~0 0)} is VALID [2022-04-07 13:32:08,027 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {1542#(<= ~counter~0 0)} {1534#true} #89#return; {1542#(<= ~counter~0 0)} is VALID [2022-04-07 13:32:08,028 INFO L272 TraceCheckUtils]: 4: Hoare triple {1542#(<= ~counter~0 0)} call #t~ret5 := main(); {1542#(<= ~counter~0 0)} is VALID [2022-04-07 13:32:08,028 INFO L290 TraceCheckUtils]: 5: Hoare triple {1542#(<= ~counter~0 0)} havoc ~A~0;havoc ~B~0;havoc ~q~0;havoc ~r~0;havoc ~b~0;~A~0 := #t~nondet1;havoc #t~nondet1;~B~0 := #t~nondet2;havoc #t~nondet2; {1542#(<= ~counter~0 0)} is VALID [2022-04-07 13:32:08,029 INFO L272 TraceCheckUtils]: 6: Hoare triple {1542#(<= ~counter~0 0)} call assume_abort_if_not((if ~B~0 % 4294967296 < 2147483647 then 1 else 0)); {1542#(<= ~counter~0 0)} is VALID [2022-04-07 13:32:08,032 INFO L290 TraceCheckUtils]: 7: Hoare triple {1542#(<= ~counter~0 0)} ~cond := #in~cond; {1542#(<= ~counter~0 0)} is VALID [2022-04-07 13:32:08,032 INFO L290 TraceCheckUtils]: 8: Hoare triple {1542#(<= ~counter~0 0)} assume !(0 == ~cond); {1542#(<= ~counter~0 0)} is VALID [2022-04-07 13:32:08,032 INFO L290 TraceCheckUtils]: 9: Hoare triple {1542#(<= ~counter~0 0)} assume true; {1542#(<= ~counter~0 0)} is VALID [2022-04-07 13:32:08,033 INFO L284 TraceCheckUtils]: 10: Hoare quadruple {1542#(<= ~counter~0 0)} {1542#(<= ~counter~0 0)} #81#return; {1542#(<= ~counter~0 0)} is VALID [2022-04-07 13:32:08,033 INFO L272 TraceCheckUtils]: 11: Hoare triple {1542#(<= ~counter~0 0)} call assume_abort_if_not((if ~B~0 % 4294967296 >= 1 then 1 else 0)); {1542#(<= ~counter~0 0)} is VALID [2022-04-07 13:32:08,033 INFO L290 TraceCheckUtils]: 12: Hoare triple {1542#(<= ~counter~0 0)} ~cond := #in~cond; {1542#(<= ~counter~0 0)} is VALID [2022-04-07 13:32:08,034 INFO L290 TraceCheckUtils]: 13: Hoare triple {1542#(<= ~counter~0 0)} assume !(0 == ~cond); {1542#(<= ~counter~0 0)} is VALID [2022-04-07 13:32:08,034 INFO L290 TraceCheckUtils]: 14: Hoare triple {1542#(<= ~counter~0 0)} assume true; {1542#(<= ~counter~0 0)} is VALID [2022-04-07 13:32:08,034 INFO L284 TraceCheckUtils]: 15: Hoare quadruple {1542#(<= ~counter~0 0)} {1542#(<= ~counter~0 0)} #83#return; {1542#(<= ~counter~0 0)} is VALID [2022-04-07 13:32:08,035 INFO L290 TraceCheckUtils]: 16: Hoare triple {1542#(<= ~counter~0 0)} ~q~0 := 0;~r~0 := ~A~0;~b~0 := ~B~0; {1542#(<= ~counter~0 0)} is VALID [2022-04-07 13:32:08,035 INFO L290 TraceCheckUtils]: 17: Hoare triple {1542#(<= ~counter~0 0)} #t~post3 := ~counter~0;~counter~0 := 1 + #t~post3; {1591#(<= ~counter~0 1)} is VALID [2022-04-07 13:32:08,035 INFO L290 TraceCheckUtils]: 18: Hoare triple {1591#(<= ~counter~0 1)} assume !!(#t~post3 < 5);havoc #t~post3; {1591#(<= ~counter~0 1)} is VALID [2022-04-07 13:32:08,036 INFO L290 TraceCheckUtils]: 19: Hoare triple {1591#(<= ~counter~0 1)} assume !!(~r~0 % 4294967296 >= ~b~0 % 4294967296);~b~0 := 2 * ~b~0; {1591#(<= ~counter~0 1)} is VALID [2022-04-07 13:32:08,036 INFO L290 TraceCheckUtils]: 20: Hoare triple {1591#(<= ~counter~0 1)} #t~post3 := ~counter~0;~counter~0 := 1 + #t~post3; {1601#(<= ~counter~0 2)} is VALID [2022-04-07 13:32:08,036 INFO L290 TraceCheckUtils]: 21: Hoare triple {1601#(<= ~counter~0 2)} assume !!(#t~post3 < 5);havoc #t~post3; {1601#(<= ~counter~0 2)} is VALID [2022-04-07 13:32:08,037 INFO L290 TraceCheckUtils]: 22: Hoare triple {1601#(<= ~counter~0 2)} assume !(~r~0 % 4294967296 >= ~b~0 % 4294967296); {1601#(<= ~counter~0 2)} is VALID [2022-04-07 13:32:08,037 INFO L290 TraceCheckUtils]: 23: Hoare triple {1601#(<= ~counter~0 2)} #t~post4 := ~counter~0;~counter~0 := 1 + #t~post4; {1611#(<= |main_#t~post4| 2)} is VALID [2022-04-07 13:32:08,037 INFO L290 TraceCheckUtils]: 24: Hoare triple {1611#(<= |main_#t~post4| 2)} assume !(#t~post4 < 5);havoc #t~post4; {1535#false} is VALID [2022-04-07 13:32:08,037 INFO L272 TraceCheckUtils]: 25: Hoare triple {1535#false} call __VERIFIER_assert((if ~A~0 % 4294967296 == (~q~0 * ~b~0 + ~r~0) % 4294967296 then 1 else 0)); {1535#false} is VALID [2022-04-07 13:32:08,038 INFO L290 TraceCheckUtils]: 26: Hoare triple {1535#false} ~cond := #in~cond; {1535#false} is VALID [2022-04-07 13:32:08,038 INFO L290 TraceCheckUtils]: 27: Hoare triple {1535#false} assume 0 == ~cond; {1535#false} is VALID [2022-04-07 13:32:08,038 INFO L290 TraceCheckUtils]: 28: Hoare triple {1535#false} assume !false; {1535#false} is VALID [2022-04-07 13:32:08,038 INFO L134 CoverageAnalysis]: Checked inductivity of 7 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2022-04-07 13:32:08,038 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-04-07 13:32:08,205 INFO L290 TraceCheckUtils]: 28: Hoare triple {1535#false} assume !false; {1535#false} is VALID [2022-04-07 13:32:08,205 INFO L290 TraceCheckUtils]: 27: Hoare triple {1535#false} assume 0 == ~cond; {1535#false} is VALID [2022-04-07 13:32:08,205 INFO L290 TraceCheckUtils]: 26: Hoare triple {1535#false} ~cond := #in~cond; {1535#false} is VALID [2022-04-07 13:32:08,205 INFO L272 TraceCheckUtils]: 25: Hoare triple {1535#false} call __VERIFIER_assert((if ~A~0 % 4294967296 == (~q~0 * ~b~0 + ~r~0) % 4294967296 then 1 else 0)); {1535#false} is VALID [2022-04-07 13:32:08,205 INFO L290 TraceCheckUtils]: 24: Hoare triple {1639#(< |main_#t~post4| 5)} assume !(#t~post4 < 5);havoc #t~post4; {1535#false} is VALID [2022-04-07 13:32:08,206 INFO L290 TraceCheckUtils]: 23: Hoare triple {1643#(< ~counter~0 5)} #t~post4 := ~counter~0;~counter~0 := 1 + #t~post4; {1639#(< |main_#t~post4| 5)} is VALID [2022-04-07 13:32:08,206 INFO L290 TraceCheckUtils]: 22: Hoare triple {1643#(< ~counter~0 5)} assume !(~r~0 % 4294967296 >= ~b~0 % 4294967296); {1643#(< ~counter~0 5)} is VALID [2022-04-07 13:32:08,206 INFO L290 TraceCheckUtils]: 21: Hoare triple {1643#(< ~counter~0 5)} assume !!(#t~post3 < 5);havoc #t~post3; {1643#(< ~counter~0 5)} is VALID [2022-04-07 13:32:08,207 INFO L290 TraceCheckUtils]: 20: Hoare triple {1653#(< ~counter~0 4)} #t~post3 := ~counter~0;~counter~0 := 1 + #t~post3; {1643#(< ~counter~0 5)} is VALID [2022-04-07 13:32:08,207 INFO L290 TraceCheckUtils]: 19: Hoare triple {1653#(< ~counter~0 4)} assume !!(~r~0 % 4294967296 >= ~b~0 % 4294967296);~b~0 := 2 * ~b~0; {1653#(< ~counter~0 4)} is VALID [2022-04-07 13:32:08,207 INFO L290 TraceCheckUtils]: 18: Hoare triple {1653#(< ~counter~0 4)} assume !!(#t~post3 < 5);havoc #t~post3; {1653#(< ~counter~0 4)} is VALID [2022-04-07 13:32:08,208 INFO L290 TraceCheckUtils]: 17: Hoare triple {1601#(<= ~counter~0 2)} #t~post3 := ~counter~0;~counter~0 := 1 + #t~post3; {1653#(< ~counter~0 4)} is VALID [2022-04-07 13:32:08,208 INFO L290 TraceCheckUtils]: 16: Hoare triple {1601#(<= ~counter~0 2)} ~q~0 := 0;~r~0 := ~A~0;~b~0 := ~B~0; {1601#(<= ~counter~0 2)} is VALID [2022-04-07 13:32:08,209 INFO L284 TraceCheckUtils]: 15: Hoare quadruple {1534#true} {1601#(<= ~counter~0 2)} #83#return; {1601#(<= ~counter~0 2)} is VALID [2022-04-07 13:32:08,209 INFO L290 TraceCheckUtils]: 14: Hoare triple {1534#true} assume true; {1534#true} is VALID [2022-04-07 13:32:08,209 INFO L290 TraceCheckUtils]: 13: Hoare triple {1534#true} assume !(0 == ~cond); {1534#true} is VALID [2022-04-07 13:32:08,209 INFO L290 TraceCheckUtils]: 12: Hoare triple {1534#true} ~cond := #in~cond; {1534#true} is VALID [2022-04-07 13:32:08,209 INFO L272 TraceCheckUtils]: 11: Hoare triple {1601#(<= ~counter~0 2)} call assume_abort_if_not((if ~B~0 % 4294967296 >= 1 then 1 else 0)); {1534#true} is VALID [2022-04-07 13:32:08,209 INFO L284 TraceCheckUtils]: 10: Hoare quadruple {1534#true} {1601#(<= ~counter~0 2)} #81#return; {1601#(<= ~counter~0 2)} is VALID [2022-04-07 13:32:08,209 INFO L290 TraceCheckUtils]: 9: Hoare triple {1534#true} assume true; {1534#true} is VALID [2022-04-07 13:32:08,210 INFO L290 TraceCheckUtils]: 8: Hoare triple {1534#true} assume !(0 == ~cond); {1534#true} is VALID [2022-04-07 13:32:08,210 INFO L290 TraceCheckUtils]: 7: Hoare triple {1534#true} ~cond := #in~cond; {1534#true} is VALID [2022-04-07 13:32:08,210 INFO L272 TraceCheckUtils]: 6: Hoare triple {1601#(<= ~counter~0 2)} call assume_abort_if_not((if ~B~0 % 4294967296 < 2147483647 then 1 else 0)); {1534#true} is VALID [2022-04-07 13:32:08,215 INFO L290 TraceCheckUtils]: 5: Hoare triple {1601#(<= ~counter~0 2)} havoc ~A~0;havoc ~B~0;havoc ~q~0;havoc ~r~0;havoc ~b~0;~A~0 := #t~nondet1;havoc #t~nondet1;~B~0 := #t~nondet2;havoc #t~nondet2; {1601#(<= ~counter~0 2)} is VALID [2022-04-07 13:32:08,216 INFO L272 TraceCheckUtils]: 4: Hoare triple {1601#(<= ~counter~0 2)} call #t~ret5 := main(); {1601#(<= ~counter~0 2)} is VALID [2022-04-07 13:32:08,217 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {1601#(<= ~counter~0 2)} {1534#true} #89#return; {1601#(<= ~counter~0 2)} is VALID [2022-04-07 13:32:08,218 INFO L290 TraceCheckUtils]: 2: Hoare triple {1601#(<= ~counter~0 2)} assume true; {1601#(<= ~counter~0 2)} is VALID [2022-04-07 13:32:08,219 INFO L290 TraceCheckUtils]: 1: Hoare triple {1534#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(9, 2);~counter~0 := 0; {1601#(<= ~counter~0 2)} is VALID [2022-04-07 13:32:08,219 INFO L272 TraceCheckUtils]: 0: Hoare triple {1534#true} call ULTIMATE.init(); {1534#true} is VALID [2022-04-07 13:32:08,219 INFO L134 CoverageAnalysis]: Checked inductivity of 7 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2022-04-07 13:32:08,219 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-07 13:32:08,219 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1342750176] [2022-04-07 13:32:08,219 WARN L310 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2022-04-07 13:32:08,219 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [966395286] [2022-04-07 13:32:08,220 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [966395286] provided 0 perfect and 2 imperfect interpolant sequences [2022-04-07 13:32:08,220 INFO L184 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2022-04-07 13:32:08,220 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [6, 6] total 9 [2022-04-07 13:32:08,220 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2061005131] [2022-04-07 13:32:08,220 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2022-04-07 13:32:08,220 INFO L78 Accepts]: Start accepts. Automaton has has 9 states, 9 states have (on average 3.6666666666666665) internal successors, (33), 9 states have internal predecessors, (33), 4 states have call successors, (8), 4 states have call predecessors, (8), 3 states have return successors, (6), 2 states have call predecessors, (6), 3 states have call successors, (6) Word has length 29 [2022-04-07 13:32:08,221 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-07 13:32:08,221 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with has 9 states, 9 states have (on average 3.6666666666666665) internal successors, (33), 9 states have internal predecessors, (33), 4 states have call successors, (8), 4 states have call predecessors, (8), 3 states have return successors, (6), 2 states have call predecessors, (6), 3 states have call successors, (6) [2022-04-07 13:32:08,252 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 13:32:08,252 INFO L554 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2022-04-07 13:32:08,252 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-04-07 13:32:08,252 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2022-04-07 13:32:08,252 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=26, Invalid=46, Unknown=0, NotChecked=0, Total=72 [2022-04-07 13:32:08,253 INFO L87 Difference]: Start difference. First operand 47 states and 56 transitions. Second operand has 9 states, 9 states have (on average 3.6666666666666665) internal successors, (33), 9 states have internal predecessors, (33), 4 states have call successors, (8), 4 states have call predecessors, (8), 3 states have return successors, (6), 2 states have call predecessors, (6), 3 states have call successors, (6) [2022-04-07 13:32:08,492 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-07 13:32:08,492 INFO L93 Difference]: Finished difference Result 83 states and 100 transitions. [2022-04-07 13:32:08,492 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2022-04-07 13:32:08,492 INFO L78 Accepts]: Start accepts. Automaton has has 9 states, 9 states have (on average 3.6666666666666665) internal successors, (33), 9 states have internal predecessors, (33), 4 states have call successors, (8), 4 states have call predecessors, (8), 3 states have return successors, (6), 2 states have call predecessors, (6), 3 states have call successors, (6) Word has length 29 [2022-04-07 13:32:08,492 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-07 13:32:08,493 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 9 states, 9 states have (on average 3.6666666666666665) internal successors, (33), 9 states have internal predecessors, (33), 4 states have call successors, (8), 4 states have call predecessors, (8), 3 states have return successors, (6), 2 states have call predecessors, (6), 3 states have call successors, (6) [2022-04-07 13:32:08,494 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 11 states to 11 states and 100 transitions. [2022-04-07 13:32:08,494 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 9 states, 9 states have (on average 3.6666666666666665) internal successors, (33), 9 states have internal predecessors, (33), 4 states have call successors, (8), 4 states have call predecessors, (8), 3 states have return successors, (6), 2 states have call predecessors, (6), 3 states have call successors, (6) [2022-04-07 13:32:08,496 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 11 states to 11 states and 100 transitions. [2022-04-07 13:32:08,496 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 11 states and 100 transitions. [2022-04-07 13:32:08,581 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 13:32:08,585 INFO L225 Difference]: With dead ends: 83 [2022-04-07 13:32:08,585 INFO L226 Difference]: Without dead ends: 76 [2022-04-07 13:32:08,585 INFO L912 BasicCegarLoop]: 0 DeclaredPredicates, 60 GetRequests, 49 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 13:32:08,586 INFO L913 BasicCegarLoop]: 34 mSDtfsCounter, 60 mSDsluCounter, 130 mSDsCounter, 0 mSdLazyCounter, 37 mSolverCounterSat, 25 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 60 SdHoareTripleChecker+Valid, 164 SdHoareTripleChecker+Invalid, 62 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 25 IncrementalHoareTripleChecker+Valid, 37 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-04-07 13:32:08,586 INFO L914 BasicCegarLoop]: SdHoareTripleChecker [60 Valid, 164 Invalid, 62 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [25 Valid, 37 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-04-07 13:32:08,587 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 76 states. [2022-04-07 13:32:08,607 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 76 to 71. [2022-04-07 13:32:08,607 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-07 13:32:08,607 INFO L82 GeneralOperation]: Start isEquivalent. First operand 76 states. Second operand has 71 states, 53 states have (on average 1.320754716981132) internal successors, (70), 56 states have internal predecessors, (70), 11 states have call successors, (11), 7 states have call predecessors, (11), 6 states have return successors, (7), 7 states have call predecessors, (7), 7 states have call successors, (7) [2022-04-07 13:32:08,607 INFO L74 IsIncluded]: Start isIncluded. First operand 76 states. Second operand has 71 states, 53 states have (on average 1.320754716981132) internal successors, (70), 56 states have internal predecessors, (70), 11 states have call successors, (11), 7 states have call predecessors, (11), 6 states have return successors, (7), 7 states have call predecessors, (7), 7 states have call successors, (7) [2022-04-07 13:32:08,608 INFO L87 Difference]: Start difference. First operand 76 states. Second operand has 71 states, 53 states have (on average 1.320754716981132) internal successors, (70), 56 states have internal predecessors, (70), 11 states have call successors, (11), 7 states have call predecessors, (11), 6 states have return successors, (7), 7 states have call predecessors, (7), 7 states have call successors, (7) [2022-04-07 13:32:08,610 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-07 13:32:08,610 INFO L93 Difference]: Finished difference Result 76 states and 91 transitions. [2022-04-07 13:32:08,610 INFO L276 IsEmpty]: Start isEmpty. Operand 76 states and 91 transitions. [2022-04-07 13:32:08,610 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-07 13:32:08,610 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-07 13:32:08,610 INFO L74 IsIncluded]: Start isIncluded. First operand has 71 states, 53 states have (on average 1.320754716981132) internal successors, (70), 56 states have internal predecessors, (70), 11 states have call successors, (11), 7 states have call predecessors, (11), 6 states have return successors, (7), 7 states have call predecessors, (7), 7 states have call successors, (7) Second operand 76 states. [2022-04-07 13:32:08,611 INFO L87 Difference]: Start difference. First operand has 71 states, 53 states have (on average 1.320754716981132) internal successors, (70), 56 states have internal predecessors, (70), 11 states have call successors, (11), 7 states have call predecessors, (11), 6 states have return successors, (7), 7 states have call predecessors, (7), 7 states have call successors, (7) Second operand 76 states. [2022-04-07 13:32:08,613 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-07 13:32:08,613 INFO L93 Difference]: Finished difference Result 76 states and 91 transitions. [2022-04-07 13:32:08,613 INFO L276 IsEmpty]: Start isEmpty. Operand 76 states and 91 transitions. [2022-04-07 13:32:08,614 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-07 13:32:08,614 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-07 13:32:08,614 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-07 13:32:08,614 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-07 13:32:08,614 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 71 states, 53 states have (on average 1.320754716981132) internal successors, (70), 56 states have internal predecessors, (70), 11 states have call successors, (11), 7 states have call predecessors, (11), 6 states have return successors, (7), 7 states have call predecessors, (7), 7 states have call successors, (7) [2022-04-07 13:32:08,616 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 71 states to 71 states and 88 transitions. [2022-04-07 13:32:08,616 INFO L78 Accepts]: Start accepts. Automaton has 71 states and 88 transitions. Word has length 29 [2022-04-07 13:32:08,616 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-07 13:32:08,617 INFO L478 AbstractCegarLoop]: Abstraction has 71 states and 88 transitions. [2022-04-07 13:32:08,617 INFO L479 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 9 states have (on average 3.6666666666666665) internal successors, (33), 9 states have internal predecessors, (33), 4 states have call successors, (8), 4 states have call predecessors, (8), 3 states have return successors, (6), 2 states have call predecessors, (6), 3 states have call successors, (6) [2022-04-07 13:32:08,617 INFO L276 IsEmpty]: Start isEmpty. Operand 71 states and 88 transitions. [2022-04-07 13:32:08,617 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 30 [2022-04-07 13:32:08,617 INFO L491 BasicCegarLoop]: Found error trace [2022-04-07 13:32:08,617 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] [2022-04-07 13:32:08,650 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 13:32:08,823 WARN L460 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5,6 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-07 13:32:08,824 INFO L403 AbstractCegarLoop]: === Iteration 7 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-07 13:32:08,824 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-07 13:32:08,824 INFO L85 PathProgramCache]: Analyzing trace with hash -2029937874, now seen corresponding path program 1 times [2022-04-07 13:32:08,824 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-07 13:32:08,824 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [654656841] [2022-04-07 13:32:08,824 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-07 13:32:08,825 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-07 13:32:08,840 ERROR L245 FreeRefinementEngine]: Caught known exception: Unsupported non-linear arithmetic [2022-04-07 13:32:08,841 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [2130719547] [2022-04-07 13:32:08,841 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-07 13:32:08,841 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-07 13:32:08,841 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-04-07 13:32:08,842 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 13:32:08,843 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 13:32:08,889 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-07 13:32:08,890 INFO L263 TraceCheckSpWp]: Trace formula consists of 99 conjuncts, 15 conjunts are in the unsatisfiable core [2022-04-07 13:32:08,902 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-07 13:32:08,903 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-04-07 13:32:09,459 INFO L272 TraceCheckUtils]: 0: Hoare triple {2077#true} call ULTIMATE.init(); {2077#true} is VALID [2022-04-07 13:32:09,460 INFO L290 TraceCheckUtils]: 1: Hoare triple {2077#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(9, 2);~counter~0 := 0; {2077#true} is VALID [2022-04-07 13:32:09,460 INFO L290 TraceCheckUtils]: 2: Hoare triple {2077#true} assume true; {2077#true} is VALID [2022-04-07 13:32:09,460 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {2077#true} {2077#true} #89#return; {2077#true} is VALID [2022-04-07 13:32:09,460 INFO L272 TraceCheckUtils]: 4: Hoare triple {2077#true} call #t~ret5 := main(); {2077#true} is VALID [2022-04-07 13:32:09,460 INFO L290 TraceCheckUtils]: 5: Hoare triple {2077#true} havoc ~A~0;havoc ~B~0;havoc ~q~0;havoc ~r~0;havoc ~b~0;~A~0 := #t~nondet1;havoc #t~nondet1;~B~0 := #t~nondet2;havoc #t~nondet2; {2077#true} is VALID [2022-04-07 13:32:09,460 INFO L272 TraceCheckUtils]: 6: Hoare triple {2077#true} call assume_abort_if_not((if ~B~0 % 4294967296 < 2147483647 then 1 else 0)); {2077#true} is VALID [2022-04-07 13:32:09,460 INFO L290 TraceCheckUtils]: 7: Hoare triple {2077#true} ~cond := #in~cond; {2077#true} is VALID [2022-04-07 13:32:09,461 INFO L290 TraceCheckUtils]: 8: Hoare triple {2077#true} assume !(0 == ~cond); {2077#true} is VALID [2022-04-07 13:32:09,461 INFO L290 TraceCheckUtils]: 9: Hoare triple {2077#true} assume true; {2077#true} is VALID [2022-04-07 13:32:09,461 INFO L284 TraceCheckUtils]: 10: Hoare quadruple {2077#true} {2077#true} #81#return; {2077#true} is VALID [2022-04-07 13:32:09,461 INFO L272 TraceCheckUtils]: 11: Hoare triple {2077#true} call assume_abort_if_not((if ~B~0 % 4294967296 >= 1 then 1 else 0)); {2077#true} is VALID [2022-04-07 13:32:09,461 INFO L290 TraceCheckUtils]: 12: Hoare triple {2077#true} ~cond := #in~cond; {2118#(= assume_abort_if_not_~cond |assume_abort_if_not_#in~cond|)} is VALID [2022-04-07 13:32:09,462 INFO L290 TraceCheckUtils]: 13: Hoare triple {2118#(= assume_abort_if_not_~cond |assume_abort_if_not_#in~cond|)} assume !(0 == ~cond); {2122#(not (= |assume_abort_if_not_#in~cond| 0))} is VALID [2022-04-07 13:32:09,462 INFO L290 TraceCheckUtils]: 14: Hoare triple {2122#(not (= |assume_abort_if_not_#in~cond| 0))} assume true; {2122#(not (= |assume_abort_if_not_#in~cond| 0))} is VALID [2022-04-07 13:32:09,463 INFO L284 TraceCheckUtils]: 15: Hoare quadruple {2122#(not (= |assume_abort_if_not_#in~cond| 0))} {2077#true} #83#return; {2129#(<= 1 (mod main_~B~0 4294967296))} is VALID [2022-04-07 13:32:09,463 INFO L290 TraceCheckUtils]: 16: Hoare triple {2129#(<= 1 (mod main_~B~0 4294967296))} ~q~0 := 0;~r~0 := ~A~0;~b~0 := ~B~0; {2133#(and (= main_~A~0 main_~r~0) (<= 1 (mod main_~b~0 4294967296)) (= main_~q~0 0))} is VALID [2022-04-07 13:32:09,463 INFO L290 TraceCheckUtils]: 17: Hoare triple {2133#(and (= main_~A~0 main_~r~0) (<= 1 (mod main_~b~0 4294967296)) (= main_~q~0 0))} #t~post3 := ~counter~0;~counter~0 := 1 + #t~post3; {2133#(and (= main_~A~0 main_~r~0) (<= 1 (mod main_~b~0 4294967296)) (= main_~q~0 0))} is VALID [2022-04-07 13:32:09,464 INFO L290 TraceCheckUtils]: 18: Hoare triple {2133#(and (= main_~A~0 main_~r~0) (<= 1 (mod main_~b~0 4294967296)) (= main_~q~0 0))} assume !!(#t~post3 < 5);havoc #t~post3; {2133#(and (= main_~A~0 main_~r~0) (<= 1 (mod main_~b~0 4294967296)) (= main_~q~0 0))} is VALID [2022-04-07 13:32:09,465 INFO L290 TraceCheckUtils]: 19: Hoare triple {2133#(and (= main_~A~0 main_~r~0) (<= 1 (mod main_~b~0 4294967296)) (= main_~q~0 0))} assume !!(~r~0 % 4294967296 >= ~b~0 % 4294967296);~b~0 := 2 * ~b~0; {2143#(and (= main_~A~0 main_~r~0) (< (div (+ (- 1) (mod main_~r~0 4294967296)) (- 4294967296)) 1) (= main_~q~0 0))} is VALID [2022-04-07 13:32:09,465 INFO L290 TraceCheckUtils]: 20: Hoare triple {2143#(and (= main_~A~0 main_~r~0) (< (div (+ (- 1) (mod main_~r~0 4294967296)) (- 4294967296)) 1) (= main_~q~0 0))} #t~post3 := ~counter~0;~counter~0 := 1 + #t~post3; {2143#(and (= main_~A~0 main_~r~0) (< (div (+ (- 1) (mod main_~r~0 4294967296)) (- 4294967296)) 1) (= main_~q~0 0))} is VALID [2022-04-07 13:32:09,466 INFO L290 TraceCheckUtils]: 21: Hoare triple {2143#(and (= main_~A~0 main_~r~0) (< (div (+ (- 1) (mod main_~r~0 4294967296)) (- 4294967296)) 1) (= main_~q~0 0))} assume !!(#t~post3 < 5);havoc #t~post3; {2143#(and (= main_~A~0 main_~r~0) (< (div (+ (- 1) (mod main_~r~0 4294967296)) (- 4294967296)) 1) (= main_~q~0 0))} is VALID [2022-04-07 13:32:09,466 INFO L290 TraceCheckUtils]: 22: Hoare triple {2143#(and (= main_~A~0 main_~r~0) (< (div (+ (- 1) (mod main_~r~0 4294967296)) (- 4294967296)) 1) (= main_~q~0 0))} assume !(~r~0 % 4294967296 >= ~b~0 % 4294967296); {2143#(and (= main_~A~0 main_~r~0) (< (div (+ (- 1) (mod main_~r~0 4294967296)) (- 4294967296)) 1) (= main_~q~0 0))} is VALID [2022-04-07 13:32:09,467 INFO L290 TraceCheckUtils]: 23: Hoare triple {2143#(and (= main_~A~0 main_~r~0) (< (div (+ (- 1) (mod main_~r~0 4294967296)) (- 4294967296)) 1) (= main_~q~0 0))} #t~post4 := ~counter~0;~counter~0 := 1 + #t~post4; {2143#(and (= main_~A~0 main_~r~0) (< (div (+ (- 1) (mod main_~r~0 4294967296)) (- 4294967296)) 1) (= main_~q~0 0))} is VALID [2022-04-07 13:32:09,467 INFO L290 TraceCheckUtils]: 24: Hoare triple {2143#(and (= main_~A~0 main_~r~0) (< (div (+ (- 1) (mod main_~r~0 4294967296)) (- 4294967296)) 1) (= main_~q~0 0))} assume !!(#t~post4 < 5);havoc #t~post4; {2143#(and (= main_~A~0 main_~r~0) (< (div (+ (- 1) (mod main_~r~0 4294967296)) (- 4294967296)) 1) (= main_~q~0 0))} is VALID [2022-04-07 13:32:09,468 INFO L272 TraceCheckUtils]: 25: Hoare triple {2143#(and (= main_~A~0 main_~r~0) (< (div (+ (- 1) (mod main_~r~0 4294967296)) (- 4294967296)) 1) (= main_~q~0 0))} call __VERIFIER_assert((if ~A~0 % 4294967296 == (~q~0 * ~b~0 + ~r~0) % 4294967296 then 1 else 0)); {2162#(<= 1 |__VERIFIER_assert_#in~cond|)} is VALID [2022-04-07 13:32:09,468 INFO L290 TraceCheckUtils]: 26: Hoare triple {2162#(<= 1 |__VERIFIER_assert_#in~cond|)} ~cond := #in~cond; {2166#(<= 1 __VERIFIER_assert_~cond)} is VALID [2022-04-07 13:32:09,469 INFO L290 TraceCheckUtils]: 27: Hoare triple {2166#(<= 1 __VERIFIER_assert_~cond)} assume 0 == ~cond; {2078#false} is VALID [2022-04-07 13:32:09,469 INFO L290 TraceCheckUtils]: 28: Hoare triple {2078#false} assume !false; {2078#false} is VALID [2022-04-07 13:32:09,469 INFO L134 CoverageAnalysis]: Checked inductivity of 7 backedges. 3 proven. 3 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2022-04-07 13:32:09,469 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-04-07 13:32:10,029 INFO L290 TraceCheckUtils]: 28: Hoare triple {2078#false} assume !false; {2078#false} is VALID [2022-04-07 13:32:10,029 INFO L290 TraceCheckUtils]: 27: Hoare triple {2166#(<= 1 __VERIFIER_assert_~cond)} assume 0 == ~cond; {2078#false} is VALID [2022-04-07 13:32:10,029 INFO L290 TraceCheckUtils]: 26: Hoare triple {2162#(<= 1 |__VERIFIER_assert_#in~cond|)} ~cond := #in~cond; {2166#(<= 1 __VERIFIER_assert_~cond)} is VALID [2022-04-07 13:32:10,031 INFO L272 TraceCheckUtils]: 25: Hoare triple {2182#(forall ((main_~b~0 Int)) (= (mod main_~A~0 4294967296) (mod (+ main_~r~0 (* main_~b~0 main_~q~0)) 4294967296)))} call __VERIFIER_assert((if ~A~0 % 4294967296 == (~q~0 * ~b~0 + ~r~0) % 4294967296 then 1 else 0)); {2162#(<= 1 |__VERIFIER_assert_#in~cond|)} is VALID [2022-04-07 13:32:10,031 INFO L290 TraceCheckUtils]: 24: Hoare triple {2182#(forall ((main_~b~0 Int)) (= (mod main_~A~0 4294967296) (mod (+ main_~r~0 (* main_~b~0 main_~q~0)) 4294967296)))} assume !!(#t~post4 < 5);havoc #t~post4; {2182#(forall ((main_~b~0 Int)) (= (mod main_~A~0 4294967296) (mod (+ main_~r~0 (* main_~b~0 main_~q~0)) 4294967296)))} is VALID [2022-04-07 13:32:10,032 INFO L290 TraceCheckUtils]: 23: Hoare triple {2182#(forall ((main_~b~0 Int)) (= (mod main_~A~0 4294967296) (mod (+ main_~r~0 (* main_~b~0 main_~q~0)) 4294967296)))} #t~post4 := ~counter~0;~counter~0 := 1 + #t~post4; {2182#(forall ((main_~b~0 Int)) (= (mod main_~A~0 4294967296) (mod (+ main_~r~0 (* main_~b~0 main_~q~0)) 4294967296)))} is VALID [2022-04-07 13:32:10,032 INFO L290 TraceCheckUtils]: 22: Hoare triple {2182#(forall ((main_~b~0 Int)) (= (mod main_~A~0 4294967296) (mod (+ main_~r~0 (* main_~b~0 main_~q~0)) 4294967296)))} assume !(~r~0 % 4294967296 >= ~b~0 % 4294967296); {2182#(forall ((main_~b~0 Int)) (= (mod main_~A~0 4294967296) (mod (+ main_~r~0 (* main_~b~0 main_~q~0)) 4294967296)))} is VALID [2022-04-07 13:32:10,033 INFO L290 TraceCheckUtils]: 21: Hoare triple {2182#(forall ((main_~b~0 Int)) (= (mod main_~A~0 4294967296) (mod (+ main_~r~0 (* main_~b~0 main_~q~0)) 4294967296)))} assume !!(#t~post3 < 5);havoc #t~post3; {2182#(forall ((main_~b~0 Int)) (= (mod main_~A~0 4294967296) (mod (+ main_~r~0 (* main_~b~0 main_~q~0)) 4294967296)))} is VALID [2022-04-07 13:32:10,033 INFO L290 TraceCheckUtils]: 20: Hoare triple {2182#(forall ((main_~b~0 Int)) (= (mod main_~A~0 4294967296) (mod (+ main_~r~0 (* main_~b~0 main_~q~0)) 4294967296)))} #t~post3 := ~counter~0;~counter~0 := 1 + #t~post3; {2182#(forall ((main_~b~0 Int)) (= (mod main_~A~0 4294967296) (mod (+ main_~r~0 (* main_~b~0 main_~q~0)) 4294967296)))} is VALID [2022-04-07 13:32:10,033 INFO L290 TraceCheckUtils]: 19: Hoare triple {2201#(or (not (<= (mod main_~b~0 4294967296) (mod main_~r~0 4294967296))) (forall ((main_~b~0 Int)) (= (mod main_~A~0 4294967296) (mod (+ main_~r~0 (* main_~b~0 main_~q~0)) 4294967296))))} assume !!(~r~0 % 4294967296 >= ~b~0 % 4294967296);~b~0 := 2 * ~b~0; {2182#(forall ((main_~b~0 Int)) (= (mod main_~A~0 4294967296) (mod (+ main_~r~0 (* main_~b~0 main_~q~0)) 4294967296)))} is VALID [2022-04-07 13:32:10,034 INFO L290 TraceCheckUtils]: 18: Hoare triple {2201#(or (not (<= (mod main_~b~0 4294967296) (mod main_~r~0 4294967296))) (forall ((main_~b~0 Int)) (= (mod main_~A~0 4294967296) (mod (+ main_~r~0 (* main_~b~0 main_~q~0)) 4294967296))))} assume !!(#t~post3 < 5);havoc #t~post3; {2201#(or (not (<= (mod main_~b~0 4294967296) (mod main_~r~0 4294967296))) (forall ((main_~b~0 Int)) (= (mod main_~A~0 4294967296) (mod (+ main_~r~0 (* main_~b~0 main_~q~0)) 4294967296))))} is VALID [2022-04-07 13:32:10,034 INFO L290 TraceCheckUtils]: 17: Hoare triple {2201#(or (not (<= (mod main_~b~0 4294967296) (mod main_~r~0 4294967296))) (forall ((main_~b~0 Int)) (= (mod main_~A~0 4294967296) (mod (+ main_~r~0 (* main_~b~0 main_~q~0)) 4294967296))))} #t~post3 := ~counter~0;~counter~0 := 1 + #t~post3; {2201#(or (not (<= (mod main_~b~0 4294967296) (mod main_~r~0 4294967296))) (forall ((main_~b~0 Int)) (= (mod main_~A~0 4294967296) (mod (+ main_~r~0 (* main_~b~0 main_~q~0)) 4294967296))))} is VALID [2022-04-07 13:32:10,035 INFO L290 TraceCheckUtils]: 16: Hoare triple {2077#true} ~q~0 := 0;~r~0 := ~A~0;~b~0 := ~B~0; {2201#(or (not (<= (mod main_~b~0 4294967296) (mod main_~r~0 4294967296))) (forall ((main_~b~0 Int)) (= (mod main_~A~0 4294967296) (mod (+ main_~r~0 (* main_~b~0 main_~q~0)) 4294967296))))} is VALID [2022-04-07 13:32:10,035 INFO L284 TraceCheckUtils]: 15: Hoare quadruple {2077#true} {2077#true} #83#return; {2077#true} is VALID [2022-04-07 13:32:10,035 INFO L290 TraceCheckUtils]: 14: Hoare triple {2077#true} assume true; {2077#true} is VALID [2022-04-07 13:32:10,035 INFO L290 TraceCheckUtils]: 13: Hoare triple {2077#true} assume !(0 == ~cond); {2077#true} is VALID [2022-04-07 13:32:10,035 INFO L290 TraceCheckUtils]: 12: Hoare triple {2077#true} ~cond := #in~cond; {2077#true} is VALID [2022-04-07 13:32:10,035 INFO L272 TraceCheckUtils]: 11: Hoare triple {2077#true} call assume_abort_if_not((if ~B~0 % 4294967296 >= 1 then 1 else 0)); {2077#true} is VALID [2022-04-07 13:32:10,035 INFO L284 TraceCheckUtils]: 10: Hoare quadruple {2077#true} {2077#true} #81#return; {2077#true} is VALID [2022-04-07 13:32:10,035 INFO L290 TraceCheckUtils]: 9: Hoare triple {2077#true} assume true; {2077#true} is VALID [2022-04-07 13:32:10,035 INFO L290 TraceCheckUtils]: 8: Hoare triple {2077#true} assume !(0 == ~cond); {2077#true} is VALID [2022-04-07 13:32:10,035 INFO L290 TraceCheckUtils]: 7: Hoare triple {2077#true} ~cond := #in~cond; {2077#true} is VALID [2022-04-07 13:32:10,036 INFO L272 TraceCheckUtils]: 6: Hoare triple {2077#true} call assume_abort_if_not((if ~B~0 % 4294967296 < 2147483647 then 1 else 0)); {2077#true} is VALID [2022-04-07 13:32:10,036 INFO L290 TraceCheckUtils]: 5: Hoare triple {2077#true} havoc ~A~0;havoc ~B~0;havoc ~q~0;havoc ~r~0;havoc ~b~0;~A~0 := #t~nondet1;havoc #t~nondet1;~B~0 := #t~nondet2;havoc #t~nondet2; {2077#true} is VALID [2022-04-07 13:32:10,036 INFO L272 TraceCheckUtils]: 4: Hoare triple {2077#true} call #t~ret5 := main(); {2077#true} is VALID [2022-04-07 13:32:10,036 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {2077#true} {2077#true} #89#return; {2077#true} is VALID [2022-04-07 13:32:10,036 INFO L290 TraceCheckUtils]: 2: Hoare triple {2077#true} assume true; {2077#true} is VALID [2022-04-07 13:32:10,036 INFO L290 TraceCheckUtils]: 1: Hoare triple {2077#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(9, 2);~counter~0 := 0; {2077#true} is VALID [2022-04-07 13:32:10,036 INFO L272 TraceCheckUtils]: 0: Hoare triple {2077#true} call ULTIMATE.init(); {2077#true} is VALID [2022-04-07 13:32:10,036 INFO L134 CoverageAnalysis]: Checked inductivity of 7 backedges. 3 proven. 0 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2022-04-07 13:32:10,036 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-07 13:32:10,036 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [654656841] [2022-04-07 13:32:10,036 WARN L310 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2022-04-07 13:32:10,036 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [2130719547] [2022-04-07 13:32:10,037 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [2130719547] provided 1 perfect and 1 imperfect interpolant sequences [2022-04-07 13:32:10,037 INFO L184 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2022-04-07 13:32:10,037 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [9] total 11 [2022-04-07 13:32:10,037 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1137434586] [2022-04-07 13:32:10,037 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-07 13:32:10,037 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 3.0) internal successors, (18), 5 states have internal predecessors, (18), 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 29 [2022-04-07 13:32:10,037 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-07 13:32:10,037 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with has 6 states, 6 states have (on average 3.0) internal successors, (18), 5 states have internal predecessors, (18), 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 13:32:12,080 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 26 edges. 25 inductive. 0 not inductive. 1 times theorem prover too weak to decide inductivity. [2022-04-07 13:32:12,080 INFO L554 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2022-04-07 13:32:12,080 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-04-07 13:32:12,080 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2022-04-07 13:32:12,080 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=24, Invalid=86, Unknown=0, NotChecked=0, Total=110 [2022-04-07 13:32:12,081 INFO L87 Difference]: Start difference. First operand 71 states and 88 transitions. Second operand has 6 states, 6 states have (on average 3.0) internal successors, (18), 5 states have internal predecessors, (18), 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 13:32:12,258 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-07 13:32:12,258 INFO L93 Difference]: Finished difference Result 97 states and 117 transitions. [2022-04-07 13:32:12,258 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2022-04-07 13:32:12,258 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 3.0) internal successors, (18), 5 states have internal predecessors, (18), 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 29 [2022-04-07 13:32:12,259 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-07 13:32:12,259 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 6 states, 6 states have (on average 3.0) internal successors, (18), 5 states have internal predecessors, (18), 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 13:32:12,259 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 49 transitions. [2022-04-07 13:32:12,260 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 6 states, 6 states have (on average 3.0) internal successors, (18), 5 states have internal predecessors, (18), 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 13:32:12,260 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 49 transitions. [2022-04-07 13:32:12,260 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 6 states and 49 transitions. [2022-04-07 13:32:14,313 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 49 edges. 48 inductive. 0 not inductive. 1 times theorem prover too weak to decide inductivity. [2022-04-07 13:32:14,315 INFO L225 Difference]: With dead ends: 97 [2022-04-07 13:32:14,315 INFO L226 Difference]: Without dead ends: 95 [2022-04-07 13:32:14,315 INFO L912 BasicCegarLoop]: 0 DeclaredPredicates, 58 GetRequests, 47 SyntacticMatches, 1 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=28, Invalid=104, Unknown=0, NotChecked=0, Total=132 [2022-04-07 13:32:14,316 INFO L913 BasicCegarLoop]: 39 mSDtfsCounter, 11 mSDsluCounter, 90 mSDsCounter, 0 mSdLazyCounter, 8 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 11 SdHoareTripleChecker+Valid, 129 SdHoareTripleChecker+Invalid, 26 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 8 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 18 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-04-07 13:32:14,316 INFO L914 BasicCegarLoop]: SdHoareTripleChecker [11 Valid, 129 Invalid, 26 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 8 Invalid, 0 Unknown, 18 Unchecked, 0.0s Time] [2022-04-07 13:32:14,316 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 95 states. [2022-04-07 13:32:14,342 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 95 to 94. [2022-04-07 13:32:14,342 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-07 13:32:14,343 INFO L82 GeneralOperation]: Start isEquivalent. First operand 95 states. Second operand has 94 states, 70 states have (on average 1.2571428571428571) internal successors, (88), 76 states have internal predecessors, (88), 14 states have call successors, (14), 10 states have call predecessors, (14), 9 states have return successors, (10), 7 states have call predecessors, (10), 10 states have call successors, (10) [2022-04-07 13:32:14,343 INFO L74 IsIncluded]: Start isIncluded. First operand 95 states. Second operand has 94 states, 70 states have (on average 1.2571428571428571) internal successors, (88), 76 states have internal predecessors, (88), 14 states have call successors, (14), 10 states have call predecessors, (14), 9 states have return successors, (10), 7 states have call predecessors, (10), 10 states have call successors, (10) [2022-04-07 13:32:14,343 INFO L87 Difference]: Start difference. First operand 95 states. Second operand has 94 states, 70 states have (on average 1.2571428571428571) internal successors, (88), 76 states have internal predecessors, (88), 14 states have call successors, (14), 10 states have call predecessors, (14), 9 states have return successors, (10), 7 states have call predecessors, (10), 10 states have call successors, (10) [2022-04-07 13:32:14,345 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-07 13:32:14,345 INFO L93 Difference]: Finished difference Result 95 states and 113 transitions. [2022-04-07 13:32:14,345 INFO L276 IsEmpty]: Start isEmpty. Operand 95 states and 113 transitions. [2022-04-07 13:32:14,345 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-07 13:32:14,345 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-07 13:32:14,346 INFO L74 IsIncluded]: Start isIncluded. First operand has 94 states, 70 states have (on average 1.2571428571428571) internal successors, (88), 76 states have internal predecessors, (88), 14 states have call successors, (14), 10 states have call predecessors, (14), 9 states have return successors, (10), 7 states have call predecessors, (10), 10 states have call successors, (10) Second operand 95 states. [2022-04-07 13:32:14,346 INFO L87 Difference]: Start difference. First operand has 94 states, 70 states have (on average 1.2571428571428571) internal successors, (88), 76 states have internal predecessors, (88), 14 states have call successors, (14), 10 states have call predecessors, (14), 9 states have return successors, (10), 7 states have call predecessors, (10), 10 states have call successors, (10) Second operand 95 states. [2022-04-07 13:32:14,348 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-07 13:32:14,348 INFO L93 Difference]: Finished difference Result 95 states and 113 transitions. [2022-04-07 13:32:14,348 INFO L276 IsEmpty]: Start isEmpty. Operand 95 states and 113 transitions. [2022-04-07 13:32:14,348 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-07 13:32:14,348 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-07 13:32:14,348 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-07 13:32:14,348 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-07 13:32:14,348 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 94 states, 70 states have (on average 1.2571428571428571) internal successors, (88), 76 states have internal predecessors, (88), 14 states have call successors, (14), 10 states have call predecessors, (14), 9 states have return successors, (10), 7 states have call predecessors, (10), 10 states have call successors, (10) [2022-04-07 13:32:14,350 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 94 states to 94 states and 112 transitions. [2022-04-07 13:32:14,350 INFO L78 Accepts]: Start accepts. Automaton has 94 states and 112 transitions. Word has length 29 [2022-04-07 13:32:14,350 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-07 13:32:14,350 INFO L478 AbstractCegarLoop]: Abstraction has 94 states and 112 transitions. [2022-04-07 13:32:14,351 INFO L479 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 3.0) internal successors, (18), 5 states have internal predecessors, (18), 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 13:32:14,351 INFO L276 IsEmpty]: Start isEmpty. Operand 94 states and 112 transitions. [2022-04-07 13:32:14,351 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 36 [2022-04-07 13:32:14,351 INFO L491 BasicCegarLoop]: Found error trace [2022-04-07 13:32:14,351 INFO L499 BasicCegarLoop]: trace histogram [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] [2022-04-07 13:32:14,370 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 13:32:14,561 WARN L460 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6,7 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-07 13:32:14,561 INFO L403 AbstractCegarLoop]: === Iteration 8 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-07 13:32:14,561 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-07 13:32:14,561 INFO L85 PathProgramCache]: Analyzing trace with hash 223058363, now seen corresponding path program 1 times [2022-04-07 13:32:14,562 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-07 13:32:14,562 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1427221478] [2022-04-07 13:32:14,562 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-07 13:32:14,562 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-07 13:32:14,580 ERROR L245 FreeRefinementEngine]: Caught known exception: Unsupported non-linear arithmetic [2022-04-07 13:32:14,580 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [1047999891] [2022-04-07 13:32:14,580 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-07 13:32:14,580 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-07 13:32:14,580 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-04-07 13:32:14,581 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 13:32:14,582 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 13:32:14,615 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-07 13:32:14,616 INFO L263 TraceCheckSpWp]: Trace formula consists of 110 conjuncts, 11 conjunts are in the unsatisfiable core [2022-04-07 13:32:14,622 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-07 13:32:14,623 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-04-07 13:32:14,925 INFO L272 TraceCheckUtils]: 0: Hoare triple {2703#true} call ULTIMATE.init(); {2703#true} is VALID [2022-04-07 13:32:14,926 INFO L290 TraceCheckUtils]: 1: Hoare triple {2703#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(9, 2);~counter~0 := 0; {2703#true} is VALID [2022-04-07 13:32:14,926 INFO L290 TraceCheckUtils]: 2: Hoare triple {2703#true} assume true; {2703#true} is VALID [2022-04-07 13:32:14,926 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {2703#true} {2703#true} #89#return; {2703#true} is VALID [2022-04-07 13:32:14,926 INFO L272 TraceCheckUtils]: 4: Hoare triple {2703#true} call #t~ret5 := main(); {2703#true} is VALID [2022-04-07 13:32:14,926 INFO L290 TraceCheckUtils]: 5: Hoare triple {2703#true} havoc ~A~0;havoc ~B~0;havoc ~q~0;havoc ~r~0;havoc ~b~0;~A~0 := #t~nondet1;havoc #t~nondet1;~B~0 := #t~nondet2;havoc #t~nondet2; {2703#true} is VALID [2022-04-07 13:32:14,926 INFO L272 TraceCheckUtils]: 6: Hoare triple {2703#true} call assume_abort_if_not((if ~B~0 % 4294967296 < 2147483647 then 1 else 0)); {2703#true} is VALID [2022-04-07 13:32:14,926 INFO L290 TraceCheckUtils]: 7: Hoare triple {2703#true} ~cond := #in~cond; {2703#true} is VALID [2022-04-07 13:32:14,926 INFO L290 TraceCheckUtils]: 8: Hoare triple {2703#true} assume !(0 == ~cond); {2703#true} is VALID [2022-04-07 13:32:14,926 INFO L290 TraceCheckUtils]: 9: Hoare triple {2703#true} assume true; {2703#true} is VALID [2022-04-07 13:32:14,926 INFO L284 TraceCheckUtils]: 10: Hoare quadruple {2703#true} {2703#true} #81#return; {2703#true} is VALID [2022-04-07 13:32:14,926 INFO L272 TraceCheckUtils]: 11: Hoare triple {2703#true} call assume_abort_if_not((if ~B~0 % 4294967296 >= 1 then 1 else 0)); {2703#true} is VALID [2022-04-07 13:32:14,926 INFO L290 TraceCheckUtils]: 12: Hoare triple {2703#true} ~cond := #in~cond; {2703#true} is VALID [2022-04-07 13:32:14,926 INFO L290 TraceCheckUtils]: 13: Hoare triple {2703#true} assume !(0 == ~cond); {2703#true} is VALID [2022-04-07 13:32:14,927 INFO L290 TraceCheckUtils]: 14: Hoare triple {2703#true} assume true; {2703#true} is VALID [2022-04-07 13:32:14,927 INFO L284 TraceCheckUtils]: 15: Hoare quadruple {2703#true} {2703#true} #83#return; {2703#true} is VALID [2022-04-07 13:32:14,927 INFO L290 TraceCheckUtils]: 16: Hoare triple {2703#true} ~q~0 := 0;~r~0 := ~A~0;~b~0 := ~B~0; {2703#true} is VALID [2022-04-07 13:32:14,927 INFO L290 TraceCheckUtils]: 17: Hoare triple {2703#true} #t~post3 := ~counter~0;~counter~0 := 1 + #t~post3; {2703#true} is VALID [2022-04-07 13:32:14,927 INFO L290 TraceCheckUtils]: 18: Hoare triple {2703#true} assume !!(#t~post3 < 5);havoc #t~post3; {2703#true} is VALID [2022-04-07 13:32:14,927 INFO L290 TraceCheckUtils]: 19: Hoare triple {2703#true} assume !!(~r~0 % 4294967296 >= ~b~0 % 4294967296);~b~0 := 2 * ~b~0; {2703#true} is VALID [2022-04-07 13:32:14,927 INFO L290 TraceCheckUtils]: 20: Hoare triple {2703#true} #t~post3 := ~counter~0;~counter~0 := 1 + #t~post3; {2703#true} is VALID [2022-04-07 13:32:14,927 INFO L290 TraceCheckUtils]: 21: Hoare triple {2703#true} assume !!(#t~post3 < 5);havoc #t~post3; {2703#true} is VALID [2022-04-07 13:32:14,927 INFO L290 TraceCheckUtils]: 22: Hoare triple {2703#true} assume !(~r~0 % 4294967296 >= ~b~0 % 4294967296); {2703#true} is VALID [2022-04-07 13:32:14,927 INFO L290 TraceCheckUtils]: 23: Hoare triple {2703#true} #t~post4 := ~counter~0;~counter~0 := 1 + #t~post4; {2703#true} is VALID [2022-04-07 13:32:14,927 INFO L290 TraceCheckUtils]: 24: Hoare triple {2703#true} assume !!(#t~post4 < 5);havoc #t~post4; {2703#true} is VALID [2022-04-07 13:32:14,927 INFO L272 TraceCheckUtils]: 25: Hoare triple {2703#true} call __VERIFIER_assert((if ~A~0 % 4294967296 == (~q~0 * ~b~0 + ~r~0) % 4294967296 then 1 else 0)); {2703#true} is VALID [2022-04-07 13:32:14,931 INFO L290 TraceCheckUtils]: 26: Hoare triple {2703#true} ~cond := #in~cond; {2786#(= |__VERIFIER_assert_#in~cond| __VERIFIER_assert_~cond)} is VALID [2022-04-07 13:32:14,932 INFO L290 TraceCheckUtils]: 27: Hoare triple {2786#(= |__VERIFIER_assert_#in~cond| __VERIFIER_assert_~cond)} assume !(0 == ~cond); {2790#(not (= |__VERIFIER_assert_#in~cond| 0))} is VALID [2022-04-07 13:32:14,932 INFO L290 TraceCheckUtils]: 28: Hoare triple {2790#(not (= |__VERIFIER_assert_#in~cond| 0))} assume true; {2790#(not (= |__VERIFIER_assert_#in~cond| 0))} is VALID [2022-04-07 13:32:14,933 INFO L284 TraceCheckUtils]: 29: Hoare quadruple {2790#(not (= |__VERIFIER_assert_#in~cond| 0))} {2703#true} #85#return; {2797#(= (mod main_~A~0 4294967296) (mod (+ main_~r~0 (* main_~b~0 main_~q~0)) 4294967296))} is VALID [2022-04-07 13:32:14,933 INFO L290 TraceCheckUtils]: 30: Hoare triple {2797#(= (mod main_~A~0 4294967296) (mod (+ main_~r~0 (* main_~b~0 main_~q~0)) 4294967296))} assume !(~b~0 % 4294967296 != ~B~0 % 4294967296); {2797#(= (mod main_~A~0 4294967296) (mod (+ main_~r~0 (* main_~b~0 main_~q~0)) 4294967296))} is VALID [2022-04-07 13:32:14,933 INFO L272 TraceCheckUtils]: 31: Hoare triple {2797#(= (mod main_~A~0 4294967296) (mod (+ main_~r~0 (* main_~b~0 main_~q~0)) 4294967296))} call __VERIFIER_assert((if ~A~0 % 4294967296 == (~q~0 * ~b~0 + ~r~0) % 4294967296 then 1 else 0)); {2804#(= |__VERIFIER_assert_#in~cond| 1)} is VALID [2022-04-07 13:32:14,934 INFO L290 TraceCheckUtils]: 32: Hoare triple {2804#(= |__VERIFIER_assert_#in~cond| 1)} ~cond := #in~cond; {2808#(= __VERIFIER_assert_~cond 1)} is VALID [2022-04-07 13:32:14,934 INFO L290 TraceCheckUtils]: 33: Hoare triple {2808#(= __VERIFIER_assert_~cond 1)} assume 0 == ~cond; {2704#false} is VALID [2022-04-07 13:32:14,934 INFO L290 TraceCheckUtils]: 34: Hoare triple {2704#false} assume !false; {2704#false} is VALID [2022-04-07 13:32:14,934 INFO L134 CoverageAnalysis]: Checked inductivity of 9 backedges. 1 proven. 1 refuted. 0 times theorem prover too weak. 7 trivial. 0 not checked. [2022-04-07 13:32:14,934 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-04-07 13:32:16,247 INFO L290 TraceCheckUtils]: 34: Hoare triple {2704#false} assume !false; {2704#false} is VALID [2022-04-07 13:32:16,248 INFO L290 TraceCheckUtils]: 33: Hoare triple {2818#(not (= __VERIFIER_assert_~cond 0))} assume 0 == ~cond; {2704#false} is VALID [2022-04-07 13:32:16,248 INFO L290 TraceCheckUtils]: 32: Hoare triple {2790#(not (= |__VERIFIER_assert_#in~cond| 0))} ~cond := #in~cond; {2818#(not (= __VERIFIER_assert_~cond 0))} is VALID [2022-04-07 13:32:16,249 INFO L272 TraceCheckUtils]: 31: Hoare triple {2797#(= (mod main_~A~0 4294967296) (mod (+ main_~r~0 (* main_~b~0 main_~q~0)) 4294967296))} call __VERIFIER_assert((if ~A~0 % 4294967296 == (~q~0 * ~b~0 + ~r~0) % 4294967296 then 1 else 0)); {2790#(not (= |__VERIFIER_assert_#in~cond| 0))} is VALID [2022-04-07 13:32:16,249 INFO L290 TraceCheckUtils]: 30: Hoare triple {2797#(= (mod main_~A~0 4294967296) (mod (+ main_~r~0 (* main_~b~0 main_~q~0)) 4294967296))} assume !(~b~0 % 4294967296 != ~B~0 % 4294967296); {2797#(= (mod main_~A~0 4294967296) (mod (+ main_~r~0 (* main_~b~0 main_~q~0)) 4294967296))} is VALID [2022-04-07 13:32:16,250 INFO L284 TraceCheckUtils]: 29: Hoare quadruple {2790#(not (= |__VERIFIER_assert_#in~cond| 0))} {2703#true} #85#return; {2797#(= (mod main_~A~0 4294967296) (mod (+ main_~r~0 (* main_~b~0 main_~q~0)) 4294967296))} is VALID [2022-04-07 13:32:16,250 INFO L290 TraceCheckUtils]: 28: Hoare triple {2790#(not (= |__VERIFIER_assert_#in~cond| 0))} assume true; {2790#(not (= |__VERIFIER_assert_#in~cond| 0))} is VALID [2022-04-07 13:32:16,251 INFO L290 TraceCheckUtils]: 27: Hoare triple {2840#(or (not (= |__VERIFIER_assert_#in~cond| 0)) (= __VERIFIER_assert_~cond 0))} assume !(0 == ~cond); {2790#(not (= |__VERIFIER_assert_#in~cond| 0))} is VALID [2022-04-07 13:32:16,251 INFO L290 TraceCheckUtils]: 26: Hoare triple {2703#true} ~cond := #in~cond; {2840#(or (not (= |__VERIFIER_assert_#in~cond| 0)) (= __VERIFIER_assert_~cond 0))} is VALID [2022-04-07 13:32:16,251 INFO L272 TraceCheckUtils]: 25: Hoare triple {2703#true} call __VERIFIER_assert((if ~A~0 % 4294967296 == (~q~0 * ~b~0 + ~r~0) % 4294967296 then 1 else 0)); {2703#true} is VALID [2022-04-07 13:32:16,251 INFO L290 TraceCheckUtils]: 24: Hoare triple {2703#true} assume !!(#t~post4 < 5);havoc #t~post4; {2703#true} is VALID [2022-04-07 13:32:16,251 INFO L290 TraceCheckUtils]: 23: Hoare triple {2703#true} #t~post4 := ~counter~0;~counter~0 := 1 + #t~post4; {2703#true} is VALID [2022-04-07 13:32:16,251 INFO L290 TraceCheckUtils]: 22: Hoare triple {2703#true} assume !(~r~0 % 4294967296 >= ~b~0 % 4294967296); {2703#true} is VALID [2022-04-07 13:32:16,251 INFO L290 TraceCheckUtils]: 21: Hoare triple {2703#true} assume !!(#t~post3 < 5);havoc #t~post3; {2703#true} is VALID [2022-04-07 13:32:16,251 INFO L290 TraceCheckUtils]: 20: Hoare triple {2703#true} #t~post3 := ~counter~0;~counter~0 := 1 + #t~post3; {2703#true} is VALID [2022-04-07 13:32:16,251 INFO L290 TraceCheckUtils]: 19: Hoare triple {2703#true} assume !!(~r~0 % 4294967296 >= ~b~0 % 4294967296);~b~0 := 2 * ~b~0; {2703#true} is VALID [2022-04-07 13:32:16,252 INFO L290 TraceCheckUtils]: 18: Hoare triple {2703#true} assume !!(#t~post3 < 5);havoc #t~post3; {2703#true} is VALID [2022-04-07 13:32:16,252 INFO L290 TraceCheckUtils]: 17: Hoare triple {2703#true} #t~post3 := ~counter~0;~counter~0 := 1 + #t~post3; {2703#true} is VALID [2022-04-07 13:32:16,252 INFO L290 TraceCheckUtils]: 16: Hoare triple {2703#true} ~q~0 := 0;~r~0 := ~A~0;~b~0 := ~B~0; {2703#true} is VALID [2022-04-07 13:32:16,252 INFO L284 TraceCheckUtils]: 15: Hoare quadruple {2703#true} {2703#true} #83#return; {2703#true} is VALID [2022-04-07 13:32:16,252 INFO L290 TraceCheckUtils]: 14: Hoare triple {2703#true} assume true; {2703#true} is VALID [2022-04-07 13:32:16,252 INFO L290 TraceCheckUtils]: 13: Hoare triple {2703#true} assume !(0 == ~cond); {2703#true} is VALID [2022-04-07 13:32:16,252 INFO L290 TraceCheckUtils]: 12: Hoare triple {2703#true} ~cond := #in~cond; {2703#true} is VALID [2022-04-07 13:32:16,252 INFO L272 TraceCheckUtils]: 11: Hoare triple {2703#true} call assume_abort_if_not((if ~B~0 % 4294967296 >= 1 then 1 else 0)); {2703#true} is VALID [2022-04-07 13:32:16,252 INFO L284 TraceCheckUtils]: 10: Hoare quadruple {2703#true} {2703#true} #81#return; {2703#true} is VALID [2022-04-07 13:32:16,252 INFO L290 TraceCheckUtils]: 9: Hoare triple {2703#true} assume true; {2703#true} is VALID [2022-04-07 13:32:16,252 INFO L290 TraceCheckUtils]: 8: Hoare triple {2703#true} assume !(0 == ~cond); {2703#true} is VALID [2022-04-07 13:32:16,252 INFO L290 TraceCheckUtils]: 7: Hoare triple {2703#true} ~cond := #in~cond; {2703#true} is VALID [2022-04-07 13:32:16,252 INFO L272 TraceCheckUtils]: 6: Hoare triple {2703#true} call assume_abort_if_not((if ~B~0 % 4294967296 < 2147483647 then 1 else 0)); {2703#true} is VALID [2022-04-07 13:32:16,252 INFO L290 TraceCheckUtils]: 5: Hoare triple {2703#true} havoc ~A~0;havoc ~B~0;havoc ~q~0;havoc ~r~0;havoc ~b~0;~A~0 := #t~nondet1;havoc #t~nondet1;~B~0 := #t~nondet2;havoc #t~nondet2; {2703#true} is VALID [2022-04-07 13:32:16,252 INFO L272 TraceCheckUtils]: 4: Hoare triple {2703#true} call #t~ret5 := main(); {2703#true} is VALID [2022-04-07 13:32:16,252 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {2703#true} {2703#true} #89#return; {2703#true} is VALID [2022-04-07 13:32:16,253 INFO L290 TraceCheckUtils]: 2: Hoare triple {2703#true} assume true; {2703#true} is VALID [2022-04-07 13:32:16,253 INFO L290 TraceCheckUtils]: 1: Hoare triple {2703#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(9, 2);~counter~0 := 0; {2703#true} is VALID [2022-04-07 13:32:16,253 INFO L272 TraceCheckUtils]: 0: Hoare triple {2703#true} call ULTIMATE.init(); {2703#true} is VALID [2022-04-07 13:32:16,253 INFO L134 CoverageAnalysis]: Checked inductivity of 9 backedges. 1 proven. 1 refuted. 0 times theorem prover too weak. 7 trivial. 0 not checked. [2022-04-07 13:32:16,253 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-07 13:32:16,253 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1427221478] [2022-04-07 13:32:16,253 WARN L310 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2022-04-07 13:32:16,253 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1047999891] [2022-04-07 13:32:16,253 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1047999891] provided 0 perfect and 2 imperfect interpolant sequences [2022-04-07 13:32:16,253 INFO L184 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2022-04-07 13:32:16,253 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 6] total 9 [2022-04-07 13:32:16,253 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [529830716] [2022-04-07 13:32:16,253 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2022-04-07 13:32:16,254 INFO L78 Accepts]: Start accepts. Automaton has has 9 states, 9 states have (on average 2.6666666666666665) internal successors, (24), 8 states have internal predecessors, (24), 2 states have call successors, (7), 3 states have call predecessors, (7), 2 states have return successors, (4), 2 states have call predecessors, (4), 1 states have call successors, (4) Word has length 35 [2022-04-07 13:32:16,254 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-07 13:32:16,254 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with has 9 states, 9 states have (on average 2.6666666666666665) internal successors, (24), 8 states have internal predecessors, (24), 2 states have call successors, (7), 3 states have call predecessors, (7), 2 states have return successors, (4), 2 states have call predecessors, (4), 1 states have call successors, (4) [2022-04-07 13:32:16,279 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 13:32:16,280 INFO L554 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2022-04-07 13:32:16,280 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-04-07 13:32:16,280 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2022-04-07 13:32:16,280 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=20, Invalid=52, Unknown=0, NotChecked=0, Total=72 [2022-04-07 13:32:16,280 INFO L87 Difference]: Start difference. First operand 94 states and 112 transitions. Second operand has 9 states, 9 states have (on average 2.6666666666666665) internal successors, (24), 8 states have internal predecessors, (24), 2 states have call successors, (7), 3 states have call predecessors, (7), 2 states have return successors, (4), 2 states have call predecessors, (4), 1 states have call successors, (4) [2022-04-07 13:32:18,321 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-07 13:32:18,322 INFO L93 Difference]: Finished difference Result 109 states and 126 transitions. [2022-04-07 13:32:18,322 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2022-04-07 13:32:18,322 INFO L78 Accepts]: Start accepts. Automaton has has 9 states, 9 states have (on average 2.6666666666666665) internal successors, (24), 8 states have internal predecessors, (24), 2 states have call successors, (7), 3 states have call predecessors, (7), 2 states have return successors, (4), 2 states have call predecessors, (4), 1 states have call successors, (4) Word has length 35 [2022-04-07 13:32:18,322 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-07 13:32:18,322 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 9 states, 9 states have (on average 2.6666666666666665) internal successors, (24), 8 states have internal predecessors, (24), 2 states have call successors, (7), 3 states have call predecessors, (7), 2 states have return successors, (4), 2 states have call predecessors, (4), 1 states have call successors, (4) [2022-04-07 13:32:18,323 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 48 transitions. [2022-04-07 13:32:18,323 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 9 states, 9 states have (on average 2.6666666666666665) internal successors, (24), 8 states have internal predecessors, (24), 2 states have call successors, (7), 3 states have call predecessors, (7), 2 states have return successors, (4), 2 states have call predecessors, (4), 1 states have call successors, (4) [2022-04-07 13:32:18,324 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 48 transitions. [2022-04-07 13:32:18,324 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 7 states and 48 transitions. [2022-04-07 13:32:18,360 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 48 edges. 48 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-07 13:32:18,362 INFO L225 Difference]: With dead ends: 109 [2022-04-07 13:32:18,362 INFO L226 Difference]: Without dead ends: 92 [2022-04-07 13:32:18,362 INFO L912 BasicCegarLoop]: 0 DeclaredPredicates, 71 GetRequests, 62 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=35, Invalid=75, Unknown=0, NotChecked=0, Total=110 [2022-04-07 13:32:18,362 INFO L913 BasicCegarLoop]: 26 mSDtfsCounter, 24 mSDsluCounter, 113 mSDsCounter, 0 mSdLazyCounter, 62 mSolverCounterSat, 5 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 24 SdHoareTripleChecker+Valid, 139 SdHoareTripleChecker+Invalid, 67 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 5 IncrementalHoareTripleChecker+Valid, 62 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.3s IncrementalHoareTripleChecker+Time [2022-04-07 13:32:18,363 INFO L914 BasicCegarLoop]: SdHoareTripleChecker [24 Valid, 139 Invalid, 67 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [5 Valid, 62 Invalid, 0 Unknown, 0 Unchecked, 1.3s Time] [2022-04-07 13:32:18,363 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 92 states. [2022-04-07 13:32:18,383 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 92 to 92. [2022-04-07 13:32:18,384 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-07 13:32:18,384 INFO L82 GeneralOperation]: Start isEquivalent. First operand 92 states. Second operand has 92 states, 70 states have (on average 1.2142857142857142) internal successors, (85), 74 states have internal predecessors, (85), 12 states have call successors, (12), 10 states have call predecessors, (12), 9 states have return successors, (10), 7 states have call predecessors, (10), 10 states have call successors, (10) [2022-04-07 13:32:18,384 INFO L74 IsIncluded]: Start isIncluded. First operand 92 states. Second operand has 92 states, 70 states have (on average 1.2142857142857142) internal successors, (85), 74 states have internal predecessors, (85), 12 states have call successors, (12), 10 states have call predecessors, (12), 9 states have return successors, (10), 7 states have call predecessors, (10), 10 states have call successors, (10) [2022-04-07 13:32:18,384 INFO L87 Difference]: Start difference. First operand 92 states. Second operand has 92 states, 70 states have (on average 1.2142857142857142) internal successors, (85), 74 states have internal predecessors, (85), 12 states have call successors, (12), 10 states have call predecessors, (12), 9 states have return successors, (10), 7 states have call predecessors, (10), 10 states have call successors, (10) [2022-04-07 13:32:18,386 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-07 13:32:18,387 INFO L93 Difference]: Finished difference Result 92 states and 107 transitions. [2022-04-07 13:32:18,387 INFO L276 IsEmpty]: Start isEmpty. Operand 92 states and 107 transitions. [2022-04-07 13:32:18,387 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-07 13:32:18,387 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-07 13:32:18,387 INFO L74 IsIncluded]: Start isIncluded. First operand has 92 states, 70 states have (on average 1.2142857142857142) internal successors, (85), 74 states have internal predecessors, (85), 12 states have call successors, (12), 10 states have call predecessors, (12), 9 states have return successors, (10), 7 states have call predecessors, (10), 10 states have call successors, (10) Second operand 92 states. [2022-04-07 13:32:18,387 INFO L87 Difference]: Start difference. First operand has 92 states, 70 states have (on average 1.2142857142857142) internal successors, (85), 74 states have internal predecessors, (85), 12 states have call successors, (12), 10 states have call predecessors, (12), 9 states have return successors, (10), 7 states have call predecessors, (10), 10 states have call successors, (10) Second operand 92 states. [2022-04-07 13:32:18,389 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-07 13:32:18,389 INFO L93 Difference]: Finished difference Result 92 states and 107 transitions. [2022-04-07 13:32:18,389 INFO L276 IsEmpty]: Start isEmpty. Operand 92 states and 107 transitions. [2022-04-07 13:32:18,389 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-07 13:32:18,389 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-07 13:32:18,389 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-07 13:32:18,389 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-07 13:32:18,390 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 92 states, 70 states have (on average 1.2142857142857142) internal successors, (85), 74 states have internal predecessors, (85), 12 states have call successors, (12), 10 states have call predecessors, (12), 9 states have return successors, (10), 7 states have call predecessors, (10), 10 states have call successors, (10) [2022-04-07 13:32:18,391 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 92 states to 92 states and 107 transitions. [2022-04-07 13:32:18,391 INFO L78 Accepts]: Start accepts. Automaton has 92 states and 107 transitions. Word has length 35 [2022-04-07 13:32:18,392 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-07 13:32:18,392 INFO L478 AbstractCegarLoop]: Abstraction has 92 states and 107 transitions. [2022-04-07 13:32:18,392 INFO L479 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 9 states have (on average 2.6666666666666665) internal successors, (24), 8 states have internal predecessors, (24), 2 states have call successors, (7), 3 states have call predecessors, (7), 2 states have return successors, (4), 2 states have call predecessors, (4), 1 states have call successors, (4) [2022-04-07 13:32:18,392 INFO L276 IsEmpty]: Start isEmpty. Operand 92 states and 107 transitions. [2022-04-07 13:32:18,392 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 36 [2022-04-07 13:32:18,392 INFO L491 BasicCegarLoop]: Found error trace [2022-04-07 13:32:18,392 INFO L499 BasicCegarLoop]: trace histogram [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] [2022-04-07 13:32:18,417 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 13:32:18,607 WARN L460 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7,8 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-07 13:32:18,608 INFO L403 AbstractCegarLoop]: === Iteration 9 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-07 13:32:18,608 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-07 13:32:18,608 INFO L85 PathProgramCache]: Analyzing trace with hash -1731935178, now seen corresponding path program 1 times [2022-04-07 13:32:18,608 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-07 13:32:18,608 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1440780748] [2022-04-07 13:32:18,608 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-07 13:32:18,608 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-07 13:32:18,618 ERROR L245 FreeRefinementEngine]: Caught known exception: Unsupported non-linear arithmetic [2022-04-07 13:32:18,618 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [2076609426] [2022-04-07 13:32:18,619 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-07 13:32:18,619 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-07 13:32:18,619 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-04-07 13:32:18,619 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 13:32:18,620 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 13:32:18,653 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-07 13:32:18,654 INFO L263 TraceCheckSpWp]: Trace formula consists of 115 conjuncts, 3 conjunts are in the unsatisfiable core [2022-04-07 13:32:18,660 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-07 13:32:18,660 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-04-07 13:32:18,741 INFO L272 TraceCheckUtils]: 0: Hoare triple {3370#true} call ULTIMATE.init(); {3370#true} is VALID [2022-04-07 13:32:18,741 INFO L290 TraceCheckUtils]: 1: Hoare triple {3370#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(9, 2);~counter~0 := 0; {3370#true} is VALID [2022-04-07 13:32:18,741 INFO L290 TraceCheckUtils]: 2: Hoare triple {3370#true} assume true; {3370#true} is VALID [2022-04-07 13:32:18,741 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {3370#true} {3370#true} #89#return; {3370#true} is VALID [2022-04-07 13:32:18,741 INFO L272 TraceCheckUtils]: 4: Hoare triple {3370#true} call #t~ret5 := main(); {3370#true} is VALID [2022-04-07 13:32:18,741 INFO L290 TraceCheckUtils]: 5: Hoare triple {3370#true} havoc ~A~0;havoc ~B~0;havoc ~q~0;havoc ~r~0;havoc ~b~0;~A~0 := #t~nondet1;havoc #t~nondet1;~B~0 := #t~nondet2;havoc #t~nondet2; {3370#true} is VALID [2022-04-07 13:32:18,741 INFO L272 TraceCheckUtils]: 6: Hoare triple {3370#true} call assume_abort_if_not((if ~B~0 % 4294967296 < 2147483647 then 1 else 0)); {3370#true} is VALID [2022-04-07 13:32:18,742 INFO L290 TraceCheckUtils]: 7: Hoare triple {3370#true} ~cond := #in~cond; {3370#true} is VALID [2022-04-07 13:32:18,742 INFO L290 TraceCheckUtils]: 8: Hoare triple {3370#true} assume !(0 == ~cond); {3370#true} is VALID [2022-04-07 13:32:18,742 INFO L290 TraceCheckUtils]: 9: Hoare triple {3370#true} assume true; {3370#true} is VALID [2022-04-07 13:32:18,742 INFO L284 TraceCheckUtils]: 10: Hoare quadruple {3370#true} {3370#true} #81#return; {3370#true} is VALID [2022-04-07 13:32:18,742 INFO L272 TraceCheckUtils]: 11: Hoare triple {3370#true} call assume_abort_if_not((if ~B~0 % 4294967296 >= 1 then 1 else 0)); {3370#true} is VALID [2022-04-07 13:32:18,742 INFO L290 TraceCheckUtils]: 12: Hoare triple {3370#true} ~cond := #in~cond; {3370#true} is VALID [2022-04-07 13:32:18,742 INFO L290 TraceCheckUtils]: 13: Hoare triple {3370#true} assume !(0 == ~cond); {3370#true} is VALID [2022-04-07 13:32:18,742 INFO L290 TraceCheckUtils]: 14: Hoare triple {3370#true} assume true; {3370#true} is VALID [2022-04-07 13:32:18,742 INFO L284 TraceCheckUtils]: 15: Hoare quadruple {3370#true} {3370#true} #83#return; {3370#true} is VALID [2022-04-07 13:32:18,743 INFO L290 TraceCheckUtils]: 16: Hoare triple {3370#true} ~q~0 := 0;~r~0 := ~A~0;~b~0 := ~B~0; {3423#(= main_~B~0 main_~b~0)} is VALID [2022-04-07 13:32:18,743 INFO L290 TraceCheckUtils]: 17: Hoare triple {3423#(= main_~B~0 main_~b~0)} #t~post3 := ~counter~0;~counter~0 := 1 + #t~post3; {3423#(= main_~B~0 main_~b~0)} is VALID [2022-04-07 13:32:18,743 INFO L290 TraceCheckUtils]: 18: Hoare triple {3423#(= main_~B~0 main_~b~0)} assume !!(#t~post3 < 5);havoc #t~post3; {3423#(= main_~B~0 main_~b~0)} is VALID [2022-04-07 13:32:18,744 INFO L290 TraceCheckUtils]: 19: Hoare triple {3423#(= main_~B~0 main_~b~0)} assume !(~r~0 % 4294967296 >= ~b~0 % 4294967296); {3423#(= main_~B~0 main_~b~0)} is VALID [2022-04-07 13:32:18,744 INFO L290 TraceCheckUtils]: 20: Hoare triple {3423#(= main_~B~0 main_~b~0)} #t~post4 := ~counter~0;~counter~0 := 1 + #t~post4; {3423#(= main_~B~0 main_~b~0)} is VALID [2022-04-07 13:32:18,745 INFO L290 TraceCheckUtils]: 21: Hoare triple {3423#(= main_~B~0 main_~b~0)} assume !!(#t~post4 < 5);havoc #t~post4; {3423#(= main_~B~0 main_~b~0)} is VALID [2022-04-07 13:32:18,745 INFO L272 TraceCheckUtils]: 22: Hoare triple {3423#(= main_~B~0 main_~b~0)} call __VERIFIER_assert((if ~A~0 % 4294967296 == (~q~0 * ~b~0 + ~r~0) % 4294967296 then 1 else 0)); {3370#true} is VALID [2022-04-07 13:32:18,745 INFO L290 TraceCheckUtils]: 23: Hoare triple {3370#true} ~cond := #in~cond; {3370#true} is VALID [2022-04-07 13:32:18,745 INFO L290 TraceCheckUtils]: 24: Hoare triple {3370#true} assume !(0 == ~cond); {3370#true} is VALID [2022-04-07 13:32:18,745 INFO L290 TraceCheckUtils]: 25: Hoare triple {3370#true} assume true; {3370#true} is VALID [2022-04-07 13:32:18,746 INFO L284 TraceCheckUtils]: 26: Hoare quadruple {3370#true} {3423#(= main_~B~0 main_~b~0)} #85#return; {3423#(= main_~B~0 main_~b~0)} is VALID [2022-04-07 13:32:18,746 INFO L290 TraceCheckUtils]: 27: Hoare triple {3423#(= main_~B~0 main_~b~0)} assume !!(~b~0 % 4294967296 != ~B~0 % 4294967296);~q~0 := 2 * ~q~0;~b~0 := (if ~b~0 % 4294967296 < 0 && 0 != ~b~0 % 4294967296 % 2 then 1 + ~b~0 % 4294967296 / 2 else ~b~0 % 4294967296 / 2); {3371#false} is VALID [2022-04-07 13:32:18,746 INFO L290 TraceCheckUtils]: 28: Hoare triple {3371#false} assume ~r~0 % 4294967296 >= ~b~0 % 4294967296;~q~0 := 1 + ~q~0;~r~0 := ~r~0 - ~b~0; {3371#false} is VALID [2022-04-07 13:32:18,746 INFO L290 TraceCheckUtils]: 29: Hoare triple {3371#false} #t~post4 := ~counter~0;~counter~0 := 1 + #t~post4; {3371#false} is VALID [2022-04-07 13:32:18,746 INFO L290 TraceCheckUtils]: 30: Hoare triple {3371#false} assume !!(#t~post4 < 5);havoc #t~post4; {3371#false} is VALID [2022-04-07 13:32:18,746 INFO L272 TraceCheckUtils]: 31: Hoare triple {3371#false} call __VERIFIER_assert((if ~A~0 % 4294967296 == (~q~0 * ~b~0 + ~r~0) % 4294967296 then 1 else 0)); {3371#false} is VALID [2022-04-07 13:32:18,746 INFO L290 TraceCheckUtils]: 32: Hoare triple {3371#false} ~cond := #in~cond; {3371#false} is VALID [2022-04-07 13:32:18,747 INFO L290 TraceCheckUtils]: 33: Hoare triple {3371#false} assume 0 == ~cond; {3371#false} is VALID [2022-04-07 13:32:18,747 INFO L290 TraceCheckUtils]: 34: Hoare triple {3371#false} assume !false; {3371#false} is VALID [2022-04-07 13:32:18,747 INFO L134 CoverageAnalysis]: Checked inductivity of 9 backedges. 5 proven. 0 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2022-04-07 13:32:18,747 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-04-07 13:32:18,747 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-07 13:32:18,747 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1440780748] [2022-04-07 13:32:18,747 WARN L310 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2022-04-07 13:32:18,747 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [2076609426] [2022-04-07 13:32:18,747 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [2076609426] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-07 13:32:18,747 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-07 13:32:18,747 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-04-07 13:32:18,747 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1855316971] [2022-04-07 13:32:18,747 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-07 13:32:18,748 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 7.333333333333333) internal successors, (22), 3 states have internal predecessors, (22), 3 states have call successors, (6), 2 states have call predecessors, (6), 1 states have return successors, (4), 2 states have call predecessors, (4), 2 states have call successors, (4) Word has length 35 [2022-04-07 13:32:18,749 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-07 13:32:18,749 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with has 3 states, 3 states have (on average 7.333333333333333) internal successors, (22), 3 states have internal predecessors, (22), 3 states have call successors, (6), 2 states have call predecessors, (6), 1 states have return successors, (4), 2 states have call predecessors, (4), 2 states have call successors, (4) [2022-04-07 13:32:18,775 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 13:32:18,775 INFO L554 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-04-07 13:32:18,775 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-04-07 13:32:18,775 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-04-07 13:32:18,775 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-04-07 13:32:18,775 INFO L87 Difference]: Start difference. First operand 92 states and 107 transitions. Second operand has 3 states, 3 states have (on average 7.333333333333333) internal successors, (22), 3 states have internal predecessors, (22), 3 states have call successors, (6), 2 states have call predecessors, (6), 1 states have return successors, (4), 2 states have call predecessors, (4), 2 states have call successors, (4) [2022-04-07 13:32:18,846 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-07 13:32:18,846 INFO L93 Difference]: Finished difference Result 117 states and 137 transitions. [2022-04-07 13:32:18,846 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-04-07 13:32:18,846 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 7.333333333333333) internal successors, (22), 3 states have internal predecessors, (22), 3 states have call successors, (6), 2 states have call predecessors, (6), 1 states have return successors, (4), 2 states have call predecessors, (4), 2 states have call successors, (4) Word has length 35 [2022-04-07 13:32:18,847 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-07 13:32:18,847 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3 states, 3 states have (on average 7.333333333333333) internal successors, (22), 3 states have internal predecessors, (22), 3 states have call successors, (6), 2 states have call predecessors, (6), 1 states have return successors, (4), 2 states have call predecessors, (4), 2 states have call successors, (4) [2022-04-07 13:32:18,848 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 56 transitions. [2022-04-07 13:32:18,848 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3 states, 3 states have (on average 7.333333333333333) internal successors, (22), 3 states have internal predecessors, (22), 3 states have call successors, (6), 2 states have call predecessors, (6), 1 states have return successors, (4), 2 states have call predecessors, (4), 2 states have call successors, (4) [2022-04-07 13:32:18,853 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 56 transitions. [2022-04-07 13:32:18,853 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 3 states and 56 transitions. [2022-04-07 13:32:18,893 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 56 edges. 56 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-07 13:32:18,894 INFO L225 Difference]: With dead ends: 117 [2022-04-07 13:32:18,894 INFO L226 Difference]: Without dead ends: 76 [2022-04-07 13:32:18,894 INFO L912 BasicCegarLoop]: 0 DeclaredPredicates, 34 GetRequests, 33 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-04-07 13:32:18,895 INFO L913 BasicCegarLoop]: 32 mSDtfsCounter, 0 mSDsluCounter, 22 mSDsCounter, 0 mSdLazyCounter, 12 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 54 SdHoareTripleChecker+Invalid, 12 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 12 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-04-07 13:32:18,895 INFO L914 BasicCegarLoop]: SdHoareTripleChecker [0 Valid, 54 Invalid, 12 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 12 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-04-07 13:32:18,895 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 76 states. [2022-04-07 13:32:18,912 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 76 to 76. [2022-04-07 13:32:18,912 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-07 13:32:18,913 INFO L82 GeneralOperation]: Start isEquivalent. First operand 76 states. Second operand has 76 states, 58 states have (on average 1.206896551724138) internal successors, (70), 61 states have internal predecessors, (70), 10 states have call successors, (10), 8 states have call predecessors, (10), 7 states have return successors, (8), 6 states have call predecessors, (8), 8 states have call successors, (8) [2022-04-07 13:32:18,913 INFO L74 IsIncluded]: Start isIncluded. First operand 76 states. Second operand has 76 states, 58 states have (on average 1.206896551724138) internal successors, (70), 61 states have internal predecessors, (70), 10 states have call successors, (10), 8 states have call predecessors, (10), 7 states have return successors, (8), 6 states have call predecessors, (8), 8 states have call successors, (8) [2022-04-07 13:32:18,913 INFO L87 Difference]: Start difference. First operand 76 states. Second operand has 76 states, 58 states have (on average 1.206896551724138) internal successors, (70), 61 states have internal predecessors, (70), 10 states have call successors, (10), 8 states have call predecessors, (10), 7 states have return successors, (8), 6 states have call predecessors, (8), 8 states have call successors, (8) [2022-04-07 13:32:18,915 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-07 13:32:18,915 INFO L93 Difference]: Finished difference Result 76 states and 88 transitions. [2022-04-07 13:32:18,915 INFO L276 IsEmpty]: Start isEmpty. Operand 76 states and 88 transitions. [2022-04-07 13:32:18,915 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-07 13:32:18,915 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-07 13:32:18,916 INFO L74 IsIncluded]: Start isIncluded. First operand has 76 states, 58 states have (on average 1.206896551724138) internal successors, (70), 61 states have internal predecessors, (70), 10 states have call successors, (10), 8 states have call predecessors, (10), 7 states have return successors, (8), 6 states have call predecessors, (8), 8 states have call successors, (8) Second operand 76 states. [2022-04-07 13:32:18,916 INFO L87 Difference]: Start difference. First operand has 76 states, 58 states have (on average 1.206896551724138) internal successors, (70), 61 states have internal predecessors, (70), 10 states have call successors, (10), 8 states have call predecessors, (10), 7 states have return successors, (8), 6 states have call predecessors, (8), 8 states have call successors, (8) Second operand 76 states. [2022-04-07 13:32:18,917 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-07 13:32:18,917 INFO L93 Difference]: Finished difference Result 76 states and 88 transitions. [2022-04-07 13:32:18,917 INFO L276 IsEmpty]: Start isEmpty. Operand 76 states and 88 transitions. [2022-04-07 13:32:18,917 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-07 13:32:18,917 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-07 13:32:18,917 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-07 13:32:18,917 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-07 13:32:18,918 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 76 states, 58 states have (on average 1.206896551724138) internal successors, (70), 61 states have internal predecessors, (70), 10 states have call successors, (10), 8 states have call predecessors, (10), 7 states have return successors, (8), 6 states have call predecessors, (8), 8 states have call successors, (8) [2022-04-07 13:32:18,919 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 76 states to 76 states and 88 transitions. [2022-04-07 13:32:18,919 INFO L78 Accepts]: Start accepts. Automaton has 76 states and 88 transitions. Word has length 35 [2022-04-07 13:32:18,919 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-07 13:32:18,919 INFO L478 AbstractCegarLoop]: Abstraction has 76 states and 88 transitions. [2022-04-07 13:32:18,919 INFO L479 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 7.333333333333333) internal successors, (22), 3 states have internal predecessors, (22), 3 states have call successors, (6), 2 states have call predecessors, (6), 1 states have return successors, (4), 2 states have call predecessors, (4), 2 states have call successors, (4) [2022-04-07 13:32:18,919 INFO L276 IsEmpty]: Start isEmpty. Operand 76 states and 88 transitions. [2022-04-07 13:32:18,919 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 38 [2022-04-07 13:32:18,919 INFO L491 BasicCegarLoop]: Found error trace [2022-04-07 13:32:18,920 INFO L499 BasicCegarLoop]: trace histogram [5, 4, 4, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-07 13:32:18,937 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 13:32:19,131 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,SelfDestructingSolverStorable8 [2022-04-07 13:32:19,131 INFO L403 AbstractCegarLoop]: === Iteration 10 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-07 13:32:19,132 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-07 13:32:19,132 INFO L85 PathProgramCache]: Analyzing trace with hash -585153905, now seen corresponding path program 2 times [2022-04-07 13:32:19,132 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-07 13:32:19,132 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [686990667] [2022-04-07 13:32:19,132 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-07 13:32:19,132 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-07 13:32:19,145 ERROR L245 FreeRefinementEngine]: Caught known exception: Unsupported non-linear arithmetic [2022-04-07 13:32:19,145 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [663860606] [2022-04-07 13:32:19,145 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2022-04-07 13:32:19,146 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-07 13:32:19,146 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-04-07 13:32:19,146 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 13:32:19,147 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 13:32:19,191 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s) [2022-04-07 13:32:19,191 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-04-07 13:32:19,192 INFO L263 TraceCheckSpWp]: Trace formula consists of 81 conjuncts, 7 conjunts are in the unsatisfiable core [2022-04-07 13:32:19,201 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-07 13:32:19,204 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-04-07 13:32:19,351 INFO L272 TraceCheckUtils]: 0: Hoare triple {3877#true} call ULTIMATE.init(); {3877#true} is VALID [2022-04-07 13:32:19,351 INFO L290 TraceCheckUtils]: 1: Hoare triple {3877#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(9, 2);~counter~0 := 0; {3877#true} is VALID [2022-04-07 13:32:19,351 INFO L290 TraceCheckUtils]: 2: Hoare triple {3877#true} assume true; {3877#true} is VALID [2022-04-07 13:32:19,351 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {3877#true} {3877#true} #89#return; {3877#true} is VALID [2022-04-07 13:32:19,351 INFO L272 TraceCheckUtils]: 4: Hoare triple {3877#true} call #t~ret5 := main(); {3877#true} is VALID [2022-04-07 13:32:19,351 INFO L290 TraceCheckUtils]: 5: Hoare triple {3877#true} havoc ~A~0;havoc ~B~0;havoc ~q~0;havoc ~r~0;havoc ~b~0;~A~0 := #t~nondet1;havoc #t~nondet1;~B~0 := #t~nondet2;havoc #t~nondet2; {3877#true} is VALID [2022-04-07 13:32:19,351 INFO L272 TraceCheckUtils]: 6: Hoare triple {3877#true} call assume_abort_if_not((if ~B~0 % 4294967296 < 2147483647 then 1 else 0)); {3877#true} is VALID [2022-04-07 13:32:19,351 INFO L290 TraceCheckUtils]: 7: Hoare triple {3877#true} ~cond := #in~cond; {3877#true} is VALID [2022-04-07 13:32:19,352 INFO L290 TraceCheckUtils]: 8: Hoare triple {3877#true} assume !(0 == ~cond); {3877#true} is VALID [2022-04-07 13:32:19,352 INFO L290 TraceCheckUtils]: 9: Hoare triple {3877#true} assume true; {3877#true} is VALID [2022-04-07 13:32:19,352 INFO L284 TraceCheckUtils]: 10: Hoare quadruple {3877#true} {3877#true} #81#return; {3877#true} is VALID [2022-04-07 13:32:19,352 INFO L272 TraceCheckUtils]: 11: Hoare triple {3877#true} call assume_abort_if_not((if ~B~0 % 4294967296 >= 1 then 1 else 0)); {3877#true} is VALID [2022-04-07 13:32:19,352 INFO L290 TraceCheckUtils]: 12: Hoare triple {3877#true} ~cond := #in~cond; {3877#true} is VALID [2022-04-07 13:32:19,352 INFO L290 TraceCheckUtils]: 13: Hoare triple {3877#true} assume !(0 == ~cond); {3877#true} is VALID [2022-04-07 13:32:19,352 INFO L290 TraceCheckUtils]: 14: Hoare triple {3877#true} assume true; {3877#true} is VALID [2022-04-07 13:32:19,352 INFO L284 TraceCheckUtils]: 15: Hoare quadruple {3877#true} {3877#true} #83#return; {3877#true} is VALID [2022-04-07 13:32:19,367 INFO L290 TraceCheckUtils]: 16: Hoare triple {3877#true} ~q~0 := 0;~r~0 := ~A~0;~b~0 := ~B~0; {3930#(and (= main_~A~0 main_~r~0) (= main_~q~0 0))} is VALID [2022-04-07 13:32:19,368 INFO L290 TraceCheckUtils]: 17: Hoare triple {3930#(and (= main_~A~0 main_~r~0) (= main_~q~0 0))} #t~post3 := ~counter~0;~counter~0 := 1 + #t~post3; {3930#(and (= main_~A~0 main_~r~0) (= main_~q~0 0))} is VALID [2022-04-07 13:32:19,368 INFO L290 TraceCheckUtils]: 18: Hoare triple {3930#(and (= main_~A~0 main_~r~0) (= main_~q~0 0))} assume !!(#t~post3 < 5);havoc #t~post3; {3930#(and (= main_~A~0 main_~r~0) (= main_~q~0 0))} is VALID [2022-04-07 13:32:19,369 INFO L290 TraceCheckUtils]: 19: Hoare triple {3930#(and (= main_~A~0 main_~r~0) (= main_~q~0 0))} assume !!(~r~0 % 4294967296 >= ~b~0 % 4294967296);~b~0 := 2 * ~b~0; {3930#(and (= main_~A~0 main_~r~0) (= main_~q~0 0))} is VALID [2022-04-07 13:32:19,369 INFO L290 TraceCheckUtils]: 20: Hoare triple {3930#(and (= main_~A~0 main_~r~0) (= main_~q~0 0))} #t~post3 := ~counter~0;~counter~0 := 1 + #t~post3; {3930#(and (= main_~A~0 main_~r~0) (= main_~q~0 0))} is VALID [2022-04-07 13:32:19,370 INFO L290 TraceCheckUtils]: 21: Hoare triple {3930#(and (= main_~A~0 main_~r~0) (= main_~q~0 0))} assume !!(#t~post3 < 5);havoc #t~post3; {3930#(and (= main_~A~0 main_~r~0) (= main_~q~0 0))} is VALID [2022-04-07 13:32:19,370 INFO L290 TraceCheckUtils]: 22: Hoare triple {3930#(and (= main_~A~0 main_~r~0) (= main_~q~0 0))} assume !!(~r~0 % 4294967296 >= ~b~0 % 4294967296);~b~0 := 2 * ~b~0; {3930#(and (= main_~A~0 main_~r~0) (= main_~q~0 0))} is VALID [2022-04-07 13:32:19,371 INFO L290 TraceCheckUtils]: 23: Hoare triple {3930#(and (= main_~A~0 main_~r~0) (= main_~q~0 0))} #t~post3 := ~counter~0;~counter~0 := 1 + #t~post3; {3930#(and (= main_~A~0 main_~r~0) (= main_~q~0 0))} is VALID [2022-04-07 13:32:19,372 INFO L290 TraceCheckUtils]: 24: Hoare triple {3930#(and (= main_~A~0 main_~r~0) (= main_~q~0 0))} assume !!(#t~post3 < 5);havoc #t~post3; {3930#(and (= main_~A~0 main_~r~0) (= main_~q~0 0))} is VALID [2022-04-07 13:32:19,372 INFO L290 TraceCheckUtils]: 25: Hoare triple {3930#(and (= main_~A~0 main_~r~0) (= main_~q~0 0))} assume !!(~r~0 % 4294967296 >= ~b~0 % 4294967296);~b~0 := 2 * ~b~0; {3930#(and (= main_~A~0 main_~r~0) (= main_~q~0 0))} is VALID [2022-04-07 13:32:19,372 INFO L290 TraceCheckUtils]: 26: Hoare triple {3930#(and (= main_~A~0 main_~r~0) (= main_~q~0 0))} #t~post3 := ~counter~0;~counter~0 := 1 + #t~post3; {3930#(and (= main_~A~0 main_~r~0) (= main_~q~0 0))} is VALID [2022-04-07 13:32:19,373 INFO L290 TraceCheckUtils]: 27: Hoare triple {3930#(and (= main_~A~0 main_~r~0) (= main_~q~0 0))} assume !!(#t~post3 < 5);havoc #t~post3; {3930#(and (= main_~A~0 main_~r~0) (= main_~q~0 0))} is VALID [2022-04-07 13:32:19,373 INFO L290 TraceCheckUtils]: 28: Hoare triple {3930#(and (= main_~A~0 main_~r~0) (= main_~q~0 0))} assume !!(~r~0 % 4294967296 >= ~b~0 % 4294967296);~b~0 := 2 * ~b~0; {3930#(and (= main_~A~0 main_~r~0) (= main_~q~0 0))} is VALID [2022-04-07 13:32:19,374 INFO L290 TraceCheckUtils]: 29: Hoare triple {3930#(and (= main_~A~0 main_~r~0) (= main_~q~0 0))} #t~post3 := ~counter~0;~counter~0 := 1 + #t~post3; {3930#(and (= main_~A~0 main_~r~0) (= main_~q~0 0))} is VALID [2022-04-07 13:32:19,374 INFO L290 TraceCheckUtils]: 30: Hoare triple {3930#(and (= main_~A~0 main_~r~0) (= main_~q~0 0))} assume !(#t~post3 < 5);havoc #t~post3; {3930#(and (= main_~A~0 main_~r~0) (= main_~q~0 0))} is VALID [2022-04-07 13:32:19,374 INFO L290 TraceCheckUtils]: 31: Hoare triple {3930#(and (= main_~A~0 main_~r~0) (= main_~q~0 0))} #t~post4 := ~counter~0;~counter~0 := 1 + #t~post4; {3930#(and (= main_~A~0 main_~r~0) (= main_~q~0 0))} is VALID [2022-04-07 13:32:19,375 INFO L290 TraceCheckUtils]: 32: Hoare triple {3930#(and (= main_~A~0 main_~r~0) (= main_~q~0 0))} assume !(#t~post4 < 5);havoc #t~post4; {3930#(and (= main_~A~0 main_~r~0) (= main_~q~0 0))} is VALID [2022-04-07 13:32:19,375 INFO L272 TraceCheckUtils]: 33: Hoare triple {3930#(and (= main_~A~0 main_~r~0) (= main_~q~0 0))} call __VERIFIER_assert((if ~A~0 % 4294967296 == (~q~0 * ~b~0 + ~r~0) % 4294967296 then 1 else 0)); {3982#(<= 1 |__VERIFIER_assert_#in~cond|)} is VALID [2022-04-07 13:32:19,376 INFO L290 TraceCheckUtils]: 34: Hoare triple {3982#(<= 1 |__VERIFIER_assert_#in~cond|)} ~cond := #in~cond; {3986#(<= 1 __VERIFIER_assert_~cond)} is VALID [2022-04-07 13:32:19,376 INFO L290 TraceCheckUtils]: 35: Hoare triple {3986#(<= 1 __VERIFIER_assert_~cond)} assume 0 == ~cond; {3878#false} is VALID [2022-04-07 13:32:19,376 INFO L290 TraceCheckUtils]: 36: Hoare triple {3878#false} assume !false; {3878#false} is VALID [2022-04-07 13:32:19,376 INFO L134 CoverageAnalysis]: Checked inductivity of 30 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 30 trivial. 0 not checked. [2022-04-07 13:32:19,376 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-04-07 13:32:19,376 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-07 13:32:19,376 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [686990667] [2022-04-07 13:32:19,377 WARN L310 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2022-04-07 13:32:19,377 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [663860606] [2022-04-07 13:32:19,377 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [663860606] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-07 13:32:19,377 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-07 13:32:19,377 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2022-04-07 13:32:19,377 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1160833767] [2022-04-07 13:32:19,377 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-07 13:32:19,378 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 3.2) internal successors, (16), 4 states have internal predecessors, (16), 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 37 [2022-04-07 13:32:19,378 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-07 13:32:19,378 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with has 5 states, 5 states have (on average 3.2) internal successors, (16), 4 states have internal predecessors, (16), 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 13:32:19,421 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 24 edges. 24 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-07 13:32:19,421 INFO L554 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-04-07 13:32:19,421 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-04-07 13:32:19,421 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-04-07 13:32:19,421 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2022-04-07 13:32:19,422 INFO L87 Difference]: Start difference. First operand 76 states and 88 transitions. Second operand has 5 states, 5 states have (on average 3.2) internal successors, (16), 4 states have internal predecessors, (16), 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 13:32:19,806 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-07 13:32:19,806 INFO L93 Difference]: Finished difference Result 99 states and 115 transitions. [2022-04-07 13:32:19,806 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-04-07 13:32:19,807 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 3.2) internal successors, (16), 4 states have internal predecessors, (16), 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 37 [2022-04-07 13:32:19,808 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-07 13:32:19,808 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 5 states, 5 states have (on average 3.2) internal successors, (16), 4 states have internal predecessors, (16), 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 13:32:19,808 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 47 transitions. [2022-04-07 13:32:19,808 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 5 states, 5 states have (on average 3.2) internal successors, (16), 4 states have internal predecessors, (16), 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 13:32:19,809 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 47 transitions. [2022-04-07 13:32:19,809 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 5 states and 47 transitions. [2022-04-07 13:32:20,007 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 13:32:20,008 INFO L225 Difference]: With dead ends: 99 [2022-04-07 13:32:20,008 INFO L226 Difference]: Without dead ends: 96 [2022-04-07 13:32:20,008 INFO L912 BasicCegarLoop]: 0 DeclaredPredicates, 37 GetRequests, 33 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 13:32:20,009 INFO L913 BasicCegarLoop]: 26 mSDtfsCounter, 8 mSDsluCounter, 67 mSDsCounter, 0 mSdLazyCounter, 36 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 9 SdHoareTripleChecker+Valid, 93 SdHoareTripleChecker+Invalid, 38 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 36 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2022-04-07 13:32:20,009 INFO L914 BasicCegarLoop]: SdHoareTripleChecker [9 Valid, 93 Invalid, 38 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 36 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2022-04-07 13:32:20,009 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 96 states. [2022-04-07 13:32:20,025 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 96 to 77. [2022-04-07 13:32:20,025 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-07 13:32:20,026 INFO L82 GeneralOperation]: Start isEquivalent. First operand 96 states. Second operand has 77 states, 59 states have (on average 1.2033898305084745) internal successors, (71), 60 states have internal predecessors, (71), 10 states have call successors, (10), 8 states have call predecessors, (10), 7 states have return successors, (8), 8 states have call predecessors, (8), 8 states have call successors, (8) [2022-04-07 13:32:20,026 INFO L74 IsIncluded]: Start isIncluded. First operand 96 states. Second operand has 77 states, 59 states have (on average 1.2033898305084745) internal successors, (71), 60 states have internal predecessors, (71), 10 states have call successors, (10), 8 states have call predecessors, (10), 7 states have return successors, (8), 8 states have call predecessors, (8), 8 states have call successors, (8) [2022-04-07 13:32:20,026 INFO L87 Difference]: Start difference. First operand 96 states. Second operand has 77 states, 59 states have (on average 1.2033898305084745) internal successors, (71), 60 states have internal predecessors, (71), 10 states have call successors, (10), 8 states have call predecessors, (10), 7 states have return successors, (8), 8 states have call predecessors, (8), 8 states have call successors, (8) [2022-04-07 13:32:20,028 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-07 13:32:20,028 INFO L93 Difference]: Finished difference Result 96 states and 109 transitions. [2022-04-07 13:32:20,028 INFO L276 IsEmpty]: Start isEmpty. Operand 96 states and 109 transitions. [2022-04-07 13:32:20,028 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-07 13:32:20,028 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-07 13:32:20,028 INFO L74 IsIncluded]: Start isIncluded. First operand has 77 states, 59 states have (on average 1.2033898305084745) internal successors, (71), 60 states have internal predecessors, (71), 10 states have call successors, (10), 8 states have call predecessors, (10), 7 states have return successors, (8), 8 states have call predecessors, (8), 8 states have call successors, (8) Second operand 96 states. [2022-04-07 13:32:20,029 INFO L87 Difference]: Start difference. First operand has 77 states, 59 states have (on average 1.2033898305084745) internal successors, (71), 60 states have internal predecessors, (71), 10 states have call successors, (10), 8 states have call predecessors, (10), 7 states have return successors, (8), 8 states have call predecessors, (8), 8 states have call successors, (8) Second operand 96 states. [2022-04-07 13:32:20,030 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-07 13:32:20,030 INFO L93 Difference]: Finished difference Result 96 states and 109 transitions. [2022-04-07 13:32:20,030 INFO L276 IsEmpty]: Start isEmpty. Operand 96 states and 109 transitions. [2022-04-07 13:32:20,031 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-07 13:32:20,031 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-07 13:32:20,031 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-07 13:32:20,031 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-07 13:32:20,031 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 77 states, 59 states have (on average 1.2033898305084745) internal successors, (71), 60 states have internal predecessors, (71), 10 states have call successors, (10), 8 states have call predecessors, (10), 7 states have return successors, (8), 8 states have call predecessors, (8), 8 states have call successors, (8) [2022-04-07 13:32:20,032 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 77 states to 77 states and 89 transitions. [2022-04-07 13:32:20,032 INFO L78 Accepts]: Start accepts. Automaton has 77 states and 89 transitions. Word has length 37 [2022-04-07 13:32:20,033 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-07 13:32:20,033 INFO L478 AbstractCegarLoop]: Abstraction has 77 states and 89 transitions. [2022-04-07 13:32:20,033 INFO L479 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 3.2) internal successors, (16), 4 states have internal predecessors, (16), 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 13:32:20,033 INFO L276 IsEmpty]: Start isEmpty. Operand 77 states and 89 transitions. [2022-04-07 13:32:20,033 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 39 [2022-04-07 13:32:20,033 INFO L491 BasicCegarLoop]: Found error trace [2022-04-07 13:32:20,033 INFO L499 BasicCegarLoop]: trace histogram [2, 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] [2022-04-07 13:32:20,056 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 13:32:20,246 WARN L460 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 10 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable9 [2022-04-07 13:32:20,247 INFO L403 AbstractCegarLoop]: === Iteration 11 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-07 13:32:20,247 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-07 13:32:20,247 INFO L85 PathProgramCache]: Analyzing trace with hash 817777954, now seen corresponding path program 1 times [2022-04-07 13:32:20,247 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-07 13:32:20,247 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [261062991] [2022-04-07 13:32:20,247 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-07 13:32:20,248 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-07 13:32:20,261 ERROR L245 FreeRefinementEngine]: Caught known exception: Unsupported non-linear arithmetic [2022-04-07 13:32:20,261 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [1744375172] [2022-04-07 13:32:20,262 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-07 13:32:20,262 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-07 13:32:20,262 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-04-07 13:32:20,264 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 13:32:20,266 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (11)] Waiting until timeout for monitored process