/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_unwindbound1.c -------------------------------------------------------------------------------- This is Ultimate 0.2.2-dev-e106359-m [2022-04-14 16:27:25,875 INFO L177 SettingsManager]: Resetting all preferences to default values... [2022-04-14 16:27:25,876 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2022-04-14 16:27:25,909 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2022-04-14 16:27:25,909 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2022-04-14 16:27:25,910 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2022-04-14 16:27:25,913 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2022-04-14 16:27:25,917 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2022-04-14 16:27:25,918 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2022-04-14 16:27:25,921 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2022-04-14 16:27:25,921 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2022-04-14 16:27:25,923 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2022-04-14 16:27:25,923 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2022-04-14 16:27:25,924 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2022-04-14 16:27:25,925 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2022-04-14 16:27:25,927 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2022-04-14 16:27:25,928 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2022-04-14 16:27:25,928 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2022-04-14 16:27:25,930 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2022-04-14 16:27:25,932 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2022-04-14 16:27:25,932 INFO L181 SettingsManager]: Resetting HornVerifier preferences to default values [2022-04-14 16:27:25,933 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2022-04-14 16:27:25,934 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2022-04-14 16:27:25,934 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2022-04-14 16:27:25,935 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2022-04-14 16:27:25,940 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2022-04-14 16:27:25,941 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2022-04-14 16:27:25,941 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2022-04-14 16:27:25,941 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2022-04-14 16:27:25,942 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2022-04-14 16:27:25,943 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2022-04-14 16:27:25,943 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2022-04-14 16:27:25,944 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2022-04-14 16:27:25,944 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2022-04-14 16:27:25,944 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2022-04-14 16:27:25,945 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2022-04-14 16:27:25,945 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2022-04-14 16:27:25,945 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2022-04-14 16:27:25,946 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2022-04-14 16:27:25,946 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2022-04-14 16:27:25,946 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2022-04-14 16:27:25,947 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2022-04-14 16:27:25,948 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-14 16:27:25,972 INFO L113 SettingsManager]: Loading preferences was successful [2022-04-14 16:27:25,973 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2022-04-14 16:27:25,973 INFO L136 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2022-04-14 16:27:25,973 INFO L138 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2022-04-14 16:27:25,973 INFO L136 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2022-04-14 16:27:25,973 INFO L138 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2022-04-14 16:27:25,974 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2022-04-14 16:27:25,974 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2022-04-14 16:27:25,974 INFO L138 SettingsManager]: * Use SBE=true [2022-04-14 16:27:25,974 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2022-04-14 16:27:25,975 INFO L138 SettingsManager]: * sizeof long=4 [2022-04-14 16:27:25,975 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2022-04-14 16:27:25,975 INFO L138 SettingsManager]: * sizeof POINTER=4 [2022-04-14 16:27:25,975 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2022-04-14 16:27:25,975 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2022-04-14 16:27:25,975 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2022-04-14 16:27:25,975 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2022-04-14 16:27:25,976 INFO L138 SettingsManager]: * sizeof long double=12 [2022-04-14 16:27:25,976 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2022-04-14 16:27:25,976 INFO L138 SettingsManager]: * Use constant arrays=true [2022-04-14 16:27:25,976 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2022-04-14 16:27:25,976 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2022-04-14 16:27:25,976 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2022-04-14 16:27:25,976 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2022-04-14 16:27:25,976 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-04-14 16:27:25,976 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2022-04-14 16:27:25,977 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2022-04-14 16:27:25,977 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2022-04-14 16:27:25,977 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2022-04-14 16:27:25,977 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2022-04-14 16:27:25,977 INFO L138 SettingsManager]: * Large block encoding in concurrent analysis=OFF [2022-04-14 16:27:25,977 INFO L138 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2022-04-14 16:27:25,977 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2022-04-14 16:27:25,977 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-14 16:27:26,152 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2022-04-14 16:27:26,168 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2022-04-14 16:27:26,169 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2022-04-14 16:27:26,170 INFO L271 PluginConnector]: Initializing CDTParser... [2022-04-14 16:27:26,170 INFO L275 PluginConnector]: CDTParser initialized [2022-04-14 16:27:26,171 INFO L432 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/nla-digbench-scaling/hard-u_unwindbound1.c [2022-04-14 16:27:26,205 INFO L220 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/8825b6679/a54dc3ec1e2747b5b8ccc2e50c1e3df2/FLAG0f0a033bd [2022-04-14 16:27:26,578 INFO L306 CDTParser]: Found 1 translation units. [2022-04-14 16:27:26,578 INFO L160 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/nla-digbench-scaling/hard-u_unwindbound1.c [2022-04-14 16:27:26,585 INFO L349 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/8825b6679/a54dc3ec1e2747b5b8ccc2e50c1e3df2/FLAG0f0a033bd [2022-04-14 16:27:26,596 INFO L357 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/8825b6679/a54dc3ec1e2747b5b8ccc2e50c1e3df2 [2022-04-14 16:27:26,598 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2022-04-14 16:27:26,598 INFO L131 ToolchainWalker]: Walking toolchain with 4 elements. [2022-04-14 16:27:26,600 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2022-04-14 16:27:26,601 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2022-04-14 16:27:26,603 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2022-04-14 16:27:26,605 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 14.04 04:27:26" (1/1) ... [2022-04-14 16:27:26,606 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@37ac211b and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.04 04:27:26, skipping insertion in model container [2022-04-14 16:27:26,606 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 14.04 04:27:26" (1/1) ... [2022-04-14 16:27:26,610 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2022-04-14 16:27:26,621 INFO L178 MainTranslator]: Built tables and reachable declarations [2022-04-14 16:27:26,763 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_unwindbound1.c[537,550] [2022-04-14 16:27:26,790 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-04-14 16:27:26,801 INFO L203 MainTranslator]: Completed pre-run [2022-04-14 16:27:26,811 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_unwindbound1.c[537,550] [2022-04-14 16:27:26,823 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-04-14 16:27:26,833 INFO L208 MainTranslator]: Completed translation [2022-04-14 16:27:26,834 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.04 04:27:26 WrapperNode [2022-04-14 16:27:26,834 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2022-04-14 16:27:26,835 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2022-04-14 16:27:26,835 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2022-04-14 16:27:26,835 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2022-04-14 16:27:26,842 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.04 04:27:26" (1/1) ... [2022-04-14 16:27:26,842 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.04 04:27:26" (1/1) ... [2022-04-14 16:27:26,851 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.04 04:27:26" (1/1) ... [2022-04-14 16:27:26,851 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.04 04:27:26" (1/1) ... [2022-04-14 16:27:26,862 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.04 04:27:26" (1/1) ... [2022-04-14 16:27:26,867 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.04 04:27:26" (1/1) ... [2022-04-14 16:27:26,872 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.04 04:27:26" (1/1) ... [2022-04-14 16:27:26,873 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2022-04-14 16:27:26,874 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2022-04-14 16:27:26,874 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2022-04-14 16:27:26,874 INFO L275 PluginConnector]: RCFGBuilder initialized [2022-04-14 16:27:26,875 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.04 04:27:26" (1/1) ... [2022-04-14 16:27:26,879 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-04-14 16:27:26,886 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-04-14 16:27:26,895 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-14 16:27:26,902 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-14 16:27:26,935 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.init [2022-04-14 16:27:26,935 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2022-04-14 16:27:26,935 INFO L138 BoogieDeclarations]: Found implementation of procedure reach_error [2022-04-14 16:27:26,936 INFO L138 BoogieDeclarations]: Found implementation of procedure assume_abort_if_not [2022-04-14 16:27:26,936 INFO L138 BoogieDeclarations]: Found implementation of procedure __VERIFIER_assert [2022-04-14 16:27:26,936 INFO L138 BoogieDeclarations]: Found implementation of procedure main [2022-04-14 16:27:26,936 INFO L130 BoogieDeclarations]: Found specification of procedure abort [2022-04-14 16:27:26,936 INFO L130 BoogieDeclarations]: Found specification of procedure __assert_fail [2022-04-14 16:27:26,936 INFO L130 BoogieDeclarations]: Found specification of procedure reach_error [2022-04-14 16:27:26,936 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2022-04-14 16:27:26,936 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_nondet_uint [2022-04-14 16:27:26,936 INFO L130 BoogieDeclarations]: Found specification of procedure assume_abort_if_not [2022-04-14 16:27:26,936 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_assert [2022-04-14 16:27:26,936 INFO L130 BoogieDeclarations]: Found specification of procedure main [2022-04-14 16:27:26,936 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.init [2022-04-14 16:27:26,936 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2022-04-14 16:27:26,936 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2022-04-14 16:27:26,937 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2022-04-14 16:27:26,937 INFO L130 BoogieDeclarations]: Found specification of procedure read~int [2022-04-14 16:27:26,937 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2022-04-14 16:27:26,978 INFO L234 CfgBuilder]: Building ICFG [2022-04-14 16:27:26,979 INFO L260 CfgBuilder]: Building CFG for each procedure with an implementation [2022-04-14 16:27:27,152 INFO L275 CfgBuilder]: Performing block encoding [2022-04-14 16:27:27,156 INFO L294 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2022-04-14 16:27:27,156 INFO L299 CfgBuilder]: Removed 2 assume(true) statements. [2022-04-14 16:27:27,158 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 14.04 04:27:27 BoogieIcfgContainer [2022-04-14 16:27:27,158 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2022-04-14 16:27:27,159 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2022-04-14 16:27:27,159 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2022-04-14 16:27:27,172 INFO L275 PluginConnector]: TraceAbstraction initialized [2022-04-14 16:27:27,172 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 14.04 04:27:26" (1/3) ... [2022-04-14 16:27:27,173 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@1a1b1507 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 14.04 04:27:27, skipping insertion in model container [2022-04-14 16:27:27,173 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.04 04:27:26" (2/3) ... [2022-04-14 16:27:27,173 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@1a1b1507 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 14.04 04:27:27, skipping insertion in model container [2022-04-14 16:27:27,173 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 14.04 04:27:27" (3/3) ... [2022-04-14 16:27:27,174 INFO L111 eAbstractionObserver]: Analyzing ICFG hard-u_unwindbound1.c [2022-04-14 16:27:27,185 INFO L202 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2022-04-14 16:27:27,185 INFO L161 ceAbstractionStarter]: Applying trace abstraction to program that has 1 error locations. [2022-04-14 16:27:27,224 INFO L339 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2022-04-14 16:27:27,229 INFO L340 AbstractCegarLoop]: Settings: SEPARATE_VIOLATION_CHECK=true, mInterprocedural=true, mMaxIterations=1000000, mWatchIteration=1000000, mArtifact=RCFG, mInterpolation=FPandBP, mInterpolantAutomaton=STRAIGHT_LINE, mDumpAutomata=false, mAutomataFormat=ATS_NUMERATE, mDumpPath=., mDeterminiation=PREDICATE_ABSTRACTION, mMinimize=MINIMIZE_SEVPA, mHoare=true, mAutomataTypeConcurrency=PETRI_NET, mHoareTripleChecks=INCREMENTAL, mHoareAnnotationPositions=LoopsAndPotentialCycles, mDumpOnlyReuseAutomata=false, mLimitTraceHistogram=0, mErrorLocTimeLimit=0, mLimitPathProgramCount=0, mCollectInterpolantStatistics=true, mHeuristicEmptinessCheck=false, mHeuristicEmptinessCheckAStarHeuristic=ZERO, mHeuristicEmptinessCheckAStarHeuristicRandomSeed=1337, mHeuristicEmptinessCheckSmtFeatureScoringMethod=DAGSIZE, mSMTFeatureExtraction=false, mSMTFeatureExtractionDumpPath=., mOverrideInterpolantAutomaton=false, mMcrInterpolantMethod=WP [2022-04-14 16:27:27,229 INFO L341 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2022-04-14 16:27:27,250 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-14 16:27:27,253 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 19 [2022-04-14 16:27:27,253 INFO L491 BasicCegarLoop]: Found error trace [2022-04-14 16:27:27,254 INFO L499 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-14 16:27:27,254 INFO L403 AbstractCegarLoop]: === Iteration 1 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-14 16:27:27,257 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-14 16:27:27,258 INFO L85 PathProgramCache]: Analyzing trace with hash 1191571617, now seen corresponding path program 1 times [2022-04-14 16:27:27,264 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-14 16:27:27,264 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [515086756] [2022-04-14 16:27:27,265 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-14 16:27:27,265 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-14 16:27:27,345 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-14 16:27:27,407 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-04-14 16:27:27,414 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-14 16:27:27,434 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-14 16:27:27,434 INFO L290 TraceCheckUtils]: 1: Hoare triple {40#true} assume true; {40#true} is VALID [2022-04-14 16:27:27,434 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {40#true} {40#true} #96#return; {40#true} is VALID [2022-04-14 16:27:27,435 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2022-04-14 16:27:27,440 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-14 16:27:27,448 INFO L290 TraceCheckUtils]: 0: Hoare triple {40#true} ~cond := #in~cond; {40#true} is VALID [2022-04-14 16:27:27,449 INFO L290 TraceCheckUtils]: 1: Hoare triple {40#true} assume 0 == ~cond;assume false; {41#false} is VALID [2022-04-14 16:27:27,450 INFO L290 TraceCheckUtils]: 2: Hoare triple {41#false} assume true; {41#false} is VALID [2022-04-14 16:27:27,450 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {41#false} {40#true} #80#return; {41#false} is VALID [2022-04-14 16:27:27,451 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-14 16:27:27,451 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-14 16:27:27,451 INFO L290 TraceCheckUtils]: 2: Hoare triple {40#true} assume true; {40#true} is VALID [2022-04-14 16:27:27,452 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {40#true} {40#true} #96#return; {40#true} is VALID [2022-04-14 16:27:27,452 INFO L272 TraceCheckUtils]: 4: Hoare triple {40#true} call #t~ret8 := main(); {40#true} is VALID [2022-04-14 16:27:27,452 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-14 16:27:27,453 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-14 16:27:27,453 INFO L290 TraceCheckUtils]: 7: Hoare triple {40#true} ~cond := #in~cond; {40#true} is VALID [2022-04-14 16:27:27,453 INFO L290 TraceCheckUtils]: 8: Hoare triple {40#true} assume 0 == ~cond;assume false; {41#false} is VALID [2022-04-14 16:27:27,453 INFO L290 TraceCheckUtils]: 9: Hoare triple {41#false} assume true; {41#false} is VALID [2022-04-14 16:27:27,454 INFO L284 TraceCheckUtils]: 10: Hoare quadruple {41#false} {40#true} #80#return; {41#false} is VALID [2022-04-14 16:27:27,454 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-14 16:27:27,454 INFO L290 TraceCheckUtils]: 12: Hoare triple {41#false} assume !true; {41#false} is VALID [2022-04-14 16:27:27,454 INFO L290 TraceCheckUtils]: 13: Hoare triple {41#false} assume !true; {41#false} is VALID [2022-04-14 16:27:27,455 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-14 16:27:27,455 INFO L290 TraceCheckUtils]: 15: Hoare triple {41#false} ~cond := #in~cond; {41#false} is VALID [2022-04-14 16:27:27,456 INFO L290 TraceCheckUtils]: 16: Hoare triple {41#false} assume 0 == ~cond; {41#false} is VALID [2022-04-14 16:27:27,456 INFO L290 TraceCheckUtils]: 17: Hoare triple {41#false} assume !false; {41#false} is VALID [2022-04-14 16:27:27,456 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-14 16:27:27,457 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-14 16:27:27,457 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [515086756] [2022-04-14 16:27:27,457 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [515086756] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-14 16:27:27,457 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-14 16:27:27,457 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-04-14 16:27:27,458 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [805122656] [2022-04-14 16:27:27,459 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-14 16:27:27,462 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-14 16:27:27,464 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-14 16:27:27,466 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-14 16:27:27,489 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-14 16:27:27,489 INFO L554 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-04-14 16:27:27,489 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-04-14 16:27:27,501 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-04-14 16:27:27,502 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-04-14 16:27:27,505 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-14 16:27:27,684 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-14 16:27:27,684 INFO L93 Difference]: Finished difference Result 66 states and 101 transitions. [2022-04-14 16:27:27,684 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-04-14 16:27:27,684 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-14 16:27:27,684 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-14 16:27:27,685 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-14 16:27:27,695 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 101 transitions. [2022-04-14 16:27:27,695 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-14 16:27:27,699 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 101 transitions. [2022-04-14 16:27:27,699 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 3 states and 101 transitions. [2022-04-14 16:27:27,800 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-14 16:27:27,806 INFO L225 Difference]: With dead ends: 66 [2022-04-14 16:27:27,806 INFO L226 Difference]: Without dead ends: 33 [2022-04-14 16:27:27,808 INFO L912 BasicCegarLoop]: 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-14 16:27:27,810 INFO L913 BasicCegarLoop]: 45 mSDtfsCounter, 10 mSDsluCounter, 4 mSDsCounter, 0 mSdLazyCounter, 24 mSolverCounterSat, 9 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s 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.0s IncrementalHoareTripleChecker+Time [2022-04-14 16:27:27,811 INFO L914 BasicCegarLoop]: SdHoareTripleChecker [11 Valid, 49 Invalid, 33 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [9 Valid, 24 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-04-14 16:27:27,821 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 33 states. [2022-04-14 16:27:27,846 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 33 to 32. [2022-04-14 16:27:27,846 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-14 16:27:27,848 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-14 16:27:27,849 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-14 16:27:27,865 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-14 16:27:27,869 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-14 16:27:27,869 INFO L93 Difference]: Finished difference Result 33 states and 43 transitions. [2022-04-14 16:27:27,869 INFO L276 IsEmpty]: Start isEmpty. Operand 33 states and 43 transitions. [2022-04-14 16:27:27,870 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-14 16:27:27,870 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-14 16:27:27,870 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-14 16:27:27,871 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-14 16:27:27,874 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-14 16:27:27,874 INFO L93 Difference]: Finished difference Result 33 states and 43 transitions. [2022-04-14 16:27:27,874 INFO L276 IsEmpty]: Start isEmpty. Operand 33 states and 43 transitions. [2022-04-14 16:27:27,874 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-14 16:27:27,875 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-14 16:27:27,875 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-14 16:27:27,875 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-14 16:27:27,875 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-14 16:27:27,877 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 32 states to 32 states and 42 transitions. [2022-04-14 16:27:27,878 INFO L78 Accepts]: Start accepts. Automaton has 32 states and 42 transitions. Word has length 18 [2022-04-14 16:27:27,878 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-14 16:27:27,878 INFO L478 AbstractCegarLoop]: Abstraction has 32 states and 42 transitions. [2022-04-14 16:27:27,879 INFO L479 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 4.0) internal successors, (12), 2 states have internal predecessors, (12), 2 states have call successors, (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-14 16:27:27,879 INFO L276 IsEmpty]: Start isEmpty. Operand 32 states and 42 transitions. [2022-04-14 16:27:27,882 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 19 [2022-04-14 16:27:27,882 INFO L491 BasicCegarLoop]: Found error trace [2022-04-14 16:27:27,882 INFO L499 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-14 16:27:27,882 WARN L460 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2022-04-14 16:27:27,882 INFO L403 AbstractCegarLoop]: === Iteration 2 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-14 16:27:27,883 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-14 16:27:27,883 INFO L85 PathProgramCache]: Analyzing trace with hash 336486197, now seen corresponding path program 1 times [2022-04-14 16:27:27,883 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-14 16:27:27,883 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1121364558] [2022-04-14 16:27:27,883 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-14 16:27:27,883 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-14 16:27:27,904 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-14 16:27:27,947 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-04-14 16:27:27,949 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-14 16:27:27,954 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-14 16:27:27,954 INFO L290 TraceCheckUtils]: 1: Hoare triple {256#true} assume true; {256#true} is VALID [2022-04-14 16:27:27,954 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {256#true} {256#true} #96#return; {256#true} is VALID [2022-04-14 16:27:27,954 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2022-04-14 16:27:27,955 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-14 16:27:27,958 INFO L290 TraceCheckUtils]: 0: Hoare triple {256#true} ~cond := #in~cond; {256#true} is VALID [2022-04-14 16:27:27,959 INFO L290 TraceCheckUtils]: 1: Hoare triple {256#true} assume !(0 == ~cond); {256#true} is VALID [2022-04-14 16:27:27,959 INFO L290 TraceCheckUtils]: 2: Hoare triple {256#true} assume true; {256#true} is VALID [2022-04-14 16:27:27,959 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {256#true} {256#true} #80#return; {256#true} is VALID [2022-04-14 16:27:27,959 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-14 16:27:27,960 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-14 16:27:27,960 INFO L290 TraceCheckUtils]: 2: Hoare triple {256#true} assume true; {256#true} is VALID [2022-04-14 16:27:27,960 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {256#true} {256#true} #96#return; {256#true} is VALID [2022-04-14 16:27:27,960 INFO L272 TraceCheckUtils]: 4: Hoare triple {256#true} call #t~ret8 := main(); {256#true} is VALID [2022-04-14 16:27:27,960 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-14 16:27:27,960 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-14 16:27:27,960 INFO L290 TraceCheckUtils]: 7: Hoare triple {256#true} ~cond := #in~cond; {256#true} is VALID [2022-04-14 16:27:27,961 INFO L290 TraceCheckUtils]: 8: Hoare triple {256#true} assume !(0 == ~cond); {256#true} is VALID [2022-04-14 16:27:27,961 INFO L290 TraceCheckUtils]: 9: Hoare triple {256#true} assume true; {256#true} is VALID [2022-04-14 16:27:27,961 INFO L284 TraceCheckUtils]: 10: Hoare quadruple {256#true} {256#true} #80#return; {256#true} is VALID [2022-04-14 16:27:27,961 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-14 16:27:27,962 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-14 16:27:27,962 INFO L290 TraceCheckUtils]: 13: Hoare triple {265#(= main_~q~0 0)} assume !!(#t~post6 < 1);havoc #t~post6; {265#(= main_~q~0 0)} is VALID [2022-04-14 16:27:27,963 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-14 16:27:27,963 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-14 16:27:27,963 INFO L290 TraceCheckUtils]: 16: Hoare triple {267#(not (= __VERIFIER_assert_~cond 0))} assume 0 == ~cond; {257#false} is VALID [2022-04-14 16:27:27,963 INFO L290 TraceCheckUtils]: 17: Hoare triple {257#false} assume !false; {257#false} is VALID [2022-04-14 16:27:27,964 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-14 16:27:27,964 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-14 16:27:27,964 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1121364558] [2022-04-14 16:27:27,964 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1121364558] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-14 16:27:27,964 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-14 16:27:27,964 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2022-04-14 16:27:27,964 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1095648693] [2022-04-14 16:27:27,965 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-14 16:27:27,965 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-14 16:27:27,966 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-14 16:27:27,966 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-14 16:27:27,977 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-14 16:27:27,977 INFO L554 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2022-04-14 16:27:27,977 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-04-14 16:27:27,978 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2022-04-14 16:27:27,978 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2022-04-14 16:27:27,978 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-14 16:27:28,274 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-14 16:27:28,274 INFO L93 Difference]: Finished difference Result 47 states and 62 transitions. [2022-04-14 16:27:28,274 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2022-04-14 16:27:28,274 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-14 16:27:28,275 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-14 16:27:28,275 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-14 16:27:28,277 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8 states to 8 states and 62 transitions. [2022-04-14 16:27:28,277 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-14 16:27:28,279 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8 states to 8 states and 62 transitions. [2022-04-14 16:27:28,279 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 8 states and 62 transitions. [2022-04-14 16:27:28,329 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-14 16:27:28,331 INFO L225 Difference]: With dead ends: 47 [2022-04-14 16:27:28,331 INFO L226 Difference]: Without dead ends: 45 [2022-04-14 16:27:28,332 INFO L912 BasicCegarLoop]: 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-14 16:27:28,333 INFO L913 BasicCegarLoop]: 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-14 16:27:28,333 INFO L914 BasicCegarLoop]: 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-14 16:27:28,334 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 45 states. [2022-04-14 16:27:28,337 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 45 to 36. [2022-04-14 16:27:28,338 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-14 16:27:28,338 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-14 16:27:28,338 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-14 16:27:28,339 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-14 16:27:28,341 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-14 16:27:28,341 INFO L93 Difference]: Finished difference Result 45 states and 60 transitions. [2022-04-14 16:27:28,341 INFO L276 IsEmpty]: Start isEmpty. Operand 45 states and 60 transitions. [2022-04-14 16:27:28,342 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-14 16:27:28,342 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-14 16:27:28,342 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-14 16:27:28,343 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-14 16:27:28,345 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-14 16:27:28,345 INFO L93 Difference]: Finished difference Result 45 states and 60 transitions. [2022-04-14 16:27:28,345 INFO L276 IsEmpty]: Start isEmpty. Operand 45 states and 60 transitions. [2022-04-14 16:27:28,346 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-14 16:27:28,346 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-14 16:27:28,346 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-14 16:27:28,346 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-14 16:27:28,346 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-14 16:27:28,348 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 36 states to 36 states and 45 transitions. [2022-04-14 16:27:28,348 INFO L78 Accepts]: Start accepts. Automaton has 36 states and 45 transitions. Word has length 18 [2022-04-14 16:27:28,348 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-14 16:27:28,348 INFO L478 AbstractCegarLoop]: Abstraction has 36 states and 45 transitions. [2022-04-14 16:27:28,349 INFO L479 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-14 16:27:28,349 INFO L276 IsEmpty]: Start isEmpty. Operand 36 states and 45 transitions. [2022-04-14 16:27:28,349 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 21 [2022-04-14 16:27:28,349 INFO L491 BasicCegarLoop]: Found error trace [2022-04-14 16:27:28,349 INFO L499 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-14 16:27:28,349 WARN L460 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2022-04-14 16:27:28,350 INFO L403 AbstractCegarLoop]: === Iteration 3 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-14 16:27:28,350 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-14 16:27:28,350 INFO L85 PathProgramCache]: Analyzing trace with hash -1819267188, now seen corresponding path program 1 times [2022-04-14 16:27:28,350 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-14 16:27:28,350 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1499876256] [2022-04-14 16:27:28,350 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-14 16:27:28,350 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-14 16:27:28,377 ERROR L245 FreeRefinementEngine]: Caught known exception: Unsupported non-linear arithmetic [2022-04-14 16:27:28,377 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [291540387] [2022-04-14 16:27:28,378 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-14 16:27:28,378 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-14 16:27:28,378 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-04-14 16:27:28,379 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-14 16:27:28,380 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-14 16:27:28,413 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-14 16:27:28,415 INFO L263 TraceCheckSpWp]: Trace formula consists of 87 conjuncts, 5 conjunts are in the unsatisfiable core [2022-04-14 16:27:28,429 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-14 16:27:28,432 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-04-14 16:27:28,572 INFO L272 TraceCheckUtils]: 0: Hoare triple {489#true} call ULTIMATE.init(); {489#true} is VALID [2022-04-14 16:27:28,573 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-14 16:27:28,573 INFO L290 TraceCheckUtils]: 2: Hoare triple {497#(<= ~counter~0 0)} assume true; {497#(<= ~counter~0 0)} is VALID [2022-04-14 16:27:28,573 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {497#(<= ~counter~0 0)} {489#true} #96#return; {497#(<= ~counter~0 0)} is VALID [2022-04-14 16:27:28,574 INFO L272 TraceCheckUtils]: 4: Hoare triple {497#(<= ~counter~0 0)} call #t~ret8 := main(); {497#(<= ~counter~0 0)} is VALID [2022-04-14 16:27:28,574 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-14 16:27:28,575 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-14 16:27:28,575 INFO L290 TraceCheckUtils]: 7: Hoare triple {497#(<= ~counter~0 0)} ~cond := #in~cond; {497#(<= ~counter~0 0)} is VALID [2022-04-14 16:27:28,575 INFO L290 TraceCheckUtils]: 8: Hoare triple {497#(<= ~counter~0 0)} assume !(0 == ~cond); {497#(<= ~counter~0 0)} is VALID [2022-04-14 16:27:28,576 INFO L290 TraceCheckUtils]: 9: Hoare triple {497#(<= ~counter~0 0)} assume true; {497#(<= ~counter~0 0)} is VALID [2022-04-14 16:27:28,576 INFO L284 TraceCheckUtils]: 10: Hoare quadruple {497#(<= ~counter~0 0)} {497#(<= ~counter~0 0)} #80#return; {497#(<= ~counter~0 0)} is VALID [2022-04-14 16:27:28,576 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-14 16:27:28,577 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-14 16:27:28,577 INFO L290 TraceCheckUtils]: 13: Hoare triple {531#(<= |main_#t~post6| 0)} assume !(#t~post6 < 1);havoc #t~post6; {490#false} is VALID [2022-04-14 16:27:28,577 INFO L290 TraceCheckUtils]: 14: Hoare triple {490#false} #t~post7 := ~counter~0;~counter~0 := 1 + #t~post7; {490#false} is VALID [2022-04-14 16:27:28,578 INFO L290 TraceCheckUtils]: 15: Hoare triple {490#false} assume !(#t~post7 < 1);havoc #t~post7; {490#false} is VALID [2022-04-14 16:27:28,578 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-14 16:27:28,578 INFO L290 TraceCheckUtils]: 17: Hoare triple {490#false} ~cond := #in~cond; {490#false} is VALID [2022-04-14 16:27:28,578 INFO L290 TraceCheckUtils]: 18: Hoare triple {490#false} assume 0 == ~cond; {490#false} is VALID [2022-04-14 16:27:28,578 INFO L290 TraceCheckUtils]: 19: Hoare triple {490#false} assume !false; {490#false} is VALID [2022-04-14 16:27:28,578 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-14 16:27:28,578 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-04-14 16:27:28,579 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-14 16:27:28,579 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1499876256] [2022-04-14 16:27:28,579 WARN L310 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2022-04-14 16:27:28,579 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [291540387] [2022-04-14 16:27:28,579 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [291540387] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-14 16:27:28,579 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-14 16:27:28,579 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-04-14 16:27:28,579 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1336640018] [2022-04-14 16:27:28,580 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-14 16:27:28,580 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-14 16:27:28,580 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-14 16:27:28,580 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-14 16:27:28,592 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-14 16:27:28,592 INFO L554 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-04-14 16:27:28,593 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-04-14 16:27:28,593 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-04-14 16:27:28,593 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-04-14 16:27:28,593 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-14 16:27:28,667 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-14 16:27:28,668 INFO L93 Difference]: Finished difference Result 52 states and 67 transitions. [2022-04-14 16:27:28,668 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-04-14 16:27:28,668 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-14 16:27:28,668 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-14 16:27:28,668 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-14 16:27:28,670 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 64 transitions. [2022-04-14 16:27:28,670 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-14 16:27:28,671 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 64 transitions. [2022-04-14 16:27:28,672 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 4 states and 64 transitions. [2022-04-14 16:27:28,718 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-14 16:27:28,724 INFO L225 Difference]: With dead ends: 52 [2022-04-14 16:27:28,724 INFO L226 Difference]: Without dead ends: 38 [2022-04-14 16:27:28,725 INFO L912 BasicCegarLoop]: 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-14 16:27:28,729 INFO L913 BasicCegarLoop]: 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-14 16:27:28,730 INFO L914 BasicCegarLoop]: 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-14 16:27:28,731 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 38 states. [2022-04-14 16:27:28,743 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 38 to 38. [2022-04-14 16:27:28,743 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-14 16:27:28,745 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-14 16:27:28,745 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-14 16:27:28,746 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-14 16:27:28,748 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-14 16:27:28,748 INFO L93 Difference]: Finished difference Result 38 states and 47 transitions. [2022-04-14 16:27:28,748 INFO L276 IsEmpty]: Start isEmpty. Operand 38 states and 47 transitions. [2022-04-14 16:27:28,750 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-14 16:27:28,750 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-14 16:27:28,751 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-14 16:27:28,751 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-14 16:27:28,754 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-14 16:27:28,754 INFO L93 Difference]: Finished difference Result 38 states and 47 transitions. [2022-04-14 16:27:28,754 INFO L276 IsEmpty]: Start isEmpty. Operand 38 states and 47 transitions. [2022-04-14 16:27:28,758 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-14 16:27:28,758 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-14 16:27:28,758 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-14 16:27:28,759 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-14 16:27:28,759 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-14 16:27:28,763 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 38 states to 38 states and 47 transitions. [2022-04-14 16:27:28,763 INFO L78 Accepts]: Start accepts. Automaton has 38 states and 47 transitions. Word has length 20 [2022-04-14 16:27:28,763 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-14 16:27:28,763 INFO L478 AbstractCegarLoop]: Abstraction has 38 states and 47 transitions. [2022-04-14 16:27:28,763 INFO L479 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 3.5) internal successors, (14), 3 states have internal predecessors, (14), 3 states have call successors, (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-14 16:27:28,763 INFO L276 IsEmpty]: Start isEmpty. Operand 38 states and 47 transitions. [2022-04-14 16:27:28,764 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 24 [2022-04-14 16:27:28,764 INFO L491 BasicCegarLoop]: Found error trace [2022-04-14 16:27:28,764 INFO L499 BasicCegarLoop]: 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-14 16:27:28,785 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-14 16:27:28,979 WARN L460 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-14 16:27:28,980 INFO L403 AbstractCegarLoop]: === Iteration 4 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-14 16:27:28,980 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-14 16:27:28,980 INFO L85 PathProgramCache]: Analyzing trace with hash -784889968, now seen corresponding path program 1 times [2022-04-14 16:27:28,980 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-14 16:27:28,980 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [757113120] [2022-04-14 16:27:28,980 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-14 16:27:28,981 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-14 16:27:29,003 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-14 16:27:29,041 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-04-14 16:27:29,043 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-14 16:27:29,046 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-14 16:27:29,046 INFO L290 TraceCheckUtils]: 1: Hoare triple {757#true} assume true; {757#true} is VALID [2022-04-14 16:27:29,046 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {757#true} {757#true} #96#return; {757#true} is VALID [2022-04-14 16:27:29,047 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2022-04-14 16:27:29,047 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-14 16:27:29,050 INFO L290 TraceCheckUtils]: 0: Hoare triple {757#true} ~cond := #in~cond; {757#true} is VALID [2022-04-14 16:27:29,050 INFO L290 TraceCheckUtils]: 1: Hoare triple {757#true} assume !(0 == ~cond); {757#true} is VALID [2022-04-14 16:27:29,050 INFO L290 TraceCheckUtils]: 2: Hoare triple {757#true} assume true; {757#true} is VALID [2022-04-14 16:27:29,050 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {757#true} {757#true} #80#return; {757#true} is VALID [2022-04-14 16:27:29,050 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 14 [2022-04-14 16:27:29,052 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-14 16:27:29,055 INFO L290 TraceCheckUtils]: 0: Hoare triple {757#true} ~cond := #in~cond; {757#true} is VALID [2022-04-14 16:27:29,055 INFO L290 TraceCheckUtils]: 1: Hoare triple {757#true} assume !(0 == ~cond); {757#true} is VALID [2022-04-14 16:27:29,055 INFO L290 TraceCheckUtils]: 2: Hoare triple {757#true} assume true; {757#true} is VALID [2022-04-14 16:27:29,056 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-14 16:27:29,056 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-14 16:27:29,057 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-14 16:27:29,057 INFO L290 TraceCheckUtils]: 2: Hoare triple {757#true} assume true; {757#true} is VALID [2022-04-14 16:27:29,057 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {757#true} {757#true} #96#return; {757#true} is VALID [2022-04-14 16:27:29,057 INFO L272 TraceCheckUtils]: 4: Hoare triple {757#true} call #t~ret8 := main(); {757#true} is VALID [2022-04-14 16:27:29,057 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-14 16:27:29,057 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-14 16:27:29,057 INFO L290 TraceCheckUtils]: 7: Hoare triple {757#true} ~cond := #in~cond; {757#true} is VALID [2022-04-14 16:27:29,058 INFO L290 TraceCheckUtils]: 8: Hoare triple {757#true} assume !(0 == ~cond); {757#true} is VALID [2022-04-14 16:27:29,058 INFO L290 TraceCheckUtils]: 9: Hoare triple {757#true} assume true; {757#true} is VALID [2022-04-14 16:27:29,058 INFO L284 TraceCheckUtils]: 10: Hoare quadruple {757#true} {757#true} #80#return; {757#true} is VALID [2022-04-14 16:27:29,058 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-14 16:27:29,059 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-14 16:27:29,059 INFO L290 TraceCheckUtils]: 13: Hoare triple {766#(= (+ main_~A~0 (* (- 1) main_~r~0)) 0)} assume !!(#t~post6 < 1);havoc #t~post6; {766#(= (+ main_~A~0 (* (- 1) main_~r~0)) 0)} is VALID [2022-04-14 16:27:29,059 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-14 16:27:29,059 INFO L290 TraceCheckUtils]: 15: Hoare triple {757#true} ~cond := #in~cond; {757#true} is VALID [2022-04-14 16:27:29,059 INFO L290 TraceCheckUtils]: 16: Hoare triple {757#true} assume !(0 == ~cond); {757#true} is VALID [2022-04-14 16:27:29,060 INFO L290 TraceCheckUtils]: 17: Hoare triple {757#true} assume true; {757#true} is VALID [2022-04-14 16:27:29,060 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-14 16:27:29,061 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-14 16:27:29,061 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-14 16:27:29,062 INFO L290 TraceCheckUtils]: 21: Hoare triple {772#(not (= __VERIFIER_assert_~cond 0))} assume 0 == ~cond; {758#false} is VALID [2022-04-14 16:27:29,062 INFO L290 TraceCheckUtils]: 22: Hoare triple {758#false} assume !false; {758#false} is VALID [2022-04-14 16:27:29,062 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-14 16:27:29,062 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-14 16:27:29,062 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [757113120] [2022-04-14 16:27:29,062 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [757113120] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-14 16:27:29,062 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-14 16:27:29,063 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2022-04-14 16:27:29,063 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [20126265] [2022-04-14 16:27:29,063 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-14 16:27:29,063 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-14 16:27:29,063 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-14 16:27:29,064 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-14 16:27:29,078 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-14 16:27:29,078 INFO L554 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2022-04-14 16:27:29,078 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-04-14 16:27:29,079 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2022-04-14 16:27:29,079 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2022-04-14 16:27:29,079 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-14 16:27:29,376 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-14 16:27:29,376 INFO L93 Difference]: Finished difference Result 52 states and 66 transitions. [2022-04-14 16:27:29,376 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2022-04-14 16:27:29,377 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-14 16:27:29,377 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-14 16:27:29,377 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-14 16:27:29,378 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8 states to 8 states and 62 transitions. [2022-04-14 16:27:29,378 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-14 16:27:29,380 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8 states to 8 states and 62 transitions. [2022-04-14 16:27:29,380 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 8 states and 62 transitions. [2022-04-14 16:27:29,431 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-14 16:27:29,432 INFO L225 Difference]: With dead ends: 52 [2022-04-14 16:27:29,432 INFO L226 Difference]: Without dead ends: 50 [2022-04-14 16:27:29,432 INFO L912 BasicCegarLoop]: 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-14 16:27:29,433 INFO L913 BasicCegarLoop]: 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-14 16:27:29,433 INFO L914 BasicCegarLoop]: 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-14 16:27:29,433 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 50 states. [2022-04-14 16:27:29,441 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 50 to 42. [2022-04-14 16:27:29,441 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-14 16:27:29,441 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-14 16:27:29,442 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-14 16:27:29,442 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-14 16:27:29,443 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-14 16:27:29,443 INFO L93 Difference]: Finished difference Result 50 states and 64 transitions. [2022-04-14 16:27:29,444 INFO L276 IsEmpty]: Start isEmpty. Operand 50 states and 64 transitions. [2022-04-14 16:27:29,444 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-14 16:27:29,444 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-14 16:27:29,444 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-14 16:27:29,444 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-14 16:27:29,446 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-14 16:27:29,446 INFO L93 Difference]: Finished difference Result 50 states and 64 transitions. [2022-04-14 16:27:29,446 INFO L276 IsEmpty]: Start isEmpty. Operand 50 states and 64 transitions. [2022-04-14 16:27:29,446 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-14 16:27:29,446 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-14 16:27:29,446 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-14 16:27:29,447 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-14 16:27:29,447 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-14 16:27:29,448 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 42 states to 42 states and 50 transitions. [2022-04-14 16:27:29,448 INFO L78 Accepts]: Start accepts. Automaton has 42 states and 50 transitions. Word has length 23 [2022-04-14 16:27:29,448 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-14 16:27:29,448 INFO L478 AbstractCegarLoop]: Abstraction has 42 states and 50 transitions. [2022-04-14 16:27:29,448 INFO L479 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-14 16:27:29,449 INFO L276 IsEmpty]: Start isEmpty. Operand 42 states and 50 transitions. [2022-04-14 16:27:29,449 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 29 [2022-04-14 16:27:29,449 INFO L491 BasicCegarLoop]: Found error trace [2022-04-14 16:27:29,449 INFO L499 BasicCegarLoop]: 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-14 16:27:29,449 WARN L460 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2022-04-14 16:27:29,449 INFO L403 AbstractCegarLoop]: === Iteration 5 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-14 16:27:29,450 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-14 16:27:29,450 INFO L85 PathProgramCache]: Analyzing trace with hash -1024624683, now seen corresponding path program 1 times [2022-04-14 16:27:29,450 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-14 16:27:29,450 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2026683211] [2022-04-14 16:27:29,450 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-14 16:27:29,450 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-14 16:27:29,459 ERROR L245 FreeRefinementEngine]: Caught known exception: Unsupported non-linear arithmetic [2022-04-14 16:27:29,459 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [1735057036] [2022-04-14 16:27:29,459 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-14 16:27:29,459 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-14 16:27:29,459 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-04-14 16:27:29,460 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-14 16:27:29,461 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-14 16:27:29,493 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-14 16:27:29,493 INFO L263 TraceCheckSpWp]: Trace formula consists of 100 conjuncts, 7 conjunts are in the unsatisfiable core [2022-04-14 16:27:29,501 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-14 16:27:29,501 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-04-14 16:27:29,603 INFO L272 TraceCheckUtils]: 0: Hoare triple {1018#true} call ULTIMATE.init(); {1018#true} is VALID [2022-04-14 16:27:29,603 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-14 16:27:29,603 INFO L290 TraceCheckUtils]: 2: Hoare triple {1018#true} assume true; {1018#true} is VALID [2022-04-14 16:27:29,603 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {1018#true} {1018#true} #96#return; {1018#true} is VALID [2022-04-14 16:27:29,603 INFO L272 TraceCheckUtils]: 4: Hoare triple {1018#true} call #t~ret8 := main(); {1018#true} is VALID [2022-04-14 16:27:29,603 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-14 16:27:29,603 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-14 16:27:29,604 INFO L290 TraceCheckUtils]: 7: Hoare triple {1018#true} ~cond := #in~cond; {1018#true} is VALID [2022-04-14 16:27:29,604 INFO L290 TraceCheckUtils]: 8: Hoare triple {1018#true} assume !(0 == ~cond); {1018#true} is VALID [2022-04-14 16:27:29,604 INFO L290 TraceCheckUtils]: 9: Hoare triple {1018#true} assume true; {1018#true} is VALID [2022-04-14 16:27:29,604 INFO L284 TraceCheckUtils]: 10: Hoare quadruple {1018#true} {1018#true} #80#return; {1018#true} is VALID [2022-04-14 16:27:29,605 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-14 16:27:29,605 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-14 16:27:29,606 INFO L290 TraceCheckUtils]: 13: Hoare triple {1056#(and (= main_~B~0 main_~d~0) (= main_~p~0 1))} assume !!(#t~post6 < 1);havoc #t~post6; {1056#(and (= main_~B~0 main_~d~0) (= main_~p~0 1))} is VALID [2022-04-14 16:27:29,606 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-14 16:27:29,606 INFO L290 TraceCheckUtils]: 15: Hoare triple {1018#true} ~cond := #in~cond; {1018#true} is VALID [2022-04-14 16:27:29,606 INFO L290 TraceCheckUtils]: 16: Hoare triple {1018#true} assume !(0 == ~cond); {1018#true} is VALID [2022-04-14 16:27:29,606 INFO L290 TraceCheckUtils]: 17: Hoare triple {1018#true} assume true; {1018#true} is VALID [2022-04-14 16:27:29,607 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-14 16:27:29,608 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-14 16:27:29,608 INFO L290 TraceCheckUtils]: 20: Hoare triple {1018#true} ~cond := #in~cond; {1018#true} is VALID [2022-04-14 16:27:29,608 INFO L290 TraceCheckUtils]: 21: Hoare triple {1018#true} assume !(0 == ~cond); {1018#true} is VALID [2022-04-14 16:27:29,608 INFO L290 TraceCheckUtils]: 22: Hoare triple {1018#true} assume true; {1018#true} is VALID [2022-04-14 16:27:29,615 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-14 16:27:29,616 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-14 16:27:29,616 INFO L290 TraceCheckUtils]: 25: Hoare triple {1096#(<= 1 |__VERIFIER_assert_#in~cond|)} ~cond := #in~cond; {1100#(<= 1 __VERIFIER_assert_~cond)} is VALID [2022-04-14 16:27:29,617 INFO L290 TraceCheckUtils]: 26: Hoare triple {1100#(<= 1 __VERIFIER_assert_~cond)} assume 0 == ~cond; {1019#false} is VALID [2022-04-14 16:27:29,617 INFO L290 TraceCheckUtils]: 27: Hoare triple {1019#false} assume !false; {1019#false} is VALID [2022-04-14 16:27:29,617 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-14 16:27:29,617 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-04-14 16:27:29,617 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-14 16:27:29,617 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2026683211] [2022-04-14 16:27:29,617 WARN L310 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2022-04-14 16:27:29,617 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1735057036] [2022-04-14 16:27:29,618 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1735057036] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-14 16:27:29,618 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-14 16:27:29,618 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2022-04-14 16:27:29,618 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1580644939] [2022-04-14 16:27:29,618 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-14 16:27:29,618 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-14 16:27:29,619 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-14 16:27:29,619 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-14 16:27:29,634 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-14 16:27:29,634 INFO L554 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-04-14 16:27:29,634 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-04-14 16:27:29,634 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-04-14 16:27:29,635 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2022-04-14 16:27:29,635 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-14 16:27:31,777 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-14 16:27:31,959 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-14 16:27:31,960 INFO L93 Difference]: Finished difference Result 59 states and 75 transitions. [2022-04-14 16:27:31,960 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-04-14 16:27:31,960 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-14 16:27:31,960 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-14 16:27:31,960 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-14 16:27:31,961 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 69 transitions. [2022-04-14 16:27:31,962 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-14 16:27:31,963 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 69 transitions. [2022-04-14 16:27:31,963 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 5 states and 69 transitions. [2022-04-14 16:27:32,018 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-14 16:27:32,019 INFO L225 Difference]: With dead ends: 59 [2022-04-14 16:27:32,019 INFO L226 Difference]: Without dead ends: 56 [2022-04-14 16:27:32,019 INFO L912 BasicCegarLoop]: 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-14 16:27:32,020 INFO L913 BasicCegarLoop]: 43 mSDtfsCounter, 10 mSDsluCounter, 97 mSDsCounter, 0 mSdLazyCounter, 47 mSolverCounterSat, 2 mSolverCounterUnsat, 1 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 2.0s 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-14 16:27:32,020 INFO L914 BasicCegarLoop]: 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-14 16:27:32,020 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 56 states. [2022-04-14 16:27:32,042 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 56 to 56. [2022-04-14 16:27:32,042 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-14 16:27:32,043 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-14 16:27:32,043 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-14 16:27:32,043 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-14 16:27:32,045 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-14 16:27:32,045 INFO L93 Difference]: Finished difference Result 56 states and 71 transitions. [2022-04-14 16:27:32,045 INFO L276 IsEmpty]: Start isEmpty. Operand 56 states and 71 transitions. [2022-04-14 16:27:32,045 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-14 16:27:32,046 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-14 16:27:32,046 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-14 16:27:32,046 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-14 16:27:32,048 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-14 16:27:32,048 INFO L93 Difference]: Finished difference Result 56 states and 71 transitions. [2022-04-14 16:27:32,048 INFO L276 IsEmpty]: Start isEmpty. Operand 56 states and 71 transitions. [2022-04-14 16:27:32,048 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-14 16:27:32,048 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-14 16:27:32,048 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-14 16:27:32,048 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-14 16:27:32,049 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-14 16:27:32,050 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 56 states to 56 states and 71 transitions. [2022-04-14 16:27:32,050 INFO L78 Accepts]: Start accepts. Automaton has 56 states and 71 transitions. Word has length 28 [2022-04-14 16:27:32,050 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-14 16:27:32,051 INFO L478 AbstractCegarLoop]: Abstraction has 56 states and 71 transitions. [2022-04-14 16:27:32,051 INFO L479 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 3.0) internal successors, (15), 4 states have internal predecessors, (15), 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-14 16:27:32,051 INFO L276 IsEmpty]: Start isEmpty. Operand 56 states and 71 transitions. [2022-04-14 16:27:32,051 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 37 [2022-04-14 16:27:32,051 INFO L491 BasicCegarLoop]: Found error trace [2022-04-14 16:27:32,051 INFO L499 BasicCegarLoop]: 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-14 16:27:32,070 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Forceful destruction successful, exit code 0 [2022-04-14 16:27:32,260 WARN L460 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-14 16:27:32,260 INFO L403 AbstractCegarLoop]: === Iteration 6 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-14 16:27:32,261 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-14 16:27:32,261 INFO L85 PathProgramCache]: Analyzing trace with hash 1301357193, now seen corresponding path program 1 times [2022-04-14 16:27:32,261 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-14 16:27:32,261 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [656564691] [2022-04-14 16:27:32,261 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-14 16:27:32,261 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-14 16:27:32,275 ERROR L245 FreeRefinementEngine]: Caught known exception: Unsupported non-linear arithmetic [2022-04-14 16:27:32,276 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [1558355749] [2022-04-14 16:27:32,276 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-14 16:27:32,276 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-14 16:27:32,276 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-04-14 16:27:32,288 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-14 16:27:32,289 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-14 16:27:32,333 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-14 16:27:32,334 INFO L263 TraceCheckSpWp]: Trace formula consists of 115 conjuncts, 10 conjunts are in the unsatisfiable core [2022-04-14 16:27:32,342 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-14 16:27:32,343 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-04-14 16:27:32,813 INFO L272 TraceCheckUtils]: 0: Hoare triple {1386#true} call ULTIMATE.init(); {1386#true} is VALID [2022-04-14 16:27:32,813 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; {1386#true} is VALID [2022-04-14 16:27:32,814 INFO L290 TraceCheckUtils]: 2: Hoare triple {1386#true} assume true; {1386#true} is VALID [2022-04-14 16:27:32,814 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {1386#true} {1386#true} #96#return; {1386#true} is VALID [2022-04-14 16:27:32,814 INFO L272 TraceCheckUtils]: 4: Hoare triple {1386#true} call #t~ret8 := main(); {1386#true} is VALID [2022-04-14 16:27:32,814 INFO L290 TraceCheckUtils]: 5: Hoare triple {1386#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; {1386#true} is VALID [2022-04-14 16:27:32,814 INFO L272 TraceCheckUtils]: 6: Hoare triple {1386#true} call assume_abort_if_not((if ~B~0 % 4294967296 >= 1 then 1 else 0)); {1386#true} is VALID [2022-04-14 16:27:32,814 INFO L290 TraceCheckUtils]: 7: Hoare triple {1386#true} ~cond := #in~cond; {1386#true} is VALID [2022-04-14 16:27:32,814 INFO L290 TraceCheckUtils]: 8: Hoare triple {1386#true} assume !(0 == ~cond); {1386#true} is VALID [2022-04-14 16:27:32,814 INFO L290 TraceCheckUtils]: 9: Hoare triple {1386#true} assume true; {1386#true} is VALID [2022-04-14 16:27:32,814 INFO L284 TraceCheckUtils]: 10: Hoare quadruple {1386#true} {1386#true} #80#return; {1386#true} is VALID [2022-04-14 16:27:32,815 INFO L290 TraceCheckUtils]: 11: Hoare triple {1386#true} ~r~0 := ~A~0;~d~0 := ~B~0;~p~0 := 1;~q~0 := 0; {1424#(and (= main_~A~0 main_~r~0) (= main_~q~0 0))} is VALID [2022-04-14 16:27:32,815 INFO L290 TraceCheckUtils]: 12: Hoare triple {1424#(and (= main_~A~0 main_~r~0) (= main_~q~0 0))} #t~post6 := ~counter~0;~counter~0 := 1 + #t~post6; {1424#(and (= main_~A~0 main_~r~0) (= main_~q~0 0))} is VALID [2022-04-14 16:27:32,816 INFO L290 TraceCheckUtils]: 13: Hoare triple {1424#(and (= main_~A~0 main_~r~0) (= main_~q~0 0))} assume !!(#t~post6 < 1);havoc #t~post6; {1424#(and (= main_~A~0 main_~r~0) (= main_~q~0 0))} is VALID [2022-04-14 16:27:32,816 INFO L272 TraceCheckUtils]: 14: Hoare triple {1424#(and (= main_~A~0 main_~r~0) (= main_~q~0 0))} call __VERIFIER_assert((if 0 == ~q~0 % 4294967296 then 1 else 0)); {1386#true} is VALID [2022-04-14 16:27:32,816 INFO L290 TraceCheckUtils]: 15: Hoare triple {1386#true} ~cond := #in~cond; {1386#true} is VALID [2022-04-14 16:27:32,816 INFO L290 TraceCheckUtils]: 16: Hoare triple {1386#true} assume !(0 == ~cond); {1386#true} is VALID [2022-04-14 16:27:32,816 INFO L290 TraceCheckUtils]: 17: Hoare triple {1386#true} assume true; {1386#true} is VALID [2022-04-14 16:27:32,817 INFO L284 TraceCheckUtils]: 18: Hoare quadruple {1386#true} {1424#(and (= main_~A~0 main_~r~0) (= main_~q~0 0))} #82#return; {1424#(and (= main_~A~0 main_~r~0) (= main_~q~0 0))} is VALID [2022-04-14 16:27:32,817 INFO L272 TraceCheckUtils]: 19: Hoare triple {1424#(and (= main_~A~0 main_~r~0) (= main_~q~0 0))} call __VERIFIER_assert((if ~r~0 % 4294967296 == ~A~0 % 4294967296 then 1 else 0)); {1386#true} is VALID [2022-04-14 16:27:32,817 INFO L290 TraceCheckUtils]: 20: Hoare triple {1386#true} ~cond := #in~cond; {1386#true} is VALID [2022-04-14 16:27:32,817 INFO L290 TraceCheckUtils]: 21: Hoare triple {1386#true} assume !(0 == ~cond); {1386#true} is VALID [2022-04-14 16:27:32,817 INFO L290 TraceCheckUtils]: 22: Hoare triple {1386#true} assume true; {1386#true} is VALID [2022-04-14 16:27:32,818 INFO L284 TraceCheckUtils]: 23: Hoare quadruple {1386#true} {1424#(and (= main_~A~0 main_~r~0) (= main_~q~0 0))} #84#return; {1424#(and (= main_~A~0 main_~r~0) (= main_~q~0 0))} is VALID [2022-04-14 16:27:32,818 INFO L272 TraceCheckUtils]: 24: Hoare triple {1424#(and (= main_~A~0 main_~r~0) (= main_~q~0 0))} call __VERIFIER_assert((if ~d~0 % 4294967296 == ~B~0 * ~p~0 % 4294967296 then 1 else 0)); {1386#true} is VALID [2022-04-14 16:27:32,818 INFO L290 TraceCheckUtils]: 25: Hoare triple {1386#true} ~cond := #in~cond; {1386#true} is VALID [2022-04-14 16:27:32,818 INFO L290 TraceCheckUtils]: 26: Hoare triple {1386#true} assume !(0 == ~cond); {1386#true} is VALID [2022-04-14 16:27:32,818 INFO L290 TraceCheckUtils]: 27: Hoare triple {1386#true} assume true; {1386#true} is VALID [2022-04-14 16:27:32,819 INFO L284 TraceCheckUtils]: 28: Hoare quadruple {1386#true} {1424#(and (= main_~A~0 main_~r~0) (= main_~q~0 0))} #86#return; {1424#(and (= main_~A~0 main_~r~0) (= main_~q~0 0))} is VALID [2022-04-14 16:27:32,819 INFO L290 TraceCheckUtils]: 29: Hoare triple {1424#(and (= main_~A~0 main_~r~0) (= main_~q~0 0))} assume !(~r~0 % 4294967296 >= ~d~0 % 4294967296); {1479#(and (= main_~A~0 main_~r~0) (not (<= (mod main_~d~0 4294967296) (mod main_~r~0 4294967296))) (= main_~q~0 0))} is VALID [2022-04-14 16:27:32,820 INFO L290 TraceCheckUtils]: 30: Hoare triple {1479#(and (= main_~A~0 main_~r~0) (not (<= (mod main_~d~0 4294967296) (mod main_~r~0 4294967296))) (= main_~q~0 0))} #t~post7 := ~counter~0;~counter~0 := 1 + #t~post7; {1479#(and (= main_~A~0 main_~r~0) (not (<= (mod main_~d~0 4294967296) (mod main_~r~0 4294967296))) (= main_~q~0 0))} is VALID [2022-04-14 16:27:32,820 INFO L290 TraceCheckUtils]: 31: Hoare triple {1479#(and (= main_~A~0 main_~r~0) (not (<= (mod main_~d~0 4294967296) (mod main_~r~0 4294967296))) (= main_~q~0 0))} assume !(#t~post7 < 1);havoc #t~post7; {1479#(and (= main_~A~0 main_~r~0) (not (<= (mod main_~d~0 4294967296) (mod main_~r~0 4294967296))) (= main_~q~0 0))} is VALID [2022-04-14 16:27:32,821 INFO L272 TraceCheckUtils]: 32: Hoare triple {1479#(and (= main_~A~0 main_~r~0) (not (<= (mod main_~d~0 4294967296) (mod main_~r~0 4294967296))) (= main_~q~0 0))} call __VERIFIER_assert((if ~A~0 % 4294967296 == (~d~0 * ~q~0 + ~r~0) % 4294967296 then 1 else 0)); {1489#(<= 1 |__VERIFIER_assert_#in~cond|)} is VALID [2022-04-14 16:27:32,821 INFO L290 TraceCheckUtils]: 33: Hoare triple {1489#(<= 1 |__VERIFIER_assert_#in~cond|)} ~cond := #in~cond; {1493#(<= 1 __VERIFIER_assert_~cond)} is VALID [2022-04-14 16:27:32,822 INFO L290 TraceCheckUtils]: 34: Hoare triple {1493#(<= 1 __VERIFIER_assert_~cond)} assume 0 == ~cond; {1387#false} is VALID [2022-04-14 16:27:32,822 INFO L290 TraceCheckUtils]: 35: Hoare triple {1387#false} assume !false; {1387#false} is VALID [2022-04-14 16:27:32,822 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-14 16:27:32,822 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-04-14 16:27:32,822 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-14 16:27:32,822 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [656564691] [2022-04-14 16:27:32,822 WARN L310 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2022-04-14 16:27:32,822 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1558355749] [2022-04-14 16:27:32,822 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1558355749] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-14 16:27:32,822 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-14 16:27:32,822 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2022-04-14 16:27:32,823 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [506469966] [2022-04-14 16:27:32,823 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-14 16:27:32,823 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-14 16:27:32,823 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-14 16:27:32,824 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-14 16:27:32,857 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-14 16:27:32,858 INFO L554 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2022-04-14 16:27:32,858 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-04-14 16:27:32,858 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2022-04-14 16:27:32,858 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2022-04-14 16:27:32,858 INFO L87 Difference]: Start difference. First operand 56 states and 71 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-14 16:27:33,187 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-14 16:27:33,187 INFO L93 Difference]: Finished difference Result 77 states and 102 transitions. [2022-04-14 16:27:33,187 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2022-04-14 16:27:33,187 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-14 16:27:33,188 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-14 16:27:33,188 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-14 16:27:33,189 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 73 transitions. [2022-04-14 16:27:33,189 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-14 16:27:33,190 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 73 transitions. [2022-04-14 16:27:33,190 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 6 states and 73 transitions. [2022-04-14 16:27:33,255 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 73 edges. 73 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-14 16:27:33,256 INFO L225 Difference]: With dead ends: 77 [2022-04-14 16:27:33,256 INFO L226 Difference]: Without dead ends: 74 [2022-04-14 16:27:33,257 INFO L912 BasicCegarLoop]: 0 DeclaredPredicates, 36 GetRequests, 31 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=14, Invalid=28, Unknown=0, NotChecked=0, Total=42 [2022-04-14 16:27:33,257 INFO L913 BasicCegarLoop]: 38 mSDtfsCounter, 19 mSDsluCounter, 92 mSDsCounter, 0 mSdLazyCounter, 72 mSolverCounterSat, 9 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 25 SdHoareTripleChecker+Valid, 130 SdHoareTripleChecker+Invalid, 81 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 9 IncrementalHoareTripleChecker+Valid, 72 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-04-14 16:27:33,257 INFO L914 BasicCegarLoop]: SdHoareTripleChecker [25 Valid, 130 Invalid, 81 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [9 Valid, 72 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-04-14 16:27:33,258 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 74 states. [2022-04-14 16:27:33,271 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 74 to 66. [2022-04-14 16:27:33,271 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-14 16:27:33,271 INFO L82 GeneralOperation]: Start isEquivalent. First operand 74 states. Second operand has 66 states, 40 states have (on average 1.25) internal successors, (50), 42 states have internal predecessors, (50), 18 states have call successors, (18), 8 states have call predecessors, (18), 7 states have return successors, (16), 15 states have call predecessors, (16), 16 states have call successors, (16) [2022-04-14 16:27:33,271 INFO L74 IsIncluded]: Start isIncluded. First operand 74 states. Second operand has 66 states, 40 states have (on average 1.25) internal successors, (50), 42 states have internal predecessors, (50), 18 states have call successors, (18), 8 states have call predecessors, (18), 7 states have return successors, (16), 15 states have call predecessors, (16), 16 states have call successors, (16) [2022-04-14 16:27:33,271 INFO L87 Difference]: Start difference. First operand 74 states. Second operand has 66 states, 40 states have (on average 1.25) internal successors, (50), 42 states have internal predecessors, (50), 18 states have call successors, (18), 8 states have call predecessors, (18), 7 states have return successors, (16), 15 states have call predecessors, (16), 16 states have call successors, (16) [2022-04-14 16:27:33,273 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-14 16:27:33,274 INFO L93 Difference]: Finished difference Result 74 states and 97 transitions. [2022-04-14 16:27:33,274 INFO L276 IsEmpty]: Start isEmpty. Operand 74 states and 97 transitions. [2022-04-14 16:27:33,274 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-14 16:27:33,274 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-14 16:27:33,274 INFO L74 IsIncluded]: Start isIncluded. First operand has 66 states, 40 states have (on average 1.25) internal successors, (50), 42 states have internal predecessors, (50), 18 states have call successors, (18), 8 states have call predecessors, (18), 7 states have return successors, (16), 15 states have call predecessors, (16), 16 states have call successors, (16) Second operand 74 states. [2022-04-14 16:27:33,274 INFO L87 Difference]: Start difference. First operand has 66 states, 40 states have (on average 1.25) internal successors, (50), 42 states have internal predecessors, (50), 18 states have call successors, (18), 8 states have call predecessors, (18), 7 states have return successors, (16), 15 states have call predecessors, (16), 16 states have call successors, (16) Second operand 74 states. [2022-04-14 16:27:33,276 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-14 16:27:33,276 INFO L93 Difference]: Finished difference Result 74 states and 97 transitions. [2022-04-14 16:27:33,276 INFO L276 IsEmpty]: Start isEmpty. Operand 74 states and 97 transitions. [2022-04-14 16:27:33,277 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-14 16:27:33,277 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-14 16:27:33,277 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-14 16:27:33,277 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-14 16:27:33,277 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 66 states, 40 states have (on average 1.25) internal successors, (50), 42 states have internal predecessors, (50), 18 states have call successors, (18), 8 states have call predecessors, (18), 7 states have return successors, (16), 15 states have call predecessors, (16), 16 states have call successors, (16) [2022-04-14 16:27:33,279 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 66 states to 66 states and 84 transitions. [2022-04-14 16:27:33,279 INFO L78 Accepts]: Start accepts. Automaton has 66 states and 84 transitions. Word has length 36 [2022-04-14 16:27:33,279 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-14 16:27:33,279 INFO L478 AbstractCegarLoop]: Abstraction has 66 states and 84 transitions. [2022-04-14 16:27:33,279 INFO L479 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 3.0) internal successors, (18), 5 states have internal predecessors, (18), 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-14 16:27:33,279 INFO L276 IsEmpty]: Start isEmpty. Operand 66 states and 84 transitions. [2022-04-14 16:27:33,280 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 44 [2022-04-14 16:27:33,280 INFO L491 BasicCegarLoop]: Found error trace [2022-04-14 16:27:33,280 INFO L499 BasicCegarLoop]: trace histogram [5, 4, 4, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-14 16:27:33,303 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-14 16:27:33,501 WARN L460 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-14 16:27:33,501 INFO L403 AbstractCegarLoop]: === Iteration 7 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-14 16:27:33,502 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-14 16:27:33,502 INFO L85 PathProgramCache]: Analyzing trace with hash 817878903, now seen corresponding path program 1 times [2022-04-14 16:27:33,502 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-14 16:27:33,502 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1548013242] [2022-04-14 16:27:33,502 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-14 16:27:33,502 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-14 16:27:33,514 ERROR L245 FreeRefinementEngine]: Caught known exception: Unsupported non-linear arithmetic [2022-04-14 16:27:33,514 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [881072498] [2022-04-14 16:27:33,514 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-14 16:27:33,514 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-14 16:27:33,514 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-04-14 16:27:33,515 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-14 16:27:33,516 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-14 16:27:33,553 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-04-14 16:27:33,553 INFO L352 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2022-04-14 16:27:33,565 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-04-14 16:27:33,606 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2022-04-14 16:27:33,606 INFO L618 BasicCegarLoop]: Counterexample is feasible [2022-04-14 16:27:33,606 INFO L788 garLoopResultBuilder]: Registering result UNSAFE for location __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION (0 of 1 remaining) [2022-04-14 16:27:33,655 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-14 16:27:33,808 WARN L460 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-14 16:27:33,810 INFO L719 BasicCegarLoop]: Path program histogram: [1, 1, 1, 1, 1, 1, 1] [2022-04-14 16:27:33,812 INFO L177 ceAbstractionStarter]: Computing trace abstraction results [2022-04-14 16:27:33,831 WARN L170 areAnnotationChecker]: reach_errorENTRY has no Hoare annotation [2022-04-14 16:27:33,831 WARN L170 areAnnotationChecker]: ULTIMATE.initENTRY has no Hoare annotation [2022-04-14 16:27:33,831 WARN L170 areAnnotationChecker]: ULTIMATE.startENTRY has no Hoare annotation [2022-04-14 16:27:33,831 WARN L170 areAnnotationChecker]: ULTIMATE.startENTRY has no Hoare annotation [2022-04-14 16:27:33,831 WARN L170 areAnnotationChecker]: assume_abort_if_notENTRY has no Hoare annotation [2022-04-14 16:27:33,831 WARN L170 areAnnotationChecker]: mainENTRY has no Hoare annotation [2022-04-14 16:27:33,831 WARN L170 areAnnotationChecker]: __VERIFIER_assertENTRY has no Hoare annotation [2022-04-14 16:27:33,831 WARN L170 areAnnotationChecker]: reach_errorFINAL has no Hoare annotation [2022-04-14 16:27:33,831 WARN L170 areAnnotationChecker]: ULTIMATE.initFINAL has no Hoare annotation [2022-04-14 16:27:33,831 WARN L170 areAnnotationChecker]: L-1 has no Hoare annotation [2022-04-14 16:27:33,831 WARN L170 areAnnotationChecker]: L-1 has no Hoare annotation [2022-04-14 16:27:33,831 WARN L170 areAnnotationChecker]: L12 has no Hoare annotation [2022-04-14 16:27:33,831 WARN L170 areAnnotationChecker]: L12 has no Hoare annotation [2022-04-14 16:27:33,831 WARN L170 areAnnotationChecker]: L28 has no Hoare annotation [2022-04-14 16:27:33,831 WARN L170 areAnnotationChecker]: L28 has no Hoare annotation [2022-04-14 16:27:33,831 WARN L170 areAnnotationChecker]: L15 has no Hoare annotation [2022-04-14 16:27:33,831 WARN L170 areAnnotationChecker]: L15 has no Hoare annotation [2022-04-14 16:27:33,831 WARN L170 areAnnotationChecker]: ULTIMATE.initEXIT has no Hoare annotation [2022-04-14 16:27:33,832 WARN L170 areAnnotationChecker]: ULTIMATE.startFINAL has no Hoare annotation [2022-04-14 16:27:33,832 WARN L170 areAnnotationChecker]: L12-2 has no Hoare annotation [2022-04-14 16:27:33,832 WARN L170 areAnnotationChecker]: L28-1 has no Hoare annotation [2022-04-14 16:27:33,832 WARN L170 areAnnotationChecker]: L16 has no Hoare annotation [2022-04-14 16:27:33,832 WARN L170 areAnnotationChecker]: L16 has no Hoare annotation [2022-04-14 16:27:33,832 WARN L170 areAnnotationChecker]: L15-2 has no Hoare annotation [2022-04-14 16:27:33,832 WARN L170 areAnnotationChecker]: assume_abort_if_notEXIT has no Hoare annotation [2022-04-14 16:27:33,832 WARN L170 areAnnotationChecker]: L35-3 has no Hoare annotation [2022-04-14 16:27:33,832 WARN L170 areAnnotationChecker]: L35-3 has no Hoare annotation [2022-04-14 16:27:33,832 WARN L170 areAnnotationChecker]: __VERIFIER_assertEXIT has no Hoare annotation [2022-04-14 16:27:33,832 WARN L170 areAnnotationChecker]: __VERIFIER_assertEXIT has no Hoare annotation [2022-04-14 16:27:33,832 WARN L170 areAnnotationChecker]: __VERIFIER_assertEXIT has no Hoare annotation [2022-04-14 16:27:33,832 WARN L170 areAnnotationChecker]: __VERIFIER_assertEXIT has no Hoare annotation [2022-04-14 16:27:33,832 WARN L170 areAnnotationChecker]: __VERIFIER_assertEXIT has no Hoare annotation [2022-04-14 16:27:33,832 WARN L170 areAnnotationChecker]: __VERIFIER_assertEXIT has no Hoare annotation [2022-04-14 16:27:33,832 WARN L170 areAnnotationChecker]: __VERIFIER_assertEXIT has no Hoare annotation [2022-04-14 16:27:33,832 WARN L170 areAnnotationChecker]: L53-2 has no Hoare annotation [2022-04-14 16:27:33,832 WARN L170 areAnnotationChecker]: L53-2 has no Hoare annotation [2022-04-14 16:27:33,832 WARN L170 areAnnotationChecker]: L35-1 has no Hoare annotation [2022-04-14 16:27:33,832 WARN L170 areAnnotationChecker]: L35-1 has no Hoare annotation [2022-04-14 16:27:33,832 WARN L170 areAnnotationChecker]: L36-1 has no Hoare annotation [2022-04-14 16:27:33,832 WARN L170 areAnnotationChecker]: L36-1 has no Hoare annotation [2022-04-14 16:27:33,832 WARN L170 areAnnotationChecker]: L37 has no Hoare annotation [2022-04-14 16:27:33,832 WARN L170 areAnnotationChecker]: L37 has no Hoare annotation [2022-04-14 16:27:33,832 WARN L170 areAnnotationChecker]: L38 has no Hoare annotation [2022-04-14 16:27:33,832 WARN L170 areAnnotationChecker]: L38 has no Hoare annotation [2022-04-14 16:27:33,832 WARN L170 areAnnotationChecker]: L46-1 has no Hoare annotation [2022-04-14 16:27:33,833 WARN L170 areAnnotationChecker]: L46-1 has no Hoare annotation [2022-04-14 16:27:33,833 WARN L170 areAnnotationChecker]: L47 has no Hoare annotation [2022-04-14 16:27:33,833 WARN L170 areAnnotationChecker]: L47 has no Hoare annotation [2022-04-14 16:27:33,833 WARN L170 areAnnotationChecker]: L59 has no Hoare annotation [2022-04-14 16:27:33,833 WARN L170 areAnnotationChecker]: L59 has no Hoare annotation [2022-04-14 16:27:33,833 WARN L170 areAnnotationChecker]: L60 has no Hoare annotation [2022-04-14 16:27:33,833 WARN L170 areAnnotationChecker]: L45-2 has no Hoare annotation [2022-04-14 16:27:33,833 WARN L170 areAnnotationChecker]: L45-2 has no Hoare annotation [2022-04-14 16:27:33,833 WARN L170 areAnnotationChecker]: L45 has no Hoare annotation [2022-04-14 16:27:33,833 WARN L170 areAnnotationChecker]: L45 has no Hoare annotation [2022-04-14 16:27:33,833 WARN L170 areAnnotationChecker]: L36 has no Hoare annotation [2022-04-14 16:27:33,833 WARN L170 areAnnotationChecker]: L36 has no Hoare annotation [2022-04-14 16:27:33,833 WARN L170 areAnnotationChecker]: L53 has no Hoare annotation [2022-04-14 16:27:33,833 WARN L170 areAnnotationChecker]: L53 has no Hoare annotation [2022-04-14 16:27:33,833 WARN L170 areAnnotationChecker]: mainFINAL has no Hoare annotation [2022-04-14 16:27:33,833 WARN L170 areAnnotationChecker]: L46 has no Hoare annotation [2022-04-14 16:27:33,833 WARN L170 areAnnotationChecker]: L46 has no Hoare annotation [2022-04-14 16:27:33,833 WARN L170 areAnnotationChecker]: mainEXIT has no Hoare annotation [2022-04-14 16:27:33,833 INFO L163 areAnnotationChecker]: CFG has 0 edges. 0 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. 0 times interpolants missing. [2022-04-14 16:27:33,834 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 14.04 04:27:33 BoogieIcfgContainer [2022-04-14 16:27:33,834 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2022-04-14 16:27:33,834 INFO L158 Benchmark]: Toolchain (without parser) took 7235.99ms. Allocated memory was 213.9MB in the beginning and 317.7MB in the end (delta: 103.8MB). Free memory was 161.5MB in the beginning and 214.0MB in the end (delta: -52.5MB). Peak memory consumption was 52.1MB. Max. memory is 8.0GB. [2022-04-14 16:27:33,834 INFO L158 Benchmark]: CDTParser took 0.08ms. Allocated memory is still 213.9MB. Free memory is still 177.5MB. There was no memory consumed. Max. memory is 8.0GB. [2022-04-14 16:27:33,835 INFO L158 Benchmark]: CACSL2BoogieTranslator took 233.42ms. Allocated memory is still 213.9MB. Free memory was 161.2MB in the beginning and 185.7MB in the end (delta: -24.5MB). Peak memory consumption was 13.6MB. Max. memory is 8.0GB. [2022-04-14 16:27:33,835 INFO L158 Benchmark]: Boogie Preprocessor took 38.60ms. Allocated memory is still 213.9MB. Free memory was 185.7MB in the beginning and 184.0MB in the end (delta: 1.7MB). Peak memory consumption was 2.1MB. Max. memory is 8.0GB. [2022-04-14 16:27:33,835 INFO L158 Benchmark]: RCFGBuilder took 283.93ms. Allocated memory is still 213.9MB. Free memory was 184.0MB in the beginning and 172.5MB in the end (delta: 11.5MB). Peak memory consumption was 11.5MB. Max. memory is 8.0GB. [2022-04-14 16:27:33,835 INFO L158 Benchmark]: TraceAbstraction took 6675.11ms. Allocated memory was 213.9MB in the beginning and 317.7MB in the end (delta: 103.8MB). Free memory was 171.9MB in the beginning and 214.0MB in the end (delta: -42.1MB). Peak memory consumption was 62.6MB. Max. memory is 8.0GB. [2022-04-14 16:27:33,836 INFO L339 ainManager$Toolchain]: ####################### End [Toolchain 1] ####################### --- Results --- * Results from de.uni_freiburg.informatik.ultimate.core: - AssertionsEnabledResult: Assertions are enabled Assertions are enabled - StatisticsResult: Toolchain Benchmarks Benchmark results are: * CDTParser took 0.08ms. Allocated memory is still 213.9MB. Free memory is still 177.5MB. There was no memory consumed. Max. memory is 8.0GB. * CACSL2BoogieTranslator took 233.42ms. Allocated memory is still 213.9MB. Free memory was 161.2MB in the beginning and 185.7MB in the end (delta: -24.5MB). Peak memory consumption was 13.6MB. Max. memory is 8.0GB. * Boogie Preprocessor took 38.60ms. Allocated memory is still 213.9MB. Free memory was 185.7MB in the beginning and 184.0MB in the end (delta: 1.7MB). Peak memory consumption was 2.1MB. Max. memory is 8.0GB. * RCFGBuilder took 283.93ms. Allocated memory is still 213.9MB. Free memory was 184.0MB in the beginning and 172.5MB in the end (delta: 11.5MB). Peak memory consumption was 11.5MB. Max. memory is 8.0GB. * TraceAbstraction took 6675.11ms. Allocated memory was 213.9MB in the beginning and 317.7MB in the end (delta: 103.8MB). Free memory was 171.9MB in the beginning and 214.0MB in the end (delta: -42.1MB). Peak memory consumption was 62.6MB. Max. memory is 8.0GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - StatisticsResult: ErrorAutomatonStatistics NumberErrorTraces: 0, NumberStatementsAllTraces: 0, NumberRelevantStatements: 0, 0.0s ErrorAutomatonConstructionTimeTotal, 0.0s FaulLocalizationTime, NumberStatementsFirstTrace: -1, TraceLengthAvg: 0, 0.0s ErrorAutomatonConstructionTimeAvg, 0.0s ErrorAutomatonDifferenceTimeAvg, 0.0s ErrorAutomatonDifferenceTimeTotal, NumberOfNoEnhancement: 0, NumberOfFiniteEnhancement: 0, NumberOfInfiniteEnhancement: 0 - CounterExampleResult [Line: 17]: a call to reach_error is reachable a call to reach_error is reachable We found a FailurePath: [L22] int counter = 0; VAL [\old(counter)=4, counter=0] [L24] unsigned int A, B; [L25] unsigned int r, d, p, q; [L26] A = __VERIFIER_nondet_uint() [L27] B = __VERIFIER_nondet_uint() [L28] CALL assume_abort_if_not(B >= 1) VAL [\old(cond)=1, \old(counter)=0, counter=0] [L12] COND FALSE !(!cond) VAL [\old(cond)=1, \old(counter)=0, cond=1, counter=0] [L28] RET assume_abort_if_not(B >= 1) VAL [\old(counter)=0, A=4294967297, B=4294967297, counter=0] [L30] r = A [L31] d = B [L32] p = 1 [L33] q = 0 VAL [\old(counter)=0, A=4294967297, B=4294967297, counter=0, d=4294967297, p=1, q=0, r=4294967297] [L35] EXPR counter++ VAL [\old(counter)=0, A=4294967297, B=4294967297, counter=1, counter++=0, d=4294967297, p=1, q=0, r=4294967297] [L35] COND TRUE counter++<1 [L36] CALL __VERIFIER_assert(q == 0) VAL [\old(cond)=1, \old(counter)=0, counter=1] [L15] COND FALSE !(!(cond)) VAL [\old(cond)=1, \old(counter)=0, cond=1, counter=1] [L36] RET __VERIFIER_assert(q == 0) VAL [\old(counter)=0, A=4294967297, B=4294967297, counter=1, d=4294967297, p=1, q=0, r=4294967297] [L37] CALL __VERIFIER_assert(r == A) VAL [\old(cond)=1, \old(counter)=0, counter=1] [L15] COND FALSE !(!(cond)) VAL [\old(cond)=1, \old(counter)=0, cond=1, counter=1] [L37] RET __VERIFIER_assert(r == A) VAL [\old(counter)=0, A=4294967297, B=4294967297, counter=1, d=4294967297, p=1, q=0, r=4294967297] [L38] CALL __VERIFIER_assert(d == B * p) VAL [\old(cond)=1, \old(counter)=0, counter=1] [L15] COND FALSE !(!(cond)) VAL [\old(cond)=1, \old(counter)=0, cond=1, counter=1] [L38] RET __VERIFIER_assert(d == B * p) VAL [\old(counter)=0, A=4294967297, B=4294967297, counter=1, d=4294967297, p=1, q=0, r=4294967297] [L39] COND FALSE !(!(r >= d)) [L41] d = 2 * d [L42] p = 2 * p VAL [\old(counter)=0, A=4294967297, B=4294967297, counter=1, d=8589934594, p=2, q=0, r=4294967297] [L35] EXPR counter++ VAL [\old(counter)=0, A=4294967297, B=4294967297, counter=2, counter++=1, d=8589934594, p=2, q=0, r=4294967297] [L35] COND FALSE !(counter++<1) [L45] EXPR counter++ VAL [\old(counter)=0, A=4294967297, B=4294967297, counter=3, counter++=2, d=8589934594, p=2, q=0, r=4294967297] [L45] COND FALSE !(counter++<1) [L59] CALL __VERIFIER_assert(A == d*q + r) VAL [\old(cond)=1, \old(counter)=0, counter=3] [L15] COND FALSE !(!(cond)) VAL [\old(cond)=1, \old(counter)=0, cond=1, counter=3] [L59] RET __VERIFIER_assert(A == d*q + r) VAL [\old(counter)=0, A=4294967297, B=4294967297, counter=3, d=8589934594, p=2, q=0, r=4294967297] [L60] CALL __VERIFIER_assert(B == d) VAL [\old(cond)=0, \old(counter)=0, counter=3] [L15] COND TRUE !(cond) VAL [\old(cond)=0, \old(counter)=0, cond=0, counter=3] [L17] reach_error() VAL [\old(cond)=0, \old(counter)=0, cond=0, counter=3] - StatisticsResult: Ultimate Automizer benchmark data CFG has 6 procedures, 40 locations, 1 error locations. Started 1 CEGAR loops. OverallTime: 6.6s, OverallIterations: 7, TraceHistogramMax: 5, PathProgramHistogramMax: 1, EmptinessCheckTime: 0.0s, AutomataDifference: 4.0s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 0.0s, PartialOrderReductionTime: 0.0s, HoareTripleCheckerStatistics: 1 mSolverCounterUnknown, 114 SdHoareTripleChecker+Valid, 2.6s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 90 mSDsluCounter, 599 SdHoareTripleChecker+Invalid, 2.4s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 355 mSDsCounter, 48 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 362 IncrementalHoareTripleChecker+Invalid, 411 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 48 mSolverCounterUnsat, 244 mSDtfsCounter, 362 mSolverCounterSat, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 118 GetRequests, 90 SyntacticMatches, 0 SemanticMatches, 28 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 12 ImplicationChecksByTransitivity, 0.1s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=66occurred in iteration=6, InterpolantAutomatonStates: 34, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s DumpTime, AutomataMinimizationStatistics: 0.2s AutomataMinimizationTime, 6 MinimizatonAttempts, 26 StatesRemovedByMinimization, 4 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.0s SsaConstructionTime, 0.1s SatisfiabilityAnalysisTime, 1.0s InterpolantComputationTime, 186 NumberOfCodeBlocks, 186 NumberOfCodeBlocksAsserted, 7 NumberOfCheckSat, 137 ConstructedInterpolants, 0 QuantifiedInterpolants, 346 SizeOfPredicates, 4 NumberOfNonLiveVariables, 302 ConjunctsInSsa, 22 ConjunctsInUnsatCore, 6 InterpolantComputations, 6 PerfectInterpolantSequences, 28/28 InterpolantCoveringCapability, INVARIANT_SYNTHESIS: No data available, INTERPOLANT_CONSOLIDATION: No data available, ABSTRACT_INTERPRETATION: No data available, PDR: No data available, ACCELERATED_INTERPOLATION: No data available, SIFA: No data available, ReuseStatistics: No data available RESULT: Ultimate proved your program to be incorrect! [2022-04-14 16:27:33,866 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (1)] Forceful destruction successful, exit code 0 Received shutdown request...