/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_valuebound1.i -------------------------------------------------------------------------------- This is Ultimate 0.2.2-dev-fb4f59a-m [2022-04-27 12:47:12,938 INFO L177 SettingsManager]: Resetting all preferences to default values... [2022-04-27 12:47:12,939 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2022-04-27 12:47:12,958 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2022-04-27 12:47:12,958 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2022-04-27 12:47:12,963 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2022-04-27 12:47:12,968 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2022-04-27 12:47:12,971 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2022-04-27 12:47:12,972 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2022-04-27 12:47:12,977 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2022-04-27 12:47:12,977 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2022-04-27 12:47:12,978 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2022-04-27 12:47:12,978 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2022-04-27 12:47:12,978 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2022-04-27 12:47:12,979 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2022-04-27 12:47:12,979 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2022-04-27 12:47:12,980 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2022-04-27 12:47:12,980 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2022-04-27 12:47:12,981 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2022-04-27 12:47:12,982 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2022-04-27 12:47:12,983 INFO L181 SettingsManager]: Resetting HornVerifier preferences to default values [2022-04-27 12:47:12,985 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2022-04-27 12:47:12,987 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2022-04-27 12:47:12,988 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2022-04-27 12:47:12,988 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2022-04-27 12:47:12,995 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2022-04-27 12:47:12,995 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2022-04-27 12:47:12,995 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2022-04-27 12:47:12,996 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2022-04-27 12:47:12,996 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2022-04-27 12:47:12,997 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2022-04-27 12:47:12,997 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2022-04-27 12:47:12,999 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2022-04-27 12:47:12,999 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2022-04-27 12:47:12,999 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2022-04-27 12:47:13,000 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2022-04-27 12:47:13,000 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2022-04-27 12:47:13,000 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2022-04-27 12:47:13,001 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2022-04-27 12:47:13,001 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2022-04-27 12:47:13,001 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2022-04-27 12:47:13,003 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2022-04-27 12:47:13,004 INFO L101 SettingsManager]: Beginning loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/settings/default/automizer/svcomp-Reach-32bit-Automizer_Default.epf [2022-04-27 12:47:13,030 INFO L113 SettingsManager]: Loading preferences was successful [2022-04-27 12:47:13,031 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2022-04-27 12:47:13,031 INFO L136 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2022-04-27 12:47:13,031 INFO L138 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2022-04-27 12:47:13,031 INFO L136 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2022-04-27 12:47:13,031 INFO L138 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2022-04-27 12:47:13,032 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2022-04-27 12:47:13,032 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2022-04-27 12:47:13,032 INFO L138 SettingsManager]: * Use SBE=true [2022-04-27 12:47:13,033 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2022-04-27 12:47:13,033 INFO L138 SettingsManager]: * sizeof long=4 [2022-04-27 12:47:13,033 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2022-04-27 12:47:13,033 INFO L138 SettingsManager]: * sizeof POINTER=4 [2022-04-27 12:47:13,033 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2022-04-27 12:47:13,033 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2022-04-27 12:47:13,033 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2022-04-27 12:47:13,033 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2022-04-27 12:47:13,034 INFO L138 SettingsManager]: * sizeof long double=12 [2022-04-27 12:47:13,034 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2022-04-27 12:47:13,034 INFO L138 SettingsManager]: * Use constant arrays=true [2022-04-27 12:47:13,034 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2022-04-27 12:47:13,034 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2022-04-27 12:47:13,034 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2022-04-27 12:47:13,035 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2022-04-27 12:47:13,035 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-04-27 12:47:13,035 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2022-04-27 12:47:13,035 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2022-04-27 12:47:13,035 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2022-04-27 12:47:13,035 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2022-04-27 12:47:13,035 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2022-04-27 12:47:13,035 INFO L138 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2022-04-27 12:47:13,035 INFO L138 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2022-04-27 12:47:13,036 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2022-04-27 12:47:13,036 INFO L138 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode WARNING: An illegal reflective access operation has occurred WARNING: Illegal reflective access by com.sun.xml.bind.v2.runtime.reflect.opt.Injector$1 (file:/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/plugins/com.sun.xml.bind_2.2.0.v201505121915.jar) to method java.lang.ClassLoader.defineClass(java.lang.String,byte[],int,int) WARNING: Please consider reporting this to the maintainers of com.sun.xml.bind.v2.runtime.reflect.opt.Injector$1 WARNING: Use --illegal-access=warn to enable warnings of further illegal reflective access operations WARNING: All illegal access operations will be denied in a future release Applying setting for plugin de.uni_freiburg.informatik.ultimate.core: Log level for class -> de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=WARN; [2022-04-27 12:47:13,249 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2022-04-27 12:47:13,275 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2022-04-27 12:47:13,277 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2022-04-27 12:47:13,277 INFO L271 PluginConnector]: Initializing CDTParser... [2022-04-27 12:47:13,278 INFO L275 PluginConnector]: CDTParser initialized [2022-04-27 12:47:13,279 INFO L432 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/nla-digbench-scaling/divbin_valuebound1.i [2022-04-27 12:47:13,331 INFO L220 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/2824df907/2038df50eccf4826acfb61871705d279/FLAGe566c1111 [2022-04-27 12:47:13,681 INFO L306 CDTParser]: Found 1 translation units. [2022-04-27 12:47:13,681 INFO L160 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/nla-digbench-scaling/divbin_valuebound1.i [2022-04-27 12:47:13,686 INFO L349 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/2824df907/2038df50eccf4826acfb61871705d279/FLAGe566c1111 [2022-04-27 12:47:14,113 INFO L357 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/2824df907/2038df50eccf4826acfb61871705d279 [2022-04-27 12:47:14,114 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2022-04-27 12:47:14,115 INFO L131 ToolchainWalker]: Walking toolchain with 4 elements. [2022-04-27 12:47:14,116 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2022-04-27 12:47:14,116 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2022-04-27 12:47:14,119 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2022-04-27 12:47:14,122 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 27.04 12:47:14" (1/1) ... [2022-04-27 12:47:14,123 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@5a4d8e86 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.04 12:47:14, skipping insertion in model container [2022-04-27 12:47:14,123 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 27.04 12:47:14" (1/1) ... [2022-04-27 12:47:14,128 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2022-04-27 12:47:14,138 INFO L178 MainTranslator]: Built tables and reachable declarations [2022-04-27 12:47:14,279 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_valuebound1.i[950,963] [2022-04-27 12:47:14,290 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-04-27 12:47:14,296 INFO L203 MainTranslator]: Completed pre-run [2022-04-27 12:47:14,305 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_valuebound1.i[950,963] [2022-04-27 12:47:14,310 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-04-27 12:47:14,320 INFO L208 MainTranslator]: Completed translation [2022-04-27 12:47:14,320 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.04 12:47:14 WrapperNode [2022-04-27 12:47:14,320 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2022-04-27 12:47:14,321 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2022-04-27 12:47:14,321 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2022-04-27 12:47:14,321 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2022-04-27 12:47:14,328 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.04 12:47:14" (1/1) ... [2022-04-27 12:47:14,328 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.04 12:47:14" (1/1) ... [2022-04-27 12:47:14,332 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.04 12:47:14" (1/1) ... [2022-04-27 12:47:14,333 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.04 12:47:14" (1/1) ... [2022-04-27 12:47:14,337 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.04 12:47:14" (1/1) ... [2022-04-27 12:47:14,342 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.04 12:47:14" (1/1) ... [2022-04-27 12:47:14,342 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.04 12:47:14" (1/1) ... [2022-04-27 12:47:14,344 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2022-04-27 12:47:14,345 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2022-04-27 12:47:14,345 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2022-04-27 12:47:14,345 INFO L275 PluginConnector]: RCFGBuilder initialized [2022-04-27 12:47:14,345 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.04 12:47:14" (1/1) ... [2022-04-27 12:47:14,354 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-04-27 12:47:14,361 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-04-27 12:47:14,372 INFO L229 MonitoredProcess]: Starting monitored process 1 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (exit command is (exit), workingDir is null) [2022-04-27 12:47:14,374 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (1)] Waiting until timeout for monitored process [2022-04-27 12:47:14,397 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.init [2022-04-27 12:47:14,397 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2022-04-27 12:47:14,397 INFO L138 BoogieDeclarations]: Found implementation of procedure reach_error [2022-04-27 12:47:14,397 INFO L138 BoogieDeclarations]: Found implementation of procedure assume_abort_if_not [2022-04-27 12:47:14,397 INFO L138 BoogieDeclarations]: Found implementation of procedure __VERIFIER_assert [2022-04-27 12:47:14,398 INFO L138 BoogieDeclarations]: Found implementation of procedure main [2022-04-27 12:47:14,398 INFO L130 BoogieDeclarations]: Found specification of procedure abort [2022-04-27 12:47:14,398 INFO L130 BoogieDeclarations]: Found specification of procedure __assert_fail [2022-04-27 12:47:14,398 INFO L130 BoogieDeclarations]: Found specification of procedure __assert_perror_fail [2022-04-27 12:47:14,398 INFO L130 BoogieDeclarations]: Found specification of procedure __assert [2022-04-27 12:47:14,398 INFO L130 BoogieDeclarations]: Found specification of procedure reach_error [2022-04-27 12:47:14,398 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2022-04-27 12:47:14,398 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_nondet_uint [2022-04-27 12:47:14,398 INFO L130 BoogieDeclarations]: Found specification of procedure assume_abort_if_not [2022-04-27 12:47:14,398 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_assert [2022-04-27 12:47:14,398 INFO L130 BoogieDeclarations]: Found specification of procedure main [2022-04-27 12:47:14,398 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.init [2022-04-27 12:47:14,398 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2022-04-27 12:47:14,398 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2022-04-27 12:47:14,399 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2022-04-27 12:47:14,399 INFO L130 BoogieDeclarations]: Found specification of procedure read~int [2022-04-27 12:47:14,399 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2022-04-27 12:47:14,448 INFO L234 CfgBuilder]: Building ICFG [2022-04-27 12:47:14,449 INFO L260 CfgBuilder]: Building CFG for each procedure with an implementation [2022-04-27 12:47:14,638 INFO L275 CfgBuilder]: Performing block encoding [2022-04-27 12:47:14,643 INFO L294 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2022-04-27 12:47:14,644 INFO L299 CfgBuilder]: Removed 2 assume(true) statements. [2022-04-27 12:47:14,645 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 27.04 12:47:14 BoogieIcfgContainer [2022-04-27 12:47:14,645 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2022-04-27 12:47:14,646 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2022-04-27 12:47:14,647 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2022-04-27 12:47:14,649 INFO L275 PluginConnector]: TraceAbstraction initialized [2022-04-27 12:47:14,650 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 27.04 12:47:14" (1/3) ... [2022-04-27 12:47:14,650 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@6e14a4fd and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 27.04 12:47:14, skipping insertion in model container [2022-04-27 12:47:14,650 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.04 12:47:14" (2/3) ... [2022-04-27 12:47:14,650 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@6e14a4fd and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 27.04 12:47:14, skipping insertion in model container [2022-04-27 12:47:14,651 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 27.04 12:47:14" (3/3) ... [2022-04-27 12:47:14,651 INFO L111 eAbstractionObserver]: Analyzing ICFG divbin_valuebound1.i [2022-04-27 12:47:14,674 INFO L201 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2022-04-27 12:47:14,674 INFO L160 ceAbstractionStarter]: Applying trace abstraction to program that has 1 error locations. [2022-04-27 12:47:14,722 INFO L356 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2022-04-27 12:47:14,735 INFO L357 AbstractCegarLoop]: Settings: SEPARATE_VIOLATION_CHECK=true, mInterprocedural=true, mMaxIterations=1000000, mWatchIteration=1000000, mArtifact=RCFG, mInterpolation=FPandBP, mInterpolantAutomaton=STRAIGHT_LINE, mDumpAutomata=false, mAutomataFormat=ATS_NUMERATE, mDumpPath=., mDeterminiation=PREDICATE_ABSTRACTION, mMinimize=MINIMIZE_SEVPA, mHoare=true, mAutomataTypeConcurrency=PETRI_NET, mHoareTripleChecks=INCREMENTAL, mHoareAnnotationPositions=LoopsAndPotentialCycles, mDumpOnlyReuseAutomata=false, mLimitTraceHistogram=0, mErrorLocTimeLimit=0, mLimitPathProgramCount=0, mCollectInterpolantStatistics=true, mHeuristicEmptinessCheck=false, mHeuristicEmptinessCheckAStarHeuristic=ZERO, mHeuristicEmptinessCheckAStarHeuristicRandomSeed=1337, mHeuristicEmptinessCheckSmtFeatureScoringMethod=DAGSIZE, mSMTFeatureExtraction=false, mSMTFeatureExtractionDumpPath=., mOverrideInterpolantAutomaton=false, mMcrInterpolantMethod=WP, mPorIndependenceSettings=de.uni_freiburg.informatik.ultimate.lib.tracecheckerutils.partialorder.independence.IndependenceSettings@39209dec, mLbeIndependenceSettings=de.uni_freiburg.informatik.ultimate.lib.tracecheckerutils.partialorder.independence.IndependenceSettings@41ba7253 [2022-04-27 12:47:14,736 INFO L358 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2022-04-27 12:47:14,742 INFO L276 IsEmpty]: Start isEmpty. Operand has 34 states, 20 states have (on average 1.5) internal successors, (30), 21 states have internal predecessors, (30), 8 states have call successors, (8), 4 states have call predecessors, (8), 4 states have return successors, (8), 8 states have call predecessors, (8), 8 states have call successors, (8) [2022-04-27 12:47:14,747 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 35 [2022-04-27 12:47:14,748 INFO L187 NwaCegarLoop]: Found error trace [2022-04-27 12:47:14,749 INFO L195 NwaCegarLoop]: trace histogram [4, 4, 4, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-27 12:47:14,750 INFO L420 AbstractCegarLoop]: === Iteration 1 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-27 12:47:14,755 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-27 12:47:14,755 INFO L85 PathProgramCache]: Analyzing trace with hash 291922115, now seen corresponding path program 1 times [2022-04-27 12:47:14,762 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-27 12:47:14,763 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1084749021] [2022-04-27 12:47:14,763 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-27 12:47:14,764 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-27 12:47:14,857 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-27 12:47:14,916 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-04-27 12:47:14,923 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-27 12:47:14,944 INFO L290 TraceCheckUtils]: 0: Hoare triple {58#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(9, 2); {37#true} is VALID [2022-04-27 12:47:14,945 INFO L290 TraceCheckUtils]: 1: Hoare triple {37#true} assume true; {37#true} is VALID [2022-04-27 12:47:14,946 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {37#true} {37#true} #94#return; {37#true} is VALID [2022-04-27 12:47:14,946 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2022-04-27 12:47:14,948 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-27 12:47:14,956 INFO L290 TraceCheckUtils]: 0: Hoare triple {37#true} ~cond := #in~cond; {37#true} is VALID [2022-04-27 12:47:14,957 INFO L290 TraceCheckUtils]: 1: Hoare triple {37#true} assume 0 == ~cond;assume false; {38#false} is VALID [2022-04-27 12:47:14,957 INFO L290 TraceCheckUtils]: 2: Hoare triple {38#false} assume true; {38#false} is VALID [2022-04-27 12:47:14,957 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {38#false} {37#true} #82#return; {38#false} is VALID [2022-04-27 12:47:14,958 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 12 [2022-04-27 12:47:14,969 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-27 12:47:14,984 INFO L290 TraceCheckUtils]: 0: Hoare triple {37#true} ~cond := #in~cond; {37#true} is VALID [2022-04-27 12:47:14,984 INFO L290 TraceCheckUtils]: 1: Hoare triple {37#true} assume 0 == ~cond;assume false; {38#false} is VALID [2022-04-27 12:47:14,984 INFO L290 TraceCheckUtils]: 2: Hoare triple {38#false} assume true; {38#false} is VALID [2022-04-27 12:47:14,985 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {38#false} {38#false} #84#return; {38#false} is VALID [2022-04-27 12:47:14,985 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 17 [2022-04-27 12:47:14,986 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-27 12:47:14,992 INFO L290 TraceCheckUtils]: 0: Hoare triple {37#true} ~cond := #in~cond; {37#true} is VALID [2022-04-27 12:47:14,993 INFO L290 TraceCheckUtils]: 1: Hoare triple {37#true} assume 0 == ~cond;assume false; {38#false} is VALID [2022-04-27 12:47:14,993 INFO L290 TraceCheckUtils]: 2: Hoare triple {38#false} assume true; {38#false} is VALID [2022-04-27 12:47:14,993 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {38#false} {38#false} #86#return; {38#false} is VALID [2022-04-27 12:47:14,994 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 22 [2022-04-27 12:47:14,995 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-27 12:47:15,000 INFO L290 TraceCheckUtils]: 0: Hoare triple {37#true} ~cond := #in~cond; {37#true} is VALID [2022-04-27 12:47:15,001 INFO L290 TraceCheckUtils]: 1: Hoare triple {37#true} assume 0 == ~cond;assume false; {38#false} is VALID [2022-04-27 12:47:15,001 INFO L290 TraceCheckUtils]: 2: Hoare triple {38#false} assume true; {38#false} is VALID [2022-04-27 12:47:15,001 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {38#false} {38#false} #88#return; {38#false} is VALID [2022-04-27 12:47:15,003 INFO L272 TraceCheckUtils]: 0: Hoare triple {37#true} call ULTIMATE.init(); {58#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} is VALID [2022-04-27 12:47:15,003 INFO L290 TraceCheckUtils]: 1: Hoare triple {58#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(9, 2); {37#true} is VALID [2022-04-27 12:47:15,004 INFO L290 TraceCheckUtils]: 2: Hoare triple {37#true} assume true; {37#true} is VALID [2022-04-27 12:47:15,004 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {37#true} {37#true} #94#return; {37#true} is VALID [2022-04-27 12:47:15,004 INFO L272 TraceCheckUtils]: 4: Hoare triple {37#true} call #t~ret3 := main(); {37#true} is VALID [2022-04-27 12:47:15,004 INFO L290 TraceCheckUtils]: 5: Hoare triple {37#true} havoc ~A~0;havoc ~B~0;havoc ~q~0;havoc ~r~0;havoc ~b~0;~A~0 := #t~nondet1;havoc #t~nondet1; {37#true} is VALID [2022-04-27 12:47:15,005 INFO L272 TraceCheckUtils]: 6: Hoare triple {37#true} call assume_abort_if_not((if ~A~0 % 4294967296 >= 0 && ~A~0 % 4294967296 <= 1 then 1 else 0)); {37#true} is VALID [2022-04-27 12:47:15,005 INFO L290 TraceCheckUtils]: 7: Hoare triple {37#true} ~cond := #in~cond; {37#true} is VALID [2022-04-27 12:47:15,006 INFO L290 TraceCheckUtils]: 8: Hoare triple {37#true} assume 0 == ~cond;assume false; {38#false} is VALID [2022-04-27 12:47:15,007 INFO L290 TraceCheckUtils]: 9: Hoare triple {38#false} assume true; {38#false} is VALID [2022-04-27 12:47:15,007 INFO L284 TraceCheckUtils]: 10: Hoare quadruple {38#false} {37#true} #82#return; {38#false} is VALID [2022-04-27 12:47:15,007 INFO L290 TraceCheckUtils]: 11: Hoare triple {38#false} ~B~0 := #t~nondet2;havoc #t~nondet2; {38#false} is VALID [2022-04-27 12:47:15,007 INFO L272 TraceCheckUtils]: 12: Hoare triple {38#false} call assume_abort_if_not((if ~B~0 % 4294967296 >= 0 && ~B~0 % 4294967296 <= 1 then 1 else 0)); {37#true} is VALID [2022-04-27 12:47:15,007 INFO L290 TraceCheckUtils]: 13: Hoare triple {37#true} ~cond := #in~cond; {37#true} is VALID [2022-04-27 12:47:15,008 INFO L290 TraceCheckUtils]: 14: Hoare triple {37#true} assume 0 == ~cond;assume false; {38#false} is VALID [2022-04-27 12:47:15,008 INFO L290 TraceCheckUtils]: 15: Hoare triple {38#false} assume true; {38#false} is VALID [2022-04-27 12:47:15,008 INFO L284 TraceCheckUtils]: 16: Hoare quadruple {38#false} {38#false} #84#return; {38#false} is VALID [2022-04-27 12:47:15,009 INFO L272 TraceCheckUtils]: 17: Hoare triple {38#false} call assume_abort_if_not((if ~B~0 % 4294967296 < 2147483647 then 1 else 0)); {37#true} is VALID [2022-04-27 12:47:15,009 INFO L290 TraceCheckUtils]: 18: Hoare triple {37#true} ~cond := #in~cond; {37#true} is VALID [2022-04-27 12:47:15,010 INFO L290 TraceCheckUtils]: 19: Hoare triple {37#true} assume 0 == ~cond;assume false; {38#false} is VALID [2022-04-27 12:47:15,010 INFO L290 TraceCheckUtils]: 20: Hoare triple {38#false} assume true; {38#false} is VALID [2022-04-27 12:47:15,010 INFO L284 TraceCheckUtils]: 21: Hoare quadruple {38#false} {38#false} #86#return; {38#false} is VALID [2022-04-27 12:47:15,010 INFO L272 TraceCheckUtils]: 22: Hoare triple {38#false} call assume_abort_if_not((if ~B~0 % 4294967296 >= 1 then 1 else 0)); {37#true} is VALID [2022-04-27 12:47:15,010 INFO L290 TraceCheckUtils]: 23: Hoare triple {37#true} ~cond := #in~cond; {37#true} is VALID [2022-04-27 12:47:15,011 INFO L290 TraceCheckUtils]: 24: Hoare triple {37#true} assume 0 == ~cond;assume false; {38#false} is VALID [2022-04-27 12:47:15,011 INFO L290 TraceCheckUtils]: 25: Hoare triple {38#false} assume true; {38#false} is VALID [2022-04-27 12:47:15,011 INFO L284 TraceCheckUtils]: 26: Hoare quadruple {38#false} {38#false} #88#return; {38#false} is VALID [2022-04-27 12:47:15,011 INFO L290 TraceCheckUtils]: 27: Hoare triple {38#false} ~q~0 := 0;~r~0 := ~A~0;~b~0 := ~B~0; {38#false} is VALID [2022-04-27 12:47:15,014 INFO L290 TraceCheckUtils]: 28: Hoare triple {38#false} assume !true; {38#false} is VALID [2022-04-27 12:47:15,015 INFO L290 TraceCheckUtils]: 29: Hoare triple {38#false} assume !true; {38#false} is VALID [2022-04-27 12:47:15,015 INFO L272 TraceCheckUtils]: 30: Hoare triple {38#false} call __VERIFIER_assert((if ~A~0 % 4294967296 == (~q~0 * ~b~0 + ~r~0) % 4294967296 then 1 else 0)); {38#false} is VALID [2022-04-27 12:47:15,015 INFO L290 TraceCheckUtils]: 31: Hoare triple {38#false} ~cond := #in~cond; {38#false} is VALID [2022-04-27 12:47:15,015 INFO L290 TraceCheckUtils]: 32: Hoare triple {38#false} assume 0 == ~cond; {38#false} is VALID [2022-04-27 12:47:15,015 INFO L290 TraceCheckUtils]: 33: Hoare triple {38#false} assume !false; {38#false} is VALID [2022-04-27 12:47:15,016 INFO L134 CoverageAnalysis]: Checked inductivity of 24 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 24 trivial. 0 not checked. [2022-04-27 12:47:15,016 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-27 12:47:15,016 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1084749021] [2022-04-27 12:47:15,017 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1084749021] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-27 12:47:15,017 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-27 12:47:15,017 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-04-27 12:47:15,018 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1928897397] [2022-04-27 12:47:15,019 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-27 12:47:15,023 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 4.333333333333333) internal successors, (13), 2 states have internal predecessors, (13), 2 states have call successors, (7), 3 states have call predecessors, (7), 2 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) Word has length 34 [2022-04-27 12:47:15,026 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-27 12:47:15,029 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with has 3 states, 3 states have (on average 4.333333333333333) internal successors, (13), 2 states have internal predecessors, (13), 2 states have call successors, (7), 3 states have call predecessors, (7), 2 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) [2022-04-27 12:47:15,069 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 25 edges. 25 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-27 12:47:15,070 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-04-27 12:47:15,071 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-04-27 12:47:15,095 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-04-27 12:47:15,095 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-04-27 12:47:15,098 INFO L87 Difference]: Start difference. First operand has 34 states, 20 states have (on average 1.5) internal successors, (30), 21 states have internal predecessors, (30), 8 states have call successors, (8), 4 states have call predecessors, (8), 4 states have return successors, (8), 8 states have call predecessors, (8), 8 states have call successors, (8) Second operand has 3 states, 3 states have (on average 4.333333333333333) internal successors, (13), 2 states have internal predecessors, (13), 2 states have call successors, (7), 3 states have call predecessors, (7), 2 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) [2022-04-27 12:47:15,241 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-27 12:47:15,241 INFO L93 Difference]: Finished difference Result 61 states and 90 transitions. [2022-04-27 12:47:15,241 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-04-27 12:47:15,242 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 4.333333333333333) internal successors, (13), 2 states have internal predecessors, (13), 2 states have call successors, (7), 3 states have call predecessors, (7), 2 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) Word has length 34 [2022-04-27 12:47:15,242 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-27 12:47:15,243 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3 states, 3 states have (on average 4.333333333333333) internal successors, (13), 2 states have internal predecessors, (13), 2 states have call successors, (7), 3 states have call predecessors, (7), 2 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) [2022-04-27 12:47:15,253 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 90 transitions. [2022-04-27 12:47:15,253 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3 states, 3 states have (on average 4.333333333333333) internal successors, (13), 2 states have internal predecessors, (13), 2 states have call successors, (7), 3 states have call predecessors, (7), 2 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) [2022-04-27 12:47:15,264 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 90 transitions. [2022-04-27 12:47:15,264 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 3 states and 90 transitions. [2022-04-27 12:47:15,365 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 90 edges. 90 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-27 12:47:15,373 INFO L225 Difference]: With dead ends: 61 [2022-04-27 12:47:15,373 INFO L226 Difference]: Without dead ends: 29 [2022-04-27 12:47:15,376 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 16 GetRequests, 15 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-04-27 12:47:15,379 INFO L413 NwaCegarLoop]: 34 mSDtfsCounter, 21 mSDsluCounter, 3 mSDsCounter, 0 mSdLazyCounter, 8 mSolverCounterSat, 7 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 27 SdHoareTripleChecker+Valid, 37 SdHoareTripleChecker+Invalid, 15 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 7 IncrementalHoareTripleChecker+Valid, 8 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-04-27 12:47:15,380 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [27 Valid, 37 Invalid, 15 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [7 Valid, 8 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-04-27 12:47:15,392 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 29 states. [2022-04-27 12:47:15,413 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 29 to 29. [2022-04-27 12:47:15,413 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-27 12:47:15,414 INFO L82 GeneralOperation]: Start isEquivalent. First operand 29 states. Second operand has 29 states, 17 states have (on average 1.2352941176470589) internal successors, (21), 18 states have internal predecessors, (21), 8 states have call successors, (8), 4 states have call predecessors, (8), 3 states have return successors, (6), 6 states have call predecessors, (6), 6 states have call successors, (6) [2022-04-27 12:47:15,415 INFO L74 IsIncluded]: Start isIncluded. First operand 29 states. Second operand has 29 states, 17 states have (on average 1.2352941176470589) internal successors, (21), 18 states have internal predecessors, (21), 8 states have call successors, (8), 4 states have call predecessors, (8), 3 states have return successors, (6), 6 states have call predecessors, (6), 6 states have call successors, (6) [2022-04-27 12:47:15,416 INFO L87 Difference]: Start difference. First operand 29 states. Second operand has 29 states, 17 states have (on average 1.2352941176470589) internal successors, (21), 18 states have internal predecessors, (21), 8 states have call successors, (8), 4 states have call predecessors, (8), 3 states have return successors, (6), 6 states have call predecessors, (6), 6 states have call successors, (6) [2022-04-27 12:47:15,420 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-27 12:47:15,420 INFO L93 Difference]: Finished difference Result 29 states and 35 transitions. [2022-04-27 12:47:15,420 INFO L276 IsEmpty]: Start isEmpty. Operand 29 states and 35 transitions. [2022-04-27 12:47:15,421 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-27 12:47:15,421 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-27 12:47:15,422 INFO L74 IsIncluded]: Start isIncluded. First operand has 29 states, 17 states have (on average 1.2352941176470589) internal successors, (21), 18 states have internal predecessors, (21), 8 states have call successors, (8), 4 states have call predecessors, (8), 3 states have return successors, (6), 6 states have call predecessors, (6), 6 states have call successors, (6) Second operand 29 states. [2022-04-27 12:47:15,422 INFO L87 Difference]: Start difference. First operand has 29 states, 17 states have (on average 1.2352941176470589) internal successors, (21), 18 states have internal predecessors, (21), 8 states have call successors, (8), 4 states have call predecessors, (8), 3 states have return successors, (6), 6 states have call predecessors, (6), 6 states have call successors, (6) Second operand 29 states. [2022-04-27 12:47:15,425 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-27 12:47:15,426 INFO L93 Difference]: Finished difference Result 29 states and 35 transitions. [2022-04-27 12:47:15,426 INFO L276 IsEmpty]: Start isEmpty. Operand 29 states and 35 transitions. [2022-04-27 12:47:15,427 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-27 12:47:15,427 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-27 12:47:15,427 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-27 12:47:15,427 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-27 12:47:15,428 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 29 states, 17 states have (on average 1.2352941176470589) internal successors, (21), 18 states have internal predecessors, (21), 8 states have call successors, (8), 4 states have call predecessors, (8), 3 states have return successors, (6), 6 states have call predecessors, (6), 6 states have call successors, (6) [2022-04-27 12:47:15,430 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 29 states to 29 states and 35 transitions. [2022-04-27 12:47:15,432 INFO L78 Accepts]: Start accepts. Automaton has 29 states and 35 transitions. Word has length 34 [2022-04-27 12:47:15,432 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-27 12:47:15,432 INFO L495 AbstractCegarLoop]: Abstraction has 29 states and 35 transitions. [2022-04-27 12:47:15,433 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 4.333333333333333) internal successors, (13), 2 states have internal predecessors, (13), 2 states have call successors, (7), 3 states have call predecessors, (7), 2 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) [2022-04-27 12:47:15,434 INFO L276 IsEmpty]: Start isEmpty. Operand 29 states and 35 transitions. [2022-04-27 12:47:15,435 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 36 [2022-04-27 12:47:15,435 INFO L187 NwaCegarLoop]: Found error trace [2022-04-27 12:47:15,435 INFO L195 NwaCegarLoop]: trace histogram [4, 4, 4, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-27 12:47:15,435 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2022-04-27 12:47:15,436 INFO L420 AbstractCegarLoop]: === Iteration 2 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-27 12:47:15,436 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-27 12:47:15,437 INFO L85 PathProgramCache]: Analyzing trace with hash -245963777, now seen corresponding path program 1 times [2022-04-27 12:47:15,437 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-27 12:47:15,437 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [865955508] [2022-04-27 12:47:15,437 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-27 12:47:15,437 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-27 12:47:15,482 ERROR L245 FreeRefinementEngine]: Caught known exception: Unsupported non-linear arithmetic [2022-04-27 12:47:15,483 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [1737138441] [2022-04-27 12:47:15,483 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-27 12:47:15,483 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-27 12:47:15,484 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-04-27 12:47:15,485 INFO L229 MonitoredProcess]: Starting monitored process 2 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-04-27 12:47:15,486 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Waiting until timeout for monitored process [2022-04-27 12:47:15,538 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-27 12:47:15,541 INFO L263 TraceCheckSpWp]: Trace formula consists of 93 conjuncts, 15 conjunts are in the unsatisfiable core [2022-04-27 12:47:15,552 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-27 12:47:15,556 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-04-27 12:47:16,439 INFO L272 TraceCheckUtils]: 0: Hoare triple {243#true} call ULTIMATE.init(); {243#true} is VALID [2022-04-27 12:47:16,439 INFO L290 TraceCheckUtils]: 1: Hoare triple {243#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); {243#true} is VALID [2022-04-27 12:47:16,441 INFO L290 TraceCheckUtils]: 2: Hoare triple {243#true} assume true; {243#true} is VALID [2022-04-27 12:47:16,441 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {243#true} {243#true} #94#return; {243#true} is VALID [2022-04-27 12:47:16,442 INFO L272 TraceCheckUtils]: 4: Hoare triple {243#true} call #t~ret3 := main(); {243#true} is VALID [2022-04-27 12:47:16,442 INFO L290 TraceCheckUtils]: 5: Hoare triple {243#true} havoc ~A~0;havoc ~B~0;havoc ~q~0;havoc ~r~0;havoc ~b~0;~A~0 := #t~nondet1;havoc #t~nondet1; {243#true} is VALID [2022-04-27 12:47:16,442 INFO L272 TraceCheckUtils]: 6: Hoare triple {243#true} call assume_abort_if_not((if ~A~0 % 4294967296 >= 0 && ~A~0 % 4294967296 <= 1 then 1 else 0)); {243#true} is VALID [2022-04-27 12:47:16,442 INFO L290 TraceCheckUtils]: 7: Hoare triple {243#true} ~cond := #in~cond; {243#true} is VALID [2022-04-27 12:47:16,442 INFO L290 TraceCheckUtils]: 8: Hoare triple {243#true} assume !(0 == ~cond); {243#true} is VALID [2022-04-27 12:47:16,442 INFO L290 TraceCheckUtils]: 9: Hoare triple {243#true} assume true; {243#true} is VALID [2022-04-27 12:47:16,442 INFO L284 TraceCheckUtils]: 10: Hoare quadruple {243#true} {243#true} #82#return; {243#true} is VALID [2022-04-27 12:47:16,443 INFO L290 TraceCheckUtils]: 11: Hoare triple {243#true} ~B~0 := #t~nondet2;havoc #t~nondet2; {243#true} is VALID [2022-04-27 12:47:16,443 INFO L272 TraceCheckUtils]: 12: Hoare triple {243#true} call assume_abort_if_not((if ~B~0 % 4294967296 >= 0 && ~B~0 % 4294967296 <= 1 then 1 else 0)); {243#true} is VALID [2022-04-27 12:47:16,443 INFO L290 TraceCheckUtils]: 13: Hoare triple {243#true} ~cond := #in~cond; {287#(= assume_abort_if_not_~cond |assume_abort_if_not_#in~cond|)} is VALID [2022-04-27 12:47:16,444 INFO L290 TraceCheckUtils]: 14: Hoare triple {287#(= assume_abort_if_not_~cond |assume_abort_if_not_#in~cond|)} assume !(0 == ~cond); {291#(not (= |assume_abort_if_not_#in~cond| 0))} is VALID [2022-04-27 12:47:16,444 INFO L290 TraceCheckUtils]: 15: Hoare triple {291#(not (= |assume_abort_if_not_#in~cond| 0))} assume true; {291#(not (= |assume_abort_if_not_#in~cond| 0))} is VALID [2022-04-27 12:47:16,444 INFO L284 TraceCheckUtils]: 16: Hoare quadruple {291#(not (= |assume_abort_if_not_#in~cond| 0))} {243#true} #84#return; {298#(<= (mod main_~B~0 4294967296) 1)} is VALID [2022-04-27 12:47:16,445 INFO L272 TraceCheckUtils]: 17: Hoare triple {298#(<= (mod main_~B~0 4294967296) 1)} call assume_abort_if_not((if ~B~0 % 4294967296 < 2147483647 then 1 else 0)); {243#true} is VALID [2022-04-27 12:47:16,445 INFO L290 TraceCheckUtils]: 18: Hoare triple {243#true} ~cond := #in~cond; {243#true} is VALID [2022-04-27 12:47:16,445 INFO L290 TraceCheckUtils]: 19: Hoare triple {243#true} assume !(0 == ~cond); {243#true} is VALID [2022-04-27 12:47:16,445 INFO L290 TraceCheckUtils]: 20: Hoare triple {243#true} assume true; {243#true} is VALID [2022-04-27 12:47:16,445 INFO L284 TraceCheckUtils]: 21: Hoare quadruple {243#true} {298#(<= (mod main_~B~0 4294967296) 1)} #86#return; {298#(<= (mod main_~B~0 4294967296) 1)} is VALID [2022-04-27 12:47:16,445 INFO L272 TraceCheckUtils]: 22: Hoare triple {298#(<= (mod main_~B~0 4294967296) 1)} call assume_abort_if_not((if ~B~0 % 4294967296 >= 1 then 1 else 0)); {243#true} is VALID [2022-04-27 12:47:16,446 INFO L290 TraceCheckUtils]: 23: Hoare triple {243#true} ~cond := #in~cond; {243#true} is VALID [2022-04-27 12:47:16,446 INFO L290 TraceCheckUtils]: 24: Hoare triple {243#true} assume !(0 == ~cond); {243#true} is VALID [2022-04-27 12:47:16,446 INFO L290 TraceCheckUtils]: 25: Hoare triple {243#true} assume true; {243#true} is VALID [2022-04-27 12:47:16,446 INFO L284 TraceCheckUtils]: 26: Hoare quadruple {243#true} {298#(<= (mod main_~B~0 4294967296) 1)} #88#return; {298#(<= (mod main_~B~0 4294967296) 1)} is VALID [2022-04-27 12:47:16,447 INFO L290 TraceCheckUtils]: 27: Hoare triple {298#(<= (mod main_~B~0 4294967296) 1)} ~q~0 := 0;~r~0 := ~A~0;~b~0 := ~B~0; {332#(and (= main_~A~0 main_~r~0) (= main_~q~0 0) (<= (mod main_~b~0 4294967296) 1))} is VALID [2022-04-27 12:47:16,447 INFO L290 TraceCheckUtils]: 28: Hoare triple {332#(and (= main_~A~0 main_~r~0) (= main_~q~0 0) (<= (mod main_~b~0 4294967296) 1))} assume !false; {332#(and (= main_~A~0 main_~r~0) (= main_~q~0 0) (<= (mod main_~b~0 4294967296) 1))} is VALID [2022-04-27 12:47:16,448 INFO L290 TraceCheckUtils]: 29: Hoare triple {332#(and (= main_~A~0 main_~r~0) (= main_~q~0 0) (<= (mod main_~b~0 4294967296) 1))} assume !(~r~0 % 4294967296 >= ~b~0 % 4294967296); {339#(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) 1))} is VALID [2022-04-27 12:47:16,448 INFO L290 TraceCheckUtils]: 30: Hoare triple {339#(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) 1))} assume !false; {339#(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) 1))} is VALID [2022-04-27 12:47:16,449 INFO L272 TraceCheckUtils]: 31: Hoare triple {339#(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) 1))} call __VERIFIER_assert((if ~A~0 % 4294967296 == (~q~0 * ~b~0 + ~r~0) % 4294967296 then 1 else 0)); {346#(<= 1 |__VERIFIER_assert_#in~cond|)} is VALID [2022-04-27 12:47:16,450 INFO L290 TraceCheckUtils]: 32: Hoare triple {346#(<= 1 |__VERIFIER_assert_#in~cond|)} ~cond := #in~cond; {350#(<= 1 __VERIFIER_assert_~cond)} is VALID [2022-04-27 12:47:16,450 INFO L290 TraceCheckUtils]: 33: Hoare triple {350#(<= 1 __VERIFIER_assert_~cond)} assume 0 == ~cond; {244#false} is VALID [2022-04-27 12:47:16,450 INFO L290 TraceCheckUtils]: 34: Hoare triple {244#false} assume !false; {244#false} is VALID [2022-04-27 12:47:16,451 INFO L134 CoverageAnalysis]: Checked inductivity of 24 backedges. 3 proven. 6 refuted. 0 times theorem prover too weak. 15 trivial. 0 not checked. [2022-04-27 12:47:16,451 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-04-27 12:47:16,870 INFO L290 TraceCheckUtils]: 34: Hoare triple {244#false} assume !false; {244#false} is VALID [2022-04-27 12:47:16,871 INFO L290 TraceCheckUtils]: 33: Hoare triple {350#(<= 1 __VERIFIER_assert_~cond)} assume 0 == ~cond; {244#false} is VALID [2022-04-27 12:47:16,871 INFO L290 TraceCheckUtils]: 32: Hoare triple {346#(<= 1 |__VERIFIER_assert_#in~cond|)} ~cond := #in~cond; {350#(<= 1 __VERIFIER_assert_~cond)} is VALID [2022-04-27 12:47:16,872 INFO L272 TraceCheckUtils]: 31: Hoare triple {366#(= (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)); {346#(<= 1 |__VERIFIER_assert_#in~cond|)} is VALID [2022-04-27 12:47:16,872 INFO L290 TraceCheckUtils]: 30: Hoare triple {366#(= (mod main_~A~0 4294967296) (mod (+ main_~r~0 (* main_~b~0 main_~q~0)) 4294967296))} assume !false; {366#(= (mod main_~A~0 4294967296) (mod (+ main_~r~0 (* main_~b~0 main_~q~0)) 4294967296))} is VALID [2022-04-27 12:47:16,873 INFO L290 TraceCheckUtils]: 29: Hoare triple {373#(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); {366#(= (mod main_~A~0 4294967296) (mod (+ main_~r~0 (* main_~b~0 main_~q~0)) 4294967296))} is VALID [2022-04-27 12:47:16,873 INFO L290 TraceCheckUtils]: 28: Hoare triple {373#(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 !false; {373#(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-27 12:47:16,873 INFO L290 TraceCheckUtils]: 27: Hoare triple {243#true} ~q~0 := 0;~r~0 := ~A~0;~b~0 := ~B~0; {373#(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-27 12:47:16,873 INFO L284 TraceCheckUtils]: 26: Hoare quadruple {243#true} {243#true} #88#return; {243#true} is VALID [2022-04-27 12:47:16,874 INFO L290 TraceCheckUtils]: 25: Hoare triple {243#true} assume true; {243#true} is VALID [2022-04-27 12:47:16,874 INFO L290 TraceCheckUtils]: 24: Hoare triple {243#true} assume !(0 == ~cond); {243#true} is VALID [2022-04-27 12:47:16,874 INFO L290 TraceCheckUtils]: 23: Hoare triple {243#true} ~cond := #in~cond; {243#true} is VALID [2022-04-27 12:47:16,874 INFO L272 TraceCheckUtils]: 22: Hoare triple {243#true} call assume_abort_if_not((if ~B~0 % 4294967296 >= 1 then 1 else 0)); {243#true} is VALID [2022-04-27 12:47:16,874 INFO L284 TraceCheckUtils]: 21: Hoare quadruple {243#true} {243#true} #86#return; {243#true} is VALID [2022-04-27 12:47:16,874 INFO L290 TraceCheckUtils]: 20: Hoare triple {243#true} assume true; {243#true} is VALID [2022-04-27 12:47:16,874 INFO L290 TraceCheckUtils]: 19: Hoare triple {243#true} assume !(0 == ~cond); {243#true} is VALID [2022-04-27 12:47:16,874 INFO L290 TraceCheckUtils]: 18: Hoare triple {243#true} ~cond := #in~cond; {243#true} is VALID [2022-04-27 12:47:16,874 INFO L272 TraceCheckUtils]: 17: Hoare triple {243#true} call assume_abort_if_not((if ~B~0 % 4294967296 < 2147483647 then 1 else 0)); {243#true} is VALID [2022-04-27 12:47:16,875 INFO L284 TraceCheckUtils]: 16: Hoare quadruple {243#true} {243#true} #84#return; {243#true} is VALID [2022-04-27 12:47:16,875 INFO L290 TraceCheckUtils]: 15: Hoare triple {243#true} assume true; {243#true} is VALID [2022-04-27 12:47:16,875 INFO L290 TraceCheckUtils]: 14: Hoare triple {243#true} assume !(0 == ~cond); {243#true} is VALID [2022-04-27 12:47:16,875 INFO L290 TraceCheckUtils]: 13: Hoare triple {243#true} ~cond := #in~cond; {243#true} is VALID [2022-04-27 12:47:16,875 INFO L272 TraceCheckUtils]: 12: Hoare triple {243#true} call assume_abort_if_not((if ~B~0 % 4294967296 >= 0 && ~B~0 % 4294967296 <= 1 then 1 else 0)); {243#true} is VALID [2022-04-27 12:47:16,875 INFO L290 TraceCheckUtils]: 11: Hoare triple {243#true} ~B~0 := #t~nondet2;havoc #t~nondet2; {243#true} is VALID [2022-04-27 12:47:16,875 INFO L284 TraceCheckUtils]: 10: Hoare quadruple {243#true} {243#true} #82#return; {243#true} is VALID [2022-04-27 12:47:16,875 INFO L290 TraceCheckUtils]: 9: Hoare triple {243#true} assume true; {243#true} is VALID [2022-04-27 12:47:16,875 INFO L290 TraceCheckUtils]: 8: Hoare triple {243#true} assume !(0 == ~cond); {243#true} is VALID [2022-04-27 12:47:16,876 INFO L290 TraceCheckUtils]: 7: Hoare triple {243#true} ~cond := #in~cond; {243#true} is VALID [2022-04-27 12:47:16,876 INFO L272 TraceCheckUtils]: 6: Hoare triple {243#true} call assume_abort_if_not((if ~A~0 % 4294967296 >= 0 && ~A~0 % 4294967296 <= 1 then 1 else 0)); {243#true} is VALID [2022-04-27 12:47:16,876 INFO L290 TraceCheckUtils]: 5: Hoare triple {243#true} havoc ~A~0;havoc ~B~0;havoc ~q~0;havoc ~r~0;havoc ~b~0;~A~0 := #t~nondet1;havoc #t~nondet1; {243#true} is VALID [2022-04-27 12:47:16,876 INFO L272 TraceCheckUtils]: 4: Hoare triple {243#true} call #t~ret3 := main(); {243#true} is VALID [2022-04-27 12:47:16,876 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {243#true} {243#true} #94#return; {243#true} is VALID [2022-04-27 12:47:16,876 INFO L290 TraceCheckUtils]: 2: Hoare triple {243#true} assume true; {243#true} is VALID [2022-04-27 12:47:16,876 INFO L290 TraceCheckUtils]: 1: Hoare triple {243#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); {243#true} is VALID [2022-04-27 12:47:16,876 INFO L272 TraceCheckUtils]: 0: Hoare triple {243#true} call ULTIMATE.init(); {243#true} is VALID [2022-04-27 12:47:16,877 INFO L134 CoverageAnalysis]: Checked inductivity of 24 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 24 trivial. 0 not checked. [2022-04-27 12:47:16,877 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-27 12:47:16,877 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [865955508] [2022-04-27 12:47:16,877 WARN L310 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2022-04-27 12:47:16,877 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1737138441] [2022-04-27 12:47:16,877 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1737138441] provided 1 perfect and 1 imperfect interpolant sequences [2022-04-27 12:47:16,877 INFO L184 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2022-04-27 12:47:16,878 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [9] total 11 [2022-04-27 12:47:16,878 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [777896043] [2022-04-27 12:47:16,878 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-27 12:47:16,879 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 2.3333333333333335) internal successors, (14), 5 states have internal predecessors, (14), 2 states have call successors, (7), 2 states have call predecessors, (7), 1 states have return successors, (5), 1 states have call predecessors, (5), 1 states have call successors, (5) Word has length 35 [2022-04-27 12:47:16,879 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-27 12:47:16,879 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with has 6 states, 6 states have (on average 2.3333333333333335) internal successors, (14), 5 states have internal predecessors, (14), 2 states have call successors, (7), 2 states have call predecessors, (7), 1 states have return successors, (5), 1 states have call predecessors, (5), 1 states have call successors, (5) [2022-04-27 12:47:16,899 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 26 edges. 26 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-27 12:47:16,899 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2022-04-27 12:47:16,899 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-04-27 12:47:16,900 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2022-04-27 12:47:16,900 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=25, Invalid=85, Unknown=0, NotChecked=0, Total=110 [2022-04-27 12:47:16,900 INFO L87 Difference]: Start difference. First operand 29 states and 35 transitions. Second operand has 6 states, 6 states have (on average 2.3333333333333335) internal successors, (14), 5 states have internal predecessors, (14), 2 states have call successors, (7), 2 states have call predecessors, (7), 1 states have return successors, (5), 1 states have call predecessors, (5), 1 states have call successors, (5) [2022-04-27 12:47:18,361 WARN L534 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.37s for a HTC check with result INVALID. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=true, quantifiers [] [2022-04-27 12:47:20,762 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-27 12:47:20,762 INFO L93 Difference]: Finished difference Result 41 states and 49 transitions. [2022-04-27 12:47:20,762 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-04-27 12:47:20,763 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 2.3333333333333335) internal successors, (14), 5 states have internal predecessors, (14), 2 states have call successors, (7), 2 states have call predecessors, (7), 1 states have return successors, (5), 1 states have call predecessors, (5), 1 states have call successors, (5) Word has length 35 [2022-04-27 12:47:20,763 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-27 12:47:20,763 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 6 states, 6 states have (on average 2.3333333333333335) internal successors, (14), 5 states have internal predecessors, (14), 2 states have call successors, (7), 2 states have call predecessors, (7), 1 states have return successors, (5), 1 states have call predecessors, (5), 1 states have call successors, (5) [2022-04-27 12:47:20,764 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 49 transitions. [2022-04-27 12:47:20,764 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 6 states, 6 states have (on average 2.3333333333333335) internal successors, (14), 5 states have internal predecessors, (14), 2 states have call successors, (7), 2 states have call predecessors, (7), 1 states have return successors, (5), 1 states have call predecessors, (5), 1 states have call successors, (5) [2022-04-27 12:47:20,765 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 49 transitions. [2022-04-27 12:47:20,765 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 5 states and 49 transitions. [2022-04-27 12:47:20,856 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 49 edges. 49 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-27 12:47:20,858 INFO L225 Difference]: With dead ends: 41 [2022-04-27 12:47:20,858 INFO L226 Difference]: Without dead ends: 38 [2022-04-27 12:47:20,859 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 70 GetRequests, 59 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-27 12:47:20,860 INFO L413 NwaCegarLoop]: 29 mSDtfsCounter, 10 mSDsluCounter, 76 mSDsCounter, 0 mSdLazyCounter, 37 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.6s Time, 0 mProtectedPredicate, 0 mProtectedAction, 11 SdHoareTripleChecker+Valid, 105 SdHoareTripleChecker+Invalid, 40 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 37 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.6s IncrementalHoareTripleChecker+Time [2022-04-27 12:47:20,860 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [11 Valid, 105 Invalid, 40 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 37 Invalid, 0 Unknown, 0 Unchecked, 1.6s Time] [2022-04-27 12:47:20,861 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 38 states. [2022-04-27 12:47:20,865 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 38 to 38. [2022-04-27 12:47:20,865 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-27 12:47:20,865 INFO L82 GeneralOperation]: Start isEquivalent. First operand 38 states. Second operand has 38 states, 24 states have (on average 1.2083333333333333) internal successors, (29), 25 states have internal predecessors, (29), 9 states have call successors, (9), 5 states have call predecessors, (9), 4 states have return successors, (7), 7 states have call predecessors, (7), 7 states have call successors, (7) [2022-04-27 12:47:20,865 INFO L74 IsIncluded]: Start isIncluded. First operand 38 states. Second operand has 38 states, 24 states have (on average 1.2083333333333333) internal successors, (29), 25 states have internal predecessors, (29), 9 states have call successors, (9), 5 states have call predecessors, (9), 4 states have return successors, (7), 7 states have call predecessors, (7), 7 states have call successors, (7) [2022-04-27 12:47:20,866 INFO L87 Difference]: Start difference. First operand 38 states. Second operand has 38 states, 24 states have (on average 1.2083333333333333) internal successors, (29), 25 states have internal predecessors, (29), 9 states have call successors, (9), 5 states have call predecessors, (9), 4 states have return successors, (7), 7 states have call predecessors, (7), 7 states have call successors, (7) [2022-04-27 12:47:20,867 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-27 12:47:20,867 INFO L93 Difference]: Finished difference Result 38 states and 45 transitions. [2022-04-27 12:47:20,867 INFO L276 IsEmpty]: Start isEmpty. Operand 38 states and 45 transitions. [2022-04-27 12:47:20,868 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-27 12:47:20,868 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-27 12:47:20,868 INFO L74 IsIncluded]: Start isIncluded. First operand has 38 states, 24 states have (on average 1.2083333333333333) internal successors, (29), 25 states have internal predecessors, (29), 9 states have call successors, (9), 5 states have call predecessors, (9), 4 states have return successors, (7), 7 states have call predecessors, (7), 7 states have call successors, (7) Second operand 38 states. [2022-04-27 12:47:20,868 INFO L87 Difference]: Start difference. First operand has 38 states, 24 states have (on average 1.2083333333333333) internal successors, (29), 25 states have internal predecessors, (29), 9 states have call successors, (9), 5 states have call predecessors, (9), 4 states have return successors, (7), 7 states have call predecessors, (7), 7 states have call successors, (7) Second operand 38 states. [2022-04-27 12:47:20,870 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-27 12:47:20,870 INFO L93 Difference]: Finished difference Result 38 states and 45 transitions. [2022-04-27 12:47:20,870 INFO L276 IsEmpty]: Start isEmpty. Operand 38 states and 45 transitions. [2022-04-27 12:47:20,871 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-27 12:47:20,871 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-27 12:47:20,871 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-27 12:47:20,871 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-27 12:47:20,871 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 38 states, 24 states have (on average 1.2083333333333333) internal successors, (29), 25 states have internal predecessors, (29), 9 states have call successors, (9), 5 states have call predecessors, (9), 4 states have return successors, (7), 7 states have call predecessors, (7), 7 states have call successors, (7) [2022-04-27 12:47:20,872 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 38 states to 38 states and 45 transitions. [2022-04-27 12:47:20,873 INFO L78 Accepts]: Start accepts. Automaton has 38 states and 45 transitions. Word has length 35 [2022-04-27 12:47:20,873 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-27 12:47:20,873 INFO L495 AbstractCegarLoop]: Abstraction has 38 states and 45 transitions. [2022-04-27 12:47:20,873 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 2.3333333333333335) internal successors, (14), 5 states have internal predecessors, (14), 2 states have call successors, (7), 2 states have call predecessors, (7), 1 states have return successors, (5), 1 states have call predecessors, (5), 1 states have call successors, (5) [2022-04-27 12:47:20,873 INFO L276 IsEmpty]: Start isEmpty. Operand 38 states and 45 transitions. [2022-04-27 12:47:20,874 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 38 [2022-04-27 12:47:20,874 INFO L187 NwaCegarLoop]: Found error trace [2022-04-27 12:47:20,874 INFO L195 NwaCegarLoop]: trace histogram [4, 4, 4, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-27 12:47:20,895 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Forceful destruction successful, exit code 0 [2022-04-27 12:47:21,092 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1,2 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-27 12:47:21,092 INFO L420 AbstractCegarLoop]: === Iteration 3 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-27 12:47:21,093 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-27 12:47:21,093 INFO L85 PathProgramCache]: Analyzing trace with hash 397552474, now seen corresponding path program 1 times [2022-04-27 12:47:21,093 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-27 12:47:21,093 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1968801260] [2022-04-27 12:47:21,093 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-27 12:47:21,093 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-27 12:47:21,107 ERROR L245 FreeRefinementEngine]: Caught known exception: Unsupported non-linear arithmetic [2022-04-27 12:47:21,108 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [1625627167] [2022-04-27 12:47:21,108 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-27 12:47:21,108 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-27 12:47:21,108 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-04-27 12:47:21,109 INFO L229 MonitoredProcess]: Starting monitored process 3 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-04-27 12:47:21,110 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Waiting until timeout for monitored process [2022-04-27 12:47:21,156 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-27 12:47:21,157 INFO L263 TraceCheckSpWp]: Trace formula consists of 97 conjuncts, 12 conjunts are in the unsatisfiable core [2022-04-27 12:47:21,170 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-27 12:47:21,172 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-04-27 12:47:21,749 INFO L272 TraceCheckUtils]: 0: Hoare triple {653#true} call ULTIMATE.init(); {653#true} is VALID [2022-04-27 12:47:21,750 INFO L290 TraceCheckUtils]: 1: Hoare triple {653#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); {653#true} is VALID [2022-04-27 12:47:21,755 INFO L290 TraceCheckUtils]: 2: Hoare triple {653#true} assume true; {653#true} is VALID [2022-04-27 12:47:21,755 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {653#true} {653#true} #94#return; {653#true} is VALID [2022-04-27 12:47:21,755 INFO L272 TraceCheckUtils]: 4: Hoare triple {653#true} call #t~ret3 := main(); {653#true} is VALID [2022-04-27 12:47:21,756 INFO L290 TraceCheckUtils]: 5: Hoare triple {653#true} havoc ~A~0;havoc ~B~0;havoc ~q~0;havoc ~r~0;havoc ~b~0;~A~0 := #t~nondet1;havoc #t~nondet1; {653#true} is VALID [2022-04-27 12:47:21,756 INFO L272 TraceCheckUtils]: 6: Hoare triple {653#true} call assume_abort_if_not((if ~A~0 % 4294967296 >= 0 && ~A~0 % 4294967296 <= 1 then 1 else 0)); {653#true} is VALID [2022-04-27 12:47:21,760 INFO L290 TraceCheckUtils]: 7: Hoare triple {653#true} ~cond := #in~cond; {679#(= assume_abort_if_not_~cond |assume_abort_if_not_#in~cond|)} is VALID [2022-04-27 12:47:21,761 INFO L290 TraceCheckUtils]: 8: Hoare triple {679#(= assume_abort_if_not_~cond |assume_abort_if_not_#in~cond|)} assume !(0 == ~cond); {683#(not (= |assume_abort_if_not_#in~cond| 0))} is VALID [2022-04-27 12:47:21,761 INFO L290 TraceCheckUtils]: 9: Hoare triple {683#(not (= |assume_abort_if_not_#in~cond| 0))} assume true; {683#(not (= |assume_abort_if_not_#in~cond| 0))} is VALID [2022-04-27 12:47:21,762 INFO L284 TraceCheckUtils]: 10: Hoare quadruple {683#(not (= |assume_abort_if_not_#in~cond| 0))} {653#true} #82#return; {690#(<= (mod main_~A~0 4294967296) 1)} is VALID [2022-04-27 12:47:21,762 INFO L290 TraceCheckUtils]: 11: Hoare triple {690#(<= (mod main_~A~0 4294967296) 1)} ~B~0 := #t~nondet2;havoc #t~nondet2; {690#(<= (mod main_~A~0 4294967296) 1)} is VALID [2022-04-27 12:47:21,762 INFO L272 TraceCheckUtils]: 12: Hoare triple {690#(<= (mod main_~A~0 4294967296) 1)} call assume_abort_if_not((if ~B~0 % 4294967296 >= 0 && ~B~0 % 4294967296 <= 1 then 1 else 0)); {653#true} is VALID [2022-04-27 12:47:21,762 INFO L290 TraceCheckUtils]: 13: Hoare triple {653#true} ~cond := #in~cond; {653#true} is VALID [2022-04-27 12:47:21,763 INFO L290 TraceCheckUtils]: 14: Hoare triple {653#true} assume !(0 == ~cond); {653#true} is VALID [2022-04-27 12:47:21,763 INFO L290 TraceCheckUtils]: 15: Hoare triple {653#true} assume true; {653#true} is VALID [2022-04-27 12:47:21,763 INFO L284 TraceCheckUtils]: 16: Hoare quadruple {653#true} {690#(<= (mod main_~A~0 4294967296) 1)} #84#return; {690#(<= (mod main_~A~0 4294967296) 1)} is VALID [2022-04-27 12:47:21,763 INFO L272 TraceCheckUtils]: 17: Hoare triple {690#(<= (mod main_~A~0 4294967296) 1)} call assume_abort_if_not((if ~B~0 % 4294967296 < 2147483647 then 1 else 0)); {653#true} is VALID [2022-04-27 12:47:21,763 INFO L290 TraceCheckUtils]: 18: Hoare triple {653#true} ~cond := #in~cond; {653#true} is VALID [2022-04-27 12:47:21,763 INFO L290 TraceCheckUtils]: 19: Hoare triple {653#true} assume !(0 == ~cond); {653#true} is VALID [2022-04-27 12:47:21,764 INFO L290 TraceCheckUtils]: 20: Hoare triple {653#true} assume true; {653#true} is VALID [2022-04-27 12:47:21,764 INFO L284 TraceCheckUtils]: 21: Hoare quadruple {653#true} {690#(<= (mod main_~A~0 4294967296) 1)} #86#return; {690#(<= (mod main_~A~0 4294967296) 1)} is VALID [2022-04-27 12:47:21,764 INFO L272 TraceCheckUtils]: 22: Hoare triple {690#(<= (mod main_~A~0 4294967296) 1)} call assume_abort_if_not((if ~B~0 % 4294967296 >= 1 then 1 else 0)); {653#true} is VALID [2022-04-27 12:47:21,764 INFO L290 TraceCheckUtils]: 23: Hoare triple {653#true} ~cond := #in~cond; {653#true} is VALID [2022-04-27 12:47:21,764 INFO L290 TraceCheckUtils]: 24: Hoare triple {653#true} assume !(0 == ~cond); {653#true} is VALID [2022-04-27 12:47:21,764 INFO L290 TraceCheckUtils]: 25: Hoare triple {653#true} assume true; {653#true} is VALID [2022-04-27 12:47:21,767 INFO L284 TraceCheckUtils]: 26: Hoare quadruple {653#true} {690#(<= (mod main_~A~0 4294967296) 1)} #88#return; {690#(<= (mod main_~A~0 4294967296) 1)} is VALID [2022-04-27 12:47:21,768 INFO L290 TraceCheckUtils]: 27: Hoare triple {690#(<= (mod main_~A~0 4294967296) 1)} ~q~0 := 0;~r~0 := ~A~0;~b~0 := ~B~0; {742#(and (= main_~A~0 main_~r~0) (<= (mod main_~A~0 4294967296) 1) (= main_~q~0 0))} is VALID [2022-04-27 12:47:21,768 INFO L290 TraceCheckUtils]: 28: Hoare triple {742#(and (= main_~A~0 main_~r~0) (<= (mod main_~A~0 4294967296) 1) (= main_~q~0 0))} assume !false; {742#(and (= main_~A~0 main_~r~0) (<= (mod main_~A~0 4294967296) 1) (= main_~q~0 0))} is VALID [2022-04-27 12:47:21,770 INFO L290 TraceCheckUtils]: 29: Hoare triple {742#(and (= main_~A~0 main_~r~0) (<= (mod main_~A~0 4294967296) 1) (= main_~q~0 0))} assume !!(~r~0 % 4294967296 >= ~b~0 % 4294967296);~b~0 := 2 * ~b~0; {742#(and (= main_~A~0 main_~r~0) (<= (mod main_~A~0 4294967296) 1) (= main_~q~0 0))} is VALID [2022-04-27 12:47:21,771 INFO L290 TraceCheckUtils]: 30: Hoare triple {742#(and (= main_~A~0 main_~r~0) (<= (mod main_~A~0 4294967296) 1) (= main_~q~0 0))} assume !false; {742#(and (= main_~A~0 main_~r~0) (<= (mod main_~A~0 4294967296) 1) (= main_~q~0 0))} is VALID [2022-04-27 12:47:21,771 INFO L290 TraceCheckUtils]: 31: Hoare triple {742#(and (= main_~A~0 main_~r~0) (<= (mod main_~A~0 4294967296) 1) (= main_~q~0 0))} assume !(~r~0 % 4294967296 >= ~b~0 % 4294967296); {742#(and (= main_~A~0 main_~r~0) (<= (mod main_~A~0 4294967296) 1) (= main_~q~0 0))} is VALID [2022-04-27 12:47:21,771 INFO L290 TraceCheckUtils]: 32: Hoare triple {742#(and (= main_~A~0 main_~r~0) (<= (mod main_~A~0 4294967296) 1) (= main_~q~0 0))} assume !false; {742#(and (= main_~A~0 main_~r~0) (<= (mod main_~A~0 4294967296) 1) (= main_~q~0 0))} is VALID [2022-04-27 12:47:21,772 INFO L272 TraceCheckUtils]: 33: Hoare triple {742#(and (= main_~A~0 main_~r~0) (<= (mod main_~A~0 4294967296) 1) (= main_~q~0 0))} call __VERIFIER_assert((if ~A~0 % 4294967296 == (~q~0 * ~b~0 + ~r~0) % 4294967296 then 1 else 0)); {761#(<= 1 |__VERIFIER_assert_#in~cond|)} is VALID [2022-04-27 12:47:21,772 INFO L290 TraceCheckUtils]: 34: Hoare triple {761#(<= 1 |__VERIFIER_assert_#in~cond|)} ~cond := #in~cond; {765#(<= 1 __VERIFIER_assert_~cond)} is VALID [2022-04-27 12:47:21,773 INFO L290 TraceCheckUtils]: 35: Hoare triple {765#(<= 1 __VERIFIER_assert_~cond)} assume 0 == ~cond; {654#false} is VALID [2022-04-27 12:47:21,773 INFO L290 TraceCheckUtils]: 36: Hoare triple {654#false} assume !false; {654#false} is VALID [2022-04-27 12:47:21,773 INFO L134 CoverageAnalysis]: Checked inductivity of 26 backedges. 0 proven. 9 refuted. 0 times theorem prover too weak. 17 trivial. 0 not checked. [2022-04-27 12:47:21,773 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-04-27 12:47:22,221 INFO L290 TraceCheckUtils]: 36: Hoare triple {654#false} assume !false; {654#false} is VALID [2022-04-27 12:47:22,222 INFO L290 TraceCheckUtils]: 35: Hoare triple {765#(<= 1 __VERIFIER_assert_~cond)} assume 0 == ~cond; {654#false} is VALID [2022-04-27 12:47:22,222 INFO L290 TraceCheckUtils]: 34: Hoare triple {761#(<= 1 |__VERIFIER_assert_#in~cond|)} ~cond := #in~cond; {765#(<= 1 __VERIFIER_assert_~cond)} is VALID [2022-04-27 12:47:22,224 INFO L272 TraceCheckUtils]: 33: Hoare triple {781#(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)); {761#(<= 1 |__VERIFIER_assert_#in~cond|)} is VALID [2022-04-27 12:47:22,224 INFO L290 TraceCheckUtils]: 32: Hoare triple {781#(forall ((main_~b~0 Int)) (= (mod main_~A~0 4294967296) (mod (+ main_~r~0 (* main_~b~0 main_~q~0)) 4294967296)))} assume !false; {781#(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-27 12:47:22,225 INFO L290 TraceCheckUtils]: 31: Hoare triple {781#(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); {781#(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-27 12:47:22,225 INFO L290 TraceCheckUtils]: 30: Hoare triple {781#(forall ((main_~b~0 Int)) (= (mod main_~A~0 4294967296) (mod (+ main_~r~0 (* main_~b~0 main_~q~0)) 4294967296)))} assume !false; {781#(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-27 12:47:22,226 INFO L290 TraceCheckUtils]: 29: Hoare triple {781#(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; {781#(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-27 12:47:22,227 INFO L290 TraceCheckUtils]: 28: Hoare triple {781#(forall ((main_~b~0 Int)) (= (mod main_~A~0 4294967296) (mod (+ main_~r~0 (* main_~b~0 main_~q~0)) 4294967296)))} assume !false; {781#(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-27 12:47:22,227 INFO L290 TraceCheckUtils]: 27: Hoare triple {653#true} ~q~0 := 0;~r~0 := ~A~0;~b~0 := ~B~0; {781#(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-27 12:47:22,227 INFO L284 TraceCheckUtils]: 26: Hoare quadruple {653#true} {653#true} #88#return; {653#true} is VALID [2022-04-27 12:47:22,227 INFO L290 TraceCheckUtils]: 25: Hoare triple {653#true} assume true; {653#true} is VALID [2022-04-27 12:47:22,227 INFO L290 TraceCheckUtils]: 24: Hoare triple {653#true} assume !(0 == ~cond); {653#true} is VALID [2022-04-27 12:47:22,227 INFO L290 TraceCheckUtils]: 23: Hoare triple {653#true} ~cond := #in~cond; {653#true} is VALID [2022-04-27 12:47:22,228 INFO L272 TraceCheckUtils]: 22: Hoare triple {653#true} call assume_abort_if_not((if ~B~0 % 4294967296 >= 1 then 1 else 0)); {653#true} is VALID [2022-04-27 12:47:22,228 INFO L284 TraceCheckUtils]: 21: Hoare quadruple {653#true} {653#true} #86#return; {653#true} is VALID [2022-04-27 12:47:22,228 INFO L290 TraceCheckUtils]: 20: Hoare triple {653#true} assume true; {653#true} is VALID [2022-04-27 12:47:22,228 INFO L290 TraceCheckUtils]: 19: Hoare triple {653#true} assume !(0 == ~cond); {653#true} is VALID [2022-04-27 12:47:22,228 INFO L290 TraceCheckUtils]: 18: Hoare triple {653#true} ~cond := #in~cond; {653#true} is VALID [2022-04-27 12:47:22,228 INFO L272 TraceCheckUtils]: 17: Hoare triple {653#true} call assume_abort_if_not((if ~B~0 % 4294967296 < 2147483647 then 1 else 0)); {653#true} is VALID [2022-04-27 12:47:22,228 INFO L284 TraceCheckUtils]: 16: Hoare quadruple {653#true} {653#true} #84#return; {653#true} is VALID [2022-04-27 12:47:22,228 INFO L290 TraceCheckUtils]: 15: Hoare triple {653#true} assume true; {653#true} is VALID [2022-04-27 12:47:22,228 INFO L290 TraceCheckUtils]: 14: Hoare triple {653#true} assume !(0 == ~cond); {653#true} is VALID [2022-04-27 12:47:22,228 INFO L290 TraceCheckUtils]: 13: Hoare triple {653#true} ~cond := #in~cond; {653#true} is VALID [2022-04-27 12:47:22,228 INFO L272 TraceCheckUtils]: 12: Hoare triple {653#true} call assume_abort_if_not((if ~B~0 % 4294967296 >= 0 && ~B~0 % 4294967296 <= 1 then 1 else 0)); {653#true} is VALID [2022-04-27 12:47:22,228 INFO L290 TraceCheckUtils]: 11: Hoare triple {653#true} ~B~0 := #t~nondet2;havoc #t~nondet2; {653#true} is VALID [2022-04-27 12:47:22,228 INFO L284 TraceCheckUtils]: 10: Hoare quadruple {653#true} {653#true} #82#return; {653#true} is VALID [2022-04-27 12:47:22,229 INFO L290 TraceCheckUtils]: 9: Hoare triple {653#true} assume true; {653#true} is VALID [2022-04-27 12:47:22,229 INFO L290 TraceCheckUtils]: 8: Hoare triple {653#true} assume !(0 == ~cond); {653#true} is VALID [2022-04-27 12:47:22,229 INFO L290 TraceCheckUtils]: 7: Hoare triple {653#true} ~cond := #in~cond; {653#true} is VALID [2022-04-27 12:47:22,229 INFO L272 TraceCheckUtils]: 6: Hoare triple {653#true} call assume_abort_if_not((if ~A~0 % 4294967296 >= 0 && ~A~0 % 4294967296 <= 1 then 1 else 0)); {653#true} is VALID [2022-04-27 12:47:22,229 INFO L290 TraceCheckUtils]: 5: Hoare triple {653#true} havoc ~A~0;havoc ~B~0;havoc ~q~0;havoc ~r~0;havoc ~b~0;~A~0 := #t~nondet1;havoc #t~nondet1; {653#true} is VALID [2022-04-27 12:47:22,229 INFO L272 TraceCheckUtils]: 4: Hoare triple {653#true} call #t~ret3 := main(); {653#true} is VALID [2022-04-27 12:47:22,229 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {653#true} {653#true} #94#return; {653#true} is VALID [2022-04-27 12:47:22,229 INFO L290 TraceCheckUtils]: 2: Hoare triple {653#true} assume true; {653#true} is VALID [2022-04-27 12:47:22,229 INFO L290 TraceCheckUtils]: 1: Hoare triple {653#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); {653#true} is VALID [2022-04-27 12:47:22,229 INFO L272 TraceCheckUtils]: 0: Hoare triple {653#true} call ULTIMATE.init(); {653#true} is VALID [2022-04-27 12:47:22,229 INFO L134 CoverageAnalysis]: Checked inductivity of 26 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 26 trivial. 0 not checked. [2022-04-27 12:47:22,230 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-27 12:47:22,230 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1968801260] [2022-04-27 12:47:22,230 WARN L310 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2022-04-27 12:47:22,230 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1625627167] [2022-04-27 12:47:22,230 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1625627167] provided 1 perfect and 1 imperfect interpolant sequences [2022-04-27 12:47:22,230 INFO L184 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2022-04-27 12:47:22,230 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [8] total 9 [2022-04-27 12:47:22,230 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [131097405] [2022-04-27 12:47:22,230 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-27 12:47:22,231 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), 2 states have call successors, (7), 2 states have call predecessors, (7), 1 states have return successors, (5), 1 states have call predecessors, (5), 1 states have call successors, (5) Word has length 37 [2022-04-27 12:47:22,231 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-27 12:47:22,231 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), 2 states have call successors, (7), 2 states have call predecessors, (7), 1 states have return successors, (5), 1 states have call predecessors, (5), 1 states have call successors, (5) [2022-04-27 12:47:24,279 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 27 edges. 26 inductive. 0 not inductive. 1 times theorem prover too weak to decide inductivity. [2022-04-27 12:47:24,279 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-04-27 12:47:24,279 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-04-27 12:47:24,280 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-04-27 12:47:24,280 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=55, Unknown=0, NotChecked=0, Total=72 [2022-04-27 12:47:24,280 INFO L87 Difference]: Start difference. First operand 38 states and 45 transitions. Second operand has 5 states, 5 states have (on average 3.0) internal successors, (15), 4 states have internal predecessors, (15), 2 states have call successors, (7), 2 states have call predecessors, (7), 1 states have return successors, (5), 1 states have call predecessors, (5), 1 states have call successors, (5) [2022-04-27 12:47:24,410 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-27 12:47:24,411 INFO L93 Difference]: Finished difference Result 46 states and 53 transitions. [2022-04-27 12:47:24,411 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-04-27 12:47:24,411 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), 2 states have call successors, (7), 2 states have call predecessors, (7), 1 states have return successors, (5), 1 states have call predecessors, (5), 1 states have call successors, (5) Word has length 37 [2022-04-27 12:47:24,411 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-27 12:47:24,411 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), 2 states have call successors, (7), 2 states have call predecessors, (7), 1 states have return successors, (5), 1 states have call predecessors, (5), 1 states have call successors, (5) [2022-04-27 12:47:24,412 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 43 transitions. [2022-04-27 12:47:24,413 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), 2 states have call successors, (7), 2 states have call predecessors, (7), 1 states have return successors, (5), 1 states have call predecessors, (5), 1 states have call successors, (5) [2022-04-27 12:47:24,414 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 43 transitions. [2022-04-27 12:47:24,414 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 5 states and 43 transitions. [2022-04-27 12:47:25,089 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-27 12:47:25,091 INFO L225 Difference]: With dead ends: 46 [2022-04-27 12:47:25,091 INFO L226 Difference]: Without dead ends: 44 [2022-04-27 12:47:25,091 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 74 GetRequests, 65 SyntacticMatches, 1 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=21, Invalid=69, Unknown=0, NotChecked=0, Total=90 [2022-04-27 12:47:25,092 INFO L413 NwaCegarLoop]: 31 mSDtfsCounter, 5 mSDsluCounter, 83 mSDsCounter, 0 mSdLazyCounter, 8 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 5 SdHoareTripleChecker+Valid, 114 SdHoareTripleChecker+Invalid, 22 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 8 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 14 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-04-27 12:47:25,092 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [5 Valid, 114 Invalid, 22 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 8 Invalid, 0 Unknown, 14 Unchecked, 0.0s Time] [2022-04-27 12:47:25,093 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 44 states. [2022-04-27 12:47:25,098 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 44 to 44. [2022-04-27 12:47:25,098 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-27 12:47:25,098 INFO L82 GeneralOperation]: Start isEquivalent. First operand 44 states. Second operand has 44 states, 28 states have (on average 1.1785714285714286) internal successors, (33), 30 states have internal predecessors, (33), 10 states have call successors, (10), 6 states have call predecessors, (10), 5 states have return successors, (8), 7 states have call predecessors, (8), 8 states have call successors, (8) [2022-04-27 12:47:25,105 INFO L74 IsIncluded]: Start isIncluded. First operand 44 states. Second operand has 44 states, 28 states have (on average 1.1785714285714286) internal successors, (33), 30 states have internal predecessors, (33), 10 states have call successors, (10), 6 states have call predecessors, (10), 5 states have return successors, (8), 7 states have call predecessors, (8), 8 states have call successors, (8) [2022-04-27 12:47:25,106 INFO L87 Difference]: Start difference. First operand 44 states. Second operand has 44 states, 28 states have (on average 1.1785714285714286) internal successors, (33), 30 states have internal predecessors, (33), 10 states have call successors, (10), 6 states have call predecessors, (10), 5 states have return successors, (8), 7 states have call predecessors, (8), 8 states have call successors, (8) [2022-04-27 12:47:25,115 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-27 12:47:25,115 INFO L93 Difference]: Finished difference Result 44 states and 51 transitions. [2022-04-27 12:47:25,115 INFO L276 IsEmpty]: Start isEmpty. Operand 44 states and 51 transitions. [2022-04-27 12:47:25,116 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-27 12:47:25,116 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-27 12:47:25,116 INFO L74 IsIncluded]: Start isIncluded. First operand has 44 states, 28 states have (on average 1.1785714285714286) internal successors, (33), 30 states have internal predecessors, (33), 10 states have call successors, (10), 6 states have call predecessors, (10), 5 states have return successors, (8), 7 states have call predecessors, (8), 8 states have call successors, (8) Second operand 44 states. [2022-04-27 12:47:25,116 INFO L87 Difference]: Start difference. First operand has 44 states, 28 states have (on average 1.1785714285714286) internal successors, (33), 30 states have internal predecessors, (33), 10 states have call successors, (10), 6 states have call predecessors, (10), 5 states have return successors, (8), 7 states have call predecessors, (8), 8 states have call successors, (8) Second operand 44 states. [2022-04-27 12:47:25,118 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-27 12:47:25,118 INFO L93 Difference]: Finished difference Result 44 states and 51 transitions. [2022-04-27 12:47:25,118 INFO L276 IsEmpty]: Start isEmpty. Operand 44 states and 51 transitions. [2022-04-27 12:47:25,118 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-27 12:47:25,118 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-27 12:47:25,118 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-27 12:47:25,118 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-27 12:47:25,119 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 44 states, 28 states have (on average 1.1785714285714286) internal successors, (33), 30 states have internal predecessors, (33), 10 states have call successors, (10), 6 states have call predecessors, (10), 5 states have return successors, (8), 7 states have call predecessors, (8), 8 states have call successors, (8) [2022-04-27 12:47:25,120 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 44 states to 44 states and 51 transitions. [2022-04-27 12:47:25,120 INFO L78 Accepts]: Start accepts. Automaton has 44 states and 51 transitions. Word has length 37 [2022-04-27 12:47:25,120 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-27 12:47:25,120 INFO L495 AbstractCegarLoop]: Abstraction has 44 states and 51 transitions. [2022-04-27 12:47:25,121 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 3.0) internal successors, (15), 4 states have internal predecessors, (15), 2 states have call successors, (7), 2 states have call predecessors, (7), 1 states have return successors, (5), 1 states have call predecessors, (5), 1 states have call successors, (5) [2022-04-27 12:47:25,121 INFO L276 IsEmpty]: Start isEmpty. Operand 44 states and 51 transitions. [2022-04-27 12:47:25,121 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 44 [2022-04-27 12:47:25,121 INFO L187 NwaCegarLoop]: Found error trace [2022-04-27 12:47:25,121 INFO L195 NwaCegarLoop]: trace histogram [4, 4, 4, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-27 12:47:25,141 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Ended with exit code 0 [2022-04-27 12:47:25,322 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 3 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable2 [2022-04-27 12:47:25,322 INFO L420 AbstractCegarLoop]: === Iteration 4 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-27 12:47:25,323 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-27 12:47:25,323 INFO L85 PathProgramCache]: Analyzing trace with hash -382866049, now seen corresponding path program 1 times [2022-04-27 12:47:25,323 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-27 12:47:25,323 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [790375690] [2022-04-27 12:47:25,323 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-27 12:47:25,323 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-27 12:47:25,343 ERROR L245 FreeRefinementEngine]: Caught known exception: Unsupported non-linear arithmetic [2022-04-27 12:47:25,344 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [942751587] [2022-04-27 12:47:25,344 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-27 12:47:25,344 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-27 12:47:25,344 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-04-27 12:47:25,348 INFO L229 MonitoredProcess]: Starting monitored process 4 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-04-27 12:47:25,349 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Waiting until timeout for monitored process [2022-04-27 12:47:25,392 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-27 12:47:25,393 INFO L263 TraceCheckSpWp]: Trace formula consists of 113 conjuncts, 3 conjunts are in the unsatisfiable core [2022-04-27 12:47:25,400 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-27 12:47:25,401 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-04-27 12:47:25,488 INFO L272 TraceCheckUtils]: 0: Hoare triple {1099#true} call ULTIMATE.init(); {1099#true} is VALID [2022-04-27 12:47:25,488 INFO L290 TraceCheckUtils]: 1: Hoare triple {1099#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); {1099#true} is VALID [2022-04-27 12:47:25,488 INFO L290 TraceCheckUtils]: 2: Hoare triple {1099#true} assume true; {1099#true} is VALID [2022-04-27 12:47:25,488 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {1099#true} {1099#true} #94#return; {1099#true} is VALID [2022-04-27 12:47:25,488 INFO L272 TraceCheckUtils]: 4: Hoare triple {1099#true} call #t~ret3 := main(); {1099#true} is VALID [2022-04-27 12:47:25,489 INFO L290 TraceCheckUtils]: 5: Hoare triple {1099#true} havoc ~A~0;havoc ~B~0;havoc ~q~0;havoc ~r~0;havoc ~b~0;~A~0 := #t~nondet1;havoc #t~nondet1; {1099#true} is VALID [2022-04-27 12:47:25,489 INFO L272 TraceCheckUtils]: 6: Hoare triple {1099#true} call assume_abort_if_not((if ~A~0 % 4294967296 >= 0 && ~A~0 % 4294967296 <= 1 then 1 else 0)); {1099#true} is VALID [2022-04-27 12:47:25,489 INFO L290 TraceCheckUtils]: 7: Hoare triple {1099#true} ~cond := #in~cond; {1099#true} is VALID [2022-04-27 12:47:25,489 INFO L290 TraceCheckUtils]: 8: Hoare triple {1099#true} assume !(0 == ~cond); {1099#true} is VALID [2022-04-27 12:47:25,489 INFO L290 TraceCheckUtils]: 9: Hoare triple {1099#true} assume true; {1099#true} is VALID [2022-04-27 12:47:25,489 INFO L284 TraceCheckUtils]: 10: Hoare quadruple {1099#true} {1099#true} #82#return; {1099#true} is VALID [2022-04-27 12:47:25,489 INFO L290 TraceCheckUtils]: 11: Hoare triple {1099#true} ~B~0 := #t~nondet2;havoc #t~nondet2; {1099#true} is VALID [2022-04-27 12:47:25,489 INFO L272 TraceCheckUtils]: 12: Hoare triple {1099#true} call assume_abort_if_not((if ~B~0 % 4294967296 >= 0 && ~B~0 % 4294967296 <= 1 then 1 else 0)); {1099#true} is VALID [2022-04-27 12:47:25,489 INFO L290 TraceCheckUtils]: 13: Hoare triple {1099#true} ~cond := #in~cond; {1099#true} is VALID [2022-04-27 12:47:25,489 INFO L290 TraceCheckUtils]: 14: Hoare triple {1099#true} assume !(0 == ~cond); {1099#true} is VALID [2022-04-27 12:47:25,489 INFO L290 TraceCheckUtils]: 15: Hoare triple {1099#true} assume true; {1099#true} is VALID [2022-04-27 12:47:25,489 INFO L284 TraceCheckUtils]: 16: Hoare quadruple {1099#true} {1099#true} #84#return; {1099#true} is VALID [2022-04-27 12:47:25,489 INFO L272 TraceCheckUtils]: 17: Hoare triple {1099#true} call assume_abort_if_not((if ~B~0 % 4294967296 < 2147483647 then 1 else 0)); {1099#true} is VALID [2022-04-27 12:47:25,490 INFO L290 TraceCheckUtils]: 18: Hoare triple {1099#true} ~cond := #in~cond; {1099#true} is VALID [2022-04-27 12:47:25,490 INFO L290 TraceCheckUtils]: 19: Hoare triple {1099#true} assume !(0 == ~cond); {1099#true} is VALID [2022-04-27 12:47:25,490 INFO L290 TraceCheckUtils]: 20: Hoare triple {1099#true} assume true; {1099#true} is VALID [2022-04-27 12:47:25,490 INFO L284 TraceCheckUtils]: 21: Hoare quadruple {1099#true} {1099#true} #86#return; {1099#true} is VALID [2022-04-27 12:47:25,490 INFO L272 TraceCheckUtils]: 22: Hoare triple {1099#true} call assume_abort_if_not((if ~B~0 % 4294967296 >= 1 then 1 else 0)); {1099#true} is VALID [2022-04-27 12:47:25,490 INFO L290 TraceCheckUtils]: 23: Hoare triple {1099#true} ~cond := #in~cond; {1099#true} is VALID [2022-04-27 12:47:25,490 INFO L290 TraceCheckUtils]: 24: Hoare triple {1099#true} assume !(0 == ~cond); {1099#true} is VALID [2022-04-27 12:47:25,490 INFO L290 TraceCheckUtils]: 25: Hoare triple {1099#true} assume true; {1099#true} is VALID [2022-04-27 12:47:25,490 INFO L284 TraceCheckUtils]: 26: Hoare quadruple {1099#true} {1099#true} #88#return; {1099#true} is VALID [2022-04-27 12:47:25,491 INFO L290 TraceCheckUtils]: 27: Hoare triple {1099#true} ~q~0 := 0;~r~0 := ~A~0;~b~0 := ~B~0; {1185#(= main_~B~0 main_~b~0)} is VALID [2022-04-27 12:47:25,491 INFO L290 TraceCheckUtils]: 28: Hoare triple {1185#(= main_~B~0 main_~b~0)} assume !false; {1185#(= main_~B~0 main_~b~0)} is VALID [2022-04-27 12:47:25,492 INFO L290 TraceCheckUtils]: 29: Hoare triple {1185#(= main_~B~0 main_~b~0)} assume !(~r~0 % 4294967296 >= ~b~0 % 4294967296); {1185#(= main_~B~0 main_~b~0)} is VALID [2022-04-27 12:47:25,492 INFO L290 TraceCheckUtils]: 30: Hoare triple {1185#(= main_~B~0 main_~b~0)} assume !false; {1185#(= main_~B~0 main_~b~0)} is VALID [2022-04-27 12:47:25,492 INFO L272 TraceCheckUtils]: 31: Hoare triple {1185#(= main_~B~0 main_~b~0)} call __VERIFIER_assert((if ~A~0 % 4294967296 == (~q~0 * ~b~0 + ~r~0) % 4294967296 then 1 else 0)); {1099#true} is VALID [2022-04-27 12:47:25,492 INFO L290 TraceCheckUtils]: 32: Hoare triple {1099#true} ~cond := #in~cond; {1099#true} is VALID [2022-04-27 12:47:25,492 INFO L290 TraceCheckUtils]: 33: Hoare triple {1099#true} assume !(0 == ~cond); {1099#true} is VALID [2022-04-27 12:47:25,492 INFO L290 TraceCheckUtils]: 34: Hoare triple {1099#true} assume true; {1099#true} is VALID [2022-04-27 12:47:25,493 INFO L284 TraceCheckUtils]: 35: Hoare quadruple {1099#true} {1185#(= main_~B~0 main_~b~0)} #90#return; {1185#(= main_~B~0 main_~b~0)} is VALID [2022-04-27 12:47:25,494 INFO L290 TraceCheckUtils]: 36: Hoare triple {1185#(= 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); {1100#false} is VALID [2022-04-27 12:47:25,494 INFO L290 TraceCheckUtils]: 37: Hoare triple {1100#false} assume ~r~0 % 4294967296 >= ~b~0 % 4294967296;~q~0 := 1 + ~q~0;~r~0 := ~r~0 - ~b~0; {1100#false} is VALID [2022-04-27 12:47:25,494 INFO L290 TraceCheckUtils]: 38: Hoare triple {1100#false} assume !false; {1100#false} is VALID [2022-04-27 12:47:25,494 INFO L272 TraceCheckUtils]: 39: Hoare triple {1100#false} call __VERIFIER_assert((if ~A~0 % 4294967296 == (~q~0 * ~b~0 + ~r~0) % 4294967296 then 1 else 0)); {1100#false} is VALID [2022-04-27 12:47:25,494 INFO L290 TraceCheckUtils]: 40: Hoare triple {1100#false} ~cond := #in~cond; {1100#false} is VALID [2022-04-27 12:47:25,494 INFO L290 TraceCheckUtils]: 41: Hoare triple {1100#false} assume 0 == ~cond; {1100#false} is VALID [2022-04-27 12:47:25,494 INFO L290 TraceCheckUtils]: 42: Hoare triple {1100#false} assume !false; {1100#false} is VALID [2022-04-27 12:47:25,494 INFO L134 CoverageAnalysis]: Checked inductivity of 28 backedges. 4 proven. 0 refuted. 0 times theorem prover too weak. 24 trivial. 0 not checked. [2022-04-27 12:47:25,494 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-04-27 12:47:25,494 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-27 12:47:25,495 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [790375690] [2022-04-27 12:47:25,495 WARN L310 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2022-04-27 12:47:25,495 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [942751587] [2022-04-27 12:47:25,495 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [942751587] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-27 12:47:25,495 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-27 12:47:25,495 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-04-27 12:47:25,495 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1801190257] [2022-04-27 12:47:25,495 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-27 12:47:25,496 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 6.666666666666667) internal successors, (20), 3 states have internal predecessors, (20), 3 states have call successors, (8), 2 states have call predecessors, (8), 1 states have return successors, (6), 2 states have call predecessors, (6), 2 states have call successors, (6) Word has length 43 [2022-04-27 12:47:25,496 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-27 12:47:25,496 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with has 3 states, 3 states have (on average 6.666666666666667) internal successors, (20), 3 states have internal predecessors, (20), 3 states have call successors, (8), 2 states have call predecessors, (8), 1 states have return successors, (6), 2 states have call predecessors, (6), 2 states have call successors, (6) [2022-04-27 12:47:25,520 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 34 edges. 34 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-27 12:47:25,521 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-04-27 12:47:25,521 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-04-27 12:47:25,521 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-04-27 12:47:25,521 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-04-27 12:47:25,521 INFO L87 Difference]: Start difference. First operand 44 states and 51 transitions. Second operand has 3 states, 3 states have (on average 6.666666666666667) internal successors, (20), 3 states have internal predecessors, (20), 3 states have call successors, (8), 2 states have call predecessors, (8), 1 states have return successors, (6), 2 states have call predecessors, (6), 2 states have call successors, (6) [2022-04-27 12:47:27,707 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-27 12:47:27,707 INFO L93 Difference]: Finished difference Result 55 states and 64 transitions. [2022-04-27 12:47:27,707 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-04-27 12:47:27,707 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 6.666666666666667) internal successors, (20), 3 states have internal predecessors, (20), 3 states have call successors, (8), 2 states have call predecessors, (8), 1 states have return successors, (6), 2 states have call predecessors, (6), 2 states have call successors, (6) Word has length 43 [2022-04-27 12:47:27,707 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-27 12:47:27,707 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3 states, 3 states have (on average 6.666666666666667) internal successors, (20), 3 states have internal predecessors, (20), 3 states have call successors, (8), 2 states have call predecessors, (8), 1 states have return successors, (6), 2 states have call predecessors, (6), 2 states have call successors, (6) [2022-04-27 12:47:27,710 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 55 transitions. [2022-04-27 12:47:27,710 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3 states, 3 states have (on average 6.666666666666667) internal successors, (20), 3 states have internal predecessors, (20), 3 states have call successors, (8), 2 states have call predecessors, (8), 1 states have return successors, (6), 2 states have call predecessors, (6), 2 states have call successors, (6) [2022-04-27 12:47:27,712 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 55 transitions. [2022-04-27 12:47:27,712 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 3 states and 55 transitions. [2022-04-27 12:47:27,756 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 55 edges. 55 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-27 12:47:27,757 INFO L225 Difference]: With dead ends: 55 [2022-04-27 12:47:27,757 INFO L226 Difference]: Without dead ends: 37 [2022-04-27 12:47:27,757 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 42 GetRequests, 41 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-04-27 12:47:27,758 INFO L413 NwaCegarLoop]: 34 mSDtfsCounter, 0 mSDsluCounter, 21 mSDsCounter, 0 mSdLazyCounter, 15 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 55 SdHoareTripleChecker+Invalid, 15 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 15 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-04-27 12:47:27,761 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 55 Invalid, 15 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 15 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-04-27 12:47:27,762 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 37 states. [2022-04-27 12:47:27,765 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 37 to 37. [2022-04-27 12:47:27,765 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-27 12:47:27,766 INFO L82 GeneralOperation]: Start isEquivalent. First operand 37 states. Second operand has 37 states, 23 states have (on average 1.173913043478261) internal successors, (27), 25 states have internal predecessors, (27), 9 states have call successors, (9), 5 states have call predecessors, (9), 4 states have return successors, (7), 6 states have call predecessors, (7), 7 states have call successors, (7) [2022-04-27 12:47:27,766 INFO L74 IsIncluded]: Start isIncluded. First operand 37 states. Second operand has 37 states, 23 states have (on average 1.173913043478261) internal successors, (27), 25 states have internal predecessors, (27), 9 states have call successors, (9), 5 states have call predecessors, (9), 4 states have return successors, (7), 6 states have call predecessors, (7), 7 states have call successors, (7) [2022-04-27 12:47:27,766 INFO L87 Difference]: Start difference. First operand 37 states. Second operand has 37 states, 23 states have (on average 1.173913043478261) internal successors, (27), 25 states have internal predecessors, (27), 9 states have call successors, (9), 5 states have call predecessors, (9), 4 states have return successors, (7), 6 states have call predecessors, (7), 7 states have call successors, (7) [2022-04-27 12:47:27,768 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-27 12:47:27,768 INFO L93 Difference]: Finished difference Result 37 states and 43 transitions. [2022-04-27 12:47:27,768 INFO L276 IsEmpty]: Start isEmpty. Operand 37 states and 43 transitions. [2022-04-27 12:47:27,769 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-27 12:47:27,769 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-27 12:47:27,769 INFO L74 IsIncluded]: Start isIncluded. First operand has 37 states, 23 states have (on average 1.173913043478261) internal successors, (27), 25 states have internal predecessors, (27), 9 states have call successors, (9), 5 states have call predecessors, (9), 4 states have return successors, (7), 6 states have call predecessors, (7), 7 states have call successors, (7) Second operand 37 states. [2022-04-27 12:47:27,769 INFO L87 Difference]: Start difference. First operand has 37 states, 23 states have (on average 1.173913043478261) internal successors, (27), 25 states have internal predecessors, (27), 9 states have call successors, (9), 5 states have call predecessors, (9), 4 states have return successors, (7), 6 states have call predecessors, (7), 7 states have call successors, (7) Second operand 37 states. [2022-04-27 12:47:27,770 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-27 12:47:27,770 INFO L93 Difference]: Finished difference Result 37 states and 43 transitions. [2022-04-27 12:47:27,770 INFO L276 IsEmpty]: Start isEmpty. Operand 37 states and 43 transitions. [2022-04-27 12:47:27,771 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-27 12:47:27,771 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-27 12:47:27,771 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-27 12:47:27,771 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-27 12:47:27,771 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 37 states, 23 states have (on average 1.173913043478261) internal successors, (27), 25 states have internal predecessors, (27), 9 states have call successors, (9), 5 states have call predecessors, (9), 4 states have return successors, (7), 6 states have call predecessors, (7), 7 states have call successors, (7) [2022-04-27 12:47:27,772 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 37 states to 37 states and 43 transitions. [2022-04-27 12:47:27,772 INFO L78 Accepts]: Start accepts. Automaton has 37 states and 43 transitions. Word has length 43 [2022-04-27 12:47:27,772 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-27 12:47:27,773 INFO L495 AbstractCegarLoop]: Abstraction has 37 states and 43 transitions. [2022-04-27 12:47:27,773 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 6.666666666666667) internal successors, (20), 3 states have internal predecessors, (20), 3 states have call successors, (8), 2 states have call predecessors, (8), 1 states have return successors, (6), 2 states have call predecessors, (6), 2 states have call successors, (6) [2022-04-27 12:47:27,773 INFO L276 IsEmpty]: Start isEmpty. Operand 37 states and 43 transitions. [2022-04-27 12:47:27,773 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 44 [2022-04-27 12:47:27,774 INFO L187 NwaCegarLoop]: Found error trace [2022-04-27 12:47:27,774 INFO L195 NwaCegarLoop]: trace histogram [4, 4, 4, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-27 12:47:27,800 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Forceful destruction successful, exit code 0 [2022-04-27 12:47:27,992 WARN L477 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-27 12:47:27,992 INFO L420 AbstractCegarLoop]: === Iteration 5 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-27 12:47:27,992 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-27 12:47:27,992 INFO L85 PathProgramCache]: Analyzing trace with hash -75827905, now seen corresponding path program 1 times [2022-04-27 12:47:27,993 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-27 12:47:27,993 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [852497218] [2022-04-27 12:47:27,993 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-27 12:47:27,993 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-27 12:47:28,003 ERROR L245 FreeRefinementEngine]: Caught known exception: Unsupported non-linear arithmetic [2022-04-27 12:47:28,003 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [1962858820] [2022-04-27 12:47:28,004 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-27 12:47:28,004 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-27 12:47:28,004 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-04-27 12:47:28,005 INFO L229 MonitoredProcess]: Starting monitored process 5 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-04-27 12:47:28,006 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Waiting until timeout for monitored process [2022-04-27 12:47:28,040 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-27 12:47:28,041 INFO L263 TraceCheckSpWp]: Trace formula consists of 108 conjuncts, 11 conjunts are in the unsatisfiable core [2022-04-27 12:47:28,049 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-27 12:47:28,050 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-04-27 12:47:28,249 INFO L272 TraceCheckUtils]: 0: Hoare triple {1433#true} call ULTIMATE.init(); {1433#true} is VALID [2022-04-27 12:47:28,249 INFO L290 TraceCheckUtils]: 1: Hoare triple {1433#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); {1433#true} is VALID [2022-04-27 12:47:28,249 INFO L290 TraceCheckUtils]: 2: Hoare triple {1433#true} assume true; {1433#true} is VALID [2022-04-27 12:47:28,250 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {1433#true} {1433#true} #94#return; {1433#true} is VALID [2022-04-27 12:47:28,250 INFO L272 TraceCheckUtils]: 4: Hoare triple {1433#true} call #t~ret3 := main(); {1433#true} is VALID [2022-04-27 12:47:28,250 INFO L290 TraceCheckUtils]: 5: Hoare triple {1433#true} havoc ~A~0;havoc ~B~0;havoc ~q~0;havoc ~r~0;havoc ~b~0;~A~0 := #t~nondet1;havoc #t~nondet1; {1433#true} is VALID [2022-04-27 12:47:28,250 INFO L272 TraceCheckUtils]: 6: Hoare triple {1433#true} call assume_abort_if_not((if ~A~0 % 4294967296 >= 0 && ~A~0 % 4294967296 <= 1 then 1 else 0)); {1433#true} is VALID [2022-04-27 12:47:28,250 INFO L290 TraceCheckUtils]: 7: Hoare triple {1433#true} ~cond := #in~cond; {1433#true} is VALID [2022-04-27 12:47:28,250 INFO L290 TraceCheckUtils]: 8: Hoare triple {1433#true} assume !(0 == ~cond); {1433#true} is VALID [2022-04-27 12:47:28,250 INFO L290 TraceCheckUtils]: 9: Hoare triple {1433#true} assume true; {1433#true} is VALID [2022-04-27 12:47:28,250 INFO L284 TraceCheckUtils]: 10: Hoare quadruple {1433#true} {1433#true} #82#return; {1433#true} is VALID [2022-04-27 12:47:28,250 INFO L290 TraceCheckUtils]: 11: Hoare triple {1433#true} ~B~0 := #t~nondet2;havoc #t~nondet2; {1433#true} is VALID [2022-04-27 12:47:28,250 INFO L272 TraceCheckUtils]: 12: Hoare triple {1433#true} call assume_abort_if_not((if ~B~0 % 4294967296 >= 0 && ~B~0 % 4294967296 <= 1 then 1 else 0)); {1433#true} is VALID [2022-04-27 12:47:28,250 INFO L290 TraceCheckUtils]: 13: Hoare triple {1433#true} ~cond := #in~cond; {1433#true} is VALID [2022-04-27 12:47:28,250 INFO L290 TraceCheckUtils]: 14: Hoare triple {1433#true} assume !(0 == ~cond); {1433#true} is VALID [2022-04-27 12:47:28,250 INFO L290 TraceCheckUtils]: 15: Hoare triple {1433#true} assume true; {1433#true} is VALID [2022-04-27 12:47:28,250 INFO L284 TraceCheckUtils]: 16: Hoare quadruple {1433#true} {1433#true} #84#return; {1433#true} is VALID [2022-04-27 12:47:28,250 INFO L272 TraceCheckUtils]: 17: Hoare triple {1433#true} call assume_abort_if_not((if ~B~0 % 4294967296 < 2147483647 then 1 else 0)); {1433#true} is VALID [2022-04-27 12:47:28,251 INFO L290 TraceCheckUtils]: 18: Hoare triple {1433#true} ~cond := #in~cond; {1433#true} is VALID [2022-04-27 12:47:28,251 INFO L290 TraceCheckUtils]: 19: Hoare triple {1433#true} assume !(0 == ~cond); {1433#true} is VALID [2022-04-27 12:47:28,251 INFO L290 TraceCheckUtils]: 20: Hoare triple {1433#true} assume true; {1433#true} is VALID [2022-04-27 12:47:28,251 INFO L284 TraceCheckUtils]: 21: Hoare quadruple {1433#true} {1433#true} #86#return; {1433#true} is VALID [2022-04-27 12:47:28,251 INFO L272 TraceCheckUtils]: 22: Hoare triple {1433#true} call assume_abort_if_not((if ~B~0 % 4294967296 >= 1 then 1 else 0)); {1433#true} is VALID [2022-04-27 12:47:28,251 INFO L290 TraceCheckUtils]: 23: Hoare triple {1433#true} ~cond := #in~cond; {1433#true} is VALID [2022-04-27 12:47:28,251 INFO L290 TraceCheckUtils]: 24: Hoare triple {1433#true} assume !(0 == ~cond); {1433#true} is VALID [2022-04-27 12:47:28,251 INFO L290 TraceCheckUtils]: 25: Hoare triple {1433#true} assume true; {1433#true} is VALID [2022-04-27 12:47:28,251 INFO L284 TraceCheckUtils]: 26: Hoare quadruple {1433#true} {1433#true} #88#return; {1433#true} is VALID [2022-04-27 12:47:28,251 INFO L290 TraceCheckUtils]: 27: Hoare triple {1433#true} ~q~0 := 0;~r~0 := ~A~0;~b~0 := ~B~0; {1433#true} is VALID [2022-04-27 12:47:28,251 INFO L290 TraceCheckUtils]: 28: Hoare triple {1433#true} assume !false; {1433#true} is VALID [2022-04-27 12:47:28,251 INFO L290 TraceCheckUtils]: 29: Hoare triple {1433#true} assume !!(~r~0 % 4294967296 >= ~b~0 % 4294967296);~b~0 := 2 * ~b~0; {1433#true} is VALID [2022-04-27 12:47:28,251 INFO L290 TraceCheckUtils]: 30: Hoare triple {1433#true} assume !false; {1433#true} is VALID [2022-04-27 12:47:28,251 INFO L290 TraceCheckUtils]: 31: Hoare triple {1433#true} assume !(~r~0 % 4294967296 >= ~b~0 % 4294967296); {1433#true} is VALID [2022-04-27 12:47:28,252 INFO L290 TraceCheckUtils]: 32: Hoare triple {1433#true} assume !false; {1433#true} is VALID [2022-04-27 12:47:28,252 INFO L272 TraceCheckUtils]: 33: Hoare triple {1433#true} call __VERIFIER_assert((if ~A~0 % 4294967296 == (~q~0 * ~b~0 + ~r~0) % 4294967296 then 1 else 0)); {1433#true} is VALID [2022-04-27 12:47:28,255 INFO L290 TraceCheckUtils]: 34: Hoare triple {1433#true} ~cond := #in~cond; {1540#(= |__VERIFIER_assert_#in~cond| __VERIFIER_assert_~cond)} is VALID [2022-04-27 12:47:28,256 INFO L290 TraceCheckUtils]: 35: Hoare triple {1540#(= |__VERIFIER_assert_#in~cond| __VERIFIER_assert_~cond)} assume !(0 == ~cond); {1544#(not (= |__VERIFIER_assert_#in~cond| 0))} is VALID [2022-04-27 12:47:28,256 INFO L290 TraceCheckUtils]: 36: Hoare triple {1544#(not (= |__VERIFIER_assert_#in~cond| 0))} assume true; {1544#(not (= |__VERIFIER_assert_#in~cond| 0))} is VALID [2022-04-27 12:47:28,257 INFO L284 TraceCheckUtils]: 37: Hoare quadruple {1544#(not (= |__VERIFIER_assert_#in~cond| 0))} {1433#true} #90#return; {1551#(= (mod main_~A~0 4294967296) (mod (+ main_~r~0 (* main_~b~0 main_~q~0)) 4294967296))} is VALID [2022-04-27 12:47:28,258 INFO L290 TraceCheckUtils]: 38: Hoare triple {1551#(= (mod main_~A~0 4294967296) (mod (+ main_~r~0 (* main_~b~0 main_~q~0)) 4294967296))} assume !(~b~0 % 4294967296 != ~B~0 % 4294967296); {1551#(= (mod main_~A~0 4294967296) (mod (+ main_~r~0 (* main_~b~0 main_~q~0)) 4294967296))} is VALID [2022-04-27 12:47:28,258 INFO L272 TraceCheckUtils]: 39: Hoare triple {1551#(= (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)); {1558#(= |__VERIFIER_assert_#in~cond| 1)} is VALID [2022-04-27 12:47:28,259 INFO L290 TraceCheckUtils]: 40: Hoare triple {1558#(= |__VERIFIER_assert_#in~cond| 1)} ~cond := #in~cond; {1562#(= __VERIFIER_assert_~cond 1)} is VALID [2022-04-27 12:47:28,259 INFO L290 TraceCheckUtils]: 41: Hoare triple {1562#(= __VERIFIER_assert_~cond 1)} assume 0 == ~cond; {1434#false} is VALID [2022-04-27 12:47:28,259 INFO L290 TraceCheckUtils]: 42: Hoare triple {1434#false} assume !false; {1434#false} is VALID [2022-04-27 12:47:28,259 INFO L134 CoverageAnalysis]: Checked inductivity of 28 backedges. 1 proven. 1 refuted. 0 times theorem prover too weak. 26 trivial. 0 not checked. [2022-04-27 12:47:28,259 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-04-27 12:47:29,227 INFO L290 TraceCheckUtils]: 42: Hoare triple {1434#false} assume !false; {1434#false} is VALID [2022-04-27 12:47:29,228 INFO L290 TraceCheckUtils]: 41: Hoare triple {1572#(not (= __VERIFIER_assert_~cond 0))} assume 0 == ~cond; {1434#false} is VALID [2022-04-27 12:47:29,228 INFO L290 TraceCheckUtils]: 40: Hoare triple {1544#(not (= |__VERIFIER_assert_#in~cond| 0))} ~cond := #in~cond; {1572#(not (= __VERIFIER_assert_~cond 0))} is VALID [2022-04-27 12:47:29,228 INFO L272 TraceCheckUtils]: 39: Hoare triple {1551#(= (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)); {1544#(not (= |__VERIFIER_assert_#in~cond| 0))} is VALID [2022-04-27 12:47:29,229 INFO L290 TraceCheckUtils]: 38: Hoare triple {1551#(= (mod main_~A~0 4294967296) (mod (+ main_~r~0 (* main_~b~0 main_~q~0)) 4294967296))} assume !(~b~0 % 4294967296 != ~B~0 % 4294967296); {1551#(= (mod main_~A~0 4294967296) (mod (+ main_~r~0 (* main_~b~0 main_~q~0)) 4294967296))} is VALID [2022-04-27 12:47:29,229 INFO L284 TraceCheckUtils]: 37: Hoare quadruple {1544#(not (= |__VERIFIER_assert_#in~cond| 0))} {1433#true} #90#return; {1551#(= (mod main_~A~0 4294967296) (mod (+ main_~r~0 (* main_~b~0 main_~q~0)) 4294967296))} is VALID [2022-04-27 12:47:29,229 INFO L290 TraceCheckUtils]: 36: Hoare triple {1544#(not (= |__VERIFIER_assert_#in~cond| 0))} assume true; {1544#(not (= |__VERIFIER_assert_#in~cond| 0))} is VALID [2022-04-27 12:47:29,230 INFO L290 TraceCheckUtils]: 35: Hoare triple {1594#(or (not (= |__VERIFIER_assert_#in~cond| 0)) (= __VERIFIER_assert_~cond 0))} assume !(0 == ~cond); {1544#(not (= |__VERIFIER_assert_#in~cond| 0))} is VALID [2022-04-27 12:47:29,230 INFO L290 TraceCheckUtils]: 34: Hoare triple {1433#true} ~cond := #in~cond; {1594#(or (not (= |__VERIFIER_assert_#in~cond| 0)) (= __VERIFIER_assert_~cond 0))} is VALID [2022-04-27 12:47:29,230 INFO L272 TraceCheckUtils]: 33: Hoare triple {1433#true} call __VERIFIER_assert((if ~A~0 % 4294967296 == (~q~0 * ~b~0 + ~r~0) % 4294967296 then 1 else 0)); {1433#true} is VALID [2022-04-27 12:47:29,230 INFO L290 TraceCheckUtils]: 32: Hoare triple {1433#true} assume !false; {1433#true} is VALID [2022-04-27 12:47:29,230 INFO L290 TraceCheckUtils]: 31: Hoare triple {1433#true} assume !(~r~0 % 4294967296 >= ~b~0 % 4294967296); {1433#true} is VALID [2022-04-27 12:47:29,230 INFO L290 TraceCheckUtils]: 30: Hoare triple {1433#true} assume !false; {1433#true} is VALID [2022-04-27 12:47:29,230 INFO L290 TraceCheckUtils]: 29: Hoare triple {1433#true} assume !!(~r~0 % 4294967296 >= ~b~0 % 4294967296);~b~0 := 2 * ~b~0; {1433#true} is VALID [2022-04-27 12:47:29,230 INFO L290 TraceCheckUtils]: 28: Hoare triple {1433#true} assume !false; {1433#true} is VALID [2022-04-27 12:47:29,231 INFO L290 TraceCheckUtils]: 27: Hoare triple {1433#true} ~q~0 := 0;~r~0 := ~A~0;~b~0 := ~B~0; {1433#true} is VALID [2022-04-27 12:47:29,231 INFO L284 TraceCheckUtils]: 26: Hoare quadruple {1433#true} {1433#true} #88#return; {1433#true} is VALID [2022-04-27 12:47:29,231 INFO L290 TraceCheckUtils]: 25: Hoare triple {1433#true} assume true; {1433#true} is VALID [2022-04-27 12:47:29,231 INFO L290 TraceCheckUtils]: 24: Hoare triple {1433#true} assume !(0 == ~cond); {1433#true} is VALID [2022-04-27 12:47:29,231 INFO L290 TraceCheckUtils]: 23: Hoare triple {1433#true} ~cond := #in~cond; {1433#true} is VALID [2022-04-27 12:47:29,231 INFO L272 TraceCheckUtils]: 22: Hoare triple {1433#true} call assume_abort_if_not((if ~B~0 % 4294967296 >= 1 then 1 else 0)); {1433#true} is VALID [2022-04-27 12:47:29,231 INFO L284 TraceCheckUtils]: 21: Hoare quadruple {1433#true} {1433#true} #86#return; {1433#true} is VALID [2022-04-27 12:47:29,231 INFO L290 TraceCheckUtils]: 20: Hoare triple {1433#true} assume true; {1433#true} is VALID [2022-04-27 12:47:29,231 INFO L290 TraceCheckUtils]: 19: Hoare triple {1433#true} assume !(0 == ~cond); {1433#true} is VALID [2022-04-27 12:47:29,231 INFO L290 TraceCheckUtils]: 18: Hoare triple {1433#true} ~cond := #in~cond; {1433#true} is VALID [2022-04-27 12:47:29,231 INFO L272 TraceCheckUtils]: 17: Hoare triple {1433#true} call assume_abort_if_not((if ~B~0 % 4294967296 < 2147483647 then 1 else 0)); {1433#true} is VALID [2022-04-27 12:47:29,231 INFO L284 TraceCheckUtils]: 16: Hoare quadruple {1433#true} {1433#true} #84#return; {1433#true} is VALID [2022-04-27 12:47:29,231 INFO L290 TraceCheckUtils]: 15: Hoare triple {1433#true} assume true; {1433#true} is VALID [2022-04-27 12:47:29,231 INFO L290 TraceCheckUtils]: 14: Hoare triple {1433#true} assume !(0 == ~cond); {1433#true} is VALID [2022-04-27 12:47:29,231 INFO L290 TraceCheckUtils]: 13: Hoare triple {1433#true} ~cond := #in~cond; {1433#true} is VALID [2022-04-27 12:47:29,232 INFO L272 TraceCheckUtils]: 12: Hoare triple {1433#true} call assume_abort_if_not((if ~B~0 % 4294967296 >= 0 && ~B~0 % 4294967296 <= 1 then 1 else 0)); {1433#true} is VALID [2022-04-27 12:47:29,232 INFO L290 TraceCheckUtils]: 11: Hoare triple {1433#true} ~B~0 := #t~nondet2;havoc #t~nondet2; {1433#true} is VALID [2022-04-27 12:47:29,232 INFO L284 TraceCheckUtils]: 10: Hoare quadruple {1433#true} {1433#true} #82#return; {1433#true} is VALID [2022-04-27 12:47:29,232 INFO L290 TraceCheckUtils]: 9: Hoare triple {1433#true} assume true; {1433#true} is VALID [2022-04-27 12:47:29,232 INFO L290 TraceCheckUtils]: 8: Hoare triple {1433#true} assume !(0 == ~cond); {1433#true} is VALID [2022-04-27 12:47:29,232 INFO L290 TraceCheckUtils]: 7: Hoare triple {1433#true} ~cond := #in~cond; {1433#true} is VALID [2022-04-27 12:47:29,232 INFO L272 TraceCheckUtils]: 6: Hoare triple {1433#true} call assume_abort_if_not((if ~A~0 % 4294967296 >= 0 && ~A~0 % 4294967296 <= 1 then 1 else 0)); {1433#true} is VALID [2022-04-27 12:47:29,232 INFO L290 TraceCheckUtils]: 5: Hoare triple {1433#true} havoc ~A~0;havoc ~B~0;havoc ~q~0;havoc ~r~0;havoc ~b~0;~A~0 := #t~nondet1;havoc #t~nondet1; {1433#true} is VALID [2022-04-27 12:47:29,232 INFO L272 TraceCheckUtils]: 4: Hoare triple {1433#true} call #t~ret3 := main(); {1433#true} is VALID [2022-04-27 12:47:29,232 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {1433#true} {1433#true} #94#return; {1433#true} is VALID [2022-04-27 12:47:29,232 INFO L290 TraceCheckUtils]: 2: Hoare triple {1433#true} assume true; {1433#true} is VALID [2022-04-27 12:47:29,232 INFO L290 TraceCheckUtils]: 1: Hoare triple {1433#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); {1433#true} is VALID [2022-04-27 12:47:29,232 INFO L272 TraceCheckUtils]: 0: Hoare triple {1433#true} call ULTIMATE.init(); {1433#true} is VALID [2022-04-27 12:47:29,232 INFO L134 CoverageAnalysis]: Checked inductivity of 28 backedges. 1 proven. 1 refuted. 0 times theorem prover too weak. 26 trivial. 0 not checked. [2022-04-27 12:47:29,233 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-27 12:47:29,233 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [852497218] [2022-04-27 12:47:29,233 WARN L310 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2022-04-27 12:47:29,233 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1962858820] [2022-04-27 12:47:29,233 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1962858820] provided 0 perfect and 2 imperfect interpolant sequences [2022-04-27 12:47:29,233 INFO L184 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2022-04-27 12:47:29,233 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 6] total 9 [2022-04-27 12:47:29,233 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1181851551] [2022-04-27 12:47:29,233 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2022-04-27 12:47:29,234 INFO L78 Accepts]: Start accepts. Automaton has has 9 states, 9 states have (on average 2.5555555555555554) internal successors, (23), 8 states have internal predecessors, (23), 2 states have call successors, (9), 3 states have call predecessors, (9), 2 states have return successors, (6), 2 states have call predecessors, (6), 1 states have call successors, (6) Word has length 43 [2022-04-27 12:47:29,234 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-27 12:47:29,234 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with has 9 states, 9 states have (on average 2.5555555555555554) internal successors, (23), 8 states have internal predecessors, (23), 2 states have call successors, (9), 3 states have call predecessors, (9), 2 states have return successors, (6), 2 states have call predecessors, (6), 1 states have call successors, (6) [2022-04-27 12:47:29,258 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 38 edges. 38 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-27 12:47:29,259 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2022-04-27 12:47:29,259 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-04-27 12:47:29,259 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2022-04-27 12:47:29,259 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=20, Invalid=52, Unknown=0, NotChecked=0, Total=72 [2022-04-27 12:47:29,260 INFO L87 Difference]: Start difference. First operand 37 states and 43 transitions. Second operand has 9 states, 9 states have (on average 2.5555555555555554) internal successors, (23), 8 states have internal predecessors, (23), 2 states have call successors, (9), 3 states have call predecessors, (9), 2 states have return successors, (6), 2 states have call predecessors, (6), 1 states have call successors, (6) [2022-04-27 12:47:31,449 WARN L534 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=true, quantifiers [] [2022-04-27 12:47:31,589 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-27 12:47:31,589 INFO L93 Difference]: Finished difference Result 43 states and 48 transitions. [2022-04-27 12:47:31,589 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2022-04-27 12:47:31,589 INFO L78 Accepts]: Start accepts. Automaton has has 9 states, 9 states have (on average 2.5555555555555554) internal successors, (23), 8 states have internal predecessors, (23), 2 states have call successors, (9), 3 states have call predecessors, (9), 2 states have return successors, (6), 2 states have call predecessors, (6), 1 states have call successors, (6) Word has length 43 [2022-04-27 12:47:31,589 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-27 12:47:31,589 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 9 states, 9 states have (on average 2.5555555555555554) internal successors, (23), 8 states have internal predecessors, (23), 2 states have call successors, (9), 3 states have call predecessors, (9), 2 states have return successors, (6), 2 states have call predecessors, (6), 1 states have call successors, (6) [2022-04-27 12:47:31,593 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 42 transitions. [2022-04-27 12:47:31,593 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 9 states, 9 states have (on average 2.5555555555555554) internal successors, (23), 8 states have internal predecessors, (23), 2 states have call successors, (9), 3 states have call predecessors, (9), 2 states have return successors, (6), 2 states have call predecessors, (6), 1 states have call successors, (6) [2022-04-27 12:47:31,596 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 42 transitions. [2022-04-27 12:47:31,596 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 7 states and 42 transitions. [2022-04-27 12:47:31,625 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 42 edges. 42 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-27 12:47:31,626 INFO L225 Difference]: With dead ends: 43 [2022-04-27 12:47:31,626 INFO L226 Difference]: Without dead ends: 36 [2022-04-27 12:47:31,626 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 87 GetRequests, 78 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=35, Invalid=75, Unknown=0, NotChecked=0, Total=110 [2022-04-27 12:47:31,627 INFO L413 NwaCegarLoop]: 30 mSDtfsCounter, 15 mSDsluCounter, 102 mSDsCounter, 0 mSdLazyCounter, 46 mSolverCounterSat, 3 mSolverCounterUnsat, 1 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 2.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 15 SdHoareTripleChecker+Valid, 132 SdHoareTripleChecker+Invalid, 50 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 46 IncrementalHoareTripleChecker+Invalid, 1 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 2.1s IncrementalHoareTripleChecker+Time [2022-04-27 12:47:31,627 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [15 Valid, 132 Invalid, 50 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 46 Invalid, 1 Unknown, 0 Unchecked, 2.1s Time] [2022-04-27 12:47:31,627 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 36 states. [2022-04-27 12:47:31,634 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 36 to 36. [2022-04-27 12:47:31,634 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-27 12:47:31,634 INFO L82 GeneralOperation]: Start isEquivalent. First operand 36 states. Second operand has 36 states, 23 states have (on average 1.1304347826086956) internal successors, (26), 24 states have internal predecessors, (26), 8 states have call successors, (8), 5 states have call predecessors, (8), 4 states have return successors, (7), 6 states have call predecessors, (7), 7 states have call successors, (7) [2022-04-27 12:47:31,634 INFO L74 IsIncluded]: Start isIncluded. First operand 36 states. Second operand has 36 states, 23 states have (on average 1.1304347826086956) internal successors, (26), 24 states have internal predecessors, (26), 8 states have call successors, (8), 5 states have call predecessors, (8), 4 states have return successors, (7), 6 states have call predecessors, (7), 7 states have call successors, (7) [2022-04-27 12:47:31,634 INFO L87 Difference]: Start difference. First operand 36 states. Second operand has 36 states, 23 states have (on average 1.1304347826086956) internal successors, (26), 24 states have internal predecessors, (26), 8 states have call successors, (8), 5 states have call predecessors, (8), 4 states have return successors, (7), 6 states have call predecessors, (7), 7 states have call successors, (7) [2022-04-27 12:47:31,636 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-27 12:47:31,636 INFO L93 Difference]: Finished difference Result 36 states and 41 transitions. [2022-04-27 12:47:31,636 INFO L276 IsEmpty]: Start isEmpty. Operand 36 states and 41 transitions. [2022-04-27 12:47:31,636 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-27 12:47:31,636 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-27 12:47:31,636 INFO L74 IsIncluded]: Start isIncluded. First operand has 36 states, 23 states have (on average 1.1304347826086956) internal successors, (26), 24 states have internal predecessors, (26), 8 states have call successors, (8), 5 states have call predecessors, (8), 4 states have return successors, (7), 6 states have call predecessors, (7), 7 states have call successors, (7) Second operand 36 states. [2022-04-27 12:47:31,636 INFO L87 Difference]: Start difference. First operand has 36 states, 23 states have (on average 1.1304347826086956) internal successors, (26), 24 states have internal predecessors, (26), 8 states have call successors, (8), 5 states have call predecessors, (8), 4 states have return successors, (7), 6 states have call predecessors, (7), 7 states have call successors, (7) Second operand 36 states. [2022-04-27 12:47:31,638 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-27 12:47:31,638 INFO L93 Difference]: Finished difference Result 36 states and 41 transitions. [2022-04-27 12:47:31,638 INFO L276 IsEmpty]: Start isEmpty. Operand 36 states and 41 transitions. [2022-04-27 12:47:31,638 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-27 12:47:31,638 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-27 12:47:31,638 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-27 12:47:31,638 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-27 12:47:31,638 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 36 states, 23 states have (on average 1.1304347826086956) internal successors, (26), 24 states have internal predecessors, (26), 8 states have call successors, (8), 5 states have call predecessors, (8), 4 states have return successors, (7), 6 states have call predecessors, (7), 7 states have call successors, (7) [2022-04-27 12:47:31,642 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 36 states to 36 states and 41 transitions. [2022-04-27 12:47:31,643 INFO L78 Accepts]: Start accepts. Automaton has 36 states and 41 transitions. Word has length 43 [2022-04-27 12:47:31,644 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-27 12:47:31,644 INFO L495 AbstractCegarLoop]: Abstraction has 36 states and 41 transitions. [2022-04-27 12:47:31,644 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 9 states have (on average 2.5555555555555554) internal successors, (23), 8 states have internal predecessors, (23), 2 states have call successors, (9), 3 states have call predecessors, (9), 2 states have return successors, (6), 2 states have call predecessors, (6), 1 states have call successors, (6) [2022-04-27 12:47:31,644 INFO L276 IsEmpty]: Start isEmpty. Operand 36 states and 41 transitions. [2022-04-27 12:47:31,647 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 46 [2022-04-27 12:47:31,647 INFO L187 NwaCegarLoop]: Found error trace [2022-04-27 12:47:31,647 INFO L195 NwaCegarLoop]: trace histogram [4, 4, 4, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-27 12:47:31,669 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Forceful destruction successful, exit code 0 [2022-04-27 12:47:31,859 WARN L477 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-27 12:47:31,859 INFO L420 AbstractCegarLoop]: === Iteration 6 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-27 12:47:31,860 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-27 12:47:31,860 INFO L85 PathProgramCache]: Analyzing trace with hash 866494938, now seen corresponding path program 1 times [2022-04-27 12:47:31,860 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-27 12:47:31,860 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1794198965] [2022-04-27 12:47:31,860 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-27 12:47:31,860 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-27 12:47:31,888 ERROR L245 FreeRefinementEngine]: Caught known exception: Unsupported non-linear arithmetic [2022-04-27 12:47:31,888 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [470813203] [2022-04-27 12:47:31,888 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-27 12:47:31,889 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-27 12:47:31,889 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-04-27 12:47:31,892 INFO L229 MonitoredProcess]: Starting monitored process 6 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-04-27 12:47:31,893 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (6)] Waiting until timeout for monitored process