/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/automizer/acceleratedInterpolation/acceleratedInterpolationJordan_32.epf -i ../../../trunk/examples/svcomp/nla-digbench-scaling/divbin_unwindbound1.i -------------------------------------------------------------------------------- This is Ultimate 0.2.2-dev-34549b5 [2022-04-08 05:13:54,793 INFO L177 SettingsManager]: Resetting all preferences to default values... [2022-04-08 05:13:54,795 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2022-04-08 05:13:54,820 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2022-04-08 05:13:54,821 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2022-04-08 05:13:54,822 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2022-04-08 05:13:54,823 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2022-04-08 05:13:54,825 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2022-04-08 05:13:54,826 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2022-04-08 05:13:54,827 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2022-04-08 05:13:54,828 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2022-04-08 05:13:54,829 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2022-04-08 05:13:54,829 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2022-04-08 05:13:54,830 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2022-04-08 05:13:54,831 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2022-04-08 05:13:54,832 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2022-04-08 05:13:54,832 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2022-04-08 05:13:54,833 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2022-04-08 05:13:54,834 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2022-04-08 05:13:54,836 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2022-04-08 05:13:54,837 INFO L181 SettingsManager]: Resetting HornVerifier preferences to default values [2022-04-08 05:13:54,843 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2022-04-08 05:13:54,846 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2022-04-08 05:13:54,848 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2022-04-08 05:13:54,851 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2022-04-08 05:13:54,854 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2022-04-08 05:13:54,855 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2022-04-08 05:13:54,855 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2022-04-08 05:13:54,856 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2022-04-08 05:13:54,856 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2022-04-08 05:13:54,857 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2022-04-08 05:13:54,857 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2022-04-08 05:13:54,858 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2022-04-08 05:13:54,859 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2022-04-08 05:13:54,860 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2022-04-08 05:13:54,860 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2022-04-08 05:13:54,861 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2022-04-08 05:13:54,861 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2022-04-08 05:13:54,861 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2022-04-08 05:13:54,862 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2022-04-08 05:13:54,862 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2022-04-08 05:13:54,863 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2022-04-08 05:13:54,864 INFO L101 SettingsManager]: Beginning loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/settings/automizer/acceleratedInterpolation/acceleratedInterpolationJordan_32.epf [2022-04-08 05:13:54,871 INFO L113 SettingsManager]: Loading preferences was successful [2022-04-08 05:13:54,871 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2022-04-08 05:13:54,873 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2022-04-08 05:13:54,873 INFO L138 SettingsManager]: * sizeof long=4 [2022-04-08 05:13:54,873 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2022-04-08 05:13:54,873 INFO L138 SettingsManager]: * sizeof POINTER=4 [2022-04-08 05:13:54,874 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2022-04-08 05:13:54,874 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2022-04-08 05:13:54,874 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2022-04-08 05:13:54,874 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2022-04-08 05:13:54,874 INFO L138 SettingsManager]: * sizeof long double=12 [2022-04-08 05:13:54,874 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2022-04-08 05:13:54,875 INFO L138 SettingsManager]: * Use constant arrays=true [2022-04-08 05:13:54,875 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2022-04-08 05:13:54,875 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2022-04-08 05:13:54,875 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2022-04-08 05:13:54,875 INFO L138 SettingsManager]: * To the following directory=./dump/ [2022-04-08 05:13:54,875 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2022-04-08 05:13:54,876 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-04-08 05:13:54,876 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2022-04-08 05:13:54,876 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=Craig_NestedInterpolation [2022-04-08 05:13:54,876 INFO L138 SettingsManager]: * Trace refinement strategy=ACCELERATED_INTERPOLATION [2022-04-08 05:13:54,876 INFO L138 SettingsManager]: * Trace refinement strategy used in Accelerated Interpolation=CAMEL [2022-04-08 05:13:54,876 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2022-04-08 05:13:54,877 INFO L138 SettingsManager]: * Loop acceleration method that is used by accelerated interpolation=JORDAN [2022-04-08 05:13:54,877 INFO L138 SettingsManager]: * Use separate solver for trace checks=false 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-08 05:13:55,132 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2022-04-08 05:13:55,157 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2022-04-08 05:13:55,159 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2022-04-08 05:13:55,160 INFO L271 PluginConnector]: Initializing CDTParser... [2022-04-08 05:13:55,161 INFO L275 PluginConnector]: CDTParser initialized [2022-04-08 05:13:55,162 INFO L432 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/nla-digbench-scaling/divbin_unwindbound1.i [2022-04-08 05:13:55,219 INFO L220 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/b932814a7/c58ffa5fe8604d699867cef63b18f813/FLAG66b5e0dde [2022-04-08 05:13:55,636 INFO L306 CDTParser]: Found 1 translation units. [2022-04-08 05:13:55,636 INFO L160 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/nla-digbench-scaling/divbin_unwindbound1.i [2022-04-08 05:13:55,641 INFO L349 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/b932814a7/c58ffa5fe8604d699867cef63b18f813/FLAG66b5e0dde [2022-04-08 05:13:56,038 INFO L357 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/b932814a7/c58ffa5fe8604d699867cef63b18f813 [2022-04-08 05:13:56,040 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2022-04-08 05:13:56,041 INFO L131 ToolchainWalker]: Walking toolchain with 4 elements. [2022-04-08 05:13:56,043 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2022-04-08 05:13:56,043 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2022-04-08 05:13:56,046 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2022-04-08 05:13:56,047 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 08.04 05:13:56" (1/1) ... [2022-04-08 05:13:56,048 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@3f2dcd65 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.04 05:13:56, skipping insertion in model container [2022-04-08 05:13:56,048 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 08.04 05:13:56" (1/1) ... [2022-04-08 05:13:56,055 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2022-04-08 05:13:56,072 INFO L178 MainTranslator]: Built tables and reachable declarations [2022-04-08 05:13:56,231 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/trunk/examples/svcomp/nla-digbench-scaling/divbin_unwindbound1.i[950,963] [2022-04-08 05:13:56,247 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-04-08 05:13:56,259 INFO L203 MainTranslator]: Completed pre-run [2022-04-08 05:13:56,271 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/trunk/examples/svcomp/nla-digbench-scaling/divbin_unwindbound1.i[950,963] [2022-04-08 05:13:56,277 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-04-08 05:13:56,289 INFO L208 MainTranslator]: Completed translation [2022-04-08 05:13:56,290 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.04 05:13:56 WrapperNode [2022-04-08 05:13:56,290 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2022-04-08 05:13:56,291 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2022-04-08 05:13:56,291 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2022-04-08 05:13:56,291 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2022-04-08 05:13:56,301 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.04 05:13:56" (1/1) ... [2022-04-08 05:13:56,301 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.04 05:13:56" (1/1) ... [2022-04-08 05:13:56,307 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.04 05:13:56" (1/1) ... [2022-04-08 05:13:56,307 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.04 05:13:56" (1/1) ... [2022-04-08 05:13:56,313 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.04 05:13:56" (1/1) ... [2022-04-08 05:13:56,324 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.04 05:13:56" (1/1) ... [2022-04-08 05:13:56,330 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.04 05:13:56" (1/1) ... [2022-04-08 05:13:56,332 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2022-04-08 05:13:56,333 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2022-04-08 05:13:56,333 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2022-04-08 05:13:56,333 INFO L275 PluginConnector]: RCFGBuilder initialized [2022-04-08 05:13:56,336 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.04 05:13:56" (1/1) ... [2022-04-08 05:13:56,345 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-04-08 05:13:56,356 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-04-08 05:13:56,372 INFO L229 MonitoredProcess]: Starting monitored process 1 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (exit command is (exit), workingDir is null) [2022-04-08 05:13:56,375 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-08 05:13:56,400 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.init [2022-04-08 05:13:56,401 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2022-04-08 05:13:56,401 INFO L138 BoogieDeclarations]: Found implementation of procedure reach_error [2022-04-08 05:13:56,401 INFO L138 BoogieDeclarations]: Found implementation of procedure assume_abort_if_not [2022-04-08 05:13:56,401 INFO L138 BoogieDeclarations]: Found implementation of procedure __VERIFIER_assert [2022-04-08 05:13:56,401 INFO L138 BoogieDeclarations]: Found implementation of procedure main [2022-04-08 05:13:56,401 INFO L130 BoogieDeclarations]: Found specification of procedure abort [2022-04-08 05:13:56,401 INFO L130 BoogieDeclarations]: Found specification of procedure __assert_fail [2022-04-08 05:13:56,401 INFO L130 BoogieDeclarations]: Found specification of procedure __assert_perror_fail [2022-04-08 05:13:56,401 INFO L130 BoogieDeclarations]: Found specification of procedure __assert [2022-04-08 05:13:56,401 INFO L130 BoogieDeclarations]: Found specification of procedure reach_error [2022-04-08 05:13:56,401 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2022-04-08 05:13:56,401 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_nondet_uint [2022-04-08 05:13:56,402 INFO L130 BoogieDeclarations]: Found specification of procedure assume_abort_if_not [2022-04-08 05:13:56,402 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_assert [2022-04-08 05:13:56,402 INFO L130 BoogieDeclarations]: Found specification of procedure main [2022-04-08 05:13:56,402 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.init [2022-04-08 05:13:56,402 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2022-04-08 05:13:56,402 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2022-04-08 05:13:56,402 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2022-04-08 05:13:56,402 INFO L130 BoogieDeclarations]: Found specification of procedure read~int [2022-04-08 05:13:56,402 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2022-04-08 05:13:56,459 INFO L234 CfgBuilder]: Building ICFG [2022-04-08 05:13:56,461 INFO L260 CfgBuilder]: Building CFG for each procedure with an implementation [2022-04-08 05:13:56,607 INFO L275 CfgBuilder]: Performing block encoding [2022-04-08 05:13:56,613 INFO L294 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2022-04-08 05:13:56,614 INFO L299 CfgBuilder]: Removed 2 assume(true) statements. [2022-04-08 05:13:56,616 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 08.04 05:13:56 BoogieIcfgContainer [2022-04-08 05:13:56,616 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2022-04-08 05:13:56,617 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2022-04-08 05:13:56,617 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2022-04-08 05:13:56,621 INFO L275 PluginConnector]: TraceAbstraction initialized [2022-04-08 05:13:56,621 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 08.04 05:13:56" (1/3) ... [2022-04-08 05:13:56,622 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@65fe99f3 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 08.04 05:13:56, skipping insertion in model container [2022-04-08 05:13:56,622 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.04 05:13:56" (2/3) ... [2022-04-08 05:13:56,622 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@65fe99f3 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 08.04 05:13:56, skipping insertion in model container [2022-04-08 05:13:56,622 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 08.04 05:13:56" (3/3) ... [2022-04-08 05:13:56,623 INFO L111 eAbstractionObserver]: Analyzing ICFG divbin_unwindbound1.i [2022-04-08 05:13:56,628 INFO L203 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:Craig_NestedInterpolation Determinization: PREDICATE_ABSTRACTION [2022-04-08 05:13:56,629 INFO L162 ceAbstractionStarter]: Applying trace abstraction to program that has 1 error locations. [2022-04-08 05:13:56,703 INFO L339 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2022-04-08 05:13:56,709 INFO L340 AbstractCegarLoop]: Settings: SEPARATE_VIOLATION_CHECK=true, mInterprocedural=true, mMaxIterations=1000000, mWatchIteration=1000000, mArtifact=RCFG, mInterpolation=Craig_NestedInterpolation, mInterpolantAutomaton=STRAIGHT_LINE, mDumpAutomata=false, mAutomataFormat=ATS_NUMERATE, mDumpPath=., mDeterminiation=PREDICATE_ABSTRACTION, mMinimize=MINIMIZE_SEVPA, mHoare=true, mAutomataTypeConcurrency=FINITE_AUTOMATA, mHoareTripleChecks=INCREMENTAL, mHoareAnnotationPositions=All, 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-08 05:13:56,709 INFO L341 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2022-04-08 05:13:56,752 INFO L276 IsEmpty]: Start isEmpty. Operand has 33 states, 21 states have (on average 1.4761904761904763) internal successors, (31), 22 states have internal predecessors, (31), 6 states have call successors, (6), 4 states have call predecessors, (6), 4 states have return successors, (6), 6 states have call predecessors, (6), 6 states have call successors, (6) [2022-04-08 05:13:56,761 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 24 [2022-04-08 05:13:56,762 INFO L491 BasicCegarLoop]: Found error trace [2022-04-08 05:13:56,763 INFO L499 BasicCegarLoop]: trace histogram [2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-08 05:13:56,764 INFO L403 AbstractCegarLoop]: === Iteration 1 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-08 05:13:56,774 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-08 05:13:56,775 INFO L85 PathProgramCache]: Analyzing trace with hash 878397729, now seen corresponding path program 1 times [2022-04-08 05:13:56,783 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION [2022-04-08 05:13:56,784 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [550268098] [2022-04-08 05:13:56,798 INFO L202 tedInterpolationCore]: No loops in this trace, falling back to nested interpolation [2022-04-08 05:13:56,798 INFO L85 PathProgramCache]: Analyzing trace with hash 878397729, now seen corresponding path program 2 times [2022-04-08 05:13:56,802 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-08 05:13:56,803 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [94874719] [2022-04-08 05:13:56,803 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-08 05:13:56,804 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-08 05:13:56,941 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-08 05:13:57,041 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-04-08 05:13:57,045 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-08 05:13:57,066 INFO L290 TraceCheckUtils]: 0: Hoare triple {49#(and (= ~counter~0 |old(~counter~0)|) (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(9, 2);~counter~0 := 0; {36#true} is VALID [2022-04-08 05:13:57,067 INFO L290 TraceCheckUtils]: 1: Hoare triple {36#true} assume true; {36#true} is VALID [2022-04-08 05:13:57,067 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {36#true} {36#true} #89#return; {36#true} is VALID [2022-04-08 05:13:57,068 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2022-04-08 05:13:57,084 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-08 05:13:57,096 INFO L290 TraceCheckUtils]: 0: Hoare triple {36#true} ~cond := #in~cond; {36#true} is VALID [2022-04-08 05:13:57,097 INFO L290 TraceCheckUtils]: 1: Hoare triple {36#true} assume 0 == ~cond;assume false; {37#false} is VALID [2022-04-08 05:13:57,097 INFO L290 TraceCheckUtils]: 2: Hoare triple {37#false} assume true; {37#false} is VALID [2022-04-08 05:13:57,098 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {37#false} {36#true} #81#return; {37#false} is VALID [2022-04-08 05:13:57,098 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2022-04-08 05:13:57,100 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-08 05:13:57,110 INFO L290 TraceCheckUtils]: 0: Hoare triple {36#true} ~cond := #in~cond; {36#true} is VALID [2022-04-08 05:13:57,111 INFO L290 TraceCheckUtils]: 1: Hoare triple {36#true} assume 0 == ~cond;assume false; {37#false} is VALID [2022-04-08 05:13:57,111 INFO L290 TraceCheckUtils]: 2: Hoare triple {37#false} assume true; {37#false} is VALID [2022-04-08 05:13:57,112 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {37#false} {37#false} #83#return; {37#false} is VALID [2022-04-08 05:13:57,114 INFO L272 TraceCheckUtils]: 0: Hoare triple {36#true} call ULTIMATE.init(); {49#(and (= ~counter~0 |old(~counter~0)|) (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} is VALID [2022-04-08 05:13:57,114 INFO L290 TraceCheckUtils]: 1: Hoare triple {49#(and (= ~counter~0 |old(~counter~0)|) (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(9, 2);~counter~0 := 0; {36#true} is VALID [2022-04-08 05:13:57,114 INFO L290 TraceCheckUtils]: 2: Hoare triple {36#true} assume true; {36#true} is VALID [2022-04-08 05:13:57,115 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {36#true} {36#true} #89#return; {36#true} is VALID [2022-04-08 05:13:57,115 INFO L272 TraceCheckUtils]: 4: Hoare triple {36#true} call #t~ret5 := main(); {36#true} is VALID [2022-04-08 05:13:57,116 INFO L290 TraceCheckUtils]: 5: Hoare triple {36#true} havoc ~A~0;havoc ~B~0;havoc ~q~0;havoc ~r~0;havoc ~b~0;~A~0 := #t~nondet1;havoc #t~nondet1;~B~0 := #t~nondet2;havoc #t~nondet2; {36#true} is VALID [2022-04-08 05:13:57,116 INFO L272 TraceCheckUtils]: 6: Hoare triple {36#true} call assume_abort_if_not((if ~B~0 % 4294967296 < 2147483647 then 1 else 0)); {36#true} is VALID [2022-04-08 05:13:57,116 INFO L290 TraceCheckUtils]: 7: Hoare triple {36#true} ~cond := #in~cond; {36#true} is VALID [2022-04-08 05:13:57,117 INFO L290 TraceCheckUtils]: 8: Hoare triple {36#true} assume 0 == ~cond;assume false; {37#false} is VALID [2022-04-08 05:13:57,117 INFO L290 TraceCheckUtils]: 9: Hoare triple {37#false} assume true; {37#false} is VALID [2022-04-08 05:13:57,117 INFO L284 TraceCheckUtils]: 10: Hoare quadruple {37#false} {36#true} #81#return; {37#false} is VALID [2022-04-08 05:13:57,119 INFO L272 TraceCheckUtils]: 11: Hoare triple {37#false} call assume_abort_if_not((if ~B~0 % 4294967296 >= 1 then 1 else 0)); {36#true} is VALID [2022-04-08 05:13:57,119 INFO L290 TraceCheckUtils]: 12: Hoare triple {36#true} ~cond := #in~cond; {36#true} is VALID [2022-04-08 05:13:57,120 INFO L290 TraceCheckUtils]: 13: Hoare triple {36#true} assume 0 == ~cond;assume false; {37#false} is VALID [2022-04-08 05:13:57,120 INFO L290 TraceCheckUtils]: 14: Hoare triple {37#false} assume true; {37#false} is VALID [2022-04-08 05:13:57,120 INFO L284 TraceCheckUtils]: 15: Hoare quadruple {37#false} {37#false} #83#return; {37#false} is VALID [2022-04-08 05:13:57,120 INFO L290 TraceCheckUtils]: 16: Hoare triple {37#false} ~q~0 := 0;~r~0 := ~A~0;~b~0 := ~B~0; {37#false} is VALID [2022-04-08 05:13:57,121 INFO L290 TraceCheckUtils]: 17: Hoare triple {37#false} assume !true; {37#false} is VALID [2022-04-08 05:13:57,121 INFO L290 TraceCheckUtils]: 18: Hoare triple {37#false} assume !true; {37#false} is VALID [2022-04-08 05:13:57,122 INFO L272 TraceCheckUtils]: 19: Hoare triple {37#false} call __VERIFIER_assert((if ~A~0 % 4294967296 == (~q~0 * ~b~0 + ~r~0) % 4294967296 then 1 else 0)); {37#false} is VALID [2022-04-08 05:13:57,123 INFO L290 TraceCheckUtils]: 20: Hoare triple {37#false} ~cond := #in~cond; {37#false} is VALID [2022-04-08 05:13:57,123 INFO L290 TraceCheckUtils]: 21: Hoare triple {37#false} assume 0 == ~cond; {37#false} is VALID [2022-04-08 05:13:57,123 INFO L290 TraceCheckUtils]: 22: Hoare triple {37#false} assume !false; {37#false} is VALID [2022-04-08 05:13:57,124 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2022-04-08 05:13:57,125 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-08 05:13:57,125 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [94874719] [2022-04-08 05:13:57,126 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [94874719] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-08 05:13:57,126 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-08 05:13:57,127 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-04-08 05:13:57,131 INFO L136 FreeRefinementEngine]: Strategy ACCELERATED_INTERPOLATION found an infeasible trace [2022-04-08 05:13:57,131 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleAcceleratedInterpolation [550268098] [2022-04-08 05:13:57,132 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleAcceleratedInterpolation [550268098] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-08 05:13:57,133 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-08 05:13:57,133 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-04-08 05:13:57,133 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1204771500] [2022-04-08 05:13:57,134 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-08 05:13:57,140 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 4.0) internal successors, (12), 2 states have internal predecessors, (12), 2 states have call successors, (5), 3 states have call predecessors, (5), 2 states have return successors, (3), 2 states have call predecessors, (3), 2 states have call successors, (3) Word has length 23 [2022-04-08 05:13:57,143 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-08 05:13:57,146 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with has 3 states, 3 states have (on average 4.0) internal successors, (12), 2 states have internal predecessors, (12), 2 states have call successors, (5), 3 states have call predecessors, (5), 2 states have return successors, (3), 2 states have call predecessors, (3), 2 states have call successors, (3) [2022-04-08 05:13:57,187 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-08 05:13:57,188 INFO L554 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-04-08 05:13:57,188 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy ACCELERATED_INTERPOLATION [2022-04-08 05:13:57,219 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-04-08 05:13:57,220 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-04-08 05:13:57,223 INFO L87 Difference]: Start difference. First operand has 33 states, 21 states have (on average 1.4761904761904763) internal successors, (31), 22 states have internal predecessors, (31), 6 states have call successors, (6), 4 states have call predecessors, (6), 4 states have return successors, (6), 6 states have call predecessors, (6), 6 states have call successors, (6) Second operand has 3 states, 3 states have (on average 4.0) internal successors, (12), 2 states have internal predecessors, (12), 2 states have call successors, (5), 3 states have call predecessors, (5), 2 states have return successors, (3), 2 states have call predecessors, (3), 2 states have call successors, (3) [2022-04-08 05:13:57,408 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-08 05:13:57,408 INFO L93 Difference]: Finished difference Result 60 states and 84 transitions. [2022-04-08 05:13:57,408 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-04-08 05:13:57,409 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 4.0) internal successors, (12), 2 states have internal predecessors, (12), 2 states have call successors, (5), 3 states have call predecessors, (5), 2 states have return successors, (3), 2 states have call predecessors, (3), 2 states have call successors, (3) Word has length 23 [2022-04-08 05:13:57,409 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-08 05:13:57,411 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3 states, 3 states have (on average 4.0) internal successors, (12), 2 states have internal predecessors, (12), 2 states have call successors, (5), 3 states have call predecessors, (5), 2 states have return successors, (3), 2 states have call predecessors, (3), 2 states have call successors, (3) [2022-04-08 05:13:57,420 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 84 transitions. [2022-04-08 05:13:57,420 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3 states, 3 states have (on average 4.0) internal successors, (12), 2 states have internal predecessors, (12), 2 states have call successors, (5), 3 states have call predecessors, (5), 2 states have return successors, (3), 2 states have call predecessors, (3), 2 states have call successors, (3) [2022-04-08 05:13:57,425 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 84 transitions. [2022-04-08 05:13:57,425 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 3 states and 84 transitions. [2022-04-08 05:13:57,558 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 84 edges. 84 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-08 05:13:57,566 INFO L225 Difference]: With dead ends: 60 [2022-04-08 05:13:57,566 INFO L226 Difference]: Without dead ends: 29 [2022-04-08 05:13:57,569 INFO L912 BasicCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 9 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-04-08 05:13:57,572 INFO L913 BasicCegarLoop]: 36 mSDtfsCounter, 10 mSDsluCounter, 4 mSDsCounter, 0 mSdLazyCounter, 20 mSolverCounterSat, 5 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 12 SdHoareTripleChecker+Valid, 40 SdHoareTripleChecker+Invalid, 25 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 5 IncrementalHoareTripleChecker+Valid, 20 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-04-08 05:13:57,573 INFO L914 BasicCegarLoop]: SdHoareTripleChecker [12 Valid, 40 Invalid, 25 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [5 Valid, 20 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-04-08 05:13:57,587 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 29 states. [2022-04-08 05:13:57,601 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 29 to 28. [2022-04-08 05:13:57,602 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-08 05:13:57,602 INFO L82 GeneralOperation]: Start isEquivalent. First operand 29 states. Second operand has 28 states, 18 states have (on average 1.3333333333333333) internal successors, (24), 19 states have internal predecessors, (24), 6 states have call successors, (6), 4 states have call predecessors, (6), 3 states have return successors, (4), 4 states have call predecessors, (4), 4 states have call successors, (4) [2022-04-08 05:13:57,603 INFO L74 IsIncluded]: Start isIncluded. First operand 29 states. Second operand has 28 states, 18 states have (on average 1.3333333333333333) internal successors, (24), 19 states have internal predecessors, (24), 6 states have call successors, (6), 4 states have call predecessors, (6), 3 states have return successors, (4), 4 states have call predecessors, (4), 4 states have call successors, (4) [2022-04-08 05:13:57,603 INFO L87 Difference]: Start difference. First operand 29 states. Second operand has 28 states, 18 states have (on average 1.3333333333333333) internal successors, (24), 19 states have internal predecessors, (24), 6 states have call successors, (6), 4 states have call predecessors, (6), 3 states have return successors, (4), 4 states have call predecessors, (4), 4 states have call successors, (4) [2022-04-08 05:13:57,607 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-08 05:13:57,608 INFO L93 Difference]: Finished difference Result 29 states and 35 transitions. [2022-04-08 05:13:57,608 INFO L276 IsEmpty]: Start isEmpty. Operand 29 states and 35 transitions. [2022-04-08 05:13:57,608 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-08 05:13:57,609 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-08 05:13:57,609 INFO L74 IsIncluded]: Start isIncluded. First operand has 28 states, 18 states have (on average 1.3333333333333333) internal successors, (24), 19 states have internal predecessors, (24), 6 states have call successors, (6), 4 states have call predecessors, (6), 3 states have return successors, (4), 4 states have call predecessors, (4), 4 states have call successors, (4) Second operand 29 states. [2022-04-08 05:13:57,610 INFO L87 Difference]: Start difference. First operand has 28 states, 18 states have (on average 1.3333333333333333) internal successors, (24), 19 states have internal predecessors, (24), 6 states have call successors, (6), 4 states have call predecessors, (6), 3 states have return successors, (4), 4 states have call predecessors, (4), 4 states have call successors, (4) Second operand 29 states. [2022-04-08 05:13:57,613 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-08 05:13:57,613 INFO L93 Difference]: Finished difference Result 29 states and 35 transitions. [2022-04-08 05:13:57,613 INFO L276 IsEmpty]: Start isEmpty. Operand 29 states and 35 transitions. [2022-04-08 05:13:57,614 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-08 05:13:57,614 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-08 05:13:57,614 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-08 05:13:57,614 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-08 05:13:57,615 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 28 states, 18 states have (on average 1.3333333333333333) internal successors, (24), 19 states have internal predecessors, (24), 6 states have call successors, (6), 4 states have call predecessors, (6), 3 states have return successors, (4), 4 states have call predecessors, (4), 4 states have call successors, (4) [2022-04-08 05:13:57,617 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 28 states to 28 states and 34 transitions. [2022-04-08 05:13:57,618 INFO L78 Accepts]: Start accepts. Automaton has 28 states and 34 transitions. Word has length 23 [2022-04-08 05:13:57,619 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-08 05:13:57,619 INFO L478 AbstractCegarLoop]: Abstraction has 28 states and 34 transitions. [2022-04-08 05:13:57,619 INFO L479 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 4.0) internal successors, (12), 2 states have internal predecessors, (12), 2 states have call successors, (5), 3 states have call predecessors, (5), 2 states have return successors, (3), 2 states have call predecessors, (3), 2 states have call successors, (3) [2022-04-08 05:13:57,619 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 28 states and 34 transitions. [2022-04-08 05:13:57,654 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 34 edges. 34 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-08 05:13:57,655 INFO L276 IsEmpty]: Start isEmpty. Operand 28 states and 34 transitions. [2022-04-08 05:13:57,655 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2022-04-08 05:13:57,656 INFO L491 BasicCegarLoop]: Found error trace [2022-04-08 05:13:57,656 INFO L499 BasicCegarLoop]: trace histogram [2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-08 05:13:57,656 WARN L460 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2022-04-08 05:13:57,656 INFO L403 AbstractCegarLoop]: === Iteration 2 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-08 05:13:57,657 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-08 05:13:57,657 INFO L85 PathProgramCache]: Analyzing trace with hash 994169231, now seen corresponding path program 1 times [2022-04-08 05:13:57,657 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION [2022-04-08 05:13:57,657 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [804094677] [2022-04-08 05:13:57,658 INFO L202 tedInterpolationCore]: No loops in this trace, falling back to nested interpolation [2022-04-08 05:13:57,658 INFO L85 PathProgramCache]: Analyzing trace with hash 994169231, now seen corresponding path program 2 times [2022-04-08 05:13:57,658 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-08 05:13:57,659 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [997249071] [2022-04-08 05:13:57,659 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-08 05:13:57,659 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-08 05:13:57,678 ERROR L245 FreeRefinementEngine]: Caught known exception: Unsupported non-linear arithmetic [2022-04-08 05:13:57,679 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [1580853281] [2022-04-08 05:13:57,679 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2022-04-08 05:13:57,679 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-08 05:13:57,679 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-04-08 05:13:57,681 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-08 05:13:57,686 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-08 05:13:57,752 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s) [2022-04-08 05:13:57,752 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-04-08 05:13:57,754 INFO L263 TraceCheckSpWp]: Trace formula consists of 81 conjuncts, 5 conjunts are in the unsatisfiable core [2022-04-08 05:13:57,770 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-08 05:13:57,773 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-04-08 05:13:57,966 INFO L272 TraceCheckUtils]: 0: Hoare triple {286#true} call ULTIMATE.init(); {286#true} is VALID [2022-04-08 05:13:57,967 INFO L290 TraceCheckUtils]: 1: Hoare triple {286#true} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(9, 2);~counter~0 := 0; {294#(<= ~counter~0 0)} is VALID [2022-04-08 05:13:57,968 INFO L290 TraceCheckUtils]: 2: Hoare triple {294#(<= ~counter~0 0)} assume true; {294#(<= ~counter~0 0)} is VALID [2022-04-08 05:13:57,968 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {294#(<= ~counter~0 0)} {286#true} #89#return; {294#(<= ~counter~0 0)} is VALID [2022-04-08 05:13:57,969 INFO L272 TraceCheckUtils]: 4: Hoare triple {294#(<= ~counter~0 0)} call #t~ret5 := main(); {294#(<= ~counter~0 0)} is VALID [2022-04-08 05:13:57,969 INFO L290 TraceCheckUtils]: 5: Hoare triple {294#(<= ~counter~0 0)} havoc ~A~0;havoc ~B~0;havoc ~q~0;havoc ~r~0;havoc ~b~0;~A~0 := #t~nondet1;havoc #t~nondet1;~B~0 := #t~nondet2;havoc #t~nondet2; {294#(<= ~counter~0 0)} is VALID [2022-04-08 05:13:57,970 INFO L272 TraceCheckUtils]: 6: Hoare triple {294#(<= ~counter~0 0)} call assume_abort_if_not((if ~B~0 % 4294967296 < 2147483647 then 1 else 0)); {294#(<= ~counter~0 0)} is VALID [2022-04-08 05:13:57,970 INFO L290 TraceCheckUtils]: 7: Hoare triple {294#(<= ~counter~0 0)} ~cond := #in~cond; {294#(<= ~counter~0 0)} is VALID [2022-04-08 05:13:57,971 INFO L290 TraceCheckUtils]: 8: Hoare triple {294#(<= ~counter~0 0)} assume !(0 == ~cond); {294#(<= ~counter~0 0)} is VALID [2022-04-08 05:13:57,971 INFO L290 TraceCheckUtils]: 9: Hoare triple {294#(<= ~counter~0 0)} assume true; {294#(<= ~counter~0 0)} is VALID [2022-04-08 05:13:57,972 INFO L284 TraceCheckUtils]: 10: Hoare quadruple {294#(<= ~counter~0 0)} {294#(<= ~counter~0 0)} #81#return; {294#(<= ~counter~0 0)} is VALID [2022-04-08 05:13:57,972 INFO L272 TraceCheckUtils]: 11: Hoare triple {294#(<= ~counter~0 0)} call assume_abort_if_not((if ~B~0 % 4294967296 >= 1 then 1 else 0)); {294#(<= ~counter~0 0)} is VALID [2022-04-08 05:13:57,973 INFO L290 TraceCheckUtils]: 12: Hoare triple {294#(<= ~counter~0 0)} ~cond := #in~cond; {294#(<= ~counter~0 0)} is VALID [2022-04-08 05:13:57,973 INFO L290 TraceCheckUtils]: 13: Hoare triple {294#(<= ~counter~0 0)} assume !(0 == ~cond); {294#(<= ~counter~0 0)} is VALID [2022-04-08 05:13:57,974 INFO L290 TraceCheckUtils]: 14: Hoare triple {294#(<= ~counter~0 0)} assume true; {294#(<= ~counter~0 0)} is VALID [2022-04-08 05:13:57,975 INFO L284 TraceCheckUtils]: 15: Hoare quadruple {294#(<= ~counter~0 0)} {294#(<= ~counter~0 0)} #83#return; {294#(<= ~counter~0 0)} is VALID [2022-04-08 05:13:57,975 INFO L290 TraceCheckUtils]: 16: Hoare triple {294#(<= ~counter~0 0)} ~q~0 := 0;~r~0 := ~A~0;~b~0 := ~B~0; {294#(<= ~counter~0 0)} is VALID [2022-04-08 05:13:57,976 INFO L290 TraceCheckUtils]: 17: Hoare triple {294#(<= ~counter~0 0)} #t~post3 := ~counter~0;~counter~0 := 1 + #t~post3; {343#(<= |main_#t~post3| 0)} is VALID [2022-04-08 05:13:57,976 INFO L290 TraceCheckUtils]: 18: Hoare triple {343#(<= |main_#t~post3| 0)} assume !(#t~post3 < 1);havoc #t~post3; {287#false} is VALID [2022-04-08 05:13:57,976 INFO L290 TraceCheckUtils]: 19: Hoare triple {287#false} #t~post4 := ~counter~0;~counter~0 := 1 + #t~post4; {287#false} is VALID [2022-04-08 05:13:57,977 INFO L290 TraceCheckUtils]: 20: Hoare triple {287#false} assume !(#t~post4 < 1);havoc #t~post4; {287#false} is VALID [2022-04-08 05:13:57,977 INFO L272 TraceCheckUtils]: 21: Hoare triple {287#false} call __VERIFIER_assert((if ~A~0 % 4294967296 == (~q~0 * ~b~0 + ~r~0) % 4294967296 then 1 else 0)); {287#false} is VALID [2022-04-08 05:13:57,977 INFO L290 TraceCheckUtils]: 22: Hoare triple {287#false} ~cond := #in~cond; {287#false} is VALID [2022-04-08 05:13:57,977 INFO L290 TraceCheckUtils]: 23: Hoare triple {287#false} assume 0 == ~cond; {287#false} is VALID [2022-04-08 05:13:57,977 INFO L290 TraceCheckUtils]: 24: Hoare triple {287#false} assume !false; {287#false} is VALID [2022-04-08 05:13:57,978 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2022-04-08 05:13:57,978 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-04-08 05:13:57,978 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-08 05:13:57,978 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [997249071] [2022-04-08 05:13:57,979 WARN L310 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2022-04-08 05:13:57,979 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1580853281] [2022-04-08 05:13:57,979 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1580853281] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-08 05:13:57,979 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-08 05:13:57,979 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-04-08 05:13:57,980 INFO L136 FreeRefinementEngine]: Strategy ACCELERATED_INTERPOLATION found an infeasible trace [2022-04-08 05:13:57,980 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleAcceleratedInterpolation [804094677] [2022-04-08 05:13:57,980 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleAcceleratedInterpolation [804094677] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-08 05:13:57,981 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-08 05:13:57,981 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-04-08 05:13:57,981 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [663629683] [2022-04-08 05:13:57,981 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-08 05:13:57,982 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 3.5) internal successors, (14), 3 states have internal predecessors, (14), 3 states have call successors, (5), 3 states have call predecessors, (5), 1 states have return successors, (3), 1 states have call predecessors, (3), 2 states have call successors, (3) Word has length 25 [2022-04-08 05:13:57,982 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-08 05:13:57,982 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with has 4 states, 4 states have (on average 3.5) internal successors, (14), 3 states have internal predecessors, (14), 3 states have call successors, (5), 3 states have call predecessors, (5), 1 states have return successors, (3), 1 states have call predecessors, (3), 2 states have call successors, (3) [2022-04-08 05:13:58,001 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 22 edges. 22 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-08 05:13:58,001 INFO L554 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-04-08 05:13:58,002 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy ACCELERATED_INTERPOLATION [2022-04-08 05:13:58,002 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-04-08 05:13:58,002 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-04-08 05:13:58,003 INFO L87 Difference]: Start difference. First operand 28 states and 34 transitions. Second operand has 4 states, 4 states have (on average 3.5) internal successors, (14), 3 states have internal predecessors, (14), 3 states have call successors, (5), 3 states have call predecessors, (5), 1 states have return successors, (3), 1 states have call predecessors, (3), 2 states have call successors, (3) [2022-04-08 05:13:58,096 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-08 05:13:58,097 INFO L93 Difference]: Finished difference Result 42 states and 52 transitions. [2022-04-08 05:13:58,097 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-04-08 05:13:58,097 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 3.5) internal successors, (14), 3 states have internal predecessors, (14), 3 states have call successors, (5), 3 states have call predecessors, (5), 1 states have return successors, (3), 1 states have call predecessors, (3), 2 states have call successors, (3) Word has length 25 [2022-04-08 05:13:58,098 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-08 05:13:58,098 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 4 states, 4 states have (on average 3.5) internal successors, (14), 3 states have internal predecessors, (14), 3 states have call successors, (5), 3 states have call predecessors, (5), 1 states have return successors, (3), 1 states have call predecessors, (3), 2 states have call successors, (3) [2022-04-08 05:13:58,101 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 52 transitions. [2022-04-08 05:13:58,101 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 4 states, 4 states have (on average 3.5) internal successors, (14), 3 states have internal predecessors, (14), 3 states have call successors, (5), 3 states have call predecessors, (5), 1 states have return successors, (3), 1 states have call predecessors, (3), 2 states have call successors, (3) [2022-04-08 05:13:58,103 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 52 transitions. [2022-04-08 05:13:58,103 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 4 states and 52 transitions. [2022-04-08 05:13:58,152 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 52 edges. 52 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-08 05:13:58,154 INFO L225 Difference]: With dead ends: 42 [2022-04-08 05:13:58,154 INFO L226 Difference]: Without dead ends: 30 [2022-04-08 05:13:58,155 INFO L912 BasicCegarLoop]: 0 DeclaredPredicates, 24 GetRequests, 22 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-04-08 05:13:58,156 INFO L913 BasicCegarLoop]: 32 mSDtfsCounter, 0 mSDsluCounter, 49 mSDsCounter, 0 mSdLazyCounter, 8 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 81 SdHoareTripleChecker+Invalid, 8 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 8 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-04-08 05:13:58,157 INFO L914 BasicCegarLoop]: SdHoareTripleChecker [0 Valid, 81 Invalid, 8 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 8 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-04-08 05:13:58,158 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 30 states. [2022-04-08 05:13:58,169 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 30 to 30. [2022-04-08 05:13:58,170 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-08 05:13:58,170 INFO L82 GeneralOperation]: Start isEquivalent. First operand 30 states. Second operand has 30 states, 20 states have (on average 1.3) internal successors, (26), 21 states have internal predecessors, (26), 6 states have call successors, (6), 4 states have call predecessors, (6), 3 states have return successors, (4), 4 states have call predecessors, (4), 4 states have call successors, (4) [2022-04-08 05:13:58,171 INFO L74 IsIncluded]: Start isIncluded. First operand 30 states. Second operand has 30 states, 20 states have (on average 1.3) internal successors, (26), 21 states have internal predecessors, (26), 6 states have call successors, (6), 4 states have call predecessors, (6), 3 states have return successors, (4), 4 states have call predecessors, (4), 4 states have call successors, (4) [2022-04-08 05:13:58,171 INFO L87 Difference]: Start difference. First operand 30 states. Second operand has 30 states, 20 states have (on average 1.3) internal successors, (26), 21 states have internal predecessors, (26), 6 states have call successors, (6), 4 states have call predecessors, (6), 3 states have return successors, (4), 4 states have call predecessors, (4), 4 states have call successors, (4) [2022-04-08 05:13:58,173 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-08 05:13:58,173 INFO L93 Difference]: Finished difference Result 30 states and 36 transitions. [2022-04-08 05:13:58,173 INFO L276 IsEmpty]: Start isEmpty. Operand 30 states and 36 transitions. [2022-04-08 05:13:58,174 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-08 05:13:58,174 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-08 05:13:58,174 INFO L74 IsIncluded]: Start isIncluded. First operand has 30 states, 20 states have (on average 1.3) internal successors, (26), 21 states have internal predecessors, (26), 6 states have call successors, (6), 4 states have call predecessors, (6), 3 states have return successors, (4), 4 states have call predecessors, (4), 4 states have call successors, (4) Second operand 30 states. [2022-04-08 05:13:58,175 INFO L87 Difference]: Start difference. First operand has 30 states, 20 states have (on average 1.3) internal successors, (26), 21 states have internal predecessors, (26), 6 states have call successors, (6), 4 states have call predecessors, (6), 3 states have return successors, (4), 4 states have call predecessors, (4), 4 states have call successors, (4) Second operand 30 states. [2022-04-08 05:13:58,177 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-08 05:13:58,177 INFO L93 Difference]: Finished difference Result 30 states and 36 transitions. [2022-04-08 05:13:58,177 INFO L276 IsEmpty]: Start isEmpty. Operand 30 states and 36 transitions. [2022-04-08 05:13:58,178 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-08 05:13:58,178 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-08 05:13:58,178 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-08 05:13:58,178 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-08 05:13:58,178 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 30 states, 20 states have (on average 1.3) internal successors, (26), 21 states have internal predecessors, (26), 6 states have call successors, (6), 4 states have call predecessors, (6), 3 states have return successors, (4), 4 states have call predecessors, (4), 4 states have call successors, (4) [2022-04-08 05:13:58,180 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 30 states to 30 states and 36 transitions. [2022-04-08 05:13:58,180 INFO L78 Accepts]: Start accepts. Automaton has 30 states and 36 transitions. Word has length 25 [2022-04-08 05:13:58,180 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-08 05:13:58,181 INFO L478 AbstractCegarLoop]: Abstraction has 30 states and 36 transitions. [2022-04-08 05:13:58,181 INFO L479 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 3.5) internal successors, (14), 3 states have internal predecessors, (14), 3 states have call successors, (5), 3 states have call predecessors, (5), 1 states have return successors, (3), 1 states have call predecessors, (3), 2 states have call successors, (3) [2022-04-08 05:13:58,181 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 30 states and 36 transitions. [2022-04-08 05:13:58,222 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 36 edges. 36 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-08 05:13:58,222 INFO L276 IsEmpty]: Start isEmpty. Operand 30 states and 36 transitions. [2022-04-08 05:13:58,223 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 27 [2022-04-08 05:13:58,223 INFO L491 BasicCegarLoop]: Found error trace [2022-04-08 05:13:58,223 INFO L499 BasicCegarLoop]: trace histogram [2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-08 05:13:58,260 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-08 05:13:58,437 WARN L460 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1,2 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-08 05:13:58,437 INFO L403 AbstractCegarLoop]: === Iteration 3 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-08 05:13:58,438 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-08 05:13:58,438 INFO L85 PathProgramCache]: Analyzing trace with hash 422434646, now seen corresponding path program 1 times [2022-04-08 05:13:58,438 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION [2022-04-08 05:13:58,438 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [939594619] [2022-04-08 05:13:58,439 INFO L202 tedInterpolationCore]: No loops in this trace, falling back to nested interpolation [2022-04-08 05:13:58,439 INFO L85 PathProgramCache]: Analyzing trace with hash 422434646, now seen corresponding path program 2 times [2022-04-08 05:13:58,439 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-08 05:13:58,439 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1824734321] [2022-04-08 05:13:58,440 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-08 05:13:58,440 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-08 05:13:58,476 ERROR L245 FreeRefinementEngine]: Caught known exception: Unsupported non-linear arithmetic [2022-04-08 05:13:58,477 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [369262501] [2022-04-08 05:13:58,477 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2022-04-08 05:13:58,477 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-08 05:13:58,477 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-04-08 05:13:58,478 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-08 05:13:58,480 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-08 05:13:58,537 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s) [2022-04-08 05:13:58,537 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-04-08 05:13:58,539 INFO L263 TraceCheckSpWp]: Trace formula consists of 82 conjuncts, 10 conjunts are in the unsatisfiable core [2022-04-08 05:13:58,550 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-08 05:13:58,551 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-04-08 05:13:59,054 INFO L272 TraceCheckUtils]: 0: Hoare triple {568#true} call ULTIMATE.init(); {568#true} is VALID [2022-04-08 05:13:59,054 INFO L290 TraceCheckUtils]: 1: Hoare triple {568#true} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(9, 2);~counter~0 := 0; {568#true} is VALID [2022-04-08 05:13:59,055 INFO L290 TraceCheckUtils]: 2: Hoare triple {568#true} assume true; {568#true} is VALID [2022-04-08 05:13:59,055 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {568#true} {568#true} #89#return; {568#true} is VALID [2022-04-08 05:13:59,055 INFO L272 TraceCheckUtils]: 4: Hoare triple {568#true} call #t~ret5 := main(); {568#true} is VALID [2022-04-08 05:13:59,055 INFO L290 TraceCheckUtils]: 5: Hoare triple {568#true} havoc ~A~0;havoc ~B~0;havoc ~q~0;havoc ~r~0;havoc ~b~0;~A~0 := #t~nondet1;havoc #t~nondet1;~B~0 := #t~nondet2;havoc #t~nondet2; {568#true} is VALID [2022-04-08 05:13:59,055 INFO L272 TraceCheckUtils]: 6: Hoare triple {568#true} call assume_abort_if_not((if ~B~0 % 4294967296 < 2147483647 then 1 else 0)); {568#true} is VALID [2022-04-08 05:13:59,056 INFO L290 TraceCheckUtils]: 7: Hoare triple {568#true} ~cond := #in~cond; {568#true} is VALID [2022-04-08 05:13:59,056 INFO L290 TraceCheckUtils]: 8: Hoare triple {568#true} assume !(0 == ~cond); {568#true} is VALID [2022-04-08 05:13:59,056 INFO L290 TraceCheckUtils]: 9: Hoare triple {568#true} assume true; {568#true} is VALID [2022-04-08 05:13:59,056 INFO L284 TraceCheckUtils]: 10: Hoare quadruple {568#true} {568#true} #81#return; {568#true} is VALID [2022-04-08 05:13:59,056 INFO L272 TraceCheckUtils]: 11: Hoare triple {568#true} call assume_abort_if_not((if ~B~0 % 4294967296 >= 1 then 1 else 0)); {568#true} is VALID [2022-04-08 05:13:59,056 INFO L290 TraceCheckUtils]: 12: Hoare triple {568#true} ~cond := #in~cond; {568#true} is VALID [2022-04-08 05:13:59,057 INFO L290 TraceCheckUtils]: 13: Hoare triple {568#true} assume !(0 == ~cond); {568#true} is VALID [2022-04-08 05:13:59,057 INFO L290 TraceCheckUtils]: 14: Hoare triple {568#true} assume true; {568#true} is VALID [2022-04-08 05:13:59,057 INFO L284 TraceCheckUtils]: 15: Hoare quadruple {568#true} {568#true} #83#return; {568#true} is VALID [2022-04-08 05:13:59,061 INFO L290 TraceCheckUtils]: 16: Hoare triple {568#true} ~q~0 := 0;~r~0 := ~A~0;~b~0 := ~B~0; {621#(and (= main_~A~0 main_~r~0) (= main_~q~0 0))} is VALID [2022-04-08 05:13:59,062 INFO L290 TraceCheckUtils]: 17: Hoare triple {621#(and (= main_~A~0 main_~r~0) (= main_~q~0 0))} #t~post3 := ~counter~0;~counter~0 := 1 + #t~post3; {621#(and (= main_~A~0 main_~r~0) (= main_~q~0 0))} is VALID [2022-04-08 05:13:59,063 INFO L290 TraceCheckUtils]: 18: Hoare triple {621#(and (= main_~A~0 main_~r~0) (= main_~q~0 0))} assume !!(#t~post3 < 1);havoc #t~post3; {621#(and (= main_~A~0 main_~r~0) (= main_~q~0 0))} is VALID [2022-04-08 05:13:59,063 INFO L290 TraceCheckUtils]: 19: Hoare triple {621#(and (= main_~A~0 main_~r~0) (= main_~q~0 0))} assume !(~r~0 % 4294967296 >= ~b~0 % 4294967296); {631#(and (not (<= (mod main_~b~0 4294967296) (mod main_~r~0 4294967296))) (= main_~A~0 main_~r~0) (= main_~q~0 0))} is VALID [2022-04-08 05:13:59,064 INFO L290 TraceCheckUtils]: 20: Hoare triple {631#(and (not (<= (mod main_~b~0 4294967296) (mod main_~r~0 4294967296))) (= main_~A~0 main_~r~0) (= main_~q~0 0))} #t~post4 := ~counter~0;~counter~0 := 1 + #t~post4; {631#(and (not (<= (mod main_~b~0 4294967296) (mod main_~r~0 4294967296))) (= main_~A~0 main_~r~0) (= main_~q~0 0))} is VALID [2022-04-08 05:13:59,064 INFO L290 TraceCheckUtils]: 21: Hoare triple {631#(and (not (<= (mod main_~b~0 4294967296) (mod main_~r~0 4294967296))) (= main_~A~0 main_~r~0) (= main_~q~0 0))} assume !(#t~post4 < 1);havoc #t~post4; {631#(and (not (<= (mod main_~b~0 4294967296) (mod main_~r~0 4294967296))) (= main_~A~0 main_~r~0) (= main_~q~0 0))} is VALID [2022-04-08 05:13:59,067 INFO L272 TraceCheckUtils]: 22: Hoare triple {631#(and (not (<= (mod main_~b~0 4294967296) (mod main_~r~0 4294967296))) (= main_~A~0 main_~r~0) (= main_~q~0 0))} call __VERIFIER_assert((if ~A~0 % 4294967296 == (~q~0 * ~b~0 + ~r~0) % 4294967296 then 1 else 0)); {641#(<= 1 |__VERIFIER_assert_#in~cond|)} is VALID [2022-04-08 05:13:59,068 INFO L290 TraceCheckUtils]: 23: Hoare triple {641#(<= 1 |__VERIFIER_assert_#in~cond|)} ~cond := #in~cond; {645#(<= 1 __VERIFIER_assert_~cond)} is VALID [2022-04-08 05:13:59,068 INFO L290 TraceCheckUtils]: 24: Hoare triple {645#(<= 1 __VERIFIER_assert_~cond)} assume 0 == ~cond; {569#false} is VALID [2022-04-08 05:13:59,068 INFO L290 TraceCheckUtils]: 25: Hoare triple {569#false} assume !false; {569#false} is VALID [2022-04-08 05:13:59,069 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2022-04-08 05:13:59,069 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-04-08 05:13:59,069 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-08 05:13:59,069 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1824734321] [2022-04-08 05:13:59,069 WARN L310 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2022-04-08 05:13:59,070 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [369262501] [2022-04-08 05:13:59,070 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [369262501] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-08 05:13:59,070 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-08 05:13:59,070 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2022-04-08 05:13:59,070 INFO L136 FreeRefinementEngine]: Strategy ACCELERATED_INTERPOLATION found an infeasible trace [2022-04-08 05:13:59,070 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleAcceleratedInterpolation [939594619] [2022-04-08 05:13:59,070 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleAcceleratedInterpolation [939594619] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-08 05:13:59,071 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-08 05:13:59,071 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2022-04-08 05:13:59,071 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1057525827] [2022-04-08 05:13:59,071 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-08 05:13:59,071 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 2.5) internal successors, (15), 5 states have internal predecessors, (15), 2 states have call successors, (5), 2 states have call predecessors, (5), 1 states have return successors, (3), 1 states have call predecessors, (3), 1 states have call successors, (3) Word has length 26 [2022-04-08 05:13:59,072 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-08 05:13:59,072 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with has 6 states, 6 states have (on average 2.5) internal successors, (15), 5 states have internal predecessors, (15), 2 states have call successors, (5), 2 states have call predecessors, (5), 1 states have return successors, (3), 1 states have call predecessors, (3), 1 states have call successors, (3) [2022-04-08 05:13:59,098 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-08 05:13:59,099 INFO L554 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2022-04-08 05:13:59,099 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy ACCELERATED_INTERPOLATION [2022-04-08 05:13:59,099 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2022-04-08 05:13:59,100 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2022-04-08 05:13:59,100 INFO L87 Difference]: Start difference. First operand 30 states and 36 transitions. Second operand has 6 states, 6 states have (on average 2.5) internal successors, (15), 5 states have internal predecessors, (15), 2 states have call successors, (5), 2 states have call predecessors, (5), 1 states have return successors, (3), 1 states have call predecessors, (3), 1 states have call successors, (3) [2022-04-08 05:13:59,400 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-08 05:13:59,400 INFO L93 Difference]: Finished difference Result 47 states and 59 transitions. [2022-04-08 05:13:59,400 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2022-04-08 05:13:59,400 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 2.5) internal successors, (15), 5 states have internal predecessors, (15), 2 states have call successors, (5), 2 states have call predecessors, (5), 1 states have return successors, (3), 1 states have call predecessors, (3), 1 states have call successors, (3) Word has length 26 [2022-04-08 05:13:59,401 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-08 05:13:59,401 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 6 states, 6 states have (on average 2.5) internal successors, (15), 5 states have internal predecessors, (15), 2 states have call successors, (5), 2 states have call predecessors, (5), 1 states have return successors, (3), 1 states have call predecessors, (3), 1 states have call successors, (3) [2022-04-08 05:13:59,403 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 57 transitions. [2022-04-08 05:13:59,403 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 6 states, 6 states have (on average 2.5) internal successors, (15), 5 states have internal predecessors, (15), 2 states have call successors, (5), 2 states have call predecessors, (5), 1 states have return successors, (3), 1 states have call predecessors, (3), 1 states have call successors, (3) [2022-04-08 05:13:59,406 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 57 transitions. [2022-04-08 05:13:59,406 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 6 states and 57 transitions. [2022-04-08 05:13:59,463 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 57 edges. 57 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-08 05:13:59,465 INFO L225 Difference]: With dead ends: 47 [2022-04-08 05:13:59,465 INFO L226 Difference]: Without dead ends: 43 [2022-04-08 05:13:59,466 INFO L912 BasicCegarLoop]: 0 DeclaredPredicates, 26 GetRequests, 21 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-08 05:13:59,467 INFO L913 BasicCegarLoop]: 26 mSDtfsCounter, 19 mSDsluCounter, 74 mSDsCounter, 0 mSdLazyCounter, 47 mSolverCounterSat, 7 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 21 SdHoareTripleChecker+Valid, 100 SdHoareTripleChecker+Invalid, 54 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 7 IncrementalHoareTripleChecker+Valid, 47 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-04-08 05:13:59,467 INFO L914 BasicCegarLoop]: SdHoareTripleChecker [21 Valid, 100 Invalid, 54 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [7 Valid, 47 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-04-08 05:13:59,468 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 43 states. [2022-04-08 05:13:59,491 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 43 to 39. [2022-04-08 05:13:59,491 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-08 05:13:59,491 INFO L82 GeneralOperation]: Start isEquivalent. First operand 43 states. Second operand has 39 states, 27 states have (on average 1.2592592592592593) internal successors, (34), 28 states have internal predecessors, (34), 7 states have call successors, (7), 5 states have call predecessors, (7), 4 states have return successors, (5), 5 states have call predecessors, (5), 5 states have call successors, (5) [2022-04-08 05:13:59,492 INFO L74 IsIncluded]: Start isIncluded. First operand 43 states. Second operand has 39 states, 27 states have (on average 1.2592592592592593) internal successors, (34), 28 states have internal predecessors, (34), 7 states have call successors, (7), 5 states have call predecessors, (7), 4 states have return successors, (5), 5 states have call predecessors, (5), 5 states have call successors, (5) [2022-04-08 05:13:59,492 INFO L87 Difference]: Start difference. First operand 43 states. Second operand has 39 states, 27 states have (on average 1.2592592592592593) internal successors, (34), 28 states have internal predecessors, (34), 7 states have call successors, (7), 5 states have call predecessors, (7), 4 states have return successors, (5), 5 states have call predecessors, (5), 5 states have call successors, (5) [2022-04-08 05:13:59,494 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-08 05:13:59,495 INFO L93 Difference]: Finished difference Result 43 states and 51 transitions. [2022-04-08 05:13:59,495 INFO L276 IsEmpty]: Start isEmpty. Operand 43 states and 51 transitions. [2022-04-08 05:13:59,497 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-08 05:13:59,497 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-08 05:13:59,497 INFO L74 IsIncluded]: Start isIncluded. First operand has 39 states, 27 states have (on average 1.2592592592592593) internal successors, (34), 28 states have internal predecessors, (34), 7 states have call successors, (7), 5 states have call predecessors, (7), 4 states have return successors, (5), 5 states have call predecessors, (5), 5 states have call successors, (5) Second operand 43 states. [2022-04-08 05:13:59,498 INFO L87 Difference]: Start difference. First operand has 39 states, 27 states have (on average 1.2592592592592593) internal successors, (34), 28 states have internal predecessors, (34), 7 states have call successors, (7), 5 states have call predecessors, (7), 4 states have return successors, (5), 5 states have call predecessors, (5), 5 states have call successors, (5) Second operand 43 states. [2022-04-08 05:13:59,500 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-08 05:13:59,501 INFO L93 Difference]: Finished difference Result 43 states and 51 transitions. [2022-04-08 05:13:59,501 INFO L276 IsEmpty]: Start isEmpty. Operand 43 states and 51 transitions. [2022-04-08 05:13:59,501 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-08 05:13:59,501 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-08 05:13:59,501 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-08 05:13:59,502 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-08 05:13:59,502 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 39 states, 27 states have (on average 1.2592592592592593) internal successors, (34), 28 states have internal predecessors, (34), 7 states have call successors, (7), 5 states have call predecessors, (7), 4 states have return successors, (5), 5 states have call predecessors, (5), 5 states have call successors, (5) [2022-04-08 05:13:59,504 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 39 states to 39 states and 46 transitions. [2022-04-08 05:13:59,504 INFO L78 Accepts]: Start accepts. Automaton has 39 states and 46 transitions. Word has length 26 [2022-04-08 05:13:59,504 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-08 05:13:59,504 INFO L478 AbstractCegarLoop]: Abstraction has 39 states and 46 transitions. [2022-04-08 05:13:59,504 INFO L479 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 2.5) internal successors, (15), 5 states have internal predecessors, (15), 2 states have call successors, (5), 2 states have call predecessors, (5), 1 states have return successors, (3), 1 states have call predecessors, (3), 1 states have call successors, (3) [2022-04-08 05:13:59,505 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 39 states and 46 transitions. [2022-04-08 05:13:59,550 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 46 edges. 46 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-08 05:13:59,550 INFO L276 IsEmpty]: Start isEmpty. Operand 39 states and 46 transitions. [2022-04-08 05:13:59,551 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 36 [2022-04-08 05:13:59,551 INFO L491 BasicCegarLoop]: Found error trace [2022-04-08 05:13:59,551 INFO L499 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-08 05:13:59,574 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Ended with exit code 0 [2022-04-08 05:13:59,752 WARN L460 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 3 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable2 [2022-04-08 05:13:59,752 INFO L403 AbstractCegarLoop]: === Iteration 4 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-08 05:13:59,753 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-08 05:13:59,753 INFO L85 PathProgramCache]: Analyzing trace with hash -1733722638, now seen corresponding path program 1 times [2022-04-08 05:13:59,753 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION [2022-04-08 05:13:59,753 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [1768567826] [2022-04-08 05:13:59,754 INFO L202 tedInterpolationCore]: No loops in this trace, falling back to nested interpolation [2022-04-08 05:13:59,754 INFO L85 PathProgramCache]: Analyzing trace with hash -1733722638, now seen corresponding path program 2 times [2022-04-08 05:13:59,754 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-08 05:13:59,754 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2124359833] [2022-04-08 05:13:59,754 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-08 05:13:59,754 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-08 05:13:59,838 ERROR L245 FreeRefinementEngine]: Caught known exception: Unsupported non-linear arithmetic [2022-04-08 05:13:59,838 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [1486176822] [2022-04-08 05:13:59,838 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2022-04-08 05:13:59,838 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-08 05:13:59,839 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-04-08 05:13:59,843 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-08 05:13:59,856 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-08 05:13:59,909 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2022-04-08 05:13:59,909 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-04-08 05:13:59,910 INFO L263 TraceCheckSpWp]: Trace formula consists of 115 conjuncts, 7 conjunts are in the unsatisfiable core [2022-04-08 05:13:59,930 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-08 05:13:59,931 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-04-08 05:14:00,123 INFO L272 TraceCheckUtils]: 0: Hoare triple {911#true} call ULTIMATE.init(); {911#true} is VALID [2022-04-08 05:14:00,124 INFO L290 TraceCheckUtils]: 1: Hoare triple {911#true} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(9, 2);~counter~0 := 0; {919#(<= 0 ~counter~0)} is VALID [2022-04-08 05:14:00,125 INFO L290 TraceCheckUtils]: 2: Hoare triple {919#(<= 0 ~counter~0)} assume true; {919#(<= 0 ~counter~0)} is VALID [2022-04-08 05:14:00,126 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {919#(<= 0 ~counter~0)} {911#true} #89#return; {919#(<= 0 ~counter~0)} is VALID [2022-04-08 05:14:00,126 INFO L272 TraceCheckUtils]: 4: Hoare triple {919#(<= 0 ~counter~0)} call #t~ret5 := main(); {919#(<= 0 ~counter~0)} is VALID [2022-04-08 05:14:00,129 INFO L290 TraceCheckUtils]: 5: Hoare triple {919#(<= 0 ~counter~0)} havoc ~A~0;havoc ~B~0;havoc ~q~0;havoc ~r~0;havoc ~b~0;~A~0 := #t~nondet1;havoc #t~nondet1;~B~0 := #t~nondet2;havoc #t~nondet2; {919#(<= 0 ~counter~0)} is VALID [2022-04-08 05:14:00,130 INFO L272 TraceCheckUtils]: 6: Hoare triple {919#(<= 0 ~counter~0)} call assume_abort_if_not((if ~B~0 % 4294967296 < 2147483647 then 1 else 0)); {919#(<= 0 ~counter~0)} is VALID [2022-04-08 05:14:00,130 INFO L290 TraceCheckUtils]: 7: Hoare triple {919#(<= 0 ~counter~0)} ~cond := #in~cond; {919#(<= 0 ~counter~0)} is VALID [2022-04-08 05:14:00,131 INFO L290 TraceCheckUtils]: 8: Hoare triple {919#(<= 0 ~counter~0)} assume !(0 == ~cond); {919#(<= 0 ~counter~0)} is VALID [2022-04-08 05:14:00,131 INFO L290 TraceCheckUtils]: 9: Hoare triple {919#(<= 0 ~counter~0)} assume true; {919#(<= 0 ~counter~0)} is VALID [2022-04-08 05:14:00,132 INFO L284 TraceCheckUtils]: 10: Hoare quadruple {919#(<= 0 ~counter~0)} {919#(<= 0 ~counter~0)} #81#return; {919#(<= 0 ~counter~0)} is VALID [2022-04-08 05:14:00,132 INFO L272 TraceCheckUtils]: 11: Hoare triple {919#(<= 0 ~counter~0)} call assume_abort_if_not((if ~B~0 % 4294967296 >= 1 then 1 else 0)); {919#(<= 0 ~counter~0)} is VALID [2022-04-08 05:14:00,133 INFO L290 TraceCheckUtils]: 12: Hoare triple {919#(<= 0 ~counter~0)} ~cond := #in~cond; {919#(<= 0 ~counter~0)} is VALID [2022-04-08 05:14:00,133 INFO L290 TraceCheckUtils]: 13: Hoare triple {919#(<= 0 ~counter~0)} assume !(0 == ~cond); {919#(<= 0 ~counter~0)} is VALID [2022-04-08 05:14:00,134 INFO L290 TraceCheckUtils]: 14: Hoare triple {919#(<= 0 ~counter~0)} assume true; {919#(<= 0 ~counter~0)} is VALID [2022-04-08 05:14:00,134 INFO L284 TraceCheckUtils]: 15: Hoare quadruple {919#(<= 0 ~counter~0)} {919#(<= 0 ~counter~0)} #83#return; {919#(<= 0 ~counter~0)} is VALID [2022-04-08 05:14:00,135 INFO L290 TraceCheckUtils]: 16: Hoare triple {919#(<= 0 ~counter~0)} ~q~0 := 0;~r~0 := ~A~0;~b~0 := ~B~0; {919#(<= 0 ~counter~0)} is VALID [2022-04-08 05:14:00,138 INFO L290 TraceCheckUtils]: 17: Hoare triple {919#(<= 0 ~counter~0)} #t~post3 := ~counter~0;~counter~0 := 1 + #t~post3; {968#(<= 1 ~counter~0)} is VALID [2022-04-08 05:14:00,141 INFO L290 TraceCheckUtils]: 18: Hoare triple {968#(<= 1 ~counter~0)} assume !!(#t~post3 < 1);havoc #t~post3; {968#(<= 1 ~counter~0)} is VALID [2022-04-08 05:14:00,142 INFO L290 TraceCheckUtils]: 19: Hoare triple {968#(<= 1 ~counter~0)} assume !(~r~0 % 4294967296 >= ~b~0 % 4294967296); {968#(<= 1 ~counter~0)} is VALID [2022-04-08 05:14:00,143 INFO L290 TraceCheckUtils]: 20: Hoare triple {968#(<= 1 ~counter~0)} #t~post4 := ~counter~0;~counter~0 := 1 + #t~post4; {978#(<= 1 |main_#t~post4|)} is VALID [2022-04-08 05:14:00,143 INFO L290 TraceCheckUtils]: 21: Hoare triple {978#(<= 1 |main_#t~post4|)} assume !!(#t~post4 < 1);havoc #t~post4; {912#false} is VALID [2022-04-08 05:14:00,143 INFO L272 TraceCheckUtils]: 22: Hoare triple {912#false} call __VERIFIER_assert((if ~A~0 % 4294967296 == (~q~0 * ~b~0 + ~r~0) % 4294967296 then 1 else 0)); {912#false} is VALID [2022-04-08 05:14:00,144 INFO L290 TraceCheckUtils]: 23: Hoare triple {912#false} ~cond := #in~cond; {912#false} is VALID [2022-04-08 05:14:00,144 INFO L290 TraceCheckUtils]: 24: Hoare triple {912#false} assume !(0 == ~cond); {912#false} is VALID [2022-04-08 05:14:00,144 INFO L290 TraceCheckUtils]: 25: Hoare triple {912#false} assume true; {912#false} is VALID [2022-04-08 05:14:00,144 INFO L284 TraceCheckUtils]: 26: Hoare quadruple {912#false} {912#false} #85#return; {912#false} is VALID [2022-04-08 05:14:00,144 INFO L290 TraceCheckUtils]: 27: Hoare triple {912#false} assume !!(~b~0 % 4294967296 != ~B~0 % 4294967296);~q~0 := 2 * ~q~0;~b~0 := (if ~b~0 % 4294967296 < 0 && 0 != ~b~0 % 4294967296 % 2 then 1 + ~b~0 % 4294967296 / 2 else ~b~0 % 4294967296 / 2); {912#false} is VALID [2022-04-08 05:14:00,145 INFO L290 TraceCheckUtils]: 28: Hoare triple {912#false} assume ~r~0 % 4294967296 >= ~b~0 % 4294967296;~q~0 := 1 + ~q~0;~r~0 := ~r~0 - ~b~0; {912#false} is VALID [2022-04-08 05:14:00,145 INFO L290 TraceCheckUtils]: 29: Hoare triple {912#false} #t~post4 := ~counter~0;~counter~0 := 1 + #t~post4; {912#false} is VALID [2022-04-08 05:14:00,145 INFO L290 TraceCheckUtils]: 30: Hoare triple {912#false} assume !(#t~post4 < 1);havoc #t~post4; {912#false} is VALID [2022-04-08 05:14:00,145 INFO L272 TraceCheckUtils]: 31: Hoare triple {912#false} call __VERIFIER_assert((if ~A~0 % 4294967296 == (~q~0 * ~b~0 + ~r~0) % 4294967296 then 1 else 0)); {912#false} is VALID [2022-04-08 05:14:00,147 INFO L290 TraceCheckUtils]: 32: Hoare triple {912#false} ~cond := #in~cond; {912#false} is VALID [2022-04-08 05:14:00,148 INFO L290 TraceCheckUtils]: 33: Hoare triple {912#false} assume 0 == ~cond; {912#false} is VALID [2022-04-08 05:14:00,148 INFO L290 TraceCheckUtils]: 34: Hoare triple {912#false} assume !false; {912#false} is VALID [2022-04-08 05:14:00,149 INFO L134 CoverageAnalysis]: Checked inductivity of 8 backedges. 2 proven. 0 refuted. 0 times theorem prover too weak. 6 trivial. 0 not checked. [2022-04-08 05:14:00,149 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-04-08 05:14:00,149 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-08 05:14:00,149 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2124359833] [2022-04-08 05:14:00,149 WARN L310 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2022-04-08 05:14:00,150 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1486176822] [2022-04-08 05:14:00,150 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1486176822] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-08 05:14:00,150 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-08 05:14:00,150 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2022-04-08 05:14:00,150 INFO L136 FreeRefinementEngine]: Strategy ACCELERATED_INTERPOLATION found an infeasible trace [2022-04-08 05:14:00,150 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleAcceleratedInterpolation [1768567826] [2022-04-08 05:14:00,151 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleAcceleratedInterpolation [1768567826] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-08 05:14:00,151 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-08 05:14:00,151 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2022-04-08 05:14:00,151 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1990467059] [2022-04-08 05:14:00,151 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-08 05:14:00,152 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 4.2) internal successors, (21), 4 states have internal predecessors, (21), 3 states have call successors, (6), 3 states have call predecessors, (6), 2 states have return successors, (4), 2 states have call predecessors, (4), 3 states have call successors, (4) Word has length 35 [2022-04-08 05:14:00,152 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-08 05:14:00,152 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with has 5 states, 5 states have (on average 4.2) internal successors, (21), 4 states have internal predecessors, (21), 3 states have call successors, (6), 3 states have call predecessors, (6), 2 states have return successors, (4), 2 states have call predecessors, (4), 3 states have call successors, (4) [2022-04-08 05:14:00,181 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 31 edges. 31 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-08 05:14:00,182 INFO L554 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-04-08 05:14:00,183 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy ACCELERATED_INTERPOLATION [2022-04-08 05:14:00,184 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-04-08 05:14:00,185 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2022-04-08 05:14:00,185 INFO L87 Difference]: Start difference. First operand 39 states and 46 transitions. Second operand has 5 states, 5 states have (on average 4.2) internal successors, (21), 4 states have internal predecessors, (21), 3 states have call successors, (6), 3 states have call predecessors, (6), 2 states have return successors, (4), 2 states have call predecessors, (4), 3 states have call successors, (4) [2022-04-08 05:14:00,277 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-08 05:14:00,277 INFO L93 Difference]: Finished difference Result 41 states and 48 transitions. [2022-04-08 05:14:00,277 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-04-08 05:14:00,277 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 4.2) internal successors, (21), 4 states have internal predecessors, (21), 3 states have call successors, (6), 3 states have call predecessors, (6), 2 states have return successors, (4), 2 states have call predecessors, (4), 3 states have call successors, (4) Word has length 35 [2022-04-08 05:14:00,280 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-08 05:14:00,280 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 5 states, 5 states have (on average 4.2) internal successors, (21), 4 states have internal predecessors, (21), 3 states have call successors, (6), 3 states have call predecessors, (6), 2 states have return successors, (4), 2 states have call predecessors, (4), 3 states have call successors, (4) [2022-04-08 05:14:00,282 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 37 transitions. [2022-04-08 05:14:00,282 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 5 states, 5 states have (on average 4.2) internal successors, (21), 4 states have internal predecessors, (21), 3 states have call successors, (6), 3 states have call predecessors, (6), 2 states have return successors, (4), 2 states have call predecessors, (4), 3 states have call successors, (4) [2022-04-08 05:14:00,283 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 37 transitions. [2022-04-08 05:14:00,283 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 5 states and 37 transitions. [2022-04-08 05:14:00,315 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 37 edges. 37 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-08 05:14:00,316 INFO L225 Difference]: With dead ends: 41 [2022-04-08 05:14:00,316 INFO L226 Difference]: Without dead ends: 0 [2022-04-08 05:14:00,316 INFO L912 BasicCegarLoop]: 0 DeclaredPredicates, 35 GetRequests, 31 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=13, Invalid=17, Unknown=0, NotChecked=0, Total=30 [2022-04-08 05:14:00,317 INFO L913 BasicCegarLoop]: 18 mSDtfsCounter, 4 mSDsluCounter, 26 mSDsCounter, 0 mSdLazyCounter, 12 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 4 SdHoareTripleChecker+Valid, 44 SdHoareTripleChecker+Invalid, 14 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 12 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-04-08 05:14:00,318 INFO L914 BasicCegarLoop]: SdHoareTripleChecker [4 Valid, 44 Invalid, 14 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 12 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-04-08 05:14:00,318 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 0 states. [2022-04-08 05:14:00,318 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 0 to 0. [2022-04-08 05:14:00,318 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-08 05:14:00,319 INFO L82 GeneralOperation]: Start isEquivalent. First operand 0 states. Second operand has 0 states, 0 states have (on average 0.0) internal successors, (0), 0 states have internal predecessors, (0), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-04-08 05:14:00,319 INFO L74 IsIncluded]: Start isIncluded. First operand 0 states. Second operand has 0 states, 0 states have (on average 0.0) internal successors, (0), 0 states have internal predecessors, (0), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-04-08 05:14:00,319 INFO L87 Difference]: Start difference. First operand 0 states. Second operand has 0 states, 0 states have (on average 0.0) internal successors, (0), 0 states have internal predecessors, (0), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-04-08 05:14:00,319 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-08 05:14:00,319 INFO L93 Difference]: Finished difference Result 0 states and 0 transitions. [2022-04-08 05:14:00,319 INFO L276 IsEmpty]: Start isEmpty. Operand 0 states and 0 transitions. [2022-04-08 05:14:00,319 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-08 05:14:00,320 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-08 05:14:00,320 INFO L74 IsIncluded]: Start isIncluded. First operand has 0 states, 0 states have (on average 0.0) internal successors, (0), 0 states have internal predecessors, (0), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Second operand 0 states. [2022-04-08 05:14:00,320 INFO L87 Difference]: Start difference. First operand has 0 states, 0 states have (on average 0.0) internal successors, (0), 0 states have internal predecessors, (0), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Second operand 0 states. [2022-04-08 05:14:00,320 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-08 05:14:00,320 INFO L93 Difference]: Finished difference Result 0 states and 0 transitions. [2022-04-08 05:14:00,320 INFO L276 IsEmpty]: Start isEmpty. Operand 0 states and 0 transitions. [2022-04-08 05:14:00,320 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-08 05:14:00,320 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-08 05:14:00,320 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-08 05:14:00,320 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-08 05:14:00,321 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 0 states, 0 states have (on average 0.0) internal successors, (0), 0 states have internal predecessors, (0), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-04-08 05:14:00,321 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 0 states to 0 states and 0 transitions. [2022-04-08 05:14:00,321 INFO L78 Accepts]: Start accepts. Automaton has 0 states and 0 transitions. Word has length 35 [2022-04-08 05:14:00,321 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-08 05:14:00,321 INFO L478 AbstractCegarLoop]: Abstraction has 0 states and 0 transitions. [2022-04-08 05:14:00,322 INFO L479 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 4.2) internal successors, (21), 4 states have internal predecessors, (21), 3 states have call successors, (6), 3 states have call predecessors, (6), 2 states have return successors, (4), 2 states have call predecessors, (4), 3 states have call successors, (4) [2022-04-08 05:14:00,322 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 0 states and 0 transitions. [2022-04-08 05:14:00,322 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 0 edges. 0 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-08 05:14:00,322 INFO L276 IsEmpty]: Start isEmpty. Operand 0 states and 0 transitions. [2022-04-08 05:14:00,322 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-08 05:14:00,325 INFO L788 garLoopResultBuilder]: Registering result SAFE for location __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION (0 of 1 remaining) [2022-04-08 05:14:00,358 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-08 05:14:00,539 WARN L460 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3,4 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-08 05:14:00,541 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends 0 states and 0 transitions. [2022-04-08 05:14:00,854 INFO L882 garLoopResultBuilder]: For program point reach_errorEXIT(line 12) no Hoare annotation was computed. [2022-04-08 05:14:00,854 INFO L882 garLoopResultBuilder]: For program point reach_errorENTRY(line 12) no Hoare annotation was computed. [2022-04-08 05:14:00,855 INFO L882 garLoopResultBuilder]: For program point L12-1(line 12) no Hoare annotation was computed. [2022-04-08 05:14:00,855 INFO L885 garLoopResultBuilder]: At program point L16(line 16) the Hoare annotation is: true [2022-04-08 05:14:00,855 INFO L885 garLoopResultBuilder]: At program point L16-2(lines 15 17) the Hoare annotation is: true [2022-04-08 05:14:00,855 INFO L885 garLoopResultBuilder]: At program point assume_abort_if_notENTRY(lines 15 17) the Hoare annotation is: true [2022-04-08 05:14:00,855 INFO L885 garLoopResultBuilder]: At program point assume_abort_if_notEXIT(lines 15 17) the Hoare annotation is: true [2022-04-08 05:14:00,855 INFO L878 garLoopResultBuilder]: At program point L31(line 31) the Hoare annotation is: (or (not (<= |old(~counter~0)| 0)) (and (<= 0 ~counter~0) (<= ~counter~0 0)) (not (<= 0 |old(~counter~0)|))) [2022-04-08 05:14:00,855 INFO L878 garLoopResultBuilder]: At program point L31-1(line 31) the Hoare annotation is: (or (not (<= |old(~counter~0)| 0)) (and (<= 0 ~counter~0) (<= ~counter~0 0)) (not (<= 0 |old(~counter~0)|))) [2022-04-08 05:14:00,855 INFO L885 garLoopResultBuilder]: At program point mainEXIT(lines 26 52) the Hoare annotation is: true [2022-04-08 05:14:00,856 INFO L885 garLoopResultBuilder]: At program point L50(line 50) the Hoare annotation is: true [2022-04-08 05:14:00,856 INFO L885 garLoopResultBuilder]: At program point mainFINAL(lines 26 52) the Hoare annotation is: true [2022-04-08 05:14:00,856 INFO L878 garLoopResultBuilder]: At program point L40(lines 40 49) the Hoare annotation is: (or (not (<= |old(~counter~0)| 0)) (and (= main_~A~0 main_~r~0) (<= 1 ~counter~0) (= main_~q~0 0) (<= 1 |main_#t~post4|)) (not (<= 0 |old(~counter~0)|))) [2022-04-08 05:14:00,856 INFO L878 garLoopResultBuilder]: At program point L40-2(lines 40 49) the Hoare annotation is: (or (not (<= |old(~counter~0)| 0)) (and (= main_~A~0 main_~r~0) (= main_~q~0 0)) (not (<= 0 |old(~counter~0)|))) [2022-04-08 05:14:00,856 INFO L878 garLoopResultBuilder]: At program point L36-1(lines 36 39) the Hoare annotation is: (or (not (<= |old(~counter~0)| 0)) (and (= main_~A~0 main_~r~0) (<= 1 ~counter~0) (= main_~q~0 0)) (not (<= 0 |old(~counter~0)|))) [2022-04-08 05:14:00,856 INFO L878 garLoopResultBuilder]: At program point L36-3(lines 36 39) the Hoare annotation is: (or (not (<= |old(~counter~0)| 0)) (and (= main_~A~0 main_~r~0) (<= 0 ~counter~0) (= main_~q~0 0)) (not (<= 0 |old(~counter~0)|))) [2022-04-08 05:14:00,856 INFO L878 garLoopResultBuilder]: At program point L32(line 32) the Hoare annotation is: (or (not (<= |old(~counter~0)| 0)) (and (<= 0 ~counter~0) (<= ~counter~0 0)) (not (<= 0 |old(~counter~0)|))) [2022-04-08 05:14:00,856 INFO L878 garLoopResultBuilder]: At program point mainENTRY(lines 26 52) the Hoare annotation is: (or (not (<= |old(~counter~0)| 0)) (and (<= 0 ~counter~0) (<= ~counter~0 0)) (not (<= 0 |old(~counter~0)|))) [2022-04-08 05:14:00,856 INFO L878 garLoopResultBuilder]: At program point L45(lines 45 48) the Hoare annotation is: (or (not (<= |old(~counter~0)| 0)) (not (<= 0 |old(~counter~0)|))) [2022-04-08 05:14:00,857 INFO L878 garLoopResultBuilder]: At program point L45-2(lines 26 52) the Hoare annotation is: (or (not (<= |old(~counter~0)| 0)) (and (= main_~A~0 main_~r~0) (<= 1 ~counter~0) (= main_~q~0 0)) (not (<= 0 |old(~counter~0)|))) [2022-04-08 05:14:00,857 INFO L878 garLoopResultBuilder]: At program point L41(line 41) the Hoare annotation is: (or (not (<= |old(~counter~0)| 0)) (not (<= 0 |old(~counter~0)|))) [2022-04-08 05:14:00,857 INFO L878 garLoopResultBuilder]: At program point L41-1(lines 40 49) the Hoare annotation is: (or (not (<= |old(~counter~0)| 0)) (not (<= 0 |old(~counter~0)|))) [2022-04-08 05:14:00,857 INFO L878 garLoopResultBuilder]: At program point L37(line 37) the Hoare annotation is: (or (not (<= |old(~counter~0)| 0)) (and (= main_~A~0 main_~r~0) (<= 1 ~counter~0) (= main_~q~0 0)) (not (<= 0 |old(~counter~0)|))) [2022-04-08 05:14:00,857 INFO L878 garLoopResultBuilder]: At program point ULTIMATE.initFINAL(line -1) the Hoare annotation is: (and (<= 0 ~counter~0) (<= ~counter~0 0)) [2022-04-08 05:14:00,857 INFO L878 garLoopResultBuilder]: At program point ULTIMATE.initENTRY(line -1) the Hoare annotation is: (and (= ~counter~0 |old(~counter~0)|) (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|)) [2022-04-08 05:14:00,857 INFO L878 garLoopResultBuilder]: At program point ULTIMATE.initEXIT(line -1) the Hoare annotation is: (and (<= 0 ~counter~0) (<= ~counter~0 0)) [2022-04-08 05:14:00,857 INFO L885 garLoopResultBuilder]: At program point ULTIMATE.startEXIT(line -1) the Hoare annotation is: true [2022-04-08 05:14:00,858 INFO L878 garLoopResultBuilder]: At program point L-1(line -1) the Hoare annotation is: (and (<= 0 ~counter~0) (<= ~counter~0 0)) [2022-04-08 05:14:00,858 INFO L885 garLoopResultBuilder]: At program point ULTIMATE.startENTRY(line -1) the Hoare annotation is: true [2022-04-08 05:14:00,858 INFO L885 garLoopResultBuilder]: At program point ULTIMATE.startFINAL(line -1) the Hoare annotation is: true [2022-04-08 05:14:00,858 INFO L885 garLoopResultBuilder]: At program point L19-2(lines 18 24) the Hoare annotation is: true [2022-04-08 05:14:00,858 INFO L885 garLoopResultBuilder]: At program point __VERIFIER_assertENTRY(lines 18 24) the Hoare annotation is: true [2022-04-08 05:14:00,858 INFO L885 garLoopResultBuilder]: At program point __VERIFIER_assertEXIT(lines 18 24) the Hoare annotation is: true [2022-04-08 05:14:00,858 INFO L878 garLoopResultBuilder]: At program point L20(lines 20 21) the Hoare annotation is: (not (<= 1 |__VERIFIER_assert_#in~cond|)) [2022-04-08 05:14:00,858 INFO L878 garLoopResultBuilder]: At program point L19(lines 19 22) the Hoare annotation is: (or (not (<= 1 |__VERIFIER_assert_#in~cond|)) (<= 1 __VERIFIER_assert_~cond)) [2022-04-08 05:14:00,858 INFO L878 garLoopResultBuilder]: At program point __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION(line 21) the Hoare annotation is: (not (<= 1 |__VERIFIER_assert_#in~cond|)) [2022-04-08 05:14:00,861 INFO L719 BasicCegarLoop]: Path program histogram: [2, 2, 2, 2] [2022-04-08 05:14:00,863 INFO L178 ceAbstractionStarter]: Computing trace abstraction results [2022-04-08 05:14:00,866 WARN L170 areAnnotationChecker]: reach_errorENTRY has no Hoare annotation [2022-04-08 05:14:00,866 WARN L170 areAnnotationChecker]: reach_errorENTRY has no Hoare annotation [2022-04-08 05:14:00,870 WARN L170 areAnnotationChecker]: L12-1 has no Hoare annotation [2022-04-08 05:14:00,892 INFO L163 areAnnotationChecker]: CFG has 43 edges. 43 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. 0 times interpolants missing. [2022-04-08 05:14:00,900 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 08.04 05:14:00 BoogieIcfgContainer [2022-04-08 05:14:00,900 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2022-04-08 05:14:00,901 INFO L158 Benchmark]: Toolchain (without parser) took 4860.26ms. Allocated memory is still 169.9MB. Free memory was 122.0MB in the beginning and 70.0MB in the end (delta: 52.0MB). Peak memory consumption was 53.3MB. Max. memory is 8.0GB. [2022-04-08 05:14:00,902 INFO L158 Benchmark]: CDTParser took 0.17ms. Allocated memory is still 169.9MB. Free memory was 138.0MB in the beginning and 137.9MB in the end (delta: 151.9kB). There was no memory consumed. Max. memory is 8.0GB. [2022-04-08 05:14:00,902 INFO L158 Benchmark]: CACSL2BoogieTranslator took 247.64ms. Allocated memory is still 169.9MB. Free memory was 121.9MB in the beginning and 147.9MB in the end (delta: -26.0MB). Peak memory consumption was 14.7MB. Max. memory is 8.0GB. [2022-04-08 05:14:00,902 INFO L158 Benchmark]: Boogie Preprocessor took 41.41ms. Allocated memory is still 169.9MB. Free memory was 147.6MB in the beginning and 146.1MB in the end (delta: 1.4MB). Peak memory consumption was 1.0MB. Max. memory is 8.0GB. [2022-04-08 05:14:00,903 INFO L158 Benchmark]: RCFGBuilder took 283.09ms. Allocated memory is still 169.9MB. Free memory was 146.1MB in the beginning and 134.6MB in the end (delta: 11.5MB). Peak memory consumption was 11.5MB. Max. memory is 8.0GB. [2022-04-08 05:14:00,903 INFO L158 Benchmark]: TraceAbstraction took 4283.25ms. Allocated memory is still 169.9MB. Free memory was 133.9MB in the beginning and 70.5MB in the end (delta: 63.4MB). Peak memory consumption was 63.8MB. Max. memory is 8.0GB. [2022-04-08 05:14:00,904 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.17ms. Allocated memory is still 169.9MB. Free memory was 138.0MB in the beginning and 137.9MB in the end (delta: 151.9kB). There was no memory consumed. Max. memory is 8.0GB. * CACSL2BoogieTranslator took 247.64ms. Allocated memory is still 169.9MB. Free memory was 121.9MB in the beginning and 147.9MB in the end (delta: -26.0MB). Peak memory consumption was 14.7MB. Max. memory is 8.0GB. * Boogie Preprocessor took 41.41ms. Allocated memory is still 169.9MB. Free memory was 147.6MB in the beginning and 146.1MB in the end (delta: 1.4MB). Peak memory consumption was 1.0MB. Max. memory is 8.0GB. * RCFGBuilder took 283.09ms. Allocated memory is still 169.9MB. Free memory was 146.1MB in the beginning and 134.6MB in the end (delta: 11.5MB). Peak memory consumption was 11.5MB. Max. memory is 8.0GB. * TraceAbstraction took 4283.25ms. Allocated memory is still 169.9MB. Free memory was 133.9MB in the beginning and 70.5MB in the end (delta: 63.4MB). Peak memory consumption was 63.8MB. 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 - PositiveResult [Line: 21]: call to reach_error is unreachable For all program executions holds that call to reach_error is unreachable at this location - StatisticsResult: Ultimate Automizer benchmark data CFG has 6 procedures, 36 locations, 1 error locations. Started 1 CEGAR loops. OverallTime: 4.2s, OverallIterations: 4, TraceHistogramMax: 2, PathProgramHistogramMax: 2, EmptinessCheckTime: 0.0s, AutomataDifference: 1.0s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.3s, InitialAbstractionConstructionTime: 0.0s, PartialOrderReductionTime: 0.0s, HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 37 SdHoareTripleChecker+Valid, 0.1s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 33 mSDsluCounter, 265 SdHoareTripleChecker+Invalid, 0.1s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 153 mSDsCounter, 14 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 87 IncrementalHoareTripleChecker+Invalid, 101 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 14 mSolverCounterUnsat, 112 mSDtfsCounter, 87 mSolverCounterSat, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 95 GetRequests, 83 SyntacticMatches, 0 SemanticMatches, 12 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4 ImplicationChecksByTransitivity, 0.1s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=39occurred in iteration=3, InterpolantAutomatonStates: 18, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s DumpTime, AutomataMinimizationStatistics: 0.1s AutomataMinimizationTime, 4 MinimizatonAttempts, 5 StatesRemovedByMinimization, 2 NontrivialMinimizations, HoareAnnotationStatistics: 0.0s HoareAnnotationTime, 33 LocationsWithAnnotation, 89 PreInvPairs, 121 NumberOfFragments, 265 HoareAnnotationTreeSize, 89 FomulaSimplifications, 0 FormulaSimplificationTreeSizeReduction, 0.0s HoareSimplificationTime, 33 FomulaSimplificationsInter, 151 FormulaSimplificationTreeSizeReductionInter, 0.2s HoareSimplificationTimeInter, RefinementEngineStatistics: TRACE_CHECK: No data available, 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 - AllSpecificationsHoldResult: All specifications hold 1 specifications checked. All of them hold - InvariantResult [Line: 36]: Loop Invariant Derived loop invariant: (!(\old(counter) <= 0) || ((A == r && 0 <= counter) && q == 0)) || !(0 <= \old(counter)) - ProcedureContractResult [Line: 15]: Procedure Contract for assume_abort_if_not Derived contract for procedure assume_abort_if_not: 1 - ProcedureContractResult [Line: 26]: Procedure Contract for main Derived contract for procedure main: 1 - ProcedureContractResult [Line: 18]: Procedure Contract for __VERIFIER_assert Derived contract for procedure __VERIFIER_assert: 1 RESULT: Ultimate proved your program to be correct! [2022-04-08 05:14:00,935 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...