/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/divbin2_unwindbound2.i -------------------------------------------------------------------------------- This is Ultimate 0.2.2-dev-e106359-m [2022-04-15 08:07:54,139 INFO L177 SettingsManager]: Resetting all preferences to default values... [2022-04-15 08:07:54,141 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2022-04-15 08:07:54,172 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2022-04-15 08:07:54,172 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2022-04-15 08:07:54,173 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2022-04-15 08:07:54,174 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2022-04-15 08:07:54,176 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2022-04-15 08:07:54,177 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2022-04-15 08:07:54,178 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2022-04-15 08:07:54,179 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2022-04-15 08:07:54,179 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2022-04-15 08:07:54,180 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2022-04-15 08:07:54,180 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2022-04-15 08:07:54,181 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2022-04-15 08:07:54,182 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2022-04-15 08:07:54,183 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2022-04-15 08:07:54,183 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2022-04-15 08:07:54,185 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2022-04-15 08:07:54,186 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2022-04-15 08:07:54,187 INFO L181 SettingsManager]: Resetting HornVerifier preferences to default values [2022-04-15 08:07:54,191 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2022-04-15 08:07:54,192 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2022-04-15 08:07:54,193 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2022-04-15 08:07:54,193 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2022-04-15 08:07:54,196 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2022-04-15 08:07:54,196 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2022-04-15 08:07:54,196 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2022-04-15 08:07:54,197 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2022-04-15 08:07:54,197 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2022-04-15 08:07:54,198 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2022-04-15 08:07:54,198 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2022-04-15 08:07:54,198 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2022-04-15 08:07:54,199 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2022-04-15 08:07:54,200 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2022-04-15 08:07:54,200 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2022-04-15 08:07:54,201 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2022-04-15 08:07:54,201 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2022-04-15 08:07:54,201 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2022-04-15 08:07:54,201 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2022-04-15 08:07:54,202 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2022-04-15 08:07:54,213 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2022-04-15 08:07:54,213 INFO L101 SettingsManager]: Beginning loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/settings/automizer/acceleratedInterpolation/acceleratedInterpolationJordan_32.epf [2022-04-15 08:07:54,221 INFO L113 SettingsManager]: Loading preferences was successful [2022-04-15 08:07:54,222 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2022-04-15 08:07:54,223 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2022-04-15 08:07:54,223 INFO L138 SettingsManager]: * sizeof long=4 [2022-04-15 08:07:54,223 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2022-04-15 08:07:54,228 INFO L138 SettingsManager]: * sizeof POINTER=4 [2022-04-15 08:07:54,228 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2022-04-15 08:07:54,229 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2022-04-15 08:07:54,229 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2022-04-15 08:07:54,230 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2022-04-15 08:07:54,230 INFO L138 SettingsManager]: * sizeof long double=12 [2022-04-15 08:07:54,230 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2022-04-15 08:07:54,230 INFO L138 SettingsManager]: * Use constant arrays=true [2022-04-15 08:07:54,230 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2022-04-15 08:07:54,230 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2022-04-15 08:07:54,230 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2022-04-15 08:07:54,230 INFO L138 SettingsManager]: * To the following directory=./dump/ [2022-04-15 08:07:54,231 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2022-04-15 08:07:54,231 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-04-15 08:07:54,231 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2022-04-15 08:07:54,231 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=Craig_NestedInterpolation [2022-04-15 08:07:54,231 INFO L138 SettingsManager]: * Trace refinement strategy=ACCELERATED_INTERPOLATION [2022-04-15 08:07:54,231 INFO L138 SettingsManager]: * Trace refinement strategy used in Accelerated Interpolation=CAMEL [2022-04-15 08:07:54,232 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2022-04-15 08:07:54,232 INFO L138 SettingsManager]: * Loop acceleration method that is used by accelerated interpolation=JORDAN [2022-04-15 08:07:54,232 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-15 08:07:54,462 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2022-04-15 08:07:54,489 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2022-04-15 08:07:54,491 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2022-04-15 08:07:54,492 INFO L271 PluginConnector]: Initializing CDTParser... [2022-04-15 08:07:54,493 INFO L275 PluginConnector]: CDTParser initialized [2022-04-15 08:07:54,494 INFO L432 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/nla-digbench-scaling/divbin2_unwindbound2.i [2022-04-15 08:07:54,561 INFO L220 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/4f1fbf3ee/fd43a294d4b643edbf19e3d69360bf86/FLAG6730fc404 [2022-04-15 08:07:54,987 INFO L306 CDTParser]: Found 1 translation units. [2022-04-15 08:07:54,988 INFO L160 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/nla-digbench-scaling/divbin2_unwindbound2.i [2022-04-15 08:07:54,993 INFO L349 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/4f1fbf3ee/fd43a294d4b643edbf19e3d69360bf86/FLAG6730fc404 [2022-04-15 08:07:55,005 INFO L357 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/4f1fbf3ee/fd43a294d4b643edbf19e3d69360bf86 [2022-04-15 08:07:55,007 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2022-04-15 08:07:55,008 INFO L131 ToolchainWalker]: Walking toolchain with 4 elements. [2022-04-15 08:07:55,013 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2022-04-15 08:07:55,014 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2022-04-15 08:07:55,016 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2022-04-15 08:07:55,017 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 15.04 08:07:55" (1/1) ... [2022-04-15 08:07:55,018 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@dd15e66 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.04 08:07:55, skipping insertion in model container [2022-04-15 08:07:55,018 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 15.04 08:07:55" (1/1) ... [2022-04-15 08:07:55,023 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2022-04-15 08:07:55,035 INFO L178 MainTranslator]: Built tables and reachable declarations [2022-04-15 08:07:55,186 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/divbin2_unwindbound2.i[951,964] [2022-04-15 08:07:55,201 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-04-15 08:07:55,209 INFO L203 MainTranslator]: Completed pre-run [2022-04-15 08:07:55,221 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/divbin2_unwindbound2.i[951,964] [2022-04-15 08:07:55,227 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-04-15 08:07:55,237 INFO L208 MainTranslator]: Completed translation [2022-04-15 08:07:55,237 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.04 08:07:55 WrapperNode [2022-04-15 08:07:55,238 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2022-04-15 08:07:55,239 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2022-04-15 08:07:55,239 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2022-04-15 08:07:55,239 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2022-04-15 08:07:55,248 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.04 08:07:55" (1/1) ... [2022-04-15 08:07:55,249 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.04 08:07:55" (1/1) ... [2022-04-15 08:07:55,254 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.04 08:07:55" (1/1) ... [2022-04-15 08:07:55,255 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.04 08:07:55" (1/1) ... [2022-04-15 08:07:55,260 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.04 08:07:55" (1/1) ... [2022-04-15 08:07:55,267 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.04 08:07:55" (1/1) ... [2022-04-15 08:07:55,268 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.04 08:07:55" (1/1) ... [2022-04-15 08:07:55,270 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2022-04-15 08:07:55,271 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2022-04-15 08:07:55,271 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2022-04-15 08:07:55,271 INFO L275 PluginConnector]: RCFGBuilder initialized [2022-04-15 08:07:55,276 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.04 08:07:55" (1/1) ... [2022-04-15 08:07:55,289 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-04-15 08:07:55,297 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-04-15 08:07:55,307 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-15 08:07:55,323 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-15 08:07:55,346 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.init [2022-04-15 08:07:55,346 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2022-04-15 08:07:55,346 INFO L138 BoogieDeclarations]: Found implementation of procedure reach_error [2022-04-15 08:07:55,346 INFO L138 BoogieDeclarations]: Found implementation of procedure assume_abort_if_not [2022-04-15 08:07:55,346 INFO L138 BoogieDeclarations]: Found implementation of procedure __VERIFIER_assert [2022-04-15 08:07:55,347 INFO L138 BoogieDeclarations]: Found implementation of procedure main [2022-04-15 08:07:55,347 INFO L130 BoogieDeclarations]: Found specification of procedure abort [2022-04-15 08:07:55,347 INFO L130 BoogieDeclarations]: Found specification of procedure __assert_fail [2022-04-15 08:07:55,347 INFO L130 BoogieDeclarations]: Found specification of procedure __assert_perror_fail [2022-04-15 08:07:55,347 INFO L130 BoogieDeclarations]: Found specification of procedure __assert [2022-04-15 08:07:55,347 INFO L130 BoogieDeclarations]: Found specification of procedure reach_error [2022-04-15 08:07:55,347 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2022-04-15 08:07:55,348 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_nondet_uint [2022-04-15 08:07:55,348 INFO L130 BoogieDeclarations]: Found specification of procedure assume_abort_if_not [2022-04-15 08:07:55,348 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_assert [2022-04-15 08:07:55,348 INFO L130 BoogieDeclarations]: Found specification of procedure main [2022-04-15 08:07:55,348 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.init [2022-04-15 08:07:55,348 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2022-04-15 08:07:55,348 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2022-04-15 08:07:55,348 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2022-04-15 08:07:55,349 INFO L130 BoogieDeclarations]: Found specification of procedure read~int [2022-04-15 08:07:55,349 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2022-04-15 08:07:55,402 INFO L234 CfgBuilder]: Building ICFG [2022-04-15 08:07:55,404 INFO L260 CfgBuilder]: Building CFG for each procedure with an implementation [2022-04-15 08:07:55,534 INFO L275 CfgBuilder]: Performing block encoding [2022-04-15 08:07:55,541 INFO L294 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2022-04-15 08:07:55,541 INFO L299 CfgBuilder]: Removed 2 assume(true) statements. [2022-04-15 08:07:55,543 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 15.04 08:07:55 BoogieIcfgContainer [2022-04-15 08:07:55,543 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2022-04-15 08:07:55,545 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2022-04-15 08:07:55,545 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2022-04-15 08:07:55,550 INFO L275 PluginConnector]: TraceAbstraction initialized [2022-04-15 08:07:55,550 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 15.04 08:07:55" (1/3) ... [2022-04-15 08:07:55,551 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@568805e4 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 15.04 08:07:55, skipping insertion in model container [2022-04-15 08:07:55,551 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.04 08:07:55" (2/3) ... [2022-04-15 08:07:55,552 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@568805e4 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 15.04 08:07:55, skipping insertion in model container [2022-04-15 08:07:55,552 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 15.04 08:07:55" (3/3) ... [2022-04-15 08:07:55,553 INFO L111 eAbstractionObserver]: Analyzing ICFG divbin2_unwindbound2.i [2022-04-15 08:07:55,559 INFO L202 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:Craig_NestedInterpolation Determinization: PREDICATE_ABSTRACTION [2022-04-15 08:07:55,559 INFO L161 ceAbstractionStarter]: Applying trace abstraction to program that has 1 error locations. [2022-04-15 08:07:55,597 INFO L339 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2022-04-15 08:07:55,604 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-15 08:07:55,604 INFO L341 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2022-04-15 08:07:55,633 INFO L276 IsEmpty]: Start isEmpty. Operand has 26 states, 17 states have (on average 1.5294117647058822) internal successors, (26), 18 states have internal predecessors, (26), 4 states have call successors, (4), 3 states have call predecessors, (4), 3 states have return successors, (4), 4 states have call predecessors, (4), 4 states have call successors, (4) [2022-04-15 08:07:55,640 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 13 [2022-04-15 08:07:55,640 INFO L491 BasicCegarLoop]: Found error trace [2022-04-15 08:07:55,641 INFO L499 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-15 08:07:55,641 INFO L403 AbstractCegarLoop]: === Iteration 1 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-15 08:07:55,646 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-15 08:07:55,646 INFO L85 PathProgramCache]: Analyzing trace with hash -2126508982, now seen corresponding path program 1 times [2022-04-15 08:07:55,653 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION [2022-04-15 08:07:55,653 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [699594603] [2022-04-15 08:07:55,663 INFO L202 tedInterpolationCore]: No loops in this trace, falling back to nested interpolation [2022-04-15 08:07:55,663 INFO L85 PathProgramCache]: Analyzing trace with hash -2126508982, now seen corresponding path program 2 times [2022-04-15 08:07:55,666 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-15 08:07:55,667 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [511747977] [2022-04-15 08:07:55,667 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-15 08:07:55,668 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-15 08:07:55,762 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-15 08:07:55,866 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-04-15 08:07:55,871 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-15 08:07:55,896 INFO L290 TraceCheckUtils]: 0: Hoare triple {34#(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(10, 2);~counter~0 := 0; {29#true} is VALID [2022-04-15 08:07:55,897 INFO L290 TraceCheckUtils]: 1: Hoare triple {29#true} assume true; {29#true} is VALID [2022-04-15 08:07:55,897 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {29#true} {29#true} #82#return; {29#true} is VALID [2022-04-15 08:07:55,900 INFO L272 TraceCheckUtils]: 0: Hoare triple {29#true} call ULTIMATE.init(); {34#(and (= ~counter~0 |old(~counter~0)|) (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} is VALID [2022-04-15 08:07:55,901 INFO L290 TraceCheckUtils]: 1: Hoare triple {34#(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(10, 2);~counter~0 := 0; {29#true} is VALID [2022-04-15 08:07:55,901 INFO L290 TraceCheckUtils]: 2: Hoare triple {29#true} assume true; {29#true} is VALID [2022-04-15 08:07:55,901 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {29#true} {29#true} #82#return; {29#true} is VALID [2022-04-15 08:07:55,901 INFO L272 TraceCheckUtils]: 4: Hoare triple {29#true} call #t~ret4 := main(); {29#true} is VALID [2022-04-15 08:07:55,902 INFO L290 TraceCheckUtils]: 5: Hoare triple {29#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 := 1;~q~0 := 0;~r~0 := ~A~0;~b~0 := ~B~0; {29#true} is VALID [2022-04-15 08:07:55,903 INFO L290 TraceCheckUtils]: 6: Hoare triple {29#true} assume !true; {30#false} is VALID [2022-04-15 08:07:55,904 INFO L290 TraceCheckUtils]: 7: Hoare triple {30#false} assume !true; {30#false} is VALID [2022-04-15 08:07:55,904 INFO L272 TraceCheckUtils]: 8: Hoare triple {30#false} call __VERIFIER_assert((if ~A~0 % 4294967296 == (~q~0 * ~b~0 + ~r~0) % 4294967296 then 1 else 0)); {30#false} is VALID [2022-04-15 08:07:55,904 INFO L290 TraceCheckUtils]: 9: Hoare triple {30#false} ~cond := #in~cond; {30#false} is VALID [2022-04-15 08:07:55,904 INFO L290 TraceCheckUtils]: 10: Hoare triple {30#false} assume 0 == ~cond; {30#false} is VALID [2022-04-15 08:07:55,905 INFO L290 TraceCheckUtils]: 11: Hoare triple {30#false} assume !false; {30#false} is VALID [2022-04-15 08:07:55,906 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-04-15 08:07:55,907 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-15 08:07:55,907 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [511747977] [2022-04-15 08:07:55,908 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [511747977] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-15 08:07:55,909 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-15 08:07:55,909 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-04-15 08:07:55,913 INFO L136 FreeRefinementEngine]: Strategy ACCELERATED_INTERPOLATION found an infeasible trace [2022-04-15 08:07:55,915 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleAcceleratedInterpolation [699594603] [2022-04-15 08:07:55,915 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleAcceleratedInterpolation [699594603] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-15 08:07:55,915 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-15 08:07:55,916 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-04-15 08:07:55,916 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1429923675] [2022-04-15 08:07:55,917 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-15 08:07:55,923 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 2.6666666666666665) internal successors, (8), 2 states have internal predecessors, (8), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 12 [2022-04-15 08:07:55,924 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-15 08:07:55,927 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with has 3 states, 3 states have (on average 2.6666666666666665) internal successors, (8), 2 states have internal predecessors, (8), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 08:07:55,954 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 12 edges. 12 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-15 08:07:55,955 INFO L554 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-04-15 08:07:55,955 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy ACCELERATED_INTERPOLATION [2022-04-15 08:07:55,979 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-04-15 08:07:55,981 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-04-15 08:07:55,983 INFO L87 Difference]: Start difference. First operand has 26 states, 17 states have (on average 1.5294117647058822) internal successors, (26), 18 states have internal predecessors, (26), 4 states have call successors, (4), 3 states have call predecessors, (4), 3 states have return successors, (4), 4 states have call predecessors, (4), 4 states have call successors, (4) Second operand has 3 states, 3 states have (on average 2.6666666666666665) internal successors, (8), 2 states have internal predecessors, (8), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 08:07:56,138 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-15 08:07:56,138 INFO L93 Difference]: Finished difference Result 44 states and 60 transitions. [2022-04-15 08:07:56,139 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-04-15 08:07:56,151 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 2.6666666666666665) internal successors, (8), 2 states have internal predecessors, (8), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 12 [2022-04-15 08:07:56,151 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-15 08:07:56,153 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3 states, 3 states have (on average 2.6666666666666665) internal successors, (8), 2 states have internal predecessors, (8), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 08:07:56,164 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 60 transitions. [2022-04-15 08:07:56,165 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3 states, 3 states have (on average 2.6666666666666665) internal successors, (8), 2 states have internal predecessors, (8), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 08:07:56,168 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 60 transitions. [2022-04-15 08:07:56,169 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 3 states and 60 transitions. [2022-04-15 08:07:56,244 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 60 edges. 60 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-15 08:07:56,259 INFO L225 Difference]: With dead ends: 44 [2022-04-15 08:07:56,259 INFO L226 Difference]: Without dead ends: 22 [2022-04-15 08:07:56,262 INFO L912 BasicCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 3 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-15 08:07:56,266 INFO L913 BasicCegarLoop]: 30 mSDtfsCounter, 6 mSDsluCounter, 4 mSDsCounter, 0 mSdLazyCounter, 18 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 6 SdHoareTripleChecker+Valid, 34 SdHoareTripleChecker+Invalid, 21 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 18 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-04-15 08:07:56,268 INFO L914 BasicCegarLoop]: SdHoareTripleChecker [6 Valid, 34 Invalid, 21 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 18 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-04-15 08:07:56,284 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 22 states. [2022-04-15 08:07:56,307 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 22 to 21. [2022-04-15 08:07:56,307 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-15 08:07:56,308 INFO L82 GeneralOperation]: Start isEquivalent. First operand 22 states. Second operand has 21 states, 14 states have (on average 1.4285714285714286) internal successors, (20), 15 states have internal predecessors, (20), 4 states have call successors, (4), 3 states have call predecessors, (4), 2 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2022-04-15 08:07:56,308 INFO L74 IsIncluded]: Start isIncluded. First operand 22 states. Second operand has 21 states, 14 states have (on average 1.4285714285714286) internal successors, (20), 15 states have internal predecessors, (20), 4 states have call successors, (4), 3 states have call predecessors, (4), 2 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2022-04-15 08:07:56,309 INFO L87 Difference]: Start difference. First operand 22 states. Second operand has 21 states, 14 states have (on average 1.4285714285714286) internal successors, (20), 15 states have internal predecessors, (20), 4 states have call successors, (4), 3 states have call predecessors, (4), 2 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2022-04-15 08:07:56,314 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-15 08:07:56,314 INFO L93 Difference]: Finished difference Result 22 states and 27 transitions. [2022-04-15 08:07:56,314 INFO L276 IsEmpty]: Start isEmpty. Operand 22 states and 27 transitions. [2022-04-15 08:07:56,315 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-15 08:07:56,315 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-15 08:07:56,315 INFO L74 IsIncluded]: Start isIncluded. First operand has 21 states, 14 states have (on average 1.4285714285714286) internal successors, (20), 15 states have internal predecessors, (20), 4 states have call successors, (4), 3 states have call predecessors, (4), 2 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) Second operand 22 states. [2022-04-15 08:07:56,316 INFO L87 Difference]: Start difference. First operand has 21 states, 14 states have (on average 1.4285714285714286) internal successors, (20), 15 states have internal predecessors, (20), 4 states have call successors, (4), 3 states have call predecessors, (4), 2 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) Second operand 22 states. [2022-04-15 08:07:56,318 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-15 08:07:56,318 INFO L93 Difference]: Finished difference Result 22 states and 27 transitions. [2022-04-15 08:07:56,319 INFO L276 IsEmpty]: Start isEmpty. Operand 22 states and 27 transitions. [2022-04-15 08:07:56,319 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-15 08:07:56,319 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-15 08:07:56,319 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-15 08:07:56,319 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-15 08:07:56,320 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 21 states, 14 states have (on average 1.4285714285714286) internal successors, (20), 15 states have internal predecessors, (20), 4 states have call successors, (4), 3 states have call predecessors, (4), 2 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2022-04-15 08:07:56,321 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 21 states to 21 states and 26 transitions. [2022-04-15 08:07:56,323 INFO L78 Accepts]: Start accepts. Automaton has 21 states and 26 transitions. Word has length 12 [2022-04-15 08:07:56,323 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-15 08:07:56,323 INFO L478 AbstractCegarLoop]: Abstraction has 21 states and 26 transitions. [2022-04-15 08:07:56,323 INFO L479 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 2.6666666666666665) internal successors, (8), 2 states have internal predecessors, (8), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 08:07:56,324 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 21 states and 26 transitions. [2022-04-15 08:07:56,369 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 26 edges. 26 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-15 08:07:56,370 INFO L276 IsEmpty]: Start isEmpty. Operand 21 states and 26 transitions. [2022-04-15 08:07:56,370 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 15 [2022-04-15 08:07:56,370 INFO L491 BasicCegarLoop]: Found error trace [2022-04-15 08:07:56,371 INFO L499 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-15 08:07:56,371 WARN L460 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2022-04-15 08:07:56,371 INFO L403 AbstractCegarLoop]: === Iteration 2 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-15 08:07:56,372 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-15 08:07:56,372 INFO L85 PathProgramCache]: Analyzing trace with hash 941422680, now seen corresponding path program 1 times [2022-04-15 08:07:56,372 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION [2022-04-15 08:07:56,372 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [787619710] [2022-04-15 08:07:56,374 INFO L202 tedInterpolationCore]: No loops in this trace, falling back to nested interpolation [2022-04-15 08:07:56,374 INFO L85 PathProgramCache]: Analyzing trace with hash 941422680, now seen corresponding path program 2 times [2022-04-15 08:07:56,374 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-15 08:07:56,374 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [803342021] [2022-04-15 08:07:56,374 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-15 08:07:56,374 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-15 08:07:56,405 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-15 08:07:56,455 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-04-15 08:07:56,461 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-15 08:07:56,471 INFO L290 TraceCheckUtils]: 0: Hoare triple {218#(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(10, 2);~counter~0 := 0; {216#(<= ~counter~0 0)} is VALID [2022-04-15 08:07:56,472 INFO L290 TraceCheckUtils]: 1: Hoare triple {216#(<= ~counter~0 0)} assume true; {216#(<= ~counter~0 0)} is VALID [2022-04-15 08:07:56,472 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {216#(<= ~counter~0 0)} {211#true} #82#return; {216#(<= ~counter~0 0)} is VALID [2022-04-15 08:07:56,473 INFO L272 TraceCheckUtils]: 0: Hoare triple {211#true} call ULTIMATE.init(); {218#(and (= ~counter~0 |old(~counter~0)|) (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} is VALID [2022-04-15 08:07:56,474 INFO L290 TraceCheckUtils]: 1: Hoare triple {218#(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(10, 2);~counter~0 := 0; {216#(<= ~counter~0 0)} is VALID [2022-04-15 08:07:56,474 INFO L290 TraceCheckUtils]: 2: Hoare triple {216#(<= ~counter~0 0)} assume true; {216#(<= ~counter~0 0)} is VALID [2022-04-15 08:07:56,475 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {216#(<= ~counter~0 0)} {211#true} #82#return; {216#(<= ~counter~0 0)} is VALID [2022-04-15 08:07:56,476 INFO L272 TraceCheckUtils]: 4: Hoare triple {216#(<= ~counter~0 0)} call #t~ret4 := main(); {216#(<= ~counter~0 0)} is VALID [2022-04-15 08:07:56,476 INFO L290 TraceCheckUtils]: 5: Hoare triple {216#(<= ~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 := 1;~q~0 := 0;~r~0 := ~A~0;~b~0 := ~B~0; {216#(<= ~counter~0 0)} is VALID [2022-04-15 08:07:56,477 INFO L290 TraceCheckUtils]: 6: Hoare triple {216#(<= ~counter~0 0)} #t~post2 := ~counter~0;~counter~0 := 1 + #t~post2; {217#(<= |main_#t~post2| 0)} is VALID [2022-04-15 08:07:56,477 INFO L290 TraceCheckUtils]: 7: Hoare triple {217#(<= |main_#t~post2| 0)} assume !(#t~post2 < 2);havoc #t~post2; {212#false} is VALID [2022-04-15 08:07:56,478 INFO L290 TraceCheckUtils]: 8: Hoare triple {212#false} #t~post3 := ~counter~0;~counter~0 := 1 + #t~post3; {212#false} is VALID [2022-04-15 08:07:56,478 INFO L290 TraceCheckUtils]: 9: Hoare triple {212#false} assume !(#t~post3 < 2);havoc #t~post3; {212#false} is VALID [2022-04-15 08:07:56,478 INFO L272 TraceCheckUtils]: 10: Hoare triple {212#false} call __VERIFIER_assert((if ~A~0 % 4294967296 == (~q~0 * ~b~0 + ~r~0) % 4294967296 then 1 else 0)); {212#false} is VALID [2022-04-15 08:07:56,478 INFO L290 TraceCheckUtils]: 11: Hoare triple {212#false} ~cond := #in~cond; {212#false} is VALID [2022-04-15 08:07:56,478 INFO L290 TraceCheckUtils]: 12: Hoare triple {212#false} assume 0 == ~cond; {212#false} is VALID [2022-04-15 08:07:56,479 INFO L290 TraceCheckUtils]: 13: Hoare triple {212#false} assume !false; {212#false} is VALID [2022-04-15 08:07:56,479 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-04-15 08:07:56,479 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-15 08:07:56,479 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [803342021] [2022-04-15 08:07:56,479 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [803342021] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-15 08:07:56,480 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-15 08:07:56,480 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-04-15 08:07:56,480 INFO L136 FreeRefinementEngine]: Strategy ACCELERATED_INTERPOLATION found an infeasible trace [2022-04-15 08:07:56,480 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleAcceleratedInterpolation [787619710] [2022-04-15 08:07:56,480 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleAcceleratedInterpolation [787619710] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-15 08:07:56,480 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-15 08:07:56,481 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-04-15 08:07:56,481 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1682584965] [2022-04-15 08:07:56,481 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-15 08:07:56,482 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 4 states have (on average 2.5) internal successors, (10), 3 states have internal predecessors, (10), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 14 [2022-04-15 08:07:56,482 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-15 08:07:56,482 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with has 5 states, 4 states have (on average 2.5) internal successors, (10), 3 states have internal predecessors, (10), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 08:07:56,494 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 14 edges. 14 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-15 08:07:56,495 INFO L554 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-04-15 08:07:56,495 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy ACCELERATED_INTERPOLATION [2022-04-15 08:07:56,496 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-04-15 08:07:56,496 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2022-04-15 08:07:56,496 INFO L87 Difference]: Start difference. First operand 21 states and 26 transitions. Second operand has 5 states, 4 states have (on average 2.5) internal successors, (10), 3 states have internal predecessors, (10), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 08:07:56,616 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-15 08:07:56,616 INFO L93 Difference]: Finished difference Result 35 states and 44 transitions. [2022-04-15 08:07:56,616 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2022-04-15 08:07:56,617 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 4 states have (on average 2.5) internal successors, (10), 3 states have internal predecessors, (10), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 14 [2022-04-15 08:07:56,617 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-15 08:07:56,617 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 5 states, 4 states have (on average 2.5) internal successors, (10), 3 states have internal predecessors, (10), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 08:07:56,619 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 44 transitions. [2022-04-15 08:07:56,619 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 5 states, 4 states have (on average 2.5) internal successors, (10), 3 states have internal predecessors, (10), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 08:07:56,621 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 44 transitions. [2022-04-15 08:07:56,621 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 6 states and 44 transitions. [2022-04-15 08:07:56,659 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 44 edges. 44 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-15 08:07:56,661 INFO L225 Difference]: With dead ends: 35 [2022-04-15 08:07:56,661 INFO L226 Difference]: Without dead ends: 23 [2022-04-15 08:07:56,661 INFO L912 BasicCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2022-04-15 08:07:56,663 INFO L913 BasicCegarLoop]: 24 mSDtfsCounter, 6 mSDsluCounter, 29 mSDsCounter, 0 mSdLazyCounter, 36 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 6 SdHoareTripleChecker+Valid, 53 SdHoareTripleChecker+Invalid, 39 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 36 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-04-15 08:07:56,663 INFO L914 BasicCegarLoop]: SdHoareTripleChecker [6 Valid, 53 Invalid, 39 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 36 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-04-15 08:07:56,664 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 23 states. [2022-04-15 08:07:56,672 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 23 to 23. [2022-04-15 08:07:56,672 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-15 08:07:56,672 INFO L82 GeneralOperation]: Start isEquivalent. First operand 23 states. Second operand has 23 states, 16 states have (on average 1.375) internal successors, (22), 17 states have internal predecessors, (22), 4 states have call successors, (4), 3 states have call predecessors, (4), 2 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2022-04-15 08:07:56,673 INFO L74 IsIncluded]: Start isIncluded. First operand 23 states. Second operand has 23 states, 16 states have (on average 1.375) internal successors, (22), 17 states have internal predecessors, (22), 4 states have call successors, (4), 3 states have call predecessors, (4), 2 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2022-04-15 08:07:56,673 INFO L87 Difference]: Start difference. First operand 23 states. Second operand has 23 states, 16 states have (on average 1.375) internal successors, (22), 17 states have internal predecessors, (22), 4 states have call successors, (4), 3 states have call predecessors, (4), 2 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2022-04-15 08:07:56,675 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-15 08:07:56,675 INFO L93 Difference]: Finished difference Result 23 states and 28 transitions. [2022-04-15 08:07:56,675 INFO L276 IsEmpty]: Start isEmpty. Operand 23 states and 28 transitions. [2022-04-15 08:07:56,675 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-15 08:07:56,676 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-15 08:07:56,676 INFO L74 IsIncluded]: Start isIncluded. First operand has 23 states, 16 states have (on average 1.375) internal successors, (22), 17 states have internal predecessors, (22), 4 states have call successors, (4), 3 states have call predecessors, (4), 2 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) Second operand 23 states. [2022-04-15 08:07:56,676 INFO L87 Difference]: Start difference. First operand has 23 states, 16 states have (on average 1.375) internal successors, (22), 17 states have internal predecessors, (22), 4 states have call successors, (4), 3 states have call predecessors, (4), 2 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) Second operand 23 states. [2022-04-15 08:07:56,678 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-15 08:07:56,678 INFO L93 Difference]: Finished difference Result 23 states and 28 transitions. [2022-04-15 08:07:56,678 INFO L276 IsEmpty]: Start isEmpty. Operand 23 states and 28 transitions. [2022-04-15 08:07:56,678 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-15 08:07:56,679 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-15 08:07:56,679 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-15 08:07:56,679 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-15 08:07:56,679 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 23 states, 16 states have (on average 1.375) internal successors, (22), 17 states have internal predecessors, (22), 4 states have call successors, (4), 3 states have call predecessors, (4), 2 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2022-04-15 08:07:56,681 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 23 states to 23 states and 28 transitions. [2022-04-15 08:07:56,681 INFO L78 Accepts]: Start accepts. Automaton has 23 states and 28 transitions. Word has length 14 [2022-04-15 08:07:56,681 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-15 08:07:56,681 INFO L478 AbstractCegarLoop]: Abstraction has 23 states and 28 transitions. [2022-04-15 08:07:56,682 INFO L479 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 4 states have (on average 2.5) internal successors, (10), 3 states have internal predecessors, (10), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 08:07:56,682 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 23 states and 28 transitions. [2022-04-15 08:07:56,708 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 28 edges. 28 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-15 08:07:56,708 INFO L276 IsEmpty]: Start isEmpty. Operand 23 states and 28 transitions. [2022-04-15 08:07:56,709 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 16 [2022-04-15 08:07:56,709 INFO L491 BasicCegarLoop]: Found error trace [2022-04-15 08:07:56,709 INFO L499 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-15 08:07:56,709 WARN L460 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2022-04-15 08:07:56,709 INFO L403 AbstractCegarLoop]: === Iteration 3 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-15 08:07:56,710 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-15 08:07:56,710 INFO L85 PathProgramCache]: Analyzing trace with hash -1209133518, now seen corresponding path program 1 times [2022-04-15 08:07:56,710 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION [2022-04-15 08:07:56,711 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [2127939234] [2022-04-15 08:07:56,711 INFO L202 tedInterpolationCore]: No loops in this trace, falling back to nested interpolation [2022-04-15 08:07:56,712 INFO L85 PathProgramCache]: Analyzing trace with hash -1209133518, now seen corresponding path program 2 times [2022-04-15 08:07:56,712 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-15 08:07:56,712 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [801110036] [2022-04-15 08:07:56,712 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-15 08:07:56,713 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-15 08:07:56,731 ERROR L245 FreeRefinementEngine]: Caught known exception: Unsupported non-linear arithmetic [2022-04-15 08:07:56,731 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [890614392] [2022-04-15 08:07:56,731 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2022-04-15 08:07:56,732 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-15 08:07:56,732 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-04-15 08:07:56,733 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-15 08:07:56,745 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-15 08:07:56,797 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s) [2022-04-15 08:07:56,800 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-04-15 08:07:56,803 INFO L263 TraceCheckSpWp]: Trace formula consists of 73 conjuncts, 7 conjunts are in the unsatisfiable core [2022-04-15 08:07:56,813 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-15 08:07:56,816 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-04-15 08:07:56,981 INFO L272 TraceCheckUtils]: 0: Hoare triple {385#true} call ULTIMATE.init(); {385#true} is VALID [2022-04-15 08:07:56,982 INFO L290 TraceCheckUtils]: 1: Hoare triple {385#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(10, 2);~counter~0 := 0; {393#(<= ~counter~0 0)} is VALID [2022-04-15 08:07:56,982 INFO L290 TraceCheckUtils]: 2: Hoare triple {393#(<= ~counter~0 0)} assume true; {393#(<= ~counter~0 0)} is VALID [2022-04-15 08:07:56,983 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {393#(<= ~counter~0 0)} {385#true} #82#return; {393#(<= ~counter~0 0)} is VALID [2022-04-15 08:07:56,984 INFO L272 TraceCheckUtils]: 4: Hoare triple {393#(<= ~counter~0 0)} call #t~ret4 := main(); {393#(<= ~counter~0 0)} is VALID [2022-04-15 08:07:56,985 INFO L290 TraceCheckUtils]: 5: Hoare triple {393#(<= ~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 := 1;~q~0 := 0;~r~0 := ~A~0;~b~0 := ~B~0; {393#(<= ~counter~0 0)} is VALID [2022-04-15 08:07:56,986 INFO L290 TraceCheckUtils]: 6: Hoare triple {393#(<= ~counter~0 0)} #t~post2 := ~counter~0;~counter~0 := 1 + #t~post2; {409#(<= ~counter~0 1)} is VALID [2022-04-15 08:07:56,986 INFO L290 TraceCheckUtils]: 7: Hoare triple {409#(<= ~counter~0 1)} assume !!(#t~post2 < 2);havoc #t~post2; {409#(<= ~counter~0 1)} is VALID [2022-04-15 08:07:56,987 INFO L290 TraceCheckUtils]: 8: Hoare triple {409#(<= ~counter~0 1)} assume !(~r~0 % 4294967296 >= ~b~0 % 4294967296); {409#(<= ~counter~0 1)} is VALID [2022-04-15 08:07:56,988 INFO L290 TraceCheckUtils]: 9: Hoare triple {409#(<= ~counter~0 1)} #t~post3 := ~counter~0;~counter~0 := 1 + #t~post3; {419#(<= |main_#t~post3| 1)} is VALID [2022-04-15 08:07:56,989 INFO L290 TraceCheckUtils]: 10: Hoare triple {419#(<= |main_#t~post3| 1)} assume !(#t~post3 < 2);havoc #t~post3; {386#false} is VALID [2022-04-15 08:07:56,989 INFO L272 TraceCheckUtils]: 11: Hoare triple {386#false} call __VERIFIER_assert((if ~A~0 % 4294967296 == (~q~0 * ~b~0 + ~r~0) % 4294967296 then 1 else 0)); {386#false} is VALID [2022-04-15 08:07:56,989 INFO L290 TraceCheckUtils]: 12: Hoare triple {386#false} ~cond := #in~cond; {386#false} is VALID [2022-04-15 08:07:56,989 INFO L290 TraceCheckUtils]: 13: Hoare triple {386#false} assume 0 == ~cond; {386#false} is VALID [2022-04-15 08:07:56,989 INFO L290 TraceCheckUtils]: 14: Hoare triple {386#false} assume !false; {386#false} is VALID [2022-04-15 08:07:56,990 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-04-15 08:07:56,990 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-04-15 08:07:56,990 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-15 08:07:56,990 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [801110036] [2022-04-15 08:07:56,990 WARN L310 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2022-04-15 08:07:56,990 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [890614392] [2022-04-15 08:07:56,991 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [890614392] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-15 08:07:56,991 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-15 08:07:56,991 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2022-04-15 08:07:56,992 INFO L136 FreeRefinementEngine]: Strategy ACCELERATED_INTERPOLATION found an infeasible trace [2022-04-15 08:07:56,992 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleAcceleratedInterpolation [2127939234] [2022-04-15 08:07:56,992 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleAcceleratedInterpolation [2127939234] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-15 08:07:56,992 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-15 08:07:56,992 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2022-04-15 08:07:56,992 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1407009774] [2022-04-15 08:07:56,992 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-15 08:07:56,993 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 2.2) internal successors, (11), 4 states have internal predecessors, (11), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 15 [2022-04-15 08:07:56,994 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-15 08:07:56,994 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with has 5 states, 5 states have (on average 2.2) internal successors, (11), 4 states have internal predecessors, (11), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 08:07:57,025 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 15 edges. 15 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-15 08:07:57,026 INFO L554 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-04-15 08:07:57,026 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy ACCELERATED_INTERPOLATION [2022-04-15 08:07:57,027 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-04-15 08:07:57,027 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2022-04-15 08:07:57,027 INFO L87 Difference]: Start difference. First operand 23 states and 28 transitions. Second operand has 5 states, 5 states have (on average 2.2) internal successors, (11), 4 states have internal predecessors, (11), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 08:07:57,133 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-15 08:07:57,133 INFO L93 Difference]: Finished difference Result 34 states and 40 transitions. [2022-04-15 08:07:57,133 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-04-15 08:07:57,134 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 2.2) internal successors, (11), 4 states have internal predecessors, (11), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 15 [2022-04-15 08:07:57,134 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-15 08:07:57,134 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 5 states, 5 states have (on average 2.2) internal successors, (11), 4 states have internal predecessors, (11), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 08:07:57,136 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 40 transitions. [2022-04-15 08:07:57,136 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 5 states, 5 states have (on average 2.2) internal successors, (11), 4 states have internal predecessors, (11), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 08:07:57,137 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 40 transitions. [2022-04-15 08:07:57,138 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 5 states and 40 transitions. [2022-04-15 08:07:57,170 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 40 edges. 40 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-15 08:07:57,172 INFO L225 Difference]: With dead ends: 34 [2022-04-15 08:07:57,172 INFO L226 Difference]: Without dead ends: 27 [2022-04-15 08:07:57,173 INFO L912 BasicCegarLoop]: 0 DeclaredPredicates, 14 GetRequests, 11 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2022-04-15 08:07:57,179 INFO L913 BasicCegarLoop]: 23 mSDtfsCounter, 3 mSDsluCounter, 58 mSDsCounter, 0 mSdLazyCounter, 13 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 3 SdHoareTripleChecker+Valid, 81 SdHoareTripleChecker+Invalid, 16 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 13 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-04-15 08:07:57,185 INFO L914 BasicCegarLoop]: SdHoareTripleChecker [3 Valid, 81 Invalid, 16 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 13 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-04-15 08:07:57,186 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 27 states. [2022-04-15 08:07:57,200 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 27 to 26. [2022-04-15 08:07:57,200 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-15 08:07:57,201 INFO L82 GeneralOperation]: Start isEquivalent. First operand 27 states. Second operand has 26 states, 19 states have (on average 1.368421052631579) internal successors, (26), 20 states have internal predecessors, (26), 4 states have call successors, (4), 3 states have call predecessors, (4), 2 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2022-04-15 08:07:57,202 INFO L74 IsIncluded]: Start isIncluded. First operand 27 states. Second operand has 26 states, 19 states have (on average 1.368421052631579) internal successors, (26), 20 states have internal predecessors, (26), 4 states have call successors, (4), 3 states have call predecessors, (4), 2 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2022-04-15 08:07:57,203 INFO L87 Difference]: Start difference. First operand 27 states. Second operand has 26 states, 19 states have (on average 1.368421052631579) internal successors, (26), 20 states have internal predecessors, (26), 4 states have call successors, (4), 3 states have call predecessors, (4), 2 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2022-04-15 08:07:57,205 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-15 08:07:57,206 INFO L93 Difference]: Finished difference Result 27 states and 33 transitions. [2022-04-15 08:07:57,206 INFO L276 IsEmpty]: Start isEmpty. Operand 27 states and 33 transitions. [2022-04-15 08:07:57,207 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-15 08:07:57,207 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-15 08:07:57,208 INFO L74 IsIncluded]: Start isIncluded. First operand has 26 states, 19 states have (on average 1.368421052631579) internal successors, (26), 20 states have internal predecessors, (26), 4 states have call successors, (4), 3 states have call predecessors, (4), 2 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) Second operand 27 states. [2022-04-15 08:07:57,210 INFO L87 Difference]: Start difference. First operand has 26 states, 19 states have (on average 1.368421052631579) internal successors, (26), 20 states have internal predecessors, (26), 4 states have call successors, (4), 3 states have call predecessors, (4), 2 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) Second operand 27 states. [2022-04-15 08:07:57,214 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-15 08:07:57,214 INFO L93 Difference]: Finished difference Result 27 states and 33 transitions. [2022-04-15 08:07:57,214 INFO L276 IsEmpty]: Start isEmpty. Operand 27 states and 33 transitions. [2022-04-15 08:07:57,214 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-15 08:07:57,215 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-15 08:07:57,215 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-15 08:07:57,215 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-15 08:07:57,215 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 26 states, 19 states have (on average 1.368421052631579) internal successors, (26), 20 states have internal predecessors, (26), 4 states have call successors, (4), 3 states have call predecessors, (4), 2 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2022-04-15 08:07:57,216 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 26 states to 26 states and 32 transitions. [2022-04-15 08:07:57,216 INFO L78 Accepts]: Start accepts. Automaton has 26 states and 32 transitions. Word has length 15 [2022-04-15 08:07:57,216 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-15 08:07:57,217 INFO L478 AbstractCegarLoop]: Abstraction has 26 states and 32 transitions. [2022-04-15 08:07:57,217 INFO L479 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 2.2) internal successors, (11), 4 states have internal predecessors, (11), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 08:07:57,217 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 26 states and 32 transitions. [2022-04-15 08:07:57,249 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 32 edges. 32 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-15 08:07:57,250 INFO L276 IsEmpty]: Start isEmpty. Operand 26 states and 32 transitions. [2022-04-15 08:07:57,250 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 16 [2022-04-15 08:07:57,250 INFO L491 BasicCegarLoop]: Found error trace [2022-04-15 08:07:57,250 INFO L499 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-15 08:07:57,284 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-15 08:07:57,474 WARN L460 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2,2 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-15 08:07:57,474 INFO L403 AbstractCegarLoop]: === Iteration 4 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-15 08:07:57,475 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-15 08:07:57,475 INFO L85 PathProgramCache]: Analyzing trace with hash -1207346058, now seen corresponding path program 1 times [2022-04-15 08:07:57,475 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION [2022-04-15 08:07:57,475 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [415369018] [2022-04-15 08:07:57,476 INFO L202 tedInterpolationCore]: No loops in this trace, falling back to nested interpolation [2022-04-15 08:07:57,476 INFO L85 PathProgramCache]: Analyzing trace with hash -1207346058, now seen corresponding path program 2 times [2022-04-15 08:07:57,476 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-15 08:07:57,476 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [932474554] [2022-04-15 08:07:57,477 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-15 08:07:57,477 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-15 08:07:57,497 ERROR L245 FreeRefinementEngine]: Caught known exception: Unsupported non-linear arithmetic [2022-04-15 08:07:57,497 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [980418443] [2022-04-15 08:07:57,498 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2022-04-15 08:07:57,498 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-15 08:07:57,498 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-04-15 08:07:57,509 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-15 08:07:57,510 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-15 08:07:57,560 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s) [2022-04-15 08:07:57,560 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-04-15 08:07:57,561 INFO L263 TraceCheckSpWp]: Trace formula consists of 73 conjuncts, 14 conjunts are in the unsatisfiable core [2022-04-15 08:07:57,569 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-15 08:07:57,570 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-04-15 08:07:57,859 INFO L272 TraceCheckUtils]: 0: Hoare triple {608#true} call ULTIMATE.init(); {608#true} is VALID [2022-04-15 08:07:57,862 INFO L290 TraceCheckUtils]: 1: Hoare triple {608#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(10, 2);~counter~0 := 0; {608#true} is VALID [2022-04-15 08:07:57,863 INFO L290 TraceCheckUtils]: 2: Hoare triple {608#true} assume true; {608#true} is VALID [2022-04-15 08:07:57,864 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {608#true} {608#true} #82#return; {608#true} is VALID [2022-04-15 08:07:57,864 INFO L272 TraceCheckUtils]: 4: Hoare triple {608#true} call #t~ret4 := main(); {608#true} is VALID [2022-04-15 08:07:57,866 INFO L290 TraceCheckUtils]: 5: Hoare triple {608#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 := 1;~q~0 := 0;~r~0 := ~A~0;~b~0 := ~B~0; {628#(and (= main_~b~0 1) (= main_~A~0 main_~r~0) (= main_~q~0 0))} is VALID [2022-04-15 08:07:57,868 INFO L290 TraceCheckUtils]: 6: Hoare triple {628#(and (= main_~b~0 1) (= main_~A~0 main_~r~0) (= main_~q~0 0))} #t~post2 := ~counter~0;~counter~0 := 1 + #t~post2; {628#(and (= main_~b~0 1) (= main_~A~0 main_~r~0) (= main_~q~0 0))} is VALID [2022-04-15 08:07:57,869 INFO L290 TraceCheckUtils]: 7: Hoare triple {628#(and (= main_~b~0 1) (= main_~A~0 main_~r~0) (= main_~q~0 0))} assume !!(#t~post2 < 2);havoc #t~post2; {628#(and (= main_~b~0 1) (= main_~A~0 main_~r~0) (= main_~q~0 0))} is VALID [2022-04-15 08:07:57,870 INFO L290 TraceCheckUtils]: 8: Hoare triple {628#(and (= main_~b~0 1) (= main_~A~0 main_~r~0) (= main_~q~0 0))} assume !(~r~0 % 4294967296 >= ~b~0 % 4294967296); {638#(and (= main_~b~0 1) (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-15 08:07:57,872 INFO L290 TraceCheckUtils]: 9: Hoare triple {638#(and (= main_~b~0 1) (not (<= (mod main_~b~0 4294967296) (mod main_~r~0 4294967296))) (= main_~A~0 main_~r~0) (= main_~q~0 0))} #t~post3 := ~counter~0;~counter~0 := 1 + #t~post3; {638#(and (= main_~b~0 1) (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-15 08:07:57,873 INFO L290 TraceCheckUtils]: 10: Hoare triple {638#(and (= main_~b~0 1) (not (<= (mod main_~b~0 4294967296) (mod main_~r~0 4294967296))) (= main_~A~0 main_~r~0) (= main_~q~0 0))} assume !!(#t~post3 < 2);havoc #t~post3; {638#(and (= main_~b~0 1) (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-15 08:07:57,875 INFO L272 TraceCheckUtils]: 11: Hoare triple {638#(and (= main_~b~0 1) (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)); {648#(<= 1 |__VERIFIER_assert_#in~cond|)} is VALID [2022-04-15 08:07:57,876 INFO L290 TraceCheckUtils]: 12: Hoare triple {648#(<= 1 |__VERIFIER_assert_#in~cond|)} ~cond := #in~cond; {652#(<= 1 __VERIFIER_assert_~cond)} is VALID [2022-04-15 08:07:57,877 INFO L290 TraceCheckUtils]: 13: Hoare triple {652#(<= 1 __VERIFIER_assert_~cond)} assume 0 == ~cond; {609#false} is VALID [2022-04-15 08:07:57,877 INFO L290 TraceCheckUtils]: 14: Hoare triple {609#false} assume !false; {609#false} is VALID [2022-04-15 08:07:57,878 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-04-15 08:07:57,878 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-04-15 08:07:57,878 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-15 08:07:57,878 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [932474554] [2022-04-15 08:07:57,878 WARN L310 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2022-04-15 08:07:57,878 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [980418443] [2022-04-15 08:07:57,879 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [980418443] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-15 08:07:57,879 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-15 08:07:57,879 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2022-04-15 08:07:57,879 INFO L136 FreeRefinementEngine]: Strategy ACCELERATED_INTERPOLATION found an infeasible trace [2022-04-15 08:07:57,879 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleAcceleratedInterpolation [415369018] [2022-04-15 08:07:57,879 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleAcceleratedInterpolation [415369018] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-15 08:07:57,879 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-15 08:07:57,880 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2022-04-15 08:07:57,880 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [940873830] [2022-04-15 08:07:57,880 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-15 08:07:57,880 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 1.8333333333333333) internal successors, (11), 5 states have internal predecessors, (11), 2 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 15 [2022-04-15 08:07:57,880 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-15 08:07:57,881 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with has 6 states, 6 states have (on average 1.8333333333333333) internal successors, (11), 5 states have internal predecessors, (11), 2 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 08:07:57,897 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 15 edges. 15 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-15 08:07:57,897 INFO L554 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2022-04-15 08:07:57,897 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy ACCELERATED_INTERPOLATION [2022-04-15 08:07:57,898 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2022-04-15 08:07:57,899 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2022-04-15 08:07:57,899 INFO L87 Difference]: Start difference. First operand 26 states and 32 transitions. Second operand has 6 states, 6 states have (on average 1.8333333333333333) internal successors, (11), 5 states have internal predecessors, (11), 2 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 08:07:58,155 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-15 08:07:58,155 INFO L93 Difference]: Finished difference Result 35 states and 42 transitions. [2022-04-15 08:07:58,155 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2022-04-15 08:07:58,156 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 1.8333333333333333) internal successors, (11), 5 states have internal predecessors, (11), 2 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 15 [2022-04-15 08:07:58,156 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-15 08:07:58,156 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 6 states, 6 states have (on average 1.8333333333333333) internal successors, (11), 5 states have internal predecessors, (11), 2 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 08:07:58,157 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 42 transitions. [2022-04-15 08:07:58,158 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 6 states, 6 states have (on average 1.8333333333333333) internal successors, (11), 5 states have internal predecessors, (11), 2 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 08:07:58,159 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 42 transitions. [2022-04-15 08:07:58,159 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 6 states and 42 transitions. [2022-04-15 08:07:58,202 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 42 edges. 42 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-15 08:07:58,204 INFO L225 Difference]: With dead ends: 35 [2022-04-15 08:07:58,204 INFO L226 Difference]: Without dead ends: 32 [2022-04-15 08:07:58,204 INFO L912 BasicCegarLoop]: 0 DeclaredPredicates, 15 GetRequests, 10 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-15 08:07:58,205 INFO L913 BasicCegarLoop]: 21 mSDtfsCounter, 9 mSDsluCounter, 67 mSDsCounter, 0 mSdLazyCounter, 48 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 10 SdHoareTripleChecker+Valid, 88 SdHoareTripleChecker+Invalid, 49 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 48 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-04-15 08:07:58,205 INFO L914 BasicCegarLoop]: SdHoareTripleChecker [10 Valid, 88 Invalid, 49 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 48 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-04-15 08:07:58,206 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 32 states. [2022-04-15 08:07:58,227 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 32 to 32. [2022-04-15 08:07:58,227 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-15 08:07:58,228 INFO L82 GeneralOperation]: Start isEquivalent. First operand 32 states. Second operand has 32 states, 23 states have (on average 1.3043478260869565) internal successors, (30), 24 states have internal predecessors, (30), 5 states have call successors, (5), 4 states have call predecessors, (5), 3 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) [2022-04-15 08:07:58,228 INFO L74 IsIncluded]: Start isIncluded. First operand 32 states. Second operand has 32 states, 23 states have (on average 1.3043478260869565) internal successors, (30), 24 states have internal predecessors, (30), 5 states have call successors, (5), 4 states have call predecessors, (5), 3 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) [2022-04-15 08:07:58,228 INFO L87 Difference]: Start difference. First operand 32 states. Second operand has 32 states, 23 states have (on average 1.3043478260869565) internal successors, (30), 24 states have internal predecessors, (30), 5 states have call successors, (5), 4 states have call predecessors, (5), 3 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) [2022-04-15 08:07:58,229 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-15 08:07:58,230 INFO L93 Difference]: Finished difference Result 32 states and 38 transitions. [2022-04-15 08:07:58,230 INFO L276 IsEmpty]: Start isEmpty. Operand 32 states and 38 transitions. [2022-04-15 08:07:58,230 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-15 08:07:58,230 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-15 08:07:58,230 INFO L74 IsIncluded]: Start isIncluded. First operand has 32 states, 23 states have (on average 1.3043478260869565) internal successors, (30), 24 states have internal predecessors, (30), 5 states have call successors, (5), 4 states have call predecessors, (5), 3 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) Second operand 32 states. [2022-04-15 08:07:58,231 INFO L87 Difference]: Start difference. First operand has 32 states, 23 states have (on average 1.3043478260869565) internal successors, (30), 24 states have internal predecessors, (30), 5 states have call successors, (5), 4 states have call predecessors, (5), 3 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) Second operand 32 states. [2022-04-15 08:07:58,232 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-15 08:07:58,232 INFO L93 Difference]: Finished difference Result 32 states and 38 transitions. [2022-04-15 08:07:58,232 INFO L276 IsEmpty]: Start isEmpty. Operand 32 states and 38 transitions. [2022-04-15 08:07:58,233 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-15 08:07:58,233 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-15 08:07:58,233 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-15 08:07:58,233 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-15 08:07:58,233 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 32 states, 23 states have (on average 1.3043478260869565) internal successors, (30), 24 states have internal predecessors, (30), 5 states have call successors, (5), 4 states have call predecessors, (5), 3 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) [2022-04-15 08:07:58,235 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 32 states to 32 states and 38 transitions. [2022-04-15 08:07:58,235 INFO L78 Accepts]: Start accepts. Automaton has 32 states and 38 transitions. Word has length 15 [2022-04-15 08:07:58,235 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-15 08:07:58,235 INFO L478 AbstractCegarLoop]: Abstraction has 32 states and 38 transitions. [2022-04-15 08:07:58,235 INFO L479 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 1.8333333333333333) internal successors, (11), 5 states have internal predecessors, (11), 2 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 08:07:58,235 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 32 states and 38 transitions. [2022-04-15 08:07:58,284 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 38 edges. 38 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-15 08:07:58,284 INFO L276 IsEmpty]: Start isEmpty. Operand 32 states and 38 transitions. [2022-04-15 08:07:58,285 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 18 [2022-04-15 08:07:58,285 INFO L491 BasicCegarLoop]: Found error trace [2022-04-15 08:07:58,285 INFO L499 BasicCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-15 08:07:58,311 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Forceful destruction successful, exit code 0 [2022-04-15 08:07:58,495 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,SelfDestructingSolverStorable3 [2022-04-15 08:07:58,496 INFO L403 AbstractCegarLoop]: === Iteration 5 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-15 08:07:58,496 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-15 08:07:58,496 INFO L85 PathProgramCache]: Analyzing trace with hash -352921097, now seen corresponding path program 1 times [2022-04-15 08:07:58,496 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION [2022-04-15 08:07:58,496 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [161102605] [2022-04-15 08:07:58,516 INFO L89 AcceleratorJordan]: Jordan loop acceleration statistics: 1 HavocedVariables, 2 AssignedVariables, 0 ReadonlyVariables, Eigenvalues: {}, 0 SequentialAcceleration, 0 AlternatingAcceleration, 0 QuantifierFreeResult [2022-04-15 08:07:58,516 WARN L91 AcceleratorJordan]: Jordan acceleration failed, because UNSUPPORTED_EIGENVALUES [2022-04-15 08:07:58,517 INFO L274 tedInterpolationCore]: Could not compute an accelerate. [2022-04-15 08:07:58,517 INFO L85 PathProgramCache]: Analyzing trace with hash -352921097, now seen corresponding path program 2 times [2022-04-15 08:07:58,517 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-15 08:07:58,517 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [63683582] [2022-04-15 08:07:58,517 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-15 08:07:58,517 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-15 08:07:58,532 ERROR L245 FreeRefinementEngine]: Caught known exception: Unsupported non-linear arithmetic [2022-04-15 08:07:58,532 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [1777876414] [2022-04-15 08:07:58,532 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2022-04-15 08:07:58,532 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-15 08:07:58,533 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-04-15 08:07:58,534 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-15 08:07:58,537 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-15 08:07:58,588 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s) [2022-04-15 08:07:58,589 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-04-15 08:07:58,590 INFO L263 TraceCheckSpWp]: Trace formula consists of 72 conjuncts, 7 conjunts are in the unsatisfiable core [2022-04-15 08:07:58,603 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-15 08:07:58,604 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-04-15 08:07:58,726 INFO L272 TraceCheckUtils]: 0: Hoare triple {858#true} call ULTIMATE.init(); {858#true} is VALID [2022-04-15 08:07:58,727 INFO L290 TraceCheckUtils]: 1: Hoare triple {858#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(10, 2);~counter~0 := 0; {858#true} is VALID [2022-04-15 08:07:58,727 INFO L290 TraceCheckUtils]: 2: Hoare triple {858#true} assume true; {858#true} is VALID [2022-04-15 08:07:58,727 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {858#true} {858#true} #82#return; {858#true} is VALID [2022-04-15 08:07:58,727 INFO L272 TraceCheckUtils]: 4: Hoare triple {858#true} call #t~ret4 := main(); {858#true} is VALID [2022-04-15 08:07:58,728 INFO L290 TraceCheckUtils]: 5: Hoare triple {858#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 := 1;~q~0 := 0;~r~0 := ~A~0;~b~0 := ~B~0; {878#(and (= main_~A~0 main_~r~0) (= main_~q~0 0))} is VALID [2022-04-15 08:07:58,729 INFO L290 TraceCheckUtils]: 6: Hoare triple {878#(and (= main_~A~0 main_~r~0) (= main_~q~0 0))} #t~post2 := ~counter~0;~counter~0 := 1 + #t~post2; {878#(and (= main_~A~0 main_~r~0) (= main_~q~0 0))} is VALID [2022-04-15 08:07:58,730 INFO L290 TraceCheckUtils]: 7: Hoare triple {878#(and (= main_~A~0 main_~r~0) (= main_~q~0 0))} assume !!(#t~post2 < 2);havoc #t~post2; {878#(and (= main_~A~0 main_~r~0) (= main_~q~0 0))} is VALID [2022-04-15 08:07:58,730 INFO L290 TraceCheckUtils]: 8: Hoare triple {878#(and (= main_~A~0 main_~r~0) (= main_~q~0 0))} assume !!(~r~0 % 4294967296 >= ~b~0 % 4294967296);~b~0 := 2 * ~b~0; {878#(and (= main_~A~0 main_~r~0) (= main_~q~0 0))} is VALID [2022-04-15 08:07:58,731 INFO L290 TraceCheckUtils]: 9: Hoare triple {878#(and (= main_~A~0 main_~r~0) (= main_~q~0 0))} #t~post2 := ~counter~0;~counter~0 := 1 + #t~post2; {878#(and (= main_~A~0 main_~r~0) (= main_~q~0 0))} is VALID [2022-04-15 08:07:58,731 INFO L290 TraceCheckUtils]: 10: Hoare triple {878#(and (= main_~A~0 main_~r~0) (= main_~q~0 0))} assume !(#t~post2 < 2);havoc #t~post2; {878#(and (= main_~A~0 main_~r~0) (= main_~q~0 0))} is VALID [2022-04-15 08:07:58,732 INFO L290 TraceCheckUtils]: 11: Hoare triple {878#(and (= main_~A~0 main_~r~0) (= main_~q~0 0))} #t~post3 := ~counter~0;~counter~0 := 1 + #t~post3; {878#(and (= main_~A~0 main_~r~0) (= main_~q~0 0))} is VALID [2022-04-15 08:07:58,732 INFO L290 TraceCheckUtils]: 12: Hoare triple {878#(and (= main_~A~0 main_~r~0) (= main_~q~0 0))} assume !(#t~post3 < 2);havoc #t~post3; {878#(and (= main_~A~0 main_~r~0) (= main_~q~0 0))} is VALID [2022-04-15 08:07:58,734 INFO L272 TraceCheckUtils]: 13: Hoare triple {878#(and (= main_~A~0 main_~r~0) (= main_~q~0 0))} call __VERIFIER_assert((if ~A~0 % 4294967296 == (~q~0 * ~b~0 + ~r~0) % 4294967296 then 1 else 0)); {903#(<= 1 |__VERIFIER_assert_#in~cond|)} is VALID [2022-04-15 08:07:58,734 INFO L290 TraceCheckUtils]: 14: Hoare triple {903#(<= 1 |__VERIFIER_assert_#in~cond|)} ~cond := #in~cond; {907#(<= 1 __VERIFIER_assert_~cond)} is VALID [2022-04-15 08:07:58,735 INFO L290 TraceCheckUtils]: 15: Hoare triple {907#(<= 1 __VERIFIER_assert_~cond)} assume 0 == ~cond; {859#false} is VALID [2022-04-15 08:07:58,735 INFO L290 TraceCheckUtils]: 16: Hoare triple {859#false} assume !false; {859#false} is VALID [2022-04-15 08:07:58,735 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2022-04-15 08:07:58,735 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-04-15 08:07:58,736 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-15 08:07:58,736 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [63683582] [2022-04-15 08:07:58,736 WARN L310 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2022-04-15 08:07:58,736 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1777876414] [2022-04-15 08:07:58,736 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1777876414] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-15 08:07:58,736 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-15 08:07:58,736 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2022-04-15 08:07:58,737 INFO L136 FreeRefinementEngine]: Strategy ACCELERATED_INTERPOLATION found an infeasible trace [2022-04-15 08:07:58,737 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleAcceleratedInterpolation [161102605] [2022-04-15 08:07:58,737 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleAcceleratedInterpolation [161102605] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-15 08:07:58,737 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-15 08:07:58,737 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2022-04-15 08:07:58,737 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1144265536] [2022-04-15 08:07:58,737 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-15 08:07:58,738 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 2.4) internal successors, (12), 4 states have internal predecessors, (12), 2 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 17 [2022-04-15 08:07:58,738 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-15 08:07:58,738 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with has 5 states, 5 states have (on average 2.4) internal successors, (12), 4 states have internal predecessors, (12), 2 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 08:07:58,754 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 16 edges. 16 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-15 08:07:58,754 INFO L554 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-04-15 08:07:58,754 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy ACCELERATED_INTERPOLATION [2022-04-15 08:07:58,755 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-04-15 08:07:58,755 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2022-04-15 08:07:58,755 INFO L87 Difference]: Start difference. First operand 32 states and 38 transitions. Second operand has 5 states, 5 states have (on average 2.4) internal successors, (12), 4 states have internal predecessors, (12), 2 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 08:08:00,924 WARN L534 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [] [2022-04-15 08:08:01,010 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-15 08:08:01,011 INFO L93 Difference]: Finished difference Result 44 states and 53 transitions. [2022-04-15 08:08:01,011 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-04-15 08:08:01,011 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 2.4) internal successors, (12), 4 states have internal predecessors, (12), 2 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 17 [2022-04-15 08:08:01,012 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-15 08:08:01,012 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 5 states, 5 states have (on average 2.4) internal successors, (12), 4 states have internal predecessors, (12), 2 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 08:08:01,013 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 41 transitions. [2022-04-15 08:08:01,013 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 5 states, 5 states have (on average 2.4) internal successors, (12), 4 states have internal predecessors, (12), 2 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 08:08:01,015 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 41 transitions. [2022-04-15 08:08:01,015 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 5 states and 41 transitions. [2022-04-15 08:08:01,086 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 41 edges. 41 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-15 08:08:01,088 INFO L225 Difference]: With dead ends: 44 [2022-04-15 08:08:01,088 INFO L226 Difference]: Without dead ends: 41 [2022-04-15 08:08:01,088 INFO L912 BasicCegarLoop]: 0 DeclaredPredicates, 17 GetRequests, 13 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2022-04-15 08:08:01,089 INFO L913 BasicCegarLoop]: 19 mSDtfsCounter, 9 mSDsluCounter, 47 mSDsCounter, 0 mSdLazyCounter, 34 mSolverCounterSat, 2 mSolverCounterUnsat, 1 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 2.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 10 SdHoareTripleChecker+Valid, 66 SdHoareTripleChecker+Invalid, 37 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 34 IncrementalHoareTripleChecker+Invalid, 1 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 2.1s IncrementalHoareTripleChecker+Time [2022-04-15 08:08:01,089 INFO L914 BasicCegarLoop]: SdHoareTripleChecker [10 Valid, 66 Invalid, 37 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 34 Invalid, 1 Unknown, 0 Unchecked, 2.1s Time] [2022-04-15 08:08:01,089 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 41 states. [2022-04-15 08:08:01,114 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 41 to 32. [2022-04-15 08:08:01,114 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-15 08:08:01,115 INFO L82 GeneralOperation]: Start isEquivalent. First operand 41 states. Second operand has 32 states, 23 states have (on average 1.3043478260869565) internal successors, (30), 24 states have internal predecessors, (30), 5 states have call successors, (5), 4 states have call predecessors, (5), 3 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) [2022-04-15 08:08:01,115 INFO L74 IsIncluded]: Start isIncluded. First operand 41 states. Second operand has 32 states, 23 states have (on average 1.3043478260869565) internal successors, (30), 24 states have internal predecessors, (30), 5 states have call successors, (5), 4 states have call predecessors, (5), 3 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) [2022-04-15 08:08:01,115 INFO L87 Difference]: Start difference. First operand 41 states. Second operand has 32 states, 23 states have (on average 1.3043478260869565) internal successors, (30), 24 states have internal predecessors, (30), 5 states have call successors, (5), 4 states have call predecessors, (5), 3 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) [2022-04-15 08:08:01,117 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-15 08:08:01,117 INFO L93 Difference]: Finished difference Result 41 states and 48 transitions. [2022-04-15 08:08:01,117 INFO L276 IsEmpty]: Start isEmpty. Operand 41 states and 48 transitions. [2022-04-15 08:08:01,117 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-15 08:08:01,117 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-15 08:08:01,118 INFO L74 IsIncluded]: Start isIncluded. First operand has 32 states, 23 states have (on average 1.3043478260869565) internal successors, (30), 24 states have internal predecessors, (30), 5 states have call successors, (5), 4 states have call predecessors, (5), 3 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) Second operand 41 states. [2022-04-15 08:08:01,118 INFO L87 Difference]: Start difference. First operand has 32 states, 23 states have (on average 1.3043478260869565) internal successors, (30), 24 states have internal predecessors, (30), 5 states have call successors, (5), 4 states have call predecessors, (5), 3 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) Second operand 41 states. [2022-04-15 08:08:01,119 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-15 08:08:01,119 INFO L93 Difference]: Finished difference Result 41 states and 48 transitions. [2022-04-15 08:08:01,119 INFO L276 IsEmpty]: Start isEmpty. Operand 41 states and 48 transitions. [2022-04-15 08:08:01,120 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-15 08:08:01,120 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-15 08:08:01,120 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-15 08:08:01,120 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-15 08:08:01,120 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 32 states, 23 states have (on average 1.3043478260869565) internal successors, (30), 24 states have internal predecessors, (30), 5 states have call successors, (5), 4 states have call predecessors, (5), 3 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) [2022-04-15 08:08:01,121 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 32 states to 32 states and 38 transitions. [2022-04-15 08:08:01,121 INFO L78 Accepts]: Start accepts. Automaton has 32 states and 38 transitions. Word has length 17 [2022-04-15 08:08:01,121 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-15 08:08:01,122 INFO L478 AbstractCegarLoop]: Abstraction has 32 states and 38 transitions. [2022-04-15 08:08:01,122 INFO L479 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 2.4) internal successors, (12), 4 states have internal predecessors, (12), 2 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 08:08:01,122 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 32 states and 38 transitions. [2022-04-15 08:08:01,170 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 38 edges. 38 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-15 08:08:01,171 INFO L276 IsEmpty]: Start isEmpty. Operand 32 states and 38 transitions. [2022-04-15 08:08:01,171 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 25 [2022-04-15 08:08:01,171 INFO L491 BasicCegarLoop]: Found error trace [2022-04-15 08:08:01,171 INFO L499 BasicCegarLoop]: trace histogram [2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-15 08:08:01,188 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Ended with exit code 0 [2022-04-15 08:08:01,372 WARN L460 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4,4 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-15 08:08:01,372 INFO L403 AbstractCegarLoop]: === Iteration 6 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-15 08:08:01,373 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-15 08:08:01,373 INFO L85 PathProgramCache]: Analyzing trace with hash 1626008211, now seen corresponding path program 1 times [2022-04-15 08:08:01,373 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION [2022-04-15 08:08:01,373 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [1351119427] [2022-04-15 08:08:01,373 INFO L274 tedInterpolationCore]: Could not compute an accelerate. [2022-04-15 08:08:01,373 INFO L85 PathProgramCache]: Analyzing trace with hash 1626008211, now seen corresponding path program 2 times [2022-04-15 08:08:01,374 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-15 08:08:01,374 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [426704122] [2022-04-15 08:08:01,374 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-15 08:08:01,374 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-15 08:08:01,418 ERROR L245 FreeRefinementEngine]: Caught known exception: Unsupported non-linear arithmetic [2022-04-15 08:08:01,418 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [561777957] [2022-04-15 08:08:01,419 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2022-04-15 08:08:01,419 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-15 08:08:01,419 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-04-15 08:08:01,423 INFO L229 MonitoredProcess]: Starting monitored process 5 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-04-15 08:08:01,425 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Waiting until timeout for monitored process [2022-04-15 08:08:01,467 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2022-04-15 08:08:01,468 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-04-15 08:08:01,469 INFO L263 TraceCheckSpWp]: Trace formula consists of 97 conjuncts, 5 conjunts are in the unsatisfiable core [2022-04-15 08:08:01,475 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-15 08:08:01,478 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-04-15 08:08:01,576 INFO L272 TraceCheckUtils]: 0: Hoare triple {1149#true} call ULTIMATE.init(); {1149#true} is VALID [2022-04-15 08:08:01,576 INFO L290 TraceCheckUtils]: 1: Hoare triple {1149#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(10, 2);~counter~0 := 0; {1149#true} is VALID [2022-04-15 08:08:01,576 INFO L290 TraceCheckUtils]: 2: Hoare triple {1149#true} assume true; {1149#true} is VALID [2022-04-15 08:08:01,576 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {1149#true} {1149#true} #82#return; {1149#true} is VALID [2022-04-15 08:08:01,577 INFO L272 TraceCheckUtils]: 4: Hoare triple {1149#true} call #t~ret4 := main(); {1149#true} is VALID [2022-04-15 08:08:01,577 INFO L290 TraceCheckUtils]: 5: Hoare triple {1149#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 := 1;~q~0 := 0;~r~0 := ~A~0;~b~0 := ~B~0; {1169#(and (= main_~B~0 main_~b~0) (= main_~B~0 1))} is VALID [2022-04-15 08:08:01,578 INFO L290 TraceCheckUtils]: 6: Hoare triple {1169#(and (= main_~B~0 main_~b~0) (= main_~B~0 1))} #t~post2 := ~counter~0;~counter~0 := 1 + #t~post2; {1169#(and (= main_~B~0 main_~b~0) (= main_~B~0 1))} is VALID [2022-04-15 08:08:01,578 INFO L290 TraceCheckUtils]: 7: Hoare triple {1169#(and (= main_~B~0 main_~b~0) (= main_~B~0 1))} assume !!(#t~post2 < 2);havoc #t~post2; {1169#(and (= main_~B~0 main_~b~0) (= main_~B~0 1))} is VALID [2022-04-15 08:08:01,579 INFO L290 TraceCheckUtils]: 8: Hoare triple {1169#(and (= main_~B~0 main_~b~0) (= main_~B~0 1))} assume !(~r~0 % 4294967296 >= ~b~0 % 4294967296); {1169#(and (= main_~B~0 main_~b~0) (= main_~B~0 1))} is VALID [2022-04-15 08:08:01,579 INFO L290 TraceCheckUtils]: 9: Hoare triple {1169#(and (= main_~B~0 main_~b~0) (= main_~B~0 1))} #t~post3 := ~counter~0;~counter~0 := 1 + #t~post3; {1169#(and (= main_~B~0 main_~b~0) (= main_~B~0 1))} is VALID [2022-04-15 08:08:01,580 INFO L290 TraceCheckUtils]: 10: Hoare triple {1169#(and (= main_~B~0 main_~b~0) (= main_~B~0 1))} assume !!(#t~post3 < 2);havoc #t~post3; {1169#(and (= main_~B~0 main_~b~0) (= main_~B~0 1))} is VALID [2022-04-15 08:08:01,580 INFO L272 TraceCheckUtils]: 11: Hoare triple {1169#(and (= main_~B~0 main_~b~0) (= main_~B~0 1))} call __VERIFIER_assert((if ~A~0 % 4294967296 == (~q~0 * ~b~0 + ~r~0) % 4294967296 then 1 else 0)); {1149#true} is VALID [2022-04-15 08:08:01,580 INFO L290 TraceCheckUtils]: 12: Hoare triple {1149#true} ~cond := #in~cond; {1149#true} is VALID [2022-04-15 08:08:01,580 INFO L290 TraceCheckUtils]: 13: Hoare triple {1149#true} assume !(0 == ~cond); {1149#true} is VALID [2022-04-15 08:08:01,581 INFO L290 TraceCheckUtils]: 14: Hoare triple {1149#true} assume true; {1149#true} is VALID [2022-04-15 08:08:01,581 INFO L284 TraceCheckUtils]: 15: Hoare quadruple {1149#true} {1169#(and (= main_~B~0 main_~b~0) (= main_~B~0 1))} #78#return; {1169#(and (= main_~B~0 main_~b~0) (= main_~B~0 1))} is VALID [2022-04-15 08:08:01,582 INFO L290 TraceCheckUtils]: 16: Hoare triple {1169#(and (= main_~B~0 main_~b~0) (= main_~B~0 1))} 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); {1150#false} is VALID [2022-04-15 08:08:01,582 INFO L290 TraceCheckUtils]: 17: Hoare triple {1150#false} assume ~r~0 % 4294967296 >= ~b~0 % 4294967296;~q~0 := 1 + ~q~0;~r~0 := ~r~0 - ~b~0; {1150#false} is VALID [2022-04-15 08:08:01,582 INFO L290 TraceCheckUtils]: 18: Hoare triple {1150#false} #t~post3 := ~counter~0;~counter~0 := 1 + #t~post3; {1150#false} is VALID [2022-04-15 08:08:01,582 INFO L290 TraceCheckUtils]: 19: Hoare triple {1150#false} assume !(#t~post3 < 2);havoc #t~post3; {1150#false} is VALID [2022-04-15 08:08:01,583 INFO L272 TraceCheckUtils]: 20: Hoare triple {1150#false} call __VERIFIER_assert((if ~A~0 % 4294967296 == (~q~0 * ~b~0 + ~r~0) % 4294967296 then 1 else 0)); {1150#false} is VALID [2022-04-15 08:08:01,583 INFO L290 TraceCheckUtils]: 21: Hoare triple {1150#false} ~cond := #in~cond; {1150#false} is VALID [2022-04-15 08:08:01,583 INFO L290 TraceCheckUtils]: 22: Hoare triple {1150#false} assume 0 == ~cond; {1150#false} is VALID [2022-04-15 08:08:01,583 INFO L290 TraceCheckUtils]: 23: Hoare triple {1150#false} assume !false; {1150#false} is VALID [2022-04-15 08:08:01,583 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 4 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-04-15 08:08:01,583 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-04-15 08:08:01,584 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-15 08:08:01,584 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [426704122] [2022-04-15 08:08:01,584 WARN L310 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2022-04-15 08:08:01,584 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [561777957] [2022-04-15 08:08:01,584 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [561777957] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-15 08:08:01,584 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-15 08:08:01,584 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-04-15 08:08:01,584 INFO L136 FreeRefinementEngine]: Strategy ACCELERATED_INTERPOLATION found an infeasible trace [2022-04-15 08:08:01,585 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleAcceleratedInterpolation [1351119427] [2022-04-15 08:08:01,585 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleAcceleratedInterpolation [1351119427] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-15 08:08:01,585 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-15 08:08:01,585 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-04-15 08:08:01,585 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1894461135] [2022-04-15 08:08:01,585 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-15 08:08:01,585 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 6.0) internal successors, (18), 3 states have internal predecessors, (18), 3 states have call successors, (4), 2 states have call predecessors, (4), 1 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) Word has length 24 [2022-04-15 08:08:01,586 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-15 08:08:01,586 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with has 3 states, 3 states have (on average 6.0) internal successors, (18), 3 states have internal predecessors, (18), 3 states have call successors, (4), 2 states have call predecessors, (4), 1 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2022-04-15 08:08:01,609 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 24 edges. 24 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-15 08:08:01,609 INFO L554 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-04-15 08:08:01,609 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy ACCELERATED_INTERPOLATION [2022-04-15 08:08:01,610 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-04-15 08:08:01,610 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-04-15 08:08:01,612 INFO L87 Difference]: Start difference. First operand 32 states and 38 transitions. Second operand has 3 states, 3 states have (on average 6.0) internal successors, (18), 3 states have internal predecessors, (18), 3 states have call successors, (4), 2 states have call predecessors, (4), 1 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2022-04-15 08:08:01,689 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-15 08:08:01,689 INFO L93 Difference]: Finished difference Result 58 states and 70 transitions. [2022-04-15 08:08:01,689 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-04-15 08:08:01,690 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 6.0) internal successors, (18), 3 states have internal predecessors, (18), 3 states have call successors, (4), 2 states have call predecessors, (4), 1 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) Word has length 24 [2022-04-15 08:08:01,690 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-15 08:08:01,690 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3 states, 3 states have (on average 6.0) internal successors, (18), 3 states have internal predecessors, (18), 3 states have call successors, (4), 2 states have call predecessors, (4), 1 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2022-04-15 08:08:01,692 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 50 transitions. [2022-04-15 08:08:01,692 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3 states, 3 states have (on average 6.0) internal successors, (18), 3 states have internal predecessors, (18), 3 states have call successors, (4), 2 states have call predecessors, (4), 1 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2022-04-15 08:08:01,693 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 50 transitions. [2022-04-15 08:08:01,693 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 3 states and 50 transitions. [2022-04-15 08:08:01,747 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 50 edges. 50 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-15 08:08:01,749 INFO L225 Difference]: With dead ends: 58 [2022-04-15 08:08:01,749 INFO L226 Difference]: Without dead ends: 33 [2022-04-15 08:08:01,750 INFO L912 BasicCegarLoop]: 0 DeclaredPredicates, 23 GetRequests, 22 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-15 08:08:01,752 INFO L913 BasicCegarLoop]: 25 mSDtfsCounter, 0 mSDsluCounter, 17 mSDsCounter, 0 mSdLazyCounter, 10 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 42 SdHoareTripleChecker+Invalid, 10 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 10 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-04-15 08:08:01,752 INFO L914 BasicCegarLoop]: SdHoareTripleChecker [0 Valid, 42 Invalid, 10 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 10 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-04-15 08:08:01,754 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 33 states. [2022-04-15 08:08:01,779 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 33 to 33. [2022-04-15 08:08:01,780 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-15 08:08:01,780 INFO L82 GeneralOperation]: Start isEquivalent. First operand 33 states. Second operand has 33 states, 24 states have (on average 1.2916666666666667) internal successors, (31), 25 states have internal predecessors, (31), 5 states have call successors, (5), 4 states have call predecessors, (5), 3 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) [2022-04-15 08:08:01,780 INFO L74 IsIncluded]: Start isIncluded. First operand 33 states. Second operand has 33 states, 24 states have (on average 1.2916666666666667) internal successors, (31), 25 states have internal predecessors, (31), 5 states have call successors, (5), 4 states have call predecessors, (5), 3 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) [2022-04-15 08:08:01,781 INFO L87 Difference]: Start difference. First operand 33 states. Second operand has 33 states, 24 states have (on average 1.2916666666666667) internal successors, (31), 25 states have internal predecessors, (31), 5 states have call successors, (5), 4 states have call predecessors, (5), 3 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) [2022-04-15 08:08:01,783 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-15 08:08:01,783 INFO L93 Difference]: Finished difference Result 33 states and 39 transitions. [2022-04-15 08:08:01,783 INFO L276 IsEmpty]: Start isEmpty. Operand 33 states and 39 transitions. [2022-04-15 08:08:01,786 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-15 08:08:01,786 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-15 08:08:01,786 INFO L74 IsIncluded]: Start isIncluded. First operand has 33 states, 24 states have (on average 1.2916666666666667) internal successors, (31), 25 states have internal predecessors, (31), 5 states have call successors, (5), 4 states have call predecessors, (5), 3 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) Second operand 33 states. [2022-04-15 08:08:01,786 INFO L87 Difference]: Start difference. First operand has 33 states, 24 states have (on average 1.2916666666666667) internal successors, (31), 25 states have internal predecessors, (31), 5 states have call successors, (5), 4 states have call predecessors, (5), 3 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) Second operand 33 states. [2022-04-15 08:08:01,789 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-15 08:08:01,789 INFO L93 Difference]: Finished difference Result 33 states and 39 transitions. [2022-04-15 08:08:01,789 INFO L276 IsEmpty]: Start isEmpty. Operand 33 states and 39 transitions. [2022-04-15 08:08:01,790 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-15 08:08:01,790 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-15 08:08:01,790 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-15 08:08:01,790 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-15 08:08:01,790 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 33 states, 24 states have (on average 1.2916666666666667) internal successors, (31), 25 states have internal predecessors, (31), 5 states have call successors, (5), 4 states have call predecessors, (5), 3 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) [2022-04-15 08:08:01,793 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 33 states to 33 states and 39 transitions. [2022-04-15 08:08:01,793 INFO L78 Accepts]: Start accepts. Automaton has 33 states and 39 transitions. Word has length 24 [2022-04-15 08:08:01,794 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-15 08:08:01,794 INFO L478 AbstractCegarLoop]: Abstraction has 33 states and 39 transitions. [2022-04-15 08:08:01,795 INFO L479 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 6.0) internal successors, (18), 3 states have internal predecessors, (18), 3 states have call successors, (4), 2 states have call predecessors, (4), 1 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2022-04-15 08:08:01,795 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 33 states and 39 transitions. [2022-04-15 08:08:01,840 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 39 edges. 39 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-15 08:08:01,841 INFO L276 IsEmpty]: Start isEmpty. Operand 33 states and 39 transitions. [2022-04-15 08:08:01,841 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 27 [2022-04-15 08:08:01,841 INFO L491 BasicCegarLoop]: Found error trace [2022-04-15 08:08:01,841 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-15 08:08:01,868 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Forceful destruction successful, exit code 0 [2022-04-15 08:08:02,055 WARN L460 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5,5 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-15 08:08:02,056 INFO L403 AbstractCegarLoop]: === Iteration 7 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-15 08:08:02,056 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-15 08:08:02,056 INFO L85 PathProgramCache]: Analyzing trace with hash 76649582, now seen corresponding path program 1 times [2022-04-15 08:08:02,056 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION [2022-04-15 08:08:02,056 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [519422393] [2022-04-15 08:08:02,062 INFO L89 AcceleratorJordan]: Jordan loop acceleration statistics: 1 HavocedVariables, 2 AssignedVariables, 0 ReadonlyVariables, Eigenvalues: {}, 0 SequentialAcceleration, 0 AlternatingAcceleration, 0 QuantifierFreeResult [2022-04-15 08:08:02,063 WARN L91 AcceleratorJordan]: Jordan acceleration failed, because UNSUPPORTED_EIGENVALUES [2022-04-15 08:08:02,063 INFO L274 tedInterpolationCore]: Could not compute an accelerate. [2022-04-15 08:08:02,063 INFO L85 PathProgramCache]: Analyzing trace with hash 76649582, now seen corresponding path program 2 times [2022-04-15 08:08:02,063 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-15 08:08:02,063 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1449901369] [2022-04-15 08:08:02,063 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-15 08:08:02,063 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-15 08:08:02,076 ERROR L245 FreeRefinementEngine]: Caught known exception: Unsupported non-linear arithmetic [2022-04-15 08:08:02,076 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [985609567] [2022-04-15 08:08:02,076 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2022-04-15 08:08:02,077 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-15 08:08:02,077 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-04-15 08:08:02,078 INFO L229 MonitoredProcess]: Starting monitored process 6 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-04-15 08:08:02,112 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (6)] Waiting until timeout for monitored process [2022-04-15 08:08:02,134 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2022-04-15 08:08:02,134 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-04-15 08:08:02,135 INFO L263 TraceCheckSpWp]: Trace formula consists of 104 conjuncts, 7 conjunts are in the unsatisfiable core [2022-04-15 08:08:02,152 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-15 08:08:02,153 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-04-15 08:08:02,290 INFO L272 TraceCheckUtils]: 0: Hoare triple {1471#true} call ULTIMATE.init(); {1471#true} is VALID [2022-04-15 08:08:02,293 INFO L290 TraceCheckUtils]: 1: Hoare triple {1471#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(10, 2);~counter~0 := 0; {1479#(<= ~counter~0 0)} is VALID [2022-04-15 08:08:02,293 INFO L290 TraceCheckUtils]: 2: Hoare triple {1479#(<= ~counter~0 0)} assume true; {1479#(<= ~counter~0 0)} is VALID [2022-04-15 08:08:02,294 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {1479#(<= ~counter~0 0)} {1471#true} #82#return; {1479#(<= ~counter~0 0)} is VALID [2022-04-15 08:08:02,294 INFO L272 TraceCheckUtils]: 4: Hoare triple {1479#(<= ~counter~0 0)} call #t~ret4 := main(); {1479#(<= ~counter~0 0)} is VALID [2022-04-15 08:08:02,295 INFO L290 TraceCheckUtils]: 5: Hoare triple {1479#(<= ~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 := 1;~q~0 := 0;~r~0 := ~A~0;~b~0 := ~B~0; {1479#(<= ~counter~0 0)} is VALID [2022-04-15 08:08:02,295 INFO L290 TraceCheckUtils]: 6: Hoare triple {1479#(<= ~counter~0 0)} #t~post2 := ~counter~0;~counter~0 := 1 + #t~post2; {1495#(<= ~counter~0 1)} is VALID [2022-04-15 08:08:02,296 INFO L290 TraceCheckUtils]: 7: Hoare triple {1495#(<= ~counter~0 1)} assume !!(#t~post2 < 2);havoc #t~post2; {1495#(<= ~counter~0 1)} is VALID [2022-04-15 08:08:02,296 INFO L290 TraceCheckUtils]: 8: Hoare triple {1495#(<= ~counter~0 1)} assume !!(~r~0 % 4294967296 >= ~b~0 % 4294967296);~b~0 := 2 * ~b~0; {1495#(<= ~counter~0 1)} is VALID [2022-04-15 08:08:02,298 INFO L290 TraceCheckUtils]: 9: Hoare triple {1495#(<= ~counter~0 1)} #t~post2 := ~counter~0;~counter~0 := 1 + #t~post2; {1505#(<= |main_#t~post2| 1)} is VALID [2022-04-15 08:08:02,298 INFO L290 TraceCheckUtils]: 10: Hoare triple {1505#(<= |main_#t~post2| 1)} assume !(#t~post2 < 2);havoc #t~post2; {1472#false} is VALID [2022-04-15 08:08:02,298 INFO L290 TraceCheckUtils]: 11: Hoare triple {1472#false} #t~post3 := ~counter~0;~counter~0 := 1 + #t~post3; {1472#false} is VALID [2022-04-15 08:08:02,299 INFO L290 TraceCheckUtils]: 12: Hoare triple {1472#false} assume !!(#t~post3 < 2);havoc #t~post3; {1472#false} is VALID [2022-04-15 08:08:02,299 INFO L272 TraceCheckUtils]: 13: Hoare triple {1472#false} call __VERIFIER_assert((if ~A~0 % 4294967296 == (~q~0 * ~b~0 + ~r~0) % 4294967296 then 1 else 0)); {1472#false} is VALID [2022-04-15 08:08:02,299 INFO L290 TraceCheckUtils]: 14: Hoare triple {1472#false} ~cond := #in~cond; {1472#false} is VALID [2022-04-15 08:08:02,299 INFO L290 TraceCheckUtils]: 15: Hoare triple {1472#false} assume !(0 == ~cond); {1472#false} is VALID [2022-04-15 08:08:02,299 INFO L290 TraceCheckUtils]: 16: Hoare triple {1472#false} assume true; {1472#false} is VALID [2022-04-15 08:08:02,299 INFO L284 TraceCheckUtils]: 17: Hoare quadruple {1472#false} {1472#false} #78#return; {1472#false} is VALID [2022-04-15 08:08:02,300 INFO L290 TraceCheckUtils]: 18: Hoare triple {1472#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); {1472#false} is VALID [2022-04-15 08:08:02,300 INFO L290 TraceCheckUtils]: 19: Hoare triple {1472#false} assume ~r~0 % 4294967296 >= ~b~0 % 4294967296;~q~0 := 1 + ~q~0;~r~0 := ~r~0 - ~b~0; {1472#false} is VALID [2022-04-15 08:08:02,300 INFO L290 TraceCheckUtils]: 20: Hoare triple {1472#false} #t~post3 := ~counter~0;~counter~0 := 1 + #t~post3; {1472#false} is VALID [2022-04-15 08:08:02,300 INFO L290 TraceCheckUtils]: 21: Hoare triple {1472#false} assume !(#t~post3 < 2);havoc #t~post3; {1472#false} is VALID [2022-04-15 08:08:02,300 INFO L272 TraceCheckUtils]: 22: Hoare triple {1472#false} call __VERIFIER_assert((if ~A~0 % 4294967296 == (~q~0 * ~b~0 + ~r~0) % 4294967296 then 1 else 0)); {1472#false} is VALID [2022-04-15 08:08:02,300 INFO L290 TraceCheckUtils]: 23: Hoare triple {1472#false} ~cond := #in~cond; {1472#false} is VALID [2022-04-15 08:08:02,300 INFO L290 TraceCheckUtils]: 24: Hoare triple {1472#false} assume 0 == ~cond; {1472#false} is VALID [2022-04-15 08:08:02,301 INFO L290 TraceCheckUtils]: 25: Hoare triple {1472#false} assume !false; {1472#false} is VALID [2022-04-15 08:08:02,301 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2022-04-15 08:08:02,301 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-04-15 08:08:02,470 INFO L290 TraceCheckUtils]: 25: Hoare triple {1472#false} assume !false; {1472#false} is VALID [2022-04-15 08:08:02,470 INFO L290 TraceCheckUtils]: 24: Hoare triple {1472#false} assume 0 == ~cond; {1472#false} is VALID [2022-04-15 08:08:02,470 INFO L290 TraceCheckUtils]: 23: Hoare triple {1472#false} ~cond := #in~cond; {1472#false} is VALID [2022-04-15 08:08:02,471 INFO L272 TraceCheckUtils]: 22: Hoare triple {1472#false} call __VERIFIER_assert((if ~A~0 % 4294967296 == (~q~0 * ~b~0 + ~r~0) % 4294967296 then 1 else 0)); {1472#false} is VALID [2022-04-15 08:08:02,471 INFO L290 TraceCheckUtils]: 21: Hoare triple {1472#false} assume !(#t~post3 < 2);havoc #t~post3; {1472#false} is VALID [2022-04-15 08:08:02,471 INFO L290 TraceCheckUtils]: 20: Hoare triple {1472#false} #t~post3 := ~counter~0;~counter~0 := 1 + #t~post3; {1472#false} is VALID [2022-04-15 08:08:02,471 INFO L290 TraceCheckUtils]: 19: Hoare triple {1472#false} assume ~r~0 % 4294967296 >= ~b~0 % 4294967296;~q~0 := 1 + ~q~0;~r~0 := ~r~0 - ~b~0; {1472#false} is VALID [2022-04-15 08:08:02,471 INFO L290 TraceCheckUtils]: 18: Hoare triple {1472#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); {1472#false} is VALID [2022-04-15 08:08:02,471 INFO L284 TraceCheckUtils]: 17: Hoare quadruple {1471#true} {1472#false} #78#return; {1472#false} is VALID [2022-04-15 08:08:02,471 INFO L290 TraceCheckUtils]: 16: Hoare triple {1471#true} assume true; {1471#true} is VALID [2022-04-15 08:08:02,472 INFO L290 TraceCheckUtils]: 15: Hoare triple {1471#true} assume !(0 == ~cond); {1471#true} is VALID [2022-04-15 08:08:02,472 INFO L290 TraceCheckUtils]: 14: Hoare triple {1471#true} ~cond := #in~cond; {1471#true} is VALID [2022-04-15 08:08:02,472 INFO L272 TraceCheckUtils]: 13: Hoare triple {1472#false} call __VERIFIER_assert((if ~A~0 % 4294967296 == (~q~0 * ~b~0 + ~r~0) % 4294967296 then 1 else 0)); {1471#true} is VALID [2022-04-15 08:08:02,472 INFO L290 TraceCheckUtils]: 12: Hoare triple {1472#false} assume !!(#t~post3 < 2);havoc #t~post3; {1472#false} is VALID [2022-04-15 08:08:02,472 INFO L290 TraceCheckUtils]: 11: Hoare triple {1472#false} #t~post3 := ~counter~0;~counter~0 := 1 + #t~post3; {1472#false} is VALID [2022-04-15 08:08:02,473 INFO L290 TraceCheckUtils]: 10: Hoare triple {1505#(<= |main_#t~post2| 1)} assume !(#t~post2 < 2);havoc #t~post2; {1472#false} is VALID [2022-04-15 08:08:02,473 INFO L290 TraceCheckUtils]: 9: Hoare triple {1495#(<= ~counter~0 1)} #t~post2 := ~counter~0;~counter~0 := 1 + #t~post2; {1505#(<= |main_#t~post2| 1)} is VALID [2022-04-15 08:08:02,474 INFO L290 TraceCheckUtils]: 8: Hoare triple {1495#(<= ~counter~0 1)} assume !!(~r~0 % 4294967296 >= ~b~0 % 4294967296);~b~0 := 2 * ~b~0; {1495#(<= ~counter~0 1)} is VALID [2022-04-15 08:08:02,474 INFO L290 TraceCheckUtils]: 7: Hoare triple {1495#(<= ~counter~0 1)} assume !!(#t~post2 < 2);havoc #t~post2; {1495#(<= ~counter~0 1)} is VALID [2022-04-15 08:08:02,475 INFO L290 TraceCheckUtils]: 6: Hoare triple {1479#(<= ~counter~0 0)} #t~post2 := ~counter~0;~counter~0 := 1 + #t~post2; {1495#(<= ~counter~0 1)} is VALID [2022-04-15 08:08:02,475 INFO L290 TraceCheckUtils]: 5: Hoare triple {1479#(<= ~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 := 1;~q~0 := 0;~r~0 := ~A~0;~b~0 := ~B~0; {1479#(<= ~counter~0 0)} is VALID [2022-04-15 08:08:02,476 INFO L272 TraceCheckUtils]: 4: Hoare triple {1479#(<= ~counter~0 0)} call #t~ret4 := main(); {1479#(<= ~counter~0 0)} is VALID [2022-04-15 08:08:02,476 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {1479#(<= ~counter~0 0)} {1471#true} #82#return; {1479#(<= ~counter~0 0)} is VALID [2022-04-15 08:08:02,477 INFO L290 TraceCheckUtils]: 2: Hoare triple {1479#(<= ~counter~0 0)} assume true; {1479#(<= ~counter~0 0)} is VALID [2022-04-15 08:08:02,477 INFO L290 TraceCheckUtils]: 1: Hoare triple {1471#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(10, 2);~counter~0 := 0; {1479#(<= ~counter~0 0)} is VALID [2022-04-15 08:08:02,477 INFO L272 TraceCheckUtils]: 0: Hoare triple {1471#true} call ULTIMATE.init(); {1471#true} is VALID [2022-04-15 08:08:02,478 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 2 proven. 2 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2022-04-15 08:08:02,478 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-15 08:08:02,478 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1449901369] [2022-04-15 08:08:02,478 WARN L310 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2022-04-15 08:08:02,478 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [985609567] [2022-04-15 08:08:02,478 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [985609567] provided 0 perfect and 2 imperfect interpolant sequences [2022-04-15 08:08:02,478 INFO L184 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2022-04-15 08:08:02,478 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [5, 5] total 5 [2022-04-15 08:08:02,479 INFO L136 FreeRefinementEngine]: Strategy ACCELERATED_INTERPOLATION found an infeasible trace [2022-04-15 08:08:02,479 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleAcceleratedInterpolation [519422393] [2022-04-15 08:08:02,479 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleAcceleratedInterpolation [519422393] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-15 08:08:02,479 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-15 08:08:02,479 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2022-04-15 08:08:02,479 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1008419408] [2022-04-15 08:08:02,479 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-15 08:08:02,480 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 3.6) internal successors, (18), 4 states have internal predecessors, (18), 3 states have call successors, (4), 3 states have call predecessors, (4), 2 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) Word has length 26 [2022-04-15 08:08:02,480 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-15 08:08:02,480 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with has 5 states, 5 states have (on average 3.6) internal successors, (18), 4 states have internal predecessors, (18), 3 states have call successors, (4), 3 states have call predecessors, (4), 2 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2022-04-15 08:08:02,503 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 24 edges. 24 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-15 08:08:02,503 INFO L554 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-04-15 08:08:02,503 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy ACCELERATED_INTERPOLATION [2022-04-15 08:08:02,503 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-04-15 08:08:02,504 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2022-04-15 08:08:02,504 INFO L87 Difference]: Start difference. First operand 33 states and 39 transitions. Second operand has 5 states, 5 states have (on average 3.6) internal successors, (18), 4 states have internal predecessors, (18), 3 states have call successors, (4), 3 states have call predecessors, (4), 2 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2022-04-15 08:08:02,624 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-15 08:08:02,625 INFO L93 Difference]: Finished difference Result 56 states and 67 transitions. [2022-04-15 08:08:02,625 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2022-04-15 08:08:02,625 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 3.6) internal successors, (18), 4 states have internal predecessors, (18), 3 states have call successors, (4), 3 states have call predecessors, (4), 2 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) Word has length 26 [2022-04-15 08:08:02,625 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-15 08:08:02,625 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 5 states, 5 states have (on average 3.6) internal successors, (18), 4 states have internal predecessors, (18), 3 states have call successors, (4), 3 states have call predecessors, (4), 2 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2022-04-15 08:08:02,627 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 47 transitions. [2022-04-15 08:08:02,627 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 5 states, 5 states have (on average 3.6) internal successors, (18), 4 states have internal predecessors, (18), 3 states have call successors, (4), 3 states have call predecessors, (4), 2 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2022-04-15 08:08:02,628 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 47 transitions. [2022-04-15 08:08:02,628 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 6 states and 47 transitions. [2022-04-15 08:08:02,666 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 47 edges. 47 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-15 08:08:02,668 INFO L225 Difference]: With dead ends: 56 [2022-04-15 08:08:02,668 INFO L226 Difference]: Without dead ends: 35 [2022-04-15 08:08:02,668 INFO L912 BasicCegarLoop]: 0 DeclaredPredicates, 52 GetRequests, 47 SyntacticMatches, 1 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=12, Invalid=18, Unknown=0, NotChecked=0, Total=30 [2022-04-15 08:08:02,669 INFO L913 BasicCegarLoop]: 24 mSDtfsCounter, 2 mSDsluCounter, 42 mSDsCounter, 0 mSdLazyCounter, 10 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 2 SdHoareTripleChecker+Valid, 66 SdHoareTripleChecker+Invalid, 13 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 10 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-04-15 08:08:02,669 INFO L914 BasicCegarLoop]: SdHoareTripleChecker [2 Valid, 66 Invalid, 13 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 10 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-04-15 08:08:02,669 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 35 states. [2022-04-15 08:08:02,687 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 35 to 35. [2022-04-15 08:08:02,687 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-15 08:08:02,688 INFO L82 GeneralOperation]: Start isEquivalent. First operand 35 states. Second operand has 35 states, 26 states have (on average 1.2692307692307692) internal successors, (33), 27 states have internal predecessors, (33), 5 states have call successors, (5), 4 states have call predecessors, (5), 3 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) [2022-04-15 08:08:02,688 INFO L74 IsIncluded]: Start isIncluded. First operand 35 states. Second operand has 35 states, 26 states have (on average 1.2692307692307692) internal successors, (33), 27 states have internal predecessors, (33), 5 states have call successors, (5), 4 states have call predecessors, (5), 3 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) [2022-04-15 08:08:02,689 INFO L87 Difference]: Start difference. First operand 35 states. Second operand has 35 states, 26 states have (on average 1.2692307692307692) internal successors, (33), 27 states have internal predecessors, (33), 5 states have call successors, (5), 4 states have call predecessors, (5), 3 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) [2022-04-15 08:08:02,690 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-15 08:08:02,690 INFO L93 Difference]: Finished difference Result 35 states and 41 transitions. [2022-04-15 08:08:02,691 INFO L276 IsEmpty]: Start isEmpty. Operand 35 states and 41 transitions. [2022-04-15 08:08:02,692 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-15 08:08:02,692 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-15 08:08:02,693 INFO L74 IsIncluded]: Start isIncluded. First operand has 35 states, 26 states have (on average 1.2692307692307692) internal successors, (33), 27 states have internal predecessors, (33), 5 states have call successors, (5), 4 states have call predecessors, (5), 3 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) Second operand 35 states. [2022-04-15 08:08:02,693 INFO L87 Difference]: Start difference. First operand has 35 states, 26 states have (on average 1.2692307692307692) internal successors, (33), 27 states have internal predecessors, (33), 5 states have call successors, (5), 4 states have call predecessors, (5), 3 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) Second operand 35 states. [2022-04-15 08:08:02,696 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-15 08:08:02,696 INFO L93 Difference]: Finished difference Result 35 states and 41 transitions. [2022-04-15 08:08:02,696 INFO L276 IsEmpty]: Start isEmpty. Operand 35 states and 41 transitions. [2022-04-15 08:08:02,696 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-15 08:08:02,696 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-15 08:08:02,696 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-15 08:08:02,697 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-15 08:08:02,697 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 35 states, 26 states have (on average 1.2692307692307692) internal successors, (33), 27 states have internal predecessors, (33), 5 states have call successors, (5), 4 states have call predecessors, (5), 3 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) [2022-04-15 08:08:02,699 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 35 states to 35 states and 41 transitions. [2022-04-15 08:08:02,699 INFO L78 Accepts]: Start accepts. Automaton has 35 states and 41 transitions. Word has length 26 [2022-04-15 08:08:02,699 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-15 08:08:02,699 INFO L478 AbstractCegarLoop]: Abstraction has 35 states and 41 transitions. [2022-04-15 08:08:02,699 INFO L479 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 3.6) internal successors, (18), 4 states have internal predecessors, (18), 3 states have call successors, (4), 3 states have call predecessors, (4), 2 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2022-04-15 08:08:02,699 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 35 states and 41 transitions. [2022-04-15 08:08:02,738 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 41 edges. 41 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-15 08:08:02,738 INFO L276 IsEmpty]: Start isEmpty. Operand 35 states and 41 transitions. [2022-04-15 08:08:02,739 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 28 [2022-04-15 08:08:02,739 INFO L491 BasicCegarLoop]: Found error trace [2022-04-15 08:08:02,739 INFO L499 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-15 08:08:02,767 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (6)] Forceful destruction successful, exit code 0 [2022-04-15 08:08:02,960 WARN L460 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6,6 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-15 08:08:02,961 INFO L403 AbstractCegarLoop]: === Iteration 8 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-15 08:08:02,961 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-15 08:08:02,961 INFO L85 PathProgramCache]: Analyzing trace with hash -1817538190, now seen corresponding path program 1 times [2022-04-15 08:08:02,961 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION [2022-04-15 08:08:02,961 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [281126365] [2022-04-15 08:08:02,968 INFO L89 AcceleratorJordan]: Jordan loop acceleration statistics: 1 HavocedVariables, 2 AssignedVariables, 0 ReadonlyVariables, Eigenvalues: {}, 0 SequentialAcceleration, 0 AlternatingAcceleration, 0 QuantifierFreeResult [2022-04-15 08:08:02,968 WARN L91 AcceleratorJordan]: Jordan acceleration failed, because UNSUPPORTED_EIGENVALUES [2022-04-15 08:08:02,968 INFO L274 tedInterpolationCore]: Could not compute an accelerate. [2022-04-15 08:08:02,968 INFO L85 PathProgramCache]: Analyzing trace with hash -1817538190, now seen corresponding path program 2 times [2022-04-15 08:08:02,968 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-15 08:08:02,968 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [239335695] [2022-04-15 08:08:02,969 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-15 08:08:02,969 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-15 08:08:02,988 ERROR L245 FreeRefinementEngine]: Caught known exception: Unsupported non-linear arithmetic [2022-04-15 08:08:02,989 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [1306420429] [2022-04-15 08:08:02,989 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2022-04-15 08:08:02,989 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-15 08:08:02,989 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-04-15 08:08:02,994 INFO L229 MonitoredProcess]: Starting monitored process 7 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-04-15 08:08:02,995 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (7)] Waiting until timeout for monitored process [2022-04-15 08:08:03,035 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2022-04-15 08:08:03,035 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-04-15 08:08:03,036 INFO L263 TraceCheckSpWp]: Trace formula consists of 105 conjuncts, 9 conjunts are in the unsatisfiable core [2022-04-15 08:08:03,045 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-15 08:08:03,046 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-04-15 08:08:03,218 INFO L272 TraceCheckUtils]: 0: Hoare triple {1885#true} call ULTIMATE.init(); {1885#true} is VALID [2022-04-15 08:08:03,219 INFO L290 TraceCheckUtils]: 1: Hoare triple {1885#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(10, 2);~counter~0 := 0; {1893#(<= 0 ~counter~0)} is VALID [2022-04-15 08:08:03,219 INFO L290 TraceCheckUtils]: 2: Hoare triple {1893#(<= 0 ~counter~0)} assume true; {1893#(<= 0 ~counter~0)} is VALID [2022-04-15 08:08:03,220 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {1893#(<= 0 ~counter~0)} {1885#true} #82#return; {1893#(<= 0 ~counter~0)} is VALID [2022-04-15 08:08:03,220 INFO L272 TraceCheckUtils]: 4: Hoare triple {1893#(<= 0 ~counter~0)} call #t~ret4 := main(); {1893#(<= 0 ~counter~0)} is VALID [2022-04-15 08:08:03,220 INFO L290 TraceCheckUtils]: 5: Hoare triple {1893#(<= 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 := 1;~q~0 := 0;~r~0 := ~A~0;~b~0 := ~B~0; {1893#(<= 0 ~counter~0)} is VALID [2022-04-15 08:08:03,221 INFO L290 TraceCheckUtils]: 6: Hoare triple {1893#(<= 0 ~counter~0)} #t~post2 := ~counter~0;~counter~0 := 1 + #t~post2; {1909#(<= 1 ~counter~0)} is VALID [2022-04-15 08:08:03,221 INFO L290 TraceCheckUtils]: 7: Hoare triple {1909#(<= 1 ~counter~0)} assume !!(#t~post2 < 2);havoc #t~post2; {1909#(<= 1 ~counter~0)} is VALID [2022-04-15 08:08:03,222 INFO L290 TraceCheckUtils]: 8: Hoare triple {1909#(<= 1 ~counter~0)} assume !!(~r~0 % 4294967296 >= ~b~0 % 4294967296);~b~0 := 2 * ~b~0; {1909#(<= 1 ~counter~0)} is VALID [2022-04-15 08:08:03,222 INFO L290 TraceCheckUtils]: 9: Hoare triple {1909#(<= 1 ~counter~0)} #t~post2 := ~counter~0;~counter~0 := 1 + #t~post2; {1919#(<= 2 ~counter~0)} is VALID [2022-04-15 08:08:03,222 INFO L290 TraceCheckUtils]: 10: Hoare triple {1919#(<= 2 ~counter~0)} assume !!(#t~post2 < 2);havoc #t~post2; {1919#(<= 2 ~counter~0)} is VALID [2022-04-15 08:08:03,223 INFO L290 TraceCheckUtils]: 11: Hoare triple {1919#(<= 2 ~counter~0)} assume !(~r~0 % 4294967296 >= ~b~0 % 4294967296); {1919#(<= 2 ~counter~0)} is VALID [2022-04-15 08:08:03,224 INFO L290 TraceCheckUtils]: 12: Hoare triple {1919#(<= 2 ~counter~0)} #t~post3 := ~counter~0;~counter~0 := 1 + #t~post3; {1929#(<= 2 |main_#t~post3|)} is VALID [2022-04-15 08:08:03,224 INFO L290 TraceCheckUtils]: 13: Hoare triple {1929#(<= 2 |main_#t~post3|)} assume !!(#t~post3 < 2);havoc #t~post3; {1886#false} is VALID [2022-04-15 08:08:03,224 INFO L272 TraceCheckUtils]: 14: Hoare triple {1886#false} call __VERIFIER_assert((if ~A~0 % 4294967296 == (~q~0 * ~b~0 + ~r~0) % 4294967296 then 1 else 0)); {1886#false} is VALID [2022-04-15 08:08:03,224 INFO L290 TraceCheckUtils]: 15: Hoare triple {1886#false} ~cond := #in~cond; {1886#false} is VALID [2022-04-15 08:08:03,225 INFO L290 TraceCheckUtils]: 16: Hoare triple {1886#false} assume !(0 == ~cond); {1886#false} is VALID [2022-04-15 08:08:03,225 INFO L290 TraceCheckUtils]: 17: Hoare triple {1886#false} assume true; {1886#false} is VALID [2022-04-15 08:08:03,225 INFO L284 TraceCheckUtils]: 18: Hoare quadruple {1886#false} {1886#false} #78#return; {1886#false} is VALID [2022-04-15 08:08:03,225 INFO L290 TraceCheckUtils]: 19: Hoare triple {1886#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); {1886#false} is VALID [2022-04-15 08:08:03,225 INFO L290 TraceCheckUtils]: 20: Hoare triple {1886#false} assume ~r~0 % 4294967296 >= ~b~0 % 4294967296;~q~0 := 1 + ~q~0;~r~0 := ~r~0 - ~b~0; {1886#false} is VALID [2022-04-15 08:08:03,225 INFO L290 TraceCheckUtils]: 21: Hoare triple {1886#false} #t~post3 := ~counter~0;~counter~0 := 1 + #t~post3; {1886#false} is VALID [2022-04-15 08:08:03,225 INFO L290 TraceCheckUtils]: 22: Hoare triple {1886#false} assume !(#t~post3 < 2);havoc #t~post3; {1886#false} is VALID [2022-04-15 08:08:03,226 INFO L272 TraceCheckUtils]: 23: Hoare triple {1886#false} call __VERIFIER_assert((if ~A~0 % 4294967296 == (~q~0 * ~b~0 + ~r~0) % 4294967296 then 1 else 0)); {1886#false} is VALID [2022-04-15 08:08:03,226 INFO L290 TraceCheckUtils]: 24: Hoare triple {1886#false} ~cond := #in~cond; {1886#false} is VALID [2022-04-15 08:08:03,226 INFO L290 TraceCheckUtils]: 25: Hoare triple {1886#false} assume 0 == ~cond; {1886#false} is VALID [2022-04-15 08:08:03,226 INFO L290 TraceCheckUtils]: 26: Hoare triple {1886#false} assume !false; {1886#false} is VALID [2022-04-15 08:08:03,226 INFO L134 CoverageAnalysis]: Checked inductivity of 7 backedges. 5 proven. 0 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2022-04-15 08:08:03,226 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-04-15 08:08:03,226 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-15 08:08:03,227 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [239335695] [2022-04-15 08:08:03,227 WARN L310 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2022-04-15 08:08:03,227 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1306420429] [2022-04-15 08:08:03,227 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1306420429] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-15 08:08:03,227 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-15 08:08:03,227 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2022-04-15 08:08:03,227 INFO L136 FreeRefinementEngine]: Strategy ACCELERATED_INTERPOLATION found an infeasible trace [2022-04-15 08:08:03,227 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleAcceleratedInterpolation [281126365] [2022-04-15 08:08:03,228 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleAcceleratedInterpolation [281126365] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-15 08:08:03,228 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-15 08:08:03,228 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2022-04-15 08:08:03,228 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [781194575] [2022-04-15 08:08:03,228 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-15 08:08:03,228 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 3.3333333333333335) internal successors, (20), 5 states have internal predecessors, (20), 3 states have call successors, (4), 3 states have call predecessors, (4), 2 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) Word has length 27 [2022-04-15 08:08:03,229 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-15 08:08:03,229 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with has 6 states, 6 states have (on average 3.3333333333333335) internal successors, (20), 5 states have internal predecessors, (20), 3 states have call successors, (4), 3 states have call predecessors, (4), 2 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2022-04-15 08:08:03,249 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 26 edges. 26 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-15 08:08:03,249 INFO L554 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2022-04-15 08:08:03,249 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy ACCELERATED_INTERPOLATION [2022-04-15 08:08:03,250 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2022-04-15 08:08:03,250 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=18, Unknown=0, NotChecked=0, Total=30 [2022-04-15 08:08:03,250 INFO L87 Difference]: Start difference. First operand 35 states and 41 transitions. Second operand has 6 states, 6 states have (on average 3.3333333333333335) internal successors, (20), 5 states have internal predecessors, (20), 3 states have call successors, (4), 3 states have call predecessors, (4), 2 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2022-04-15 08:08:03,330 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-15 08:08:03,331 INFO L93 Difference]: Finished difference Result 37 states and 43 transitions. [2022-04-15 08:08:03,331 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2022-04-15 08:08:03,331 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 3.3333333333333335) internal successors, (20), 5 states have internal predecessors, (20), 3 states have call successors, (4), 3 states have call predecessors, (4), 2 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) Word has length 27 [2022-04-15 08:08:03,331 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-15 08:08:03,331 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 6 states, 6 states have (on average 3.3333333333333335) internal successors, (20), 5 states have internal predecessors, (20), 3 states have call successors, (4), 3 states have call predecessors, (4), 2 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2022-04-15 08:08:03,333 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 32 transitions. [2022-04-15 08:08:03,333 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 6 states, 6 states have (on average 3.3333333333333335) internal successors, (20), 5 states have internal predecessors, (20), 3 states have call successors, (4), 3 states have call predecessors, (4), 2 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2022-04-15 08:08:03,334 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 32 transitions. [2022-04-15 08:08:03,334 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 6 states and 32 transitions. [2022-04-15 08:08:03,363 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 32 edges. 32 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-15 08:08:03,363 INFO L225 Difference]: With dead ends: 37 [2022-04-15 08:08:03,363 INFO L226 Difference]: Without dead ends: 0 [2022-04-15 08:08:03,364 INFO L912 BasicCegarLoop]: 0 DeclaredPredicates, 27 GetRequests, 22 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=18, Invalid=24, Unknown=0, NotChecked=0, Total=42 [2022-04-15 08:08:03,364 INFO L913 BasicCegarLoop]: 12 mSDtfsCounter, 5 mSDsluCounter, 21 mSDsCounter, 0 mSdLazyCounter, 14 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 5 SdHoareTripleChecker+Valid, 33 SdHoareTripleChecker+Invalid, 16 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 14 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-04-15 08:08:03,364 INFO L914 BasicCegarLoop]: SdHoareTripleChecker [5 Valid, 33 Invalid, 16 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 14 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-04-15 08:08:03,365 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 0 states. [2022-04-15 08:08:03,365 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 0 to 0. [2022-04-15 08:08:03,365 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-15 08:08:03,365 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-15 08:08:03,365 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-15 08:08:03,366 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-15 08:08:03,366 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-15 08:08:03,366 INFO L93 Difference]: Finished difference Result 0 states and 0 transitions. [2022-04-15 08:08:03,366 INFO L276 IsEmpty]: Start isEmpty. Operand 0 states and 0 transitions. [2022-04-15 08:08:03,366 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-15 08:08:03,366 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-15 08:08:03,366 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-15 08:08:03,366 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-15 08:08:03,367 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-15 08:08:03,367 INFO L93 Difference]: Finished difference Result 0 states and 0 transitions. [2022-04-15 08:08:03,367 INFO L276 IsEmpty]: Start isEmpty. Operand 0 states and 0 transitions. [2022-04-15 08:08:03,367 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-15 08:08:03,367 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-15 08:08:03,367 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-15 08:08:03,367 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-15 08:08:03,367 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-15 08:08:03,367 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 0 states to 0 states and 0 transitions. [2022-04-15 08:08:03,368 INFO L78 Accepts]: Start accepts. Automaton has 0 states and 0 transitions. Word has length 27 [2022-04-15 08:08:03,368 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-15 08:08:03,368 INFO L478 AbstractCegarLoop]: Abstraction has 0 states and 0 transitions. [2022-04-15 08:08:03,368 INFO L479 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 3.3333333333333335) internal successors, (20), 5 states have internal predecessors, (20), 3 states have call successors, (4), 3 states have call predecessors, (4), 2 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2022-04-15 08:08:03,368 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 0 states and 0 transitions. [2022-04-15 08:08:03,368 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-15 08:08:03,368 INFO L276 IsEmpty]: Start isEmpty. Operand 0 states and 0 transitions. [2022-04-15 08:08:03,368 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-15 08:08:03,371 INFO L788 garLoopResultBuilder]: Registering result SAFE for location __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION (0 of 1 remaining) [2022-04-15 08:08:03,396 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (7)] Forceful destruction successful, exit code 0 [2022-04-15 08:08:03,588 WARN L460 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7,7 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-15 08:08:03,589 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends 0 states and 0 transitions. [2022-04-15 08:08:04,092 INFO L882 garLoopResultBuilder]: For program point reach_errorEXIT(line 12) no Hoare annotation was computed. [2022-04-15 08:08:04,092 INFO L882 garLoopResultBuilder]: For program point reach_errorENTRY(line 12) no Hoare annotation was computed. [2022-04-15 08:08:04,092 INFO L882 garLoopResultBuilder]: For program point L12-1(line 12) no Hoare annotation was computed. [2022-04-15 08:08:04,092 INFO L882 garLoopResultBuilder]: For program point L16(line 16) no Hoare annotation was computed. [2022-04-15 08:08:04,092 INFO L882 garLoopResultBuilder]: For program point L16-2(lines 15 17) no Hoare annotation was computed. [2022-04-15 08:08:04,092 INFO L882 garLoopResultBuilder]: For program point assume_abort_if_notENTRY(lines 15 17) no Hoare annotation was computed. [2022-04-15 08:08:04,092 INFO L882 garLoopResultBuilder]: For program point assume_abort_if_notEXIT(lines 15 17) no Hoare annotation was computed. [2022-04-15 08:08:04,093 INFO L885 garLoopResultBuilder]: At program point mainEXIT(lines 26 50) the Hoare annotation is: true [2022-04-15 08:08:04,093 INFO L885 garLoopResultBuilder]: At program point L48(line 48) the Hoare annotation is: true [2022-04-15 08:08:04,093 INFO L885 garLoopResultBuilder]: At program point mainFINAL(lines 26 50) the Hoare annotation is: true [2022-04-15 08:08:04,093 INFO L878 garLoopResultBuilder]: At program point L38(lines 38 47) the Hoare annotation is: (let ((.cse0 (= main_~A~0 main_~r~0)) (.cse1 (= main_~q~0 0))) (or (not (<= |old(~counter~0)| 0)) (and (<= 2 ~counter~0) .cse0 (<= 2 |main_#t~post3|) .cse1) (and .cse0 (= main_~B~0 main_~b~0) .cse1 (= main_~B~0 1)) (not (<= 0 |old(~counter~0)|)))) [2022-04-15 08:08:04,093 INFO L878 garLoopResultBuilder]: At program point L38-2(lines 38 47) 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-15 08:08:04,093 INFO L878 garLoopResultBuilder]: At program point L34-1(lines 34 37) the Hoare annotation is: (let ((.cse0 (= main_~A~0 main_~r~0)) (.cse1 (= main_~q~0 0))) (or (and (<= 2 ~counter~0) .cse0 .cse1) (not (<= |old(~counter~0)| 0)) (and (<= |main_#t~post2| 0) .cse0 (<= 1 ~counter~0) (= main_~B~0 main_~b~0) .cse1 (= main_~B~0 1)) (not (<= 0 |old(~counter~0)|)))) [2022-04-15 08:08:04,093 INFO L878 garLoopResultBuilder]: At program point L34-3(lines 34 37) the Hoare annotation is: (let ((.cse0 (= main_~A~0 main_~r~0)) (.cse1 (= main_~q~0 0))) (or (not (<= |old(~counter~0)| 0)) (and .cse0 (<= 0 ~counter~0) (= main_~B~0 main_~b~0) .cse1 (= main_~B~0 1)) (and .cse0 (<= 1 ~counter~0) .cse1) (not (<= 0 |old(~counter~0)|)))) [2022-04-15 08:08:04,093 INFO L878 garLoopResultBuilder]: At program point mainENTRY(lines 26 50) the Hoare annotation is: (or (not (<= |old(~counter~0)| 0)) (and (<= 0 ~counter~0) (<= ~counter~0 0)) (not (<= 0 |old(~counter~0)|))) [2022-04-15 08:08:04,093 INFO L878 garLoopResultBuilder]: At program point L43(lines 43 46) the Hoare annotation is: (or (not (<= |old(~counter~0)| 0)) (not (<= 0 |old(~counter~0)|))) [2022-04-15 08:08:04,094 INFO L878 garLoopResultBuilder]: At program point L43-2(lines 26 50) the Hoare annotation is: (let ((.cse0 (= main_~A~0 main_~r~0)) (.cse1 (= main_~q~0 0))) (or (and (<= 2 ~counter~0) .cse0 .cse1) (not (<= |old(~counter~0)| 0)) (and .cse0 (= main_~B~0 main_~b~0) .cse1 (= main_~B~0 1)) (not (<= 0 |old(~counter~0)|)))) [2022-04-15 08:08:04,094 INFO L878 garLoopResultBuilder]: At program point L39(line 39) the Hoare annotation is: (or (not (<= |old(~counter~0)| 0)) (and (= main_~A~0 main_~r~0) (= main_~B~0 main_~b~0) (= main_~q~0 0) (= main_~B~0 1)) (not (<= 0 |old(~counter~0)|))) [2022-04-15 08:08:04,094 INFO L878 garLoopResultBuilder]: At program point L39-1(lines 38 47) the Hoare annotation is: (or (not (<= |old(~counter~0)| 0)) (and (= main_~A~0 main_~r~0) (= main_~B~0 main_~b~0) (= main_~q~0 0) (= main_~B~0 1)) (not (<= 0 |old(~counter~0)|))) [2022-04-15 08:08:04,094 INFO L878 garLoopResultBuilder]: At program point L35(line 35) the Hoare annotation is: (let ((.cse0 (= main_~A~0 main_~r~0)) (.cse1 (= main_~q~0 0))) (or (and .cse0 (<= 1 ~counter~0) (= main_~B~0 main_~b~0) .cse1 (= main_~B~0 1)) (and (<= 2 ~counter~0) .cse0 .cse1) (not (<= |old(~counter~0)| 0)) (not (<= 0 |old(~counter~0)|)))) [2022-04-15 08:08:04,094 INFO L878 garLoopResultBuilder]: At program point ULTIMATE.initFINAL(line -1) the Hoare annotation is: (and (<= 0 ~counter~0) (<= ~counter~0 0)) [2022-04-15 08:08:04,094 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-15 08:08:04,094 INFO L878 garLoopResultBuilder]: At program point ULTIMATE.initEXIT(line -1) the Hoare annotation is: (and (<= 0 ~counter~0) (<= ~counter~0 0)) [2022-04-15 08:08:04,094 INFO L885 garLoopResultBuilder]: At program point ULTIMATE.startEXIT(line -1) the Hoare annotation is: true [2022-04-15 08:08:04,094 INFO L878 garLoopResultBuilder]: At program point L-1(line -1) the Hoare annotation is: (and (<= 0 ~counter~0) (<= ~counter~0 0)) [2022-04-15 08:08:04,094 INFO L885 garLoopResultBuilder]: At program point ULTIMATE.startENTRY(line -1) the Hoare annotation is: true [2022-04-15 08:08:04,095 INFO L885 garLoopResultBuilder]: At program point ULTIMATE.startFINAL(line -1) the Hoare annotation is: true [2022-04-15 08:08:04,095 INFO L878 garLoopResultBuilder]: At program point L19-2(lines 18 24) the Hoare annotation is: (or (not (<= 1 |__VERIFIER_assert_#in~cond|)) (<= 1 __VERIFIER_assert_~cond)) [2022-04-15 08:08:04,095 INFO L885 garLoopResultBuilder]: At program point __VERIFIER_assertENTRY(lines 18 24) the Hoare annotation is: true [2022-04-15 08:08:04,095 INFO L878 garLoopResultBuilder]: At program point __VERIFIER_assertEXIT(lines 18 24) the Hoare annotation is: (or (not (<= 1 |__VERIFIER_assert_#in~cond|)) (<= 1 __VERIFIER_assert_~cond)) [2022-04-15 08:08:04,095 INFO L878 garLoopResultBuilder]: At program point L20(lines 20 21) the Hoare annotation is: (not (<= 1 |__VERIFIER_assert_#in~cond|)) [2022-04-15 08:08:04,095 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-15 08:08:04,095 INFO L878 garLoopResultBuilder]: At program point __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION(line 21) the Hoare annotation is: (not (<= 1 |__VERIFIER_assert_#in~cond|)) [2022-04-15 08:08:04,098 INFO L719 BasicCegarLoop]: Path program histogram: [2, 2, 2, 2, 2, 2, 2, 2] [2022-04-15 08:08:04,099 INFO L177 ceAbstractionStarter]: Computing trace abstraction results [2022-04-15 08:08:04,102 WARN L170 areAnnotationChecker]: reach_errorENTRY has no Hoare annotation [2022-04-15 08:08:04,102 WARN L170 areAnnotationChecker]: reach_errorENTRY has no Hoare annotation [2022-04-15 08:08:04,108 WARN L170 areAnnotationChecker]: assume_abort_if_notENTRY has no Hoare annotation [2022-04-15 08:08:04,110 WARN L170 areAnnotationChecker]: L12-1 has no Hoare annotation [2022-04-15 08:08:04,111 WARN L170 areAnnotationChecker]: L16 has no Hoare annotation [2022-04-15 08:08:04,111 WARN L170 areAnnotationChecker]: L16 has no Hoare annotation [2022-04-15 08:08:04,116 WARN L170 areAnnotationChecker]: L16-2 has no Hoare annotation [2022-04-15 08:08:04,135 INFO L163 areAnnotationChecker]: CFG has 34 edges. 34 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. 0 times interpolants missing. [2022-04-15 08:08:04,153 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 15.04 08:08:04 BoogieIcfgContainer [2022-04-15 08:08:04,153 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2022-04-15 08:08:04,154 INFO L158 Benchmark]: Toolchain (without parser) took 9145.81ms. Allocated memory was 185.6MB in the beginning and 223.3MB in the end (delta: 37.7MB). Free memory was 133.6MB in the beginning and 171.3MB in the end (delta: -37.7MB). Peak memory consumption was 96.8MB. Max. memory is 8.0GB. [2022-04-15 08:08:04,154 INFO L158 Benchmark]: CDTParser took 0.11ms. Allocated memory is still 185.6MB. Free memory is still 149.9MB. There was no memory consumed. Max. memory is 8.0GB. [2022-04-15 08:08:04,155 INFO L158 Benchmark]: CACSL2BoogieTranslator took 224.48ms. Allocated memory was 185.6MB in the beginning and 223.3MB in the end (delta: 37.7MB). Free memory was 133.3MB in the beginning and 200.2MB in the end (delta: -66.8MB). Peak memory consumption was 8.3MB. Max. memory is 8.0GB. [2022-04-15 08:08:04,155 INFO L158 Benchmark]: Boogie Preprocessor took 31.75ms. Allocated memory is still 223.3MB. Free memory was 200.2MB in the beginning and 198.6MB in the end (delta: 1.6MB). Peak memory consumption was 1.0MB. Max. memory is 8.0GB. [2022-04-15 08:08:04,155 INFO L158 Benchmark]: RCFGBuilder took 271.76ms. Allocated memory is still 223.3MB. Free memory was 198.6MB in the beginning and 186.5MB in the end (delta: 12.1MB). Peak memory consumption was 12.6MB. Max. memory is 8.0GB. [2022-04-15 08:08:04,156 INFO L158 Benchmark]: TraceAbstraction took 8608.26ms. Allocated memory is still 223.3MB. Free memory was 186.0MB in the beginning and 171.3MB in the end (delta: 14.7MB). Peak memory consumption was 112.2MB. Max. memory is 8.0GB. [2022-04-15 08:08:04,158 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.11ms. Allocated memory is still 185.6MB. Free memory is still 149.9MB. There was no memory consumed. Max. memory is 8.0GB. * CACSL2BoogieTranslator took 224.48ms. Allocated memory was 185.6MB in the beginning and 223.3MB in the end (delta: 37.7MB). Free memory was 133.3MB in the beginning and 200.2MB in the end (delta: -66.8MB). Peak memory consumption was 8.3MB. Max. memory is 8.0GB. * Boogie Preprocessor took 31.75ms. Allocated memory is still 223.3MB. Free memory was 200.2MB in the beginning and 198.6MB in the end (delta: 1.6MB). Peak memory consumption was 1.0MB. Max. memory is 8.0GB. * RCFGBuilder took 271.76ms. Allocated memory is still 223.3MB. Free memory was 198.6MB in the beginning and 186.5MB in the end (delta: 12.1MB). Peak memory consumption was 12.6MB. Max. memory is 8.0GB. * TraceAbstraction took 8608.26ms. Allocated memory is still 223.3MB. Free memory was 186.0MB in the beginning and 171.3MB in the end (delta: 14.7MB). Peak memory consumption was 112.2MB. 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, 33 locations, 1 error locations. Started 1 CEGAR loops. OverallTime: 8.5s, OverallIterations: 8, TraceHistogramMax: 2, PathProgramHistogramMax: 2, EmptinessCheckTime: 0.0s, AutomataDifference: 3.7s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.5s, InitialAbstractionConstructionTime: 0.0s, PartialOrderReductionTime: 0.0s, HoareTripleCheckerStatistics: 1 mSolverCounterUnknown, 42 SdHoareTripleChecker+Valid, 2.2s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 40 mSDsluCounter, 463 SdHoareTripleChecker+Invalid, 2.2s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 285 mSDsCounter, 17 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 183 IncrementalHoareTripleChecker+Invalid, 201 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 17 mSolverCounterUnsat, 178 mSDtfsCounter, 183 mSolverCounterSat, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 159 GetRequests, 131 SyntacticMatches, 1 SemanticMatches, 27 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 8 ImplicationChecksByTransitivity, 0.2s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=35occurred in iteration=7, InterpolantAutomatonStates: 40, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s DumpTime, AutomataMinimizationStatistics: 0.2s AutomataMinimizationTime, 8 MinimizatonAttempts, 11 StatesRemovedByMinimization, 3 NontrivialMinimizations, HoareAnnotationStatistics: 0.0s HoareAnnotationTime, 26 LocationsWithAnnotation, 122 PreInvPairs, 160 NumberOfFragments, 330 HoareAnnotationTreeSize, 122 FomulaSimplifications, 3 FormulaSimplificationTreeSizeReduction, 0.0s HoareSimplificationTime, 26 FomulaSimplificationsInter, 239 FormulaSimplificationTreeSizeReductionInter, 0.4s 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: 34]: Loop Invariant Derived loop invariant: ((!(\old(counter) <= 0) || ((((A == r && 0 <= counter) && B == b) && q == 0) && B == 1)) || ((A == r && 1 <= counter) && q == 0)) || !(0 <= \old(counter)) - 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 <= \old(cond)) || 1 <= cond RESULT: Ultimate proved your program to be correct! [2022-04-15 08:08:04,196 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...