/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/hard-u_unwindbound100.c -------------------------------------------------------------------------------- This is Ultimate 0.2.2-dev-fb4f59a-m [2022-04-27 13:30:22,891 INFO L177 SettingsManager]: Resetting all preferences to default values... [2022-04-27 13:30:22,893 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2022-04-27 13:30:22,933 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2022-04-27 13:30:22,933 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2022-04-27 13:30:22,934 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2022-04-27 13:30:22,938 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2022-04-27 13:30:22,943 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2022-04-27 13:30:22,945 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2022-04-27 13:30:22,950 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2022-04-27 13:30:22,951 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2022-04-27 13:30:22,952 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2022-04-27 13:30:22,952 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2022-04-27 13:30:22,955 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2022-04-27 13:30:22,956 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2022-04-27 13:30:22,957 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2022-04-27 13:30:22,958 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2022-04-27 13:30:22,958 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2022-04-27 13:30:22,962 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2022-04-27 13:30:22,968 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2022-04-27 13:30:22,970 INFO L181 SettingsManager]: Resetting HornVerifier preferences to default values [2022-04-27 13:30:22,971 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2022-04-27 13:30:22,972 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2022-04-27 13:30:22,972 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2022-04-27 13:30:22,974 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2022-04-27 13:30:22,976 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2022-04-27 13:30:22,976 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2022-04-27 13:30:22,977 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2022-04-27 13:30:22,978 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2022-04-27 13:30:22,978 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2022-04-27 13:30:22,979 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2022-04-27 13:30:22,979 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2022-04-27 13:30:22,980 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2022-04-27 13:30:22,981 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2022-04-27 13:30:22,981 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2022-04-27 13:30:22,981 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2022-04-27 13:30:22,982 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2022-04-27 13:30:22,982 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2022-04-27 13:30:22,982 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2022-04-27 13:30:22,983 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2022-04-27 13:30:22,983 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2022-04-27 13:30:22,984 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2022-04-27 13:30:22,985 INFO L101 SettingsManager]: Beginning loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/settings/default/automizer/svcomp-Reach-32bit-Automizer_Default.epf [2022-04-27 13:30:23,018 INFO L113 SettingsManager]: Loading preferences was successful [2022-04-27 13:30:23,019 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2022-04-27 13:30:23,019 INFO L136 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2022-04-27 13:30:23,019 INFO L138 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2022-04-27 13:30:23,019 INFO L136 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2022-04-27 13:30:23,020 INFO L138 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2022-04-27 13:30:23,020 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2022-04-27 13:30:23,020 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2022-04-27 13:30:23,020 INFO L138 SettingsManager]: * Use SBE=true [2022-04-27 13:30:23,021 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2022-04-27 13:30:23,021 INFO L138 SettingsManager]: * sizeof long=4 [2022-04-27 13:30:23,021 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2022-04-27 13:30:23,021 INFO L138 SettingsManager]: * sizeof POINTER=4 [2022-04-27 13:30:23,021 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2022-04-27 13:30:23,021 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2022-04-27 13:30:23,022 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2022-04-27 13:30:23,022 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2022-04-27 13:30:23,022 INFO L138 SettingsManager]: * sizeof long double=12 [2022-04-27 13:30:23,022 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2022-04-27 13:30:23,022 INFO L138 SettingsManager]: * Use constant arrays=true [2022-04-27 13:30:23,022 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2022-04-27 13:30:23,022 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2022-04-27 13:30:23,022 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2022-04-27 13:30:23,022 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2022-04-27 13:30:23,022 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-04-27 13:30:23,023 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2022-04-27 13:30:23,023 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2022-04-27 13:30:23,023 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2022-04-27 13:30:23,023 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2022-04-27 13:30:23,023 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2022-04-27 13:30:23,023 INFO L138 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2022-04-27 13:30:23,024 INFO L138 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2022-04-27 13:30:23,024 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2022-04-27 13:30:23,024 INFO L138 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode WARNING: An illegal reflective access operation has occurred WARNING: Illegal reflective access by com.sun.xml.bind.v2.runtime.reflect.opt.Injector$1 (file:/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/plugins/com.sun.xml.bind_2.2.0.v201505121915.jar) to method java.lang.ClassLoader.defineClass(java.lang.String,byte[],int,int) WARNING: Please consider reporting this to the maintainers of com.sun.xml.bind.v2.runtime.reflect.opt.Injector$1 WARNING: Use --illegal-access=warn to enable warnings of further illegal reflective access operations WARNING: All illegal access operations will be denied in a future release Applying setting for plugin de.uni_freiburg.informatik.ultimate.core: Log level for class -> de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=WARN; [2022-04-27 13:30:23,233 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2022-04-27 13:30:23,247 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2022-04-27 13:30:23,249 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2022-04-27 13:30:23,250 INFO L271 PluginConnector]: Initializing CDTParser... [2022-04-27 13:30:23,254 INFO L275 PluginConnector]: CDTParser initialized [2022-04-27 13:30:23,255 INFO L432 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/nla-digbench-scaling/hard-u_unwindbound100.c [2022-04-27 13:30:23,310 INFO L220 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/898db416d/caf4ac160cad4a37807e48391863077a/FLAG3e2c3e948 [2022-04-27 13:30:23,655 INFO L306 CDTParser]: Found 1 translation units. [2022-04-27 13:30:23,656 INFO L160 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/nla-digbench-scaling/hard-u_unwindbound100.c [2022-04-27 13:30:23,660 INFO L349 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/898db416d/caf4ac160cad4a37807e48391863077a/FLAG3e2c3e948 [2022-04-27 13:30:23,670 INFO L357 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/898db416d/caf4ac160cad4a37807e48391863077a [2022-04-27 13:30:23,672 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2022-04-27 13:30:23,673 INFO L131 ToolchainWalker]: Walking toolchain with 4 elements. [2022-04-27 13:30:23,675 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2022-04-27 13:30:23,675 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2022-04-27 13:30:23,677 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2022-04-27 13:30:23,678 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 27.04 01:30:23" (1/1) ... [2022-04-27 13:30:23,679 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@3cebdc2c and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.04 01:30:23, skipping insertion in model container [2022-04-27 13:30:23,679 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 27.04 01:30:23" (1/1) ... [2022-04-27 13:30:23,687 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2022-04-27 13:30:23,698 INFO L178 MainTranslator]: Built tables and reachable declarations [2022-04-27 13:30:23,868 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/hard-u_unwindbound100.c[537,550] [2022-04-27 13:30:23,887 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-04-27 13:30:23,907 INFO L203 MainTranslator]: Completed pre-run [2022-04-27 13:30:23,915 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/hard-u_unwindbound100.c[537,550] [2022-04-27 13:30:23,929 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-04-27 13:30:23,938 INFO L208 MainTranslator]: Completed translation [2022-04-27 13:30:23,938 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.04 01:30:23 WrapperNode [2022-04-27 13:30:23,939 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2022-04-27 13:30:23,939 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2022-04-27 13:30:23,939 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2022-04-27 13:30:23,939 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2022-04-27 13:30:23,948 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.04 01:30:23" (1/1) ... [2022-04-27 13:30:23,948 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.04 01:30:23" (1/1) ... [2022-04-27 13:30:23,952 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.04 01:30:23" (1/1) ... [2022-04-27 13:30:23,952 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.04 01:30:23" (1/1) ... [2022-04-27 13:30:23,957 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.04 01:30:23" (1/1) ... [2022-04-27 13:30:23,961 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.04 01:30:23" (1/1) ... [2022-04-27 13:30:23,962 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.04 01:30:23" (1/1) ... [2022-04-27 13:30:23,963 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2022-04-27 13:30:23,964 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2022-04-27 13:30:23,964 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2022-04-27 13:30:23,964 INFO L275 PluginConnector]: RCFGBuilder initialized [2022-04-27 13:30:23,968 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.04 01:30:23" (1/1) ... [2022-04-27 13:30:23,974 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-04-27 13:30:23,987 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-04-27 13:30:23,996 INFO L229 MonitoredProcess]: Starting monitored process 1 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (exit command is (exit), workingDir is null) [2022-04-27 13:30:24,003 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (1)] Waiting until timeout for monitored process [2022-04-27 13:30:24,024 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.init [2022-04-27 13:30:24,024 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2022-04-27 13:30:24,024 INFO L138 BoogieDeclarations]: Found implementation of procedure reach_error [2022-04-27 13:30:24,025 INFO L138 BoogieDeclarations]: Found implementation of procedure assume_abort_if_not [2022-04-27 13:30:24,025 INFO L138 BoogieDeclarations]: Found implementation of procedure __VERIFIER_assert [2022-04-27 13:30:24,025 INFO L138 BoogieDeclarations]: Found implementation of procedure main [2022-04-27 13:30:24,025 INFO L130 BoogieDeclarations]: Found specification of procedure abort [2022-04-27 13:30:24,025 INFO L130 BoogieDeclarations]: Found specification of procedure __assert_fail [2022-04-27 13:30:24,025 INFO L130 BoogieDeclarations]: Found specification of procedure reach_error [2022-04-27 13:30:24,025 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2022-04-27 13:30:24,025 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_nondet_uint [2022-04-27 13:30:24,025 INFO L130 BoogieDeclarations]: Found specification of procedure assume_abort_if_not [2022-04-27 13:30:24,025 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_assert [2022-04-27 13:30:24,025 INFO L130 BoogieDeclarations]: Found specification of procedure main [2022-04-27 13:30:24,025 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.init [2022-04-27 13:30:24,026 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2022-04-27 13:30:24,026 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2022-04-27 13:30:24,026 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2022-04-27 13:30:24,026 INFO L130 BoogieDeclarations]: Found specification of procedure read~int [2022-04-27 13:30:24,026 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2022-04-27 13:30:24,068 INFO L234 CfgBuilder]: Building ICFG [2022-04-27 13:30:24,070 INFO L260 CfgBuilder]: Building CFG for each procedure with an implementation [2022-04-27 13:30:24,207 INFO L275 CfgBuilder]: Performing block encoding [2022-04-27 13:30:24,212 INFO L294 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2022-04-27 13:30:24,213 INFO L299 CfgBuilder]: Removed 2 assume(true) statements. [2022-04-27 13:30:24,215 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 27.04 01:30:24 BoogieIcfgContainer [2022-04-27 13:30:24,215 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2022-04-27 13:30:24,225 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2022-04-27 13:30:24,225 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2022-04-27 13:30:24,241 INFO L275 PluginConnector]: TraceAbstraction initialized [2022-04-27 13:30:24,241 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 27.04 01:30:23" (1/3) ... [2022-04-27 13:30:24,242 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@422b52e2 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 27.04 01:30:24, skipping insertion in model container [2022-04-27 13:30:24,242 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.04 01:30:23" (2/3) ... [2022-04-27 13:30:24,242 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@422b52e2 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 27.04 01:30:24, skipping insertion in model container [2022-04-27 13:30:24,242 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 27.04 01:30:24" (3/3) ... [2022-04-27 13:30:24,243 INFO L111 eAbstractionObserver]: Analyzing ICFG hard-u_unwindbound100.c [2022-04-27 13:30:24,254 INFO L201 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2022-04-27 13:30:24,254 INFO L160 ceAbstractionStarter]: Applying trace abstraction to program that has 1 error locations. [2022-04-27 13:30:24,296 INFO L356 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2022-04-27 13:30:24,301 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@6047c812, mLbeIndependenceSettings=de.uni_freiburg.informatik.ultimate.lib.tracecheckerutils.partialorder.independence.IndependenceSettings@b37ed50 [2022-04-27 13:30:24,301 INFO L358 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2022-04-27 13:30:24,307 INFO L276 IsEmpty]: Start isEmpty. Operand has 37 states, 21 states have (on average 1.4761904761904763) internal successors, (31), 22 states have internal predecessors, (31), 10 states have call successors, (10), 4 states have call predecessors, (10), 4 states have return successors, (10), 10 states have call predecessors, (10), 10 states have call successors, (10) [2022-04-27 13:30:24,322 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 19 [2022-04-27 13:30:24,322 INFO L187 NwaCegarLoop]: Found error trace [2022-04-27 13:30:24,323 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-27 13:30:24,323 INFO L420 AbstractCegarLoop]: === Iteration 1 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-27 13:30:24,326 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-27 13:30:24,327 INFO L85 PathProgramCache]: Analyzing trace with hash 1191571617, now seen corresponding path program 1 times [2022-04-27 13:30:24,335 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-27 13:30:24,336 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [957440475] [2022-04-27 13:30:24,336 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-27 13:30:24,337 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-27 13:30:24,405 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-27 13:30:24,449 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-04-27 13:30:24,452 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-27 13:30:24,464 INFO L290 TraceCheckUtils]: 0: Hoare triple {49#(and (= ~counter~0 |old(~counter~0)|) (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(9, 2);call #Ultimate.allocInit(12, 3);~counter~0 := 0; {40#true} is VALID [2022-04-27 13:30:24,464 INFO L290 TraceCheckUtils]: 1: Hoare triple {40#true} assume true; {40#true} is VALID [2022-04-27 13:30:24,465 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {40#true} {40#true} #96#return; {40#true} is VALID [2022-04-27 13:30:24,465 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2022-04-27 13:30:24,467 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-27 13:30:24,472 INFO L290 TraceCheckUtils]: 0: Hoare triple {40#true} ~cond := #in~cond; {40#true} is VALID [2022-04-27 13:30:24,473 INFO L290 TraceCheckUtils]: 1: Hoare triple {40#true} assume 0 == ~cond;assume false; {41#false} is VALID [2022-04-27 13:30:24,473 INFO L290 TraceCheckUtils]: 2: Hoare triple {41#false} assume true; {41#false} is VALID [2022-04-27 13:30:24,473 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {41#false} {40#true} #80#return; {41#false} is VALID [2022-04-27 13:30:24,474 INFO L272 TraceCheckUtils]: 0: Hoare triple {40#true} call ULTIMATE.init(); {49#(and (= ~counter~0 |old(~counter~0)|) (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} is VALID [2022-04-27 13:30:24,474 INFO L290 TraceCheckUtils]: 1: Hoare triple {49#(and (= ~counter~0 |old(~counter~0)|) (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(9, 2);call #Ultimate.allocInit(12, 3);~counter~0 := 0; {40#true} is VALID [2022-04-27 13:30:24,474 INFO L290 TraceCheckUtils]: 2: Hoare triple {40#true} assume true; {40#true} is VALID [2022-04-27 13:30:24,475 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {40#true} {40#true} #96#return; {40#true} is VALID [2022-04-27 13:30:24,475 INFO L272 TraceCheckUtils]: 4: Hoare triple {40#true} call #t~ret8 := main(); {40#true} is VALID [2022-04-27 13:30:24,475 INFO L290 TraceCheckUtils]: 5: Hoare triple {40#true} havoc ~A~0;havoc ~B~0;havoc ~r~0;havoc ~d~0;havoc ~p~0;havoc ~q~0;~A~0 := #t~nondet4;havoc #t~nondet4;~B~0 := #t~nondet5;havoc #t~nondet5; {40#true} is VALID [2022-04-27 13:30:24,475 INFO L272 TraceCheckUtils]: 6: Hoare triple {40#true} call assume_abort_if_not((if ~B~0 % 4294967296 >= 1 then 1 else 0)); {40#true} is VALID [2022-04-27 13:30:24,475 INFO L290 TraceCheckUtils]: 7: Hoare triple {40#true} ~cond := #in~cond; {40#true} is VALID [2022-04-27 13:30:24,476 INFO L290 TraceCheckUtils]: 8: Hoare triple {40#true} assume 0 == ~cond;assume false; {41#false} is VALID [2022-04-27 13:30:24,476 INFO L290 TraceCheckUtils]: 9: Hoare triple {41#false} assume true; {41#false} is VALID [2022-04-27 13:30:24,476 INFO L284 TraceCheckUtils]: 10: Hoare quadruple {41#false} {40#true} #80#return; {41#false} is VALID [2022-04-27 13:30:24,476 INFO L290 TraceCheckUtils]: 11: Hoare triple {41#false} ~r~0 := ~A~0;~d~0 := ~B~0;~p~0 := 1;~q~0 := 0; {41#false} is VALID [2022-04-27 13:30:24,477 INFO L290 TraceCheckUtils]: 12: Hoare triple {41#false} assume !true; {41#false} is VALID [2022-04-27 13:30:24,477 INFO L290 TraceCheckUtils]: 13: Hoare triple {41#false} assume !true; {41#false} is VALID [2022-04-27 13:30:24,477 INFO L272 TraceCheckUtils]: 14: Hoare triple {41#false} call __VERIFIER_assert((if ~A~0 % 4294967296 == (~d~0 * ~q~0 + ~r~0) % 4294967296 then 1 else 0)); {41#false} is VALID [2022-04-27 13:30:24,477 INFO L290 TraceCheckUtils]: 15: Hoare triple {41#false} ~cond := #in~cond; {41#false} is VALID [2022-04-27 13:30:24,477 INFO L290 TraceCheckUtils]: 16: Hoare triple {41#false} assume 0 == ~cond; {41#false} is VALID [2022-04-27 13:30:24,477 INFO L290 TraceCheckUtils]: 17: Hoare triple {41#false} assume !false; {41#false} is VALID [2022-04-27 13:30:24,478 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-04-27 13:30:24,478 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-27 13:30:24,478 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [957440475] [2022-04-27 13:30:24,479 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [957440475] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-27 13:30:24,479 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-27 13:30:24,479 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-04-27 13:30:24,480 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [798253332] [2022-04-27 13:30:24,481 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-27 13:30:24,485 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 4.0) internal successors, (12), 2 states have internal predecessors, (12), 2 states have call successors, (4), 3 states have call predecessors, (4), 2 states have return successors, (2), 2 states have call predecessors, (2), 1 states have call successors, (2) Word has length 18 [2022-04-27 13:30:24,487 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-27 13:30:24,489 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with has 3 states, 3 states have (on average 4.0) internal successors, (12), 2 states have internal predecessors, (12), 2 states have call successors, (4), 3 states have call predecessors, (4), 2 states have return successors, (2), 2 states have call predecessors, (2), 1 states have call successors, (2) [2022-04-27 13:30:24,524 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 18 edges. 18 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-27 13:30:24,525 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-04-27 13:30:24,525 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-04-27 13:30:24,549 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-04-27 13:30:24,551 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-04-27 13:30:24,554 INFO L87 Difference]: Start difference. First operand has 37 states, 21 states have (on average 1.4761904761904763) internal successors, (31), 22 states have internal predecessors, (31), 10 states have call successors, (10), 4 states have call predecessors, (10), 4 states have return successors, (10), 10 states have call predecessors, (10), 10 states have call successors, (10) Second operand has 3 states, 3 states have (on average 4.0) internal successors, (12), 2 states have internal predecessors, (12), 2 states have call successors, (4), 3 states have call predecessors, (4), 2 states have return successors, (2), 2 states have call predecessors, (2), 1 states have call successors, (2) [2022-04-27 13:30:24,788 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-27 13:30:24,788 INFO L93 Difference]: Finished difference Result 66 states and 101 transitions. [2022-04-27 13:30:24,788 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-04-27 13:30:24,788 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 4.0) internal successors, (12), 2 states have internal predecessors, (12), 2 states have call successors, (4), 3 states have call predecessors, (4), 2 states have return successors, (2), 2 states have call predecessors, (2), 1 states have call successors, (2) Word has length 18 [2022-04-27 13:30:24,789 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-27 13:30:24,790 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3 states, 3 states have (on average 4.0) internal successors, (12), 2 states have internal predecessors, (12), 2 states have call successors, (4), 3 states have call predecessors, (4), 2 states have return successors, (2), 2 states have call predecessors, (2), 1 states have call successors, (2) [2022-04-27 13:30:24,805 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 101 transitions. [2022-04-27 13:30:24,805 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3 states, 3 states have (on average 4.0) internal successors, (12), 2 states have internal predecessors, (12), 2 states have call successors, (4), 3 states have call predecessors, (4), 2 states have return successors, (2), 2 states have call predecessors, (2), 1 states have call successors, (2) [2022-04-27 13:30:24,814 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 101 transitions. [2022-04-27 13:30:24,814 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 3 states and 101 transitions. [2022-04-27 13:30:24,942 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 101 edges. 101 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-27 13:30:24,951 INFO L225 Difference]: With dead ends: 66 [2022-04-27 13:30:24,952 INFO L226 Difference]: Without dead ends: 33 [2022-04-27 13:30:24,955 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 6 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 13:30:24,959 INFO L413 NwaCegarLoop]: 45 mSDtfsCounter, 10 mSDsluCounter, 4 mSDsCounter, 0 mSdLazyCounter, 24 mSolverCounterSat, 9 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 11 SdHoareTripleChecker+Valid, 49 SdHoareTripleChecker+Invalid, 33 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 9 IncrementalHoareTripleChecker+Valid, 24 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-04-27 13:30:24,961 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [11 Valid, 49 Invalid, 33 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [9 Valid, 24 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-04-27 13:30:24,974 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 33 states. [2022-04-27 13:30:24,991 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 33 to 32. [2022-04-27 13:30:24,991 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-27 13:30:24,993 INFO L82 GeneralOperation]: Start isEquivalent. First operand 33 states. Second operand has 32 states, 18 states have (on average 1.3333333333333333) internal successors, (24), 19 states have internal predecessors, (24), 10 states have call successors, (10), 4 states have call predecessors, (10), 3 states have return successors, (8), 8 states have call predecessors, (8), 8 states have call successors, (8) [2022-04-27 13:30:24,994 INFO L74 IsIncluded]: Start isIncluded. First operand 33 states. Second operand has 32 states, 18 states have (on average 1.3333333333333333) internal successors, (24), 19 states have internal predecessors, (24), 10 states have call successors, (10), 4 states have call predecessors, (10), 3 states have return successors, (8), 8 states have call predecessors, (8), 8 states have call successors, (8) [2022-04-27 13:30:24,994 INFO L87 Difference]: Start difference. First operand 33 states. Second operand has 32 states, 18 states have (on average 1.3333333333333333) internal successors, (24), 19 states have internal predecessors, (24), 10 states have call successors, (10), 4 states have call predecessors, (10), 3 states have return successors, (8), 8 states have call predecessors, (8), 8 states have call successors, (8) [2022-04-27 13:30:24,999 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-27 13:30:25,000 INFO L93 Difference]: Finished difference Result 33 states and 43 transitions. [2022-04-27 13:30:25,000 INFO L276 IsEmpty]: Start isEmpty. Operand 33 states and 43 transitions. [2022-04-27 13:30:25,000 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-27 13:30:25,000 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-27 13:30:25,001 INFO L74 IsIncluded]: Start isIncluded. First operand has 32 states, 18 states have (on average 1.3333333333333333) internal successors, (24), 19 states have internal predecessors, (24), 10 states have call successors, (10), 4 states have call predecessors, (10), 3 states have return successors, (8), 8 states have call predecessors, (8), 8 states have call successors, (8) Second operand 33 states. [2022-04-27 13:30:25,001 INFO L87 Difference]: Start difference. First operand has 32 states, 18 states have (on average 1.3333333333333333) internal successors, (24), 19 states have internal predecessors, (24), 10 states have call successors, (10), 4 states have call predecessors, (10), 3 states have return successors, (8), 8 states have call predecessors, (8), 8 states have call successors, (8) Second operand 33 states. [2022-04-27 13:30:25,003 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-27 13:30:25,004 INFO L93 Difference]: Finished difference Result 33 states and 43 transitions. [2022-04-27 13:30:25,004 INFO L276 IsEmpty]: Start isEmpty. Operand 33 states and 43 transitions. [2022-04-27 13:30:25,004 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-27 13:30:25,004 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-27 13:30:25,005 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-27 13:30:25,005 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-27 13:30:25,005 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 32 states, 18 states have (on average 1.3333333333333333) internal successors, (24), 19 states have internal predecessors, (24), 10 states have call successors, (10), 4 states have call predecessors, (10), 3 states have return successors, (8), 8 states have call predecessors, (8), 8 states have call successors, (8) [2022-04-27 13:30:25,007 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 32 states to 32 states and 42 transitions. [2022-04-27 13:30:25,008 INFO L78 Accepts]: Start accepts. Automaton has 32 states and 42 transitions. Word has length 18 [2022-04-27 13:30:25,008 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-27 13:30:25,008 INFO L495 AbstractCegarLoop]: Abstraction has 32 states and 42 transitions. [2022-04-27 13:30:25,008 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 4.0) internal successors, (12), 2 states have internal predecessors, (12), 2 states have call successors, (4), 3 states have call predecessors, (4), 2 states have return successors, (2), 2 states have call predecessors, (2), 1 states have call successors, (2) [2022-04-27 13:30:25,008 INFO L276 IsEmpty]: Start isEmpty. Operand 32 states and 42 transitions. [2022-04-27 13:30:25,009 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 19 [2022-04-27 13:30:25,009 INFO L187 NwaCegarLoop]: Found error trace [2022-04-27 13:30:25,009 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-27 13:30:25,009 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2022-04-27 13:30:25,009 INFO L420 AbstractCegarLoop]: === Iteration 2 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-27 13:30:25,010 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-27 13:30:25,010 INFO L85 PathProgramCache]: Analyzing trace with hash 336486197, now seen corresponding path program 1 times [2022-04-27 13:30:25,010 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-27 13:30:25,010 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1108266961] [2022-04-27 13:30:25,010 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-27 13:30:25,011 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-27 13:30:25,030 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-27 13:30:25,071 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-04-27 13:30:25,074 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-27 13:30:25,079 INFO L290 TraceCheckUtils]: 0: Hoare triple {268#(and (= ~counter~0 |old(~counter~0)|) (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(9, 2);call #Ultimate.allocInit(12, 3);~counter~0 := 0; {256#true} is VALID [2022-04-27 13:30:25,079 INFO L290 TraceCheckUtils]: 1: Hoare triple {256#true} assume true; {256#true} is VALID [2022-04-27 13:30:25,079 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {256#true} {256#true} #96#return; {256#true} is VALID [2022-04-27 13:30:25,079 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2022-04-27 13:30:25,080 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-27 13:30:25,084 INFO L290 TraceCheckUtils]: 0: Hoare triple {256#true} ~cond := #in~cond; {256#true} is VALID [2022-04-27 13:30:25,084 INFO L290 TraceCheckUtils]: 1: Hoare triple {256#true} assume !(0 == ~cond); {256#true} is VALID [2022-04-27 13:30:25,084 INFO L290 TraceCheckUtils]: 2: Hoare triple {256#true} assume true; {256#true} is VALID [2022-04-27 13:30:25,085 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {256#true} {256#true} #80#return; {256#true} is VALID [2022-04-27 13:30:25,085 INFO L272 TraceCheckUtils]: 0: Hoare triple {256#true} call ULTIMATE.init(); {268#(and (= ~counter~0 |old(~counter~0)|) (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} is VALID [2022-04-27 13:30:25,085 INFO L290 TraceCheckUtils]: 1: Hoare triple {268#(and (= ~counter~0 |old(~counter~0)|) (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(9, 2);call #Ultimate.allocInit(12, 3);~counter~0 := 0; {256#true} is VALID [2022-04-27 13:30:25,085 INFO L290 TraceCheckUtils]: 2: Hoare triple {256#true} assume true; {256#true} is VALID [2022-04-27 13:30:25,086 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {256#true} {256#true} #96#return; {256#true} is VALID [2022-04-27 13:30:25,086 INFO L272 TraceCheckUtils]: 4: Hoare triple {256#true} call #t~ret8 := main(); {256#true} is VALID [2022-04-27 13:30:25,086 INFO L290 TraceCheckUtils]: 5: Hoare triple {256#true} havoc ~A~0;havoc ~B~0;havoc ~r~0;havoc ~d~0;havoc ~p~0;havoc ~q~0;~A~0 := #t~nondet4;havoc #t~nondet4;~B~0 := #t~nondet5;havoc #t~nondet5; {256#true} is VALID [2022-04-27 13:30:25,086 INFO L272 TraceCheckUtils]: 6: Hoare triple {256#true} call assume_abort_if_not((if ~B~0 % 4294967296 >= 1 then 1 else 0)); {256#true} is VALID [2022-04-27 13:30:25,086 INFO L290 TraceCheckUtils]: 7: Hoare triple {256#true} ~cond := #in~cond; {256#true} is VALID [2022-04-27 13:30:25,086 INFO L290 TraceCheckUtils]: 8: Hoare triple {256#true} assume !(0 == ~cond); {256#true} is VALID [2022-04-27 13:30:25,086 INFO L290 TraceCheckUtils]: 9: Hoare triple {256#true} assume true; {256#true} is VALID [2022-04-27 13:30:25,086 INFO L284 TraceCheckUtils]: 10: Hoare quadruple {256#true} {256#true} #80#return; {256#true} is VALID [2022-04-27 13:30:25,087 INFO L290 TraceCheckUtils]: 11: Hoare triple {256#true} ~r~0 := ~A~0;~d~0 := ~B~0;~p~0 := 1;~q~0 := 0; {265#(= main_~q~0 0)} is VALID [2022-04-27 13:30:25,087 INFO L290 TraceCheckUtils]: 12: Hoare triple {265#(= main_~q~0 0)} #t~post6 := ~counter~0;~counter~0 := 1 + #t~post6; {265#(= main_~q~0 0)} is VALID [2022-04-27 13:30:25,088 INFO L290 TraceCheckUtils]: 13: Hoare triple {265#(= main_~q~0 0)} assume !!(#t~post6 < 100);havoc #t~post6; {265#(= main_~q~0 0)} is VALID [2022-04-27 13:30:25,088 INFO L272 TraceCheckUtils]: 14: Hoare triple {265#(= main_~q~0 0)} call __VERIFIER_assert((if 0 == ~q~0 % 4294967296 then 1 else 0)); {266#(not (= |__VERIFIER_assert_#in~cond| 0))} is VALID [2022-04-27 13:30:25,089 INFO L290 TraceCheckUtils]: 15: Hoare triple {266#(not (= |__VERIFIER_assert_#in~cond| 0))} ~cond := #in~cond; {267#(not (= __VERIFIER_assert_~cond 0))} is VALID [2022-04-27 13:30:25,089 INFO L290 TraceCheckUtils]: 16: Hoare triple {267#(not (= __VERIFIER_assert_~cond 0))} assume 0 == ~cond; {257#false} is VALID [2022-04-27 13:30:25,089 INFO L290 TraceCheckUtils]: 17: Hoare triple {257#false} assume !false; {257#false} is VALID [2022-04-27 13:30:25,089 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-04-27 13:30:25,089 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-27 13:30:25,090 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1108266961] [2022-04-27 13:30:25,090 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1108266961] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-27 13:30:25,090 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-27 13:30:25,090 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2022-04-27 13:30:25,090 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [70443461] [2022-04-27 13:30:25,090 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-27 13:30:25,091 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 2.0) internal successors, (12), 4 states have internal predecessors, (12), 2 states have call successors, (4), 3 states have call predecessors, (4), 1 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) Word has length 18 [2022-04-27 13:30:25,091 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-27 13:30:25,091 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with has 6 states, 6 states have (on average 2.0) internal successors, (12), 4 states have internal predecessors, (12), 2 states have call successors, (4), 3 states have call predecessors, (4), 1 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) [2022-04-27 13:30:25,103 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 18 edges. 18 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-27 13:30:25,103 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2022-04-27 13:30:25,103 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-04-27 13:30:25,104 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2022-04-27 13:30:25,104 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2022-04-27 13:30:25,104 INFO L87 Difference]: Start difference. First operand 32 states and 42 transitions. Second operand has 6 states, 6 states have (on average 2.0) internal successors, (12), 4 states have internal predecessors, (12), 2 states have call successors, (4), 3 states have call predecessors, (4), 1 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) [2022-04-27 13:30:25,462 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-27 13:30:25,462 INFO L93 Difference]: Finished difference Result 47 states and 62 transitions. [2022-04-27 13:30:25,462 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2022-04-27 13:30:25,462 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 2.0) internal successors, (12), 4 states have internal predecessors, (12), 2 states have call successors, (4), 3 states have call predecessors, (4), 1 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) Word has length 18 [2022-04-27 13:30:25,463 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-27 13:30:25,463 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 6 states, 6 states have (on average 2.0) internal successors, (12), 4 states have internal predecessors, (12), 2 states have call successors, (4), 3 states have call predecessors, (4), 1 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) [2022-04-27 13:30:25,468 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8 states to 8 states and 62 transitions. [2022-04-27 13:30:25,469 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 6 states, 6 states have (on average 2.0) internal successors, (12), 4 states have internal predecessors, (12), 2 states have call successors, (4), 3 states have call predecessors, (4), 1 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) [2022-04-27 13:30:25,472 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8 states to 8 states and 62 transitions. [2022-04-27 13:30:25,472 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 8 states and 62 transitions. [2022-04-27 13:30:25,523 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 62 edges. 62 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-27 13:30:25,525 INFO L225 Difference]: With dead ends: 47 [2022-04-27 13:30:25,525 INFO L226 Difference]: Without dead ends: 45 [2022-04-27 13:30:25,525 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 13 GetRequests, 5 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=28, Invalid=62, Unknown=0, NotChecked=0, Total=90 [2022-04-27 13:30:25,526 INFO L413 NwaCegarLoop]: 39 mSDtfsCounter, 28 mSDsluCounter, 51 mSDsCounter, 0 mSdLazyCounter, 99 mSolverCounterSat, 14 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 35 SdHoareTripleChecker+Valid, 90 SdHoareTripleChecker+Invalid, 113 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 14 IncrementalHoareTripleChecker+Valid, 99 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-04-27 13:30:25,526 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [35 Valid, 90 Invalid, 113 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [14 Valid, 99 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-04-27 13:30:25,527 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 45 states. [2022-04-27 13:30:25,531 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 45 to 36. [2022-04-27 13:30:25,531 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-27 13:30:25,532 INFO L82 GeneralOperation]: Start isEquivalent. First operand 45 states. Second operand has 36 states, 21 states have (on average 1.2857142857142858) internal successors, (27), 22 states have internal predecessors, (27), 10 states have call successors, (10), 5 states have call predecessors, (10), 4 states have return successors, (8), 8 states have call predecessors, (8), 8 states have call successors, (8) [2022-04-27 13:30:25,532 INFO L74 IsIncluded]: Start isIncluded. First operand 45 states. Second operand has 36 states, 21 states have (on average 1.2857142857142858) internal successors, (27), 22 states have internal predecessors, (27), 10 states have call successors, (10), 5 states have call predecessors, (10), 4 states have return successors, (8), 8 states have call predecessors, (8), 8 states have call successors, (8) [2022-04-27 13:30:25,532 INFO L87 Difference]: Start difference. First operand 45 states. Second operand has 36 states, 21 states have (on average 1.2857142857142858) internal successors, (27), 22 states have internal predecessors, (27), 10 states have call successors, (10), 5 states have call predecessors, (10), 4 states have return successors, (8), 8 states have call predecessors, (8), 8 states have call successors, (8) [2022-04-27 13:30:25,534 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-27 13:30:25,535 INFO L93 Difference]: Finished difference Result 45 states and 60 transitions. [2022-04-27 13:30:25,535 INFO L276 IsEmpty]: Start isEmpty. Operand 45 states and 60 transitions. [2022-04-27 13:30:25,535 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-27 13:30:25,535 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-27 13:30:25,536 INFO L74 IsIncluded]: Start isIncluded. First operand has 36 states, 21 states have (on average 1.2857142857142858) internal successors, (27), 22 states have internal predecessors, (27), 10 states have call successors, (10), 5 states have call predecessors, (10), 4 states have return successors, (8), 8 states have call predecessors, (8), 8 states have call successors, (8) Second operand 45 states. [2022-04-27 13:30:25,536 INFO L87 Difference]: Start difference. First operand has 36 states, 21 states have (on average 1.2857142857142858) internal successors, (27), 22 states have internal predecessors, (27), 10 states have call successors, (10), 5 states have call predecessors, (10), 4 states have return successors, (8), 8 states have call predecessors, (8), 8 states have call successors, (8) Second operand 45 states. [2022-04-27 13:30:25,538 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-27 13:30:25,538 INFO L93 Difference]: Finished difference Result 45 states and 60 transitions. [2022-04-27 13:30:25,538 INFO L276 IsEmpty]: Start isEmpty. Operand 45 states and 60 transitions. [2022-04-27 13:30:25,539 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-27 13:30:25,539 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-27 13:30:25,539 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-27 13:30:25,539 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-27 13:30:25,540 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 36 states, 21 states have (on average 1.2857142857142858) internal successors, (27), 22 states have internal predecessors, (27), 10 states have call successors, (10), 5 states have call predecessors, (10), 4 states have return successors, (8), 8 states have call predecessors, (8), 8 states have call successors, (8) [2022-04-27 13:30:25,541 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 36 states to 36 states and 45 transitions. [2022-04-27 13:30:25,541 INFO L78 Accepts]: Start accepts. Automaton has 36 states and 45 transitions. Word has length 18 [2022-04-27 13:30:25,541 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-27 13:30:25,541 INFO L495 AbstractCegarLoop]: Abstraction has 36 states and 45 transitions. [2022-04-27 13:30:25,542 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 2.0) internal successors, (12), 4 states have internal predecessors, (12), 2 states have call successors, (4), 3 states have call predecessors, (4), 1 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) [2022-04-27 13:30:25,542 INFO L276 IsEmpty]: Start isEmpty. Operand 36 states and 45 transitions. [2022-04-27 13:30:25,542 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 21 [2022-04-27 13:30:25,542 INFO L187 NwaCegarLoop]: Found error trace [2022-04-27 13:30:25,542 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-27 13:30:25,542 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2022-04-27 13:30:25,543 INFO L420 AbstractCegarLoop]: === Iteration 3 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-27 13:30:25,543 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-27 13:30:25,543 INFO L85 PathProgramCache]: Analyzing trace with hash -1819267188, now seen corresponding path program 1 times [2022-04-27 13:30:25,543 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-27 13:30:25,543 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1196723216] [2022-04-27 13:30:25,543 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-27 13:30:25,544 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-27 13:30:25,556 ERROR L245 FreeRefinementEngine]: Caught known exception: Unsupported non-linear arithmetic [2022-04-27 13:30:25,557 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [1222999012] [2022-04-27 13:30:25,557 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-27 13:30:25,557 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-27 13:30:25,557 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-04-27 13:30:25,558 INFO L229 MonitoredProcess]: Starting monitored process 2 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-04-27 13:30:25,574 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Waiting until timeout for monitored process [2022-04-27 13:30:25,621 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-27 13:30:25,623 INFO L263 TraceCheckSpWp]: Trace formula consists of 87 conjuncts, 5 conjunts are in the unsatisfiable core [2022-04-27 13:30:25,632 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-27 13:30:25,634 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-04-27 13:30:25,802 INFO L272 TraceCheckUtils]: 0: Hoare triple {489#true} call ULTIMATE.init(); {489#true} is VALID [2022-04-27 13:30:25,802 INFO L290 TraceCheckUtils]: 1: Hoare triple {489#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);call #Ultimate.allocInit(12, 3);~counter~0 := 0; {497#(<= ~counter~0 0)} is VALID [2022-04-27 13:30:25,803 INFO L290 TraceCheckUtils]: 2: Hoare triple {497#(<= ~counter~0 0)} assume true; {497#(<= ~counter~0 0)} is VALID [2022-04-27 13:30:25,803 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {497#(<= ~counter~0 0)} {489#true} #96#return; {497#(<= ~counter~0 0)} is VALID [2022-04-27 13:30:25,804 INFO L272 TraceCheckUtils]: 4: Hoare triple {497#(<= ~counter~0 0)} call #t~ret8 := main(); {497#(<= ~counter~0 0)} is VALID [2022-04-27 13:30:25,804 INFO L290 TraceCheckUtils]: 5: Hoare triple {497#(<= ~counter~0 0)} havoc ~A~0;havoc ~B~0;havoc ~r~0;havoc ~d~0;havoc ~p~0;havoc ~q~0;~A~0 := #t~nondet4;havoc #t~nondet4;~B~0 := #t~nondet5;havoc #t~nondet5; {497#(<= ~counter~0 0)} is VALID [2022-04-27 13:30:25,805 INFO L272 TraceCheckUtils]: 6: Hoare triple {497#(<= ~counter~0 0)} call assume_abort_if_not((if ~B~0 % 4294967296 >= 1 then 1 else 0)); {497#(<= ~counter~0 0)} is VALID [2022-04-27 13:30:25,805 INFO L290 TraceCheckUtils]: 7: Hoare triple {497#(<= ~counter~0 0)} ~cond := #in~cond; {497#(<= ~counter~0 0)} is VALID [2022-04-27 13:30:25,805 INFO L290 TraceCheckUtils]: 8: Hoare triple {497#(<= ~counter~0 0)} assume !(0 == ~cond); {497#(<= ~counter~0 0)} is VALID [2022-04-27 13:30:25,806 INFO L290 TraceCheckUtils]: 9: Hoare triple {497#(<= ~counter~0 0)} assume true; {497#(<= ~counter~0 0)} is VALID [2022-04-27 13:30:25,806 INFO L284 TraceCheckUtils]: 10: Hoare quadruple {497#(<= ~counter~0 0)} {497#(<= ~counter~0 0)} #80#return; {497#(<= ~counter~0 0)} is VALID [2022-04-27 13:30:25,807 INFO L290 TraceCheckUtils]: 11: Hoare triple {497#(<= ~counter~0 0)} ~r~0 := ~A~0;~d~0 := ~B~0;~p~0 := 1;~q~0 := 0; {497#(<= ~counter~0 0)} is VALID [2022-04-27 13:30:25,807 INFO L290 TraceCheckUtils]: 12: Hoare triple {497#(<= ~counter~0 0)} #t~post6 := ~counter~0;~counter~0 := 1 + #t~post6; {531#(<= |main_#t~post6| 0)} is VALID [2022-04-27 13:30:25,807 INFO L290 TraceCheckUtils]: 13: Hoare triple {531#(<= |main_#t~post6| 0)} assume !(#t~post6 < 100);havoc #t~post6; {490#false} is VALID [2022-04-27 13:30:25,808 INFO L290 TraceCheckUtils]: 14: Hoare triple {490#false} #t~post7 := ~counter~0;~counter~0 := 1 + #t~post7; {490#false} is VALID [2022-04-27 13:30:25,808 INFO L290 TraceCheckUtils]: 15: Hoare triple {490#false} assume !(#t~post7 < 100);havoc #t~post7; {490#false} is VALID [2022-04-27 13:30:25,808 INFO L272 TraceCheckUtils]: 16: Hoare triple {490#false} call __VERIFIER_assert((if ~A~0 % 4294967296 == (~d~0 * ~q~0 + ~r~0) % 4294967296 then 1 else 0)); {490#false} is VALID [2022-04-27 13:30:25,808 INFO L290 TraceCheckUtils]: 17: Hoare triple {490#false} ~cond := #in~cond; {490#false} is VALID [2022-04-27 13:30:25,808 INFO L290 TraceCheckUtils]: 18: Hoare triple {490#false} assume 0 == ~cond; {490#false} is VALID [2022-04-27 13:30:25,808 INFO L290 TraceCheckUtils]: 19: Hoare triple {490#false} assume !false; {490#false} is VALID [2022-04-27 13:30:25,808 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-04-27 13:30:25,809 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-04-27 13:30:25,809 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-27 13:30:25,809 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1196723216] [2022-04-27 13:30:25,809 WARN L310 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2022-04-27 13:30:25,809 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1222999012] [2022-04-27 13:30:25,809 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1222999012] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-27 13:30:25,809 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-27 13:30:25,809 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-04-27 13:30:25,809 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [188744053] [2022-04-27 13:30:25,810 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-27 13:30:25,810 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 3.5) internal successors, (14), 3 states have internal predecessors, (14), 3 states have call successors, (4), 3 states have call predecessors, (4), 1 states have return successors, (2), 1 states have call predecessors, (2), 2 states have call successors, (2) Word has length 20 [2022-04-27 13:30:25,810 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-27 13:30:25,810 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with has 4 states, 4 states have (on average 3.5) internal successors, (14), 3 states have internal predecessors, (14), 3 states have call successors, (4), 3 states have call predecessors, (4), 1 states have return successors, (2), 1 states have call predecessors, (2), 2 states have call successors, (2) [2022-04-27 13:30:25,830 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 20 edges. 20 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-27 13:30:25,830 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-04-27 13:30:25,831 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-04-27 13:30:25,831 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-04-27 13:30:25,832 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-04-27 13:30:25,833 INFO L87 Difference]: Start difference. First operand 36 states and 45 transitions. Second operand has 4 states, 4 states have (on average 3.5) internal successors, (14), 3 states have internal predecessors, (14), 3 states have call successors, (4), 3 states have call predecessors, (4), 1 states have return successors, (2), 1 states have call predecessors, (2), 2 states have call successors, (2) [2022-04-27 13:30:25,945 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-27 13:30:25,945 INFO L93 Difference]: Finished difference Result 52 states and 67 transitions. [2022-04-27 13:30:25,945 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-04-27 13:30:25,946 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 3.5) internal successors, (14), 3 states have internal predecessors, (14), 3 states have call successors, (4), 3 states have call predecessors, (4), 1 states have return successors, (2), 1 states have call predecessors, (2), 2 states have call successors, (2) Word has length 20 [2022-04-27 13:30:25,946 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-27 13:30:25,946 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 4 states, 4 states have (on average 3.5) internal successors, (14), 3 states have internal predecessors, (14), 3 states have call successors, (4), 3 states have call predecessors, (4), 1 states have return successors, (2), 1 states have call predecessors, (2), 2 states have call successors, (2) [2022-04-27 13:30:25,947 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 64 transitions. [2022-04-27 13:30:25,948 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 4 states, 4 states have (on average 3.5) internal successors, (14), 3 states have internal predecessors, (14), 3 states have call successors, (4), 3 states have call predecessors, (4), 1 states have return successors, (2), 1 states have call predecessors, (2), 2 states have call successors, (2) [2022-04-27 13:30:25,949 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 64 transitions. [2022-04-27 13:30:25,949 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 4 states and 64 transitions. [2022-04-27 13:30:26,006 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 64 edges. 64 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-27 13:30:26,007 INFO L225 Difference]: With dead ends: 52 [2022-04-27 13:30:26,007 INFO L226 Difference]: Without dead ends: 38 [2022-04-27 13:30:26,007 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 19 GetRequests, 17 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-04-27 13:30:26,008 INFO L413 NwaCegarLoop]: 40 mSDtfsCounter, 0 mSDsluCounter, 67 mSDsCounter, 0 mSdLazyCounter, 8 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 107 SdHoareTripleChecker+Invalid, 8 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 8 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-04-27 13:30:26,008 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 107 Invalid, 8 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 8 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-04-27 13:30:26,009 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 38 states. [2022-04-27 13:30:26,014 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 38 to 38. [2022-04-27 13:30:26,015 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-27 13:30:26,015 INFO L82 GeneralOperation]: Start isEquivalent. First operand 38 states. Second operand has 38 states, 23 states have (on average 1.2608695652173914) internal successors, (29), 24 states have internal predecessors, (29), 10 states have call successors, (10), 5 states have call predecessors, (10), 4 states have return successors, (8), 8 states have call predecessors, (8), 8 states have call successors, (8) [2022-04-27 13:30:26,015 INFO L74 IsIncluded]: Start isIncluded. First operand 38 states. Second operand has 38 states, 23 states have (on average 1.2608695652173914) internal successors, (29), 24 states have internal predecessors, (29), 10 states have call successors, (10), 5 states have call predecessors, (10), 4 states have return successors, (8), 8 states have call predecessors, (8), 8 states have call successors, (8) [2022-04-27 13:30:26,015 INFO L87 Difference]: Start difference. First operand 38 states. Second operand has 38 states, 23 states have (on average 1.2608695652173914) internal successors, (29), 24 states have internal predecessors, (29), 10 states have call successors, (10), 5 states have call predecessors, (10), 4 states have return successors, (8), 8 states have call predecessors, (8), 8 states have call successors, (8) [2022-04-27 13:30:26,017 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-27 13:30:26,017 INFO L93 Difference]: Finished difference Result 38 states and 47 transitions. [2022-04-27 13:30:26,017 INFO L276 IsEmpty]: Start isEmpty. Operand 38 states and 47 transitions. [2022-04-27 13:30:26,018 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-27 13:30:26,018 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-27 13:30:26,018 INFO L74 IsIncluded]: Start isIncluded. First operand has 38 states, 23 states have (on average 1.2608695652173914) internal successors, (29), 24 states have internal predecessors, (29), 10 states have call successors, (10), 5 states have call predecessors, (10), 4 states have return successors, (8), 8 states have call predecessors, (8), 8 states have call successors, (8) Second operand 38 states. [2022-04-27 13:30:26,018 INFO L87 Difference]: Start difference. First operand has 38 states, 23 states have (on average 1.2608695652173914) internal successors, (29), 24 states have internal predecessors, (29), 10 states have call successors, (10), 5 states have call predecessors, (10), 4 states have return successors, (8), 8 states have call predecessors, (8), 8 states have call successors, (8) Second operand 38 states. [2022-04-27 13:30:26,020 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-27 13:30:26,020 INFO L93 Difference]: Finished difference Result 38 states and 47 transitions. [2022-04-27 13:30:26,020 INFO L276 IsEmpty]: Start isEmpty. Operand 38 states and 47 transitions. [2022-04-27 13:30:26,021 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-27 13:30:26,021 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-27 13:30:26,021 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-27 13:30:26,021 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-27 13:30:26,021 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 38 states, 23 states have (on average 1.2608695652173914) internal successors, (29), 24 states have internal predecessors, (29), 10 states have call successors, (10), 5 states have call predecessors, (10), 4 states have return successors, (8), 8 states have call predecessors, (8), 8 states have call successors, (8) [2022-04-27 13:30:26,022 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 38 states to 38 states and 47 transitions. [2022-04-27 13:30:26,022 INFO L78 Accepts]: Start accepts. Automaton has 38 states and 47 transitions. Word has length 20 [2022-04-27 13:30:26,023 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-27 13:30:26,023 INFO L495 AbstractCegarLoop]: Abstraction has 38 states and 47 transitions. [2022-04-27 13:30:26,023 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 3.5) internal successors, (14), 3 states have internal predecessors, (14), 3 states have call successors, (4), 3 states have call predecessors, (4), 1 states have return successors, (2), 1 states have call predecessors, (2), 2 states have call successors, (2) [2022-04-27 13:30:26,023 INFO L276 IsEmpty]: Start isEmpty. Operand 38 states and 47 transitions. [2022-04-27 13:30:26,023 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 24 [2022-04-27 13:30:26,023 INFO L187 NwaCegarLoop]: Found error trace [2022-04-27 13:30:26,024 INFO L195 NwaCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-27 13:30:26,044 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Forceful destruction successful, exit code 0 [2022-04-27 13:30:26,241 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2,2 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-27 13:30:26,242 INFO L420 AbstractCegarLoop]: === Iteration 4 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-27 13:30:26,242 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-27 13:30:26,242 INFO L85 PathProgramCache]: Analyzing trace with hash -784889968, now seen corresponding path program 1 times [2022-04-27 13:30:26,242 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-27 13:30:26,242 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1789000267] [2022-04-27 13:30:26,243 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-27 13:30:26,243 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-27 13:30:26,271 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-27 13:30:26,320 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-04-27 13:30:26,322 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-27 13:30:26,326 INFO L290 TraceCheckUtils]: 0: Hoare triple {773#(and (= ~counter~0 |old(~counter~0)|) (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(9, 2);call #Ultimate.allocInit(12, 3);~counter~0 := 0; {757#true} is VALID [2022-04-27 13:30:26,327 INFO L290 TraceCheckUtils]: 1: Hoare triple {757#true} assume true; {757#true} is VALID [2022-04-27 13:30:26,327 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {757#true} {757#true} #96#return; {757#true} is VALID [2022-04-27 13:30:26,327 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2022-04-27 13:30:26,328 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-27 13:30:26,337 INFO L290 TraceCheckUtils]: 0: Hoare triple {757#true} ~cond := #in~cond; {757#true} is VALID [2022-04-27 13:30:26,338 INFO L290 TraceCheckUtils]: 1: Hoare triple {757#true} assume !(0 == ~cond); {757#true} is VALID [2022-04-27 13:30:26,338 INFO L290 TraceCheckUtils]: 2: Hoare triple {757#true} assume true; {757#true} is VALID [2022-04-27 13:30:26,338 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {757#true} {757#true} #80#return; {757#true} is VALID [2022-04-27 13:30:26,338 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 14 [2022-04-27 13:30:26,340 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-27 13:30:26,344 INFO L290 TraceCheckUtils]: 0: Hoare triple {757#true} ~cond := #in~cond; {757#true} is VALID [2022-04-27 13:30:26,344 INFO L290 TraceCheckUtils]: 1: Hoare triple {757#true} assume !(0 == ~cond); {757#true} is VALID [2022-04-27 13:30:26,344 INFO L290 TraceCheckUtils]: 2: Hoare triple {757#true} assume true; {757#true} is VALID [2022-04-27 13:30:26,345 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {757#true} {766#(= (+ main_~A~0 (* (- 1) main_~r~0)) 0)} #82#return; {766#(= (+ main_~A~0 (* (- 1) main_~r~0)) 0)} is VALID [2022-04-27 13:30:26,346 INFO L272 TraceCheckUtils]: 0: Hoare triple {757#true} call ULTIMATE.init(); {773#(and (= ~counter~0 |old(~counter~0)|) (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} is VALID [2022-04-27 13:30:26,346 INFO L290 TraceCheckUtils]: 1: Hoare triple {773#(and (= ~counter~0 |old(~counter~0)|) (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(9, 2);call #Ultimate.allocInit(12, 3);~counter~0 := 0; {757#true} is VALID [2022-04-27 13:30:26,346 INFO L290 TraceCheckUtils]: 2: Hoare triple {757#true} assume true; {757#true} is VALID [2022-04-27 13:30:26,346 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {757#true} {757#true} #96#return; {757#true} is VALID [2022-04-27 13:30:26,346 INFO L272 TraceCheckUtils]: 4: Hoare triple {757#true} call #t~ret8 := main(); {757#true} is VALID [2022-04-27 13:30:26,346 INFO L290 TraceCheckUtils]: 5: Hoare triple {757#true} havoc ~A~0;havoc ~B~0;havoc ~r~0;havoc ~d~0;havoc ~p~0;havoc ~q~0;~A~0 := #t~nondet4;havoc #t~nondet4;~B~0 := #t~nondet5;havoc #t~nondet5; {757#true} is VALID [2022-04-27 13:30:26,346 INFO L272 TraceCheckUtils]: 6: Hoare triple {757#true} call assume_abort_if_not((if ~B~0 % 4294967296 >= 1 then 1 else 0)); {757#true} is VALID [2022-04-27 13:30:26,347 INFO L290 TraceCheckUtils]: 7: Hoare triple {757#true} ~cond := #in~cond; {757#true} is VALID [2022-04-27 13:30:26,347 INFO L290 TraceCheckUtils]: 8: Hoare triple {757#true} assume !(0 == ~cond); {757#true} is VALID [2022-04-27 13:30:26,347 INFO L290 TraceCheckUtils]: 9: Hoare triple {757#true} assume true; {757#true} is VALID [2022-04-27 13:30:26,347 INFO L284 TraceCheckUtils]: 10: Hoare quadruple {757#true} {757#true} #80#return; {757#true} is VALID [2022-04-27 13:30:26,348 INFO L290 TraceCheckUtils]: 11: Hoare triple {757#true} ~r~0 := ~A~0;~d~0 := ~B~0;~p~0 := 1;~q~0 := 0; {766#(= (+ main_~A~0 (* (- 1) main_~r~0)) 0)} is VALID [2022-04-27 13:30:26,348 INFO L290 TraceCheckUtils]: 12: Hoare triple {766#(= (+ main_~A~0 (* (- 1) main_~r~0)) 0)} #t~post6 := ~counter~0;~counter~0 := 1 + #t~post6; {766#(= (+ main_~A~0 (* (- 1) main_~r~0)) 0)} is VALID [2022-04-27 13:30:26,348 INFO L290 TraceCheckUtils]: 13: Hoare triple {766#(= (+ main_~A~0 (* (- 1) main_~r~0)) 0)} assume !!(#t~post6 < 100);havoc #t~post6; {766#(= (+ main_~A~0 (* (- 1) main_~r~0)) 0)} is VALID [2022-04-27 13:30:26,348 INFO L272 TraceCheckUtils]: 14: Hoare triple {766#(= (+ main_~A~0 (* (- 1) main_~r~0)) 0)} call __VERIFIER_assert((if 0 == ~q~0 % 4294967296 then 1 else 0)); {757#true} is VALID [2022-04-27 13:30:26,348 INFO L290 TraceCheckUtils]: 15: Hoare triple {757#true} ~cond := #in~cond; {757#true} is VALID [2022-04-27 13:30:26,349 INFO L290 TraceCheckUtils]: 16: Hoare triple {757#true} assume !(0 == ~cond); {757#true} is VALID [2022-04-27 13:30:26,349 INFO L290 TraceCheckUtils]: 17: Hoare triple {757#true} assume true; {757#true} is VALID [2022-04-27 13:30:26,349 INFO L284 TraceCheckUtils]: 18: Hoare quadruple {757#true} {766#(= (+ main_~A~0 (* (- 1) main_~r~0)) 0)} #82#return; {766#(= (+ main_~A~0 (* (- 1) main_~r~0)) 0)} is VALID [2022-04-27 13:30:26,350 INFO L272 TraceCheckUtils]: 19: Hoare triple {766#(= (+ main_~A~0 (* (- 1) main_~r~0)) 0)} call __VERIFIER_assert((if ~r~0 % 4294967296 == ~A~0 % 4294967296 then 1 else 0)); {771#(not (= |__VERIFIER_assert_#in~cond| 0))} is VALID [2022-04-27 13:30:26,350 INFO L290 TraceCheckUtils]: 20: Hoare triple {771#(not (= |__VERIFIER_assert_#in~cond| 0))} ~cond := #in~cond; {772#(not (= __VERIFIER_assert_~cond 0))} is VALID [2022-04-27 13:30:26,351 INFO L290 TraceCheckUtils]: 21: Hoare triple {772#(not (= __VERIFIER_assert_~cond 0))} assume 0 == ~cond; {758#false} is VALID [2022-04-27 13:30:26,351 INFO L290 TraceCheckUtils]: 22: Hoare triple {758#false} assume !false; {758#false} is VALID [2022-04-27 13:30:26,351 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 2 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-04-27 13:30:26,351 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-27 13:30:26,351 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1789000267] [2022-04-27 13:30:26,352 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1789000267] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-27 13:30:26,352 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-27 13:30:26,352 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2022-04-27 13:30:26,352 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [187906657] [2022-04-27 13:30:26,352 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-27 13:30:26,352 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 2.5) internal successors, (15), 4 states have internal predecessors, (15), 2 states have call successors, (5), 3 states have call predecessors, (5), 1 states have return successors, (3), 2 states have call predecessors, (3), 2 states have call successors, (3) Word has length 23 [2022-04-27 13:30:26,353 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-27 13:30:26,353 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with has 6 states, 6 states have (on average 2.5) internal successors, (15), 4 states have internal predecessors, (15), 2 states have call successors, (5), 3 states have call predecessors, (5), 1 states have return successors, (3), 2 states have call predecessors, (3), 2 states have call successors, (3) [2022-04-27 13:30:26,366 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 23 edges. 23 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-27 13:30:26,366 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2022-04-27 13:30:26,367 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-04-27 13:30:26,367 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2022-04-27 13:30:26,367 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2022-04-27 13:30:26,367 INFO L87 Difference]: Start difference. First operand 38 states and 47 transitions. Second operand has 6 states, 6 states have (on average 2.5) internal successors, (15), 4 states have internal predecessors, (15), 2 states have call successors, (5), 3 states have call predecessors, (5), 1 states have return successors, (3), 2 states have call predecessors, (3), 2 states have call successors, (3) [2022-04-27 13:30:26,704 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-27 13:30:26,704 INFO L93 Difference]: Finished difference Result 52 states and 66 transitions. [2022-04-27 13:30:26,704 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2022-04-27 13:30:26,704 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 2.5) internal successors, (15), 4 states have internal predecessors, (15), 2 states have call successors, (5), 3 states have call predecessors, (5), 1 states have return successors, (3), 2 states have call predecessors, (3), 2 states have call successors, (3) Word has length 23 [2022-04-27 13:30:26,705 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-27 13:30:26,705 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 6 states, 6 states have (on average 2.5) internal successors, (15), 4 states have internal predecessors, (15), 2 states have call successors, (5), 3 states have call predecessors, (5), 1 states have return successors, (3), 2 states have call predecessors, (3), 2 states have call successors, (3) [2022-04-27 13:30:26,708 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8 states to 8 states and 62 transitions. [2022-04-27 13:30:26,708 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 6 states, 6 states have (on average 2.5) internal successors, (15), 4 states have internal predecessors, (15), 2 states have call successors, (5), 3 states have call predecessors, (5), 1 states have return successors, (3), 2 states have call predecessors, (3), 2 states have call successors, (3) [2022-04-27 13:30:26,711 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8 states to 8 states and 62 transitions. [2022-04-27 13:30:26,712 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 8 states and 62 transitions. [2022-04-27 13:30:26,766 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 62 edges. 62 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-27 13:30:26,770 INFO L225 Difference]: With dead ends: 52 [2022-04-27 13:30:26,770 INFO L226 Difference]: Without dead ends: 50 [2022-04-27 13:30:26,770 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 15 GetRequests, 7 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=28, Invalid=62, Unknown=0, NotChecked=0, Total=90 [2022-04-27 13:30:26,776 INFO L413 NwaCegarLoop]: 39 mSDtfsCounter, 23 mSDsluCounter, 44 mSDsCounter, 0 mSdLazyCounter, 112 mSolverCounterSat, 14 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 29 SdHoareTripleChecker+Valid, 83 SdHoareTripleChecker+Invalid, 126 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 14 IncrementalHoareTripleChecker+Valid, 112 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-04-27 13:30:26,777 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [29 Valid, 83 Invalid, 126 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [14 Valid, 112 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-04-27 13:30:26,779 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 50 states. [2022-04-27 13:30:26,793 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 50 to 42. [2022-04-27 13:30:26,794 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-27 13:30:26,794 INFO L82 GeneralOperation]: Start isEquivalent. First operand 50 states. Second operand has 42 states, 26 states have (on average 1.2307692307692308) internal successors, (32), 27 states have internal predecessors, (32), 10 states have call successors, (10), 6 states have call predecessors, (10), 5 states have return successors, (8), 8 states have call predecessors, (8), 8 states have call successors, (8) [2022-04-27 13:30:26,795 INFO L74 IsIncluded]: Start isIncluded. First operand 50 states. Second operand has 42 states, 26 states have (on average 1.2307692307692308) internal successors, (32), 27 states have internal predecessors, (32), 10 states have call successors, (10), 6 states have call predecessors, (10), 5 states have return successors, (8), 8 states have call predecessors, (8), 8 states have call successors, (8) [2022-04-27 13:30:26,796 INFO L87 Difference]: Start difference. First operand 50 states. Second operand has 42 states, 26 states have (on average 1.2307692307692308) internal successors, (32), 27 states have internal predecessors, (32), 10 states have call successors, (10), 6 states have call predecessors, (10), 5 states have return successors, (8), 8 states have call predecessors, (8), 8 states have call successors, (8) [2022-04-27 13:30:26,801 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-27 13:30:26,801 INFO L93 Difference]: Finished difference Result 50 states and 64 transitions. [2022-04-27 13:30:26,801 INFO L276 IsEmpty]: Start isEmpty. Operand 50 states and 64 transitions. [2022-04-27 13:30:26,803 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-27 13:30:26,804 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-27 13:30:26,805 INFO L74 IsIncluded]: Start isIncluded. First operand has 42 states, 26 states have (on average 1.2307692307692308) internal successors, (32), 27 states have internal predecessors, (32), 10 states have call successors, (10), 6 states have call predecessors, (10), 5 states have return successors, (8), 8 states have call predecessors, (8), 8 states have call successors, (8) Second operand 50 states. [2022-04-27 13:30:26,806 INFO L87 Difference]: Start difference. First operand has 42 states, 26 states have (on average 1.2307692307692308) internal successors, (32), 27 states have internal predecessors, (32), 10 states have call successors, (10), 6 states have call predecessors, (10), 5 states have return successors, (8), 8 states have call predecessors, (8), 8 states have call successors, (8) Second operand 50 states. [2022-04-27 13:30:26,808 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-27 13:30:26,809 INFO L93 Difference]: Finished difference Result 50 states and 64 transitions. [2022-04-27 13:30:26,809 INFO L276 IsEmpty]: Start isEmpty. Operand 50 states and 64 transitions. [2022-04-27 13:30:26,809 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-27 13:30:26,809 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-27 13:30:26,809 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-27 13:30:26,809 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-27 13:30:26,810 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 42 states, 26 states have (on average 1.2307692307692308) internal successors, (32), 27 states have internal predecessors, (32), 10 states have call successors, (10), 6 states have call predecessors, (10), 5 states have return successors, (8), 8 states have call predecessors, (8), 8 states have call successors, (8) [2022-04-27 13:30:26,811 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 42 states to 42 states and 50 transitions. [2022-04-27 13:30:26,812 INFO L78 Accepts]: Start accepts. Automaton has 42 states and 50 transitions. Word has length 23 [2022-04-27 13:30:26,812 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-27 13:30:26,812 INFO L495 AbstractCegarLoop]: Abstraction has 42 states and 50 transitions. [2022-04-27 13:30:26,812 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 2.5) internal successors, (15), 4 states have internal predecessors, (15), 2 states have call successors, (5), 3 states have call predecessors, (5), 1 states have return successors, (3), 2 states have call predecessors, (3), 2 states have call successors, (3) [2022-04-27 13:30:26,812 INFO L276 IsEmpty]: Start isEmpty. Operand 42 states and 50 transitions. [2022-04-27 13:30:26,813 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 29 [2022-04-27 13:30:26,813 INFO L187 NwaCegarLoop]: Found error trace [2022-04-27 13:30:26,813 INFO L195 NwaCegarLoop]: trace histogram [3, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-27 13:30:26,813 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2022-04-27 13:30:26,813 INFO L420 AbstractCegarLoop]: === Iteration 5 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-27 13:30:26,814 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-27 13:30:26,814 INFO L85 PathProgramCache]: Analyzing trace with hash -1024624683, now seen corresponding path program 1 times [2022-04-27 13:30:26,814 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-27 13:30:26,814 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [234540440] [2022-04-27 13:30:26,814 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-27 13:30:26,814 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-27 13:30:26,829 ERROR L245 FreeRefinementEngine]: Caught known exception: Unsupported non-linear arithmetic [2022-04-27 13:30:26,829 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [714081640] [2022-04-27 13:30:26,829 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-27 13:30:26,829 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-27 13:30:26,829 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-04-27 13:30:26,830 INFO L229 MonitoredProcess]: Starting monitored process 3 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-04-27 13:30:26,847 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Waiting until timeout for monitored process [2022-04-27 13:30:26,883 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-27 13:30:26,884 INFO L263 TraceCheckSpWp]: Trace formula consists of 100 conjuncts, 7 conjunts are in the unsatisfiable core [2022-04-27 13:30:26,892 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-27 13:30:26,893 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-04-27 13:30:27,014 INFO L272 TraceCheckUtils]: 0: Hoare triple {1018#true} call ULTIMATE.init(); {1018#true} is VALID [2022-04-27 13:30:27,015 INFO L290 TraceCheckUtils]: 1: Hoare triple {1018#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);call #Ultimate.allocInit(12, 3);~counter~0 := 0; {1018#true} is VALID [2022-04-27 13:30:27,015 INFO L290 TraceCheckUtils]: 2: Hoare triple {1018#true} assume true; {1018#true} is VALID [2022-04-27 13:30:27,015 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {1018#true} {1018#true} #96#return; {1018#true} is VALID [2022-04-27 13:30:27,015 INFO L272 TraceCheckUtils]: 4: Hoare triple {1018#true} call #t~ret8 := main(); {1018#true} is VALID [2022-04-27 13:30:27,015 INFO L290 TraceCheckUtils]: 5: Hoare triple {1018#true} havoc ~A~0;havoc ~B~0;havoc ~r~0;havoc ~d~0;havoc ~p~0;havoc ~q~0;~A~0 := #t~nondet4;havoc #t~nondet4;~B~0 := #t~nondet5;havoc #t~nondet5; {1018#true} is VALID [2022-04-27 13:30:27,015 INFO L272 TraceCheckUtils]: 6: Hoare triple {1018#true} call assume_abort_if_not((if ~B~0 % 4294967296 >= 1 then 1 else 0)); {1018#true} is VALID [2022-04-27 13:30:27,015 INFO L290 TraceCheckUtils]: 7: Hoare triple {1018#true} ~cond := #in~cond; {1018#true} is VALID [2022-04-27 13:30:27,016 INFO L290 TraceCheckUtils]: 8: Hoare triple {1018#true} assume !(0 == ~cond); {1018#true} is VALID [2022-04-27 13:30:27,016 INFO L290 TraceCheckUtils]: 9: Hoare triple {1018#true} assume true; {1018#true} is VALID [2022-04-27 13:30:27,016 INFO L284 TraceCheckUtils]: 10: Hoare quadruple {1018#true} {1018#true} #80#return; {1018#true} is VALID [2022-04-27 13:30:27,017 INFO L290 TraceCheckUtils]: 11: Hoare triple {1018#true} ~r~0 := ~A~0;~d~0 := ~B~0;~p~0 := 1;~q~0 := 0; {1056#(and (= main_~B~0 main_~d~0) (= main_~p~0 1))} is VALID [2022-04-27 13:30:27,017 INFO L290 TraceCheckUtils]: 12: Hoare triple {1056#(and (= main_~B~0 main_~d~0) (= main_~p~0 1))} #t~post6 := ~counter~0;~counter~0 := 1 + #t~post6; {1056#(and (= main_~B~0 main_~d~0) (= main_~p~0 1))} is VALID [2022-04-27 13:30:27,018 INFO L290 TraceCheckUtils]: 13: Hoare triple {1056#(and (= main_~B~0 main_~d~0) (= main_~p~0 1))} assume !!(#t~post6 < 100);havoc #t~post6; {1056#(and (= main_~B~0 main_~d~0) (= main_~p~0 1))} is VALID [2022-04-27 13:30:27,018 INFO L272 TraceCheckUtils]: 14: Hoare triple {1056#(and (= main_~B~0 main_~d~0) (= main_~p~0 1))} call __VERIFIER_assert((if 0 == ~q~0 % 4294967296 then 1 else 0)); {1018#true} is VALID [2022-04-27 13:30:27,018 INFO L290 TraceCheckUtils]: 15: Hoare triple {1018#true} ~cond := #in~cond; {1018#true} is VALID [2022-04-27 13:30:27,018 INFO L290 TraceCheckUtils]: 16: Hoare triple {1018#true} assume !(0 == ~cond); {1018#true} is VALID [2022-04-27 13:30:27,018 INFO L290 TraceCheckUtils]: 17: Hoare triple {1018#true} assume true; {1018#true} is VALID [2022-04-27 13:30:27,027 INFO L284 TraceCheckUtils]: 18: Hoare quadruple {1018#true} {1056#(and (= main_~B~0 main_~d~0) (= main_~p~0 1))} #82#return; {1056#(and (= main_~B~0 main_~d~0) (= main_~p~0 1))} is VALID [2022-04-27 13:30:27,027 INFO L272 TraceCheckUtils]: 19: Hoare triple {1056#(and (= main_~B~0 main_~d~0) (= main_~p~0 1))} call __VERIFIER_assert((if ~r~0 % 4294967296 == ~A~0 % 4294967296 then 1 else 0)); {1018#true} is VALID [2022-04-27 13:30:27,027 INFO L290 TraceCheckUtils]: 20: Hoare triple {1018#true} ~cond := #in~cond; {1018#true} is VALID [2022-04-27 13:30:27,027 INFO L290 TraceCheckUtils]: 21: Hoare triple {1018#true} assume !(0 == ~cond); {1018#true} is VALID [2022-04-27 13:30:27,028 INFO L290 TraceCheckUtils]: 22: Hoare triple {1018#true} assume true; {1018#true} is VALID [2022-04-27 13:30:27,028 INFO L284 TraceCheckUtils]: 23: Hoare quadruple {1018#true} {1056#(and (= main_~B~0 main_~d~0) (= main_~p~0 1))} #84#return; {1056#(and (= main_~B~0 main_~d~0) (= main_~p~0 1))} is VALID [2022-04-27 13:30:27,029 INFO L272 TraceCheckUtils]: 24: Hoare triple {1056#(and (= main_~B~0 main_~d~0) (= main_~p~0 1))} call __VERIFIER_assert((if ~d~0 % 4294967296 == ~B~0 * ~p~0 % 4294967296 then 1 else 0)); {1096#(<= 1 |__VERIFIER_assert_#in~cond|)} is VALID [2022-04-27 13:30:27,029 INFO L290 TraceCheckUtils]: 25: Hoare triple {1096#(<= 1 |__VERIFIER_assert_#in~cond|)} ~cond := #in~cond; {1100#(<= 1 __VERIFIER_assert_~cond)} is VALID [2022-04-27 13:30:27,030 INFO L290 TraceCheckUtils]: 26: Hoare triple {1100#(<= 1 __VERIFIER_assert_~cond)} assume 0 == ~cond; {1019#false} is VALID [2022-04-27 13:30:27,030 INFO L290 TraceCheckUtils]: 27: Hoare triple {1019#false} assume !false; {1019#false} is VALID [2022-04-27 13:30:27,030 INFO L134 CoverageAnalysis]: Checked inductivity of 8 backedges. 4 proven. 0 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2022-04-27 13:30:27,030 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-04-27 13:30:27,031 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-27 13:30:27,031 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [234540440] [2022-04-27 13:30:27,031 WARN L310 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2022-04-27 13:30:27,031 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [714081640] [2022-04-27 13:30:27,031 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [714081640] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-27 13:30:27,031 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-27 13:30:27,031 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2022-04-27 13:30:27,031 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [145025536] [2022-04-27 13:30:27,031 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-27 13:30:27,032 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, (6), 2 states have call predecessors, (6), 1 states have return successors, (4), 2 states have call predecessors, (4), 2 states have call successors, (4) Word has length 28 [2022-04-27 13:30:27,032 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-27 13:30:27,032 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, (6), 2 states have call predecessors, (6), 1 states have return successors, (4), 2 states have call predecessors, (4), 2 states have call successors, (4) [2022-04-27 13:30:27,048 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 13:30:27,049 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-04-27 13:30:27,049 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-04-27 13:30:27,049 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-04-27 13:30:27,049 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2022-04-27 13:30:27,049 INFO L87 Difference]: Start difference. First operand 42 states and 50 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, (6), 2 states have call predecessors, (6), 1 states have return successors, (4), 2 states have call predecessors, (4), 2 states have call successors, (4) [2022-04-27 13:30:29,227 WARN L534 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [] [2022-04-27 13:30:29,445 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-27 13:30:29,445 INFO L93 Difference]: Finished difference Result 59 states and 75 transitions. [2022-04-27 13:30:29,446 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-04-27 13:30:29,446 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, (6), 2 states have call predecessors, (6), 1 states have return successors, (4), 2 states have call predecessors, (4), 2 states have call successors, (4) Word has length 28 [2022-04-27 13:30:29,446 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-27 13:30:29,446 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, (6), 2 states have call predecessors, (6), 1 states have return successors, (4), 2 states have call predecessors, (4), 2 states have call successors, (4) [2022-04-27 13:30:29,448 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 69 transitions. [2022-04-27 13:30:29,448 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, (6), 2 states have call predecessors, (6), 1 states have return successors, (4), 2 states have call predecessors, (4), 2 states have call successors, (4) [2022-04-27 13:30:29,449 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 69 transitions. [2022-04-27 13:30:29,450 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 5 states and 69 transitions. [2022-04-27 13:30:29,519 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 69 edges. 69 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-27 13:30:29,521 INFO L225 Difference]: With dead ends: 59 [2022-04-27 13:30:29,522 INFO L226 Difference]: Without dead ends: 56 [2022-04-27 13:30:29,522 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 28 GetRequests, 24 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2022-04-27 13:30:29,523 INFO L413 NwaCegarLoop]: 43 mSDtfsCounter, 10 mSDsluCounter, 97 mSDsCounter, 0 mSdLazyCounter, 47 mSolverCounterSat, 2 mSolverCounterUnsat, 1 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 2.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 14 SdHoareTripleChecker+Valid, 140 SdHoareTripleChecker+Invalid, 50 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 47 IncrementalHoareTripleChecker+Invalid, 1 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 2.2s IncrementalHoareTripleChecker+Time [2022-04-27 13:30:29,523 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [14 Valid, 140 Invalid, 50 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 47 Invalid, 1 Unknown, 0 Unchecked, 2.2s Time] [2022-04-27 13:30:29,523 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 56 states. [2022-04-27 13:30:29,540 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 56 to 56. [2022-04-27 13:30:29,540 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-27 13:30:29,540 INFO L82 GeneralOperation]: Start isEquivalent. First operand 56 states. Second operand has 56 states, 33 states have (on average 1.2727272727272727) internal successors, (42), 35 states have internal predecessors, (42), 16 states have call successors, (16), 7 states have call predecessors, (16), 6 states have return successors, (13), 13 states have call predecessors, (13), 13 states have call successors, (13) [2022-04-27 13:30:29,540 INFO L74 IsIncluded]: Start isIncluded. First operand 56 states. Second operand has 56 states, 33 states have (on average 1.2727272727272727) internal successors, (42), 35 states have internal predecessors, (42), 16 states have call successors, (16), 7 states have call predecessors, (16), 6 states have return successors, (13), 13 states have call predecessors, (13), 13 states have call successors, (13) [2022-04-27 13:30:29,541 INFO L87 Difference]: Start difference. First operand 56 states. Second operand has 56 states, 33 states have (on average 1.2727272727272727) internal successors, (42), 35 states have internal predecessors, (42), 16 states have call successors, (16), 7 states have call predecessors, (16), 6 states have return successors, (13), 13 states have call predecessors, (13), 13 states have call successors, (13) [2022-04-27 13:30:29,542 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-27 13:30:29,543 INFO L93 Difference]: Finished difference Result 56 states and 71 transitions. [2022-04-27 13:30:29,543 INFO L276 IsEmpty]: Start isEmpty. Operand 56 states and 71 transitions. [2022-04-27 13:30:29,543 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-27 13:30:29,543 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-27 13:30:29,543 INFO L74 IsIncluded]: Start isIncluded. First operand has 56 states, 33 states have (on average 1.2727272727272727) internal successors, (42), 35 states have internal predecessors, (42), 16 states have call successors, (16), 7 states have call predecessors, (16), 6 states have return successors, (13), 13 states have call predecessors, (13), 13 states have call successors, (13) Second operand 56 states. [2022-04-27 13:30:29,544 INFO L87 Difference]: Start difference. First operand has 56 states, 33 states have (on average 1.2727272727272727) internal successors, (42), 35 states have internal predecessors, (42), 16 states have call successors, (16), 7 states have call predecessors, (16), 6 states have return successors, (13), 13 states have call predecessors, (13), 13 states have call successors, (13) Second operand 56 states. [2022-04-27 13:30:29,545 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-27 13:30:29,546 INFO L93 Difference]: Finished difference Result 56 states and 71 transitions. [2022-04-27 13:30:29,546 INFO L276 IsEmpty]: Start isEmpty. Operand 56 states and 71 transitions. [2022-04-27 13:30:29,546 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-27 13:30:29,546 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-27 13:30:29,546 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-27 13:30:29,546 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-27 13:30:29,546 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 56 states, 33 states have (on average 1.2727272727272727) internal successors, (42), 35 states have internal predecessors, (42), 16 states have call successors, (16), 7 states have call predecessors, (16), 6 states have return successors, (13), 13 states have call predecessors, (13), 13 states have call successors, (13) [2022-04-27 13:30:29,548 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 56 states to 56 states and 71 transitions. [2022-04-27 13:30:29,548 INFO L78 Accepts]: Start accepts. Automaton has 56 states and 71 transitions. Word has length 28 [2022-04-27 13:30:29,548 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-27 13:30:29,549 INFO L495 AbstractCegarLoop]: Abstraction has 56 states and 71 transitions. [2022-04-27 13:30:29,549 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, (6), 2 states have call predecessors, (6), 1 states have return successors, (4), 2 states have call predecessors, (4), 2 states have call successors, (4) [2022-04-27 13:30:29,549 INFO L276 IsEmpty]: Start isEmpty. Operand 56 states and 71 transitions. [2022-04-27 13:30:29,549 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 37 [2022-04-27 13:30:29,549 INFO L187 NwaCegarLoop]: Found error trace [2022-04-27 13:30:29,549 INFO L195 NwaCegarLoop]: trace histogram [4, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-27 13:30:29,569 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 13:30:29,766 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4,3 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-27 13:30:29,767 INFO L420 AbstractCegarLoop]: === Iteration 6 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-27 13:30:29,767 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-27 13:30:29,767 INFO L85 PathProgramCache]: Analyzing trace with hash 1301357193, now seen corresponding path program 1 times [2022-04-27 13:30:29,767 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-27 13:30:29,768 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [956882852] [2022-04-27 13:30:29,768 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-27 13:30:29,768 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-27 13:30:29,784 ERROR L245 FreeRefinementEngine]: Caught known exception: Unsupported non-linear arithmetic [2022-04-27 13:30:29,785 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [584514311] [2022-04-27 13:30:29,785 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-27 13:30:29,785 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-27 13:30:29,785 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-04-27 13:30:29,793 INFO L229 MonitoredProcess]: Starting monitored process 4 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-04-27 13:30:29,794 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Waiting until timeout for monitored process [2022-04-27 13:30:29,842 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-27 13:30:29,843 INFO L263 TraceCheckSpWp]: Trace formula consists of 115 conjuncts, 7 conjunts are in the unsatisfiable core [2022-04-27 13:30:29,854 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-27 13:30:29,856 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-04-27 13:30:30,110 INFO L272 TraceCheckUtils]: 0: Hoare triple {1386#true} call ULTIMATE.init(); {1386#true} is VALID [2022-04-27 13:30:30,111 INFO L290 TraceCheckUtils]: 1: Hoare triple {1386#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);call #Ultimate.allocInit(12, 3);~counter~0 := 0; {1394#(<= ~counter~0 0)} is VALID [2022-04-27 13:30:30,111 INFO L290 TraceCheckUtils]: 2: Hoare triple {1394#(<= ~counter~0 0)} assume true; {1394#(<= ~counter~0 0)} is VALID [2022-04-27 13:30:30,111 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {1394#(<= ~counter~0 0)} {1386#true} #96#return; {1394#(<= ~counter~0 0)} is VALID [2022-04-27 13:30:30,112 INFO L272 TraceCheckUtils]: 4: Hoare triple {1394#(<= ~counter~0 0)} call #t~ret8 := main(); {1394#(<= ~counter~0 0)} is VALID [2022-04-27 13:30:30,112 INFO L290 TraceCheckUtils]: 5: Hoare triple {1394#(<= ~counter~0 0)} havoc ~A~0;havoc ~B~0;havoc ~r~0;havoc ~d~0;havoc ~p~0;havoc ~q~0;~A~0 := #t~nondet4;havoc #t~nondet4;~B~0 := #t~nondet5;havoc #t~nondet5; {1394#(<= ~counter~0 0)} is VALID [2022-04-27 13:30:30,113 INFO L272 TraceCheckUtils]: 6: Hoare triple {1394#(<= ~counter~0 0)} call assume_abort_if_not((if ~B~0 % 4294967296 >= 1 then 1 else 0)); {1394#(<= ~counter~0 0)} is VALID [2022-04-27 13:30:30,113 INFO L290 TraceCheckUtils]: 7: Hoare triple {1394#(<= ~counter~0 0)} ~cond := #in~cond; {1394#(<= ~counter~0 0)} is VALID [2022-04-27 13:30:30,113 INFO L290 TraceCheckUtils]: 8: Hoare triple {1394#(<= ~counter~0 0)} assume !(0 == ~cond); {1394#(<= ~counter~0 0)} is VALID [2022-04-27 13:30:30,114 INFO L290 TraceCheckUtils]: 9: Hoare triple {1394#(<= ~counter~0 0)} assume true; {1394#(<= ~counter~0 0)} is VALID [2022-04-27 13:30:30,114 INFO L284 TraceCheckUtils]: 10: Hoare quadruple {1394#(<= ~counter~0 0)} {1394#(<= ~counter~0 0)} #80#return; {1394#(<= ~counter~0 0)} is VALID [2022-04-27 13:30:30,115 INFO L290 TraceCheckUtils]: 11: Hoare triple {1394#(<= ~counter~0 0)} ~r~0 := ~A~0;~d~0 := ~B~0;~p~0 := 1;~q~0 := 0; {1394#(<= ~counter~0 0)} is VALID [2022-04-27 13:30:30,115 INFO L290 TraceCheckUtils]: 12: Hoare triple {1394#(<= ~counter~0 0)} #t~post6 := ~counter~0;~counter~0 := 1 + #t~post6; {1428#(<= ~counter~0 1)} is VALID [2022-04-27 13:30:30,116 INFO L290 TraceCheckUtils]: 13: Hoare triple {1428#(<= ~counter~0 1)} assume !!(#t~post6 < 100);havoc #t~post6; {1428#(<= ~counter~0 1)} is VALID [2022-04-27 13:30:30,116 INFO L272 TraceCheckUtils]: 14: Hoare triple {1428#(<= ~counter~0 1)} call __VERIFIER_assert((if 0 == ~q~0 % 4294967296 then 1 else 0)); {1428#(<= ~counter~0 1)} is VALID [2022-04-27 13:30:30,116 INFO L290 TraceCheckUtils]: 15: Hoare triple {1428#(<= ~counter~0 1)} ~cond := #in~cond; {1428#(<= ~counter~0 1)} is VALID [2022-04-27 13:30:30,117 INFO L290 TraceCheckUtils]: 16: Hoare triple {1428#(<= ~counter~0 1)} assume !(0 == ~cond); {1428#(<= ~counter~0 1)} is VALID [2022-04-27 13:30:30,117 INFO L290 TraceCheckUtils]: 17: Hoare triple {1428#(<= ~counter~0 1)} assume true; {1428#(<= ~counter~0 1)} is VALID [2022-04-27 13:30:30,118 INFO L284 TraceCheckUtils]: 18: Hoare quadruple {1428#(<= ~counter~0 1)} {1428#(<= ~counter~0 1)} #82#return; {1428#(<= ~counter~0 1)} is VALID [2022-04-27 13:30:30,118 INFO L272 TraceCheckUtils]: 19: Hoare triple {1428#(<= ~counter~0 1)} call __VERIFIER_assert((if ~r~0 % 4294967296 == ~A~0 % 4294967296 then 1 else 0)); {1428#(<= ~counter~0 1)} is VALID [2022-04-27 13:30:30,119 INFO L290 TraceCheckUtils]: 20: Hoare triple {1428#(<= ~counter~0 1)} ~cond := #in~cond; {1428#(<= ~counter~0 1)} is VALID [2022-04-27 13:30:30,119 INFO L290 TraceCheckUtils]: 21: Hoare triple {1428#(<= ~counter~0 1)} assume !(0 == ~cond); {1428#(<= ~counter~0 1)} is VALID [2022-04-27 13:30:30,119 INFO L290 TraceCheckUtils]: 22: Hoare triple {1428#(<= ~counter~0 1)} assume true; {1428#(<= ~counter~0 1)} is VALID [2022-04-27 13:30:30,120 INFO L284 TraceCheckUtils]: 23: Hoare quadruple {1428#(<= ~counter~0 1)} {1428#(<= ~counter~0 1)} #84#return; {1428#(<= ~counter~0 1)} is VALID [2022-04-27 13:30:30,120 INFO L272 TraceCheckUtils]: 24: Hoare triple {1428#(<= ~counter~0 1)} call __VERIFIER_assert((if ~d~0 % 4294967296 == ~B~0 * ~p~0 % 4294967296 then 1 else 0)); {1428#(<= ~counter~0 1)} is VALID [2022-04-27 13:30:30,121 INFO L290 TraceCheckUtils]: 25: Hoare triple {1428#(<= ~counter~0 1)} ~cond := #in~cond; {1428#(<= ~counter~0 1)} is VALID [2022-04-27 13:30:30,121 INFO L290 TraceCheckUtils]: 26: Hoare triple {1428#(<= ~counter~0 1)} assume !(0 == ~cond); {1428#(<= ~counter~0 1)} is VALID [2022-04-27 13:30:30,121 INFO L290 TraceCheckUtils]: 27: Hoare triple {1428#(<= ~counter~0 1)} assume true; {1428#(<= ~counter~0 1)} is VALID [2022-04-27 13:30:30,122 INFO L284 TraceCheckUtils]: 28: Hoare quadruple {1428#(<= ~counter~0 1)} {1428#(<= ~counter~0 1)} #86#return; {1428#(<= ~counter~0 1)} is VALID [2022-04-27 13:30:30,122 INFO L290 TraceCheckUtils]: 29: Hoare triple {1428#(<= ~counter~0 1)} assume !(~r~0 % 4294967296 >= ~d~0 % 4294967296); {1428#(<= ~counter~0 1)} is VALID [2022-04-27 13:30:30,122 INFO L290 TraceCheckUtils]: 30: Hoare triple {1428#(<= ~counter~0 1)} #t~post7 := ~counter~0;~counter~0 := 1 + #t~post7; {1483#(<= |main_#t~post7| 1)} is VALID [2022-04-27 13:30:30,123 INFO L290 TraceCheckUtils]: 31: Hoare triple {1483#(<= |main_#t~post7| 1)} assume !(#t~post7 < 100);havoc #t~post7; {1387#false} is VALID [2022-04-27 13:30:30,123 INFO L272 TraceCheckUtils]: 32: Hoare triple {1387#false} call __VERIFIER_assert((if ~A~0 % 4294967296 == (~d~0 * ~q~0 + ~r~0) % 4294967296 then 1 else 0)); {1387#false} is VALID [2022-04-27 13:30:30,123 INFO L290 TraceCheckUtils]: 33: Hoare triple {1387#false} ~cond := #in~cond; {1387#false} is VALID [2022-04-27 13:30:30,123 INFO L290 TraceCheckUtils]: 34: Hoare triple {1387#false} assume 0 == ~cond; {1387#false} is VALID [2022-04-27 13:30:30,123 INFO L290 TraceCheckUtils]: 35: Hoare triple {1387#false} assume !false; {1387#false} is VALID [2022-04-27 13:30:30,123 INFO L134 CoverageAnalysis]: Checked inductivity of 18 backedges. 6 proven. 0 refuted. 0 times theorem prover too weak. 12 trivial. 0 not checked. [2022-04-27 13:30:30,124 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-04-27 13:30:30,124 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-27 13:30:30,124 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [956882852] [2022-04-27 13:30:30,124 WARN L310 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2022-04-27 13:30:30,124 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [584514311] [2022-04-27 13:30:30,124 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [584514311] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-27 13:30:30,124 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-27 13:30:30,124 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2022-04-27 13:30:30,124 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [280226093] [2022-04-27 13:30:30,124 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-27 13:30:30,125 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 3.6) internal successors, (18), 4 states have internal predecessors, (18), 4 states have call successors, (7), 4 states have call predecessors, (7), 2 states have return successors, (5), 2 states have call predecessors, (5), 3 states have call successors, (5) Word has length 36 [2022-04-27 13:30:30,125 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-27 13:30:30,125 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with has 5 states, 5 states have (on average 3.6) internal successors, (18), 4 states have internal predecessors, (18), 4 states have call successors, (7), 4 states have call predecessors, (7), 2 states have return successors, (5), 2 states have call predecessors, (5), 3 states have call successors, (5) [2022-04-27 13:30:30,150 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 30 edges. 30 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-27 13:30:30,151 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-04-27 13:30:30,151 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-04-27 13:30:30,151 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-04-27 13:30:30,151 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2022-04-27 13:30:30,151 INFO L87 Difference]: Start difference. First operand 56 states and 71 transitions. Second operand has 5 states, 5 states have (on average 3.6) internal successors, (18), 4 states have internal predecessors, (18), 4 states have call successors, (7), 4 states have call predecessors, (7), 2 states have return successors, (5), 2 states have call predecessors, (5), 3 states have call successors, (5) [2022-04-27 13:30:30,409 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-27 13:30:30,409 INFO L93 Difference]: Finished difference Result 76 states and 87 transitions. [2022-04-27 13:30:30,410 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-04-27 13:30:30,410 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 3.6) internal successors, (18), 4 states have internal predecessors, (18), 4 states have call successors, (7), 4 states have call predecessors, (7), 2 states have return successors, (5), 2 states have call predecessors, (5), 3 states have call successors, (5) Word has length 36 [2022-04-27 13:30:30,410 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-27 13:30:30,410 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 5 states, 5 states have (on average 3.6) internal successors, (18), 4 states have internal predecessors, (18), 4 states have call successors, (7), 4 states have call predecessors, (7), 2 states have return successors, (5), 2 states have call predecessors, (5), 3 states have call successors, (5) [2022-04-27 13:30:30,411 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 65 transitions. [2022-04-27 13:30:30,411 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 5 states, 5 states have (on average 3.6) internal successors, (18), 4 states have internal predecessors, (18), 4 states have call successors, (7), 4 states have call predecessors, (7), 2 states have return successors, (5), 2 states have call predecessors, (5), 3 states have call successors, (5) [2022-04-27 13:30:30,412 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 65 transitions. [2022-04-27 13:30:30,412 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 5 states and 65 transitions. [2022-04-27 13:30:30,465 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 65 edges. 65 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-27 13:30:30,467 INFO L225 Difference]: With dead ends: 76 [2022-04-27 13:30:30,467 INFO L226 Difference]: Without dead ends: 69 [2022-04-27 13:30:30,467 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 35 GetRequests, 32 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2022-04-27 13:30:30,468 INFO L413 NwaCegarLoop]: 42 mSDtfsCounter, 7 mSDsluCounter, 94 mSDsCounter, 0 mSdLazyCounter, 19 mSolverCounterSat, 5 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 7 SdHoareTripleChecker+Valid, 136 SdHoareTripleChecker+Invalid, 24 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 5 IncrementalHoareTripleChecker+Valid, 19 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-04-27 13:30:30,468 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [7 Valid, 136 Invalid, 24 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [5 Valid, 19 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-04-27 13:30:30,468 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 69 states. [2022-04-27 13:30:30,479 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 69 to 68. [2022-04-27 13:30:30,479 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-27 13:30:30,479 INFO L82 GeneralOperation]: Start isEquivalent. First operand 69 states. Second operand has 68 states, 42 states have (on average 1.1904761904761905) internal successors, (50), 44 states have internal predecessors, (50), 16 states have call successors, (16), 10 states have call predecessors, (16), 9 states have return successors, (13), 13 states have call predecessors, (13), 13 states have call successors, (13) [2022-04-27 13:30:30,480 INFO L74 IsIncluded]: Start isIncluded. First operand 69 states. Second operand has 68 states, 42 states have (on average 1.1904761904761905) internal successors, (50), 44 states have internal predecessors, (50), 16 states have call successors, (16), 10 states have call predecessors, (16), 9 states have return successors, (13), 13 states have call predecessors, (13), 13 states have call successors, (13) [2022-04-27 13:30:30,480 INFO L87 Difference]: Start difference. First operand 69 states. Second operand has 68 states, 42 states have (on average 1.1904761904761905) internal successors, (50), 44 states have internal predecessors, (50), 16 states have call successors, (16), 10 states have call predecessors, (16), 9 states have return successors, (13), 13 states have call predecessors, (13), 13 states have call successors, (13) [2022-04-27 13:30:30,482 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-27 13:30:30,482 INFO L93 Difference]: Finished difference Result 69 states and 80 transitions. [2022-04-27 13:30:30,482 INFO L276 IsEmpty]: Start isEmpty. Operand 69 states and 80 transitions. [2022-04-27 13:30:30,482 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-27 13:30:30,482 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-27 13:30:30,483 INFO L74 IsIncluded]: Start isIncluded. First operand has 68 states, 42 states have (on average 1.1904761904761905) internal successors, (50), 44 states have internal predecessors, (50), 16 states have call successors, (16), 10 states have call predecessors, (16), 9 states have return successors, (13), 13 states have call predecessors, (13), 13 states have call successors, (13) Second operand 69 states. [2022-04-27 13:30:30,483 INFO L87 Difference]: Start difference. First operand has 68 states, 42 states have (on average 1.1904761904761905) internal successors, (50), 44 states have internal predecessors, (50), 16 states have call successors, (16), 10 states have call predecessors, (16), 9 states have return successors, (13), 13 states have call predecessors, (13), 13 states have call successors, (13) Second operand 69 states. [2022-04-27 13:30:30,484 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-27 13:30:30,485 INFO L93 Difference]: Finished difference Result 69 states and 80 transitions. [2022-04-27 13:30:30,485 INFO L276 IsEmpty]: Start isEmpty. Operand 69 states and 80 transitions. [2022-04-27 13:30:30,485 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-27 13:30:30,485 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-27 13:30:30,485 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-27 13:30:30,485 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-27 13:30:30,485 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 68 states, 42 states have (on average 1.1904761904761905) internal successors, (50), 44 states have internal predecessors, (50), 16 states have call successors, (16), 10 states have call predecessors, (16), 9 states have return successors, (13), 13 states have call predecessors, (13), 13 states have call successors, (13) [2022-04-27 13:30:30,487 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 68 states to 68 states and 79 transitions. [2022-04-27 13:30:30,487 INFO L78 Accepts]: Start accepts. Automaton has 68 states and 79 transitions. Word has length 36 [2022-04-27 13:30:30,487 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-27 13:30:30,487 INFO L495 AbstractCegarLoop]: Abstraction has 68 states and 79 transitions. [2022-04-27 13:30:30,488 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 3.6) internal successors, (18), 4 states have internal predecessors, (18), 4 states have call successors, (7), 4 states have call predecessors, (7), 2 states have return successors, (5), 2 states have call predecessors, (5), 3 states have call successors, (5) [2022-04-27 13:30:30,488 INFO L276 IsEmpty]: Start isEmpty. Operand 68 states and 79 transitions. [2022-04-27 13:30:30,488 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 37 [2022-04-27 13:30:30,488 INFO L187 NwaCegarLoop]: Found error trace [2022-04-27 13:30:30,488 INFO L195 NwaCegarLoop]: trace histogram [4, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-27 13:30:30,513 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Forceful destruction successful, exit code 0 [2022-04-27 13:30:30,697 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5,4 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-27 13:30:30,697 INFO L420 AbstractCegarLoop]: === Iteration 7 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-27 13:30:30,698 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-27 13:30:30,698 INFO L85 PathProgramCache]: Analyzing trace with hash 1303085071, now seen corresponding path program 1 times [2022-04-27 13:30:30,698 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-27 13:30:30,698 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [418446050] [2022-04-27 13:30:30,698 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-27 13:30:30,698 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-27 13:30:30,711 ERROR L245 FreeRefinementEngine]: Caught known exception: Unsupported non-linear arithmetic [2022-04-27 13:30:30,711 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [961681769] [2022-04-27 13:30:30,711 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-27 13:30:30,711 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-27 13:30:30,711 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-04-27 13:30:30,712 INFO L229 MonitoredProcess]: Starting monitored process 5 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-04-27 13:30:30,713 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Waiting until timeout for monitored process [2022-04-27 13:30:30,757 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-27 13:30:30,758 INFO L263 TraceCheckSpWp]: Trace formula consists of 115 conjuncts, 10 conjunts are in the unsatisfiable core [2022-04-27 13:30:30,766 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-27 13:30:30,767 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-04-27 13:30:31,454 INFO L272 TraceCheckUtils]: 0: Hoare triple {1839#true} call ULTIMATE.init(); {1839#true} is VALID [2022-04-27 13:30:31,454 INFO L290 TraceCheckUtils]: 1: Hoare triple {1839#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);call #Ultimate.allocInit(12, 3);~counter~0 := 0; {1839#true} is VALID [2022-04-27 13:30:31,454 INFO L290 TraceCheckUtils]: 2: Hoare triple {1839#true} assume true; {1839#true} is VALID [2022-04-27 13:30:31,454 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {1839#true} {1839#true} #96#return; {1839#true} is VALID [2022-04-27 13:30:31,454 INFO L272 TraceCheckUtils]: 4: Hoare triple {1839#true} call #t~ret8 := main(); {1839#true} is VALID [2022-04-27 13:30:31,454 INFO L290 TraceCheckUtils]: 5: Hoare triple {1839#true} havoc ~A~0;havoc ~B~0;havoc ~r~0;havoc ~d~0;havoc ~p~0;havoc ~q~0;~A~0 := #t~nondet4;havoc #t~nondet4;~B~0 := #t~nondet5;havoc #t~nondet5; {1839#true} is VALID [2022-04-27 13:30:31,454 INFO L272 TraceCheckUtils]: 6: Hoare triple {1839#true} call assume_abort_if_not((if ~B~0 % 4294967296 >= 1 then 1 else 0)); {1839#true} is VALID [2022-04-27 13:30:31,454 INFO L290 TraceCheckUtils]: 7: Hoare triple {1839#true} ~cond := #in~cond; {1839#true} is VALID [2022-04-27 13:30:31,455 INFO L290 TraceCheckUtils]: 8: Hoare triple {1839#true} assume !(0 == ~cond); {1839#true} is VALID [2022-04-27 13:30:31,455 INFO L290 TraceCheckUtils]: 9: Hoare triple {1839#true} assume true; {1839#true} is VALID [2022-04-27 13:30:31,455 INFO L284 TraceCheckUtils]: 10: Hoare quadruple {1839#true} {1839#true} #80#return; {1839#true} is VALID [2022-04-27 13:30:31,456 INFO L290 TraceCheckUtils]: 11: Hoare triple {1839#true} ~r~0 := ~A~0;~d~0 := ~B~0;~p~0 := 1;~q~0 := 0; {1877#(and (= main_~A~0 main_~r~0) (= main_~q~0 0) (= main_~B~0 main_~d~0))} is VALID [2022-04-27 13:30:31,457 INFO L290 TraceCheckUtils]: 12: Hoare triple {1877#(and (= main_~A~0 main_~r~0) (= main_~q~0 0) (= main_~B~0 main_~d~0))} #t~post6 := ~counter~0;~counter~0 := 1 + #t~post6; {1877#(and (= main_~A~0 main_~r~0) (= main_~q~0 0) (= main_~B~0 main_~d~0))} is VALID [2022-04-27 13:30:31,457 INFO L290 TraceCheckUtils]: 13: Hoare triple {1877#(and (= main_~A~0 main_~r~0) (= main_~q~0 0) (= main_~B~0 main_~d~0))} assume !!(#t~post6 < 100);havoc #t~post6; {1877#(and (= main_~A~0 main_~r~0) (= main_~q~0 0) (= main_~B~0 main_~d~0))} is VALID [2022-04-27 13:30:31,458 INFO L272 TraceCheckUtils]: 14: Hoare triple {1877#(and (= main_~A~0 main_~r~0) (= main_~q~0 0) (= main_~B~0 main_~d~0))} call __VERIFIER_assert((if 0 == ~q~0 % 4294967296 then 1 else 0)); {1839#true} is VALID [2022-04-27 13:30:31,458 INFO L290 TraceCheckUtils]: 15: Hoare triple {1839#true} ~cond := #in~cond; {1839#true} is VALID [2022-04-27 13:30:31,458 INFO L290 TraceCheckUtils]: 16: Hoare triple {1839#true} assume !(0 == ~cond); {1839#true} is VALID [2022-04-27 13:30:31,458 INFO L290 TraceCheckUtils]: 17: Hoare triple {1839#true} assume true; {1839#true} is VALID [2022-04-27 13:30:31,461 INFO L284 TraceCheckUtils]: 18: Hoare quadruple {1839#true} {1877#(and (= main_~A~0 main_~r~0) (= main_~q~0 0) (= main_~B~0 main_~d~0))} #82#return; {1877#(and (= main_~A~0 main_~r~0) (= main_~q~0 0) (= main_~B~0 main_~d~0))} is VALID [2022-04-27 13:30:31,461 INFO L272 TraceCheckUtils]: 19: Hoare triple {1877#(and (= main_~A~0 main_~r~0) (= main_~q~0 0) (= main_~B~0 main_~d~0))} call __VERIFIER_assert((if ~r~0 % 4294967296 == ~A~0 % 4294967296 then 1 else 0)); {1839#true} is VALID [2022-04-27 13:30:31,461 INFO L290 TraceCheckUtils]: 20: Hoare triple {1839#true} ~cond := #in~cond; {1839#true} is VALID [2022-04-27 13:30:31,461 INFO L290 TraceCheckUtils]: 21: Hoare triple {1839#true} assume !(0 == ~cond); {1839#true} is VALID [2022-04-27 13:30:31,461 INFO L290 TraceCheckUtils]: 22: Hoare triple {1839#true} assume true; {1839#true} is VALID [2022-04-27 13:30:31,462 INFO L284 TraceCheckUtils]: 23: Hoare quadruple {1839#true} {1877#(and (= main_~A~0 main_~r~0) (= main_~q~0 0) (= main_~B~0 main_~d~0))} #84#return; {1877#(and (= main_~A~0 main_~r~0) (= main_~q~0 0) (= main_~B~0 main_~d~0))} is VALID [2022-04-27 13:30:31,462 INFO L272 TraceCheckUtils]: 24: Hoare triple {1877#(and (= main_~A~0 main_~r~0) (= main_~q~0 0) (= main_~B~0 main_~d~0))} call __VERIFIER_assert((if ~d~0 % 4294967296 == ~B~0 * ~p~0 % 4294967296 then 1 else 0)); {1839#true} is VALID [2022-04-27 13:30:31,462 INFO L290 TraceCheckUtils]: 25: Hoare triple {1839#true} ~cond := #in~cond; {1839#true} is VALID [2022-04-27 13:30:31,462 INFO L290 TraceCheckUtils]: 26: Hoare triple {1839#true} assume !(0 == ~cond); {1839#true} is VALID [2022-04-27 13:30:31,462 INFO L290 TraceCheckUtils]: 27: Hoare triple {1839#true} assume true; {1839#true} is VALID [2022-04-27 13:30:31,463 INFO L284 TraceCheckUtils]: 28: Hoare quadruple {1839#true} {1877#(and (= main_~A~0 main_~r~0) (= main_~q~0 0) (= main_~B~0 main_~d~0))} #86#return; {1877#(and (= main_~A~0 main_~r~0) (= main_~q~0 0) (= main_~B~0 main_~d~0))} is VALID [2022-04-27 13:30:31,463 INFO L290 TraceCheckUtils]: 29: Hoare triple {1877#(and (= main_~A~0 main_~r~0) (= main_~q~0 0) (= main_~B~0 main_~d~0))} assume !(~r~0 % 4294967296 >= ~d~0 % 4294967296); {1932#(and (= main_~A~0 main_~r~0) (not (<= (mod main_~B~0 4294967296) (mod main_~r~0 4294967296))) (= main_~q~0 0))} is VALID [2022-04-27 13:30:31,464 INFO L290 TraceCheckUtils]: 30: Hoare triple {1932#(and (= main_~A~0 main_~r~0) (not (<= (mod main_~B~0 4294967296) (mod main_~r~0 4294967296))) (= main_~q~0 0))} #t~post7 := ~counter~0;~counter~0 := 1 + #t~post7; {1932#(and (= main_~A~0 main_~r~0) (not (<= (mod main_~B~0 4294967296) (mod main_~r~0 4294967296))) (= main_~q~0 0))} is VALID [2022-04-27 13:30:31,468 INFO L290 TraceCheckUtils]: 31: Hoare triple {1932#(and (= main_~A~0 main_~r~0) (not (<= (mod main_~B~0 4294967296) (mod main_~r~0 4294967296))) (= main_~q~0 0))} assume !!(#t~post7 < 100);havoc #t~post7; {1932#(and (= main_~A~0 main_~r~0) (not (<= (mod main_~B~0 4294967296) (mod main_~r~0 4294967296))) (= main_~q~0 0))} is VALID [2022-04-27 13:30:31,469 INFO L272 TraceCheckUtils]: 32: Hoare triple {1932#(and (= main_~A~0 main_~r~0) (not (<= (mod main_~B~0 4294967296) (mod main_~r~0 4294967296))) (= main_~q~0 0))} call __VERIFIER_assert((if ~A~0 % 4294967296 == (~q~0 * ~B~0 + ~r~0) % 4294967296 then 1 else 0)); {1942#(<= 1 |__VERIFIER_assert_#in~cond|)} is VALID [2022-04-27 13:30:31,470 INFO L290 TraceCheckUtils]: 33: Hoare triple {1942#(<= 1 |__VERIFIER_assert_#in~cond|)} ~cond := #in~cond; {1946#(<= 1 __VERIFIER_assert_~cond)} is VALID [2022-04-27 13:30:31,470 INFO L290 TraceCheckUtils]: 34: Hoare triple {1946#(<= 1 __VERIFIER_assert_~cond)} assume 0 == ~cond; {1840#false} is VALID [2022-04-27 13:30:31,470 INFO L290 TraceCheckUtils]: 35: Hoare triple {1840#false} assume !false; {1840#false} is VALID [2022-04-27 13:30:31,470 INFO L134 CoverageAnalysis]: Checked inductivity of 18 backedges. 6 proven. 0 refuted. 0 times theorem prover too weak. 12 trivial. 0 not checked. [2022-04-27 13:30:31,470 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-04-27 13:30:31,471 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-27 13:30:31,471 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [418446050] [2022-04-27 13:30:31,471 WARN L310 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2022-04-27 13:30:31,471 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [961681769] [2022-04-27 13:30:31,471 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [961681769] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-27 13:30:31,471 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-27 13:30:31,471 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2022-04-27 13:30:31,471 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [492501051] [2022-04-27 13:30:31,471 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-27 13:30:31,471 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 3.0) internal successors, (18), 5 states have internal predecessors, (18), 3 states have call successors, (7), 2 states have call predecessors, (7), 1 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) Word has length 36 [2022-04-27 13:30:31,472 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-27 13:30:31,472 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with has 6 states, 6 states have (on average 3.0) internal successors, (18), 5 states have internal predecessors, (18), 3 states have call successors, (7), 2 states have call predecessors, (7), 1 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) [2022-04-27 13:30:31,499 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 30 edges. 30 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-27 13:30:31,499 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2022-04-27 13:30:31,499 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-04-27 13:30:31,500 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2022-04-27 13:30:31,500 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2022-04-27 13:30:31,500 INFO L87 Difference]: Start difference. First operand 68 states and 79 transitions. Second operand has 6 states, 6 states have (on average 3.0) internal successors, (18), 5 states have internal predecessors, (18), 3 states have call successors, (7), 2 states have call predecessors, (7), 1 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) [2022-04-27 13:30:33,422 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-27 13:30:33,423 INFO L93 Difference]: Finished difference Result 82 states and 98 transitions. [2022-04-27 13:30:33,423 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2022-04-27 13:30:33,423 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 3.0) internal successors, (18), 5 states have internal predecessors, (18), 3 states have call successors, (7), 2 states have call predecessors, (7), 1 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) Word has length 36 [2022-04-27 13:30:33,423 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-27 13:30:33,423 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 6 states, 6 states have (on average 3.0) internal successors, (18), 5 states have internal predecessors, (18), 3 states have call successors, (7), 2 states have call predecessors, (7), 1 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) [2022-04-27 13:30:33,424 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 80 transitions. [2022-04-27 13:30:33,425 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 6 states, 6 states have (on average 3.0) internal successors, (18), 5 states have internal predecessors, (18), 3 states have call successors, (7), 2 states have call predecessors, (7), 1 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) [2022-04-27 13:30:33,426 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 80 transitions. [2022-04-27 13:30:33,426 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 7 states and 80 transitions. [2022-04-27 13:30:33,656 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 80 edges. 80 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-27 13:30:33,657 INFO L225 Difference]: With dead ends: 82 [2022-04-27 13:30:33,657 INFO L226 Difference]: Without dead ends: 79 [2022-04-27 13:30:33,658 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 37 GetRequests, 31 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=17, Invalid=39, Unknown=0, NotChecked=0, Total=56 [2022-04-27 13:30:33,659 INFO L413 NwaCegarLoop]: 41 mSDtfsCounter, 14 mSDsluCounter, 121 mSDsCounter, 0 mSdLazyCounter, 93 mSolverCounterSat, 9 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 17 SdHoareTripleChecker+Valid, 162 SdHoareTripleChecker+Invalid, 102 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 9 IncrementalHoareTripleChecker+Valid, 93 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2022-04-27 13:30:33,659 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [17 Valid, 162 Invalid, 102 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [9 Valid, 93 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2022-04-27 13:30:33,660 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 79 states. [2022-04-27 13:30:33,692 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 79 to 78. [2022-04-27 13:30:33,692 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-27 13:30:33,693 INFO L82 GeneralOperation]: Start isEquivalent. First operand 79 states. Second operand has 78 states, 49 states have (on average 1.2040816326530612) internal successors, (59), 51 states have internal predecessors, (59), 18 states have call successors, (18), 11 states have call predecessors, (18), 10 states have return successors, (16), 15 states have call predecessors, (16), 16 states have call successors, (16) [2022-04-27 13:30:33,694 INFO L74 IsIncluded]: Start isIncluded. First operand 79 states. Second operand has 78 states, 49 states have (on average 1.2040816326530612) internal successors, (59), 51 states have internal predecessors, (59), 18 states have call successors, (18), 11 states have call predecessors, (18), 10 states have return successors, (16), 15 states have call predecessors, (16), 16 states have call successors, (16) [2022-04-27 13:30:33,694 INFO L87 Difference]: Start difference. First operand 79 states. Second operand has 78 states, 49 states have (on average 1.2040816326530612) internal successors, (59), 51 states have internal predecessors, (59), 18 states have call successors, (18), 11 states have call predecessors, (18), 10 states have return successors, (16), 15 states have call predecessors, (16), 16 states have call successors, (16) [2022-04-27 13:30:33,696 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-27 13:30:33,696 INFO L93 Difference]: Finished difference Result 79 states and 94 transitions. [2022-04-27 13:30:33,696 INFO L276 IsEmpty]: Start isEmpty. Operand 79 states and 94 transitions. [2022-04-27 13:30:33,697 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-27 13:30:33,697 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-27 13:30:33,698 INFO L74 IsIncluded]: Start isIncluded. First operand has 78 states, 49 states have (on average 1.2040816326530612) internal successors, (59), 51 states have internal predecessors, (59), 18 states have call successors, (18), 11 states have call predecessors, (18), 10 states have return successors, (16), 15 states have call predecessors, (16), 16 states have call successors, (16) Second operand 79 states. [2022-04-27 13:30:33,698 INFO L87 Difference]: Start difference. First operand has 78 states, 49 states have (on average 1.2040816326530612) internal successors, (59), 51 states have internal predecessors, (59), 18 states have call successors, (18), 11 states have call predecessors, (18), 10 states have return successors, (16), 15 states have call predecessors, (16), 16 states have call successors, (16) Second operand 79 states. [2022-04-27 13:30:33,700 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-27 13:30:33,700 INFO L93 Difference]: Finished difference Result 79 states and 94 transitions. [2022-04-27 13:30:33,700 INFO L276 IsEmpty]: Start isEmpty. Operand 79 states and 94 transitions. [2022-04-27 13:30:33,701 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-27 13:30:33,701 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-27 13:30:33,701 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-27 13:30:33,701 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-27 13:30:33,701 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 78 states, 49 states have (on average 1.2040816326530612) internal successors, (59), 51 states have internal predecessors, (59), 18 states have call successors, (18), 11 states have call predecessors, (18), 10 states have return successors, (16), 15 states have call predecessors, (16), 16 states have call successors, (16) [2022-04-27 13:30:33,703 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 78 states to 78 states and 93 transitions. [2022-04-27 13:30:33,703 INFO L78 Accepts]: Start accepts. Automaton has 78 states and 93 transitions. Word has length 36 [2022-04-27 13:30:33,703 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-27 13:30:33,703 INFO L495 AbstractCegarLoop]: Abstraction has 78 states and 93 transitions. [2022-04-27 13:30:33,703 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 3.0) internal successors, (18), 5 states have internal predecessors, (18), 3 states have call successors, (7), 2 states have call predecessors, (7), 1 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) [2022-04-27 13:30:33,704 INFO L276 IsEmpty]: Start isEmpty. Operand 78 states and 93 transitions. [2022-04-27 13:30:33,704 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 39 [2022-04-27 13:30:33,704 INFO L187 NwaCegarLoop]: Found error trace [2022-04-27 13:30:33,704 INFO L195 NwaCegarLoop]: trace histogram [4, 3, 3, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-27 13:30:33,724 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Forceful destruction successful, exit code 0 [2022-04-27 13:30:33,924 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6,5 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-27 13:30:33,924 INFO L420 AbstractCegarLoop]: === Iteration 8 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-27 13:30:33,925 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-27 13:30:33,925 INFO L85 PathProgramCache]: Analyzing trace with hash -1189074514, now seen corresponding path program 1 times [2022-04-27 13:30:33,925 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-27 13:30:33,925 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [653116748] [2022-04-27 13:30:33,925 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-27 13:30:33,925 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-27 13:30:33,946 ERROR L245 FreeRefinementEngine]: Caught known exception: Unsupported non-linear arithmetic [2022-04-27 13:30:33,946 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [1970687689] [2022-04-27 13:30:33,946 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-27 13:30:33,946 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-27 13:30:33,946 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-04-27 13:30:33,951 INFO L229 MonitoredProcess]: Starting monitored process 6 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-04-27 13:30:33,967 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (6)] Waiting until timeout for monitored process [2022-04-27 13:30:34,002 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-27 13:30:34,003 INFO L263 TraceCheckSpWp]: Trace formula consists of 124 conjuncts, 7 conjunts are in the unsatisfiable core [2022-04-27 13:30:34,012 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-27 13:30:34,013 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-04-27 13:30:34,221 INFO L272 TraceCheckUtils]: 0: Hoare triple {2338#true} call ULTIMATE.init(); {2338#true} is VALID [2022-04-27 13:30:34,222 INFO L290 TraceCheckUtils]: 1: Hoare triple {2338#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);call #Ultimate.allocInit(12, 3);~counter~0 := 0; {2346#(<= ~counter~0 0)} is VALID [2022-04-27 13:30:34,222 INFO L290 TraceCheckUtils]: 2: Hoare triple {2346#(<= ~counter~0 0)} assume true; {2346#(<= ~counter~0 0)} is VALID [2022-04-27 13:30:34,222 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {2346#(<= ~counter~0 0)} {2338#true} #96#return; {2346#(<= ~counter~0 0)} is VALID [2022-04-27 13:30:34,223 INFO L272 TraceCheckUtils]: 4: Hoare triple {2346#(<= ~counter~0 0)} call #t~ret8 := main(); {2346#(<= ~counter~0 0)} is VALID [2022-04-27 13:30:34,223 INFO L290 TraceCheckUtils]: 5: Hoare triple {2346#(<= ~counter~0 0)} havoc ~A~0;havoc ~B~0;havoc ~r~0;havoc ~d~0;havoc ~p~0;havoc ~q~0;~A~0 := #t~nondet4;havoc #t~nondet4;~B~0 := #t~nondet5;havoc #t~nondet5; {2346#(<= ~counter~0 0)} is VALID [2022-04-27 13:30:34,223 INFO L272 TraceCheckUtils]: 6: Hoare triple {2346#(<= ~counter~0 0)} call assume_abort_if_not((if ~B~0 % 4294967296 >= 1 then 1 else 0)); {2346#(<= ~counter~0 0)} is VALID [2022-04-27 13:30:34,224 INFO L290 TraceCheckUtils]: 7: Hoare triple {2346#(<= ~counter~0 0)} ~cond := #in~cond; {2346#(<= ~counter~0 0)} is VALID [2022-04-27 13:30:34,224 INFO L290 TraceCheckUtils]: 8: Hoare triple {2346#(<= ~counter~0 0)} assume !(0 == ~cond); {2346#(<= ~counter~0 0)} is VALID [2022-04-27 13:30:34,224 INFO L290 TraceCheckUtils]: 9: Hoare triple {2346#(<= ~counter~0 0)} assume true; {2346#(<= ~counter~0 0)} is VALID [2022-04-27 13:30:34,225 INFO L284 TraceCheckUtils]: 10: Hoare quadruple {2346#(<= ~counter~0 0)} {2346#(<= ~counter~0 0)} #80#return; {2346#(<= ~counter~0 0)} is VALID [2022-04-27 13:30:34,225 INFO L290 TraceCheckUtils]: 11: Hoare triple {2346#(<= ~counter~0 0)} ~r~0 := ~A~0;~d~0 := ~B~0;~p~0 := 1;~q~0 := 0; {2346#(<= ~counter~0 0)} is VALID [2022-04-27 13:30:34,226 INFO L290 TraceCheckUtils]: 12: Hoare triple {2346#(<= ~counter~0 0)} #t~post6 := ~counter~0;~counter~0 := 1 + #t~post6; {2380#(<= ~counter~0 1)} is VALID [2022-04-27 13:30:34,226 INFO L290 TraceCheckUtils]: 13: Hoare triple {2380#(<= ~counter~0 1)} assume !!(#t~post6 < 100);havoc #t~post6; {2380#(<= ~counter~0 1)} is VALID [2022-04-27 13:30:34,226 INFO L272 TraceCheckUtils]: 14: Hoare triple {2380#(<= ~counter~0 1)} call __VERIFIER_assert((if 0 == ~q~0 % 4294967296 then 1 else 0)); {2380#(<= ~counter~0 1)} is VALID [2022-04-27 13:30:34,227 INFO L290 TraceCheckUtils]: 15: Hoare triple {2380#(<= ~counter~0 1)} ~cond := #in~cond; {2380#(<= ~counter~0 1)} is VALID [2022-04-27 13:30:34,227 INFO L290 TraceCheckUtils]: 16: Hoare triple {2380#(<= ~counter~0 1)} assume !(0 == ~cond); {2380#(<= ~counter~0 1)} is VALID [2022-04-27 13:30:34,227 INFO L290 TraceCheckUtils]: 17: Hoare triple {2380#(<= ~counter~0 1)} assume true; {2380#(<= ~counter~0 1)} is VALID [2022-04-27 13:30:34,228 INFO L284 TraceCheckUtils]: 18: Hoare quadruple {2380#(<= ~counter~0 1)} {2380#(<= ~counter~0 1)} #82#return; {2380#(<= ~counter~0 1)} is VALID [2022-04-27 13:30:34,228 INFO L272 TraceCheckUtils]: 19: Hoare triple {2380#(<= ~counter~0 1)} call __VERIFIER_assert((if ~r~0 % 4294967296 == ~A~0 % 4294967296 then 1 else 0)); {2380#(<= ~counter~0 1)} is VALID [2022-04-27 13:30:34,229 INFO L290 TraceCheckUtils]: 20: Hoare triple {2380#(<= ~counter~0 1)} ~cond := #in~cond; {2380#(<= ~counter~0 1)} is VALID [2022-04-27 13:30:34,229 INFO L290 TraceCheckUtils]: 21: Hoare triple {2380#(<= ~counter~0 1)} assume !(0 == ~cond); {2380#(<= ~counter~0 1)} is VALID [2022-04-27 13:30:34,229 INFO L290 TraceCheckUtils]: 22: Hoare triple {2380#(<= ~counter~0 1)} assume true; {2380#(<= ~counter~0 1)} is VALID [2022-04-27 13:30:34,230 INFO L284 TraceCheckUtils]: 23: Hoare quadruple {2380#(<= ~counter~0 1)} {2380#(<= ~counter~0 1)} #84#return; {2380#(<= ~counter~0 1)} is VALID [2022-04-27 13:30:34,230 INFO L272 TraceCheckUtils]: 24: Hoare triple {2380#(<= ~counter~0 1)} call __VERIFIER_assert((if ~d~0 % 4294967296 == ~B~0 * ~p~0 % 4294967296 then 1 else 0)); {2380#(<= ~counter~0 1)} is VALID [2022-04-27 13:30:34,231 INFO L290 TraceCheckUtils]: 25: Hoare triple {2380#(<= ~counter~0 1)} ~cond := #in~cond; {2380#(<= ~counter~0 1)} is VALID [2022-04-27 13:30:34,231 INFO L290 TraceCheckUtils]: 26: Hoare triple {2380#(<= ~counter~0 1)} assume !(0 == ~cond); {2380#(<= ~counter~0 1)} is VALID [2022-04-27 13:30:34,231 INFO L290 TraceCheckUtils]: 27: Hoare triple {2380#(<= ~counter~0 1)} assume true; {2380#(<= ~counter~0 1)} is VALID [2022-04-27 13:30:34,232 INFO L284 TraceCheckUtils]: 28: Hoare quadruple {2380#(<= ~counter~0 1)} {2380#(<= ~counter~0 1)} #86#return; {2380#(<= ~counter~0 1)} is VALID [2022-04-27 13:30:34,232 INFO L290 TraceCheckUtils]: 29: Hoare triple {2380#(<= ~counter~0 1)} assume !!(~r~0 % 4294967296 >= ~d~0 % 4294967296);~d~0 := 2 * ~d~0;~p~0 := 2 * ~p~0; {2380#(<= ~counter~0 1)} is VALID [2022-04-27 13:30:34,233 INFO L290 TraceCheckUtils]: 30: Hoare triple {2380#(<= ~counter~0 1)} #t~post6 := ~counter~0;~counter~0 := 1 + #t~post6; {2435#(<= |main_#t~post6| 1)} is VALID [2022-04-27 13:30:34,233 INFO L290 TraceCheckUtils]: 31: Hoare triple {2435#(<= |main_#t~post6| 1)} assume !(#t~post6 < 100);havoc #t~post6; {2339#false} is VALID [2022-04-27 13:30:34,234 INFO L290 TraceCheckUtils]: 32: Hoare triple {2339#false} #t~post7 := ~counter~0;~counter~0 := 1 + #t~post7; {2339#false} is VALID [2022-04-27 13:30:34,234 INFO L290 TraceCheckUtils]: 33: Hoare triple {2339#false} assume !(#t~post7 < 100);havoc #t~post7; {2339#false} is VALID [2022-04-27 13:30:34,234 INFO L272 TraceCheckUtils]: 34: Hoare triple {2339#false} call __VERIFIER_assert((if ~A~0 % 4294967296 == (~d~0 * ~q~0 + ~r~0) % 4294967296 then 1 else 0)); {2339#false} is VALID [2022-04-27 13:30:34,234 INFO L290 TraceCheckUtils]: 35: Hoare triple {2339#false} ~cond := #in~cond; {2339#false} is VALID [2022-04-27 13:30:34,234 INFO L290 TraceCheckUtils]: 36: Hoare triple {2339#false} assume 0 == ~cond; {2339#false} is VALID [2022-04-27 13:30:34,234 INFO L290 TraceCheckUtils]: 37: Hoare triple {2339#false} assume !false; {2339#false} is VALID [2022-04-27 13:30:34,234 INFO L134 CoverageAnalysis]: Checked inductivity of 20 backedges. 6 proven. 2 refuted. 0 times theorem prover too weak. 12 trivial. 0 not checked. [2022-04-27 13:30:34,234 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-04-27 13:30:34,460 INFO L290 TraceCheckUtils]: 37: Hoare triple {2339#false} assume !false; {2339#false} is VALID [2022-04-27 13:30:34,460 INFO L290 TraceCheckUtils]: 36: Hoare triple {2339#false} assume 0 == ~cond; {2339#false} is VALID [2022-04-27 13:30:34,460 INFO L290 TraceCheckUtils]: 35: Hoare triple {2339#false} ~cond := #in~cond; {2339#false} is VALID [2022-04-27 13:30:34,460 INFO L272 TraceCheckUtils]: 34: Hoare triple {2339#false} call __VERIFIER_assert((if ~A~0 % 4294967296 == (~d~0 * ~q~0 + ~r~0) % 4294967296 then 1 else 0)); {2339#false} is VALID [2022-04-27 13:30:34,460 INFO L290 TraceCheckUtils]: 33: Hoare triple {2339#false} assume !(#t~post7 < 100);havoc #t~post7; {2339#false} is VALID [2022-04-27 13:30:34,460 INFO L290 TraceCheckUtils]: 32: Hoare triple {2339#false} #t~post7 := ~counter~0;~counter~0 := 1 + #t~post7; {2339#false} is VALID [2022-04-27 13:30:34,469 INFO L290 TraceCheckUtils]: 31: Hoare triple {2475#(< |main_#t~post6| 100)} assume !(#t~post6 < 100);havoc #t~post6; {2339#false} is VALID [2022-04-27 13:30:34,469 INFO L290 TraceCheckUtils]: 30: Hoare triple {2479#(< ~counter~0 100)} #t~post6 := ~counter~0;~counter~0 := 1 + #t~post6; {2475#(< |main_#t~post6| 100)} is VALID [2022-04-27 13:30:34,470 INFO L290 TraceCheckUtils]: 29: Hoare triple {2479#(< ~counter~0 100)} assume !!(~r~0 % 4294967296 >= ~d~0 % 4294967296);~d~0 := 2 * ~d~0;~p~0 := 2 * ~p~0; {2479#(< ~counter~0 100)} is VALID [2022-04-27 13:30:34,470 INFO L284 TraceCheckUtils]: 28: Hoare quadruple {2338#true} {2479#(< ~counter~0 100)} #86#return; {2479#(< ~counter~0 100)} is VALID [2022-04-27 13:30:34,470 INFO L290 TraceCheckUtils]: 27: Hoare triple {2338#true} assume true; {2338#true} is VALID [2022-04-27 13:30:34,470 INFO L290 TraceCheckUtils]: 26: Hoare triple {2338#true} assume !(0 == ~cond); {2338#true} is VALID [2022-04-27 13:30:34,470 INFO L290 TraceCheckUtils]: 25: Hoare triple {2338#true} ~cond := #in~cond; {2338#true} is VALID [2022-04-27 13:30:34,471 INFO L272 TraceCheckUtils]: 24: Hoare triple {2479#(< ~counter~0 100)} call __VERIFIER_assert((if ~d~0 % 4294967296 == ~B~0 * ~p~0 % 4294967296 then 1 else 0)); {2338#true} is VALID [2022-04-27 13:30:34,471 INFO L284 TraceCheckUtils]: 23: Hoare quadruple {2338#true} {2479#(< ~counter~0 100)} #84#return; {2479#(< ~counter~0 100)} is VALID [2022-04-27 13:30:34,471 INFO L290 TraceCheckUtils]: 22: Hoare triple {2338#true} assume true; {2338#true} is VALID [2022-04-27 13:30:34,471 INFO L290 TraceCheckUtils]: 21: Hoare triple {2338#true} assume !(0 == ~cond); {2338#true} is VALID [2022-04-27 13:30:34,471 INFO L290 TraceCheckUtils]: 20: Hoare triple {2338#true} ~cond := #in~cond; {2338#true} is VALID [2022-04-27 13:30:34,471 INFO L272 TraceCheckUtils]: 19: Hoare triple {2479#(< ~counter~0 100)} call __VERIFIER_assert((if ~r~0 % 4294967296 == ~A~0 % 4294967296 then 1 else 0)); {2338#true} is VALID [2022-04-27 13:30:34,472 INFO L284 TraceCheckUtils]: 18: Hoare quadruple {2338#true} {2479#(< ~counter~0 100)} #82#return; {2479#(< ~counter~0 100)} is VALID [2022-04-27 13:30:34,472 INFO L290 TraceCheckUtils]: 17: Hoare triple {2338#true} assume true; {2338#true} is VALID [2022-04-27 13:30:34,472 INFO L290 TraceCheckUtils]: 16: Hoare triple {2338#true} assume !(0 == ~cond); {2338#true} is VALID [2022-04-27 13:30:34,472 INFO L290 TraceCheckUtils]: 15: Hoare triple {2338#true} ~cond := #in~cond; {2338#true} is VALID [2022-04-27 13:30:34,472 INFO L272 TraceCheckUtils]: 14: Hoare triple {2479#(< ~counter~0 100)} call __VERIFIER_assert((if 0 == ~q~0 % 4294967296 then 1 else 0)); {2338#true} is VALID [2022-04-27 13:30:34,473 INFO L290 TraceCheckUtils]: 13: Hoare triple {2479#(< ~counter~0 100)} assume !!(#t~post6 < 100);havoc #t~post6; {2479#(< ~counter~0 100)} is VALID [2022-04-27 13:30:34,473 INFO L290 TraceCheckUtils]: 12: Hoare triple {2534#(< ~counter~0 99)} #t~post6 := ~counter~0;~counter~0 := 1 + #t~post6; {2479#(< ~counter~0 100)} is VALID [2022-04-27 13:30:34,474 INFO L290 TraceCheckUtils]: 11: Hoare triple {2534#(< ~counter~0 99)} ~r~0 := ~A~0;~d~0 := ~B~0;~p~0 := 1;~q~0 := 0; {2534#(< ~counter~0 99)} is VALID [2022-04-27 13:30:34,474 INFO L284 TraceCheckUtils]: 10: Hoare quadruple {2338#true} {2534#(< ~counter~0 99)} #80#return; {2534#(< ~counter~0 99)} is VALID [2022-04-27 13:30:34,474 INFO L290 TraceCheckUtils]: 9: Hoare triple {2338#true} assume true; {2338#true} is VALID [2022-04-27 13:30:34,474 INFO L290 TraceCheckUtils]: 8: Hoare triple {2338#true} assume !(0 == ~cond); {2338#true} is VALID [2022-04-27 13:30:34,474 INFO L290 TraceCheckUtils]: 7: Hoare triple {2338#true} ~cond := #in~cond; {2338#true} is VALID [2022-04-27 13:30:34,474 INFO L272 TraceCheckUtils]: 6: Hoare triple {2534#(< ~counter~0 99)} call assume_abort_if_not((if ~B~0 % 4294967296 >= 1 then 1 else 0)); {2338#true} is VALID [2022-04-27 13:30:34,475 INFO L290 TraceCheckUtils]: 5: Hoare triple {2534#(< ~counter~0 99)} havoc ~A~0;havoc ~B~0;havoc ~r~0;havoc ~d~0;havoc ~p~0;havoc ~q~0;~A~0 := #t~nondet4;havoc #t~nondet4;~B~0 := #t~nondet5;havoc #t~nondet5; {2534#(< ~counter~0 99)} is VALID [2022-04-27 13:30:34,475 INFO L272 TraceCheckUtils]: 4: Hoare triple {2534#(< ~counter~0 99)} call #t~ret8 := main(); {2534#(< ~counter~0 99)} is VALID [2022-04-27 13:30:34,475 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {2534#(< ~counter~0 99)} {2338#true} #96#return; {2534#(< ~counter~0 99)} is VALID [2022-04-27 13:30:34,476 INFO L290 TraceCheckUtils]: 2: Hoare triple {2534#(< ~counter~0 99)} assume true; {2534#(< ~counter~0 99)} is VALID [2022-04-27 13:30:34,476 INFO L290 TraceCheckUtils]: 1: Hoare triple {2338#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);call #Ultimate.allocInit(12, 3);~counter~0 := 0; {2534#(< ~counter~0 99)} is VALID [2022-04-27 13:30:34,476 INFO L272 TraceCheckUtils]: 0: Hoare triple {2338#true} call ULTIMATE.init(); {2338#true} is VALID [2022-04-27 13:30:34,476 INFO L134 CoverageAnalysis]: Checked inductivity of 20 backedges. 6 proven. 2 refuted. 0 times theorem prover too weak. 12 trivial. 0 not checked. [2022-04-27 13:30:34,476 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-27 13:30:34,477 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [653116748] [2022-04-27 13:30:34,477 WARN L310 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2022-04-27 13:30:34,477 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1970687689] [2022-04-27 13:30:34,477 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1970687689] provided 0 perfect and 2 imperfect interpolant sequences [2022-04-27 13:30:34,477 INFO L184 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2022-04-27 13:30:34,477 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [5, 5] total 8 [2022-04-27 13:30:34,477 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1648966507] [2022-04-27 13:30:34,477 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2022-04-27 13:30:34,477 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 8 states have (on average 4.375) internal successors, (35), 8 states have internal predecessors, (35), 6 states have call successors, (12), 5 states have call predecessors, (12), 4 states have return successors, (10), 4 states have call predecessors, (10), 5 states have call successors, (10) Word has length 38 [2022-04-27 13:30:34,478 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-27 13:30:34,478 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with has 8 states, 8 states have (on average 4.375) internal successors, (35), 8 states have internal predecessors, (35), 6 states have call successors, (12), 5 states have call predecessors, (12), 4 states have return successors, (10), 4 states have call predecessors, (10), 5 states have call successors, (10) [2022-04-27 13:30:34,531 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 57 edges. 57 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-27 13:30:34,532 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2022-04-27 13:30:34,532 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-04-27 13:30:34,532 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2022-04-27 13:30:34,532 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=20, Invalid=36, Unknown=0, NotChecked=0, Total=56 [2022-04-27 13:30:34,532 INFO L87 Difference]: Start difference. First operand 78 states and 93 transitions. Second operand has 8 states, 8 states have (on average 4.375) internal successors, (35), 8 states have internal predecessors, (35), 6 states have call successors, (12), 5 states have call predecessors, (12), 4 states have return successors, (10), 4 states have call predecessors, (10), 5 states have call successors, (10) [2022-04-27 13:30:36,084 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-27 13:30:36,084 INFO L93 Difference]: Finished difference Result 160 states and 196 transitions. [2022-04-27 13:30:36,084 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2022-04-27 13:30:36,084 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 8 states have (on average 4.375) internal successors, (35), 8 states have internal predecessors, (35), 6 states have call successors, (12), 5 states have call predecessors, (12), 4 states have return successors, (10), 4 states have call predecessors, (10), 5 states have call successors, (10) Word has length 38 [2022-04-27 13:30:36,085 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-27 13:30:36,085 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 8 states, 8 states have (on average 4.375) internal successors, (35), 8 states have internal predecessors, (35), 6 states have call successors, (12), 5 states have call predecessors, (12), 4 states have return successors, (10), 4 states have call predecessors, (10), 5 states have call successors, (10) [2022-04-27 13:30:36,088 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 10 states to 10 states and 133 transitions. [2022-04-27 13:30:36,088 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 8 states, 8 states have (on average 4.375) internal successors, (35), 8 states have internal predecessors, (35), 6 states have call successors, (12), 5 states have call predecessors, (12), 4 states have return successors, (10), 4 states have call predecessors, (10), 5 states have call successors, (10) [2022-04-27 13:30:36,091 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 10 states to 10 states and 133 transitions. [2022-04-27 13:30:36,091 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 10 states and 133 transitions. [2022-04-27 13:30:36,223 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 133 edges. 133 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-27 13:30:36,225 INFO L225 Difference]: With dead ends: 160 [2022-04-27 13:30:36,225 INFO L226 Difference]: Without dead ends: 146 [2022-04-27 13:30:36,226 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 78 GetRequests, 69 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 7 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=40, Invalid=70, Unknown=0, NotChecked=0, Total=110 [2022-04-27 13:30:36,226 INFO L413 NwaCegarLoop]: 53 mSDtfsCounter, 54 mSDsluCounter, 127 mSDsCounter, 0 mSdLazyCounter, 56 mSolverCounterSat, 17 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.6s Time, 0 mProtectedPredicate, 0 mProtectedAction, 54 SdHoareTripleChecker+Valid, 180 SdHoareTripleChecker+Invalid, 73 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 17 IncrementalHoareTripleChecker+Valid, 56 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.6s IncrementalHoareTripleChecker+Time [2022-04-27 13:30:36,226 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [54 Valid, 180 Invalid, 73 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [17 Valid, 56 Invalid, 0 Unknown, 0 Unchecked, 0.6s Time] [2022-04-27 13:30:36,227 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 146 states. [2022-04-27 13:30:36,274 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 146 to 138. [2022-04-27 13:30:36,274 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-27 13:30:36,275 INFO L82 GeneralOperation]: Start isEquivalent. First operand 146 states. Second operand has 138 states, 88 states have (on average 1.2159090909090908) internal successors, (107), 92 states have internal predecessors, (107), 31 states have call successors, (31), 19 states have call predecessors, (31), 18 states have return successors, (28), 26 states have call predecessors, (28), 28 states have call successors, (28) [2022-04-27 13:30:36,275 INFO L74 IsIncluded]: Start isIncluded. First operand 146 states. Second operand has 138 states, 88 states have (on average 1.2159090909090908) internal successors, (107), 92 states have internal predecessors, (107), 31 states have call successors, (31), 19 states have call predecessors, (31), 18 states have return successors, (28), 26 states have call predecessors, (28), 28 states have call successors, (28) [2022-04-27 13:30:36,283 INFO L87 Difference]: Start difference. First operand 146 states. Second operand has 138 states, 88 states have (on average 1.2159090909090908) internal successors, (107), 92 states have internal predecessors, (107), 31 states have call successors, (31), 19 states have call predecessors, (31), 18 states have return successors, (28), 26 states have call predecessors, (28), 28 states have call successors, (28) [2022-04-27 13:30:36,286 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-27 13:30:36,286 INFO L93 Difference]: Finished difference Result 146 states and 174 transitions. [2022-04-27 13:30:36,286 INFO L276 IsEmpty]: Start isEmpty. Operand 146 states and 174 transitions. [2022-04-27 13:30:36,287 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-27 13:30:36,287 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-27 13:30:36,289 INFO L74 IsIncluded]: Start isIncluded. First operand has 138 states, 88 states have (on average 1.2159090909090908) internal successors, (107), 92 states have internal predecessors, (107), 31 states have call successors, (31), 19 states have call predecessors, (31), 18 states have return successors, (28), 26 states have call predecessors, (28), 28 states have call successors, (28) Second operand 146 states. [2022-04-27 13:30:36,290 INFO L87 Difference]: Start difference. First operand has 138 states, 88 states have (on average 1.2159090909090908) internal successors, (107), 92 states have internal predecessors, (107), 31 states have call successors, (31), 19 states have call predecessors, (31), 18 states have return successors, (28), 26 states have call predecessors, (28), 28 states have call successors, (28) Second operand 146 states. [2022-04-27 13:30:36,293 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-27 13:30:36,293 INFO L93 Difference]: Finished difference Result 146 states and 174 transitions. [2022-04-27 13:30:36,293 INFO L276 IsEmpty]: Start isEmpty. Operand 146 states and 174 transitions. [2022-04-27 13:30:36,294 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-27 13:30:36,294 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-27 13:30:36,294 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-27 13:30:36,294 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-27 13:30:36,294 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 138 states, 88 states have (on average 1.2159090909090908) internal successors, (107), 92 states have internal predecessors, (107), 31 states have call successors, (31), 19 states have call predecessors, (31), 18 states have return successors, (28), 26 states have call predecessors, (28), 28 states have call successors, (28) [2022-04-27 13:30:36,298 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 138 states to 138 states and 166 transitions. [2022-04-27 13:30:36,298 INFO L78 Accepts]: Start accepts. Automaton has 138 states and 166 transitions. Word has length 38 [2022-04-27 13:30:36,298 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-27 13:30:36,298 INFO L495 AbstractCegarLoop]: Abstraction has 138 states and 166 transitions. [2022-04-27 13:30:36,298 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 4.375) internal successors, (35), 8 states have internal predecessors, (35), 6 states have call successors, (12), 5 states have call predecessors, (12), 4 states have return successors, (10), 4 states have call predecessors, (10), 5 states have call successors, (10) [2022-04-27 13:30:36,298 INFO L276 IsEmpty]: Start isEmpty. Operand 138 states and 166 transitions. [2022-04-27 13:30:36,300 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 47 [2022-04-27 13:30:36,300 INFO L187 NwaCegarLoop]: Found error trace [2022-04-27 13:30:36,300 INFO L195 NwaCegarLoop]: trace histogram [6, 5, 5, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-27 13:30:36,321 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (6)] Forceful destruction successful, exit code 0 [2022-04-27 13:30:36,515 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7,6 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-27 13:30:36,515 INFO L420 AbstractCegarLoop]: === Iteration 9 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-27 13:30:36,516 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-27 13:30:36,516 INFO L85 PathProgramCache]: Analyzing trace with hash 1861890039, now seen corresponding path program 1 times [2022-04-27 13:30:36,516 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-27 13:30:36,516 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1056937775] [2022-04-27 13:30:36,516 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-27 13:30:36,516 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-27 13:30:36,528 ERROR L245 FreeRefinementEngine]: Caught known exception: Unsupported non-linear arithmetic [2022-04-27 13:30:36,529 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [575336913] [2022-04-27 13:30:36,529 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-27 13:30:36,529 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-27 13:30:36,529 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-04-27 13:30:36,534 INFO L229 MonitoredProcess]: Starting monitored process 7 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-04-27 13:30:36,535 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (7)] Waiting until timeout for monitored process [2022-04-27 13:30:36,643 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-27 13:30:36,645 INFO L263 TraceCheckSpWp]: Trace formula consists of 137 conjuncts, 16 conjunts are in the unsatisfiable core [2022-04-27 13:30:36,661 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-27 13:30:36,662 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-04-27 13:30:37,779 INFO L272 TraceCheckUtils]: 0: Hoare triple {3284#true} call ULTIMATE.init(); {3284#true} is VALID [2022-04-27 13:30:37,779 INFO L290 TraceCheckUtils]: 1: Hoare triple {3284#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);call #Ultimate.allocInit(12, 3);~counter~0 := 0; {3284#true} is VALID [2022-04-27 13:30:37,779 INFO L290 TraceCheckUtils]: 2: Hoare triple {3284#true} assume true; {3284#true} is VALID [2022-04-27 13:30:37,779 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {3284#true} {3284#true} #96#return; {3284#true} is VALID [2022-04-27 13:30:37,779 INFO L272 TraceCheckUtils]: 4: Hoare triple {3284#true} call #t~ret8 := main(); {3284#true} is VALID [2022-04-27 13:30:37,779 INFO L290 TraceCheckUtils]: 5: Hoare triple {3284#true} havoc ~A~0;havoc ~B~0;havoc ~r~0;havoc ~d~0;havoc ~p~0;havoc ~q~0;~A~0 := #t~nondet4;havoc #t~nondet4;~B~0 := #t~nondet5;havoc #t~nondet5; {3284#true} is VALID [2022-04-27 13:30:37,779 INFO L272 TraceCheckUtils]: 6: Hoare triple {3284#true} call assume_abort_if_not((if ~B~0 % 4294967296 >= 1 then 1 else 0)); {3284#true} is VALID [2022-04-27 13:30:37,787 INFO L290 TraceCheckUtils]: 7: Hoare triple {3284#true} ~cond := #in~cond; {3310#(= assume_abort_if_not_~cond |assume_abort_if_not_#in~cond|)} is VALID [2022-04-27 13:30:37,788 INFO L290 TraceCheckUtils]: 8: Hoare triple {3310#(= assume_abort_if_not_~cond |assume_abort_if_not_#in~cond|)} assume !(0 == ~cond); {3314#(not (= |assume_abort_if_not_#in~cond| 0))} is VALID [2022-04-27 13:30:37,788 INFO L290 TraceCheckUtils]: 9: Hoare triple {3314#(not (= |assume_abort_if_not_#in~cond| 0))} assume true; {3314#(not (= |assume_abort_if_not_#in~cond| 0))} is VALID [2022-04-27 13:30:37,789 INFO L284 TraceCheckUtils]: 10: Hoare quadruple {3314#(not (= |assume_abort_if_not_#in~cond| 0))} {3284#true} #80#return; {3321#(<= 1 (mod main_~B~0 4294967296))} is VALID [2022-04-27 13:30:37,789 INFO L290 TraceCheckUtils]: 11: Hoare triple {3321#(<= 1 (mod main_~B~0 4294967296))} ~r~0 := ~A~0;~d~0 := ~B~0;~p~0 := 1;~q~0 := 0; {3325#(and (<= 1 (mod main_~B~0 4294967296)) (= main_~B~0 main_~d~0) (= main_~p~0 1))} is VALID [2022-04-27 13:30:37,789 INFO L290 TraceCheckUtils]: 12: Hoare triple {3325#(and (<= 1 (mod main_~B~0 4294967296)) (= main_~B~0 main_~d~0) (= main_~p~0 1))} #t~post6 := ~counter~0;~counter~0 := 1 + #t~post6; {3325#(and (<= 1 (mod main_~B~0 4294967296)) (= main_~B~0 main_~d~0) (= main_~p~0 1))} is VALID [2022-04-27 13:30:37,790 INFO L290 TraceCheckUtils]: 13: Hoare triple {3325#(and (<= 1 (mod main_~B~0 4294967296)) (= main_~B~0 main_~d~0) (= main_~p~0 1))} assume !!(#t~post6 < 100);havoc #t~post6; {3325#(and (<= 1 (mod main_~B~0 4294967296)) (= main_~B~0 main_~d~0) (= main_~p~0 1))} is VALID [2022-04-27 13:30:37,790 INFO L272 TraceCheckUtils]: 14: Hoare triple {3325#(and (<= 1 (mod main_~B~0 4294967296)) (= main_~B~0 main_~d~0) (= main_~p~0 1))} call __VERIFIER_assert((if 0 == ~q~0 % 4294967296 then 1 else 0)); {3284#true} is VALID [2022-04-27 13:30:37,790 INFO L290 TraceCheckUtils]: 15: Hoare triple {3284#true} ~cond := #in~cond; {3284#true} is VALID [2022-04-27 13:30:37,790 INFO L290 TraceCheckUtils]: 16: Hoare triple {3284#true} assume !(0 == ~cond); {3284#true} is VALID [2022-04-27 13:30:37,790 INFO L290 TraceCheckUtils]: 17: Hoare triple {3284#true} assume true; {3284#true} is VALID [2022-04-27 13:30:37,791 INFO L284 TraceCheckUtils]: 18: Hoare quadruple {3284#true} {3325#(and (<= 1 (mod main_~B~0 4294967296)) (= main_~B~0 main_~d~0) (= main_~p~0 1))} #82#return; {3325#(and (<= 1 (mod main_~B~0 4294967296)) (= main_~B~0 main_~d~0) (= main_~p~0 1))} is VALID [2022-04-27 13:30:37,791 INFO L272 TraceCheckUtils]: 19: Hoare triple {3325#(and (<= 1 (mod main_~B~0 4294967296)) (= main_~B~0 main_~d~0) (= main_~p~0 1))} call __VERIFIER_assert((if ~r~0 % 4294967296 == ~A~0 % 4294967296 then 1 else 0)); {3284#true} is VALID [2022-04-27 13:30:37,791 INFO L290 TraceCheckUtils]: 20: Hoare triple {3284#true} ~cond := #in~cond; {3284#true} is VALID [2022-04-27 13:30:37,791 INFO L290 TraceCheckUtils]: 21: Hoare triple {3284#true} assume !(0 == ~cond); {3284#true} is VALID [2022-04-27 13:30:37,791 INFO L290 TraceCheckUtils]: 22: Hoare triple {3284#true} assume true; {3284#true} is VALID [2022-04-27 13:30:37,792 INFO L284 TraceCheckUtils]: 23: Hoare quadruple {3284#true} {3325#(and (<= 1 (mod main_~B~0 4294967296)) (= main_~B~0 main_~d~0) (= main_~p~0 1))} #84#return; {3325#(and (<= 1 (mod main_~B~0 4294967296)) (= main_~B~0 main_~d~0) (= main_~p~0 1))} is VALID [2022-04-27 13:30:37,792 INFO L272 TraceCheckUtils]: 24: Hoare triple {3325#(and (<= 1 (mod main_~B~0 4294967296)) (= main_~B~0 main_~d~0) (= main_~p~0 1))} call __VERIFIER_assert((if ~d~0 % 4294967296 == ~B~0 * ~p~0 % 4294967296 then 1 else 0)); {3284#true} is VALID [2022-04-27 13:30:37,792 INFO L290 TraceCheckUtils]: 25: Hoare triple {3284#true} ~cond := #in~cond; {3284#true} is VALID [2022-04-27 13:30:37,792 INFO L290 TraceCheckUtils]: 26: Hoare triple {3284#true} assume !(0 == ~cond); {3284#true} is VALID [2022-04-27 13:30:37,792 INFO L290 TraceCheckUtils]: 27: Hoare triple {3284#true} assume true; {3284#true} is VALID [2022-04-27 13:30:37,792 INFO L284 TraceCheckUtils]: 28: Hoare quadruple {3284#true} {3325#(and (<= 1 (mod main_~B~0 4294967296)) (= main_~B~0 main_~d~0) (= main_~p~0 1))} #86#return; {3325#(and (<= 1 (mod main_~B~0 4294967296)) (= main_~B~0 main_~d~0) (= main_~p~0 1))} is VALID [2022-04-27 13:30:37,793 INFO L290 TraceCheckUtils]: 29: Hoare triple {3325#(and (<= 1 (mod main_~B~0 4294967296)) (= main_~B~0 main_~d~0) (= main_~p~0 1))} assume !!(~r~0 % 4294967296 >= ~d~0 % 4294967296);~d~0 := 2 * ~d~0;~p~0 := 2 * ~p~0; {3380#(and (= (* main_~B~0 2) main_~d~0) (= main_~p~0 2) (<= 1 (mod main_~B~0 4294967296)))} is VALID [2022-04-27 13:30:37,793 INFO L290 TraceCheckUtils]: 30: Hoare triple {3380#(and (= (* main_~B~0 2) main_~d~0) (= main_~p~0 2) (<= 1 (mod main_~B~0 4294967296)))} #t~post6 := ~counter~0;~counter~0 := 1 + #t~post6; {3380#(and (= (* main_~B~0 2) main_~d~0) (= main_~p~0 2) (<= 1 (mod main_~B~0 4294967296)))} is VALID [2022-04-27 13:30:37,794 INFO L290 TraceCheckUtils]: 31: Hoare triple {3380#(and (= (* main_~B~0 2) main_~d~0) (= main_~p~0 2) (<= 1 (mod main_~B~0 4294967296)))} assume !!(#t~post6 < 100);havoc #t~post6; {3380#(and (= (* main_~B~0 2) main_~d~0) (= main_~p~0 2) (<= 1 (mod main_~B~0 4294967296)))} is VALID [2022-04-27 13:30:37,794 INFO L272 TraceCheckUtils]: 32: Hoare triple {3380#(and (= (* main_~B~0 2) main_~d~0) (= main_~p~0 2) (<= 1 (mod main_~B~0 4294967296)))} call __VERIFIER_assert((if 0 == ~q~0 % 4294967296 then 1 else 0)); {3284#true} is VALID [2022-04-27 13:30:37,794 INFO L290 TraceCheckUtils]: 33: Hoare triple {3284#true} ~cond := #in~cond; {3284#true} is VALID [2022-04-27 13:30:37,794 INFO L290 TraceCheckUtils]: 34: Hoare triple {3284#true} assume !(0 == ~cond); {3284#true} is VALID [2022-04-27 13:30:37,794 INFO L290 TraceCheckUtils]: 35: Hoare triple {3284#true} assume true; {3284#true} is VALID [2022-04-27 13:30:37,794 INFO L284 TraceCheckUtils]: 36: Hoare quadruple {3284#true} {3380#(and (= (* main_~B~0 2) main_~d~0) (= main_~p~0 2) (<= 1 (mod main_~B~0 4294967296)))} #82#return; {3380#(and (= (* main_~B~0 2) main_~d~0) (= main_~p~0 2) (<= 1 (mod main_~B~0 4294967296)))} is VALID [2022-04-27 13:30:37,795 INFO L272 TraceCheckUtils]: 37: Hoare triple {3380#(and (= (* main_~B~0 2) main_~d~0) (= main_~p~0 2) (<= 1 (mod main_~B~0 4294967296)))} call __VERIFIER_assert((if ~r~0 % 4294967296 == ~A~0 % 4294967296 then 1 else 0)); {3284#true} is VALID [2022-04-27 13:30:37,795 INFO L290 TraceCheckUtils]: 38: Hoare triple {3284#true} ~cond := #in~cond; {3284#true} is VALID [2022-04-27 13:30:37,795 INFO L290 TraceCheckUtils]: 39: Hoare triple {3284#true} assume !(0 == ~cond); {3284#true} is VALID [2022-04-27 13:30:37,795 INFO L290 TraceCheckUtils]: 40: Hoare triple {3284#true} assume true; {3284#true} is VALID [2022-04-27 13:30:37,795 INFO L284 TraceCheckUtils]: 41: Hoare quadruple {3284#true} {3380#(and (= (* main_~B~0 2) main_~d~0) (= main_~p~0 2) (<= 1 (mod main_~B~0 4294967296)))} #84#return; {3380#(and (= (* main_~B~0 2) main_~d~0) (= main_~p~0 2) (<= 1 (mod main_~B~0 4294967296)))} is VALID [2022-04-27 13:30:37,800 INFO L272 TraceCheckUtils]: 42: Hoare triple {3380#(and (= (* main_~B~0 2) main_~d~0) (= main_~p~0 2) (<= 1 (mod main_~B~0 4294967296)))} call __VERIFIER_assert((if ~d~0 % 4294967296 == ~B~0 * ~p~0 % 4294967296 then 1 else 0)); {3420#(<= 1 |__VERIFIER_assert_#in~cond|)} is VALID [2022-04-27 13:30:37,800 INFO L290 TraceCheckUtils]: 43: Hoare triple {3420#(<= 1 |__VERIFIER_assert_#in~cond|)} ~cond := #in~cond; {3424#(<= 1 __VERIFIER_assert_~cond)} is VALID [2022-04-27 13:30:37,800 INFO L290 TraceCheckUtils]: 44: Hoare triple {3424#(<= 1 __VERIFIER_assert_~cond)} assume 0 == ~cond; {3285#false} is VALID [2022-04-27 13:30:37,801 INFO L290 TraceCheckUtils]: 45: Hoare triple {3285#false} assume !false; {3285#false} is VALID [2022-04-27 13:30:37,801 INFO L134 CoverageAnalysis]: Checked inductivity of 55 backedges. 10 proven. 5 refuted. 0 times theorem prover too weak. 40 trivial. 0 not checked. [2022-04-27 13:30:37,801 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-04-27 13:30:38,857 INFO L290 TraceCheckUtils]: 45: Hoare triple {3285#false} assume !false; {3285#false} is VALID [2022-04-27 13:30:38,858 INFO L290 TraceCheckUtils]: 44: Hoare triple {3424#(<= 1 __VERIFIER_assert_~cond)} assume 0 == ~cond; {3285#false} is VALID [2022-04-27 13:30:38,858 INFO L290 TraceCheckUtils]: 43: Hoare triple {3420#(<= 1 |__VERIFIER_assert_#in~cond|)} ~cond := #in~cond; {3424#(<= 1 __VERIFIER_assert_~cond)} is VALID [2022-04-27 13:30:38,859 INFO L272 TraceCheckUtils]: 42: Hoare triple {3440#(= (mod main_~d~0 4294967296) (mod (* main_~B~0 main_~p~0) 4294967296))} call __VERIFIER_assert((if ~d~0 % 4294967296 == ~B~0 * ~p~0 % 4294967296 then 1 else 0)); {3420#(<= 1 |__VERIFIER_assert_#in~cond|)} is VALID [2022-04-27 13:30:38,859 INFO L284 TraceCheckUtils]: 41: Hoare quadruple {3284#true} {3440#(= (mod main_~d~0 4294967296) (mod (* main_~B~0 main_~p~0) 4294967296))} #84#return; {3440#(= (mod main_~d~0 4294967296) (mod (* main_~B~0 main_~p~0) 4294967296))} is VALID [2022-04-27 13:30:38,859 INFO L290 TraceCheckUtils]: 40: Hoare triple {3284#true} assume true; {3284#true} is VALID [2022-04-27 13:30:38,859 INFO L290 TraceCheckUtils]: 39: Hoare triple {3284#true} assume !(0 == ~cond); {3284#true} is VALID [2022-04-27 13:30:38,859 INFO L290 TraceCheckUtils]: 38: Hoare triple {3284#true} ~cond := #in~cond; {3284#true} is VALID [2022-04-27 13:30:38,859 INFO L272 TraceCheckUtils]: 37: Hoare triple {3440#(= (mod main_~d~0 4294967296) (mod (* main_~B~0 main_~p~0) 4294967296))} call __VERIFIER_assert((if ~r~0 % 4294967296 == ~A~0 % 4294967296 then 1 else 0)); {3284#true} is VALID [2022-04-27 13:30:38,862 INFO L284 TraceCheckUtils]: 36: Hoare quadruple {3284#true} {3440#(= (mod main_~d~0 4294967296) (mod (* main_~B~0 main_~p~0) 4294967296))} #82#return; {3440#(= (mod main_~d~0 4294967296) (mod (* main_~B~0 main_~p~0) 4294967296))} is VALID [2022-04-27 13:30:38,862 INFO L290 TraceCheckUtils]: 35: Hoare triple {3284#true} assume true; {3284#true} is VALID [2022-04-27 13:30:38,862 INFO L290 TraceCheckUtils]: 34: Hoare triple {3284#true} assume !(0 == ~cond); {3284#true} is VALID [2022-04-27 13:30:38,862 INFO L290 TraceCheckUtils]: 33: Hoare triple {3284#true} ~cond := #in~cond; {3284#true} is VALID [2022-04-27 13:30:38,862 INFO L272 TraceCheckUtils]: 32: Hoare triple {3440#(= (mod main_~d~0 4294967296) (mod (* main_~B~0 main_~p~0) 4294967296))} call __VERIFIER_assert((if 0 == ~q~0 % 4294967296 then 1 else 0)); {3284#true} is VALID [2022-04-27 13:30:38,863 INFO L290 TraceCheckUtils]: 31: Hoare triple {3440#(= (mod main_~d~0 4294967296) (mod (* main_~B~0 main_~p~0) 4294967296))} assume !!(#t~post6 < 100);havoc #t~post6; {3440#(= (mod main_~d~0 4294967296) (mod (* main_~B~0 main_~p~0) 4294967296))} is VALID [2022-04-27 13:30:38,863 INFO L290 TraceCheckUtils]: 30: Hoare triple {3440#(= (mod main_~d~0 4294967296) (mod (* main_~B~0 main_~p~0) 4294967296))} #t~post6 := ~counter~0;~counter~0 := 1 + #t~post6; {3440#(= (mod main_~d~0 4294967296) (mod (* main_~B~0 main_~p~0) 4294967296))} is VALID [2022-04-27 13:30:40,866 WARN L290 TraceCheckUtils]: 29: Hoare triple {3480#(= (mod (* main_~d~0 2) 4294967296) (mod (* (* main_~p~0 2) main_~B~0) 4294967296))} assume !!(~r~0 % 4294967296 >= ~d~0 % 4294967296);~d~0 := 2 * ~d~0;~p~0 := 2 * ~p~0; {3440#(= (mod main_~d~0 4294967296) (mod (* main_~B~0 main_~p~0) 4294967296))} is UNKNOWN [2022-04-27 13:30:40,867 INFO L284 TraceCheckUtils]: 28: Hoare quadruple {3284#true} {3480#(= (mod (* main_~d~0 2) 4294967296) (mod (* (* main_~p~0 2) main_~B~0) 4294967296))} #86#return; {3480#(= (mod (* main_~d~0 2) 4294967296) (mod (* (* main_~p~0 2) main_~B~0) 4294967296))} is VALID [2022-04-27 13:30:40,867 INFO L290 TraceCheckUtils]: 27: Hoare triple {3284#true} assume true; {3284#true} is VALID [2022-04-27 13:30:40,867 INFO L290 TraceCheckUtils]: 26: Hoare triple {3284#true} assume !(0 == ~cond); {3284#true} is VALID [2022-04-27 13:30:40,867 INFO L290 TraceCheckUtils]: 25: Hoare triple {3284#true} ~cond := #in~cond; {3284#true} is VALID [2022-04-27 13:30:40,867 INFO L272 TraceCheckUtils]: 24: Hoare triple {3480#(= (mod (* main_~d~0 2) 4294967296) (mod (* (* main_~p~0 2) main_~B~0) 4294967296))} call __VERIFIER_assert((if ~d~0 % 4294967296 == ~B~0 * ~p~0 % 4294967296 then 1 else 0)); {3284#true} is VALID [2022-04-27 13:30:40,868 INFO L284 TraceCheckUtils]: 23: Hoare quadruple {3284#true} {3480#(= (mod (* main_~d~0 2) 4294967296) (mod (* (* main_~p~0 2) main_~B~0) 4294967296))} #84#return; {3480#(= (mod (* main_~d~0 2) 4294967296) (mod (* (* main_~p~0 2) main_~B~0) 4294967296))} is VALID [2022-04-27 13:30:40,868 INFO L290 TraceCheckUtils]: 22: Hoare triple {3284#true} assume true; {3284#true} is VALID [2022-04-27 13:30:40,868 INFO L290 TraceCheckUtils]: 21: Hoare triple {3284#true} assume !(0 == ~cond); {3284#true} is VALID [2022-04-27 13:30:40,868 INFO L290 TraceCheckUtils]: 20: Hoare triple {3284#true} ~cond := #in~cond; {3284#true} is VALID [2022-04-27 13:30:40,868 INFO L272 TraceCheckUtils]: 19: Hoare triple {3480#(= (mod (* main_~d~0 2) 4294967296) (mod (* (* main_~p~0 2) main_~B~0) 4294967296))} call __VERIFIER_assert((if ~r~0 % 4294967296 == ~A~0 % 4294967296 then 1 else 0)); {3284#true} is VALID [2022-04-27 13:30:40,868 INFO L284 TraceCheckUtils]: 18: Hoare quadruple {3284#true} {3480#(= (mod (* main_~d~0 2) 4294967296) (mod (* (* main_~p~0 2) main_~B~0) 4294967296))} #82#return; {3480#(= (mod (* main_~d~0 2) 4294967296) (mod (* (* main_~p~0 2) main_~B~0) 4294967296))} is VALID [2022-04-27 13:30:40,868 INFO L290 TraceCheckUtils]: 17: Hoare triple {3284#true} assume true; {3284#true} is VALID [2022-04-27 13:30:40,868 INFO L290 TraceCheckUtils]: 16: Hoare triple {3284#true} assume !(0 == ~cond); {3284#true} is VALID [2022-04-27 13:30:40,869 INFO L290 TraceCheckUtils]: 15: Hoare triple {3284#true} ~cond := #in~cond; {3284#true} is VALID [2022-04-27 13:30:40,869 INFO L272 TraceCheckUtils]: 14: Hoare triple {3480#(= (mod (* main_~d~0 2) 4294967296) (mod (* (* main_~p~0 2) main_~B~0) 4294967296))} call __VERIFIER_assert((if 0 == ~q~0 % 4294967296 then 1 else 0)); {3284#true} is VALID [2022-04-27 13:30:40,869 INFO L290 TraceCheckUtils]: 13: Hoare triple {3480#(= (mod (* main_~d~0 2) 4294967296) (mod (* (* main_~p~0 2) main_~B~0) 4294967296))} assume !!(#t~post6 < 100);havoc #t~post6; {3480#(= (mod (* main_~d~0 2) 4294967296) (mod (* (* main_~p~0 2) main_~B~0) 4294967296))} is VALID [2022-04-27 13:30:40,869 INFO L290 TraceCheckUtils]: 12: Hoare triple {3480#(= (mod (* main_~d~0 2) 4294967296) (mod (* (* main_~p~0 2) main_~B~0) 4294967296))} #t~post6 := ~counter~0;~counter~0 := 1 + #t~post6; {3480#(= (mod (* main_~d~0 2) 4294967296) (mod (* (* main_~p~0 2) main_~B~0) 4294967296))} is VALID [2022-04-27 13:30:40,870 INFO L290 TraceCheckUtils]: 11: Hoare triple {3284#true} ~r~0 := ~A~0;~d~0 := ~B~0;~p~0 := 1;~q~0 := 0; {3480#(= (mod (* main_~d~0 2) 4294967296) (mod (* (* main_~p~0 2) main_~B~0) 4294967296))} is VALID [2022-04-27 13:30:40,870 INFO L284 TraceCheckUtils]: 10: Hoare quadruple {3284#true} {3284#true} #80#return; {3284#true} is VALID [2022-04-27 13:30:40,870 INFO L290 TraceCheckUtils]: 9: Hoare triple {3284#true} assume true; {3284#true} is VALID [2022-04-27 13:30:40,870 INFO L290 TraceCheckUtils]: 8: Hoare triple {3284#true} assume !(0 == ~cond); {3284#true} is VALID [2022-04-27 13:30:40,870 INFO L290 TraceCheckUtils]: 7: Hoare triple {3284#true} ~cond := #in~cond; {3284#true} is VALID [2022-04-27 13:30:40,870 INFO L272 TraceCheckUtils]: 6: Hoare triple {3284#true} call assume_abort_if_not((if ~B~0 % 4294967296 >= 1 then 1 else 0)); {3284#true} is VALID [2022-04-27 13:30:40,870 INFO L290 TraceCheckUtils]: 5: Hoare triple {3284#true} havoc ~A~0;havoc ~B~0;havoc ~r~0;havoc ~d~0;havoc ~p~0;havoc ~q~0;~A~0 := #t~nondet4;havoc #t~nondet4;~B~0 := #t~nondet5;havoc #t~nondet5; {3284#true} is VALID [2022-04-27 13:30:40,870 INFO L272 TraceCheckUtils]: 4: Hoare triple {3284#true} call #t~ret8 := main(); {3284#true} is VALID [2022-04-27 13:30:40,870 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {3284#true} {3284#true} #96#return; {3284#true} is VALID [2022-04-27 13:30:40,870 INFO L290 TraceCheckUtils]: 2: Hoare triple {3284#true} assume true; {3284#true} is VALID [2022-04-27 13:30:40,870 INFO L290 TraceCheckUtils]: 1: Hoare triple {3284#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);call #Ultimate.allocInit(12, 3);~counter~0 := 0; {3284#true} is VALID [2022-04-27 13:30:40,871 INFO L272 TraceCheckUtils]: 0: Hoare triple {3284#true} call ULTIMATE.init(); {3284#true} is VALID [2022-04-27 13:30:40,871 INFO L134 CoverageAnalysis]: Checked inductivity of 55 backedges. 15 proven. 0 refuted. 0 times theorem prover too weak. 40 trivial. 0 not checked. [2022-04-27 13:30:40,871 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-27 13:30:40,871 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1056937775] [2022-04-27 13:30:40,871 WARN L310 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2022-04-27 13:30:40,871 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [575336913] [2022-04-27 13:30:40,871 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [575336913] provided 1 perfect and 1 imperfect interpolant sequences [2022-04-27 13:30:40,871 INFO L184 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2022-04-27 13:30:40,871 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [9] total 11 [2022-04-27 13:30:40,871 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1790012511] [2022-04-27 13:30:40,871 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-27 13:30:40,872 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 3.0) internal successors, (18), 5 states have internal predecessors, (18), 3 states have call successors, (9), 2 states have call predecessors, (9), 1 states have return successors, (7), 3 states have call predecessors, (7), 3 states have call successors, (7) Word has length 46 [2022-04-27 13:30:40,872 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-27 13:30:40,872 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with has 6 states, 6 states have (on average 3.0) internal successors, (18), 5 states have internal predecessors, (18), 3 states have call successors, (9), 2 states have call predecessors, (9), 1 states have return successors, (7), 3 states have call predecessors, (7), 3 states have call successors, (7) [2022-04-27 13:30:42,912 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 34 edges. 33 inductive. 0 not inductive. 1 times theorem prover too weak to decide inductivity. [2022-04-27 13:30:42,912 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2022-04-27 13:30:42,912 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-04-27 13:30:42,912 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2022-04-27 13:30:42,913 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=26, Invalid=84, Unknown=0, NotChecked=0, Total=110 [2022-04-27 13:30:42,913 INFO L87 Difference]: Start difference. First operand 138 states and 166 transitions. Second operand has 6 states, 6 states have (on average 3.0) internal successors, (18), 5 states have internal predecessors, (18), 3 states have call successors, (9), 2 states have call predecessors, (9), 1 states have return successors, (7), 3 states have call predecessors, (7), 3 states have call successors, (7) [2022-04-27 13:30:46,112 WARN L534 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=true, quantifiers [] [2022-04-27 13:30:49,007 WARN L534 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=true, quantifiers [] [2022-04-27 13:30:50,498 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-27 13:30:50,498 INFO L93 Difference]: Finished difference Result 162 states and 199 transitions. [2022-04-27 13:30:50,498 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-04-27 13:30:50,498 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 3.0) internal successors, (18), 5 states have internal predecessors, (18), 3 states have call successors, (9), 2 states have call predecessors, (9), 1 states have return successors, (7), 3 states have call predecessors, (7), 3 states have call successors, (7) Word has length 46 [2022-04-27 13:30:50,499 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-27 13:30:50,499 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 6 states, 6 states have (on average 3.0) internal successors, (18), 5 states have internal predecessors, (18), 3 states have call successors, (9), 2 states have call predecessors, (9), 1 states have return successors, (7), 3 states have call predecessors, (7), 3 states have call successors, (7) [2022-04-27 13:30:50,500 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 59 transitions. [2022-04-27 13:30:50,500 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 6 states, 6 states have (on average 3.0) internal successors, (18), 5 states have internal predecessors, (18), 3 states have call successors, (9), 2 states have call predecessors, (9), 1 states have return successors, (7), 3 states have call predecessors, (7), 3 states have call successors, (7) [2022-04-27 13:30:50,501 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 59 transitions. [2022-04-27 13:30:50,501 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 5 states and 59 transitions. [2022-04-27 13:30:52,563 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 59 edges. 58 inductive. 0 not inductive. 1 times theorem prover too weak to decide inductivity. [2022-04-27 13:30:52,566 INFO L225 Difference]: With dead ends: 162 [2022-04-27 13:30:52,566 INFO L226 Difference]: Without dead ends: 160 [2022-04-27 13:30:52,566 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 92 GetRequests, 81 SyntacticMatches, 1 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 12 ImplicationChecksByTransitivity, 0.6s TimeCoverageRelationStatistics Valid=30, Invalid=102, Unknown=0, NotChecked=0, Total=132 [2022-04-27 13:30:52,567 INFO L413 NwaCegarLoop]: 43 mSDtfsCounter, 17 mSDsluCounter, 89 mSDsCounter, 0 mSdLazyCounter, 51 mSolverCounterSat, 5 mSolverCounterUnsat, 2 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 5.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 21 SdHoareTripleChecker+Valid, 132 SdHoareTripleChecker+Invalid, 58 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 5 IncrementalHoareTripleChecker+Valid, 51 IncrementalHoareTripleChecker+Invalid, 2 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 5.2s IncrementalHoareTripleChecker+Time [2022-04-27 13:30:52,567 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [21 Valid, 132 Invalid, 58 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [5 Valid, 51 Invalid, 2 Unknown, 0 Unchecked, 5.2s Time] [2022-04-27 13:30:52,567 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 160 states. [2022-04-27 13:30:52,606 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 160 to 154. [2022-04-27 13:30:52,606 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-27 13:30:52,606 INFO L82 GeneralOperation]: Start isEquivalent. First operand 160 states. Second operand has 154 states, 98 states have (on average 1.2040816326530612) internal successors, (118), 104 states have internal predecessors, (118), 35 states have call successors, (35), 21 states have call predecessors, (35), 20 states have return successors, (32), 28 states have call predecessors, (32), 32 states have call successors, (32) [2022-04-27 13:30:52,607 INFO L74 IsIncluded]: Start isIncluded. First operand 160 states. Second operand has 154 states, 98 states have (on average 1.2040816326530612) internal successors, (118), 104 states have internal predecessors, (118), 35 states have call successors, (35), 21 states have call predecessors, (35), 20 states have return successors, (32), 28 states have call predecessors, (32), 32 states have call successors, (32) [2022-04-27 13:30:52,607 INFO L87 Difference]: Start difference. First operand 160 states. Second operand has 154 states, 98 states have (on average 1.2040816326530612) internal successors, (118), 104 states have internal predecessors, (118), 35 states have call successors, (35), 21 states have call predecessors, (35), 20 states have return successors, (32), 28 states have call predecessors, (32), 32 states have call successors, (32) [2022-04-27 13:30:52,610 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-27 13:30:52,611 INFO L93 Difference]: Finished difference Result 160 states and 195 transitions. [2022-04-27 13:30:52,611 INFO L276 IsEmpty]: Start isEmpty. Operand 160 states and 195 transitions. [2022-04-27 13:30:52,611 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-27 13:30:52,611 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-27 13:30:52,626 INFO L74 IsIncluded]: Start isIncluded. First operand has 154 states, 98 states have (on average 1.2040816326530612) internal successors, (118), 104 states have internal predecessors, (118), 35 states have call successors, (35), 21 states have call predecessors, (35), 20 states have return successors, (32), 28 states have call predecessors, (32), 32 states have call successors, (32) Second operand 160 states. [2022-04-27 13:30:52,626 INFO L87 Difference]: Start difference. First operand has 154 states, 98 states have (on average 1.2040816326530612) internal successors, (118), 104 states have internal predecessors, (118), 35 states have call successors, (35), 21 states have call predecessors, (35), 20 states have return successors, (32), 28 states have call predecessors, (32), 32 states have call successors, (32) Second operand 160 states. [2022-04-27 13:30:52,631 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-27 13:30:52,631 INFO L93 Difference]: Finished difference Result 160 states and 195 transitions. [2022-04-27 13:30:52,631 INFO L276 IsEmpty]: Start isEmpty. Operand 160 states and 195 transitions. [2022-04-27 13:30:52,632 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-27 13:30:52,632 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-27 13:30:52,632 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-27 13:30:52,632 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-27 13:30:52,633 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 154 states, 98 states have (on average 1.2040816326530612) internal successors, (118), 104 states have internal predecessors, (118), 35 states have call successors, (35), 21 states have call predecessors, (35), 20 states have return successors, (32), 28 states have call predecessors, (32), 32 states have call successors, (32) [2022-04-27 13:30:52,635 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 154 states to 154 states and 185 transitions. [2022-04-27 13:30:52,636 INFO L78 Accepts]: Start accepts. Automaton has 154 states and 185 transitions. Word has length 46 [2022-04-27 13:30:52,636 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-27 13:30:52,636 INFO L495 AbstractCegarLoop]: Abstraction has 154 states and 185 transitions. [2022-04-27 13:30:52,636 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 3.0) internal successors, (18), 5 states have internal predecessors, (18), 3 states have call successors, (9), 2 states have call predecessors, (9), 1 states have return successors, (7), 3 states have call predecessors, (7), 3 states have call successors, (7) [2022-04-27 13:30:52,636 INFO L276 IsEmpty]: Start isEmpty. Operand 154 states and 185 transitions. [2022-04-27 13:30:52,637 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 51 [2022-04-27 13:30:52,637 INFO L187 NwaCegarLoop]: Found error trace [2022-04-27 13:30:52,637 INFO L195 NwaCegarLoop]: trace histogram [6, 5, 5, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-27 13:30:52,645 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (7)] Forceful destruction successful, exit code 0 [2022-04-27 13:30:52,841 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8,7 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-27 13:30:52,843 INFO L420 AbstractCegarLoop]: === Iteration 10 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-27 13:30:52,844 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-27 13:30:52,844 INFO L85 PathProgramCache]: Analyzing trace with hash -399036107, now seen corresponding path program 1 times [2022-04-27 13:30:52,844 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-27 13:30:52,844 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [734678765] [2022-04-27 13:30:52,844 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-27 13:30:52,844 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-27 13:30:52,864 ERROR L245 FreeRefinementEngine]: Caught known exception: Unsupported non-linear arithmetic [2022-04-27 13:30:52,865 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [157166457] [2022-04-27 13:30:52,865 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-27 13:30:52,865 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-27 13:30:52,865 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-04-27 13:30:52,871 INFO L229 MonitoredProcess]: Starting monitored process 8 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-04-27 13:30:52,872 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (8)] Waiting until timeout for monitored process [2022-04-27 13:30:52,912 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-27 13:30:52,913 INFO L263 TraceCheckSpWp]: Trace formula consists of 148 conjuncts, 9 conjunts are in the unsatisfiable core [2022-04-27 13:30:52,925 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-27 13:30:52,926 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-04-27 13:30:53,193 INFO L272 TraceCheckUtils]: 0: Hoare triple {4334#true} call ULTIMATE.init(); {4334#true} is VALID [2022-04-27 13:30:53,194 INFO L290 TraceCheckUtils]: 1: Hoare triple {4334#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);call #Ultimate.allocInit(12, 3);~counter~0 := 0; {4342#(<= ~counter~0 0)} is VALID [2022-04-27 13:30:53,194 INFO L290 TraceCheckUtils]: 2: Hoare triple {4342#(<= ~counter~0 0)} assume true; {4342#(<= ~counter~0 0)} is VALID [2022-04-27 13:30:53,194 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {4342#(<= ~counter~0 0)} {4334#true} #96#return; {4342#(<= ~counter~0 0)} is VALID [2022-04-27 13:30:53,195 INFO L272 TraceCheckUtils]: 4: Hoare triple {4342#(<= ~counter~0 0)} call #t~ret8 := main(); {4342#(<= ~counter~0 0)} is VALID [2022-04-27 13:30:53,195 INFO L290 TraceCheckUtils]: 5: Hoare triple {4342#(<= ~counter~0 0)} havoc ~A~0;havoc ~B~0;havoc ~r~0;havoc ~d~0;havoc ~p~0;havoc ~q~0;~A~0 := #t~nondet4;havoc #t~nondet4;~B~0 := #t~nondet5;havoc #t~nondet5; {4342#(<= ~counter~0 0)} is VALID [2022-04-27 13:30:53,195 INFO L272 TraceCheckUtils]: 6: Hoare triple {4342#(<= ~counter~0 0)} call assume_abort_if_not((if ~B~0 % 4294967296 >= 1 then 1 else 0)); {4342#(<= ~counter~0 0)} is VALID [2022-04-27 13:30:53,196 INFO L290 TraceCheckUtils]: 7: Hoare triple {4342#(<= ~counter~0 0)} ~cond := #in~cond; {4342#(<= ~counter~0 0)} is VALID [2022-04-27 13:30:53,196 INFO L290 TraceCheckUtils]: 8: Hoare triple {4342#(<= ~counter~0 0)} assume !(0 == ~cond); {4342#(<= ~counter~0 0)} is VALID [2022-04-27 13:30:53,196 INFO L290 TraceCheckUtils]: 9: Hoare triple {4342#(<= ~counter~0 0)} assume true; {4342#(<= ~counter~0 0)} is VALID [2022-04-27 13:30:53,197 INFO L284 TraceCheckUtils]: 10: Hoare quadruple {4342#(<= ~counter~0 0)} {4342#(<= ~counter~0 0)} #80#return; {4342#(<= ~counter~0 0)} is VALID [2022-04-27 13:30:53,197 INFO L290 TraceCheckUtils]: 11: Hoare triple {4342#(<= ~counter~0 0)} ~r~0 := ~A~0;~d~0 := ~B~0;~p~0 := 1;~q~0 := 0; {4342#(<= ~counter~0 0)} is VALID [2022-04-27 13:30:53,198 INFO L290 TraceCheckUtils]: 12: Hoare triple {4342#(<= ~counter~0 0)} #t~post6 := ~counter~0;~counter~0 := 1 + #t~post6; {4376#(<= ~counter~0 1)} is VALID [2022-04-27 13:30:53,198 INFO L290 TraceCheckUtils]: 13: Hoare triple {4376#(<= ~counter~0 1)} assume !!(#t~post6 < 100);havoc #t~post6; {4376#(<= ~counter~0 1)} is VALID [2022-04-27 13:30:53,199 INFO L272 TraceCheckUtils]: 14: Hoare triple {4376#(<= ~counter~0 1)} call __VERIFIER_assert((if 0 == ~q~0 % 4294967296 then 1 else 0)); {4376#(<= ~counter~0 1)} is VALID [2022-04-27 13:30:53,199 INFO L290 TraceCheckUtils]: 15: Hoare triple {4376#(<= ~counter~0 1)} ~cond := #in~cond; {4376#(<= ~counter~0 1)} is VALID [2022-04-27 13:30:53,200 INFO L290 TraceCheckUtils]: 16: Hoare triple {4376#(<= ~counter~0 1)} assume !(0 == ~cond); {4376#(<= ~counter~0 1)} is VALID [2022-04-27 13:30:53,200 INFO L290 TraceCheckUtils]: 17: Hoare triple {4376#(<= ~counter~0 1)} assume true; {4376#(<= ~counter~0 1)} is VALID [2022-04-27 13:30:53,200 INFO L284 TraceCheckUtils]: 18: Hoare quadruple {4376#(<= ~counter~0 1)} {4376#(<= ~counter~0 1)} #82#return; {4376#(<= ~counter~0 1)} is VALID [2022-04-27 13:30:53,201 INFO L272 TraceCheckUtils]: 19: Hoare triple {4376#(<= ~counter~0 1)} call __VERIFIER_assert((if ~r~0 % 4294967296 == ~A~0 % 4294967296 then 1 else 0)); {4376#(<= ~counter~0 1)} is VALID [2022-04-27 13:30:53,201 INFO L290 TraceCheckUtils]: 20: Hoare triple {4376#(<= ~counter~0 1)} ~cond := #in~cond; {4376#(<= ~counter~0 1)} is VALID [2022-04-27 13:30:53,201 INFO L290 TraceCheckUtils]: 21: Hoare triple {4376#(<= ~counter~0 1)} assume !(0 == ~cond); {4376#(<= ~counter~0 1)} is VALID [2022-04-27 13:30:53,202 INFO L290 TraceCheckUtils]: 22: Hoare triple {4376#(<= ~counter~0 1)} assume true; {4376#(<= ~counter~0 1)} is VALID [2022-04-27 13:30:53,202 INFO L284 TraceCheckUtils]: 23: Hoare quadruple {4376#(<= ~counter~0 1)} {4376#(<= ~counter~0 1)} #84#return; {4376#(<= ~counter~0 1)} is VALID [2022-04-27 13:30:53,203 INFO L272 TraceCheckUtils]: 24: Hoare triple {4376#(<= ~counter~0 1)} call __VERIFIER_assert((if ~d~0 % 4294967296 == ~B~0 * ~p~0 % 4294967296 then 1 else 0)); {4376#(<= ~counter~0 1)} is VALID [2022-04-27 13:30:53,203 INFO L290 TraceCheckUtils]: 25: Hoare triple {4376#(<= ~counter~0 1)} ~cond := #in~cond; {4376#(<= ~counter~0 1)} is VALID [2022-04-27 13:30:53,203 INFO L290 TraceCheckUtils]: 26: Hoare triple {4376#(<= ~counter~0 1)} assume !(0 == ~cond); {4376#(<= ~counter~0 1)} is VALID [2022-04-27 13:30:53,203 INFO L290 TraceCheckUtils]: 27: Hoare triple {4376#(<= ~counter~0 1)} assume true; {4376#(<= ~counter~0 1)} is VALID [2022-04-27 13:30:53,204 INFO L284 TraceCheckUtils]: 28: Hoare quadruple {4376#(<= ~counter~0 1)} {4376#(<= ~counter~0 1)} #86#return; {4376#(<= ~counter~0 1)} is VALID [2022-04-27 13:30:53,204 INFO L290 TraceCheckUtils]: 29: Hoare triple {4376#(<= ~counter~0 1)} assume !(~r~0 % 4294967296 >= ~d~0 % 4294967296); {4376#(<= ~counter~0 1)} is VALID [2022-04-27 13:30:53,205 INFO L290 TraceCheckUtils]: 30: Hoare triple {4376#(<= ~counter~0 1)} #t~post7 := ~counter~0;~counter~0 := 1 + #t~post7; {4431#(<= ~counter~0 2)} is VALID [2022-04-27 13:30:53,205 INFO L290 TraceCheckUtils]: 31: Hoare triple {4431#(<= ~counter~0 2)} assume !!(#t~post7 < 100);havoc #t~post7; {4431#(<= ~counter~0 2)} is VALID [2022-04-27 13:30:53,206 INFO L272 TraceCheckUtils]: 32: Hoare triple {4431#(<= ~counter~0 2)} call __VERIFIER_assert((if ~A~0 % 4294967296 == (~q~0 * ~B~0 + ~r~0) % 4294967296 then 1 else 0)); {4431#(<= ~counter~0 2)} is VALID [2022-04-27 13:30:53,206 INFO L290 TraceCheckUtils]: 33: Hoare triple {4431#(<= ~counter~0 2)} ~cond := #in~cond; {4431#(<= ~counter~0 2)} is VALID [2022-04-27 13:30:53,206 INFO L290 TraceCheckUtils]: 34: Hoare triple {4431#(<= ~counter~0 2)} assume !(0 == ~cond); {4431#(<= ~counter~0 2)} is VALID [2022-04-27 13:30:53,207 INFO L290 TraceCheckUtils]: 35: Hoare triple {4431#(<= ~counter~0 2)} assume true; {4431#(<= ~counter~0 2)} is VALID [2022-04-27 13:30:53,207 INFO L284 TraceCheckUtils]: 36: Hoare quadruple {4431#(<= ~counter~0 2)} {4431#(<= ~counter~0 2)} #88#return; {4431#(<= ~counter~0 2)} is VALID [2022-04-27 13:30:53,208 INFO L272 TraceCheckUtils]: 37: Hoare triple {4431#(<= ~counter~0 2)} call __VERIFIER_assert((if ~d~0 % 4294967296 == ~B~0 * ~p~0 % 4294967296 then 1 else 0)); {4431#(<= ~counter~0 2)} is VALID [2022-04-27 13:30:53,208 INFO L290 TraceCheckUtils]: 38: Hoare triple {4431#(<= ~counter~0 2)} ~cond := #in~cond; {4431#(<= ~counter~0 2)} is VALID [2022-04-27 13:30:53,208 INFO L290 TraceCheckUtils]: 39: Hoare triple {4431#(<= ~counter~0 2)} assume !(0 == ~cond); {4431#(<= ~counter~0 2)} is VALID [2022-04-27 13:30:53,209 INFO L290 TraceCheckUtils]: 40: Hoare triple {4431#(<= ~counter~0 2)} assume true; {4431#(<= ~counter~0 2)} is VALID [2022-04-27 13:30:53,209 INFO L284 TraceCheckUtils]: 41: Hoare quadruple {4431#(<= ~counter~0 2)} {4431#(<= ~counter~0 2)} #90#return; {4431#(<= ~counter~0 2)} is VALID [2022-04-27 13:30:53,210 INFO L290 TraceCheckUtils]: 42: Hoare triple {4431#(<= ~counter~0 2)} assume !!(1 != ~p~0 % 4294967296);~d~0 := (if ~d~0 % 4294967296 < 0 && 0 != ~d~0 % 4294967296 % 2 then 1 + ~d~0 % 4294967296 / 2 else ~d~0 % 4294967296 / 2);~p~0 := (if ~p~0 % 4294967296 < 0 && 0 != ~p~0 % 4294967296 % 2 then 1 + ~p~0 % 4294967296 / 2 else ~p~0 % 4294967296 / 2); {4431#(<= ~counter~0 2)} is VALID [2022-04-27 13:30:53,210 INFO L290 TraceCheckUtils]: 43: Hoare triple {4431#(<= ~counter~0 2)} assume ~r~0 % 4294967296 >= ~d~0 % 4294967296;~r~0 := ~r~0 - ~d~0;~q~0 := ~q~0 + ~p~0; {4431#(<= ~counter~0 2)} is VALID [2022-04-27 13:30:53,210 INFO L290 TraceCheckUtils]: 44: Hoare triple {4431#(<= ~counter~0 2)} #t~post7 := ~counter~0;~counter~0 := 1 + #t~post7; {4474#(<= |main_#t~post7| 2)} is VALID [2022-04-27 13:30:53,211 INFO L290 TraceCheckUtils]: 45: Hoare triple {4474#(<= |main_#t~post7| 2)} assume !(#t~post7 < 100);havoc #t~post7; {4335#false} is VALID [2022-04-27 13:30:53,211 INFO L272 TraceCheckUtils]: 46: Hoare triple {4335#false} call __VERIFIER_assert((if ~A~0 % 4294967296 == (~d~0 * ~q~0 + ~r~0) % 4294967296 then 1 else 0)); {4335#false} is VALID [2022-04-27 13:30:53,211 INFO L290 TraceCheckUtils]: 47: Hoare triple {4335#false} ~cond := #in~cond; {4335#false} is VALID [2022-04-27 13:30:53,211 INFO L290 TraceCheckUtils]: 48: Hoare triple {4335#false} assume 0 == ~cond; {4335#false} is VALID [2022-04-27 13:30:53,211 INFO L290 TraceCheckUtils]: 49: Hoare triple {4335#false} assume !false; {4335#false} is VALID [2022-04-27 13:30:53,211 INFO L134 CoverageAnalysis]: Checked inductivity of 52 backedges. 10 proven. 26 refuted. 0 times theorem prover too weak. 16 trivial. 0 not checked. [2022-04-27 13:30:53,211 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-04-27 13:30:53,471 INFO L290 TraceCheckUtils]: 49: Hoare triple {4335#false} assume !false; {4335#false} is VALID [2022-04-27 13:30:53,471 INFO L290 TraceCheckUtils]: 48: Hoare triple {4335#false} assume 0 == ~cond; {4335#false} is VALID [2022-04-27 13:30:53,471 INFO L290 TraceCheckUtils]: 47: Hoare triple {4335#false} ~cond := #in~cond; {4335#false} is VALID [2022-04-27 13:30:53,471 INFO L272 TraceCheckUtils]: 46: Hoare triple {4335#false} call __VERIFIER_assert((if ~A~0 % 4294967296 == (~d~0 * ~q~0 + ~r~0) % 4294967296 then 1 else 0)); {4335#false} is VALID [2022-04-27 13:30:53,471 INFO L290 TraceCheckUtils]: 45: Hoare triple {4502#(< |main_#t~post7| 100)} assume !(#t~post7 < 100);havoc #t~post7; {4335#false} is VALID [2022-04-27 13:30:53,472 INFO L290 TraceCheckUtils]: 44: Hoare triple {4506#(< ~counter~0 100)} #t~post7 := ~counter~0;~counter~0 := 1 + #t~post7; {4502#(< |main_#t~post7| 100)} is VALID [2022-04-27 13:30:53,472 INFO L290 TraceCheckUtils]: 43: Hoare triple {4506#(< ~counter~0 100)} assume ~r~0 % 4294967296 >= ~d~0 % 4294967296;~r~0 := ~r~0 - ~d~0;~q~0 := ~q~0 + ~p~0; {4506#(< ~counter~0 100)} is VALID [2022-04-27 13:30:53,472 INFO L290 TraceCheckUtils]: 42: Hoare triple {4506#(< ~counter~0 100)} assume !!(1 != ~p~0 % 4294967296);~d~0 := (if ~d~0 % 4294967296 < 0 && 0 != ~d~0 % 4294967296 % 2 then 1 + ~d~0 % 4294967296 / 2 else ~d~0 % 4294967296 / 2);~p~0 := (if ~p~0 % 4294967296 < 0 && 0 != ~p~0 % 4294967296 % 2 then 1 + ~p~0 % 4294967296 / 2 else ~p~0 % 4294967296 / 2); {4506#(< ~counter~0 100)} is VALID [2022-04-27 13:30:53,473 INFO L284 TraceCheckUtils]: 41: Hoare quadruple {4334#true} {4506#(< ~counter~0 100)} #90#return; {4506#(< ~counter~0 100)} is VALID [2022-04-27 13:30:53,473 INFO L290 TraceCheckUtils]: 40: Hoare triple {4334#true} assume true; {4334#true} is VALID [2022-04-27 13:30:53,473 INFO L290 TraceCheckUtils]: 39: Hoare triple {4334#true} assume !(0 == ~cond); {4334#true} is VALID [2022-04-27 13:30:53,473 INFO L290 TraceCheckUtils]: 38: Hoare triple {4334#true} ~cond := #in~cond; {4334#true} is VALID [2022-04-27 13:30:53,473 INFO L272 TraceCheckUtils]: 37: Hoare triple {4506#(< ~counter~0 100)} call __VERIFIER_assert((if ~d~0 % 4294967296 == ~B~0 * ~p~0 % 4294967296 then 1 else 0)); {4334#true} is VALID [2022-04-27 13:30:53,474 INFO L284 TraceCheckUtils]: 36: Hoare quadruple {4334#true} {4506#(< ~counter~0 100)} #88#return; {4506#(< ~counter~0 100)} is VALID [2022-04-27 13:30:53,474 INFO L290 TraceCheckUtils]: 35: Hoare triple {4334#true} assume true; {4334#true} is VALID [2022-04-27 13:30:53,474 INFO L290 TraceCheckUtils]: 34: Hoare triple {4334#true} assume !(0 == ~cond); {4334#true} is VALID [2022-04-27 13:30:53,474 INFO L290 TraceCheckUtils]: 33: Hoare triple {4334#true} ~cond := #in~cond; {4334#true} is VALID [2022-04-27 13:30:53,474 INFO L272 TraceCheckUtils]: 32: Hoare triple {4506#(< ~counter~0 100)} call __VERIFIER_assert((if ~A~0 % 4294967296 == (~q~0 * ~B~0 + ~r~0) % 4294967296 then 1 else 0)); {4334#true} is VALID [2022-04-27 13:30:53,474 INFO L290 TraceCheckUtils]: 31: Hoare triple {4506#(< ~counter~0 100)} assume !!(#t~post7 < 100);havoc #t~post7; {4506#(< ~counter~0 100)} is VALID [2022-04-27 13:30:53,475 INFO L290 TraceCheckUtils]: 30: Hoare triple {4549#(< ~counter~0 99)} #t~post7 := ~counter~0;~counter~0 := 1 + #t~post7; {4506#(< ~counter~0 100)} is VALID [2022-04-27 13:30:53,475 INFO L290 TraceCheckUtils]: 29: Hoare triple {4549#(< ~counter~0 99)} assume !(~r~0 % 4294967296 >= ~d~0 % 4294967296); {4549#(< ~counter~0 99)} is VALID [2022-04-27 13:30:53,476 INFO L284 TraceCheckUtils]: 28: Hoare quadruple {4334#true} {4549#(< ~counter~0 99)} #86#return; {4549#(< ~counter~0 99)} is VALID [2022-04-27 13:30:53,476 INFO L290 TraceCheckUtils]: 27: Hoare triple {4334#true} assume true; {4334#true} is VALID [2022-04-27 13:30:53,476 INFO L290 TraceCheckUtils]: 26: Hoare triple {4334#true} assume !(0 == ~cond); {4334#true} is VALID [2022-04-27 13:30:53,476 INFO L290 TraceCheckUtils]: 25: Hoare triple {4334#true} ~cond := #in~cond; {4334#true} is VALID [2022-04-27 13:30:53,476 INFO L272 TraceCheckUtils]: 24: Hoare triple {4549#(< ~counter~0 99)} call __VERIFIER_assert((if ~d~0 % 4294967296 == ~B~0 * ~p~0 % 4294967296 then 1 else 0)); {4334#true} is VALID [2022-04-27 13:30:53,476 INFO L284 TraceCheckUtils]: 23: Hoare quadruple {4334#true} {4549#(< ~counter~0 99)} #84#return; {4549#(< ~counter~0 99)} is VALID [2022-04-27 13:30:53,476 INFO L290 TraceCheckUtils]: 22: Hoare triple {4334#true} assume true; {4334#true} is VALID [2022-04-27 13:30:53,476 INFO L290 TraceCheckUtils]: 21: Hoare triple {4334#true} assume !(0 == ~cond); {4334#true} is VALID [2022-04-27 13:30:53,476 INFO L290 TraceCheckUtils]: 20: Hoare triple {4334#true} ~cond := #in~cond; {4334#true} is VALID [2022-04-27 13:30:53,476 INFO L272 TraceCheckUtils]: 19: Hoare triple {4549#(< ~counter~0 99)} call __VERIFIER_assert((if ~r~0 % 4294967296 == ~A~0 % 4294967296 then 1 else 0)); {4334#true} is VALID [2022-04-27 13:30:53,477 INFO L284 TraceCheckUtils]: 18: Hoare quadruple {4334#true} {4549#(< ~counter~0 99)} #82#return; {4549#(< ~counter~0 99)} is VALID [2022-04-27 13:30:53,477 INFO L290 TraceCheckUtils]: 17: Hoare triple {4334#true} assume true; {4334#true} is VALID [2022-04-27 13:30:53,477 INFO L290 TraceCheckUtils]: 16: Hoare triple {4334#true} assume !(0 == ~cond); {4334#true} is VALID [2022-04-27 13:30:53,477 INFO L290 TraceCheckUtils]: 15: Hoare triple {4334#true} ~cond := #in~cond; {4334#true} is VALID [2022-04-27 13:30:53,477 INFO L272 TraceCheckUtils]: 14: Hoare triple {4549#(< ~counter~0 99)} call __VERIFIER_assert((if 0 == ~q~0 % 4294967296 then 1 else 0)); {4334#true} is VALID [2022-04-27 13:30:53,477 INFO L290 TraceCheckUtils]: 13: Hoare triple {4549#(< ~counter~0 99)} assume !!(#t~post6 < 100);havoc #t~post6; {4549#(< ~counter~0 99)} is VALID [2022-04-27 13:30:53,478 INFO L290 TraceCheckUtils]: 12: Hoare triple {4604#(< ~counter~0 98)} #t~post6 := ~counter~0;~counter~0 := 1 + #t~post6; {4549#(< ~counter~0 99)} is VALID [2022-04-27 13:30:53,478 INFO L290 TraceCheckUtils]: 11: Hoare triple {4604#(< ~counter~0 98)} ~r~0 := ~A~0;~d~0 := ~B~0;~p~0 := 1;~q~0 := 0; {4604#(< ~counter~0 98)} is VALID [2022-04-27 13:30:53,479 INFO L284 TraceCheckUtils]: 10: Hoare quadruple {4334#true} {4604#(< ~counter~0 98)} #80#return; {4604#(< ~counter~0 98)} is VALID [2022-04-27 13:30:53,479 INFO L290 TraceCheckUtils]: 9: Hoare triple {4334#true} assume true; {4334#true} is VALID [2022-04-27 13:30:53,479 INFO L290 TraceCheckUtils]: 8: Hoare triple {4334#true} assume !(0 == ~cond); {4334#true} is VALID [2022-04-27 13:30:53,479 INFO L290 TraceCheckUtils]: 7: Hoare triple {4334#true} ~cond := #in~cond; {4334#true} is VALID [2022-04-27 13:30:53,479 INFO L272 TraceCheckUtils]: 6: Hoare triple {4604#(< ~counter~0 98)} call assume_abort_if_not((if ~B~0 % 4294967296 >= 1 then 1 else 0)); {4334#true} is VALID [2022-04-27 13:30:53,479 INFO L290 TraceCheckUtils]: 5: Hoare triple {4604#(< ~counter~0 98)} havoc ~A~0;havoc ~B~0;havoc ~r~0;havoc ~d~0;havoc ~p~0;havoc ~q~0;~A~0 := #t~nondet4;havoc #t~nondet4;~B~0 := #t~nondet5;havoc #t~nondet5; {4604#(< ~counter~0 98)} is VALID [2022-04-27 13:30:53,480 INFO L272 TraceCheckUtils]: 4: Hoare triple {4604#(< ~counter~0 98)} call #t~ret8 := main(); {4604#(< ~counter~0 98)} is VALID [2022-04-27 13:30:53,480 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {4604#(< ~counter~0 98)} {4334#true} #96#return; {4604#(< ~counter~0 98)} is VALID [2022-04-27 13:30:53,480 INFO L290 TraceCheckUtils]: 2: Hoare triple {4604#(< ~counter~0 98)} assume true; {4604#(< ~counter~0 98)} is VALID [2022-04-27 13:30:53,481 INFO L290 TraceCheckUtils]: 1: Hoare triple {4334#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);call #Ultimate.allocInit(12, 3);~counter~0 := 0; {4604#(< ~counter~0 98)} is VALID [2022-04-27 13:30:53,481 INFO L272 TraceCheckUtils]: 0: Hoare triple {4334#true} call ULTIMATE.init(); {4334#true} is VALID [2022-04-27 13:30:53,481 INFO L134 CoverageAnalysis]: Checked inductivity of 52 backedges. 10 proven. 2 refuted. 0 times theorem prover too weak. 40 trivial. 0 not checked. [2022-04-27 13:30:53,481 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-27 13:30:53,481 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [734678765] [2022-04-27 13:30:53,481 WARN L310 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2022-04-27 13:30:53,481 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [157166457] [2022-04-27 13:30:53,481 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [157166457] provided 0 perfect and 2 imperfect interpolant sequences [2022-04-27 13:30:53,481 INFO L184 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2022-04-27 13:30:53,482 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [6, 6] total 10 [2022-04-27 13:30:53,482 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1112852950] [2022-04-27 13:30:53,482 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2022-04-27 13:30:53,482 INFO L78 Accepts]: Start accepts. Automaton has has 10 states, 10 states have (on average 4.4) internal successors, (44), 10 states have internal predecessors, (44), 8 states have call successors, (16), 6 states have call predecessors, (16), 5 states have return successors, (14), 6 states have call predecessors, (14), 7 states have call successors, (14) Word has length 50 [2022-04-27 13:30:53,482 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-27 13:30:53,483 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with has 10 states, 10 states have (on average 4.4) internal successors, (44), 10 states have internal predecessors, (44), 8 states have call successors, (16), 6 states have call predecessors, (16), 5 states have return successors, (14), 6 states have call predecessors, (14), 7 states have call successors, (14) [2022-04-27 13:30:53,542 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 74 edges. 74 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-27 13:30:53,543 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2022-04-27 13:30:53,543 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-04-27 13:30:53,543 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2022-04-27 13:30:53,543 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=33, Invalid=57, Unknown=0, NotChecked=0, Total=90 [2022-04-27 13:30:53,543 INFO L87 Difference]: Start difference. First operand 154 states and 185 transitions. Second operand has 10 states, 10 states have (on average 4.4) internal successors, (44), 10 states have internal predecessors, (44), 8 states have call successors, (16), 6 states have call predecessors, (16), 5 states have return successors, (14), 6 states have call predecessors, (14), 7 states have call successors, (14) [2022-04-27 13:30:56,408 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-27 13:30:56,408 INFO L93 Difference]: Finished difference Result 281 states and 346 transitions. [2022-04-27 13:30:56,408 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2022-04-27 13:30:56,409 INFO L78 Accepts]: Start accepts. Automaton has has 10 states, 10 states have (on average 4.4) internal successors, (44), 10 states have internal predecessors, (44), 8 states have call successors, (16), 6 states have call predecessors, (16), 5 states have return successors, (14), 6 states have call predecessors, (14), 7 states have call successors, (14) Word has length 50 [2022-04-27 13:30:56,409 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-27 13:30:56,409 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 10 states, 10 states have (on average 4.4) internal successors, (44), 10 states have internal predecessors, (44), 8 states have call successors, (16), 6 states have call predecessors, (16), 5 states have return successors, (14), 6 states have call predecessors, (14), 7 states have call successors, (14) [2022-04-27 13:30:56,411 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 13 states to 13 states and 177 transitions. [2022-04-27 13:30:56,411 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 10 states, 10 states have (on average 4.4) internal successors, (44), 10 states have internal predecessors, (44), 8 states have call successors, (16), 6 states have call predecessors, (16), 5 states have return successors, (14), 6 states have call predecessors, (14), 7 states have call successors, (14) [2022-04-27 13:30:56,413 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 13 states to 13 states and 177 transitions. [2022-04-27 13:30:56,413 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 13 states and 177 transitions. [2022-04-27 13:30:56,577 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 177 edges. 177 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-27 13:30:56,582 INFO L225 Difference]: With dead ends: 281 [2022-04-27 13:30:56,582 INFO L226 Difference]: Without dead ends: 257 [2022-04-27 13:30:56,582 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 103 GetRequests, 91 SyntacticMatches, 0 SemanticMatches, 12 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 14 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=63, Invalid=119, Unknown=0, NotChecked=0, Total=182 [2022-04-27 13:30:56,583 INFO L413 NwaCegarLoop]: 68 mSDtfsCounter, 153 mSDsluCounter, 160 mSDsCounter, 0 mSdLazyCounter, 132 mSolverCounterSat, 104 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 153 SdHoareTripleChecker+Valid, 228 SdHoareTripleChecker+Invalid, 236 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 104 IncrementalHoareTripleChecker+Valid, 132 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.5s IncrementalHoareTripleChecker+Time [2022-04-27 13:30:56,583 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [153 Valid, 228 Invalid, 236 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [104 Valid, 132 Invalid, 0 Unknown, 0 Unchecked, 1.5s Time] [2022-04-27 13:30:56,583 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 257 states. [2022-04-27 13:30:56,672 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 257 to 250. [2022-04-27 13:30:56,672 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-27 13:30:56,673 INFO L82 GeneralOperation]: Start isEquivalent. First operand 257 states. Second operand has 250 states, 160 states have (on average 1.2) internal successors, (192), 172 states have internal predecessors, (192), 59 states have call successors, (59), 31 states have call predecessors, (59), 30 states have return successors, (54), 46 states have call predecessors, (54), 54 states have call successors, (54) [2022-04-27 13:30:56,673 INFO L74 IsIncluded]: Start isIncluded. First operand 257 states. Second operand has 250 states, 160 states have (on average 1.2) internal successors, (192), 172 states have internal predecessors, (192), 59 states have call successors, (59), 31 states have call predecessors, (59), 30 states have return successors, (54), 46 states have call predecessors, (54), 54 states have call successors, (54) [2022-04-27 13:30:56,673 INFO L87 Difference]: Start difference. First operand 257 states. Second operand has 250 states, 160 states have (on average 1.2) internal successors, (192), 172 states have internal predecessors, (192), 59 states have call successors, (59), 31 states have call predecessors, (59), 30 states have return successors, (54), 46 states have call predecessors, (54), 54 states have call successors, (54) [2022-04-27 13:30:56,678 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-27 13:30:56,678 INFO L93 Difference]: Finished difference Result 257 states and 309 transitions. [2022-04-27 13:30:56,678 INFO L276 IsEmpty]: Start isEmpty. Operand 257 states and 309 transitions. [2022-04-27 13:30:56,679 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-27 13:30:56,679 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-27 13:30:56,680 INFO L74 IsIncluded]: Start isIncluded. First operand has 250 states, 160 states have (on average 1.2) internal successors, (192), 172 states have internal predecessors, (192), 59 states have call successors, (59), 31 states have call predecessors, (59), 30 states have return successors, (54), 46 states have call predecessors, (54), 54 states have call successors, (54) Second operand 257 states. [2022-04-27 13:30:56,680 INFO L87 Difference]: Start difference. First operand has 250 states, 160 states have (on average 1.2) internal successors, (192), 172 states have internal predecessors, (192), 59 states have call successors, (59), 31 states have call predecessors, (59), 30 states have return successors, (54), 46 states have call predecessors, (54), 54 states have call successors, (54) Second operand 257 states. [2022-04-27 13:30:56,685 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-27 13:30:56,685 INFO L93 Difference]: Finished difference Result 257 states and 309 transitions. [2022-04-27 13:30:56,685 INFO L276 IsEmpty]: Start isEmpty. Operand 257 states and 309 transitions. [2022-04-27 13:30:56,686 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-27 13:30:56,686 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-27 13:30:56,686 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-27 13:30:56,686 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-27 13:30:56,686 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 250 states, 160 states have (on average 1.2) internal successors, (192), 172 states have internal predecessors, (192), 59 states have call successors, (59), 31 states have call predecessors, (59), 30 states have return successors, (54), 46 states have call predecessors, (54), 54 states have call successors, (54) [2022-04-27 13:30:56,691 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 250 states to 250 states and 305 transitions. [2022-04-27 13:30:56,691 INFO L78 Accepts]: Start accepts. Automaton has 250 states and 305 transitions. Word has length 50 [2022-04-27 13:30:56,691 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-27 13:30:56,691 INFO L495 AbstractCegarLoop]: Abstraction has 250 states and 305 transitions. [2022-04-27 13:30:56,692 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 10 states have (on average 4.4) internal successors, (44), 10 states have internal predecessors, (44), 8 states have call successors, (16), 6 states have call predecessors, (16), 5 states have return successors, (14), 6 states have call predecessors, (14), 7 states have call successors, (14) [2022-04-27 13:30:56,692 INFO L276 IsEmpty]: Start isEmpty. Operand 250 states and 305 transitions. [2022-04-27 13:30:56,692 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 51 [2022-04-27 13:30:56,692 INFO L187 NwaCegarLoop]: Found error trace [2022-04-27 13:30:56,692 INFO L195 NwaCegarLoop]: trace histogram [6, 5, 5, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-27 13:30:56,711 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (8)] Forceful destruction successful, exit code 0 [2022-04-27 13:30:56,907 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9,8 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-27 13:30:56,907 INFO L420 AbstractCegarLoop]: === Iteration 11 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-27 13:30:56,908 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-27 13:30:56,908 INFO L85 PathProgramCache]: Analyzing trace with hash -397308229, now seen corresponding path program 1 times [2022-04-27 13:30:56,908 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-27 13:30:56,908 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [387408994] [2022-04-27 13:30:56,908 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-27 13:30:56,908 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-27 13:30:56,917 ERROR L245 FreeRefinementEngine]: Caught known exception: Unsupported non-linear arithmetic [2022-04-27 13:30:56,917 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [1698113776] [2022-04-27 13:30:56,917 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-27 13:30:56,917 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-27 13:30:56,917 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-04-27 13:30:56,918 INFO L229 MonitoredProcess]: Starting monitored process 9 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-04-27 13:30:56,919 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (9)] Waiting until timeout for monitored process